1 Isabelle NEWS -- history 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 * More static checking of proof methods, which allows the system to
19 form a closure over the concrete syntax. Method arguments should be
20 processed in the original proof context as far as possible, before
21 operating on the goal state. In any case, the standard discipline for
22 subgoal-addressing needs to be observed: no subgoals or a subgoal
23 number that is out of range produces an empty result sequence, not an
24 exception. Potential INCOMPATIBILITY for non-conformant tactical
27 * Lexical syntax (inner and outer) supports text cartouches with
28 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
29 supports input via ` (backquote).
31 * The outer syntax categories "text" (for formal comments and document
32 markup commands) and "altstring" (for literal fact references) allow
33 cartouches as well, in addition to the traditional mix of quotations.
35 * Syntax of document antiquotation @{rail} now uses \<newline> instead
36 of "\\", to avoid the optical illusion of escaped backslash within
37 string token. General renovation of its syntax using text cartouces.
38 Minor INCOMPATIBILITY.
40 * Discontinued legacy_isub_isup, which was a temporary workaround for
41 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts
42 old identifier syntax with \<^isub> or \<^isup>. Potential
45 * Document antiquotation @{url} produces markup for the given URL,
46 which results in an active hyperlink within the text.
48 * Document antiquotation @{file_unchecked} is like @{file}, but does
49 not check existence within the file-system.
51 * Updated and extended manuals: codegen, datatypes, implementation,
52 isar-ref, jedit, system.
55 *** Prover IDE -- Isabelle/Scala/jEdit ***
57 * Improved Document panel: simplied interaction where every single
58 mouse click (re)opens document via desktop environment or as jEdit
61 * Support for Navigator plugin (with toolbar buttons), with connection
64 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
65 Open text buffers take precedence over copies within the file-system.
67 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
70 * Improved syntactic and semantic completion mechanism, with simple
71 templates, completion language context, name-space completion,
72 file-name completion, spell-checker completion.
74 * Refined GUI popup for completion: more robust key/mouse event
75 handling and propagation to enclosing text area -- avoid loosing
76 keystrokes with slow / remote graphics displays.
78 * Refined insertion of completion items wrt. jEdit text: multiple
79 selections, rectangular selections, rectangular selection as "tall
82 * Integrated spell-checker for document text, comments etc. with
83 completion popup and context-menu.
85 * More general "Query" panel supersedes "Find" panel, with GUI access
86 to commands 'find_theorems' and 'find_consts', as well as print
87 operations for the context. Minor incompatibility in keyboard
88 shortcuts etc.: replace action isabelle-find by isabelle-query.
90 * Search field for all output panels ("Output", "Query", "Info" etc.)
91 to highlight text via regular expression.
93 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
94 General") allows to specify additional print modes for the prover
95 process, without requiring old-fashioned command-line invocation of
96 "isabelle jedit -m MODE".
98 * More support for remote files (e.g. http) using standard Java
99 networking operations instead of jEdit virtual file-systems.
101 * Improved Console/Scala plugin: more uniform scala.Console output,
102 more robust treatment of threads and interrupts.
104 * Improved management of dockable windows: clarified keyboard focus
105 and window placement wrt. main editor view; optional menu item to
106 "Detach" a copy where this makes sense.
108 * New Simplifier Trace panel provides an interactive view of the
109 simplification process, enabled by the "simplifier_trace" attribute
116 * Basic constants of Pure use more conventional names and are always
117 qualified. Rare INCOMPATIBILITY, but with potentially serious
118 consequences, notably for tools in Isabelle/ML. The following
119 renaming needs to be applied:
125 dummy_pattern ~> Pure.dummy_pattern
127 Systematic porting works by using the following theory setup on a
128 *previous* Isabelle version to introduce the new name accesses for the
134 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
135 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
136 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
137 |> Sign.restore_naming thy
140 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
141 Later the application is moved to the current Isabelle version, and
142 the auxiliary aliases are deleted.
144 * Low-level type-class commands 'classes', 'classrel', 'arities' have
145 been discontinued to avoid the danger of non-trivial axiomatization
146 that is not immediately visible. INCOMPATIBILITY, use regular
147 'instance' command with proof. The required OFCLASS(...) theorem
148 might be postulated via 'axiomatization' beforehand, or the proof
149 finished trivially if the underlying class definition is made vacuous
150 (without any assumptions). See also Isabelle/ML operations
151 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
152 Axclass.arity_axiomatization.
154 * Attributes "where" and "of" allow an optional context of local
155 variables ('for' declaration): these variables become schematic in the
156 instantiated theorem.
158 * Obsolete attribute "standard" has been discontinued (legacy since
159 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
160 where instantiations with schematic variables are intended (for
161 declaration commands like 'lemmas' or attributes like "of"). The
162 following temporary definition may help to port old applications:
164 attribute_setup standard =
165 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
167 * More thorough check of proof context for goal statements and
168 attributed fact expressions (concerning background theory, declared
169 hyps). Potential INCOMPATIBILITY, tools need to observe standard
170 context discipline. See also Assumption.add_assumes and the more
171 primitive Thm.assume_hyps.
173 * Inner syntax token language allows regular quoted strings "..."
174 (only makes sense in practice, if outer syntax is delimited
175 differently, e.g. via cartouches).
177 * Code generator preprocessor: explicit control of simp tracing on a
178 per-constant basis. See attribute "code_preproc".
180 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
181 but the latter is retained some time as Proof General legacy.
186 * Qualified String.implode and String.explode. INCOMPATIBILITY.
188 * Command and antiquotation "value" are now hardcoded against nbe and
189 ML. Minor INCOMPATIBILITY.
191 * Separate command "approximate" for approximative computation in
192 src/HOL/Decision_Procs/Approximation. Minor INCOMPATIBILITY.
194 * Adjustion of INF and SUP operations:
195 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
196 - Consolidated theorem names containing INFI and SUPR: have INF and
197 SUP instead uniformly.
198 - More aggressive normalization of expressions involving INF and Inf
200 - INF_image and SUP_image do not unfold composition.
201 - Dropped facts INF_comp, SUP_comp.
202 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
203 simplifier implication in premises. Generalize and replace former
208 * Revisions to HOL/Number_Theory
209 - consolidated the proofs of the binomial theorem
210 - the function fib is again of type nat=>nat and not overloaded
211 - no more references to Old_Number_Theory in the HOL libraries (except the AFP)
215 * Swapped orientation of facts image_comp and vimage_comp:
217 image_compose ~> image_comp [symmetric]
218 image_comp ~> image_comp [symmetric]
219 vimage_compose ~> vimage_comp [symmetric]
220 vimage_comp ~> vimage_comp [symmetric]
224 * Simplifier: Enhanced solver of preconditions of rewrite rules can
225 now deal with conjunctions. For help with converting proofs, the old
226 behaviour of the simplifier can be restored like this: declare/using
227 [[simp_legacy_precond]]. This configuration option will disappear
228 again in the future. INCOMPATIBILITY.
231 - Abandoned fact collection "word_arith_alts", which is a duplicate
233 - Dropped first (duplicated) element in fact collections
234 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
235 "uint_word_arith_bintrs".
237 * Code generator: enforce case of identifiers only for strict target
238 language requirements. INCOMPATIBILITY.
240 * Code generator: explicit proof contexts in many ML interfaces.
243 * Code generator: minimize exported identifiers by default. Minor
246 * Code generation for SML and OCaml: dropped arcane "no_signatures"
247 option. Minor INCOMPATIBILITY.
249 * Simproc "finite_Collect" is no longer enabled by default, due to
250 spurious crashes and other surprises. Potential INCOMPATIBILITY.
252 * Moved new (co)datatype package and its dependencies from session
253 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
254 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
255 part of theory "Main".
258 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
259 Library/Wfrec.thy ~> Wfrec.thy
260 Library/Zorn.thy ~> Zorn.thy
261 Cardinals/Order_Relation.thy ~> Order_Relation.thy
262 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
263 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
264 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
265 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
266 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
267 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
268 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
269 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
270 BNF/BNF_Comp.thy ~> BNF_Comp.thy
271 BNF/BNF_Def.thy ~> BNF_Def.thy
272 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
273 BNF/BNF_GFP.thy ~> BNF_GFP.thy
274 BNF/BNF_LFP.thy ~> BNF_LFP.thy
275 BNF/BNF_Util.thy ~> BNF_Util.thy
276 BNF/Coinduction.thy ~> Coinduction.thy
277 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
278 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
279 BNF/Examples/* ~> BNF_Examples/*
282 Wellorder_Extension.thy (split from Zorn.thy)
283 Library/Cardinal_Notations.thy
284 Library/BNF_Axomatization.thy
285 BNF_Examples/Misc_Primcorec.thy
286 BNF_Examples/Stream_Processor.thy
288 Discontinued theories:
290 BNF/Equiv_Relations_More.thy
294 * New (co)datatype package:
295 - Command 'primcorec' is fully implemented.
296 - Command 'datatype_new' generates size functions ("size_xxx" and
297 "size") as required by 'fun'.
298 - BNFs are integrated with the Lifting tool and new-style
299 (co)datatypes with Transfer.
301 datatype_new_compat ~> datatype_compat
302 primrec_new ~> primrec
303 wrap_free_constructors ~> free_constructors
305 - The generated constants "xxx_case" and "xxx_rec" have been renamed
306 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
308 - The constant "xxx_(un)fold" and related theorems are no longer
309 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
312 - No discriminators are generated for nullary constructors by
313 default, eliminating the need for the odd "=:" syntax.
315 - No discriminators or selectors are generated by default by
316 "datatype_new", unless custom names are specified or the new
317 "discs_sels" option is passed.
320 * Old datatype package:
321 - The generated theorems "xxx.cases" and "xxx.recs" have been
322 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
323 "sum.case"). INCOMPATIBILITY.
324 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
325 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
326 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
328 * The types "'a list" and "'a option", their set and map functions,
329 their relators, and their selectors are now produced using the new
330 BNF-based datatype package.
333 Option.set ~> set_option
334 Option.map ~> map_option
335 option_rel ~> rel_option
338 set_def ~> set_rec[abs_def]
339 map_def ~> map_rec[abs_def]
340 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
341 option.recs ~> option.rec
342 list_all2_def ~> list_all2_iff
343 set.simps ~> set_simps (or the slightly different "list.set")
344 map.simps ~> list.map
345 hd.simps ~> list.sel(1)
346 tl.simps ~> list.sel(2-3)
347 the.simps ~> option.sel
351 * The following map functions and relators have been renamed:
358 filter_rel ~> rel_filter
359 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
360 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
361 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
365 * New theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
367 * New theory src/HOL/Library/Tree.thy.
369 * Theory reorganization:
370 Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
372 * Consolidated some facts about big group operators:
374 setsum_0' ~> setsum.neutral
375 setsum_0 ~> setsum.neutral_const
376 setsum_addf ~> setsum.distrib
377 setsum_cartesian_product ~> setsum.cartesian_product
378 setsum_cases ~> setsum.If_cases
379 setsum_commute ~> setsum.commute
380 setsum_cong ~> setsum.cong
381 setsum_delta ~> setsum.delta
382 setsum_delta' ~> setsum.delta'
383 setsum_diff1' ~> setsum.remove
384 setsum_empty ~> setsum.empty
385 setsum_infinite ~> setsum.infinite
386 setsum_insert ~> setsum.insert
387 setsum_inter_restrict'' ~> setsum.inter_filter
388 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
389 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
390 setsum_mono_zero_left ~> setsum.mono_neutral_left
391 setsum_mono_zero_right ~> setsum.mono_neutral_right
392 setsum_reindex ~> setsum.reindex
393 setsum_reindex_cong ~> setsum.reindex_cong
394 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
395 setsum_restrict_set ~> setsum.inter_restrict
396 setsum_Plus ~> setsum.Plus
397 setsum_setsum_restrict ~> setsum.commute_restrict
398 setsum_Sigma ~> setsum.Sigma
399 setsum_subset_diff ~> setsum.subset_diff
400 setsum_Un_disjoint ~> setsum.union_disjoint
401 setsum_UN_disjoint ~> setsum.UNION_disjoint
402 setsum_Un_Int ~> setsum.union_inter
403 setsum_Union_disjoint ~> setsum.Union_disjoint
404 setsum_UNION_zero ~> setsum.Union_comp
405 setsum_Un_zero ~> setsum.union_inter_neutral
406 strong_setprod_cong ~> setprod.strong_cong
407 strong_setsum_cong ~> setsum.strong_cong
408 setprod_1' ~> setprod.neutral
409 setprod_1 ~> setprod.neutral_const
410 setprod_cartesian_product ~> setprod.cartesian_product
411 setprod_cong ~> setprod.cong
412 setprod_delta ~> setprod.delta
413 setprod_delta' ~> setprod.delta'
414 setprod_empty ~> setprod.empty
415 setprod_infinite ~> setprod.infinite
416 setprod_insert ~> setprod.insert
417 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
418 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
419 setprod_mono_one_left ~> setprod.mono_neutral_left
420 setprod_mono_one_right ~> setprod.mono_neutral_right
421 setprod_reindex ~> setprod.reindex
422 setprod_reindex_cong ~> setprod.reindex_cong
423 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
424 setprod_Sigma ~> setprod.Sigma
425 setprod_subset_diff ~> setprod.subset_diff
426 setprod_timesf ~> setprod.distrib
427 setprod_Un2 ~> setprod.union_diff2
428 setprod_Un_disjoint ~> setprod.union_disjoint
429 setprod_UN_disjoint ~> setprod.UNION_disjoint
430 setprod_Un_Int ~> setprod.union_inter
431 setprod_Union_disjoint ~> setprod.Union_disjoint
432 setprod_Un_one ~> setprod.union_inter_neutral
434 Dropped setsum_cong2 (simple variant of setsum.cong).
435 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
436 Dropped setsum_reindex_id, setprod_reindex_id
437 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
441 * New internal SAT solver "cdclite" that produces models and proof
442 traces. This solver replaces the internal SAT solvers "enumerate" and
443 "dpll". Applications that explicitly used one of these two SAT
444 solvers should use "cdclite" instead. In addition, "cdclite" is now
445 the default SAT solver for the "sat" and "satx" proof methods and
446 corresponding tactics; the old default can be restored using "declare
447 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
449 * SMT module: A new version of the SMT module, temporarily called
450 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
451 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
452 supported as oracles. Yices is no longer supported, because no version
453 of the solver can handle both SMT-LIB 2 and quantifiers.
456 - Z3 can now produce Isar proofs.
458 . New SML-based learning engines eliminate the dependency on
459 Python and increase performance and reliability.
460 . MaSh and MeSh are now used by default together with the
461 traditional MePo (Meng-Paulson) relevance filter. To disable
462 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
463 Options / Isabelle / General to "none".
467 isar_compress ~> compress
472 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
473 (full_types)' instead. INCOMPATIBILITY.
475 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
477 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
479 * The symbol "\<newline>" may be used within char or string literals
480 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
482 * Activation of Z3 now works via "z3_non_commercial" system option
483 (without requiring restart), instead of former settings variable
484 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
485 Plugin Options / Isabelle / General.
487 * "declare [[code abort: ...]]" replaces "code_abort ...".
490 * "declare [[code drop: ...]]" drops all code equations associated
491 with the given constants.
493 * Abolished slightly odd global lattice interpretation for min/max.
496 min_max.inf_assoc ~> min.assoc
497 min_max.inf_commute ~> min.commute
498 min_max.inf_left_commute ~> min.left_commute
499 min_max.inf_idem ~> min.idem
500 min_max.inf_left_idem ~> min.left_idem
501 min_max.inf_right_idem ~> min.right_idem
502 min_max.sup_assoc ~> max.assoc
503 min_max.sup_commute ~> max.commute
504 min_max.sup_left_commute ~> max.left_commute
505 min_max.sup_idem ~> max.idem
506 min_max.sup_left_idem ~> max.left_idem
507 min_max.sup_inf_distrib1 ~> max_min_distrib2
508 min_max.sup_inf_distrib2 ~> max_min_distrib1
509 min_max.inf_sup_distrib1 ~> min_max_distrib2
510 min_max.inf_sup_distrib2 ~> min_max_distrib1
511 min_max.distrib ~> min_max_distribs
512 min_max.inf_absorb1 ~> min.absorb1
513 min_max.inf_absorb2 ~> min.absorb2
514 min_max.sup_absorb1 ~> max.absorb1
515 min_max.sup_absorb2 ~> max.absorb2
516 min_max.le_iff_inf ~> min.absorb_iff1
517 min_max.le_iff_sup ~> max.absorb_iff2
518 min_max.inf_le1 ~> min.cobounded1
519 min_max.inf_le2 ~> min.cobounded2
520 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
521 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
522 min_max.le_infI1 ~> min.coboundedI1
523 min_max.le_infI2 ~> min.coboundedI2
524 min_max.le_supI1 ~> max.coboundedI1
525 min_max.le_supI2 ~> max.coboundedI2
526 min_max.less_infI1 ~> min.strict_coboundedI1
527 min_max.less_infI2 ~> min.strict_coboundedI2
528 min_max.less_supI1 ~> max.strict_coboundedI1
529 min_max.less_supI2 ~> max.strict_coboundedI2
530 min_max.inf_mono ~> min.mono
531 min_max.sup_mono ~> max.mono
532 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
533 min_max.le_supI, min_max.sup_least ~> max.boundedI
534 min_max.le_inf_iff ~> min.bounded_iff
535 min_max.le_sup_iff ~> max.bounded_iff
537 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
538 min.left_commute, min.left_idem, max.commute, max.assoc,
539 max.left_commute, max.left_idem directly.
541 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
542 min.cobounded2, max.cobounded1m max.cobounded2 directly.
544 For min_ac or max_ac, prefer more general collection ac_simps.
548 * HOL-Word: bit representations prefer type bool over type bit.
551 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
552 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
554 * Code generations are provided for make, fields, extend and truncate
555 operations on records.
557 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
560 * Fact generalization and consolidation:
561 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
565 * Purely algebraic definition of even. Fact generalization and
567 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
568 even_zero_(nat|int) ~> even_zero
572 * Abolished neg_numeral.
573 - Canonical representation for minus one is "- 1".
574 - Canonical representation for other negative numbers is "- (numeral _)".
575 - When devising rule sets for number calculation, consider the
576 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
577 - HOLogic.dest_number also recognizes numerals in non-canonical forms
578 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
579 - Syntax for negative numerals is mere input syntax.
583 * Elimination of fact duplicates:
584 equals_zero_I ~> minus_unique
585 diff_eq_0_iff_eq ~> right_minus_eq
586 nat_infinite ~> infinite_UNIV_nat
587 int_infinite ~> infinite_UNIV_int
591 * Fact name consolidation:
592 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
593 minus_le_self_iff ~> neg_less_eq_nonneg
594 le_minus_self_iff ~> less_eq_neg_nonpos
595 neg_less_nonneg ~> neg_less_pos
596 less_minus_self_iff ~> less_neg_neg [simp]
600 * More simplification rules on unary and binary minus:
601 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
602 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
603 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
604 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
605 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
606 been taken away from fact collections algebra_simps and field_simps.
609 To restore proofs, the following patterns are helpful:
611 a) Arbitrary failing proof not involving "diff_def":
612 Consider simplification with algebra_simps or field_simps.
614 b) Lifting rules from addition to subtraction:
615 Try with "using <rule for addition> of [... "- _" ...]" by simp".
617 c) Simplification with "diff_def": just drop "diff_def".
618 Consider simplification with algebra_simps or field_simps;
619 or the brute way with
620 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
622 * SUP and INF generalized to conditionally_complete_lattice.
624 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
625 Conditionally_Complete_Lattices. INCOMPATIBILITY.
627 * Introduce bdd_above and bdd_below in theory
628 Conditionally_Complete_Lattices, use them instead of explicitly
629 stating boundedness of sets.
631 * ccpo.admissible quantifies only over non-empty chains to allow more
632 syntax-directed proof rules; the case of the empty chain shows up as
633 additional case in fixpoint induction proofs. INCOMPATIBILITY.
635 * Removed and renamed theorems in Series:
636 summable_le ~> suminf_le
637 suminf_le ~> suminf_le_const
638 series_pos_le ~> setsum_le_suminf
639 series_pos_less ~> setsum_less_suminf
640 suminf_ge_zero ~> suminf_nonneg
641 suminf_gt_zero ~> suminf_pos
642 suminf_gt_zero_iff ~> suminf_pos_iff
643 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
644 suminf_0_le ~> suminf_nonneg [rotate]
645 pos_summable ~> summableI_nonneg_bounded
646 ratio_test ~> summable_ratio_test
648 removed series_zero, replaced by sums_finite
650 removed auxiliary lemmas:
652 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
653 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
654 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
655 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
656 summable_convergent_sumr_iff, sumr_diff_mult_const
660 * Replace (F)DERIV syntax by has_derivative:
661 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
663 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
665 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
667 - removed constant isDiff
669 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
672 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
674 - Renamed FDERIV_... lemmas to has_derivative_...
676 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
678 - removed DERIV_intros, has_derivative_eq_intros
680 - introduced derivative_intros and deriative_eq_intros which
681 includes now rules for DERIV, has_derivative and
682 has_vector_derivative.
685 differentiable_def ~> real_differentiable_def
686 differentiableE ~> real_differentiableE
687 fderiv_def ~> has_derivative_at
688 field_fderiv_def ~> field_has_derivative_at
689 isDiff_der ~> differentiable_def
690 deriv_fderiv ~> has_field_derivative_def
691 deriv_def ~> DERIV_def
695 * Include more theorems in continuous_intros. Remove the
696 continuous_on_intros, isCont_intros collections, these facts are now
697 in continuous_intros.
699 * Theorems about complex numbers are now stated only using Re and Im,
700 the Complex constructor is not used anymore. It is possible to use
701 primcorec to defined the behaviour of a complex-valued function.
703 Removed theorems about the Complex constructor from the simpset, they
704 are available as the lemma collection legacy_Complex_simps. This
707 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
709 Instead the reverse direction is supported with
710 Complex_eq: "Complex a b = a + \<i> * b"
712 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
716 complex_Re/Im_zero ~> zero_complex.sel
717 complex_Re/Im_add ~> plus_complex.sel
718 complex_Re/Im_minus ~> uminus_complex.sel
719 complex_Re/Im_diff ~> minus_complex.sel
720 complex_Re/Im_one ~> one_complex.sel
721 complex_Re/Im_mult ~> times_complex.sel
722 complex_Re/Im_inverse ~> inverse_complex.sel
723 complex_Re/Im_scaleR ~> scaleR_complex.sel
724 complex_Re/Im_i ~> ii.sel
725 complex_Re/Im_cnj ~> cnj.sel
728 complex_divide_def ~> divide_complex_def
729 complex_norm_def ~> norm_complex_def
730 cmod_def ~> norm_complex_de
744 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
747 - Fixed soundness bug whereby mutually recursive datatypes could
748 take infinite values.
749 - Fixed soundness bug with low-level number functions such as
750 "Abs_Integ" and "Rep_Integ".
751 - Removed "std" option.
752 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
755 * HOL-Multivariate_Analysis:
756 - Type class ordered_real_vector for ordered vector spaces.
757 - New theory Complex_Basic_Analysis defining complex derivatives,
758 holomorphic functions, etc., ported from HOL Light's canal.ml.
759 - Changed order of ordered_euclidean_space to be compatible with
760 pointwise ordering on products. Therefore instance of
761 conditionally_complete_lattice and ordered_real_vector.
762 INCOMPATIBILITY: use box instead of greaterThanLessThan or
763 explicit set-comprehensions with eucl_less for other (half-)open
765 - removed dependencies on type class ordered_euclidean_space with
766 introduction of "cbox" on euclidean_space
769 mem_interval ~> mem_box
770 interval_eq_empty ~> box_eq_empty
771 interval_ne_empty ~> box_ne_empty
772 interval_sing(1) ~> cbox_sing
773 interval_sing(2) ~> box_sing
774 subset_interval_imp ~> subset_box_imp
775 subset_interval ~> subset_box
776 open_interval ~> open_box
777 closed_interval ~> closed_cbox
778 interior_closed_interval ~> interior_cbox
779 bounded_closed_interval ~> bounded_cbox
780 compact_interval ~> compact_cbox
781 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
782 bounded_subset_closed_interval ~> bounded_subset_cbox
783 mem_interval_componentwiseI ~> mem_box_componentwiseI
784 convex_box ~> convex_prod
785 rel_interior_real_interval ~> rel_interior_real_box
786 convex_interval ~> convex_box
787 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
788 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
789 content_closed_interval' ~> content_cbox'
790 elementary_subset_interval ~> elementary_subset_box
791 diameter_closed_interval ~> diameter_cbox
792 frontier_closed_interval ~> frontier_cbox
793 frontier_open_interval ~> frontier_box
794 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
795 closure_open_interval ~> closure_box
796 open_closed_interval_convex ~> open_cbox_convex
797 open_interval_midpoint ~> box_midpoint
798 content_image_affinity_interval ~> content_image_affinity_cbox
799 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
800 bounded_interval ~> bounded_closed_interval + bounded_boxes
802 - respective theorems for intervals over the reals:
803 content_closed_interval + content_cbox
804 has_integral + has_integral_real
805 fine_division_exists + fine_division_exists_real
806 has_integral_null + has_integral_null_real
807 tagged_division_union_interval + tagged_division_union_interval_real
808 has_integral_const + has_integral_const_real
809 integral_const + integral_const_real
810 has_integral_bound + has_integral_bound_real
811 integrable_continuous + integrable_continuous_real
812 integrable_subinterval + integrable_subinterval_real
813 has_integral_reflect_lemma + has_integral_reflect_lemma_real
814 integrable_reflect + integrable_reflect_real
815 integral_reflect + integral_reflect_real
816 image_affinity_interval + image_affinity_cbox
817 image_smult_interval + image_smult_cbox
818 integrable_const + integrable_const_ivl
819 integrable_on_subinterval + integrable_on_subcbox
822 derivative_linear ~> has_derivative_bounded_linear
823 derivative_is_linear ~> has_derivative_linear
824 bounded_linear_imp_linear ~> bounded_linear.linear
827 - replaced the Lebesgue integral on real numbers by the more general
828 Bochner integral for functions into a real-normed vector space.
830 integral_zero ~> integral_zero / integrable_zero
831 integral_minus ~> integral_minus / integrable_minus
832 integral_add ~> integral_add / integrable_add
833 integral_diff ~> integral_diff / integrable_diff
834 integral_setsum ~> integral_setsum / integrable_setsum
835 integral_multc ~> integral_mult_left / integrable_mult_left
836 integral_cmult ~> integral_mult_right / integrable_mult_right
837 integral_triangle_inequality~> integral_norm_bound
838 integrable_nonneg ~> integrableI_nonneg
839 integral_positive ~> integral_nonneg_AE
840 integrable_abs_iff ~> integrable_abs_cancel
841 positive_integral_lim_INF ~> positive_integral_liminf
842 lebesgue_real_affine ~> lborel_real_affine
843 borel_integral_has_integral ~> has_integral_lebesgue_integral
844 integral_indicator ~>
845 integral_real_indicator / integrable_real_indicator
846 positive_integral_fst ~> positive_integral_fst'
847 positive_integral_fst_measurable ~> positive_integral_fst
848 positive_integral_snd_measurable ~> positive_integral_snd
850 integrable_fst_measurable ~>
851 integral_fst / integrable_fst / AE_integrable_fst
853 integrable_snd_measurable ~>
854 integral_snd / integrable_snd / AE_integrable_snd
856 integral_monotone_convergence ~>
857 integral_monotone_convergence / integrable_monotone_convergence
859 integral_monotone_convergence_at_top ~>
860 integral_monotone_convergence_at_top /
861 integrable_monotone_convergence_at_top
863 has_integral_iff_positive_integral_lebesgue ~>
864 has_integral_iff_has_bochner_integral_lebesgue_nonneg
866 lebesgue_integral_has_integral ~>
867 has_integral_integrable_lebesgue_nonneg
869 positive_integral_lebesgue_has_integral ~>
870 integral_has_integral_lebesgue_nonneg /
871 integrable_has_integral_lebesgue_nonneg
873 lebesgue_integral_real_affine ~>
874 positive_integral_real_affine
876 has_integral_iff_positive_integral_lborel ~>
877 integral_has_integral_nonneg / integrable_has_integral_nonneg
879 The following theorems where removed:
881 lebesgue_integral_nonneg
882 lebesgue_integral_uminus
883 lebesgue_integral_cmult
884 lebesgue_integral_multc
885 lebesgue_integral_cmult_nonneg
886 integral_cmul_indicator
889 - Renamed positive_integral to nn_integral:
891 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
892 positive_integral_positive ~> nn_integral_nonneg
894 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
896 - Formalized properties about exponentially, Erlang, and normal
897 distributed random variables.
899 * Removed theory src/HOL/Library/Kleene_Algebra.thy; it is subsumed by
900 session Kleene_Algebra in AFP.
905 * The signature and semantics of Document.Snapshot.cumulate_markup /
906 select_markup have been clarified. Markup is now traversed in the
907 order of reports given by the prover: later markup is usually more
908 specific and may override results accumulated so far. The elements
909 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
911 * Substantial reworking of internal PIDE protocol communication
912 channels. INCOMPATIBILITY.
917 * Moved ML_Compiler.exn_trace and other operations on exceptions to
918 structure Runtime. Minor INCOMPATIBILITY.
920 * Discontinued old Toplevel.debug in favour of system option
921 "ML_exception_trace", which may be also declared within the context
922 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
924 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
927 * Configuration option "ML_print_depth" controls the pretty-printing
928 depth of the ML compiler within the context. The old print_depth in
929 ML is still available as default_print_depth, but rarely used. Minor
932 * Proper context discipline for read_instantiate and instantiate_tac:
933 variables that are meant to become schematic need to be given as
934 fixed, and are generalized by the explicit context of local variables.
935 This corresponds to Isar attributes "where" and "of" with 'for'
936 declaration. INCOMPATIBILITY, also due to potential change of indices
937 of schematic variables.
939 * Toplevel function "use" refers to raw ML bootstrap environment,
940 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
941 Note that 'ML_file' is the canonical command to load ML files into the
944 * Proper context for basic Simplifier operations: rewrite_rule,
945 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
946 pass runtime Proof.context (and ensure that the simplified entity
947 actually belongs to it).
949 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
950 compared (according to Thm.thm_ord), but assumed to be covered by the
951 current background theory. Thus equivalent data produced in different
952 branches of the theory graph usually coincides (e.g. relevant for
953 theory merge). Note that the softer Thm.eq_thm_prop is often more
954 appropriate than Thm.eq_thm.
956 * Simplified programming interface to define ML antiquotations, see
957 structure ML_Antiquotation. Minor INCOMPATIBILITY.
959 * ML antiquotation @{here} refers to its source position, which is
960 occasionally useful for experimentation and diagnostic purposes.
962 * ML antiquotation @{path} produces a Path.T value, similarly to
963 Path.explode, but with compile-time check against the file-system and
964 some PIDE markup. Note that unlike theory source, ML does not have a
965 well-defined master directory, so an absolute symbolic path
966 specification is usually required, e.g. "~~/src/HOL".
968 * ML antiquotation @{print} inlines a function to print an arbitrary
969 ML value, which is occasionally useful for diagnostic or demonstration
975 * Proof General with its traditional helper scripts is now an optional
976 Isabelle component, e.g. ProofGeneral-4.2-2 from the Isabelle
977 component repository http://isabelle.in.tum.de/components/. See also
978 the "system" manual for general explanations about add-on components,
979 notably those that are not bundled with the normal release.
981 * The raw Isabelle process executable has been renamed from
982 "isabelle-process" to "isabelle_process", which conforms to common
983 shell naming conventions, and allows to define a shell function within
984 the Isabelle environment to avoid dynamic path lookup. Rare
985 incompatibility for old tools that do not use the $ISABELLE_PROCESS
986 settings variable yet.
988 * Former "isabelle tty" has been superseded by "isabelle console",
989 with implicit build like "isabelle jedit", and without the mostly
990 obsolete Isar TTY loop.
992 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
993 and PDF_VIEWER now refer to the actual programs, not shell
994 command-lines. Discontinued option -c: invocation may be asynchronous
995 via desktop environment, without any special precautions. Potential
996 INCOMPATIBILITY with ambitious private settings.
998 * Removed obsolete "isabelle unsymbolize". Note that the usual format
999 for email communication is the Unicode rendering of Isabelle symbols,
1000 as produced by Isabelle/jEdit, for example.
1002 * Removed obsolete tool "wwwfind". Similar functionality may be
1003 integrated into Isabelle/jEdit eventually.
1005 * Improved 'display_drafts' concerning desktop integration and
1006 repeated invocation in PIDE front-end: re-use single file
1007 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1009 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1010 of TeX Live from Cygwin.
1012 * Session ROOT specifications require explicit 'document_files' for
1013 robust dependencies on LaTeX sources. Only these explicitly given
1014 files are copied to the document output directory, before document
1015 processing is started.
1019 New in Isabelle2013-2 (December 2013)
1020 -------------------------------------
1022 *** Prover IDE -- Isabelle/Scala/jEdit ***
1024 * More robust editing of running commands with internal forks,
1025 e.g. non-terminating 'by' steps.
1027 * More relaxed Sledgehammer panel: avoid repeated application of query
1028 after edits surrounding the command location.
1030 * More status information about commands that are interrupted
1031 accidentally (via physical event or Poly/ML runtime system signal,
1032 e.g. out-of-memory).
1037 * More robust termination of external processes managed by
1038 Isabelle/ML: support cancellation of tasks within the range of
1039 milliseconds, as required for PIDE document editing with automatically
1040 tried tools (e.g. Sledgehammer).
1042 * Reactivated Isabelle/Scala kill command for external processes on
1043 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1044 workaround for some Debian/Ubuntu Linux versions from 2013.
1048 New in Isabelle2013-1 (November 2013)
1049 -------------------------------------
1053 * Discontinued obsolete 'uses' within theory header. Note that
1054 commands like 'ML_file' work without separate declaration of file
1055 dependencies. Minor INCOMPATIBILITY.
1057 * Discontinued redundant 'use' command, which was superseded by
1058 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1060 * Simplified subscripts within identifiers, using plain \<^sub>
1061 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1062 only for literal tokens within notation; explicit mixfix annotations
1063 for consts or fixed variables may be used as fall-back for unusual
1064 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1065 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1066 standardize symbols as a starting point for further manual cleanup.
1067 The ML reference variable "legacy_isub_isup" may be set as temporary
1068 workaround, to make the prover accept a subset of the old identifier
1071 * Document antiquotations: term style "isub" has been renamed to
1072 "sub". Minor INCOMPATIBILITY.
1074 * Uniform management of "quick_and_dirty" as system option (see also
1075 "isabelle options"), configuration option within the context (see also
1076 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1077 INCOMPATIBILITY, need to use more official Isabelle means to access
1078 quick_and_dirty, instead of historical poking into mutable reference.
1080 * Renamed command 'print_configs' to 'print_options'. Minor
1083 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1084 implicit change of some global references) is retained for now as
1085 control command, e.g. for ProofGeneral 3.7.x.
1087 * Discontinued 'print_drafts' command with its old-fashioned PS output
1088 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1089 'display_drafts' instead and print via the regular document viewer.
1091 * Updated and extended "isar-ref" and "implementation" manual,
1092 eliminated old "ref" manual.
1095 *** Prover IDE -- Isabelle/Scala/jEdit ***
1097 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1098 Documentation panel.
1100 * Dockable window "Documentation" provides access to Isabelle
1103 * Dockable window "Find" provides query operations for formal entities
1104 (GUI front-end to 'find_theorems' command).
1106 * Dockable window "Sledgehammer" manages asynchronous / parallel
1107 sledgehammer runs over existing document sources, independently of
1108 normal editing and checking process.
1110 * Dockable window "Timing" provides an overview of relevant command
1111 timing information, depending on option jedit_timing_threshold. The
1112 same timing information is shown in the extended tooltip of the
1113 command keyword, when hovering the mouse over it while the CONTROL or
1114 COMMAND modifier is pressed.
1116 * Improved dockable window "Theories": Continuous checking of proof
1117 document (visible and required parts) may be controlled explicitly,
1118 using check box or shortcut "C+e ENTER". Individual theory nodes may
1119 be marked explicitly as required and checked in full, using check box
1120 or shortcut "C+e SPACE".
1122 * Improved completion mechanism, which is now managed by the
1123 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1124 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1126 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1127 isabelle.complete for explicit completion in Isabelle sources.
1128 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1129 to resolve conflict.
1131 * Improved support of various "minor modes" for Isabelle NEWS,
1132 options, session ROOT etc., with completion and SideKick tree view.
1134 * Strictly monotonic document update, without premature cancellation of
1135 running transactions that are still needed: avoid reset/restart of
1136 such command executions while editing.
1138 * Support for asynchronous print functions, as overlay to existing
1141 * Support for automatic tools in HOL, which try to prove or disprove
1142 toplevel theorem statements.
1144 * Action isabelle.reset-font-size resets main text area font size
1145 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1146 also "Plugin Options / Isabelle / General"). It can be bound to some
1147 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1149 * File specifications in jEdit (e.g. file browser) may refer to
1150 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1151 obsolete $ISABELLE_HOME_WINDOWS variable.
1153 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1154 / Global Options / Appearance".
1156 * Improved support of native Mac OS X functionality via "MacOSX"
1157 plugin, which is now enabled by default.
1162 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1163 In particular, 'interpretation' allows for non-persistent
1164 interpretation within "context ... begin ... end" blocks offering a
1165 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1168 * Improved locales diagnostic command 'print_dependencies'.
1170 * Discontinued obsolete 'axioms' command, which has been marked as
1171 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1172 instead, while observing its uniform scope for polymorphism.
1174 * Discontinued empty name bindings in 'axiomatization'.
1177 * System option "proofs" has been discontinued. Instead the global
1178 state of Proofterm.proofs is persistently compiled into logic images
1179 as required, notably HOL-Proofs. Users no longer need to change
1180 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1182 * Syntax translation functions (print_translation etc.) always depend
1183 on Proof.context. Discontinued former "(advanced)" option -- this is
1184 now the default. Minor INCOMPATIBILITY.
1186 * Former global reference trace_unify_fail is now available as
1187 configuration option "unify_trace_failure" (global context only).
1189 * SELECT_GOAL now retains the syntactic context of the overall goal
1190 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1196 * Stronger precedence of syntax for big intersection and union on
1197 sets, in accordance with corresponding lattice operations.
1200 * Notation "{p:A. P}" now allows tuple patterns as well.
1202 * Nested case expressions are now translated in a separate check phase
1203 rather than during parsing. The data for case combinators is separated
1204 from the datatype package. The declaration attribute
1205 "case_translation" can be used to register new case combinators:
1207 declare [[case_translation case_combinator constructor1 ... constructorN]]
1210 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1212 - 'code_identifier' declares name hints for arbitrary identifiers in
1213 generated code, subsuming 'code_modulename'.
1215 See the isar-ref manual for syntax diagrams, and the HOL theories for
1218 * Attibute 'code': 'code' now declares concrete and abstract code
1219 equations uniformly. Use explicit 'code equation' and 'code abstract'
1220 to distinguish both when desired.
1222 * Discontinued theories Code_Integer and Efficient_Nat by a more
1223 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1224 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1225 generation for details. INCOMPATIBILITY.
1227 * Numeric types are mapped by default to target language numerals:
1228 natural (replaces former code_numeral) and integer (replaces former
1229 code_int). Conversions are available as integer_of_natural /
1230 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1231 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1232 ML). INCOMPATIBILITY.
1234 * Function package: For mutually recursive functions f and g, separate
1235 cases rules f.cases and g.cases are generated instead of unusable
1236 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1237 in the case that the unusable rule was used nevertheless.
1239 * Function package: For each function f, new rules f.elims are
1240 generated, which eliminate equalities of the form "f x = t".
1242 * New command 'fun_cases' derives ad-hoc elimination rules for
1243 function equations as simplified instances of f.elims, analogous to
1244 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1247 - parametrized correspondence relations are now supported:
1248 + parametricity theorems for the raw term can be specified in
1249 the command lift_definition, which allow us to generate stronger
1251 + setup_lifting generates stronger transfer rules if parametric
1252 correspondence relation can be generated
1253 + various new properties of the relator must be specified to support
1255 + parametricity theorem for the Quotient relation can be specified
1256 - setup_lifting generates domain rules for the Transfer package
1257 - stronger reflexivity prover of respectfulness theorems for type
1259 - ===> and --> are now local. The symbols can be introduced
1260 by interpreting the locale lifting_syntax (typically in an
1262 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1263 Main. Potential INCOMPATIBILITY
1264 - new commands for restoring and deleting Lifting/Transfer context:
1265 lifting_forget, lifting_update
1266 - the command print_quotmaps was renamed to print_quot_maps.
1270 - better support for domains in Transfer: replace Domainp T
1271 by the actual invariant in a transferred goal
1272 - transfer rules can have as assumptions other transfer rules
1273 - Experimental support for transferring from the raw level to the
1274 abstract level: Transfer.transferred attribute
1275 - Attribute version of the transfer method: untransferred attribute
1277 * Reification and reflection:
1278 - Reification is now directly available in HOL-Main in structure
1280 - Reflection now handles multiple lists with variables also.
1281 - The whole reflection stack has been decomposed into conversions.
1284 * Revised devices for recursive definitions over finite sets:
1285 - Only one fundamental fold combinator on finite set remains:
1286 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1287 This is now identity on infinite sets.
1288 - Locales ("mini packages") for fundamental definitions with
1289 Finite_Set.fold: folding, folding_idem.
1290 - Locales comm_monoid_set, semilattice_order_set and
1291 semilattice_neutr_order_set for big operators on sets.
1292 See theory Big_Operators for canonical examples.
1293 Note that foundational constants comm_monoid_set.F and
1294 semilattice_set.F correspond to former combinators fold_image
1295 and fold1 respectively. These are now gone. You may use
1296 those foundational constants as substitutes, but it is
1297 preferable to interpret the above locales accordingly.
1298 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1299 no longer needed in connection with Finite_Set.fold etc.)
1301 card.union_inter ~> card_Un_Int [symmetric]
1302 card.union_disjoint ~> card_Un_disjoint
1305 * Locale hierarchy for abstract orderings and (semi)lattices.
1307 * Complete_Partial_Order.admissible is defined outside the type class
1308 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1309 class predicate assumption or sort constraint when possible.
1312 * Introduce type class "conditionally_complete_lattice": Like a
1313 complete lattice but does not assume the existence of the top and
1314 bottom elements. Allows to generalize some lemmas about reals and
1315 extended reals. Removed SupInf and replaced it by the instantiation
1316 of conditionally_complete_lattice for real. Renamed lemmas about
1317 conditionally-complete lattice from Sup_... to cSup_... and from
1318 Inf_... to cInf_... to avoid hidding of similar complete lattice
1321 * Introduce type class linear_continuum as combination of
1322 conditionally-complete lattices and inner dense linorders which have
1323 more than one element. INCOMPATIBILITY.
1325 * Introduced type classes order_top and order_bot. The old classes top
1326 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1327 Rename bot -> order_bot, top -> order_top
1329 * Introduce type classes "no_top" and "no_bot" for orderings without
1330 top and bottom elements.
1332 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1334 * Complex_Main: Unify and move various concepts from
1335 HOL-Multivariate_Analysis to HOL-Complex_Main.
1337 - Introduce type class (lin)order_topology and
1338 linear_continuum_topology. Allows to generalize theorems about
1339 limits and order. Instances are reals and extended reals.
1341 - continuous and continuos_on from Multivariate_Analysis:
1342 "continuous" is the continuity of a function at a filter. "isCont"
1343 is now an abbrevitation: "isCont x f == continuous (at _) f".
1345 Generalized continuity lemmas from isCont to continuous on an
1348 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1349 compactness of closed intervals on reals. Continuous functions
1350 attain infimum and supremum on compact sets. The inverse of a
1351 continuous function is continuous, when the function is continuous
1354 - connected from Multivariate_Analysis. Use it to prove the
1355 intermediate value theorem. Show connectedness of intervals on
1356 linear_continuum_topology).
1358 - first_countable_topology from Multivariate_Analysis. Is used to
1359 show equivalence of properties on the neighbourhood filter of x and
1360 on all sequences converging to x.
1362 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1363 theorems from Library/FDERIV.thy to Deriv.thy and base the
1364 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1365 which are restricted to sets, i.e. to represent derivatives from
1368 - Removed the within-filter. It is replaced by the principal filter:
1370 F within X = inf F (principal X)
1372 - Introduce "at x within U" as a single constant, "at x" is now an
1373 abbreviation for "at x within UNIV"
1375 - Introduce named theorem collections tendsto_intros,
1376 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1377 in tendsto_intros (or FDERIV_intros) are also available as
1378 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1379 is replaced by a congruence rule. This allows to apply them as
1380 intro rules and then proving equivalence by the simplifier.
1382 - Restructured theories in HOL-Complex_Main:
1384 + Moved RealDef and RComplete into Real
1386 + Introduced Topological_Spaces and moved theorems about
1387 topological spaces, filters, limits and continuity to it
1389 + Renamed RealVector to Real_Vector_Spaces
1391 + Split Lim, SEQ, Series into Topological_Spaces,
1392 Real_Vector_Spaces, and Limits
1394 + Moved Ln and Log to Transcendental
1396 + Moved theorems about continuity from Deriv to Topological_Spaces
1398 - Remove various auxiliary lemmas.
1403 - Added option "spy".
1404 - Reduce incidence of "too high arity" errors.
1408 isar_shrink ~> isar_compress
1410 - Added options "isar_try0", "spy".
1411 - Better support for "isar_proofs".
1412 - MaSh has been fined-tuned and now runs as a local server.
1414 * Improved support for ad hoc overloading of constants (see also
1415 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1417 * Library/Polynomial.thy:
1418 - Use lifting for primitive definitions.
1419 - Explicit conversions from and to lists of coefficients, used for
1421 - Replaced recursion operator poly_rec by fold_coeffs.
1422 - Prefer pre-existing gcd operation for gcd.
1424 poly_eq_iff ~> poly_eq_poly_eq_iff
1425 poly_ext ~> poly_eqI
1426 expand_poly_eq ~> poly_eq_iff
1429 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1430 case_of_simps to convert function definitions between a list of
1431 equations with patterns on the lhs and a single equation with case
1432 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1434 * New Library/FSet.thy: type of finite sets defined as a subtype of
1435 sets defined by Lifting/Transfer.
1437 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1439 * Consolidation of library theories on product orders:
1441 Product_Lattice ~> Product_Order -- pointwise order on products
1442 Product_ord ~> Product_Lexorder -- lexicographic order on products
1446 * Imperative-HOL: The MREC combinator is considered legacy and no
1447 longer included by default. INCOMPATIBILITY, use partial_function
1448 instead, or import theory Legacy_Mrec as a fallback.
1450 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1451 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1452 ~~/src/HOL/Library/Polynomial instead. The latter provides
1453 integration with HOL's type classes for rings. INCOMPATIBILITY.
1456 - Various improvements to BNF-based (co)datatype package, including
1457 new commands "primrec_new", "primcorec", and
1458 "datatype_new_compat", as well as documentation. See
1459 "datatypes.pdf" for details.
1460 - New "coinduction" method to avoid some boilerplate (compared to
1463 data ~> datatype_new
1464 codata ~> codatatype
1466 - Renamed many generated theorems, including
1468 map_comp' ~> map_comp
1478 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1479 "check_property" allows to check specifications of the form "ALL x y
1480 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1481 Examples.thy in particular.
1483 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1484 tracing output in the command transaction context instead of physical
1485 stdout. See also Toplevel.debug, Toplevel.debugging and
1486 ML_Compiler.exn_trace.
1488 * ML type "theory" is now immutable, without any special treatment of
1489 drafts or linear updates (which could lead to "stale theory" errors in
1490 the past). Discontinued obsolete operations like Theory.copy,
1491 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1494 * More uniform naming of goal functions for skipped proofs:
1496 Skip_Proof.prove ~> Goal.prove_sorry
1497 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1499 Minor INCOMPATIBILITY.
1501 * Simplifier tactics and tools use proper Proof.context instead of
1502 historic type simpset. Old-style declarations like addsimps,
1503 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1504 retains its use as snapshot of the main Simplifier context, using
1505 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1506 old tools by making them depend on (ctxt : Proof.context) instead of
1507 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1509 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1510 operate on Proof.context instead of claset, for uniformity with addIs,
1511 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1512 clasets separately from the context.
1514 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1515 INCOMPATIBILITY, use @{context} instead.
1517 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1518 presents the result as initial Proof.context.
1523 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1524 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1526 * Discontinued obsolete isabelle-process options -f and -u (former
1527 administrative aliases of option -e). Minor INCOMPATIBILITY.
1529 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1532 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1533 document formats: dvi.gz, ps, ps.gz -- the default document format is
1536 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1537 specify global resources of the JVM process run by isabelle build.
1539 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1540 to run Isabelle/Scala source files as standalone programs.
1542 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1543 keyword tables): use Isabelle/Scala operations, which inspect outer
1544 syntax without requiring to build sessions first.
1546 * Sessions may be organized via 'chapter' specifications in the ROOT
1547 file, which determines a two-level hierarchy of browser info. The old
1548 tree-like organization via implicit sub-session relation (with its
1549 tendency towards erratic fluctuation of URLs) has been discontinued.
1550 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1551 for HTML presentation of theories.
1555 New in Isabelle2013 (February 2013)
1556 -----------------------------------
1560 * Theorem status about oracles and unfinished/failed future proofs is
1561 no longer printed by default, since it is incompatible with
1562 incremental / parallel checking of the persistent document model. ML
1563 function Thm.peek_status may be used to inspect a snapshot of the
1564 ongoing evaluation process. Note that in batch mode --- notably
1565 isabelle build --- the system ensures that future proofs of all
1566 accessible theorems in the theory context are finished (as before).
1568 * Configuration option show_markup controls direct inlining of markup
1569 into the printed representation of formal entities --- notably type
1570 and sort constraints. This enables Prover IDE users to retrieve that
1571 information via tooltips in the output window, for example.
1573 * Command 'ML_file' evaluates ML text from a file directly within the
1574 theory, without any predeclaration via 'uses' in the theory header.
1576 * Old command 'use' command and corresponding keyword 'uses' in the
1577 theory header are legacy features and will be discontinued soon.
1578 Tools that load their additional source files may imitate the
1579 'ML_file' implementation, such that the system can take care of
1580 dependencies properly.
1582 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1583 is called fastforce / fast_force_tac already since Isabelle2011-1.
1585 * Updated and extended "isar-ref" and "implementation" manual, reduced
1586 remaining material in old "ref" manual.
1588 * Improved support for auxiliary contexts that indicate block structure
1589 for specifications. Nesting of "context fixes ... context assumes ..."
1590 and "class ... context ...".
1592 * Attribute "consumes" allows a negative value as well, which is
1593 interpreted relatively to the total number of premises of the rule in
1594 the target context. This form of declaration is stable when exported
1595 from a nested 'context' with additional assumptions. It is the
1596 preferred form for definitional packages, notably cases/rules produced
1597 in HOL/inductive and HOL/function.
1599 * More informative error messages for Isar proof commands involving
1600 lazy enumerations (method applications etc.).
1602 * Refined 'help' command to retrieve outer syntax commands according
1603 to name patterns (with clickable results).
1606 *** Prover IDE -- Isabelle/Scala/jEdit ***
1608 * Parallel terminal proofs ('by') are enabled by default, likewise
1609 proofs that are built into packages like 'datatype', 'function'. This
1610 allows to "run ahead" checking the theory specifications on the
1611 surface, while the prover is still crunching on internal
1612 justifications. Unfinished / cancelled proofs are restarted as
1613 required to complete full proof checking eventually.
1615 * Improved output panel with tooltips, hyperlinks etc. based on the
1616 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1617 tooltips leads to some window that supports the same recursively,
1618 which can lead to stacks of tooltips as the semantic document content
1619 is explored. ESCAPE closes the whole stack, individual windows may be
1620 closed separately, or detached to become independent jEdit dockables.
1622 * Improved support for commands that produce graph output: the text
1623 message contains a clickable area to open a new instance of the graph
1626 * More robust incremental parsing of outer syntax (partial comments,
1627 malformed symbols). Changing the balance of open/close quotes and
1628 comment delimiters works more conveniently with unfinished situations
1629 that frequently occur in user interaction.
1631 * More efficient painting and improved reactivity when editing large
1632 files. More scalable management of formal document content.
1634 * Smarter handling of tracing messages: prover process pauses after
1635 certain number of messages per command transaction, with some user
1636 dialog to stop or continue. This avoids swamping the front-end with
1637 potentially infinite message streams.
1639 * More plugin options and preferences, based on Isabelle/Scala. The
1640 jEdit plugin option panel provides access to some Isabelle/Scala
1641 options, including tuning parameters for editor reactivity and color
1644 * Dockable window "Symbols" provides some editing support for Isabelle
1647 * Dockable window "Monitor" shows ML runtime statistics. Note that
1648 continuous display of the chart slows down the system.
1650 * Improved editing support for control styles: subscript, superscript,
1651 bold, reset of style -- operating on single symbols or text
1652 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1654 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1655 adjust the main text area font size, and its derivatives for output,
1656 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1657 need to be adapted to local keyboard layouts.
1659 * More reactive completion popup by default: use \t (TAB) instead of
1660 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1661 also "Plugin Options / SideKick / General / Code Completion Options".
1663 * Implicit check and build dialog of the specified logic session
1664 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1665 demand, without bundling big platform-dependent heap images in the
1666 Isabelle distribution.
1668 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1669 from Oracle provide better multi-platform experience. This version is
1670 now bundled exclusively with Isabelle.
1675 * Code generation for Haskell: restrict unqualified imports from
1676 Haskell Prelude to a small set of fundamental operations.
1678 * Command 'export_code': relative file names are interpreted
1679 relatively to master directory of current theory rather than the
1680 rather arbitrary current working directory. INCOMPATIBILITY.
1682 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1683 use regular rule composition via "OF" / "THEN", or explicit proof
1684 structure instead. Note that Isabelle/ML provides a variety of
1685 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1686 with some care where this is really required.
1688 * Command 'typ' supports an additional variant with explicit sort
1689 constraint, to infer and check the most general type conforming to a
1690 given sort. Example (in HOL):
1692 typ "_ * _ * bool * unit" :: finite
1694 * Command 'locale_deps' visualizes all locales and their relations as
1702 - Added MaSh relevance filter based on machine-learning; see the
1703 Sledgehammer manual for details.
1704 - Polished Isar proofs generated with "isar_proofs" option.
1705 - Rationalized type encodings ("type_enc" option).
1706 - Renamed "kill_provers" subcommand to "kill_all".
1708 isar_proof ~> isar_proofs
1709 isar_shrink_factor ~> isar_shrink
1710 max_relevant ~> max_facts
1711 relevance_thresholds ~> fact_thresholds
1713 * Quickcheck: added an optimisation for equality premises. It is
1714 switched on by default, and can be switched off by setting the
1715 configuration quickcheck_optimise_equality to false.
1717 * Quotient: only one quotient can be defined by quotient_type
1721 - generation of an abstraction function equation in lift_definition
1722 - quot_del attribute
1723 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1725 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1728 * Preprocessing of the code generator rewrites set comprehensions into
1729 pointfree expressions.
1731 * The SMT solver Z3 has now by default a restricted set of directly
1732 supported features. For the full set of features (div/mod, nonlinear
1733 arithmetic, datatypes/records) with potential proof reconstruction
1734 failures, enable the configuration option "z3_with_extensions". Minor
1737 * Simplified 'typedef' specifications: historical options for implicit
1738 set definition and alternative name have been discontinued. The
1739 former behavior of "typedef (open) t = A" is now the default, but
1740 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1743 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1744 directly. INCOMPATIBILITY.
1746 * Moved operation product, sublists and n_lists from theory Enum to
1747 List. INCOMPATIBILITY.
1749 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1751 * Class "comm_monoid_diff" formalises properties of bounded
1752 subtraction, with natural numbers and multisets as typical instances.
1754 * Added combinator "Option.these" with type "'a option set => 'a set".
1756 * Theory "Transitive_Closure": renamed lemmas
1758 reflcl_tranclp -> reflclp_tranclp
1759 rtranclp_reflcl -> rtranclp_reflclp
1763 * Theory "Rings": renamed lemmas (in class semiring)
1765 left_distrib ~> distrib_right
1766 right_distrib ~> distrib_left
1770 * Generalized the definition of limits:
1772 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1773 expresses that when the input values x converge to F then the
1774 output f x converges to G.
1776 - Added filters for convergence to positive (at_top) and negative
1779 - Moved infinity in the norm (at_infinity) from
1780 Multivariate_Analysis to Complex_Main.
1782 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1787 * Theory "Library/Option_ord" provides instantiation of option type to
1788 lattice type classes.
1790 * Theory "Library/Multiset": renamed
1792 constant fold_mset ~> Multiset.fold
1793 fact fold_mset_commute ~> fold_mset_comm
1797 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1800 - Renamed constants (and related lemmas)
1803 strict_prefix ~> prefix
1805 - Replaced constant "postfix" by "suffixeq" with swapped argument
1806 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1807 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1808 Renamed lemmas accordingly.
1810 - Added constant "list_hembeq" for homeomorphic embedding on
1811 lists. Added abbreviation "sublisteq" for special case
1812 "list_hembeq (op =)".
1814 - Theory Library/Sublist no longer provides "order" and "bot" type
1815 class instances for the prefix order (merely corresponding locale
1816 interpretations). The type class instances are now in theory
1817 Library/Prefix_Order.
1819 - The sublist relation of theory Library/Sublist_Order is now based
1820 on "Sublist.sublisteq". Renamed lemmas accordingly:
1822 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1823 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1824 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1825 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1826 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1827 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1828 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1829 le_list_drop_many ~> Sublist.sublisteq_drop_many
1830 le_list_filter_left ~> Sublist.sublisteq_filter_left
1831 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1832 le_list_rev_take_iff ~> Sublist.sublisteq_append
1833 le_list_same_length ~> Sublist.sublisteq_same_length
1834 le_list_take_many_iff ~> Sublist.sublisteq_append'
1835 less_eq_list.drop ~> less_eq_list_drop
1836 less_eq_list.induct ~> less_eq_list_induct
1837 not_le_list_length ~> Sublist.not_sublisteq_length
1841 * New theory Library/Countable_Set.
1843 * Theory Library/Debug and Library/Parallel provide debugging and
1844 parallel execution for code generated towards Isabelle/ML.
1846 * Theory Library/FuncSet: Extended support for Pi and extensional and
1847 introduce the extensional dependent function space "PiE". Replaced
1848 extensional_funcset by an abbreviation, and renamed lemmas from
1849 extensional_funcset to PiE as follows:
1851 extensional_empty ~> PiE_empty
1852 extensional_funcset_empty_domain ~> PiE_empty_domain
1853 extensional_funcset_empty_range ~> PiE_empty_range
1854 extensional_funcset_arb ~> PiE_arb
1855 extensional_funcset_mem ~> PiE_mem
1856 extensional_funcset_extend_domainI ~> PiE_fun_upd
1857 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1858 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1859 card_extensional_funcset ~> card_PiE
1860 finite_extensional_funcset ~> finite_PiE
1864 * Theory Library/FinFun: theory of almost everywhere constant
1865 functions (supersedes the AFP entry "Code Generation for Functions as
1868 * Theory Library/Phantom: generic phantom type to make a type
1869 parameter appear in a constant's type. This alternative to adding
1870 TYPE('a) as another parameter avoids unnecessary closures in generated
1873 * Theory Library/RBT_Impl: efficient construction of red-black trees
1874 from sorted associative lists. Merging two trees with rbt_union may
1875 return a structurally different tree than before. Potential
1878 * Theory Library/IArray: immutable arrays with code generation.
1880 * Theory Library/Finite_Lattice: theory of finite lattices.
1882 * HOL/Multivariate_Analysis: replaced
1884 "basis :: 'a::euclidean_space => nat => real"
1885 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1887 on euclidean spaces by using the inner product "_ \<bullet> _" with
1888 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1889 "SUM i : Basis. f i * r i".
1891 With this change the following constants are also changed or removed:
1893 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1894 a $$ i ~> inner a i (where i : Basis)
1896 \<pi>, \<pi>' removed
1898 Theorems about these constants where removed.
1902 component_le_norm ~> Basis_le_norm
1903 euclidean_eq ~> euclidean_eq_iff
1904 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1905 euclidean_simps ~> inner_simps
1906 independent_basis ~> independent_Basis
1907 span_basis ~> span_Basis
1908 in_span_basis ~> in_span_Basis
1909 norm_bound_component_le ~> norm_boound_Basis_le
1910 norm_bound_component_lt ~> norm_boound_Basis_lt
1911 component_le_infnorm ~> Basis_le_infnorm
1917 - Added simproc "measurable" to automatically prove measurability.
1919 - Added induction rules for sigma sets with disjoint union
1920 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1921 (borel_measurable_induct).
1923 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1926 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1927 AFP entry "Ordinals_and_Cardinals").
1929 * HOL/BNF: New (co)datatype package based on bounded natural functors
1930 with support for mixed, nested recursion and interesting non-free
1933 * HOL/Finite_Set and Relation: added new set and relation operations
1934 expressed by Finite_Set.fold.
1936 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1937 trees for the code generator.
1939 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1941 possible INCOMPATIBILITY.
1943 * HOL/Set: renamed Set.project -> Set.filter
1947 *** Document preparation ***
1949 * Dropped legacy antiquotations "term_style" and "thm_style", since
1950 styles may be given as arguments to "term" and "thm" already.
1951 Discontinued legacy styles "prem1" .. "prem19".
1953 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1954 instead of slightly exotic babel/greek.
1956 * Document variant NAME may use different LaTeX entry point
1957 document/root_NAME.tex if that file exists, instead of the common
1960 * Simplified custom document/build script, instead of old-style
1961 document/IsaMakefile. Minor INCOMPATIBILITY.
1966 * The default limit for maximum number of worker threads is now 8,
1967 instead of 4, in correspondence to capabilities of contemporary
1968 hardware and Poly/ML runtime system.
1970 * Type Seq.results and related operations support embedded error
1971 messages within lazy enumerations, and thus allow to provide
1972 informative errors in the absence of any usable results.
1974 * Renamed Position.str_of to Position.here to emphasize that this is a
1975 formal device to inline positions into message text, but not
1976 necessarily printing visible text.
1981 * Advanced support for Isabelle sessions and build management, see
1982 "system" manual for the chapter of that name, especially the "isabelle
1983 build" tool and its examples. The "isabelle mkroot" tool prepares
1984 session root directories for use with "isabelle build", similar to
1985 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1986 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1987 mkdir / make are rendered obsolete.
1989 * Discontinued obsolete Isabelle/build script, it is superseded by the
1990 regular isabelle build tool. For example:
1992 isabelle build -s -b HOL
1994 * Discontinued obsolete "isabelle makeall".
1996 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1997 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1998 provides some traditional targets that invoke "isabelle build". Note
1999 that this is inefficient! Applications of Isabelle/HOL involving
2000 "isabelle make" should be upgraded to use "isabelle build" directly.
2002 * The "isabelle options" tool prints Isabelle system options, as
2003 required for "isabelle build", for example.
2005 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2006 Minor INCOMPATIBILITY in command-line options.
2008 * The "isabelle install" tool has now a simpler command-line. Minor
2011 * The "isabelle components" tool helps to resolve add-on components
2012 that are not bundled, or referenced from a bare-bones repository
2013 version of Isabelle.
2015 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2016 platform family: "linux", "macos", "windows".
2018 * The ML system is configured as regular component, and no longer
2019 picked up from some surrounding directory. Potential INCOMPATIBILITY
2020 for home-made settings.
2022 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2024 * Discontinued support for Poly/ML 5.2.1, which was the last version
2025 without exception positions and advanced ML compiler/toplevel
2028 * Discontinued special treatment of Proof General -- no longer guess
2029 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2030 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2031 settings manually, or use a Proof General version that has been
2032 bundled as Isabelle component.
2036 New in Isabelle2012 (May 2012)
2037 ------------------------------
2041 * Prover IDE (PIDE) improvements:
2043 - more robust Sledgehammer integration (as before the sledgehammer
2044 command-line needs to be typed into the source buffer)
2045 - markup for bound variables
2046 - markup for types of term variables (displayed as tooltips)
2047 - support for user-defined Isar commands within the running session
2048 - improved support for Unicode outside original 16bit range
2049 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2051 * Forward declaration of outer syntax keywords within the theory
2052 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2053 commands to be used in the same theory where defined.
2055 * Auxiliary contexts indicate block structure for specifications with
2056 additional parameters and assumptions. Such unnamed contexts may be
2057 nested within other targets, like 'theory', 'locale', 'class',
2058 'instantiation' etc. Results from the local context are generalized
2059 accordingly and applied to the enclosing target context. Example:
2063 assumes xy: "x = y" and yz: "y = z"
2066 lemma my_trans: "x = z" using xy yz by simp
2072 The most basic application is to factor-out context elements of
2073 several fixes/assumes/shows theorem statements, e.g. see
2074 ~~/src/HOL/Isar_Examples/Group_Context.thy
2076 Any other local theory specification element works within the "context
2077 ... begin ... end" block as well.
2079 * Bundled declarations associate attributed fact expressions with a
2080 given name in the context. These may be later included in other
2081 contexts. This allows to manage context extensions casually, without
2082 the logical dependencies of locales and locale interpretation. See
2083 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2085 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2086 declaration, and results are standardized before being stored. Thus
2087 old-style "standard" after instantiation or composition of facts
2088 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2089 indices of schematic variables.
2091 * Rule attributes in local theory declarations (e.g. locale or class)
2092 are now statically evaluated: the resulting theorem is stored instead
2093 of the original expression. INCOMPATIBILITY in rare situations, where
2094 the historic accident of dynamic re-evaluation in interpretations
2097 * New tutorial "Programming and Proving in Isabelle/HOL"
2098 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2099 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2100 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2101 Logic" as the recommended beginners tutorial, but does not cover all
2102 of the material of that old tutorial.
2104 * Updated and extended reference manuals: "isar-ref",
2105 "implementation", "system"; reduced remaining material in old "ref"
2111 * Command 'definition' no longer exports the foundational "raw_def"
2112 into the user context. Minor INCOMPATIBILITY, may use the regular
2113 "def" result with attribute "abs_def" to imitate the old version.
2115 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2116 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2117 expand it. This also works for object-logic equality. (Formerly
2118 undocumented feature.)
2120 * Sort constraints are now propagated in simultaneous statements, just
2121 like type constraints. INCOMPATIBILITY in rare situations, where
2122 distinct sorts used to be assigned accidentally. For example:
2124 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2126 lemma "P (x::'a)" and "Q (y::'a::bar)"
2127 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2129 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2130 tolerant against multiple unifiers, as long as the final result is
2131 unique. (As before, rules are composed in canonical right-to-left
2132 order to accommodate newly introduced premises.)
2134 * Renamed some inner syntax categories:
2140 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2141 "num_position" etc. are mainly used instead (which also include
2142 position information via constraints).
2144 * Simplified configuration options for syntax ambiguity: see
2145 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2146 manual. Minor INCOMPATIBILITY.
2148 * Discontinued configuration option "syntax_positions": atomic terms
2149 in parse trees are always annotated by position constraints.
2151 * Old code generator for SML and its commands 'code_module',
2152 'code_library', 'consts_code', 'types_code' have been discontinued.
2153 Use commands of the generic code generator instead. INCOMPATIBILITY.
2155 * Redundant attribute "code_inline" has been discontinued. Use
2156 "code_unfold" instead. INCOMPATIBILITY.
2158 * Dropped attribute "code_unfold_post" in favor of the its dual
2159 "code_abbrev", which yields a common pattern in definitions like
2161 definition [code_abbrev]: "f = t"
2165 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2166 instead. INCOMPATIBILITY.
2168 * Discontinued old "prems" fact, which used to refer to the accidental
2169 collection of foundational premises in the context (already marked as
2170 legacy since Isabelle2011).
2175 * Type 'a set is now a proper type constructor (just as before
2176 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2177 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2178 sets separate, it is often sufficient to rephrase some set S that has
2179 been accidentally used as predicates by "%x. x : S", and some
2180 predicate P that has been accidentally used as set by "{x. P x}".
2181 Corresponding proofs in a first step should be pruned from any
2182 tinkering with former theorems mem_def and Collect_def as far as
2185 For developments which deliberately mix predicates and sets, a
2186 planning step is necessary to determine what should become a predicate
2187 and what a set. It can be helpful to carry out that step in
2188 Isabelle2011-1 before jumping right into the current release.
2190 * Code generation by default implements sets as container type rather
2191 than predicates. INCOMPATIBILITY.
2193 * New type synonym 'a rel = ('a * 'a) set
2195 * The representation of numerals has changed. Datatype "num"
2196 represents strictly positive binary numerals, along with functions
2197 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2198 positive and negated numeric literals, respectively. See also
2199 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2200 user theories may require adaptations as follows:
2202 - Theorems with number_ring or number_semiring constraints: These
2203 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2205 - Theories defining numeric types: Remove number, number_semiring,
2206 and number_ring instances. Defer all theorems about numerals until
2207 after classes one and semigroup_add have been instantiated.
2209 - Numeral-only simp rules: Replace each rule having a "number_of v"
2210 pattern with two copies, one for numeral and one for neg_numeral.
2212 - Theorems about subclasses of semiring_1 or ring_1: These classes
2213 automatically support numerals now, so more simp rules and
2214 simprocs may now apply within the proof.
2216 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2217 Redefine using other integer operations.
2219 * Transfer: New package intended to generalize the existing
2220 "descending" method and related theorem attributes from the Quotient
2221 package. (Not all functionality is implemented yet, but future
2222 development will focus on Transfer as an eventual replacement for the
2223 corresponding parts of the Quotient package.)
2225 - transfer_rule attribute: Maintains a collection of transfer rules,
2226 which relate constants at two different types. Transfer rules may
2227 relate different type instances of the same polymorphic constant,
2228 or they may relate an operation on a raw type to a corresponding
2229 operation on an abstract type (quotient or subtype). For example:
2231 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2232 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2234 - transfer method: Replaces a subgoal on abstract types with an
2235 equivalent subgoal on the corresponding raw types. Constants are
2236 replaced with corresponding ones according to the transfer rules.
2237 Goals are generalized over all free variables by default; this is
2238 necessary for variables whose types change, but can be overridden
2239 for specific variables with e.g. "transfer fixing: x y z". The
2240 variant transfer' method allows replacing a subgoal with one that
2241 is logically stronger (rather than equivalent).
2243 - relator_eq attribute: Collects identity laws for relators of
2244 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2245 transfer method uses these lemmas to infer transfer rules for
2246 non-polymorphic constants on the fly.
2248 - transfer_prover method: Assists with proving a transfer rule for a
2249 new constant, provided the constant is defined in terms of other
2250 constants that already have transfer rules. It should be applied
2251 after unfolding the constant definitions.
2253 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2254 from type nat to type int.
2256 * Lifting: New package intended to generalize the quotient_definition
2257 facility of the Quotient package; designed to work with Transfer.
2259 - lift_definition command: Defines operations on an abstract type in
2260 terms of a corresponding operation on a representation
2261 type. Example syntax:
2263 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2266 Users must discharge a respectfulness proof obligation when each
2267 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2268 the proof is discharged automatically.) The obligation is
2269 presented in a user-friendly, readable form; a respectfulness
2270 theorem in the standard format and a transfer rule are generated
2273 - Integration with code_abstype: For typedefs (e.g. subtypes
2274 corresponding to a datatype invariant, such as dlist),
2275 lift_definition generates a code certificate theorem and sets up
2276 code generation for each constant.
2278 - setup_lifting command: Sets up the Lifting package to work with a
2279 user-defined type. The user must provide either a quotient theorem
2280 or a type_definition theorem. The package configures transfer
2281 rules for equality and quantifiers on the type, and sets up the
2282 lift_definition command to work with the type.
2284 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2285 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2286 Word/Word.thy and Library/Float.thy.
2290 - The 'quotient_type' command now supports a 'morphisms' option with
2291 rep and abs functions, similar to typedef.
2293 - 'quotient_type' sets up new types to work with the Lifting and
2294 Transfer packages, as with 'setup_lifting'.
2296 - The 'quotient_definition' command now requires the user to prove a
2297 respectfulness property at the point where the constant is
2298 defined, similar to lift_definition; INCOMPATIBILITY.
2300 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2301 accordingly, INCOMPATIBILITY.
2303 * New diagnostic command 'find_unused_assms' to find potentially
2304 superfluous assumptions in theorems using Quickcheck.
2308 - Quickcheck returns variable assignments as counterexamples, which
2309 allows to reveal the underspecification of functions under test.
2310 For example, refuting "hd xs = x", it presents the variable
2311 assignment xs = [] and x = a1 as a counterexample, assuming that
2312 any property is false whenever "hd []" occurs in it.
2314 These counterexample are marked as potentially spurious, as
2315 Quickcheck also returns "xs = []" as a counterexample to the
2316 obvious theorem "hd xs = hd xs".
2318 After finding a potentially spurious counterexample, Quickcheck
2319 continues searching for genuine ones.
2321 By default, Quickcheck shows potentially spurious and genuine
2322 counterexamples. The option "genuine_only" sets quickcheck to only
2323 show genuine counterexamples.
2325 - The command 'quickcheck_generator' creates random and exhaustive
2326 value generators for a given type and operations.
2328 It generates values by using the operations as if they were
2329 constructors of that type.
2331 - Support for multisets.
2333 - Added "use_subtype" options.
2335 - Added "quickcheck_locale" configuration to specify how to process
2336 conjectures in a locale context.
2338 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2339 and affecting 'rat' and 'real'.
2342 - Integrated more tightly with SPASS, as described in the ITP 2012
2343 paper "More SPASS with Isabelle".
2344 - Made it try "smt" as a fallback if "metis" fails or times out.
2345 - Added support for the following provers: Alt-Ergo (via Why3 and
2346 TFF1), iProver, iProver-Eq.
2347 - Sped up the minimizer.
2348 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2349 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2350 - Renamed "sound" option to "strict".
2352 * Metis: Added possibility to specify lambda translations scheme as a
2353 parenthesized argument (e.g., "by (metis (lifting) ...)").
2355 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2357 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2359 * New "case_product" attribute to generate a case rule doing multiple
2360 case distinctions at the same time. E.g.
2362 list.exhaust [case_product nat.exhaust]
2364 produces a rule which can be used to perform case distinction on both
2367 * New "eventually_elim" method as a generalized variant of the
2368 eventually_elim* rules. Supports structured proofs.
2370 * Typedef with implicit set definition is considered legacy. Use
2371 "typedef (open)" form instead, which will eventually become the
2374 * Record: code generation can be switched off manually with
2376 declare [[record_coden = false]] -- "default true"
2378 * Datatype: type parameters allow explicit sort constraints.
2380 * Concrete syntax for case expressions includes constraints for source
2381 positions, and thus produces Prover IDE markup for its bindings.
2382 INCOMPATIBILITY for old-style syntax translations that augment the
2383 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2386 * Clarified attribute "mono_set": pure declaration without modifying
2387 the result of the fact expression.
2389 * More default pred/set conversions on a couple of relation operations
2390 and predicates. Added powers of predicate relations. Consolidation
2391 of some relation theorems:
2393 converse_def ~> converse_unfold
2394 rel_comp_def ~> relcomp_unfold
2395 symp_def ~> (modified, use symp_def and sym_def instead)
2396 transp_def ~> transp_trans
2397 Domain_def ~> Domain_unfold
2398 Range_def ~> Domain_converse [symmetric]
2400 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2402 See theory "Relation" for examples for making use of pred/set
2403 conversions by means of attributes "to_set" and "to_pred".
2407 * Renamed facts about the power operation on relations, i.e., relpow
2408 to match the constant's name:
2410 rel_pow_1 ~> relpow_1
2411 rel_pow_0_I ~> relpow_0_I
2412 rel_pow_Suc_I ~> relpow_Suc_I
2413 rel_pow_Suc_I2 ~> relpow_Suc_I2
2414 rel_pow_0_E ~> relpow_0_E
2415 rel_pow_Suc_E ~> relpow_Suc_E
2416 rel_pow_E ~> relpow_E
2417 rel_pow_Suc_D2 ~> relpow_Suc_D2
2418 rel_pow_Suc_E2 ~> relpow_Suc_E2
2419 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2420 rel_pow_E2 ~> relpow_E2
2421 rel_pow_add ~> relpow_add
2422 rel_pow_commute ~> relpow
2423 rel_pow_empty ~> relpow_empty:
2424 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2425 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2426 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2427 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2428 rel_pow_fun_conv ~> relpow_fun_conv
2429 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2430 rel_pow_finite_bounded ~> relpow_finite_bounded
2431 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2432 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2433 single_valued_rel_pow ~> single_valued_relpow
2437 * Theory Relation: Consolidated constant name for relation composition
2438 and corresponding theorem names:
2440 - Renamed constant rel_comp to relcomp.
2442 - Dropped abbreviation pred_comp. Use relcompp instead.
2446 rel_compI ~> relcompI
2447 rel_compEpair ~> relcompEpair
2448 rel_compE ~> relcompE
2449 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2450 rel_comp_empty1 ~> relcomp_empty1
2451 rel_comp_mono ~> relcomp_mono
2452 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2453 rel_comp_distrib ~> relcomp_distrib
2454 rel_comp_distrib2 ~> relcomp_distrib2
2455 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2456 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2457 single_valued_rel_comp ~> single_valued_relcomp
2458 rel_comp_def ~> relcomp_unfold
2459 converse_rel_comp ~> converse_relcomp
2460 pred_compI ~> relcomppI
2461 pred_compE ~> relcomppE
2462 pred_comp_bot1 ~> relcompp_bot1
2463 pred_comp_bot2 ~> relcompp_bot2
2464 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2465 pred_comp_mono ~> relcompp_mono
2466 pred_comp_distrib ~> relcompp_distrib
2467 pred_comp_distrib2 ~> relcompp_distrib2
2468 converse_pred_comp ~> converse_relcompp
2470 finite_rel_comp ~> finite_relcomp
2472 set_rel_comp ~> set_relcomp
2476 * Theory Divides: Discontinued redundant theorems about div and mod.
2477 INCOMPATIBILITY, use the corresponding generic theorems instead.
2479 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2480 zdiv_self ~> div_self
2481 zmod_self ~> mod_self
2484 zdiv_zmod_equality ~> div_mod_equality2
2485 zdiv_zmod_equality2 ~> div_mod_equality
2486 zmod_zdiv_trivial ~> mod_div_trivial
2487 zdiv_zminus_zminus ~> div_minus_minus
2488 zmod_zminus_zminus ~> mod_minus_minus
2489 zdiv_zminus2 ~> div_minus_right
2490 zmod_zminus2 ~> mod_minus_right
2491 zdiv_minus1_right ~> div_minus1_right
2492 zmod_minus1_right ~> mod_minus1_right
2493 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2494 zmod_zmult1_eq ~> mod_mult_right_eq
2495 zpower_zmod ~> power_mod
2496 zdvd_zmod ~> dvd_mod
2497 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2498 mod_mult_distrib ~> mult_mod_left
2499 mod_mult_distrib2 ~> mult_mod_right
2501 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2502 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2504 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2506 * Consolidated theorem names concerning fold combinators:
2508 inf_INFI_fold_inf ~> inf_INF_fold_inf
2509 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2510 INFI_fold_inf ~> INF_fold_inf
2511 SUPR_fold_sup ~> SUP_fold_sup
2512 union_set ~> union_set_fold
2513 minus_set ~> minus_set_fold
2514 INFI_set_fold ~> INF_set_fold
2515 SUPR_set_fold ~> SUP_set_fold
2516 INF_code ~> INF_set_foldr
2517 SUP_code ~> SUP_set_foldr
2518 foldr.simps ~> foldr.simps (in point-free formulation)
2519 foldr_fold_rev ~> foldr_conv_fold
2520 foldl_fold ~> foldl_conv_fold
2521 foldr_foldr ~> foldr_conv_foldl
2522 foldl_foldr ~> foldl_conv_foldr
2523 fold_set_remdups ~> fold_set_fold_remdups
2524 fold_set ~> fold_set_fold
2525 fold1_set ~> fold1_set_fold
2529 * Dropped rarely useful theorems concerning fold combinators:
2530 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2531 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2532 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2533 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2534 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2535 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2536 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2537 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2538 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2539 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2541 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2542 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2543 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2544 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2545 lemmas over fold rather than foldr, or make use of lemmas
2546 fold_conv_foldr and fold_rev.
2548 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2549 through option types.
2551 * "Transitive_Closure.ntrancl": bounded transitive closure on
2554 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2556 * Theory Int: Discontinued many legacy theorems specific to type int.
2557 INCOMPATIBILITY, use the corresponding generic theorems instead.
2559 zminus_zminus ~> minus_minus
2560 zminus_0 ~> minus_zero
2561 zminus_zadd_distrib ~> minus_add_distrib
2562 zadd_commute ~> add_commute
2563 zadd_assoc ~> add_assoc
2564 zadd_left_commute ~> add_left_commute
2567 zadd_0 ~> add_0_left
2568 zadd_0_right ~> add_0_right
2569 zadd_zminus_inverse2 ~> left_minus
2570 zmult_zminus ~> mult_minus_left
2571 zmult_commute ~> mult_commute
2572 zmult_assoc ~> mult_assoc
2573 zadd_zmult_distrib ~> left_distrib
2574 zadd_zmult_distrib2 ~> right_distrib
2575 zdiff_zmult_distrib ~> left_diff_distrib
2576 zdiff_zmult_distrib2 ~> right_diff_distrib
2577 zmult_1 ~> mult_1_left
2578 zmult_1_right ~> mult_1_right
2579 zle_refl ~> order_refl
2580 zle_trans ~> order_trans
2581 zle_antisym ~> order_antisym
2582 zle_linear ~> linorder_linear
2583 zless_linear ~> linorder_less_linear
2584 zadd_left_mono ~> add_left_mono
2585 zadd_strict_right_mono ~> add_strict_right_mono
2586 zadd_zless_mono ~> add_less_le_mono
2587 int_0_less_1 ~> zero_less_one
2588 int_0_neq_1 ~> zero_neq_one
2590 zpower_zadd_distrib ~> power_add
2591 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2592 zero_le_zpower_abs ~> zero_le_power_abs
2594 * Theory Deriv: Renamed
2596 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2598 * Theory Library/Multiset: Improved code generation of multisets.
2600 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2601 are expressed via type classes again. The special syntax
2602 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2603 setsum_set, which is now subsumed by Big_Operators.setsum.
2606 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2607 use theory HOL/Library/Nat_Bijection instead.
2609 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2610 trees is now inside a type class context. Names of affected
2611 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2612 theories working directly with raw red-black trees, adapt the names as
2616 bulkload -> rbt_bulkload
2617 del_from_left -> rbt_del_from_left
2618 del_from_right -> rbt_del_from_right
2620 delete -> rbt_delete
2622 insert -> rbt_insert
2623 insertw -> rbt_insert_with
2624 insert_with_key -> rbt_insert_with_key
2625 map_entry -> rbt_map_entry
2626 lookup -> rbt_lookup
2627 sorted -> rbt_sorted
2628 tree_greater -> rbt_greater
2629 tree_less -> rbt_less
2630 tree_less_symbol -> rbt_less_symbol
2632 union_with -> rbt_union_with
2633 union_with_key -> rbt_union_with_key
2636 balance_left_sorted -> balance_left_rbt_sorted
2637 balance_left_tree_greater -> balance_left_rbt_greater
2638 balance_left_tree_less -> balance_left_rbt_less
2639 balance_right_sorted -> balance_right_rbt_sorted
2640 balance_right_tree_greater -> balance_right_rbt_greater
2641 balance_right_tree_less -> balance_right_rbt_less
2642 balance_sorted -> balance_rbt_sorted
2643 balance_tree_greater -> balance_rbt_greater
2644 balance_tree_less -> balance_rbt_less
2645 bulkload_is_rbt -> rbt_bulkload_is_rbt
2646 combine_sorted -> combine_rbt_sorted
2647 combine_tree_greater -> combine_rbt_greater
2648 combine_tree_less -> combine_rbt_less
2649 delete_in_tree -> rbt_delete_in_tree
2650 delete_is_rbt -> rbt_delete_is_rbt
2651 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2652 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2653 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2654 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2655 del_in_tree -> rbt_del_in_tree
2656 del_inv1_inv2 -> rbt_del_inv1_inv2
2657 del_sorted -> rbt_del_rbt_sorted
2658 del_tree_greater -> rbt_del_rbt_greater
2659 del_tree_less -> rbt_del_rbt_less
2660 dom_lookup_Branch -> dom_rbt_lookup_Branch
2661 entries_lookup -> entries_rbt_lookup
2662 finite_dom_lookup -> finite_dom_rbt_lookup
2663 insert_sorted -> rbt_insert_rbt_sorted
2664 insertw_is_rbt -> rbt_insertw_is_rbt
2665 insertwk_is_rbt -> rbt_insertwk_is_rbt
2666 insertwk_sorted -> rbt_insertwk_rbt_sorted
2667 insertw_sorted -> rbt_insertw_rbt_sorted
2668 ins_sorted -> ins_rbt_sorted
2669 ins_tree_greater -> ins_rbt_greater
2670 ins_tree_less -> ins_rbt_less
2671 is_rbt_sorted -> is_rbt_rbt_sorted
2672 lookup_balance -> rbt_lookup_balance
2673 lookup_bulkload -> rbt_lookup_rbt_bulkload
2674 lookup_delete -> rbt_lookup_rbt_delete
2675 lookup_Empty -> rbt_lookup_Empty
2676 lookup_from_in_tree -> rbt_lookup_from_in_tree
2677 lookup_in_tree -> rbt_lookup_in_tree
2678 lookup_ins -> rbt_lookup_ins
2679 lookup_insert -> rbt_lookup_rbt_insert
2680 lookup_insertw -> rbt_lookup_rbt_insertw
2681 lookup_insertwk -> rbt_lookup_rbt_insertwk
2682 lookup_keys -> rbt_lookup_keys
2683 lookup_map -> rbt_lookup_map
2684 lookup_map_entry -> rbt_lookup_rbt_map_entry
2685 lookup_tree_greater -> rbt_lookup_rbt_greater
2686 lookup_tree_less -> rbt_lookup_rbt_less
2687 lookup_union -> rbt_lookup_rbt_union
2688 map_entry_color_of -> rbt_map_entry_color_of
2689 map_entry_inv1 -> rbt_map_entry_inv1
2690 map_entry_inv2 -> rbt_map_entry_inv2
2691 map_entry_is_rbt -> rbt_map_entry_is_rbt
2692 map_entry_sorted -> rbt_map_entry_rbt_sorted
2693 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2694 map_entry_tree_less -> rbt_map_entry_rbt_less
2695 map_tree_greater -> map_rbt_greater
2696 map_tree_less -> map_rbt_less
2697 map_sorted -> map_rbt_sorted
2698 paint_sorted -> paint_rbt_sorted
2699 paint_lookup -> paint_rbt_lookup
2700 paint_tree_greater -> paint_rbt_greater
2701 paint_tree_less -> paint_rbt_less
2702 sorted_entries -> rbt_sorted_entries
2703 tree_greater_eq_trans -> rbt_greater_eq_trans
2704 tree_greater_nit -> rbt_greater_nit
2705 tree_greater_prop -> rbt_greater_prop
2706 tree_greater_simps -> rbt_greater_simps
2707 tree_greater_trans -> rbt_greater_trans
2708 tree_less_eq_trans -> rbt_less_eq_trans
2709 tree_less_nit -> rbt_less_nit
2710 tree_less_prop -> rbt_less_prop
2711 tree_less_simps -> rbt_less_simps
2712 tree_less_trans -> rbt_less_trans
2713 tree_ord_props -> rbt_ord_props
2714 union_Branch -> rbt_union_Branch
2715 union_is_rbt -> rbt_union_is_rbt
2716 unionw_is_rbt -> rbt_unionw_is_rbt
2717 unionwk_is_rbt -> rbt_unionwk_is_rbt
2718 unionwk_sorted -> rbt_unionwk_rbt_sorted
2720 * Theory HOL/Library/Float: Floating point numbers are now defined as
2721 a subset of the real numbers. All operations are defined using the
2722 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2729 round_down -> float_round_down
2730 round_up -> float_round_up
2734 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2737 abs_float_def -> Float.compute_float_abs
2738 bitlen_ge0 -> bitlen_nonneg
2739 bitlen.simps -> Float.compute_bitlen
2740 float_components -> Float_mantissa_exponent
2741 float_divl.simps -> Float.compute_float_divl
2742 float_divr.simps -> Float.compute_float_divr
2743 float_eq_odd -> mult_powr_eq_mult_powr_iff
2744 float_power -> real_of_float_power
2745 lapprox_posrat_def -> Float.compute_lapprox_posrat
2746 lapprox_rat.simps -> Float.compute_lapprox_rat
2747 le_float_def' -> Float.compute_float_le
2748 le_float_def -> less_eq_float.rep_eq
2749 less_float_def' -> Float.compute_float_less
2750 less_float_def -> less_float.rep_eq
2751 normfloat_def -> Float.compute_normfloat
2752 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2753 normfloat -> normfloat_def
2754 normfloat_unique -> use normfloat_def
2755 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2756 one_float_def -> Float.compute_float_one
2757 plus_float_def -> Float.compute_float_plus
2758 rapprox_posrat_def -> Float.compute_rapprox_posrat
2759 rapprox_rat.simps -> Float.compute_rapprox_rat
2760 real_of_float_0 -> zero_float.rep_eq
2761 real_of_float_1 -> one_float.rep_eq
2762 real_of_float_abs -> abs_float.rep_eq
2763 real_of_float_add -> plus_float.rep_eq
2764 real_of_float_minus -> uminus_float.rep_eq
2765 real_of_float_mult -> times_float.rep_eq
2766 real_of_float_simp -> Float.rep_eq
2767 real_of_float_sub -> minus_float.rep_eq
2768 round_down.simps -> Float.compute_float_round_down
2769 round_up.simps -> Float.compute_float_round_up
2770 times_float_def -> Float.compute_float_times
2771 uminus_float_def -> Float.compute_float_uminus
2772 zero_float_def -> Float.compute_float_zero
2774 Lemmas not necessary anymore, use the transfer method:
2775 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2776 float_divr, float_le_simp, float_less1_mantissa_bound,
2777 float_less_simp, float_less_zero, float_le_zero,
2778 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2779 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2780 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2781 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2782 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2783 round_up, zero_le_float, zero_less_float
2785 * New theory HOL/Library/DAList provides an abstract type for
2786 association lists with distinct keys.
2788 * Session HOL/IMP: Added new theory of abstract interpretation of
2791 * Session HOL-Import: Re-implementation from scratch is faster,
2792 simpler, and more scalable. Requires a proof bundle, which is
2793 available as an external component. Discontinued old (and mostly
2794 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2796 * Session HOL-Word: Discontinued many redundant theorems specific to
2797 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2800 word_sub_alt ~> word_sub_wi
2801 word_add_alt ~> word_add_def
2802 word_mult_alt ~> word_mult_def
2803 word_minus_alt ~> word_minus_def
2804 word_0_alt ~> word_0_wi
2805 word_1_alt ~> word_1_wi
2806 word_add_0 ~> add_0_left
2807 word_add_0_right ~> add_0_right
2808 word_mult_1 ~> mult_1_left
2809 word_mult_1_right ~> mult_1_right
2810 word_add_commute ~> add_commute
2811 word_add_assoc ~> add_assoc
2812 word_add_left_commute ~> add_left_commute
2813 word_mult_commute ~> mult_commute
2814 word_mult_assoc ~> mult_assoc
2815 word_mult_left_commute ~> mult_left_commute
2816 word_left_distrib ~> left_distrib
2817 word_right_distrib ~> right_distrib
2818 word_left_minus ~> left_minus
2819 word_diff_0_right ~> diff_0_right
2820 word_diff_self ~> diff_self
2821 word_sub_def ~> diff_minus
2822 word_diff_minus ~> diff_minus
2823 word_add_ac ~> add_ac
2824 word_mult_ac ~> mult_ac
2825 word_plus_ac0 ~> add_0_left add_0_right add_ac
2826 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2827 word_order_trans ~> order_trans
2828 word_order_refl ~> order_refl
2829 word_order_antisym ~> order_antisym
2830 word_order_linear ~> linorder_linear
2831 lenw1_zero_neq_one ~> zero_neq_one
2832 word_number_of_eq ~> number_of_eq
2833 word_of_int_add_hom ~> wi_hom_add
2834 word_of_int_sub_hom ~> wi_hom_sub
2835 word_of_int_mult_hom ~> wi_hom_mult
2836 word_of_int_minus_hom ~> wi_hom_neg
2837 word_of_int_succ_hom ~> wi_hom_succ
2838 word_of_int_pred_hom ~> wi_hom_pred
2839 word_of_int_0_hom ~> word_0_wi
2840 word_of_int_1_hom ~> word_1_wi
2842 * Session HOL-Word: New proof method "word_bitwise" for splitting
2843 machine word equalities and inequalities into logical circuits,
2844 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2845 multiplication, shifting by constants, bitwise operators and numeric
2846 constants. Requires fixed-length word types, not 'a word. Solves
2847 many standard word identities outright and converts more into first
2848 order problems amenable to blast or similar. See also examples in
2849 HOL/Word/Examples/WordExamples.thy.
2851 * Session HOL-Probability: Introduced the type "'a measure" to
2852 represent measures, this replaces the records 'a algebra and 'a
2853 measure_space. The locales based on subset_class now have two
2854 locale-parameters the space \<Omega> and the set of measurable sets M.
2855 The product of probability spaces uses now the same constant as the
2856 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2857 measure". Most constants are defined now outside of locales and gain
2858 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2859 Measure space constructions for distributions and densities now got
2860 their own constants distr and density. Instead of using locales to
2861 describe measure spaces with a finite space, the measure count_space
2862 and point_measure is introduced. INCOMPATIBILITY.
2866 finite_measure.\<mu>' -> measure
2867 product_algebra_generator -> prod_algebra
2868 product_prob_space.emb -> prod_emb
2869 product_prob_space.infprod_algebra -> PiM
2872 completeable_measure_space
2873 finite_measure_space
2875 finite_product_finite_prob_space
2876 finite_product_sigma_algebra
2877 finite_sigma_algebra
2879 pair_finite_prob_space
2880 pair_finite_sigma_algebra
2883 product_sigma_algebra
2887 distribution -> use distr measure, or distributed predicate
2889 joint_distribution -> use distr measure, or distributed predicate
2890 pair_measure_generator
2891 product_prob_space.infprod_algebra -> use PiM
2894 Replacement theorems:
2895 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2896 finite_measure.empty_measure -> measure_empty
2897 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2898 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2899 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2900 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2901 finite_measure.finite_measure -> finite_measure.emeasure_finite
2902 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2903 finite_measure.positive_measure' -> measure_nonneg
2904 finite_measure.real_measure -> finite_measure.emeasure_real
2905 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2906 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2907 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2908 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2909 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2910 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2911 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2912 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2913 information_space.entropy_commute -> information_space.entropy_commute_simple
2914 information_space.entropy_eq -> information_space.entropy_simple_distributed
2915 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2916 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2917 information_space.entropy_uniform_max -> information_space.entropy_uniform
2918 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2919 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2920 information_space.KL_ge_0 -> information_space.KL_nonneg
2921 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2922 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2923 Int_stable_cuboids -> Int_stable_atLeastAtMost
2924 Int_stable_product_algebra_generator -> positive_integral
2925 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2926 measure_space.additive -> emeasure_additive
2927 measure_space.AE_iff_null_set -> AE_iff_null
2928 measure_space.almost_everywhere_def -> eventually_ae_filter
2929 measure_space.almost_everywhere_vimage -> AE_distrD
2930 measure_space.continuity_from_above -> INF_emeasure_decseq
2931 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2932 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2933 measure_space.continuity_from_below -> SUP_emeasure_incseq
2934 measure_space_density -> emeasure_density
2935 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2936 measure_space.integrable_vimage -> integrable_distr
2937 measure_space.integral_translated_density -> integral_density
2938 measure_space.integral_vimage -> integral_distr
2939 measure_space.measure_additive -> plus_emeasure
2940 measure_space.measure_compl -> emeasure_compl
2941 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2942 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2943 measure_space.measure_decseq -> decseq_emeasure
2944 measure_space.measure_Diff -> emeasure_Diff
2945 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2946 measure_space.measure_eq_0 -> emeasure_eq_0
2947 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2948 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2949 measure_space.measure_incseq -> incseq_emeasure
2950 measure_space.measure_insert -> emeasure_insert
2951 measure_space.measure_mono -> emeasure_mono
2952 measure_space.measure_not_negative -> emeasure_not_MInf
2953 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2954 measure_space.measure_setsum -> setsum_emeasure
2955 measure_space.measure_setsum_split -> setsum_emeasure_cover
2956 measure_space.measure_space_vimage -> emeasure_distr
2957 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2958 measure_space.measure_subadditive -> subadditive
2959 measure_space.measure_top -> emeasure_space
2960 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2961 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2962 measure_space.positive_integral_translated_density -> positive_integral_density
2963 measure_space.positive_integral_vimage -> positive_integral_distr
2964 measure_space.real_continuity_from_above -> Lim_measure_decseq
2965 measure_space.real_continuity_from_below -> Lim_measure_incseq
2966 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2967 measure_space.real_measure_Diff -> measure_Diff
2968 measure_space.real_measure_finite_Union -> measure_finite_Union
2969 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2970 measure_space.real_measure_subadditive -> measure_subadditive
2971 measure_space.real_measure_Union -> measure_Union
2972 measure_space.real_measure_UNION -> measure_UNION
2973 measure_space.simple_function_vimage -> simple_function_comp
2974 measure_space.simple_integral_vimage -> simple_integral_distr
2975 measure_space.simple_integral_vimage -> simple_integral_distr
2976 measure_unique_Int_stable -> measure_eqI_generator_eq
2977 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2978 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2979 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2980 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2981 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2982 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2983 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2984 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2985 pair_sigma_algebra.sets_swap -> sets_pair_swap
2986 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2987 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2988 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2989 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2990 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2991 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2992 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2993 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2994 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2995 prob_space.prob_space_vimage -> prob_space_distr
2996 prob_space.random_variable_restrict -> measurable_restrict
2997 prob_space_unique_Int_stable -> measure_eqI_prob_space
2998 product_algebraE -> prod_algebraE_all
2999 product_algebra_generator_der -> prod_algebra_eq_finite
3000 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3001 product_algebraI -> sets_PiM_I_finite
3002 product_measure_exists -> product_sigma_finite.sigma_finite
3003 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3004 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3005 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3006 product_prob_space.measurable_component -> measurable_component_singleton
3007 product_prob_space.measurable_emb -> measurable_prod_emb
3008 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3009 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3010 product_prob_space.measure_emb -> emeasure_prod_emb
3011 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3012 product_sigma_algebra.product_algebra_into_space -> space_closed
3013 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3014 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3015 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3016 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3017 sets_product_algebra -> sets_PiM
3018 sigma_algebra.measurable_sigma -> measurable_measure_of
3019 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3020 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3021 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3022 space_product_algebra -> space_PiM
3024 * Session HOL-TPTP: support to parse and import TPTP problems (all
3025 languages) into Isabelle/HOL.
3030 * New "case_product" attribute (see HOL).
3035 * Greater support for structured proofs involving induction or case
3038 * Much greater use of mathematical symbols.
3040 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3045 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3046 from a minor keyword introduced via theory header declaration.
3048 * Antiquotation @{command_spec "name"} produces the
3049 Outer_Syntax.command_spec from a major keyword introduced via theory
3050 header declaration; it can be passed to Outer_Syntax.command etc.
3052 * Local_Theory.define no longer hard-wires default theorem name
3053 "foo_def", but retains the binding as given. If that is Binding.empty
3054 / Attrib.empty_binding, the result is not registered as user-level
3055 fact. The Local_Theory.define_internal variant allows to specify a
3056 non-empty name (used for the foundation in the background theory),
3057 while omitting the fact binding in the user-context. Potential
3058 INCOMPATIBILITY for derived definitional packages: need to specify
3059 naming policy for primitive definitions more explicitly.
3061 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3062 conformance with similar operations in structure Term and Logic.
3064 * Antiquotation @{attributes [...]} embeds attribute source
3065 representation into the ML text, which is particularly useful with
3066 declarations like Local_Theory.note.
3068 * Structure Proof_Context follows standard naming scheme. Old
3069 ProofContext has been discontinued. INCOMPATIBILITY.
3071 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3072 change of semantics: update is applied to auxiliary local theory
3075 * Modernized some old-style infix operations:
3077 addeqcongs ~> Simplifier.add_eqcong
3078 deleqcongs ~> Simplifier.del_eqcong
3079 addcongs ~> Simplifier.add_cong
3080 delcongs ~> Simplifier.del_cong
3081 setmksimps ~> Simplifier.set_mksimps
3082 setmkcong ~> Simplifier.set_mkcong
3083 setmksym ~> Simplifier.set_mksym
3084 setmkeqTrue ~> Simplifier.set_mkeqTrue
3085 settermless ~> Simplifier.set_termless
3086 setsubgoaler ~> Simplifier.set_subgoaler
3087 addsplits ~> Splitter.add_split
3088 delsplits ~> Splitter.del_split
3093 * USER_HOME settings variable points to cross-platform user home
3094 directory, which coincides with HOME on POSIX systems only. Likewise,
3095 the Isabelle path specification "~" now expands to $USER_HOME, instead
3096 of former $HOME. A different default for USER_HOME may be set
3097 explicitly in shell environment, before Isabelle settings are
3098 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3099 the generic user home was intended.
3101 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3102 notation, which is useful for the jEdit file browser, for example.
3104 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3109 New in Isabelle2011-1 (October 2011)
3110 ------------------------------------
3114 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3115 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3117 - Management of multiple theory files directly from the editor
3118 buffer store -- bypassing the file-system (no requirement to save
3119 files for checking).
3121 - Markup of formal entities within the text buffer, with semantic
3122 highlighting, tooltips and hyperlinks to jump to defining source
3125 - Improved text rendering, with sub/superscripts in the source
3126 buffer (including support for copy/paste wrt. output panel, HTML
3127 theory output and other non-Isabelle text boxes).
3129 - Refined scheduling of proof checking and printing of results,
3130 based on interactive editor view. (Note: jEdit folding and
3131 narrowing allows to restrict buffer perspectives explicitly.)
3133 - Reduced CPU performance requirements, usable on machines with few
3136 - Reduced memory requirements due to pruning of unused document
3137 versions (garbage collection).
3139 See also ~~/src/Tools/jEdit/README.html for further information,
3140 including some remaining limitations.
3142 * Theory loader: source files are exclusively located via the master
3143 directory of each theory node (where the .thy file itself resides).
3144 The global load path (such as src/HOL/Library) has been discontinued.
3145 Note that the path element ~~ may be used to reference theories in the
3146 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3149 * Theory loader: source files are identified by content via SHA1
3150 digests. Discontinued former path/modtime identification and optional
3151 ISABELLE_FILE_IDENT plugin scripts.
3153 * Parallelization of nested Isar proofs is subject to
3154 Goal.parallel_proofs_threshold (default 100). See also isabelle
3157 * Name space: former unsynchronized references are now proper
3158 configuration options, with more conventional names:
3160 long_names ~> names_long
3161 short_names ~> names_short
3162 unique_names ~> names_unique
3164 Minor INCOMPATIBILITY, need to declare options in context like this:
3166 declare [[names_unique = false]]
3168 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3169 that the result needs to be unique, which means fact specifications
3170 may have to be refined after enriching a proof context.
3172 * Attribute "case_names" has been refined: the assumptions in each case
3173 can be named now by following the case name with [name1 name2 ...].
3175 * Isabelle/Isar reference manual has been updated and extended:
3176 - "Synopsis" provides a catalog of main Isar language concepts.
3177 - Formal references in syntax diagrams, via @{rail} antiquotation.
3178 - Updated material from classic "ref" manual, notably about
3179 "Classical Reasoner".
3184 * Class bot and top require underlying partial order rather than
3185 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3187 * Class complete_lattice: generalized a couple of lemmas from sets;
3188 generalized theorems INF_cong and SUP_cong. New type classes for
3189 complete boolean algebras and complete linear orders. Lemmas
3190 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3191 class complete_linorder.
3193 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3194 Sup_fun_def, Inf_apply, Sup_apply.
3196 Removed redundant lemmas (the right hand side gives hints how to
3197 replace them for (metis ...), or (simp only: ...) proofs):
3199 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3200 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3201 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3202 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3203 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3204 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3205 Inter_def ~> INF_def, image_def
3206 Union_def ~> SUP_def, image_def
3207 INT_eq ~> INF_def, and image_def
3208 UN_eq ~> SUP_def, and image_def
3209 INF_subset ~> INF_superset_mono [OF _ order_refl]
3211 More consistent and comprehensive names:
3213 INTER_eq_Inter_image ~> INF_def
3214 UNION_eq_Union_image ~> SUP_def
3217 INF_leI ~> INF_lower
3218 INF_leI2 ~> INF_lower2
3219 le_INFI ~> INF_greatest
3220 le_SUPI ~> SUP_upper
3221 le_SUPI2 ~> SUP_upper2
3222 SUP_leI ~> SUP_least
3223 INFI_bool_eq ~> INF_bool_eq
3224 SUPR_bool_eq ~> SUP_bool_eq
3225 INFI_apply ~> INF_apply
3226 SUPR_apply ~> SUP_apply
3227 INTER_def ~> INTER_eq
3228 UNION_def ~> UNION_eq
3232 * Renamed theory Complete_Lattice to Complete_Lattices.
3235 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3236 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3237 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3238 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3240 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3241 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3242 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3245 * Added syntactic classes "inf" and "sup" for the respective
3246 constants. INCOMPATIBILITY: Changes in the argument order of the
3247 (mostly internal) locale predicates for some derived classes.
3249 * Theorem collections ball_simps and bex_simps do not contain theorems
3250 referring to UNION any longer; these have been moved to collection
3251 UN_ball_bex_simps. INCOMPATIBILITY.
3253 * Theory Archimedean_Field: floor now is defined as parameter of a
3254 separate type class floor_ceiling.
3256 * Theory Finite_Set: more coherent development of fold_set locales:
3258 locale fun_left_comm ~> locale comp_fun_commute
3259 locale fun_left_comm_idem ~> locale comp_fun_idem
3261 Both use point-free characterization; interpretation proofs may need
3262 adjustment. INCOMPATIBILITY.
3264 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3265 accordance with standard mathematical terminology. INCOMPATIBILITY.
3267 * Theory Complex_Main: The locale interpretations for the
3268 bounded_linear and bounded_bilinear locales have been removed, in
3269 order to reduce the number of duplicate lemmas. Users must use the
3270 original names for distributivity theorems, potential INCOMPATIBILITY.
3272 divide.add ~> add_divide_distrib
3273 divide.diff ~> diff_divide_distrib
3274 divide.setsum ~> setsum_divide_distrib
3275 mult.add_right ~> right_distrib
3276 mult.diff_right ~> right_diff_distrib
3277 mult_right.setsum ~> setsum_right_distrib
3278 mult_left.diff ~> left_diff_distrib
3280 * Theory Complex_Main: Several redundant theorems have been removed or
3281 replaced by more general versions. INCOMPATIBILITY.
3283 real_diff_def ~> minus_real_def
3284 real_divide_def ~> divide_real_def
3285 real_less_def ~> less_le
3286 real_abs_def ~> abs_real_def
3287 real_sgn_def ~> sgn_real_def
3288 real_mult_commute ~> mult_commute
3289 real_mult_assoc ~> mult_assoc
3290 real_mult_1 ~> mult_1_left
3291 real_add_mult_distrib ~> left_distrib
3292 real_zero_not_eq_one ~> zero_neq_one
3293 real_mult_inverse_left ~> left_inverse
3294 INVERSE_ZERO ~> inverse_zero
3295 real_le_refl ~> order_refl
3296 real_le_antisym ~> order_antisym
3297 real_le_trans ~> order_trans
3298 real_le_linear ~> linear
3299 real_le_eq_diff ~> le_iff_diff_le_0
3300 real_add_left_mono ~> add_left_mono
3301 real_mult_order ~> mult_pos_pos
3302 real_mult_less_mono2 ~> mult_strict_left_mono
3303 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3304 real_0_le_divide_iff ~> zero_le_divide_iff
3305 realpow_two_disj ~> power2_eq_iff
3306 real_squared_diff_one_factored ~> square_diff_one_factored
3307 realpow_two_diff ~> square_diff_square_factored
3308 reals_complete2 ~> complete_real
3309 real_sum_squared_expand ~> power2_sum
3310 exp_ln_eq ~> ln_unique
3312 expi_zero ~> exp_zero
3313 lemma_DERIV_subst ~> DERIV_cong
3314 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3315 LIMSEQ_const ~> tendsto_const
3316 LIMSEQ_norm ~> tendsto_norm
3317 LIMSEQ_add ~> tendsto_add
3318 LIMSEQ_minus ~> tendsto_minus
3319 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3320 LIMSEQ_diff ~> tendsto_diff
3321 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3322 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3323 LIMSEQ_mult ~> tendsto_mult
3324 LIMSEQ_inverse ~> tendsto_inverse
3325 LIMSEQ_divide ~> tendsto_divide
3326 LIMSEQ_pow ~> tendsto_power
3327 LIMSEQ_setsum ~> tendsto_setsum
3328 LIMSEQ_setprod ~> tendsto_setprod
3329 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3330 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3331 LIMSEQ_imp_rabs ~> tendsto_rabs
3332 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3333 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3334 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3335 LIMSEQ_Complex ~> tendsto_Complex
3336 LIM_ident ~> tendsto_ident_at
3337 LIM_const ~> tendsto_const
3338 LIM_add ~> tendsto_add
3339 LIM_add_zero ~> tendsto_add_zero
3340 LIM_minus ~> tendsto_minus
3341 LIM_diff ~> tendsto_diff
3342 LIM_norm ~> tendsto_norm
3343 LIM_norm_zero ~> tendsto_norm_zero
3344 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3345 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3346 LIM_rabs ~> tendsto_rabs
3347 LIM_rabs_zero ~> tendsto_rabs_zero
3348 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3349 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3350 LIM_compose ~> tendsto_compose
3351 LIM_mult ~> tendsto_mult
3352 LIM_scaleR ~> tendsto_scaleR
3353 LIM_of_real ~> tendsto_of_real
3354 LIM_power ~> tendsto_power
3355 LIM_inverse ~> tendsto_inverse
3356 LIM_sgn ~> tendsto_sgn
3357 isCont_LIM_compose ~> isCont_tendsto_compose
3358 bounded_linear.LIM ~> bounded_linear.tendsto
3359 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3360 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3361 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3362 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3363 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3364 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3366 * Theory Complex_Main: The definition of infinite series was
3367 generalized. Now it is defined on the type class {topological_space,
3368 comm_monoid_add}. Hence it is useable also for extended real numbers.
3370 * Theory Complex_Main: The complex exponential function "expi" is now
3371 a type-constrained abbreviation for "exp :: complex => complex"; thus
3372 several polymorphic lemmas about "exp" are now applicable to "expi".
3376 - Theory Library/Code_Char_ord provides native ordering of
3377 characters in the target language.
3379 - Commands code_module and code_library are legacy, use export_code
3382 - Method "evaluation" is legacy, use method "eval" instead.
3384 - Legacy evaluator "SML" is deactivated by default. May be
3385 reactivated by the following theory command:
3387 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3389 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3391 * New proof method "induction" that gives induction hypotheses the
3392 name "IH", thus distinguishing them from further hypotheses that come
3393 from rule induction. The latter are still called "hyps". Method
3394 "induction" is a thin wrapper around "induct" and follows the same
3397 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3398 still available as a legacy feature for some time.
3401 - Added "need" and "total_consts" options.
3402 - Reintroduced "show_skolems" option by popular demand.
3403 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3407 - Use quasi-sound (and efficient) translations by default.
3408 - Added support for the following provers: E-ToFoF, LEO-II,
3409 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3410 - Automatically preplay and minimize proofs before showing them if
3411 this can be done within reasonable time.
3412 - sledgehammer available_provers ~> sledgehammer supported_provers.
3414 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3415 "max_mono_iters", and "max_new_mono_instances" options.
3416 - Removed "explicit_apply" and "full_types" options as well as "Full
3417 Types" Proof General menu item. INCOMPATIBILITY.
3420 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3421 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3425 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3426 "elim:" options. INCOMPATIBILITY.
3427 - Introduced 'try' that not only runs 'try_methods' but also
3428 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3431 - Added "eval" option to evaluate terms for the found counterexample
3432 (currently only supported by the default (exhaustive) tester).
3433 - Added post-processing of terms to obtain readable counterexamples
3434 (currently only supported by the default (exhaustive) tester).
3435 - New counterexample generator quickcheck[narrowing] enables
3436 narrowing-based testing. Requires the Glasgow Haskell compiler
3437 with its installation location defined in the Isabelle settings
3438 environment as ISABELLE_GHC.
3439 - Removed quickcheck tester "SML" based on the SML code generator
3440 (formly in HOL/Library).
3442 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3443 use 'partial_function' instead.
3445 * Theory Library/Extended_Reals replaces now the positive extended
3446 reals found in probability theory. This file is extended by
3447 Multivariate_Analysis/Extended_Real_Limits.
3449 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3450 from where it must be imported explicitly if it is really required.
3453 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3454 been moved here. INCOMPATIBILITY.
3456 * Theory Library/Saturated provides type of numbers with saturated
3459 * Theory Library/Product_Lattice defines a pointwise ordering for the
3460 product type 'a * 'b, and provides instance proofs for various order
3461 and lattice type classes.
3463 * Theory Library/Countable now provides the "countable_datatype" proof
3464 method for proving "countable" class instances for datatypes.
3466 * Theory Library/Cset_Monad allows do notation for computable sets
3467 (cset) via the generic monad ad-hoc overloading facility.
3469 * Library: Theories of common data structures are split into theories
3470 for implementation, an invariant-ensuring type, and connection to an
3471 abstract type. INCOMPATIBILITY.
3473 - RBT is split into RBT and RBT_Mapping.
3474 - AssocList is split and renamed into AList and AList_Mapping.
3475 - DList is split into DList_Impl, DList, and DList_Cset.
3476 - Cset is split into Cset and List_Cset.
3478 * Theory Library/Nat_Infinity has been renamed to
3479 Library/Extended_Nat, with name changes of the following types and
3482 type inat ~> type enat
3484 Infty ~> infinity (overloaded)
3488 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3489 been renamed accordingly. INCOMPATIBILITY.
3491 * Session Multivariate_Analysis: The euclidean_space type class now
3492 fixes a constant "Basis :: 'a set" consisting of the standard
3493 orthonormal basis for the type. Users now have the option of
3494 quantifying over this set instead of using the "basis" function, e.g.
3495 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3497 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3498 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3499 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3500 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3501 changed to match. Definition theorems for overloaded constants now use
3502 the standard "foo_vec_def" naming scheme. A few other theorems have
3503 been renamed as follows (INCOMPATIBILITY):
3505 Cart_eq ~> vec_eq_iff
3506 dist_nth_le_cart ~> dist_vec_nth_le
3507 tendsto_vector ~> vec_tendstoI
3508 Cauchy_vector ~> vec_CauchyI
3510 * Session Multivariate_Analysis: Several duplicate theorems have been
3511 removed, and other theorems have been renamed or replaced with more
3512 general versions. INCOMPATIBILITY.
3514 finite_choice ~> finite_set_choice
3515 eventually_conjI ~> eventually_conj
3516 eventually_and ~> eventually_conj_iff
3517 eventually_false ~> eventually_False
3518 setsum_norm ~> norm_setsum
3519 Lim_sequentially ~> LIMSEQ_def
3520 Lim_ident_at ~> LIM_ident
3521 Lim_const ~> tendsto_const
3522 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3523 Lim_neg ~> tendsto_minus
3524 Lim_add ~> tendsto_add
3525 Lim_sub ~> tendsto_diff
3526 Lim_mul ~> tendsto_scaleR
3527 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3528 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3529 Lim_linear ~> bounded_linear.tendsto
3530 Lim_component ~> tendsto_euclidean_component
3531 Lim_component_cart ~> tendsto_vec_nth
3532 Lim_inner ~> tendsto_inner [OF tendsto_const]
3533 dot_lsum ~> inner_setsum_left
3534 dot_rsum ~> inner_setsum_right
3535 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3536 continuous_neg ~> continuous_minus
3537 continuous_sub ~> continuous_diff
3538 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3539 continuous_mul ~> continuous_scaleR
3540 continuous_inv ~> continuous_inverse
3541 continuous_at_within_inv ~> continuous_at_within_inverse
3542 continuous_at_inv ~> continuous_at_inverse
3543 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3544 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3545 continuous_at_component ~> continuous_component [OF continuous_at_id]
3546 continuous_on_neg ~> continuous_on_minus
3547 continuous_on_sub ~> continuous_on_diff
3548 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3549 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3550 continuous_on_mul ~> continuous_on_scaleR
3551 continuous_on_mul_real ~> continuous_on_mult
3552 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3553 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3554 continuous_on_inverse ~> continuous_on_inv
3555 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3556 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3557 subset_interior ~> interior_mono
3558 subset_closure ~> closure_mono
3559 closure_univ ~> closure_UNIV
3560 real_arch_lt ~> reals_Archimedean2
3561 real_arch ~> reals_Archimedean3
3562 real_abs_norm ~> abs_norm_cancel
3563 real_abs_sub_norm ~> norm_triangle_ineq3
3564 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3566 * Session HOL-Probability:
3567 - Caratheodory's extension lemma is now proved for ring_of_sets.
3568 - Infinite products of probability measures are now available.
3569 - Sigma closure is independent, if the generator is independent
3570 - Use extended reals instead of positive extended
3571 reals. INCOMPATIBILITY.
3573 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3575 expand_fun_below ~> fun_below_iff
3576 below_fun_ext ~> fun_belowI
3577 expand_cfun_eq ~> cfun_eq_iff
3578 ext_cfun ~> cfun_eqI
3579 expand_cfun_below ~> cfun_below_iff
3580 below_cfun_ext ~> cfun_belowI
3581 monofun_fun_fun ~> fun_belowD
3582 monofun_fun_arg ~> monofunE
3583 monofun_lub_fun ~> adm_monofun [THEN admD]
3584 cont_lub_fun ~> adm_cont [THEN admD]
3585 cont2cont_Rep_CFun ~> cont2cont_APP
3586 cont_Rep_CFun_app ~> cont_APP_app
3587 cont_Rep_CFun_app_app ~> cont_APP_app_app
3588 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3589 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3590 contlub_cfun ~> lub_APP [symmetric]
3591 contlub_LAM ~> lub_LAM [symmetric]
3594 lift_distinct1 ~> lift.distinct(1)
3595 lift_distinct2 ~> lift.distinct(2)
3596 Def_not_UU ~> lift.distinct(2)
3597 Def_inject ~> lift.inject
3598 below_UU_iff ~> below_bottom_iff
3599 eq_UU_iff ~> eq_bottom_iff
3602 *** Document preparation ***
3604 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3605 isar-ref manual, both for description and actual application of the
3608 * Antiquotation @{value} evaluates the given term and presents its
3611 * Antiquotations: term style "isub" provides ad-hoc conversion of
3612 variables x1, y23 into subscripted form x\<^isub>1,
3613 y\<^isub>2\<^isub>3.
3615 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3616 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3618 * Localized \isabellestyle switch can be used within blocks or groups
3621 \isabellestyle{it} %preferred default
3622 {\isabellestylett @{text "typewriter stuff"}}
3624 * Discontinued special treatment of hard tabulators. Implicit
3625 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3631 * The inner syntax of sort/type/term/prop supports inlined YXML
3632 representations within quoted string tokens. By encoding logical
3633 entities via Term_XML (in ML or Scala) concrete syntax can be
3634 bypassed, which is particularly useful for producing bits of text
3635 under external program control.
3637 * Antiquotations for ML and document preparation are managed as theory
3638 data, which requires explicit setup.
3640 * Isabelle_Process.is_active allows tools to check if the official
3641 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3642 (better known as Proof General).
3644 * Structure Proof_Context follows standard naming scheme. Old
3645 ProofContext is still available for some time as legacy alias.
3647 * Structure Timing provides various operations for timing; supersedes
3648 former start_timing/end_timing etc.
3650 * Path.print is the official way to show file-system paths to users
3651 (including quotes etc.).
3653 * Inner syntax: identifiers in parse trees of generic categories
3654 "logic", "aprop", "idt" etc. carry position information (disguised as
3655 type constraints). Occasional INCOMPATIBILITY with non-compliant
3656 translations that choke on unexpected type constraints. Positions can
3657 be stripped in ML translations via Syntax.strip_positions /
3658 Syntax.strip_positions_ast, or via the syntax constant
3659 "_strip_positions" within parse trees. As last resort, positions can
3660 be disabled via the configuration option Syntax.positions, which is
3661 called "syntax_positions" in Isar attribute syntax.
3663 * Discontinued special status of various ML structures that contribute
3664 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3665 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3666 refer directly to Ast.Constant, Lexicon.is_identifier,
3667 Syntax_Trans.mk_binder_tr etc.
3669 * Typed print translation: discontinued show_sorts argument, which is
3670 already available via context of "advanced" translation.
3672 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3673 goal states; body tactic needs to address all subgoals uniformly.
3675 * Slightly more special eq_list/eq_set, with shortcut involving
3676 pointer equality (assumes that eq relation is reflexive).
3678 * Classical tactics use proper Proof.context instead of historic types
3679 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3680 operate directly on Proof.context. Raw type claset retains its use as
3681 snapshot of the classical context, which can be recovered via
3682 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3683 INCOMPATIBILITY, classical tactics and derived proof methods require
3684 proper Proof.context.
3689 * Discontinued support for Poly/ML 5.2, which was the last version
3690 without proper multithreading and TimeLimit implementation.
3692 * Discontinued old lib/scripts/polyml-platform, which has been
3693 obsolete since Isabelle2009-2.
3695 * Various optional external tools are referenced more robustly and
3696 uniformly by explicit Isabelle settings as follows:
3698 ISABELLE_CSDP (formerly CSDP_EXE)
3699 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3700 ISABELLE_OCAML (formerly EXEC_OCAML)
3701 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3702 ISABELLE_YAP (formerly EXEC_YAP)
3704 Note that automated detection from the file-system or search path has
3705 been discontinued. INCOMPATIBILITY.
3707 * Scala layer provides JVM method invocation service for static
3708 methods of type (String)String, see Invoke_Scala.method in ML. For
3711 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3713 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3714 this allows to pass structured values between ML and Scala.
3716 * The IsabelleText fonts includes some further glyphs to support the
3717 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3718 installed a local copy (which is normally *not* required) need to
3719 delete or update it from ~~/lib/fonts/.
3723 New in Isabelle2011 (January 2011)
3724 ----------------------------------
3728 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3729 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3730 useful tooltips and hyperlinks produced from its static analysis. The
3731 bundled component provides an executable Isabelle tool that can be run
3734 Isabelle2011/bin/isabelle jedit
3736 * Significantly improved Isabelle/Isar implementation manual.
3738 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3739 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3740 while the default heap location within that directory lacks that extra
3741 suffix. This isolates multiple Isabelle installations from each
3742 other, avoiding problems with old settings in new versions.
3743 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3745 * Source files are always encoded as UTF-8, instead of old-fashioned
3746 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3747 the following package declarations:
3749 \usepackage[utf8]{inputenc}
3750 \usepackage{textcomp}
3752 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3753 a Unicode character is treated as a single symbol, not a sequence of
3754 non-ASCII bytes as before. Since Isabelle/ML string literals may
3755 contain symbols without further backslash escapes, Unicode can now be
3756 used here as well. Recall that Symbol.explode in ML provides a
3757 consistent view on symbols, while raw explode (or String.explode)
3758 merely give a byte-oriented representation.
3760 * Theory loader: source files are primarily located via the master
3761 directory of each theory node (where the .thy file itself resides).
3762 The global load path is still partially available as legacy feature.
3763 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3764 explicit paths, relatively to the theory.
3766 * Special treatment of ML file names has been discontinued.
3767 Historically, optional extensions .ML or .sml were added on demand --
3768 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3769 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3771 * Various options that affect pretty printing etc. are now properly
3772 handled within the context via configuration options, instead of
3773 unsynchronized references or print modes. There are both ML Config.T
3774 entities and Isar declaration attributes to access these.
3776 ML (Config.T) Isar (attribute)
3778 eta_contract eta_contract
3779 show_brackets show_brackets
3780 show_sorts show_sorts
3781 show_types show_types
3782 show_question_marks show_question_marks
3783 show_consts show_consts
3784 show_abbrevs show_abbrevs
3786 Syntax.ast_trace syntax_ast_trace
3787 Syntax.ast_stat syntax_ast_stat
3788 Syntax.ambiguity_level syntax_ambiguity_level
3790 Goal_Display.goals_limit goals_limit
3791 Goal_Display.show_main_goal show_main_goal
3793 Method.rule_trace rule_trace
3795 Thy_Output.display thy_output_display
3796 Thy_Output.quotes thy_output_quotes
3797 Thy_Output.indent thy_output_indent
3798 Thy_Output.source thy_output_source
3799 Thy_Output.break thy_output_break
3801 Note that corresponding "..._default" references in ML may only be
3802 changed globally at the ROOT session setup, but *not* within a theory.
3803 The option "show_abbrevs" supersedes the former print mode
3804 "no_abbrevs" with inverted meaning.
3806 * More systematic naming of some configuration options.
3809 trace_simp ~> simp_trace
3810 debug_simp ~> simp_debug
3812 * Support for real valued configuration options, using simplistic
3813 floating-point notation that coincides with the inner syntax for
3816 * Support for real valued preferences (with approximative PGIP type):
3817 front-ends need to accept "pgint" values in float notation.
3820 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3823 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3828 * Command 'type_synonym' (with single argument) replaces somewhat
3829 outdated 'types', which is still available as legacy feature for some
3832 * Command 'nonterminal' (with 'and' separated list of arguments)
3833 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3835 * Command 'notepad' replaces former 'example_proof' for
3836 experimentation in Isar without any result. INCOMPATIBILITY.
3838 * Locale interpretation commands 'interpret' and 'sublocale' accept
3839 lists of equations to map definitions in a locale to appropriate
3840 entities in the context of the interpretation. The 'interpretation'
3841 command already provided this functionality.
3843 * Diagnostic command 'print_dependencies' prints the locale instances
3844 that would be activated if the specified expression was interpreted in
3845 the current context. Variant "print_dependencies!" assumes a context
3846 without interpretations.
3848 * Diagnostic command 'print_interps' prints interpretations in proofs
3849 in addition to interpretations in theories.
3851 * Discontinued obsolete 'global' and 'local' commands to manipulate
3852 the theory name space. Rare INCOMPATIBILITY. The ML functions
3853 Sign.root_path and Sign.local_path may be applied directly where this
3854 feature is still required for historical reasons.
3856 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3857 'definition' instead.
3859 * The "prems" fact, which refers to the accidental collection of
3860 foundational premises in the context, is now explicitly marked as
3861 legacy feature and will be discontinued soon. Consider using "assms"
3862 of the head statement or reference facts by explicit names.
3864 * Document antiquotations @{class} and @{type} print classes and type
3867 * Document antiquotation @{file} checks file/directory entries within
3868 the local file system.
3873 * Coercive subtyping: functions can be declared as coercions and type
3874 inference will add them as necessary upon input of a term. Theory
3875 Complex_Main declares real :: nat => real and real :: int => real as
3876 coercions. A coercion function f is declared like this:
3878 declare [[coercion f]]
3880 To lift coercions through type constructors (e.g. from nat => real to
3881 nat list => real list), map functions can be declared, e.g.
3883 declare [[coercion_map map]]
3885 Currently coercion inference is activated only in theories including
3886 real numbers, i.e. descendants of Complex_Main. This is controlled by
3887 the configuration option "coercion_enabled", e.g. it can be enabled in
3888 other theories like this:
3890 declare [[coercion_enabled]]
3892 * Command 'partial_function' provides basic support for recursive
3893 function definitions over complete partial orders. Concrete instances
3894 are provided for i) the option type, ii) tail recursion on arbitrary
3895 types, and iii) the heap monad of Imperative_HOL. See
3896 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3899 * Function package: f.psimps rules are no longer implicitly declared
3900 as [simp]. INCOMPATIBILITY.
3902 * Datatype package: theorems generated for executable equality (class
3903 "eq") carry proper names and are treated as default code equations.
3905 * Inductive package: now offers command 'inductive_simps' to
3906 automatically derive instantiated and simplified equations for
3907 inductive predicates, similar to 'inductive_cases'.
3909 * Command 'enriched_type' allows to register properties of the
3910 functorial structure of types.
3912 * Improved infrastructure for term evaluation using code generator
3913 techniques, in particular static evaluation conversions.
3915 * Code generator: Scala (2.8 or higher) has been added to the target
3918 * Code generator: globbing constant expressions "*" and "Theory.*"
3919 have been replaced by the more idiomatic "_" and "Theory._".
3922 * Code generator: export_code without explicit file declaration prints
3923 to standard output. INCOMPATIBILITY.
3925 * Code generator: do not print function definitions for case
3926 combinators any longer.
3928 * Code generator: simplification with rules determined with
3929 src/Tools/Code/code_simp.ML and method "code_simp".
3931 * Code generator for records: more idiomatic representation of record
3932 types. Warning: records are not covered by ancient SML code
3933 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3934 rep_datatype declaration helps to succeed then:
3938 rep_datatype foo_ext ...
3940 * Records: logical foundation type for records does not carry a
3941 '_type' suffix any longer (obsolete due to authentic syntax).
3944 * Quickcheck now by default uses exhaustive testing instead of random
3945 testing. Random testing can be invoked by "quickcheck [random]",
3946 exhaustive testing by "quickcheck [exhaustive]".
3948 * Quickcheck instantiates polymorphic types with small finite
3949 datatypes by default. This enables a simple execution mechanism to
3950 handle quantifiers and function equality over the finite datatypes.
3952 * Quickcheck random generator has been renamed from "code" to
3953 "random". INCOMPATIBILITY.
3955 * Quickcheck now has a configurable time limit which is set to 30
3956 seconds by default. This can be changed by adding [timeout = n] to the
3957 quickcheck command. The time limit for Auto Quickcheck is still set
3960 * Quickcheck in locales considers interpretations of that locale for
3961 counter example search.
3964 - Added "smt" and "remote_smt" provers based on the "smt" proof
3965 method. See the Sledgehammer manual for details ("isabelle doc
3968 sledgehammer atp_info ~> sledgehammer running_provers
3969 sledgehammer atp_kill ~> sledgehammer kill_provers
3970 sledgehammer available_atps ~> sledgehammer available_provers
3973 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3974 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3975 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3976 (and "ms" and "min" are no longer supported)
3981 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3982 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3984 - Added support for partial quotient types.
3985 - Added local versions of the "Nitpick.register_xxx" functions.
3986 - Added "whack" option.
3987 - Allow registration of quotient types as codatatypes.
3988 - Improved "merge_type_vars" option to merge more types.
3989 - Removed unsound "fast_descrs" option.
3990 - Added custom symmetry breaking for datatypes, making it possible to reach
3991 higher cardinalities.
3992 - Prevent the expansion of too large definitions.
3994 * Proof methods "metis" and "meson" now have configuration options
3995 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3996 to diagnose these tools. E.g.
3998 using [[metis_trace = true]]
4000 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4001 manually as command 'solve_direct'.
4003 * The default SMT solver Z3 must be enabled explicitly (due to
4004 licensing issues) by setting the environment variable
4005 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4006 commercial applications, the SMT solver CVC3 is provided as fall-back;
4007 changing the SMT solver is done via the configuration option
4010 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4011 i.e. "remote_cvc3" and "remote_z3".
4013 * Added basic SMT support for datatypes, records, and typedefs using
4014 the oracle mode (no proofs). Direct support of pairs has been dropped
4015 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4016 support for a similar behavior). Minor INCOMPATIBILITY.
4018 * Changed SMT configuration options:
4020 z3_proofs ~> smt_oracle (with inverted meaning)
4021 z3_trace_assms ~> smt_trace_used_facts
4034 * Boogie output files (.b2i files) need to be declared in the theory
4037 * Simplification procedure "list_to_set_comprehension" rewrites list
4038 comprehensions applied to List.set to set comprehensions. Occasional
4039 INCOMPATIBILITY, may be deactivated like this:
4041 declare [[simproc del: list_to_set_comprehension]]
4043 * Removed old version of primrec package. INCOMPATIBILITY.
4045 * Removed simplifier congruence rule of "prod_case", as has for long
4046 been the case with "split". INCOMPATIBILITY.
4048 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4050 * Removed [split_format ... and ... and ...] version of
4051 [split_format]. Potential INCOMPATIBILITY.
4053 * Predicate "sorted" now defined inductively, with nice induction
4054 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4056 * Constant "contents" renamed to "the_elem", to free the generic name
4057 contents for other uses. INCOMPATIBILITY.
4059 * Renamed class eq and constant eq (for code generation) to class
4060 equal and constant equal, plus renaming of related facts and various
4061 tuning. INCOMPATIBILITY.
4063 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4065 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4068 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4069 avoid confusion with finite sets. INCOMPATIBILITY.
4071 * Abandoned locales equiv, congruent and congruent2 for equivalence
4072 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4075 * Some previously unqualified names have been qualified:
4082 Trueprop ~> HOL.Trueprop
4087 op --> ~> HOL.implies
4099 Pair ~> Product_Type.Pair
4100 fst ~> Product_Type.fst
4101 snd ~> Product_Type.snd
4102 curry ~> Product_Type.curry
4104 Collect ~> Set.Collect
4108 * More canonical naming convention for some fundamental definitions:
4110 bot_bool_eq ~> bot_bool_def
4111 top_bool_eq ~> top_bool_def
4112 inf_bool_eq ~> inf_bool_def
4113 sup_bool_eq ~> sup_bool_def
4114 bot_fun_eq ~> bot_fun_def
4115 top_fun_eq ~> top_fun_def
4116 inf_fun_eq ~> inf_fun_def
4117 sup_fun_eq ~> sup_fun_def
4121 * More stylized fact names:
4123 expand_fun_eq ~> fun_eq_iff
4124 expand_set_eq ~> set_eq_iff
4126 nat_number ~> eval_nat_numeral
4130 * Refactoring of code-generation specific operations in theory List:
4136 mem_iff ~> member_def
4137 null_empty ~> null_def
4139 INCOMPATIBILITY. Note that these were not supposed to be used
4140 regularly unless for striking reasons; their main purpose was code
4143 Various operations from the Haskell prelude are used for generating
4146 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4147 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4148 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4150 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4151 "*" and "+" respectively. INCOMPATIBILITY.
4153 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4154 "Sum_Type.Plus" instead.
4156 * Constant "split" has been merged with constant "prod_case"; names of
4157 ML functions, facts etc. involving split have been retained so far,
4158 though. INCOMPATIBILITY.
4160 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4161 instead. INCOMPATIBILITY.
4163 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4166 * Former theory Library/Enum is now part of the HOL-Main image.
4167 INCOMPATIBILITY: all constants of the Enum theory now have to be
4168 referred to by its qualified name.
4171 nlists ~> Enum.nlists
4172 product ~> Enum.product
4174 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4175 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4178 * Theory Library/SetsAndFunctions has been split into
4179 Library/Function_Algebras and Library/Set_Algebras; canonical names
4180 for instance definitions for functions; various improvements.
4183 * Theory Library/Multiset provides stable quicksort implementation of
4186 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4189 * Session Multivariate_Analysis: introduced a type class for euclidean
4190 space. Most theorems are now stated in terms of euclidean spaces
4191 instead of finite cartesian products.
4194 real ^ 'n ~> 'a::real_vector
4195 ~> 'a::euclidean_space
4196 ~> 'a::ordered_euclidean_space
4197 (depends on your needs)
4201 \<chi> x. _ ~> \<chi>\<chi> x. _
4204 Also note that the indices are now natural numbers and not from some
4205 finite type. Finite cartesian products of euclidean spaces, products
4206 of euclidean spaces the real and complex numbers are instantiated to
4207 be euclidean_spaces. INCOMPATIBILITY.
4209 * Session Probability: introduced pextreal as positive extended real
4210 numbers. Use pextreal as value for measures. Introduce the
4211 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4212 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4213 the integral in Multivariate Analysis. INCOMPATIBILITY.
4215 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4218 * Session SPARK (with image HOL-SPARK) provides commands to load and
4219 prove verification conditions generated by the SPARK Ada program
4220 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4225 * Theorems for additive ring operations (locale abelian_monoid and
4226 descendants) are generated by interpretation from their multiplicative
4227 counterparts. Names (in particular theorem names) have the mandatory
4228 qualifier 'add'. Previous theorem names are redeclared for
4231 * Structure "int_ring" is now an abbreviation (previously a
4232 definition). This fits more natural with advanced interpretations.
4237 * The domain package now runs in definitional mode by default: The
4238 former command 'new_domain' is now called 'domain'. To use the domain
4239 package in its original axiomatic mode, use 'domain (unsafe)'.
4242 * The new class "domain" is now the default sort. Class "predomain"
4243 is an unpointed version of "domain". Theories can be updated by
4244 replacing sort annotations as shown below. INCOMPATIBILITY.
4246 'a::type ~> 'a::countable
4247 'a::cpo ~> 'a::predomain
4248 'a::pcpo ~> 'a::domain
4250 * The old type class "rep" has been superseded by class "domain".
4251 Accordingly, users of the definitional package must remove any
4252 "default_sort rep" declarations. INCOMPATIBILITY.
4254 * The domain package (definitional mode) now supports unpointed
4255 predomain argument types, as long as they are marked 'lazy'. (Strict
4256 arguments must be in class "domain".) For example, the following
4257 domain definition now works:
4259 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4261 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4262 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4263 'a option, and 'a list. Additionally, it configures fixrec and the
4264 domain package to work with these types. For example:
4266 fixrec isInl :: "('a + 'b) u -> tr"
4267 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4269 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4271 * The "(permissive)" option of fixrec has been replaced with a
4272 per-equation "(unchecked)" option. See
4273 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4275 * The "bifinite" class no longer fixes a constant "approx"; the class
4276 now just asserts that such a function exists. INCOMPATIBILITY.
4278 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4279 defines an embedding of type 'a defl into udom by default; instances
4280 of "bifinite" and "domain" classes are available in
4281 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4283 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4285 * The predicate "directed" has been removed. INCOMPATIBILITY.
4287 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4289 * The function "cprod_map" has been renamed to "prod_map".
4292 * The monadic bind operator on each powerdomain has new binder syntax
4293 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4294 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4296 * The infix syntax for binary union on each powerdomain has changed
4297 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4298 syntax. INCOMPATIBILITY.
4300 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4301 still supported as an input translation.
4303 * Renamed some theorems (the original names are also still available).
4305 expand_fun_below ~> fun_below_iff
4306 below_fun_ext ~> fun_belowI
4307 expand_cfun_eq ~> cfun_eq_iff
4308 ext_cfun ~> cfun_eqI
4309 expand_cfun_below ~> cfun_below_iff
4310 below_cfun_ext ~> cfun_belowI
4311 cont2cont_Rep_CFun ~> cont2cont_APP
4313 * The Abs and Rep functions for various types have changed names.
4314 Related theorem names have also changed to match. INCOMPATIBILITY.
4316 Rep_CFun ~> Rep_cfun
4317 Abs_CFun ~> Abs_cfun
4318 Rep_Sprod ~> Rep_sprod
4319 Abs_Sprod ~> Abs_sprod
4320 Rep_Ssum ~> Rep_ssum
4321 Abs_Ssum ~> Abs_ssum
4323 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4324 been renamed to *_bottom_iff. INCOMPATIBILITY.
4326 * Various changes to bisimulation/coinduction with domain package:
4328 - Definitions of "bisim" constants no longer mention definedness.
4329 - With mutual recursion, "bisim" predicate is now curried.
4330 - With mutual recursion, each type gets a separate coind theorem.
4331 - Variable names in bisim_def and coinduct rules have changed.
4335 * Case combinators generated by the domain package for type "foo" are
4336 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4338 * Several theorems have been renamed to more accurately reflect the
4339 names of constants and types involved. INCOMPATIBILITY.
4341 thelub_const ~> lub_const
4342 lub_const ~> is_lub_const
4344 is_lub_lub ~> is_lubD2
4346 unique_lub ~> is_lub_unique
4347 is_ub_lub ~> is_lub_rangeD1
4348 lub_bin_chain ~> is_lub_bin_chain
4349 lub_fun ~> is_lub_fun
4350 thelub_fun ~> lub_fun
4351 thelub_cfun ~> lub_cfun
4352 thelub_Pair ~> lub_Pair
4353 lub_cprod ~> is_lub_prod
4354 thelub_cprod ~> lub_prod
4355 minimal_cprod ~> minimal_prod
4356 inst_cprod_pcpo ~> inst_prod_pcpo
4358 compact_UU ~> compact_bottom
4359 deflation_UU ~> deflation_bottom
4360 finite_deflation_UU ~> finite_deflation_bottom
4362 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4364 sq_ord_less_eq_trans ~> below_eq_trans
4365 sq_ord_eq_less_trans ~> eq_below_trans
4366 refl_less ~> below_refl
4367 trans_less ~> below_trans
4368 antisym_less ~> below_antisym
4369 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4370 box_less ~> box_below
4371 rev_trans_less ~> rev_below_trans
4372 not_less2not_eq ~> not_below2not_eq
4373 less_UU_iff ~> below_UU_iff
4374 flat_less_iff ~> flat_below_iff
4375 adm_less ~> adm_below
4376 adm_not_less ~> adm_not_below
4377 adm_compact_not_less ~> adm_compact_not_below
4378 less_fun_def ~> below_fun_def
4379 expand_fun_less ~> fun_below_iff
4380 less_fun_ext ~> fun_belowI
4381 less_discr_def ~> below_discr_def
4382 discr_less_eq ~> discr_below_eq
4383 less_unit_def ~> below_unit_def
4384 less_cprod_def ~> below_prod_def
4385 prod_lessI ~> prod_belowI
4386 Pair_less_iff ~> Pair_below_iff
4387 fst_less_iff ~> fst_below_iff
4388 snd_less_iff ~> snd_below_iff
4389 expand_cfun_less ~> cfun_below_iff
4390 less_cfun_ext ~> cfun_belowI
4391 injection_less ~> injection_below
4392 less_up_def ~> below_up_def
4393 not_Iup_less ~> not_Iup_below
4394 Iup_less ~> Iup_below
4396 Def_inject_less_eq ~> Def_below_Def
4397 Def_less_is_eq ~> Def_below_iff
4398 spair_less_iff ~> spair_below_iff
4399 less_sprod ~> below_sprod
4400 spair_less ~> spair_below
4401 sfst_less_iff ~> sfst_below_iff
4402 ssnd_less_iff ~> ssnd_below_iff
4403 fix_least_less ~> fix_least_below
4404 dist_less_one ~> dist_below_one
4405 less_ONE ~> below_ONE
4406 ONE_less_iff ~> ONE_below_iff
4407 less_sinlD ~> below_sinlD
4408 less_sinrD ~> below_sinrD
4413 * All constant names are now qualified internally and use proper
4414 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4419 * Antiquotation @{assert} inlines a function bool -> unit that raises
4420 Fail if the argument is false. Due to inlining the source position of
4421 failed assertions is included in the error output.
4423 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4424 text is in practice always evaluated with a stable theory checkpoint.
4425 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4427 * Antiquotation @{theory A} refers to theory A from the ancestry of
4428 the current context, not any accidental theory loader state as before.
4429 Potential INCOMPATIBILITY, subtle change in semantics.
4431 * Syntax.pretty_priority (default 0) configures the required priority
4432 of pretty-printed output and thus affects insertion of parentheses.
4434 * Syntax.default_root (default "any") configures the inner syntax
4435 category (nonterminal symbol) for parsing of terms.
4437 * Former exception Library.UnequalLengths now coincides with
4438 ListPair.UnequalLengths.
4440 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4441 main functionality is provided by structure Simplifier.
4443 * Renamed raw "explode" function to "raw_explode" to emphasize its
4444 meaning. Note that internally to Isabelle, Symbol.explode is used in
4445 almost all situations.
4447 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4448 See implementation manual for further details on exceptions in
4451 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4454 * Renamed structure PureThy to Pure_Thy and moved most of its
4455 operations to structure Global_Theory, to emphasize that this is
4456 rarely-used global-only stuff.
4458 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4459 instead (or tracing for high-volume output).
4461 * Configuration option show_question_marks only affects regular pretty
4462 printing of types and terms, not raw Term.string_of_vname.
4464 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4465 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4466 @{thms} for most purposes.
4468 * ML structure Unsynchronized is never opened, not even in Isar
4469 interaction mode as before. Old Unsynchronized.set etc. have been
4470 discontinued -- use plain := instead. This should be *rare* anyway,
4471 since modern tools always work via official context data, notably
4472 configuration options.
4474 * Parallel and asynchronous execution requires special care concerning
4475 interrupts. Structure Exn provides some convenience functions that
4476 avoid working directly with raw Interrupt. User code must not absorb
4477 interrupts -- intermediate handling (for cleanup etc.) needs to be
4478 followed by re-raising of the original exception. Another common
4479 source of mistakes are "handle _" patterns, which make the meaning of
4480 the program subject to physical effects of the environment.
4484 New in Isabelle2009-2 (June 2010)
4485 ---------------------------------
4489 * Authentic syntax for *all* logical entities (type classes, type
4490 constructors, term constants): provides simple and robust
4491 correspondence between formal entities and concrete syntax. Within
4492 the parse tree / AST representations, "constants" are decorated by
4493 their category (class, type, const) and spelled out explicitly with
4494 their full internal name.
4496 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4497 and translations (translation rules and translation functions in ML).
4498 Some hints on upgrading:
4500 - Many existing uses of 'syntax' and 'translations' can be replaced
4501 by more modern 'type_notation', 'notation' and 'abbreviation',
4502 which are independent of this issue.
4504 - 'translations' require markup within the AST; the term syntax
4505 provides the following special forms:
4507 CONST c -- produces syntax version of constant c from context
4508 XCONST c -- literally c, checked as constant from context
4509 c -- literally c, if declared by 'syntax'
4511 Plain identifiers are treated as AST variables -- occasionally the
4512 system indicates accidental variables via the error "rhs contains
4515 Type classes and type constructors are marked according to their
4516 concrete syntax. Some old translations rules need to be written
4517 for the "type" category, using type constructor application
4518 instead of pseudo-term application of the default category
4521 - 'parse_translation' etc. in ML may use the following
4524 @{class_syntax c} -- type class c within parse tree / AST
4525 @{term_syntax c} -- type constructor c within parse tree / AST
4526 @{const_syntax c} -- ML version of "CONST c" above
4527 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4529 - Literal types within 'typed_print_translations', i.e. those *not*
4530 represented as pseudo-terms are represented verbatim. Use @{class
4531 c} or @{type_name c} here instead of the above syntax
4534 Note that old non-authentic syntax was based on unqualified base
4535 names, so all of the above "constant" names would coincide. Recall
4536 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4537 diagnose syntax problems.
4539 * Type constructors admit general mixfix syntax, not just infix.
4541 * Concrete syntax may be attached to local entities without a proof
4542 body, too. This works via regular mixfix annotations for 'fix',
4543 'def', 'obtain' etc. or via the explicit 'write' command, which is
4544 similar to the 'notation' command in theory specifications.
4546 * Discontinued unnamed infix syntax (legacy feature for many years) --
4547 need to specify constant name and syntax separately. Internal ML
4548 datatype constructors have been renamed from InfixName to Infix etc.
4549 Minor INCOMPATIBILITY.
4551 * Schematic theorem statements need to be explicitly markup as such,
4552 via commands 'schematic_lemma', 'schematic_theorem',
4553 'schematic_corollary'. Thus the relevance of the proof is made
4554 syntactically clear, which impacts performance in a parallel or
4555 asynchronous interactive environment. Minor INCOMPATIBILITY.
4557 * Use of cumulative prems via "!" in some proof methods has been
4558 discontinued (old legacy feature).
4560 * References 'trace_simp' and 'debug_simp' have been replaced by
4561 configuration options stored in the context. Enabling tracing (the
4562 case of debugging is similar) in proofs works via
4564 using [[trace_simp = true]]
4566 Tracing is then active for all invocations of the simplifier in
4567 subsequent goal refinement steps. Tracing may also still be enabled or
4568 disabled via the ProofGeneral settings menu.
4570 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4571 'hide_fact' replace the former 'hide' KIND command. Minor
4574 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4575 more efficient than combinations with -q1 or -q2.
4580 * Proofterms record type-class reasoning explicitly, using the
4581 "unconstrain" operation internally. This eliminates all sort
4582 constraints from a theorem and proof, introducing explicit
4583 OFCLASS-premises. On the proof term level, this operation is
4584 automatically applied at theorem boundaries, such that closed proofs
4585 are always free of sort constraints. INCOMPATIBILITY for tools that
4586 inspect proof terms.
4588 * Local theory specifications may depend on extra type variables that
4589 are not present in the result type -- arguments TYPE('a) :: 'a itself
4590 are added internally. For example:
4592 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4594 * Predicates of locales introduced by classes carry a mandatory
4595 "class" prefix. INCOMPATIBILITY.
4597 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4599 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4602 * Command 'code_reflect' allows to incorporate generated ML code into
4603 runtime environment; replaces immature code_datatype antiquotation.
4606 * Code generator: simple concept for abstract datatypes obeying
4609 * Code generator: details of internal data cache have no impact on the
4610 user space functionality any longer.
4612 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4613 subgoals. This is more appropriate for interpretations with 'where'.
4616 * Command 'example_proof' opens an empty proof body. This allows to
4617 experiment with Isar, without producing any persistent result.
4619 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4620 within a local theory context, with explicit checking of the
4621 constructors involved (in contrast to the raw 'syntax' versions).
4623 * Commands 'types' and 'typedecl' now work within a local theory
4624 context -- without introducing dependencies on parameters or
4625 assumptions, which is not possible in Isabelle/Pure.
4627 * Command 'defaultsort' has been renamed to 'default_sort', it works
4628 within a local theory context. Minor INCOMPATIBILITY.
4633 * Command 'typedef' now works within a local theory context -- without
4634 introducing dependencies on parameters or assumptions, which is not
4635 possible in Isabelle/Pure/HOL. Note that the logical environment may
4636 contain multiple interpretations of local typedefs (with different
4637 non-emptiness proofs), even in a global theory context.
4639 * New package for quotient types. Commands 'quotient_type' and
4640 'quotient_definition' may be used for defining types and constants by
4641 quotient constructions. An example is the type of integers created by
4642 quotienting pairs of natural numbers:
4645 intrel :: "(nat * nat) => (nat * nat) => bool"
4647 "intrel (x, y) (u, v) = (x + v = u + y)"
4649 quotient_type int = "nat * nat" / intrel
4650 by (auto simp add: equivp_def expand_fun_eq)
4653 "0::int" is "(0::nat, 0::nat)"
4655 The method "lifting" can be used to lift of theorems from the
4656 underlying "raw" type to the quotient type. The example
4657 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4658 construction and provides a reasoning infrastructure for finite sets.
4660 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4661 clash with new theory Quotient in Main HOL.
4663 * Moved the SMT binding into the main HOL session, eliminating
4664 separate HOL-SMT session.
4666 * List membership infix mem operation is only an input abbreviation.
4669 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4670 for future developements; former Library/Word.thy is still present in
4671 the AFP entry RSAPPS.
4673 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4674 longer shadowed. INCOMPATIBILITY.
4676 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4679 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4682 * Dropped normalizing_semiring etc; use the facts in semiring classes
4683 instead. INCOMPATIBILITY.
4685 * Dropped several real-specific versions of lemmas about floor and
4686 ceiling; use the generic lemmas from theory "Archimedean_Field"
4687 instead. INCOMPATIBILITY.
4689 floor_number_of_eq ~> floor_number_of
4690 le_floor_eq_number_of ~> number_of_le_floor
4691 le_floor_eq_zero ~> zero_le_floor
4692 le_floor_eq_one ~> one_le_floor
4693 floor_less_eq_number_of ~> floor_less_number_of
4694 floor_less_eq_zero ~> floor_less_zero
4695 floor_less_eq_one ~> floor_less_one
4696 less_floor_eq_number_of ~> number_of_less_floor
4697 less_floor_eq_zero ~> zero_less_floor
4698 less_floor_eq_one ~> one_less_floor
4699 floor_le_eq_number_of ~> floor_le_number_of
4700 floor_le_eq_zero ~> floor_le_zero
4701 floor_le_eq_one ~> floor_le_one
4702 floor_subtract_number_of ~> floor_diff_number_of
4703 floor_subtract_one ~> floor_diff_one
4704 ceiling_number_of_eq ~> ceiling_number_of
4705 ceiling_le_eq_number_of ~> ceiling_le_number_of
4706 ceiling_le_zero_eq ~> ceiling_le_zero
4707 ceiling_le_eq_one ~> ceiling_le_one
4708 less_ceiling_eq_number_of ~> number_of_less_ceiling
4709 less_ceiling_eq_zero ~> zero_less_ceiling
4710 less_ceiling_eq_one ~> one_less_ceiling
4711 ceiling_less_eq_number_of ~> ceiling_less_number_of
4712 ceiling_less_eq_zero ~> ceiling_less_zero
4713 ceiling_less_eq_one ~> ceiling_less_one
4714 le_ceiling_eq_number_of ~> number_of_le_ceiling
4715 le_ceiling_eq_zero ~> zero_le_ceiling
4716 le_ceiling_eq_one ~> one_le_ceiling
4717 ceiling_subtract_number_of ~> ceiling_diff_number_of
4718 ceiling_subtract_one ~> ceiling_diff_one
4720 * Theory "Finite_Set": various folding_XXX locales facilitate the
4721 application of the various fold combinators on finite sets.
4723 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4724 provides abstract red-black tree type which is backed by "RBT_Impl" as
4725 implementation. INCOMPATIBILTY.
4727 * Theory Library/Coinductive_List has been removed -- superseded by
4728 AFP/thys/Coinductive.
4730 * Theory PReal, including the type "preal" and related operations, has
4731 been removed. INCOMPATIBILITY.
4733 * Real: new development using Cauchy Sequences.
4735 * Split off theory "Big_Operators" containing setsum, setprod,
4736 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4738 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4739 "Int" etc. INCOMPATIBILITY.
4741 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4743 * New set of rules "ac_simps" provides combined assoc / commute
4744 rewrites for all interpretations of the appropriate generic locales.
4746 * Renamed theory "OrderedGroup" to "Groups" and split theory
4747 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4748 appropriate and more consistent names suitable for name prefixes
4749 within the HOL theories. INCOMPATIBILITY.
4751 * Some generic constants have been put to appropriate theories:
4752 - less_eq, less: Orderings
4753 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4754 - inverse, divide: Rings
4757 * More consistent naming of type classes involving orderings (and
4760 lower_semilattice ~> semilattice_inf
4761 upper_semilattice ~> semilattice_sup
4763 dense_linear_order ~> dense_linorder
4765 pordered_ab_group_add ~> ordered_ab_group_add
4766 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4767 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4768 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4769 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4770 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4771 pordered_cancel_semiring ~> ordered_cancel_semiring
4772 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4773 pordered_comm_ring ~> ordered_comm_ring
4774 pordered_comm_semiring ~> ordered_comm_semiring
4775 pordered_ring ~> ordered_ring
4776 pordered_ring_abs ~> ordered_ring_abs
4777 pordered_semiring ~> ordered_semiring
4779 ordered_ab_group_add ~> linordered_ab_group_add
4780 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4781 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4782 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4783 ordered_field ~> linordered_field
4784 ordered_field_no_lb ~> linordered_field_no_lb
4785 ordered_field_no_ub ~> linordered_field_no_ub
4786 ordered_field_dense_linear_order ~> dense_linordered_field
4787 ordered_idom ~> linordered_idom
4788 ordered_ring ~> linordered_ring
4789 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4790 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4791 ordered_ring_strict ~> linordered_ring_strict
4792 ordered_semidom ~> linordered_semidom
4793 ordered_semiring ~> linordered_semiring
4794 ordered_semiring_1 ~> linordered_semiring_1
4795 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4796 ordered_semiring_strict ~> linordered_semiring_strict
4798 The following slightly odd type classes have been moved to a
4799 separate theory Library/Lattice_Algebras:
4801 lordered_ab_group_add ~> lattice_ab_group_add
4802 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4803 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4804 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4805 lordered_ring ~> lattice_ring
4809 * Refined field classes:
4810 - classes division_ring_inverse_zero, field_inverse_zero,
4811 linordered_field_inverse_zero include rule inverse 0 = 0 --
4812 subsumes former division_by_zero class;
4813 - numerous lemmas have been ported from field to division_ring.
4816 * Refined algebra theorem collections:
4817 - dropped theorem group group_simps, use algebra_simps instead;
4818 - dropped theorem group ring_simps, use field_simps instead;
4819 - proper theorem collection field_simps subsumes former theorem
4820 groups field_eq_simps and field_simps;
4821 - dropped lemma eq_minus_self_iff which is a duplicate for
4825 * Theory Finite_Set and List: some lemmas have been generalized from
4828 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4829 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4830 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4831 union_Union_fold_union ~> sup_Sup_fold_sup
4832 Inter_fold_inter ~> Inf_fold_inf
4833 Union_fold_union ~> Sup_fold_sup
4834 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4835 union_UNION_fold_union ~> sup_SUPR_fold_sup
4836 INTER_fold_inter ~> INFI_fold_inf
4837 UNION_fold_union ~> SUPR_fold_sup
4839 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4840 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4841 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4842 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4843 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4844 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4846 * Reorganized theory Multiset: swapped notation of pointwise and
4849 - pointwise ordering is instance of class order with standard syntax
4851 - multiset ordering has syntax <=# and <#; partial order properties
4852 are provided by means of interpretation with prefix
4854 - less duplication, less historical organization of sections,
4855 conversion from associations lists to multisets, rudimentary code
4857 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4862 multiset_eq_conv_count_eq ~> multiset_ext_iff
4863 multi_count_ext ~> multiset_ext
4864 diff_union_inverse2 ~> diff_union_cancelR
4868 * Theory Permutation: replaced local "remove" by List.remove1.
4870 * Code generation: ML and OCaml code is decorated with signatures.
4872 * Theory List: added transpose.
4874 * Library/Nat_Bijection.thy is a collection of bijective functions
4875 between nat and other types, which supersedes the older libraries
4876 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4879 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4880 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4881 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4882 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4883 Countable.pair_encode ~> prod_encode
4884 NatIso.prod2nat ~> prod_encode
4885 NatIso.nat2prod ~> prod_decode
4886 NatIso.sum2nat ~> sum_encode
4887 NatIso.nat2sum ~> sum_decode
4888 NatIso.list2nat ~> list_encode
4889 NatIso.nat2list ~> list_decode
4890 NatIso.set2nat ~> set_encode
4891 NatIso.nat2set ~> set_decode
4894 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4895 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4896 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4897 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4898 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4899 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4900 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4901 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4902 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4903 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4904 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4905 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4906 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4909 - Renamed ATP commands:
4910 atp_info ~> sledgehammer running_atps
4911 atp_kill ~> sledgehammer kill_atps
4912 atp_messages ~> sledgehammer messages
4913 atp_minimize ~> sledgehammer minimize
4914 print_atps ~> sledgehammer available_atps
4916 - Added user's manual ("isabelle doc sledgehammer").
4917 - Added option syntax and "sledgehammer_params" to customize
4918 Sledgehammer's behavior. See the manual for details.
4919 - Modified the Isar proof reconstruction code so that it produces
4920 direct proofs rather than proofs by contradiction. (This feature
4921 is still experimental.)
4922 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4924 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4927 - Added and implemented "binary_ints" and "bits" options.
4928 - Added "std" option and implemented support for nonstandard models.
4929 - Added and implemented "finitize" option to improve the precision
4930 of infinite datatypes based on a monotonicity analysis.
4931 - Added support for quotient types.
4932 - Added support for "specification" and "ax_specification"
4934 - Added support for local definitions (for "function" and
4935 "termination" proofs).
4936 - Added support for term postprocessors.
4937 - Optimized "Multiset.multiset" and "FinFun.finfun".
4938 - Improved efficiency of "destroy_constrs" optimization.
4939 - Fixed soundness bugs related to "destroy_constrs" optimization and
4941 - Fixed soundness bug related to higher-order constructors.
4942 - Fixed soundness bug when "full_descrs" is enabled.
4943 - Improved precision of set constructs.
4944 - Added "atoms" option.
4945 - Added cache to speed up repeated Kodkod invocations on the same
4947 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4948 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4949 "SAT4J_Light". INCOMPATIBILITY.
4950 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4951 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4952 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4954 * Method "induct" now takes instantiations of the form t, where t is not
4955 a variable, as a shorthand for "x == t", where x is a fresh variable.
4956 If this is not intended, t has to be enclosed in parentheses.
4957 By default, the equalities generated by definitional instantiations
4958 are pre-simplified, which may cause parameters of inductive cases
4959 to disappear, or may even delete some of the inductive cases.
4960 Use "induct (no_simp)" instead of "induct" to restore the old
4961 behaviour. The (no_simp) option is also understood by the "cases"
4962 and "nominal_induct" methods, which now perform pre-simplification, too.
4968 * Variable names in lemmas generated by the domain package have
4969 changed; the naming scheme is now consistent with the HOL datatype
4970 package. Some proof scripts may be affected, INCOMPATIBILITY.
4972 * The domain package no longer defines the function "foo_copy" for
4973 recursive domain "foo". The reach lemma is now stated directly in
4974 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4975 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4977 * Most definedness lemmas generated by the domain package (previously
4978 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4979 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4980 Proofs that used definedness lemmas as intro rules may break,
4981 potential INCOMPATIBILITY.
4983 * Induction and casedist rules generated by the domain package now
4984 declare proper case_names (one called "bottom", and one named for each
4985 constructor). INCOMPATIBILITY.
4987 * For mutually-recursive domains, separate "reach" and "take_lemma"
4988 rules are generated for each domain, INCOMPATIBILITY.
4990 foo_bar.reach ~> foo.reach bar.reach
4991 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4993 * Some lemmas generated by the domain package have been renamed for
4994 consistency with the datatype package, INCOMPATIBILITY.
4996 foo.ind ~> foo.induct
4997 foo.finite_ind ~> foo.finite_induct
4998 foo.coind ~> foo.coinduct
4999 foo.casedist ~> foo.exhaust
5000 foo.exhaust ~> foo.nchotomy
5002 * For consistency with other definition packages, the fixrec package
5003 now generates qualified theorem names, INCOMPATIBILITY.
5005 foo_simps ~> foo.simps
5006 foo_unfold ~> foo.unfold
5007 foo_induct ~> foo.induct
5009 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5010 method and internal fixrec proofs now use the default simpset instead.
5013 * The "contlub" predicate has been removed. Proof scripts should use
5014 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5016 * The "admw" predicate has been removed, INCOMPATIBILITY.
5018 * The constants cpair, cfst, and csnd have been removed in favor of
5019 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5024 * Antiquotations for basic formal entities:
5026 @{class NAME} -- type class
5027 @{class_syntax NAME} -- syntax representation of the above
5029 @{type_name NAME} -- logical type
5030 @{type_abbrev NAME} -- type abbreviation
5031 @{nonterminal NAME} -- type of concrete syntactic category
5032 @{type_syntax NAME} -- syntax representation of any of the above
5034 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5035 @{const_abbrev NAME} -- abbreviated constant
5036 @{const_syntax NAME} -- syntax representation of any of the above
5038 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5039 syntax constant (cf. 'syntax' command).
5041 * Antiquotation @{make_string} inlines a function to print arbitrary
5042 values similar to the ML toplevel. The result is compiler dependent
5043 and may fall back on "?" in certain situations.
5045 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5046 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5047 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5048 not work with the asynchronous Isar document model.
5050 * Configuration options now admit dynamic default values, depending on
5051 the context or even global references.
5053 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5054 uses an efficient external library if available (for Poly/ML).
5056 * Renamed some important ML structures, while keeping the old names
5057 for some time as aliases within the structure Legacy:
5059 OuterKeyword ~> Keyword
5062 OuterSyntax ~> Outer_Syntax
5063 PrintMode ~> Print_Mode
5064 SpecParse ~> Parse_Spec
5067 ThyOutput ~> Thy_Output
5068 TypeInfer ~> Type_Infer
5070 Note that "open Legacy" simplifies porting of sources, but forgetting
5071 to remove it again will complicate porting again in the future.
5073 * Most operations that refer to a global context are named
5074 accordingly, e.g. Simplifier.global_context or
5075 ProofContext.init_global. There are some situations where a global
5076 context actually works, but under normal circumstances one needs to
5077 pass the proper local context through the code!
5079 * Discontinued old TheoryDataFun with its copy/init operation -- data
5080 needs to be pure. Functor Theory_Data_PP retains the traditional
5081 Pretty.pp argument to merge, which is absent in the standard
5082 Theory_Data version.
5084 * Sorts.certify_sort and derived "cert" operations for types and terms
5085 no longer minimize sorts. Thus certification at the boundary of the
5086 inference kernel becomes invariant under addition of class relations,
5087 which is an important monotonicity principle. Sorts are now minimized
5088 in the syntax layer only, at the boundary between the end-user and the
5089 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5090 explicitly in rare situations.
5092 * Renamed old-style Drule.standard to Drule.export_without_context, to
5093 emphasize that this is in no way a standard operation.
5096 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5097 usual for resolution. Rare INCOMPATIBILITY.
5099 * Renamed varify/unvarify operations to varify_global/unvarify_global
5100 to emphasize that these only work in a global situation (which is
5103 * Curried take and drop in library.ML; negative length is interpreted
5104 as infinity (as in chop). Subtle INCOMPATIBILITY.
5106 * Proof terms: type substitutions on proof constants now use canonical
5107 order of type variables. INCOMPATIBILITY for tools working with proof
5110 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5111 may no longer carry premises. User-level specifications are
5112 transformed accordingly by Thm.add_axiom/add_def.
5117 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5118 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5119 proof terms are enabled unconditionally in the new HOL-Proofs image.
5121 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5122 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5125 * Old lib/scripts/polyml-platform is superseded by the
5126 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5127 variant, even on a 64 bit machine. The following example setting
5128 prefers 64 bit if available:
5130 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5132 * The preliminary Isabelle/jEdit application demonstrates the emerging
5133 Isabelle/Scala layer for advanced prover interaction and integration.
5134 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5137 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5138 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5139 similar to the default assignment of the document preparation system
5140 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5141 provides some operations for direct access to the font without asking
5142 the user for manual installation.
5146 New in Isabelle2009-1 (December 2009)
5147 -------------------------------------
5151 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5152 one backslash should be used, even in ML sources.
5157 * Locale interpretation propagates mixins along the locale hierarchy.
5158 The currently only available mixins are the equations used to map
5159 local definitions to terms of the target domain of an interpretation.
5161 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5162 loc" to print all interpretations of locale "loc" in the theory.
5163 Interpretations in proofs are not shown.
5165 * Thoroughly revised locales tutorial. New section on conditional
5168 * On instantiation of classes, remaining undefined class parameters
5169 are formally declared. INCOMPATIBILITY.
5172 *** Document preparation ***
5174 * New generalized style concept for printing terms: @{foo (style) ...}
5175 instead of @{foo_style style ...} (old form is still retained for
5176 backward compatibility). Styles can be also applied for
5177 antiquotations prop, term_type and typeof.
5182 * New proof method "smt" for a combination of first-order logic with
5183 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5184 fixed-size bitvectors; there is also basic support for higher-order
5185 features (esp. lambda abstractions). It is an incomplete decision
5186 procedure based on external SMT solvers using the oracle mechanism;
5187 for the SMT solver Z3, this method is proof-producing. Certificates
5188 are provided to avoid calling the external solvers solely for
5189 re-checking proofs. Due to a remote SMT service there is no need for
5190 installing SMT solvers locally. See src/HOL/SMT.
5192 * New commands to load and prove verification conditions generated by
5193 the Boogie program verifier or derived systems (e.g. the Verifying C
5194 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5196 * New counterexample generator tool 'nitpick' based on the Kodkod
5197 relational model finder. See src/HOL/Tools/Nitpick and
5198 src/HOL/Nitpick_Examples.
5200 * New commands 'code_pred' and 'values' to invoke the predicate
5201 compiler and to enumerate values of inductive predicates.
5203 * A tabled implementation of the reflexive transitive closure.
5205 * New implementation of quickcheck uses generic code generator;
5206 default generators are provided for all suitable HOL types, records
5207 and datatypes. Old quickcheck can be re-activated importing theory
5208 Library/SML_Quickcheck.
5210 * New testing tool Mirabelle for automated proof tools. Applies
5211 several tools and tactics like sledgehammer, metis, or quickcheck, to
5212 every proof step in a theory. To be used in batch mode via the
5213 "mirabelle" utility.
5215 * New proof method "sos" (sum of squares) for nonlinear real
5216 arithmetic (originally due to John Harison). It requires theory
5217 Library/Sum_Of_Squares. It is not a complete decision procedure but
5218 works well in practice on quantifier-free real arithmetic with +, -,
5219 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5220 inequalities between polynomials. It makes use of external
5221 semidefinite programming solvers. Method "sos" generates a
5222 certificate that can be pasted into the proof thus avoiding the need
5223 to call an external tool every time the proof is checked. See
5224 src/HOL/Library/Sum_Of_Squares.
5226 * New method "linarith" invokes existing linear arithmetic decision
5229 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5231 * New Sledgehammer option "Full Types" in Proof General settings menu.
5232 Causes full type information to be output to the ATPs. This slows
5233 ATPs down considerably but eliminates a source of unsound "proofs"
5236 * New method "metisFT": A version of metis that uses full type
5237 information in order to avoid failures of proof reconstruction.
5239 * New evaluator "approximate" approximates an real valued term using
5240 the same method as the approximation method.
5242 * Method "approximate" now supports arithmetic expressions as
5243 boundaries of intervals and implements interval splitting and Taylor
5246 * ML antiquotation @{code_datatype} inserts definition of a datatype
5247 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5249 * New theory SupInf of the supremum and infimum operators for sets of
5252 * New theory Probability, which contains a development of measure
5253 theory, eventually leading to Lebesgue integration and probability.
5255 * Extended Multivariate Analysis to include derivation and Brouwer's
5258 * Reorganization of number theory, INCOMPATIBILITY:
5259 - new number theory development for nat and int, in theories Divides
5260 and GCD as well as in new session Number_Theory
5261 - some constants and facts now suffixed with _nat and _int
5263 - former session NumberTheory now named Old_Number_Theory, including
5264 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5265 - moved theory Pocklington from src/HOL/Library to
5266 src/HOL/Old_Number_Theory
5268 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5269 lcm of finite and infinite sets. It is shown that they form a complete
5272 * Class semiring_div requires superclass no_zero_divisors and proof of
5273 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5274 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5275 generalized to class semiring_div, subsuming former theorems
5276 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5277 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5280 * Refinements to lattice classes and sets:
5281 - less default intro/elim rules in locale variant, more default
5282 intro/elim rules in class variant: more uniformity
5283 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5285 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5287 - renamed ACI to inf_sup_aci
5288 - new class "boolean_algebra"
5289 - class "complete_lattice" moved to separate theory
5290 "Complete_Lattice"; corresponding constants (and abbreviations)
5291 renamed and with authentic syntax:
5292 Set.Inf ~> Complete_Lattice.Inf
5293 Set.Sup ~> Complete_Lattice.Sup
5294 Set.INFI ~> Complete_Lattice.INFI
5295 Set.SUPR ~> Complete_Lattice.SUPR
5296 Set.Inter ~> Complete_Lattice.Inter
5297 Set.Union ~> Complete_Lattice.Union
5298 Set.INTER ~> Complete_Lattice.INTER
5299 Set.UNION ~> Complete_Lattice.UNION
5300 - authentic syntax for
5303 - mere abbreviations:
5306 Set.inter (for inf, formerly Set.Int)
5307 Set.union (for sup, formerly Set.Un)
5308 Complete_Lattice.Inter (for Inf)
5309 Complete_Lattice.Union (for Sup)
5310 Complete_Lattice.INTER (for INFI)
5311 Complete_Lattice.UNION (for SUPR)
5312 - object-logic definitions as far as appropriate
5314 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5315 Un_subset_iff are explicitly deleted as default simp rules; then also
5316 their lattice counterparts le_inf_iff and le_sup_iff have to be
5317 deleted to achieve the desired effect.
5319 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5320 rules by default any longer; the same applies to min_max.inf_absorb1
5321 etc. INCOMPATIBILITY.
5323 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5324 pred_set_conv by default. INCOMPATIBILITY.
5326 * Power operations on relations and functions are now one dedicated
5327 constant "compow" with infix syntax "^^". Power operation on
5328 multiplicative monoids retains syntax "^" and is now defined generic
5329 in class power. INCOMPATIBILITY.
5331 * Relation composition "R O S" now has a more standard argument order:
5332 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5333 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5334 break, since the O_assoc rule was not rewritten like this. Fix using
5335 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5337 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5338 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5341 * Most rules produced by inductive and datatype package have mandatory
5342 prefixes. INCOMPATIBILITY.
5344 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5345 the attribute of the same name. Each of the theorems in the list
5346 DERIV_intros assumes composition with an additional function and
5347 matches a variable to the derivative, which has to be solved by the
5348 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5349 of most elementary terms. Former Maclauren.DERIV_tac and
5350 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5353 * Code generator attributes follow the usual underscore convention:
5354 code_unfold replaces code unfold
5355 code_post replaces code post
5360 sizechange -> size_change
5361 induct_scheme -> induction_schema
5364 * Discontinued abbreviation "arbitrary" of constant "undefined".
5365 INCOMPATIBILITY, use "undefined" directly.
5368 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5369 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5370 Suc_plus1 -> Suc_eq_plus1
5371 *anti_sym -> *antisym*
5372 vector_less_eq_def -> vector_le_def
5375 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5378 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5384 * Theory Representable defines a class "rep" of domains that are
5385 representable (via an ep-pair) in the universal domain type "udom".
5386 Instances are provided for all type constructors defined in HOLCF.
5388 * The 'new_domain' command is a purely definitional version of the
5389 domain package, for representable domains. Syntax is identical to the
5390 old domain package. The 'new_domain' package also supports indirect
5391 recursion using previously-defined type constructors. See
5392 src/HOLCF/ex/New_Domain.thy for examples.
5394 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5395 on the left-hand side of an equation, and then performs
5396 simplification. Rewriting is done using rules declared with the
5397 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5398 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5400 * The pattern-match compiler in 'fixrec' can now handle constructors
5401 with HOL function types. Pattern-match combinators for the Pair
5402 constructor are pre-configured.
5404 * The 'fixrec' package now produces better fixed-point induction rules
5405 for mutually-recursive definitions: Induction rules have conclusions
5406 of the form "P foo bar" instead of "P <foo, bar>".
5408 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5409 been renamed to "below". The name "below" now replaces "less" in many
5410 theorem names. (Legacy theorem names using "less" are still supported
5413 * The 'fixrec' package now supports "bottom patterns". Bottom
5414 patterns can be used to generate strictness rules, or to make
5415 functions more strict (much like the bang-patterns supported by the
5416 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5422 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5423 errors and run-time exceptions, including detailed source positions.
5425 * Structure Name_Space (formerly NameSpace) now manages uniquely
5426 identified entries, with some additional information such as source
5427 position, logical grouping etc.
5429 * Theory and context data is now introduced by the simplified and
5430 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5431 to be pure, but the old TheoryDataFun for mutable data (with explicit
5432 copy operation) is still available for some time.
5434 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5435 provides a high-level programming interface to synchronized state
5436 variables with atomic update. This works via pure function
5437 application within a critical section -- its runtime should be as
5438 short as possible; beware of deadlocks if critical code is nested,
5439 either directly or indirectly via other synchronized variables!
5441 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5442 wraps raw ML references, explicitly indicating their non-thread-safe
5443 behaviour. The Isar toplevel keeps this structure open, to
5444 accommodate Proof General as well as quick and dirty interactive
5445 experiments with references.
5447 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5448 parallel tactical reasoning.
5450 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5451 are similar to SUBPROOF, but are slightly more flexible: only the
5452 specified parts of the subgoal are imported into the context, and the
5453 body tactic may introduce new subgoals and schematic variables.
5455 * Old tactical METAHYPS, which does not observe the proof context, has
5456 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5457 or Subgoal.FOCUS etc.
5459 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5460 functors have their own ML name space there is no point to mark them
5461 separately.) Minor INCOMPATIBILITY.
5463 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5465 * Renamed several structures FooBar to Foo_Bar. Occasional,
5468 * Operations of structure Skip_Proof no longer require quick_and_dirty
5469 mode, which avoids critical setmp.
5471 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5472 combinators for "args". INCOMPATIBILITY, need to use simplified
5473 Attrib/Method.setup introduced in Isabelle2009.
5475 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5476 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5477 last resort. INCOMPATIBILITY.
5479 * Display.pretty_thm now requires a proper context (cf. former
5480 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5481 or even Display.pretty_thm_without_context as last resort.
5484 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5485 Syntax.pretty_typ/term directly, preferably with proper context
5486 instead of global theory.
5491 * Further fine tuning of parallel proof checking, scales up to 8 cores
5492 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5495 * Support for additional "Isabelle components" via etc/components, see
5496 also the system manual.
5498 * The isabelle makeall tool now operates on all components with
5499 IsaMakefile, not just hardwired "logics".
5501 * Removed "compress" option from isabelle-process and isabelle usedir;
5502 this is always enabled.
5504 * Discontinued support for Poly/ML 4.x versions.
5506 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5507 on a given logic image. This requires the lighttpd webserver and is
5508 currently supported on Linux only.
5512 New in Isabelle2009 (April 2009)
5513 --------------------------------
5517 * Simplified main Isabelle executables, with less surprises on
5518 case-insensitive file-systems (such as Mac OS).
5520 - The main Isabelle tool wrapper is now called "isabelle" instead of
5523 - The former "isabelle" alias for "isabelle-process" has been
5524 removed (should rarely occur to regular users).
5526 - The former "isabelle-interface" and its alias "Isabelle" have been
5527 removed (interfaces are now regular Isabelle tools).
5529 Within scripts and make files, the Isabelle environment variables
5530 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5531 respectively. (The latter are still available as legacy feature.)
5533 The old isabelle-interface wrapper could react in confusing ways if
5534 the interface was uninstalled or changed otherwise. Individual
5535 interface tool configuration is now more explicit, see also the
5536 Isabelle system manual. In particular, Proof General is now available
5537 via "isabelle emacs".
5539 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5540 purge installed copies of Isabelle executables and re-run "isabelle
5541 install -p ...", or use symlinks.
5543 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5544 old ~/isabelle, which was slightly non-standard and apt to cause
5545 surprises on case-insensitive file-systems (such as Mac OS).
5547 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5548 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5549 care is required when using older releases of Isabelle. Note that
5550 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5551 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5553 * Proofs of fully specified statements are run in parallel on
5554 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5555 a regular 4-core machine, if the initial heap space is made reasonably
5556 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5558 * The main reference manuals ("isar-ref", "implementation", and
5559 "system") have been updated and extended. Formally checked references
5560 as hyperlinks are now available uniformly.
5565 * Complete re-implementation of locales. INCOMPATIBILITY in several
5566 respects. The most important changes are listed below. See the
5567 Tutorial on Locales ("locales" manual) for details.
5569 - In locale expressions, instantiation replaces renaming. Parameters
5570 must be declared in a for clause. To aid compatibility with previous
5571 parameter inheritance, in locale declarations, parameters that are not
5572 'touched' (instantiation position "_" or omitted) are implicitly added
5573 with their syntax at the beginning of the for clause.
5575 - Syntax from abbreviations and definitions in locales is available in
5576 locale expressions and context elements. The latter is particularly
5577 useful in locale declarations.
5579 - More flexible mechanisms to qualify names generated by locale
5580 expressions. Qualifiers (prefixes) may be specified in locale
5581 expressions, and can be marked as mandatory (syntax: "name!:") or
5582 optional (syntax "name?:"). The default depends for plain "name:"
5583 depends on the situation where a locale expression is used: in
5584 commands 'locale' and 'sublocale' prefixes are optional, in
5585 'interpretation' and 'interpret' prefixes are mandatory. The old
5586 implicit qualifiers derived from the parameter names of a locale are
5587 no longer generated.
5589 - Command "sublocale l < e" replaces "interpretation l < e". The
5590 instantiation clause in "interpretation" and "interpret" (square
5591 brackets) is no longer available. Use locale expressions.
5593 - When converting proof scripts, mandatory qualifiers in
5594 'interpretation' and 'interpret' should be retained by default, even
5595 if this is an INCOMPATIBILITY compared to former behavior. In the
5596 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5597 in locale expressions range over a single locale instance only.
5599 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5600 In existing theorem specifications replace the includes element by the
5601 respective context elements of the included locale, omitting those
5602 that are already present in the theorem specification. Multiple
5603 assume elements of a locale should be replaced by a single one
5604 involving the locale predicate. In the proof body, declarations (most
5605 notably theorems) may be regained by interpreting the respective
5606 locales in the proof context as required (command "interpret").
5608 If using "includes" in replacement of a target solely because the
5609 parameter types in the theorem are not as general as in the target,
5610 consider declaring a new locale with additional type constraints on
5611 the parameters (context element "constrains").
5613 - Discontinued "locale (open)". INCOMPATIBILITY.
5615 - Locale interpretation commands no longer attempt to simplify goal.
5616 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5617 methods intro_locales and unfold_locales to clarify.
5619 - Locale interpretation commands no longer accept interpretation
5620 attributes. INCOMPATIBILITY.
5622 * Class declaration: so-called "base sort" must not be given in import
5623 list any longer, but is inferred from the specification. Particularly
5630 class foo = type + ...
5632 * Class target: global versions of theorems stemming do not carry a
5633 parameter prefix any longer. INCOMPATIBILITY.
5635 * Class 'instance' command no longer accepts attached definitions.
5636 INCOMPATIBILITY, use proper 'instantiation' target instead.
5638 * Recovered hiding of consts, which was accidentally broken in
5639 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5640 makes c inaccessible; consider using ``hide (open) const c'' instead.
5642 * Slightly more coherent Pure syntax, with updated documentation in
5643 isar-ref manual. Removed locales meta_term_syntax and
5644 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5645 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5646 directly in regular applications.
5648 * There is a new syntactic category "float_const" for signed decimal
5649 fractions (e.g. 123.45 or -123.45).
5651 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5652 interface with 'setup' command instead.
5654 * Command 'local_setup' is similar to 'setup', but operates on a local
5657 * The 'axiomatization' command now only works within a global theory
5658 context. INCOMPATIBILITY.
5660 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5661 hypotheses. Sorts required in the course of reasoning need to be
5662 covered by the constraints in the initial statement, completed by the
5663 type instance information of the background theory. Non-trivial sort
5664 hypotheses, which rarely occur in practice, may be specified via
5665 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5667 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5669 The result contains an implicit sort hypotheses as before --
5670 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5673 * Generalized Isar history, with support for linear undo, direct state
5676 * Changed defaults for unify configuration options:
5678 unify_trace_bound = 50 (formerly 25)
5679 unify_search_bound = 60 (formerly 30)
5681 * Different bookkeeping for code equations (INCOMPATIBILITY):
5683 a) On theory merge, the last set of code equations for a particular
5684 constant is taken (in accordance with the policy applied by other
5685 parts of the code generator framework).
5687 b) Code equations stemming from explicit declarations (e.g. code
5688 attribute) gain priority over default code equations stemming
5689 from definition, primrec, fun etc.
5691 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5693 * Unified theorem tables for both code generators. Thus [code
5694 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5696 * Command 'find_consts' searches for constants based on type and name
5699 find_consts "_ => bool"
5701 By default, matching is against subtypes, but it may be restricted to
5702 the whole type. Searching by name is possible. Multiple queries are
5703 conjunctive and queries may be negated by prefixing them with a
5706 find_consts strict: "_ => bool" name: "Int" -"int => int"
5708 * New 'find_theorems' criterion "solves" matches theorems that
5709 directly solve the current goal (modulo higher-order unification).
5711 * Auto solve feature for main theorem statements: whenever a new goal
5712 is stated, "find_theorems solves" is called; any theorems that could
5713 solve the lemma directly are listed as part of the goal state.
5714 Cf. associated options in Proof General Isabelle settings menu,
5715 enabled by default, with reasonable timeout for pathological cases of
5716 higher-order unification.
5719 *** Document preparation ***
5721 * Antiquotation @{lemma} now imitates a regular terminal proof,
5722 demanding keyword 'by' and supporting the full method expression
5723 syntax just like the Isar command 'by'.
5728 * Integrated main parts of former image HOL-Complex with HOL. Entry
5729 points Main and Complex_Main remain as before.
5731 * Logic image HOL-Plain provides a minimal HOL with the most important
5732 tools available (inductive, datatype, primrec, ...). This facilitates
5733 experimentation and tool development. Note that user applications
5734 (and library theories) should never refer to anything below theory
5737 * Logic image HOL-Main stops at theory Main, and thus facilitates
5738 experimentation due to shorter build times.
5740 * Logic image HOL-NSA contains theories of nonstandard analysis which
5741 were previously part of former HOL-Complex. Entry point Hyperreal
5742 remains valid, but theories formerly using Complex_Main should now use
5743 new entry point Hypercomplex.
5745 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5746 Posix processes. Avoids potentially expensive forking of the ML
5747 process. New thread-based implementation also works on non-Unix
5748 platforms (Cygwin). Provers are no longer hardwired, but defined
5749 within the theory via plain ML wrapper functions. Basic Sledgehammer
5750 commands are covered in the isar-ref manual.
5752 * Wrapper scripts for remote SystemOnTPTP service allows to use
5753 sledgehammer without local ATP installation (Vampire etc.). Other
5754 provers may be included via suitable ML wrappers, see also
5755 src/HOL/ATP_Linkup.thy.
5757 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5760 * The metis method no longer fails because the theorem is too trivial
5761 (contains the empty clause).
5763 * The metis method now fails in the usual manner, rather than raising
5764 an exception, if it determines that it cannot prove the theorem.
5766 * Method "coherent" implements a prover for coherent logic (see also
5767 src/Tools/coherent.ML).
5769 * Constants "undefined" and "default" replace "arbitrary". Usually
5770 "undefined" is the right choice to replace "arbitrary", though
5771 logically there is no difference. INCOMPATIBILITY.
5773 * Command "value" now integrates different evaluation mechanisms. The
5774 result of the first successful evaluation mechanism is printed. In
5775 square brackets a particular named evaluation mechanisms may be
5776 specified (currently, [SML], [code] or [nbe]). See further
5777 src/HOL/ex/Eval_Examples.thy.
5779 * Normalization by evaluation now allows non-leftlinear equations.
5780 Declare with attribute [code nbe].
5782 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5783 as the structured Isar versions "cases" and "induct", cf. the
5784 corresponding "cases" and "induct" attributes. Mutual induction rules
5785 are now presented as a list of individual projections
5786 (e.g. foo_bar.inducts for types foo and bar); the old format with
5787 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5788 rare situations a different rule is selected --- notably nested tuple
5789 elimination instead of former prod.exhaust: use explicit (case_tac t
5790 rule: prod.exhaust) here.
5792 * Attributes "cases", "induct", "coinduct" support "del" option.
5794 * Removed fact "case_split_thm", which duplicates "case_split".
5796 * The option datatype has been moved to a new theory Option. Renamed
5797 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5799 * New predicate "strict_mono" classifies strict functions on partial
5800 orders. With strict functions on linear orders, reasoning about
5801 (in)equalities is facilitated by theorems "strict_mono_eq",
5802 "strict_mono_less_eq" and "strict_mono_less".
5804 * Some set operations are now proper qualified constants with
5805 authentic syntax. INCOMPATIBILITY:
5816 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5819 * Auxiliary class "itself" has disappeared -- classes without any
5820 parameter are treated as expected by the 'class' command.
5822 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5824 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5825 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5827 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5828 method "approximation". It proves formulas on real values by using
5829 interval arithmetic. In the formulas are also the transcendental
5830 functions sin, cos, tan, atan, ln, exp and the constant pi are
5831 allowed. For examples see
5832 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5834 * Theory "Reflection" now resides in HOL/Library.
5836 * Entry point to Word library now simply named "Word".
5839 * Made source layout more coherent with logical distribution
5842 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5843 src/HOL/Library/Code_Message.thy ~> src/HOL/
5844 src/HOL/Library/GCD.thy ~> src/HOL/
5845 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5846 src/HOL/Library/Parity.thy ~> src/HOL/
5847 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5848 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5849 src/HOL/Real/Lubs.thy ~> src/HOL/
5850 src/HOL/Real/PReal.thy ~> src/HOL/
5851 src/HOL/Real/Rational.thy ~> src/HOL/
5852 src/HOL/Real/RComplete.thy ~> src/HOL/
5853 src/HOL/Real/RealDef.thy ~> src/HOL/
5854 src/HOL/Real/RealPow.thy ~> src/HOL/
5855 src/HOL/Real/Real.thy ~> src/HOL/
5856 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5857 src/HOL/Complex/Complex.thy ~> src/HOL/
5858 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5859 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5860 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5861 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5862 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5863 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5864 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5865 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5866 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5867 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5868 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5869 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5870 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5871 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5872 src/HOL/Real/Float ~> src/HOL/Library/
5873 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5874 src/HOL/Real/RealVector.thy ~> src/HOL/
5876 src/HOL/arith_data.ML ~> src/HOL/Tools
5877 src/HOL/hologic.ML ~> src/HOL/Tools
5878 src/HOL/simpdata.ML ~> src/HOL/Tools
5879 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5880 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5881 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5882 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5883 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5884 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5885 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5887 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5888 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5889 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5890 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5891 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5892 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5894 * If methods "eval" and "evaluation" encounter a structured proof
5895 state with !!/==>, only the conclusion is evaluated to True (if
5896 possible), avoiding strange error messages.
5898 * Method "sizechange" automates termination proofs using (a
5899 modification of) the size-change principle. Requires SAT solver. See
5900 src/HOL/ex/Termination.thy for examples.
5902 * Simplifier: simproc for let expressions now unfolds if bound
5903 variable occurs at most once in let expression body. INCOMPATIBILITY.
5905 * Method "arith": Linear arithmetic now ignores all inequalities when
5906 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5908 * New attribute "arith" for facts that should always be used
5909 automatically by arithmetic. It is intended to be used locally in
5912 assumes [arith]: "x > 0"
5914 Global usage is discouraged because of possible performance impact.
5916 * New classes "top" and "bot" with corresponding operations "top" and
5917 "bot" in theory Orderings; instantiation of class "complete_lattice"
5918 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5920 * Changed definition lemma "less_fun_def" in order to provide an
5921 instance for preorders on functions; use lemma "less_le" instead.
5924 * Theory Orderings: class "wellorder" moved here, with explicit
5925 induction rule "less_induct" as assumption. For instantiation of
5926 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5929 * Theory Orderings: added class "preorder" as superclass of "order".
5930 INCOMPATIBILITY: Instantiation proofs for order, linorder
5931 etc. slightly changed. Some theorems named order_class.* now named
5934 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5937 * Theory Finite_Set: added a new fold combinator of type
5939 ('a => 'b => 'b) => 'b => 'a set => 'b
5941 Occasionally this is more convenient than the old fold combinator
5942 which is now defined in terms of the new one and renamed to
5945 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5946 and "ring_simps" have been replaced by "algebra_simps" (which can be
5947 extended with further lemmas!). At the moment both still exist but
5948 the former will disappear at some point.
5950 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5951 class recpower. Type-specific simp rules for various recpower types
5952 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5954 rat_power_0 -> power_0
5955 rat_power_Suc -> power_Suc
5956 realpow_0 -> power_0
5957 realpow_Suc -> power_Suc
5958 complexpow_0 -> power_0
5959 complexpow_Suc -> power_Suc
5960 power_poly_0 -> power_0
5961 power_poly_Suc -> power_Suc
5963 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5964 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5965 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5966 of lemmas from Divides has been generalized from nat to class
5967 semiring_div. INCOMPATIBILITY. This involves the following theorem
5968 renames resulting from duplicate elimination:
5970 dvd_def_mod ~> dvd_eq_mod_eq_0
5971 zero_dvd_iff ~> dvd_0_left_iff
5972 dvd_0 ~> dvd_0_right
5973 DIVISION_BY_ZERO_DIV ~> div_by_0
5974 DIVISION_BY_ZERO_MOD ~> mod_by_0
5975 mult_div ~> div_mult_self2_is_id
5976 mult_mod ~> mod_mult_self2_is_0
5978 * Theory IntDiv: removed many lemmas that are instances of class-based
5979 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5980 rename old lemmas as follows:
5982 dvd_diff -> nat_dvd_diff
5983 dvd_zminus_iff -> dvd_minus_iff
5984 mod_add1_eq -> mod_add_eq
5985 mod_mult1_eq -> mod_mult_right_eq
5986 mod_mult1_eq' -> mod_mult_left_eq
5987 mod_mult_distrib_mod -> mod_mult_eq
5988 nat_mod_add_left_eq -> mod_add_left_eq
5989 nat_mod_add_right_eq -> mod_add_right_eq
5990 nat_mod_div_trivial -> mod_div_trivial
5991 nat_mod_mod_trivial -> mod_mod_trivial
5992 zdiv_zadd_self1 -> div_add_self1
5993 zdiv_zadd_self2 -> div_add_self2
5994 zdiv_zmult_self1 -> div_mult_self2_is_id
5995 zdiv_zmult_self2 -> div_mult_self1_is_id
5996 zdvd_triv_left -> dvd_triv_left
5997 zdvd_triv_right -> dvd_triv_right
5998 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5999 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6000 zmod_zadd_left_eq -> mod_add_left_eq
6001 zmod_zadd_right_eq -> mod_add_right_eq
6002 zmod_zadd_self1 -> mod_add_self1
6003 zmod_zadd_self2 -> mod_add_self2
6004 zmod_zadd1_eq -> mod_add_eq
6005 zmod_zdiff1_eq -> mod_diff_eq
6006 zmod_zdvd_zmod -> mod_mod_cancel
6007 zmod_zmod_cancel -> mod_mod_cancel
6008 zmod_zmult_self1 -> mod_mult_self2_is_0
6009 zmod_zmult_self2 -> mod_mult_self1_is_0
6012 zdvd_abs1 -> abs_dvd_iff
6013 zdvd_abs2 -> dvd_abs_iff
6014 zdvd_refl -> dvd_refl
6015 zdvd_trans -> dvd_trans
6016 zdvd_zadd -> dvd_add
6017 zdvd_zdiff -> dvd_diff
6018 zdvd_zminus_iff -> dvd_minus_iff
6019 zdvd_zminus2_iff -> minus_dvd_iff
6020 zdvd_zmultD -> dvd_mult_right
6021 zdvd_zmultD2 -> dvd_mult_left
6022 zdvd_zmult_mono -> mult_dvd_mono
6023 zdvd_0_right -> dvd_0_right
6024 zdvd_0_left -> dvd_0_left_iff
6025 zdvd_1_left -> one_dvd
6026 zminus_dvd_iff -> minus_dvd_iff
6028 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6030 * The real numbers offer decimal input syntax: 12.34 is translated
6031 into 1234/10^2. This translation is not reversed upon output.
6033 * Theory Library/Polynomial defines an abstract type 'a poly of
6034 univariate polynomials with coefficients of type 'a. In addition to
6035 the standard ring operations, it also supports div and mod. Code
6036 generation is also supported, using list-style constructors.
6038 * Theory Library/Inner_Product defines a class of real_inner for real
6039 inner product spaces, with an overloaded operation inner :: 'a => 'a
6040 => real. Class real_inner is a subclass of real_normed_vector from
6043 * Theory Library/Product_Vector provides instances for the product
6044 type 'a * 'b of several classes from RealVector and Inner_Product.
6045 Definitions of addition, subtraction, scalar multiplication, norms,
6046 and inner products are included.
6048 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6049 addition to the field operations, numerals and case syntax are also
6052 * Theory Library/Diagonalize provides constructive version of Cantor's
6053 first diagonalization argument.
6055 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6056 zlcm (for int); carried together from various gcd/lcm developements in
6057 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6058 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6059 may recover tupled syntax as follows:
6061 hide (open) const gcd
6062 abbreviation gcd where
6063 "gcd == (%(a, b). GCD.gcd a b)"
6065 GCD.gcd ("gcd '(_, _')")
6067 The same works for lcm, zgcd, zlcm.
6069 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6070 instantiations for algebraic structures. Removed some duplicate
6071 theorems. Changes in simp rules. INCOMPATIBILITY.
6073 * ML antiquotation @{code} takes a constant as argument and generates
6074 corresponding code in background and inserts name of the corresponding
6075 resulting ML value/function/datatype constructor binding in place.
6076 All occurrences of @{code} with a single ML block are generated
6077 simultaneously. Provides a generic and safe interface for
6078 instrumentalizing code generation. See
6079 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6080 In future you ought to refrain from ad-hoc compiling generated SML
6081 code on the ML toplevel. Note that (for technical reasons) @{code}
6082 cannot refer to constants for which user-defined serializations are
6083 set. Refer to the corresponding ML counterpart directly in that
6086 * Command 'rep_datatype': instead of theorem names the command now
6087 takes a list of terms denoting the constructors of the type to be
6088 represented as datatype. The characteristic theorems have to be
6089 proven. INCOMPATIBILITY. Also observe that the following theorems
6090 have disappeared in favour of existing ones:
6092 unit_induct ~> unit.induct
6093 prod_induct ~> prod.induct
6094 sum_induct ~> sum.induct
6095 Suc_Suc_eq ~> nat.inject
6096 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6101 * New locales for orders and lattices where the equivalence relation
6102 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6103 locales use a record structure with field eq for the equivalence.
6105 * New theory of factorial domains.
6107 * Units_l_inv and Units_r_inv are now simp rules by default.
6108 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6109 and/or r_inv will now also require deletion of these lemmas.
6111 * Renamed the following theorems, INCOMPATIBILITY:
6113 UpperD ~> Upper_memD
6114 LowerD ~> Lower_memD
6115 least_carrier ~> least_closed
6116 greatest_carrier ~> greatest_closed
6117 greatest_Lower_above ~> greatest_Lower_below
6118 one_zero ~> carrier_one_zero
6119 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6124 * Nominal datatypes can now contain type-variables.
6126 * Commands 'nominal_inductive' and 'equivariance' work with local
6129 * Nominal primrec can now works with local theory targets and its
6130 specification syntax now conforms to the general format as seen in
6133 * Method "perm_simp" honours the standard simplifier attributes
6134 (no_asm), (no_asm_use) etc.
6136 * The new predicate #* is defined like freshness, except that on the
6137 left hand side can be a set or list of atoms.
6139 * Experimental command 'nominal_inductive2' derives strong induction
6140 principles for inductive definitions. In contrast to
6141 'nominal_inductive', which can only deal with a fixed number of
6142 binders, it can deal with arbitrary expressions standing for sets of
6143 atoms to be avoided. The only inductive definition we have at the
6144 moment that needs this generalisation is the typing rule for Lets in
6147 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6148 -----------------------------------------------------------------
6149 Gamma |- Let x be t1 in t2 : T2
6151 In this rule one wants to avoid all the binders that are introduced by
6152 "close Gamma T1". We are looking for other examples where this
6153 feature might be useful. Please let us know.
6158 * Reimplemented the simplification procedure for proving continuity
6159 subgoals. The new simproc is extensible; users can declare additional
6160 continuity introduction rules with the attribute [cont2cont].
6162 * The continuity simproc now uses a different introduction rule for
6163 solving continuity subgoals on terms with lambda abstractions. In
6164 some rare cases the new simproc may fail to solve subgoals that the
6165 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6166 Potential INCOMPATIBILITY.
6168 * Command 'fixrec': specification syntax now conforms to the general
6169 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6170 examples. INCOMPATIBILITY.
6175 * Proof of Zorn's Lemma for partial orders.
6180 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6181 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6182 depends on multithreading, so timouts will not work before Poly/ML
6185 * High-level support for concurrent ML programming, see
6186 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6187 particularly convenient to organize independent functional
6188 computations. The concept of "synchronized variables" provides a
6189 higher-order interface for components with shared state, avoiding the
6190 delicate details of mutexes and condition variables. (Requires
6191 Poly/ML 5.2.1 or later.)
6193 * ML bindings produced via Isar commands are stored within the Isar
6194 context (theory or proof). Consequently, commands like 'use' and 'ML'
6195 become thread-safe and work with undo as expected (concerning
6196 top-level bindings, not side-effects on global references).
6197 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6198 compiler at runtime; really global bindings need to be given outside a
6199 theory. (Requires Poly/ML 5.2 or later.)
6201 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6202 context. Top-level ML bindings are stored within the proof context in
6203 a purely sequential fashion, disregarding the nested proof structure.
6204 ML bindings introduced by 'ML_prf' are discarded at the end of the
6205 proof. (Requires Poly/ML 5.2 or later.)
6207 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6208 and Method.setup, as well as Isar commands 'attribute_setup' and
6209 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6210 existing code accordingly, or use plain 'setup' together with old
6213 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6214 to 'a -> thm, while results are always tagged with an authentic oracle
6215 name. The Isar command 'oracle' is now polymorphic, no argument type
6216 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6217 accordingly. Note that extra performance may be gained by producing
6218 the cterm carefully, avoiding slow Thm.cterm_of.
6220 * Simplified interface for defining document antiquotations via
6221 ThyOutput.antiquotation, ThyOutput.output, and optionally
6222 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6223 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6226 * More systematic treatment of long names, abstract name bindings, and
6227 name space operations. Basic operations on qualified names have been
6228 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6229 Long_Name.append. Old type bstring has been mostly replaced by
6230 abstract type binding (see structure Binding), which supports precise
6231 qualification by packages and local theory targets, as well as proper
6232 tracking of source positions. INCOMPATIBILITY, need to wrap old
6233 bstring values into Binding.name, or better pass through abstract
6234 bindings everywhere. See further src/Pure/General/long_name.ML,
6235 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6237 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6238 LocalTheory.note etc.) now refer to the *full* internal name, not the
6239 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6241 * Disposed old type and term read functions (Sign.read_def_typ,
6242 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6243 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6244 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6245 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6246 resort for legacy applications.
6248 * Disposed old declarations, tactics, tactic combinators that refer to
6249 the simpset or claset of an implicit theory (such as Addsimps,
6250 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6251 embedded ML text, or local_simpset_of with a proper context passed as
6252 explicit runtime argument.
6254 * Rules and tactics that read instantiations (read_instantiate,
6255 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6256 context, which is required for parsing and type-checking. Moreover,
6257 the variables are specified as plain indexnames, not string encodings
6258 thereof. INCOMPATIBILITY.
6260 * Generic Toplevel.add_hook interface allows to analyze the result of
6261 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6262 for theorem dependency output of transactions resulting in a new
6265 * ML antiquotations: block-structured compilation context indicated by
6266 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6268 @{binding name} - basic name binding
6269 @{let ?pat = term} - term abbreviation (HO matching)
6270 @{note name = fact} - fact abbreviation
6271 @{thm fact} - singleton fact (with attributes)
6272 @{thms fact} - general fact (with attributes)
6273 @{lemma prop by method} - singleton goal
6274 @{lemma prop by meth1 meth2} - singleton goal
6275 @{lemma prop1 ... propN by method} - general goal
6276 @{lemma prop1 ... propN by meth1 meth2} - general goal
6277 @{lemma (open) ...} - open derivation
6282 * The Isabelle "emacs" tool provides a specific interface to invoke
6283 Proof General / Emacs, with more explicit failure if that is not
6284 installed (the old isabelle-interface script silently falls back on
6285 isabelle-process). The PROOFGENERAL_HOME setting determines the
6286 installation location of the Proof General distribution.
6288 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6289 the Isabelle process into a JVM/Scala application. See
6290 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6291 process wrapper has been discontinued.)
6293 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6295 * Various status messages (with exact source position information) are
6296 emitted, if proper markup print mode is enabled. This allows
6297 user-interface components to provide detailed feedback on internal
6302 New in Isabelle2008 (June 2008)
6303 -------------------------------
6307 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6308 and updated, with formally checked references as hyperlinks.
6310 * Theory loader: use_thy (and similar operations) no longer set the
6311 implicit ML context, which was occasionally hard to predict and in
6312 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6313 provides a proper context already.
6315 * Theory loader: old-style ML proof scripts being *attached* to a thy
6316 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6317 'use' within a theory file will do the job.
6319 * Name space merge now observes canonical order, i.e. the second space
6320 is inserted into the first one, while existing entries in the first
6321 space take precedence. INCOMPATIBILITY in rare situations, may try to
6322 swap theory imports.
6324 * Syntax: symbol \<chi> is now considered a letter. Potential
6325 INCOMPATIBILITY in identifier syntax etc.
6327 * Outer syntax: string tokens no longer admit escaped white space,
6328 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6329 white space without escapes.
6331 * Outer syntax: string tokens may contain arbitrary character codes
6332 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6338 * Context-dependent token translations. Default setup reverts locally
6339 fixed variables, and adds hilite markup for undeclared frees.
6341 * Unused theorems can be found using the new command 'unused_thms'.
6342 There are three ways of invoking it:
6345 Only finds unused theorems in the current theory.
6347 (2) unused_thms thy_1 ... thy_n -
6348 Finds unused theorems in the current theory and all of its ancestors,
6349 excluding the theories thy_1 ... thy_n and all of their ancestors.
6351 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6352 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6353 their ancestors, excluding the theories thy_1 ... thy_n and all of
6356 In order to increase the readability of the list produced by
6357 unused_thms, theorems that have been created by a particular instance
6358 of a theory command such as 'inductive' or 'function' are considered
6359 to belong to the same "group", meaning that if at least one theorem in
6360 this group is used, the other theorems in the same group are no longer
6361 reported as unused. Moreover, if all theorems in the group are
6362 unused, only one theorem in the group is displayed.
6364 Note that proof objects have to be switched on in order for
6365 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6366 usually the case when using Proof General with the default settings).
6368 * Authentic naming of facts disallows ad-hoc overwriting of previous
6369 theorems within the same name space. INCOMPATIBILITY, need to remove
6370 duplicate fact bindings, or even accidental fact duplications. Note
6371 that tools may maintain dynamically scoped facts systematically, using
6372 PureThy.add_thms_dynamic.
6374 * Command 'hide' now allows to hide from "fact" name space as well.
6376 * Eliminated destructive theorem database, simpset, claset, and
6377 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6378 update of theories within ML code.
6380 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6381 INCOMPATIBILITY, object-logics depending on former Pure require
6382 additional setup PureThy.old_appl_syntax_setup; object-logics
6383 depending on former CPure need to refer to Pure.
6385 * Commands 'use' and 'ML' are now purely functional, operating on
6386 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6387 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6390 * Command 'setup': discontinued implicit version with ML reference.
6392 * Instantiation target allows for simultaneous specification of class
6393 instance operations together with an instantiation proof.
6394 Type-checking phase allows to refer to class operations uniformly.
6395 See src/HOL/Complex/Complex.thy for an Isar example and
6396 src/HOL/Library/Eval.thy for an ML example.
6398 * Indexing of literal facts: be more serious about including only
6399 facts from the visible specification/proof context, but not the
6400 background context (locale etc.). Affects `prop` notation and method
6401 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6404 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6405 "(open)" option, which used to expose internal bound variables to the
6408 * Isar statements: removed obsolete case "rule_context".
6409 INCOMPATIBILITY, better use explicit fixes/assumes.
6411 * Locale proofs: default proof step now includes 'unfold_locales';
6412 hence 'proof' without argument may be used to unfold locale
6416 *** Document preparation ***
6418 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6419 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6420 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6421 spot); renamed link color from "darkblue" to "linkcolor" (default
6422 value unchanged, can be redefined via \definecolor); no longer sets
6423 "a4paper" option (unnecessary or even intrusive).
6425 * Antiquotation @{lemma A method} proves proposition A by the given
6426 method (either a method name or a method name plus (optional) method
6427 arguments in parentheses) and prints A just like @{prop A}.
6432 * New primrec package. Specification syntax conforms in style to
6433 definition/function/.... No separate induction rule is provided. The
6434 "primrec" command distinguishes old-style and new-style specifications
6435 by syntax. The former primrec package is now named OldPrimrecPackage.
6436 When adjusting theories, beware: constants stemming from new-style
6437 primrec specifications have authentic syntax.
6439 * Metis prover is now an order of magnitude faster, and also works
6440 with multithreading.
6442 * Metis: the maximum number of clauses that can be produced from a
6443 theorem is now given by the attribute max_clauses. Theorems that
6444 exceed this number are ignored, with a warning printed.
6446 * Sledgehammer no longer produces structured proofs by default. To
6447 enable, declare [[sledgehammer_full = true]]. Attributes
6448 reconstruction_modulus, reconstruction_sorts renamed
6449 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6451 * Method "induct_scheme" derives user-specified induction rules
6452 from well-founded induction and completeness of patterns. This factors
6453 out some operations that are done internally by the function package
6454 and makes them available separately. See
6455 src/HOL/ex/Induction_Scheme.thy for examples.
6457 * More flexible generation of measure functions for termination
6458 proofs: Measure functions can be declared by proving a rule of the
6459 form "is_measure f" and giving it the [measure_function] attribute.
6460 The "is_measure" predicate is logically meaningless (always true), and
6461 just guides the heuristic. To find suitable measure functions, the
6462 termination prover sets up the goal "is_measure ?f" of the appropriate
6463 type and generates all solutions by Prolog-style backward proof using
6466 This setup also deals with rules like
6468 "is_measure f ==> is_measure (list_size f)"
6470 which accommodates nested datatypes that recurse through lists.
6471 Similar rules are predeclared for products and option types.
6473 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6477 - Definitions of overloaded constants on sets have to be replaced by
6478 definitions on => and bool.
6480 - Some definitions of overloaded operators on sets can now be proved
6481 using the definitions of the operators on => and bool. Therefore,
6482 the following theorems have been renamed:
6484 subset_def -> subset_eq
6485 psubset_def -> psubset_eq
6486 set_diff_def -> set_diff_eq
6487 Compl_def -> Compl_eq
6488 Sup_set_def -> Sup_set_eq
6489 Inf_set_def -> Inf_set_eq
6490 sup_set_def -> sup_set_eq
6491 inf_set_def -> inf_set_eq
6493 - Due to the incompleteness of the HO unification algorithm, some
6494 rules such as subst may require manual instantiation, if some of
6495 the unknowns in the rule is a set.
6497 - Higher order unification and forward proofs:
6500 have "P (S::'a set)" <...>
6501 then have "EX S. P S" ..
6503 no longer works (due to the incompleteness of the HO unification
6504 algorithm) and must be replaced by the pattern
6511 - Calculational reasoning with subst (or similar rules):
6514 have "P (S::'a set)" <...>
6515 also have "S = T" <...>
6516 finally have "P T" .
6518 no longer works (for similar reasons as the previous example) and
6519 must be replaced by something like
6521 have "P (S::'a set)" <...>
6522 moreover have "S = T" <...>
6523 ultimately have "P T" by simp
6525 - Tactics or packages written in ML code:
6526 Code performing pattern matching on types via
6528 Type ("set", [T]) => ...
6530 must be rewritten. Moreover, functions like strip_type or
6531 binder_types no longer return the right value when applied to a
6534 T1 => ... => Tn => U => bool
6538 T1 => ... => Tn => U set
6540 * Merged theories Wellfounded_Recursion, Accessible_Part and
6541 Wellfounded_Relations to theory Wellfounded.
6543 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6545 * Class finite no longer treats UNIV as class parameter. Use class
6546 enum from theory Library/Enum instead to achieve a similar effect.
6549 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6550 and "Cons". INCOMPATIBILITY.
6552 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6553 Potential INCOMPATIBILITY.
6555 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6556 injective_fst_snd removed, use split_eta and prod_eqI instead.
6557 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6559 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6560 the same name in theory Orderings:
6570 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6571 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6572 and different variable names.
6574 * Library/Option_ord.thy: Canonical order on option type.
6576 * Library/RBT.thy: Red-black trees, an efficient implementation of
6579 * Library/Countable.thy: Type class for countable types.
6581 * Theory Int: The representation of numerals has changed. The infix
6582 operator BIT and the bit datatype with constructors B0 and B1 have
6583 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6584 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6585 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6588 * Theory Nat: definition of <= and < on natural numbers no longer
6589 depend on well-founded relations. INCOMPATIBILITY. Definitions
6590 le_def and less_def have disappeared. Consider lemmas not_less
6591 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6593 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6594 (whose purpose mainly is for various fold_set functionals) have been
6595 abandoned in favor of the existing algebraic classes
6596 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6597 lower_semilattice (resp. upper_semilattice) and linorder.
6600 * Theory Transitive_Closure: induct and cases rules now declare proper
6601 case_names ("base" and "step"). INCOMPATIBILITY.
6603 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6604 lattices. The form set-specific version is available as
6605 Inductive.lfp_ordinal_induct_set.
6607 * Renamed theorems "power.simps" to "power_int.simps".
6610 * Class semiring_div provides basic abstract properties of semirings
6611 with division and modulo operations. Subsumes former class dvd_mod.
6613 * Merged theories IntDef, Numeral and IntArith into unified theory
6614 Int. INCOMPATIBILITY.
6616 * Theory Library/Code_Index: type "index" now represents natural
6617 numbers rather than integers. INCOMPATIBILITY.
6619 * New class "uminus" with operation "uminus" (split of from class
6620 "minus" which now only has operation "minus", binary).
6623 * Constants "card", "internal_split", "option_map" now with authentic
6624 syntax. INCOMPATIBILITY.
6626 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6627 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6628 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6629 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6630 Sup_set_def, le_def, less_def, option_map_def now with object
6631 equality. INCOMPATIBILITY.
6633 * Records. Removed K_record, and replaced it by pure lambda term
6634 %x. c. The simplifier setup is now more robust against eta expansion.
6635 INCOMPATIBILITY: in cases explicitly referring to K_record.
6637 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6639 * Library/ListVector: new theory of arithmetic vector operations.
6641 * Library/Order_Relation: new theory of various orderings as sets of
6642 pairs. Defines preorders, partial orders, linear orders and
6643 well-orders on sets and on types.
6648 * Renamed some theories to allow to loading both ZF and HOL in the
6651 Datatype -> Datatype_ZF
6652 Inductive -> Inductive_ZF
6659 INCOMPATIBILITY: ZF theories that import individual theories below
6660 Main might need to be adapted. Regular theory Main is still
6661 available, as trivial extension of Main_ZF.
6666 * ML within Isar: antiquotation @{const name} or @{const
6667 name(typargs)} produces statically-checked Const term.
6669 * Functor NamedThmsFun: data is available to the user as dynamic fact
6670 (of the same name). Removed obsolete print command.
6672 * Removed obsolete "use_legacy_bindings" function.
6674 * The ``print mode'' is now a thread-local value derived from a global
6675 template (the former print_mode reference), thus access becomes
6676 non-critical. The global print_mode reference is for session
6677 management only; user-code should use print_mode_value,
6678 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6680 * Functions system/system_out provide a robust way to invoke external
6681 shell commands, with propagation of interrupts (requires Poly/ML
6682 5.2.1). Do not use OS.Process.system etc. from the basis library!
6687 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6688 in accordance with Proof General 3.7, which prefers GNU emacs.
6690 * isatool tty runs Isabelle process with plain tty interaction;
6691 optional line editor may be specified via ISABELLE_LINE_EDITOR
6692 setting, the default settings attempt to locate "ledit" and "rlwrap".
6694 * isatool browser now works with Cygwin as well, using general
6695 "javapath" function defined in Isabelle process environment.
6697 * YXML notation provides a simple and efficient alternative to
6698 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6699 isatool yxml as described in the Isabelle system manual.
6701 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6702 provides general wrapper for managing an Isabelle process in a robust
6703 fashion, with ``cooked'' output from stdin/stderr.
6705 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6706 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6708 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6709 way of changing the user's settings is via
6710 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6713 * Multithreading.max_threads := 0 refers to the number of actual CPU
6714 cores of the underlying machine, which is a good starting point for
6715 optimal performance tuning. The corresponding usedir option -M allows
6716 "max" as an alias for "0". WARNING: does not work on certain versions
6717 of Mac OS (with Poly/ML 5.1).
6719 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6720 adverse effect of Isabelle flooding interactive front-ends (notably
6721 ProofGeneral / XEmacs).
6725 New in Isabelle2007 (November 2007)
6726 -----------------------------------
6730 * More uniform information about legacy features, notably a
6731 warning/error of "Legacy feature: ...", depending on the state of the
6732 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6733 legacy features will disappear eventually.
6735 * Theory syntax: the header format ``theory A = B + C:'' has been
6736 discontinued in favour of ``theory A imports B C begin''. Use isatool
6737 fixheaders to convert existing theory files. INCOMPATIBILITY.
6739 * Theory syntax: the old non-Isar theory file format has been
6740 discontinued altogether. Note that ML proof scripts may still be used
6741 with Isar theories; migration is usually quite simple with the ML
6742 function use_legacy_bindings. INCOMPATIBILITY.
6744 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6745 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6748 * Theory loader: be more serious about observing the static theory
6749 header specifications (including optional directories), but not the
6750 accidental file locations of previously successful loads. The strict
6751 update policy of former update_thy is now already performed by
6752 use_thy, so the former has been removed; use_thys updates several
6753 theories simultaneously, just as 'imports' within a theory header
6754 specification, but without merging the results. Potential
6755 INCOMPATIBILITY: may need to refine theory headers and commands
6756 ROOT.ML which depend on load order.
6758 * Theory loader: optional support for content-based file
6759 identification, instead of the traditional scheme of full physical
6760 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6761 (cf. the system manual). The new scheme allows to work with
6762 non-finished theories in persistent session images, such that source
6763 files may be moved later on without requiring reloads.
6765 * Theory loader: old-style ML proof scripts being *attached* to a thy
6766 file (with the same base name as the theory) are considered a legacy
6767 feature, which will disappear eventually. Even now, the theory loader
6768 no longer maintains dependencies on such files.
6770 * Syntax: the scope for resolving ambiguities via type-inference is
6771 now limited to individual terms, instead of whole simultaneous
6772 specifications as before. This greatly reduces the complexity of the
6773 syntax module and improves flexibility by separating parsing and
6774 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6775 'fixes' etc.) are required in rare situations.
6777 * Syntax: constants introduced by new-style packages ('definition',
6778 'abbreviation' etc.) are passed through the syntax module in
6779 ``authentic mode''. This means that associated mixfix annotations
6780 really stick to such constants, independently of potential name space
6781 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6782 trees are represented slightly differently, may need to adapt syntax
6783 translations accordingly. Use CONST marker in 'translations' and
6784 @{const_syntax} antiquotation in 'parse_translation' etc.
6786 * Legacy goal package: reduced interface to the bare minimum required
6787 to keep existing proof scripts running. Most other user-level
6788 functions are now part of the OldGoals structure, which is *not* open
6789 by default (consider isatool expandshort before open OldGoals).
6790 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6791 these tend to cause confusion about the actual goal (!) context being
6792 used here, which is not necessarily the same as the_context().
6794 * Command 'find_theorems': supports "*" wild-card in "name:"
6795 criterion; "with_dups" option. Certain ProofGeneral versions might
6796 support a specific search form (see ProofGeneral/CHANGES).
6798 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6799 by default, which means that "prems" (and also "fixed variables") are
6800 suppressed from proof state output. Note that the ProofGeneral
6801 settings mechanism allows to change and save options persistently, but
6802 older versions of Isabelle will fail to start up if a negative prems
6805 * Local theory targets may be specified by non-nested blocks of
6806 ``context/locale/class ... begin'' followed by ``end''. The body may
6807 contain definitions, theorems etc., including any derived mechanism
6808 that has been implemented on top of these primitives. This concept
6809 generalizes the existing ``theorem (in ...)'' towards more versatility
6812 * Proof General interface: proper undo of final 'end' command;
6813 discontinued Isabelle/classic mode (ML proof scripts).
6816 *** Document preparation ***
6818 * Added antiquotation @{theory name} which prints the given name,
6819 after checking that it refers to a valid ancestor theory in the
6822 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6823 check the given source text as ML type/structure, printing verbatim.
6825 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6826 "c args == rhs" given in the current context. (Any number of
6827 arguments may be given on the LHS.)
6832 * The 'class' package offers a combination of axclass and locale to
6833 achieve Haskell-like type classes in Isabelle. Definitions and
6834 theorems within a class context produce both relative results (with
6835 implicit parameters according to the locale context), and polymorphic
6836 constants with qualified polymorphism (according to the class
6837 context). Within the body context of a 'class' target, a separate
6838 syntax layer ("user space type system") takes care of converting
6839 between global polymorphic consts and internal locale representation.
6840 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6841 "isatool doc classes" provides a tutorial.
6843 * Generic code generator framework allows to generate executable
6844 code for ML and Haskell (including Isabelle classes). A short usage
6847 internal compilation:
6848 export_code <list of constants (term syntax)> in SML
6849 writing SML code to a file:
6850 export_code <list of constants (term syntax)> in SML <filename>
6851 writing OCaml code to a file:
6852 export_code <list of constants (term syntax)> in OCaml <filename>
6853 writing Haskell code to a bunch of files:
6854 export_code <list of constants (term syntax)> in Haskell <filename>
6856 evaluating closed propositions to True/False using code generation:
6859 Reasonable default setup of framework in HOL.
6861 Theorem attributs for selecting and transforming function equations theorems:
6863 [code fun]: select a theorem as function equation for a specific constant
6864 [code fun del]: deselect a theorem as function equation for a specific constant
6865 [code inline]: select an equation theorem for unfolding (inlining) in place
6866 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6868 User-defined serializations (target in {SML, OCaml, Haskell}):
6870 code_const <and-list of constants (term syntax)>
6871 {(target) <and-list of const target syntax>}+
6873 code_type <and-list of type constructors>
6874 {(target) <and-list of type target syntax>}+
6876 code_instance <and-list of instances>
6878 where instance ::= <type constructor> :: <class>
6880 code_class <and_list of classes>
6881 {(target) <and-list of class target syntax>}+
6882 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6884 code_instance and code_class only are effective to target Haskell.
6886 For example usage see src/HOL/ex/Codegenerator.thy and
6887 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6888 generation from Isabelle/HOL theories is available via "isatool doc
6891 * Code generator: consts in 'consts_code' Isar commands are now
6892 referred to by usual term syntax (including optional type
6895 * Command 'no_translations' removes translation rules from theory
6898 * Overloaded definitions are now actually checked for acyclic
6899 dependencies. The overloading scheme is slightly more general than
6900 that of Haskell98, although Isabelle does not demand an exact
6901 correspondence to type class and instance declarations.
6902 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6903 exotic versions of overloading -- at the discretion of the user!
6905 Polymorphic constants are represented via type arguments, i.e. the
6906 instantiation that matches an instance against the most general
6907 declaration given in the signature. For example, with the declaration
6908 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6909 as c(nat). Overloading is essentially simultaneous structural
6910 recursion over such type arguments. Incomplete specification patterns
6911 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6912 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6913 Command 'print_theory' outputs the normalized system of recursive
6914 equations, see section "definitions".
6916 * Configuration options are maintained within the theory or proof
6917 context (with name and type bool/int/string), providing a very simple
6918 interface to a poor-man's version of general context data. Tools may
6919 declare options in ML (e.g. using Attrib.config_int) and then refer to
6920 these values using Config.get etc. Users may change options via an
6921 associated attribute of the same name. This form of context
6922 declaration works particularly well with commands 'declare' or
6923 'using', for example ``declare [[foo = 42]]''. Thus it has become
6924 very easy to avoid global references, which would not observe Isar
6925 toplevel undo/redo and fail to work with multithreading.
6927 Various global ML references of Pure and HOL have been turned into
6928 configuration options:
6930 Unify.search_bound unify_search_bound
6931 Unify.trace_bound unify_trace_bound
6932 Unify.trace_simp unify_trace_simp
6933 Unify.trace_types unify_trace_types
6934 Simplifier.simp_depth_limit simp_depth_limit
6935 Blast.depth_limit blast_depth_limit
6936 DatatypeProp.dtK datatype_distinctness_limit
6937 fast_arith_neq_limit fast_arith_neq_limit
6938 fast_arith_split_limit fast_arith_split_limit
6940 * Named collections of theorems may be easily installed as context
6941 data using the functor NamedThmsFun (see also
6942 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6943 attributes; there is also a toplevel print command. This facility is
6944 just a common case of general context data, which is the preferred way
6945 for anything more complex than just a list of facts in canonical
6948 * Isar: command 'declaration' augments a local theory by generic
6949 declaration functions written in ML. This enables arbitrary content
6950 being added to the context, depending on a morphism that tells the
6951 difference of the original declaration context wrt. the application
6952 context encountered later on.
6954 * Isar: proper interfaces for simplification procedures. Command
6955 'simproc_setup' declares named simprocs (with match patterns, and body
6956 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6957 context. ML antiquotation @{simproc name} retrieves named simprocs.
6959 * Isar: an extra pair of brackets around attribute declarations
6960 abbreviates a theorem reference involving an internal dummy fact,
6961 which will be ignored later --- only the effect of the attribute on
6962 the background context will persist. This form of in-place
6963 declarations is particularly useful with commands like 'declare' and
6964 'using', for example ``have A using [[simproc a]] by simp''.
6966 * Isar: method "assumption" (and implicit closing of subproofs) now
6967 takes simple non-atomic goal assumptions into account: after applying
6968 an assumption as a rule the resulting subgoals are solved by atomic
6969 assumption steps. This is particularly useful to finish 'obtain'
6970 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6971 without referring to the original premise "!!x. P x ==> thesis" in the
6972 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6975 * Isar: implicit use of prems from the Isar proof context is
6976 considered a legacy feature. Common applications like ``have A .''
6977 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6978 referencing facts explicitly here improves readability and
6979 maintainability of proof texts.
6981 * Isar: improper proof element 'guess' is like 'obtain', but derives
6982 the obtained context from the course of reasoning! For example:
6984 assume "EX x y. A x & B y" -- "any previous fact"
6985 then guess x and y by clarify
6987 This technique is potentially adventurous, depending on the facts and
6988 proof tools being involved here.
6990 * Isar: known facts from the proof context may be specified as literal
6991 propositions, using ASCII back-quote syntax. This works wherever
6992 named facts used to be allowed so far, in proof commands, proof
6993 methods, attributes etc. Literal facts are retrieved from the context
6994 according to unification of type and term parameters. For example,
6995 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6996 theorems in the current context, then these are valid literal facts:
6997 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6999 There is also a proof method "fact" which does the same composition
7000 for explicit goal states, e.g. the following proof texts coincide with
7001 certain special cases of literal facts:
7003 have "A" by fact == note `A`
7004 have "A ==> B" by fact == note `A ==> B`
7005 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7006 have "P a ==> Q a" by fact == note `P a ==> Q a`
7008 * Isar: ":" (colon) is no longer a symbolic identifier character in
7009 outer syntax. Thus symbolic identifiers may be used without
7010 additional white space in declarations like this: ``assume *: A''.
7012 * Isar: 'print_facts' prints all local facts of the current context,
7013 both named and unnamed ones.
7015 * Isar: 'def' now admits simultaneous definitions, e.g.:
7017 def x == "t" and y == "u"
7019 * Isar: added command 'unfolding', which is structurally similar to
7020 'using', but affects both the goal state and facts by unfolding given
7021 rewrite rules. Thus many occurrences of the 'unfold' method or
7022 'unfolded' attribute may be replaced by first-class proof text.
7024 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7025 and command 'unfolding' now all support object-level equalities
7026 (potentially conditional). The underlying notion of rewrite rule is
7027 analogous to the 'rule_format' attribute, but *not* that of the
7028 Simplifier (which is usually more generous).
7030 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7031 premises of a theorem by n. Useful in conjunction with drule.
7033 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7034 method expression within a sandbox consisting of the first N
7035 sub-goals, which need to exist. For example, ``simp_all [3]''
7036 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7037 simplifies all new goals that emerge from applying rule foo to the
7038 originally first one.
7040 * Isar: schematic goals are no longer restricted to higher-order
7041 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7044 * Isar: the conclusion of a long theorem statement is now either
7045 'shows' (a simultaneous conjunction, as before), or 'obtains'
7046 (essentially a disjunction of cases with local parameters and
7047 assumptions). The latter allows to express general elimination rules
7048 adequately; in this notation common elimination rules look like this:
7050 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7052 obtains x where "P x"
7054 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7058 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7064 The subsequent classical rules even refer to the formal "thesis"
7067 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7070 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7071 obtains "thesis ==> something"
7073 The actual proof of an 'obtains' statement is analogous to that of the
7074 Isar proof element 'obtain', only that there may be several cases.
7075 Optional case names may be specified in parentheses; these will be
7076 available both in the present proof and as annotations in the
7077 resulting rule, for later use with the 'cases' method (cf. attribute
7080 * Isar: the assumptions of a long theorem statement are available as
7081 "assms" fact in the proof context. This is more appropriate than the
7082 (historical) "prems", which refers to all assumptions of the current
7083 context, including those from the target locale, proof body etc.
7085 * Isar: 'print_statement' prints theorems from the current theory or
7086 proof context in long statement form, according to the syntax of a
7089 * Isar: 'obtain' takes an optional case name for the local context
7090 introduction rule (default "that").
7092 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7093 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7096 * Pure: syntax "CONST name" produces a fully internalized constant
7097 according to the current context. This is particularly useful for
7098 syntax translations that should refer to internal constant
7099 representations independently of name spaces.
7101 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7102 instead of "FOO ". This allows multiple binder declarations to coexist
7103 in the same context. INCOMPATIBILITY.
7105 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7106 primitive that also works in a locale context (both for constants and
7107 fixed variables). Type declaration and internal syntactic representation
7108 of given constants retrieved from the context. Likewise, the
7109 'no_notation' command allows to remove given syntax annotations from the
7112 * Isar/locales: new derived specification elements 'axiomatization',
7113 'definition', 'abbreviation', which support type-inference, admit
7114 object-level specifications (equality, equivalence). See also the
7115 isar-ref manual. Examples:
7118 eq (infix "===" 50) where
7119 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7121 definition "f x y = x + y + 1"
7122 definition g where "g x = f x x"
7125 neq (infix "=!=" 50) where
7126 "x =!= y == ~ (x === y)"
7128 These specifications may be also used in a locale context. Then the
7129 constants being introduced depend on certain fixed parameters, and the
7130 constant name is qualified by the locale base name. An internal
7131 abbreviation takes care for convenient input and output, making the
7132 parameters implicit and using the original short name. See also
7133 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7134 entities from a monomorphic theory.
7136 Presently, abbreviations are only available 'in' a target locale, but
7137 not inherited by general import expressions. Also note that
7138 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7139 'translations' in common applications. The "no_abbrevs" print mode
7140 prevents folding of abbreviations in term output.
7142 Concrete syntax is attached to specified constants in internal form,
7143 independently of name spaces. The parse tree representation is
7144 slightly different -- use 'notation' instead of raw 'syntax', and
7145 'translations' with explicit "CONST" markup to accommodate this.
7147 * Pure/Isar: unified syntax for new-style specification mechanisms
7148 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7149 full type inference and dummy patterns ("_"). For example:
7151 definition "K x _ = x"
7153 inductive conj for A B
7154 where "A ==> B ==> conj A B"
7156 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7157 the current context. Print mode "no_abbrevs" prevents inversion of
7158 abbreviations on output.
7160 * Isar/locales: improved parameter handling: use of locales "var" and
7161 "struct" no longer necessary; - parameter renamings are no longer
7162 required to be injective. For example, this allows to define
7163 endomorphisms as locale endom = homom mult mult h.
7165 * Isar/locales: changed the way locales with predicates are defined.
7166 Instead of accumulating the specification, the imported expression is
7167 now an interpretation. INCOMPATIBILITY: different normal form of
7168 locale expressions. In particular, in interpretations of locales with
7169 predicates, goals repesenting already interpreted fragments are not
7170 removed automatically. Use methods `intro_locales' and
7171 `unfold_locales'; see below.
7173 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7174 provide backward reasoning on locales predicates. The methods are
7175 aware of interpretations and discharge corresponding goals.
7176 `intro_locales' is less aggressive then `unfold_locales' and does not
7177 unfold predicates to assumptions.
7179 * Isar/locales: the order in which locale fragments are accumulated
7180 has changed. This enables to override declarations from fragments due
7181 to interpretations -- for example, unwanted simp rules.
7183 * Isar/locales: interpretation in theories and proof contexts has been
7184 extended. One may now specify (and prove) equations, which are
7185 unfolded in interpreted theorems. This is useful for replacing
7186 defined concepts (constants depending on locale parameters) by
7187 concepts already existing in the target context. Example:
7189 interpretation partial_order ["op <= :: [int, int] => bool"]
7190 where "partial_order.less (op <=) (x::int) y = (x < y)"
7192 Typically, the constant `partial_order.less' is created by a
7193 definition specification element in the context of locale
7196 * Method "induct": improved internal context management to support
7197 local fixes and defines on-the-fly. Thus explicit meta-level
7198 connectives !! and ==> are rarely required anymore in inductive goals
7199 (using object-logic connectives for this purpose has been long
7200 obsolete anyway). Common proof patterns are explained in
7201 src/HOL/Induct/Common_Patterns.thy, see also
7202 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7205 * Method "induct": improved handling of simultaneous goals. Instead of
7206 introducing object-level conjunction, the statement is now split into
7207 several conclusions, while the corresponding symbolic cases are nested
7208 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7209 see src/HOL/Induct/Common_Patterns.thy, for example.
7211 * Method "induct": mutual induction rules are now specified as a list
7212 of rule sharing the same induction cases. HOL packages usually provide
7213 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7214 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7215 mutual induction rules differently, i.e. like this:
7217 (induct rule: foo_bar.inducts)
7218 (induct set: foo bar)
7219 (induct pred: foo bar)
7220 (induct type: foo bar)
7222 The ML function ProjectRule.projections turns old-style rules into the
7225 * Method "coinduct": dual of induction, see
7226 src/HOL/Library/Coinductive_List.thy for various examples.
7228 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7229 considered a legacy feature.
7231 * Attribute "symmetric" produces result with standardized schematic
7232 variables (index 0). Potential INCOMPATIBILITY.
7234 * Simplifier: by default the simplifier trace only shows top level
7235 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7236 default. Thus there is less danger of being flooded by the trace. The
7237 trace indicates where parts have been suppressed.
7239 * Provers/classical: removed obsolete classical version of elim_format
7240 attribute; classical elim/dest rules are now treated uniformly when
7241 manipulating the claset.
7243 * Provers/classical: stricter checks to ensure that supplied intro,
7244 dest and elim rules are well-formed; dest and elim rules must have at
7247 * Provers/classical: attributes dest/elim/intro take an optional
7248 weight argument for the rule (just as the Pure versions). Weights are
7249 ignored by automated tools, but determine the search order of single
7252 * Syntax: input syntax now supports dummy variable binding "%_. b",
7253 where the body does not mention the bound variable. Note that dummy
7254 patterns implicitly depend on their context of bounds, which makes
7255 "{_. _}" match any set comprehension as expected. Potential
7256 INCOMPATIBILITY -- parse translations need to cope with syntactic
7257 constant "_idtdummy" in the binding position.
7259 * Syntax: removed obsolete syntactic constant "_K" and its associated
7260 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7261 for example "A -> B" => "Pi A (%_. B)".
7263 * Pure: 'class_deps' command visualizes the subclass relation, using
7264 the graph browser tool.
7266 * Pure: 'print_theory' now suppresses certain internal declarations by
7267 default; use '!' option for full details.
7272 * Method "metis" proves goals by applying the Metis general-purpose
7273 resolution prover (see also http://gilith.com/software/metis/).
7274 Examples are in the directory MetisExamples. WARNING: the
7275 Isabelle/HOL-Metis integration does not yet work properly with
7278 * Command 'sledgehammer' invokes external automatic theorem provers as
7279 background processes. It generates calls to the "metis" method if
7280 successful. These can be pasted into the proof. Users do not have to
7281 wait for the automatic provers to return. WARNING: does not really
7282 work with multi-threading.
7284 * New "auto_quickcheck" feature tests outermost goal statements for
7285 potential counter-examples. Controlled by ML references
7286 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7287 5000 milliseconds). Fails silently if statements is outside of
7288 executable fragment, or any other codgenerator problem occurs.
7290 * New constant "undefined" with axiom "undefined x = undefined".
7292 * Added class "HOL.eq", allowing for code generation with polymorphic
7295 * Some renaming of class constants due to canonical name prefixing in
7296 the new 'class' package:
7298 HOL.abs ~> HOL.abs_class.abs
7299 HOL.divide ~> HOL.divide_class.divide
7300 0 ~> HOL.zero_class.zero
7301 1 ~> HOL.one_class.one
7302 op + ~> HOL.plus_class.plus
7303 op - ~> HOL.minus_class.minus
7304 uminus ~> HOL.minus_class.uminus
7305 op * ~> HOL.times_class.times
7306 op < ~> HOL.ord_class.less
7307 op <= > HOL.ord_class.less_eq
7308 Nat.power ~> Power.power_class.power
7309 Nat.size ~> Nat.size_class.size
7310 Numeral.number_of ~> Numeral.number_class.number_of
7311 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7312 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7313 Orderings.min ~> Orderings.ord_class.min
7314 Orderings.max ~> Orderings.ord_class.max
7315 Divides.op div ~> Divides.div_class.div
7316 Divides.op mod ~> Divides.div_class.mod
7317 Divides.op dvd ~> Divides.div_class.dvd
7319 INCOMPATIBILITY. Adaptions may be required in the following cases:
7321 a) User-defined constants using any of the names "plus", "minus",
7322 "times", "less" or "less_eq". The standard syntax translations for
7323 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7326 b) Variables named "plus", "minus", "times", "less", "less_eq"
7327 INCOMPATIBILITY: use more specific names.
7329 c) Permutative equations (e.g. "a + b = b + a")
7330 Since the change of names also changes the order of terms, permutative
7331 rewrite rules may get applied in a different order. Experience shows
7332 that this is rarely the case (only two adaptions in the whole Isabelle
7333 distribution). INCOMPATIBILITY: rewrite proofs
7335 d) ML code directly refering to constant names
7336 This in general only affects hand-written proof tactics, simprocs and
7337 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7338 Consider using @{const_name} antiquotation.
7340 * New class "default" with associated constant "default".
7342 * Function "sgn" is now overloaded and available on int, real, complex
7343 (and other numeric types), using class "sgn". Two possible defs of
7344 sgn are given as equational assumptions in the classes sgn_if and
7345 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7348 * Locale "partial_order" now unified with class "order" (cf. theory
7349 Orderings), added parameter "less". INCOMPATIBILITY.
7351 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7352 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7353 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7355 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7356 changed order of proof goals in instance proofs.
7358 * The transitivity reasoner for partial and linear orders is set up
7359 for classes "order" and "linorder". Instances of the reasoner are available
7360 in all contexts importing or interpreting the corresponding locales.
7361 Method "order" invokes the reasoner separately; the reasoner
7362 is also integrated with the Simplifier as a solver. Diagnostic
7363 command 'print_orders' shows the available instances of the reasoner
7364 in the current context.
7366 * Localized monotonicity predicate in theory "Orderings"; integrated
7367 lemmas max_of_mono and min_of_mono with this predicate.
7370 * Formulation of theorem "dense" changed slightly due to integration
7371 with new class dense_linear_order.
7373 * Uniform lattice theory development in HOL.
7375 constants "meet" and "join" now named "inf" and "sup"
7376 constant "Meet" now named "Inf"
7378 classes "meet_semilorder" and "join_semilorder" now named
7379 "lower_semilattice" and "upper_semilattice"
7380 class "lorder" now named "lattice"
7381 class "comp_lat" now named "complete_lattice"
7383 Instantiation of lattice classes allows explicit definitions
7384 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7386 INCOMPATIBILITY. Theorem renames:
7388 meet_left_le ~> inf_le1
7389 meet_right_le ~> inf_le2
7390 join_left_le ~> sup_ge1
7391 join_right_le ~> sup_ge2
7392 meet_join_le ~> inf_sup_ord
7395 le_meet ~> le_inf_iff
7396 le_join ~> ge_sup_conv
7397 meet_idempotent ~> inf_idem
7398 join_idempotent ~> sup_idem
7399 meet_comm ~> inf_commute
7400 join_comm ~> sup_commute
7401 meet_leI1 ~> le_infI1
7402 meet_leI2 ~> le_infI2
7403 le_joinI1 ~> le_supI1
7404 le_joinI2 ~> le_supI2
7405 meet_assoc ~> inf_assoc
7406 join_assoc ~> sup_assoc
7407 meet_left_comm ~> inf_left_commute
7408 meet_left_idempotent ~> inf_left_idem
7409 join_left_comm ~> sup_left_commute
7410 join_left_idempotent ~> sup_left_idem
7413 le_def_meet ~> le_iff_inf
7414 le_def_join ~> le_iff_sup
7415 join_absorp2 ~> sup_absorb2
7416 join_absorp1 ~> sup_absorb1
7417 meet_absorp1 ~> inf_absorb1
7418 meet_absorp2 ~> inf_absorb2
7419 meet_join_absorp ~> inf_sup_absorb
7420 join_meet_absorp ~> sup_inf_absorb
7421 distrib_join_le ~> distrib_sup_le
7422 distrib_meet_le ~> distrib_inf_le
7424 add_meet_distrib_left ~> add_inf_distrib_left
7425 add_join_distrib_left ~> add_sup_distrib_left
7426 is_join_neg_meet ~> is_join_neg_inf
7427 is_meet_neg_join ~> is_meet_neg_sup
7428 add_meet_distrib_right ~> add_inf_distrib_right
7429 add_join_distrib_right ~> add_sup_distrib_right
7430 add_meet_join_distribs ~> add_sup_inf_distribs
7431 join_eq_neg_meet ~> sup_eq_neg_inf
7432 meet_eq_neg_join ~> inf_eq_neg_sup
7433 add_eq_meet_join ~> add_eq_inf_sup
7434 meet_0_imp_0 ~> inf_0_imp_0
7435 join_0_imp_0 ~> sup_0_imp_0
7436 meet_0_eq_0 ~> inf_0_eq_0
7437 join_0_eq_0 ~> sup_0_eq_0
7438 neg_meet_eq_join ~> neg_inf_eq_sup
7439 neg_join_eq_meet ~> neg_sup_eq_inf
7440 join_eq_if ~> sup_eq_if
7442 mono_meet ~> mono_inf
7443 mono_join ~> mono_sup
7444 meet_bool_eq ~> inf_bool_eq
7445 join_bool_eq ~> sup_bool_eq
7446 meet_fun_eq ~> inf_fun_eq
7447 join_fun_eq ~> sup_fun_eq
7448 meet_set_eq ~> inf_set_eq
7449 join_set_eq ~> sup_set_eq
7450 meet1_iff ~> inf1_iff
7451 meet2_iff ~> inf2_iff
7460 join1_iff ~> sup1_iff
7461 join2_iff ~> sup2_iff
7471 is_meet_Meet ~> is_meet_Inf
7472 Meet_bool_def ~> Inf_bool_def
7473 Meet_fun_def ~> Inf_fun_def
7474 Meet_greatest ~> Inf_greatest
7475 Meet_lower ~> Inf_lower
7476 Meet_set_def ~> Inf_set_def
7479 Sup_bool_eq ~> Sup_bool_def
7480 Sup_fun_eq ~> Sup_fun_def
7481 Sup_set_eq ~> Sup_set_def
7483 listsp_meetI ~> listsp_infI
7484 listsp_meet_eq ~> listsp_inf_eq
7489 * Added syntactic class "size"; overloaded constant "size" now has
7490 type "'a::size ==> bool"
7492 * Internal reorganisation of `size' of datatypes: size theorems
7493 "foo.size" are no longer subsumed by "foo.simps" (but are still
7494 simplification rules by default!); theorems "prod.size" now named
7497 * Class "div" now inherits from class "times" rather than "type".
7500 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7501 Linorder etc. have disappeared; operations defined in terms of
7502 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7504 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7506 * HOL-Word: New extensive library and type for generic, fixed size
7507 machine words, with arithmetic, bit-wise, shifting and rotating
7508 operations, reflection into int, nat, and bool lists, automation for
7509 linear arithmetic (by automatic reflection into nat or int), including
7510 lemmas on overflow and monotonicity. Instantiated to all appropriate
7511 arithmetic type classes, supporting automatic simplification of
7512 numerals on all operations.
7514 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7516 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7518 * Code generator library theories:
7519 - Code_Integer represents HOL integers by big integer literals in target
7521 - Code_Char represents HOL characters by character literals in target
7523 - Code_Char_chr like Code_Char, but also offers treatment of character
7524 codes; includes Code_Integer.
7525 - Executable_Set allows to generate code for finite sets using lists.
7526 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7528 - Executable_Real implements a subset of real numbers, namly those
7529 representable by rational numbers.
7530 - Efficient_Nat implements natural numbers by integers, which in general will
7531 result in higher efficency; pattern matching with 0/Suc is eliminated;
7532 includes Code_Integer.
7533 - Code_Index provides an additional datatype index which is mapped to
7534 target-language built-in integers.
7535 - Code_Message provides an additional datatype message_string which is isomorphic to
7536 strings; messages are mapped to target-language strings.
7538 * New package for inductive predicates
7540 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7543 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7544 for z_1 :: U_1 and ... and z_n :: U_m
7546 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7549 with full support for type-inference, rather than
7551 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7553 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7554 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7556 inductive "s z_1 ... z_m"
7558 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7561 For backward compatibility, there is a wrapper allowing inductive
7562 sets to be defined with the new package via
7565 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7566 for z_1 :: U_1 and ... and z_n :: U_m
7568 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7574 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7575 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7576 for z_1 :: U_1 and ... and z_n :: U_m
7578 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7579 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7582 if the additional syntax "p ..." is required.
7584 Numerous examples can be found in the subdirectories src/HOL/Auth,
7585 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7589 - Since declaration and definition of inductive sets or predicates
7590 is no longer separated, abbreviations involving the newly
7591 introduced sets or predicates must be specified together with the
7592 introduction rules after the 'where' keyword (see above), rather
7593 than before the actual inductive definition.
7595 - The variables in induction and elimination rules are now
7596 quantified in the order of their occurrence in the introduction
7597 rules, rather than in alphabetical order. Since this may break
7598 some proofs, these proofs either have to be repaired, e.g. by
7599 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7600 statements of the form
7602 case (rule_i a_i_1 ... a_i_{k_i})
7604 or the old order of quantification has to be restored by explicitly adding
7605 meta-level quantifiers in the introduction rules, i.e.
7607 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7609 - The format of the elimination rules is now
7611 p z_1 ... z_m x_1 ... x_n ==>
7612 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7617 (x_1, ..., x_n) : s z_1 ... z_m ==>
7618 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7621 for sets rather than
7623 x : s z_1 ... z_m ==>
7624 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7627 This may require terms in goals to be expanded to n-tuples
7628 (e.g. using case_tac or simplification with the split_paired_all
7629 rule) before the above elimination rule is applicable.
7631 - The elimination or case analysis rules for (mutually) inductive
7632 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7633 list of rules "p_1_..._p_k.elims" is no longer available.
7635 * New package "function"/"fun" for general recursive functions,
7636 supporting mutual and nested recursion, definitions in local contexts,
7637 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7638 for small examples, and the separate tutorial on the function
7639 package. The old recdef "package" is still available as before, but
7640 users are encouraged to use the new package.
7642 * Method "lexicographic_order" automatically synthesizes termination
7643 relations as lexicographic combinations of size measures.
7645 * Case-expressions allow arbitrary constructor-patterns (including
7646 "_") and take their order into account, like in functional
7647 programming. Internally, this is translated into nested
7648 case-expressions; missing cases are added and mapped to the predefined
7649 constant "undefined". In complicated cases printing may no longer show
7650 the original input but the internal form. Lambda-abstractions allow
7651 the same form of pattern matching: "% pat1 => e1 | ..." is an
7652 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7655 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7656 is an abbreviation for "of_nat :: nat => int". The simplification
7657 rules for "of_nat" have been changed to work like "int" did
7658 previously. Potential INCOMPATIBILITY:
7659 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7660 - of_nat_diff and of_nat_mult are no longer default simp rules
7662 * Method "algebra" solves polynomial equations over (semi)rings using
7663 Groebner bases. The (semi)ring structure is defined by locales and the
7664 tool setup depends on that generic context. Installing the method for
7665 a specific type involves instantiating the locale and possibly adding
7666 declarations for computation on the coefficients. The method is
7667 already instantiated for natural numbers and for the axiomatic class
7668 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7669 CALCULEMUS 2007 for the general principles underlying this
7670 architecture of context-aware proof-tools.
7672 * Method "ferrack" implements quantifier elimination over
7673 special-purpose dense linear orders using locales (analogous to
7674 "algebra"). The method is already installed for class
7675 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7678 * Former constant "List.op @" now named "List.append". Use ML
7679 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7680 circumvent possible incompatibilities when working on ML level.
7682 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7684 * New function listsum :: 'a list => 'a for arbitrary monoids.
7685 Special syntax: "SUM x <- xs. f x" (and latex variants)
7687 * New syntax for Haskell-like list comprehension (input only), eg.
7688 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7690 * The special syntax for function "filter" has changed from [x :
7691 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7692 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7694 * [a..b] is now defined for arbitrary linear orders. It used to be
7695 defined on nat only, as an abbreviation for [a..<Suc b]
7698 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7700 * New functions "sorted" and "sort" in src/HOL/List.thy.
7702 * New lemma collection field_simps (an extension of ring_simps) for
7703 manipulating (in)equations involving division. Multiplies with all
7704 denominators that can be proved to be non-zero (in equations) or
7705 positive/negative (in inequations).
7707 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7708 have been improved and renamed to ring_simps, group_simps and
7709 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7710 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7712 * Theory Library/Commutative_Ring: switched from recdef to function
7713 package; constants add, mul, pow now curried. Infix syntax for
7714 algebraic operations.
7716 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7719 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7722 * HOL/records: generalised field-update to take a function on the
7723 field rather than the new value: r(|A := x|) is translated to A_update
7724 (K x) r The K-combinator that is internally used is called K_record.
7725 INCOMPATIBILITY: Usage of the plain update functions has to be
7728 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7729 * x = 0, which are required for a semiring. Richer structures do not
7730 inherit from semiring_0 anymore, because this property is a theorem
7731 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7732 there is more to prove, but this is mostly trivial.
7734 * Class "recpower" is generalized to arbitrary monoids, not just
7735 commutative semirings. INCOMPATIBILITY: may need to incorporate
7736 commutativity or semiring properties additionally.
7738 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7739 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7740 better use 'abbreviation'.
7742 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7744 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7745 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7746 significant changes for setting up numeral syntax for types:
7747 - New constants Numeral.pred and Numeral.succ instead
7748 of former Numeral.bin_pred and Numeral.bin_succ.
7749 - Use integer operations instead of bin_add, bin_mult and so on.
7750 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7751 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7753 See src/HOL/Integ/IntArith.thy for an example setup.
7755 * Command 'normal_form' computes the normal form of a term that may
7756 contain free variables. For example ``normal_form "rev [a, b, c]"''
7757 produces ``[b, c, a]'' (without proof). This command is suitable for
7758 heavy-duty computations because the functions are compiled to ML
7759 first. Correspondingly, a method "normalization" is provided. See
7760 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7762 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7763 25 like -->); output depends on the "iff" print_mode, the default is
7764 "A = B" (with priority 50).
7766 * Relations less (<) and less_eq (<=) are also available on type bool.
7767 Modified syntax to disallow nesting without explicit parentheses,
7768 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7771 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7773 * Relation composition operator "op O" now has precedence 75 and binds
7774 stronger than union and intersection. INCOMPATIBILITY.
7776 * The old set interval syntax "{m..n(}" (and relatives) has been
7777 removed. Use "{m..<n}" (and relatives) instead.
7779 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7780 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7781 ``declare [[simproc del: neq]]''.
7783 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7786 * Theorem Cons_eq_map_conv no longer declared as "simp".
7788 * Theorem setsum_mult renamed to setsum_right_distrib.
7790 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7793 * Reimplemented methods "sat" and "satx", with several improvements:
7794 goals no longer need to be stated as "<prems> ==> False", equivalences
7795 (i.e. "=" on type bool) are handled, variable names of the form
7796 "lit_<n>" are no longer reserved, significant speedup.
7798 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7799 zChaff is still supported as well.
7801 * 'inductive' and 'datatype': provide projections of mutual rules,
7802 bundled as foo_bar.inducts;
7804 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7807 * Library: moved theory Accessible_Part to main HOL.
7809 * Library: added theory Coinductive_List of potentially infinite lists
7810 as greatest fixed-point.
7812 * Library: added theory AssocList which implements (finite) maps as
7815 * Method "evaluation" solves goals (i.e. a boolean expression)
7816 efficiently by compiling it to ML. The goal is "proved" (via an
7817 oracle) if it evaluates to True.
7819 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7820 also when invoked by the simplifier. This results in the Simplifier
7821 being more powerful on arithmetic goals. INCOMPATIBILITY.
7822 Configuration option fast_arith_split_limit=0 recovers the old
7825 * Support for hex (0x20) and binary (0b1001) numerals.
7827 * New method: reify eqs (t), where eqs are equations for an
7828 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7829 parameter, computes a term s::'b and a list xs::'a list and proves the
7830 theorem I xs s = t. This is also known as reification or quoting. The
7831 resulting theorem is applied to the subgoal to substitute t with I xs
7832 s. If t is omitted, the subgoal itself is reified.
7834 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7835 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7836 where f is supposed to be a computable function (in the sense of code
7837 generattion). The method uses reify to compute s and xs as above then
7838 applies corr_thm and uses normalization by evaluation to "prove" f s =
7839 r and finally gets the theorem t = r, which is again applied to the
7840 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7842 * Reflection: Automatic reification now handels binding, an example is
7843 available in src/HOL/ex/ReflectionEx.thy
7845 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7846 command 'statespace' that is similar to 'record', but introduces an
7847 abstract specification based on the locale infrastructure instead of
7848 HOL types. This leads to extra flexibility in composing state spaces,
7849 in particular multiple inheritance and renaming of components.
7854 * Hyperreal: Functions root and sqrt are now defined on negative real
7855 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7856 Nonnegativity side conditions have been removed from many lemmas, so
7857 that more subgoals may now be solved by simplification; potential
7860 * Real: new type classes formalize real normed vector spaces and
7861 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7862 and norm :: 'a => real.
7864 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7865 reals into other types. The overloaded constant Reals :: 'a set is now
7866 defined as range of_real; potential INCOMPATIBILITY.
7868 * Real: proper support for ML code generation, including 'quickcheck'.
7869 Reals are implemented as arbitrary precision rationals.
7871 * Hyperreal: Several constants that previously worked only for the
7872 reals have been generalized, so they now work over arbitrary vector
7873 spaces. Type annotations may need to be added in some cases; potential
7876 Infinitesimal :: ('a::real_normed_vector) star set
7877 HFinite :: ('a::real_normed_vector) star set
7878 HInfinite :: ('a::real_normed_vector) star set
7879 approx :: ('a::real_normed_vector) star => 'a star => bool
7880 monad :: ('a::real_normed_vector) star => 'a star set
7881 galaxy :: ('a::real_normed_vector) star => 'a star set
7882 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7883 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7884 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7885 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7886 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7887 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7888 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7889 sgn :: 'a::real_normed_vector => 'a
7890 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7892 * Complex: Some complex-specific constants are now abbreviations for
7893 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7894 hnorm. Other constants have been entirely removed in favor of the
7895 polymorphic versions (INCOMPATIBILITY):
7899 HInfinite <-- CInfinite
7900 Infinitesimal <-- CInfinitesimal
7903 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7904 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7905 (ns)deriv <-- (ns)cderiv
7910 * Formalisation of ideals and the quotient construction over rings.
7912 * Order and lattice theory no longer based on records.
7915 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7916 greatest_closed. INCOMPATIBILITY.
7918 * Method algebra is now set up via an attribute. For examples see
7919 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7920 of algebraic structures.
7922 * Renamed theory CRing to Ring.
7927 * Substantial, yet incomplete support for nominal datatypes (binding
7928 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7929 src/HOL/Nominal/Examples. Prospective users should consult
7930 http://isabelle.in.tum.de/nominal/
7935 * ML basics: just one true type int, which coincides with IntInf.int
7938 * ML within Isar: antiquotations allow to embed statically-checked
7939 formal entities in the source, referring to the context available at
7940 compile-time. For example:
7942 ML {* @{sort "{zero,one}"} *}
7943 ML {* @{typ "'a => 'b"} *}
7944 ML {* @{term "%x. x"} *}
7945 ML {* @{prop "x == y"} *}
7946 ML {* @{ctyp "'a => 'b"} *}
7947 ML {* @{cterm "%x. x"} *}
7948 ML {* @{cprop "x == y"} *}
7949 ML {* @{thm asm_rl} *}
7950 ML {* @{thms asm_rl} *}
7951 ML {* @{type_name c} *}
7952 ML {* @{type_syntax c} *}
7953 ML {* @{const_name c} *}
7954 ML {* @{const_syntax c} *}
7957 ML {* @{theory Pure} *}
7958 ML {* @{theory_ref} *}
7959 ML {* @{theory_ref Pure} *}
7962 ML {* @{clasimpset} *}
7964 The same works for sources being ``used'' within an Isar context.
7966 * ML in Isar: improved error reporting; extra verbosity with
7967 ML_Context.trace enabled.
7969 * Pure/General/table.ML: the join operations now works via exceptions
7970 DUP/SAME instead of type option. This is simpler in simple cases, and
7971 admits slightly more efficient complex applications.
7973 * Pure: 'advanced' translation functions (parse_translation etc.) now
7974 use Context.generic instead of just theory.
7976 * Pure: datatype Context.generic joins theory/Proof.context and
7977 provides some facilities for code that works in either kind of
7978 context, notably GenericDataFun for uniform theory and proof data.
7980 * Pure: simplified internal attribute type, which is now always
7981 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7982 local (Proof.context) attributes have been discontinued, while
7983 minimizing code duplication. Thm.rule_attribute and
7984 Thm.declaration_attribute build canonical attributes; see also structure
7985 Context for further operations on Context.generic, notably
7986 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7987 declarations and definitions.
7989 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7990 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7991 init only required for impure data. INCOMPATIBILITY: empty really need
7992 to be empty (no dependencies on theory content!)
7994 * Pure/kernel: consts certification ignores sort constraints given in
7995 signature declarations. (This information is not relevant to the
7996 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7997 potential INCOMPATIBILITY.
7999 * Pure: axiomatic type classes are now purely definitional, with
8000 explicit proofs of class axioms and super class relations performed
8001 internally. See Pure/axclass.ML for the main internal interfaces --
8002 notably AxClass.define_class supercedes AxClass.add_axclass, and
8003 AxClass.axiomatize_class/classrel/arity supersede
8004 Sign.add_classes/classrel/arities.
8006 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8007 global/local versions on theory vs. Proof.context have been
8008 discontinued; Attrib.syntax and Method.syntax have been adapted
8009 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8010 attributes, methods, etc.
8012 * Pure: several functions of signature "... -> theory -> theory * ..."
8013 have been reoriented to "... -> theory -> ... * theory" in order to
8014 allow natural usage in combination with the ||>, ||>>, |-> and
8015 fold_map combinators.
8017 * Pure: official theorem names (closed derivations) and additional
8018 comments (tags) are now strictly separate. Name hints -- which are
8019 maintained as tags -- may be attached any time without affecting the
8022 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8023 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8024 achieve the old behaviour.
8026 * Pure: the "Goal" constant is now called "prop", supporting a
8027 slightly more general idea of ``protecting'' meta-level rule
8030 * Pure: Logic.(un)varify only works in a global context, which is now
8031 enforced instead of silently assumed. INCOMPATIBILITY, may use
8032 Logic.legacy_(un)varify as temporary workaround.
8034 * Pure: structure Name provides scalable operations for generating
8035 internal variable names, notably Name.variants etc. This replaces
8036 some popular functions from term.ML:
8038 Term.variant -> Name.variant
8039 Term.variantlist -> Name.variant_list
8040 Term.invent_names -> Name.invent_list
8042 Note that low-level renaming rarely occurs in new code -- operations
8043 from structure Variable are used instead (see below).
8045 * Pure: structure Variable provides fundamental operations for proper
8046 treatment of fixed/schematic variables in a context. For example,
8047 Variable.import introduces fixes for schematics of given facts and
8048 Variable.export reverses the effect (up to renaming) -- this replaces
8049 various freeze_thaw operations.
8051 * Pure: structure Goal provides simple interfaces for
8052 init/conclude/finish and tactical prove operations (replacing former
8053 Tactic.prove). Goal.prove is the canonical way to prove results
8054 within a given context; Goal.prove_global is a degraded version for
8055 theory level goals, including a global Drule.standard. Note that
8056 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8057 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8058 in a locale context).
8060 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8061 and type checking (Syntax.check_term etc.), with common combinations
8062 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8063 which are considered legacy and await removal.
8065 * Pure/Syntax: generic interfaces for type unchecking
8066 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8067 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8068 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8069 available for convenience, but refer to the very same operations using
8070 a mere theory instead of a full context.
8072 * Isar: simplified treatment of user-level errors, using exception
8073 ERROR of string uniformly. Function error now merely raises ERROR,
8074 without any side effect on output channels. The Isar toplevel takes
8075 care of proper display of ERROR exceptions. ML code may use plain
8076 handle/can/try; cat_error may be used to concatenate errors like this:
8078 ... handle ERROR msg => cat_error msg "..."
8080 Toplevel ML code (run directly or through the Isar toplevel) may be
8081 embedded into the Isar toplevel with exception display/debug like
8084 Isar.toplevel (fn () => ...)
8086 INCOMPATIBILITY, removed special transform_error facilities, removed
8087 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8088 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8089 -- use plain ERROR instead.
8091 * Isar: theory setup now has type (theory -> theory), instead of a
8092 list. INCOMPATIBILITY, may use #> to compose setup functions.
8094 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8095 ProofContext.debug/verbose flags.
8097 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8098 theory before entering a proof state. Transactions now always see a
8099 quasi-functional intermediate checkpoint, both in interactive and
8102 * Isar: simplified interfaces for outer syntax. Renamed
8103 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8104 OuterSyntax.add_parsers -- this functionality is now included in
8105 OuterSyntax.command etc. INCOMPATIBILITY.
8107 * Simplifier: the simpset of a running simplification process now
8108 contains a proof context (cf. Simplifier.the_context), which is the
8109 very context that the initial simpset has been retrieved from (by
8110 simpset_of/local_simpset_of). Consequently, all plug-in components
8111 (solver, looper etc.) may depend on arbitrary proof data.
8113 * Simplifier.inherit_context inherits the proof context (plus the
8114 local bounds) of the current simplification process; any simproc
8115 etc. that calls the Simplifier recursively should do this! Removed
8116 former Simplifier.inherit_bounds, which is already included here --
8117 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8118 specify an explicit context using Simplifier.context/theory_context.
8120 * Simplifier/Classical Reasoner: more abstract interfaces
8121 change_simpset/claset for modifying the simpset/claset reference of a
8122 theory; raw versions simpset/claset_ref etc. have been discontinued --
8125 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8131 * settings: the default heap location within ISABELLE_HOME_USER now
8132 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8133 Isabelle installations.
8135 * isabelle-process: option -S (secure mode) disables some critical
8136 operations, notably runtime compilation and evaluation of ML source
8139 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8141 * Support for parallel execution, using native multicore support of
8142 Poly/ML 5.1. The theory loader exploits parallelism when processing
8143 independent theories, according to the given theory header
8144 specifications. The maximum number of worker threads is specified via
8145 usedir option -M or the "max-threads" setting in Proof General. A
8146 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8147 to 6 on a 8-core machine. User-code needs to observe certain
8148 guidelines for thread-safe programming, see appendix A in the Isar
8149 Implementation manual.
8153 New in Isabelle2005 (October 2005)
8154 ----------------------------------
8158 * Theory headers: the new header syntax for Isar theories is
8161 imports <theory1> ... <theoryN>
8162 uses <file1> ... <fileM>
8165 where the 'uses' part is optional. The previous syntax
8167 theory <name> = <theory1> + ... + <theoryN>:
8169 will disappear in the next release. Use isatool fixheaders to convert
8170 existing theory files. Note that there is no change in ancient
8171 non-Isar theories now, but these will disappear soon.
8173 * Theory loader: parent theories can now also be referred to via
8174 relative and absolute paths.
8176 * Command 'find_theorems' searches for a list of criteria instead of a
8177 list of constants. Known criteria are: intro, elim, dest, name:string,
8178 simp:term, and any term. Criteria can be preceded by '-' to select
8179 theorems that do not match. Intro, elim, dest select theorems that
8180 match the current goal, name:s selects theorems whose fully qualified
8181 name contain s, and simp:term selects all simplification rules whose
8182 lhs match term. Any other term is interpreted as pattern and selects
8183 all theorems matching the pattern. Available in ProofGeneral under
8184 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8186 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8188 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8189 matching the current goal as introduction rule and not having "HOL."
8190 in their name (i.e. not being defined in theory HOL).
8192 * Command 'thms_containing' has been discontinued in favour of
8193 'find_theorems'; INCOMPATIBILITY.
8195 * Communication with Proof General is now 8bit clean, which means that
8196 Unicode text in UTF-8 encoding may be used within theory texts (both
8197 formal and informal parts). Cf. option -U of the Isabelle Proof
8198 General interface. Here are some simple examples (cf. src/HOL/ex):
8200 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8201 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8203 * Improved efficiency of the Simplifier and, to a lesser degree, the
8204 Classical Reasoner. Typical big applications run around 2 times
8208 *** Document preparation ***
8210 * Commands 'display_drafts' and 'print_drafts' perform simple output
8211 of raw sources. Only those symbols that do not require additional
8212 LaTeX packages (depending on comments in isabellesym.sty) are
8213 displayed properly, everything else is left verbatim. isatool display
8214 and isatool print are used as front ends (these are subject to the
8215 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8217 * Command tags control specific markup of certain regions of text,
8218 notably folding and hiding. Predefined tags include "theory" (for
8219 theory begin and end), "proof" for proof commands, and "ML" for
8220 commands involving ML code; the additional tags "visible" and
8221 "invisible" are unused by default. Users may give explicit tag
8222 specifications in the text, e.g. ''by %invisible (auto)''. The
8223 interpretation of tags is determined by the LaTeX job during document
8224 preparation: see option -V of isatool usedir, or options -n and -t of
8225 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8228 Several document versions may be produced at the same time via isatool
8229 usedir (the generated index.html will link all of them). Typical
8230 specifications include ''-V document=theory,proof,ML'' to present
8231 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8232 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8233 these parts without any formal replacement text. The Isabelle site
8234 default settings produce ''document'' and ''outline'' versions as
8237 * Several new antiquotations:
8239 @{term_type term} prints a term with its type annotated;
8241 @{typeof term} prints the type of a term;
8243 @{const const} is the same as @{term const}, but checks that the
8244 argument is a known logical constant;
8246 @{term_style style term} and @{thm_style style thm} print a term or
8247 theorem applying a "style" to it
8251 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8252 definitions, equations, inequations etc., 'concl' printing only the
8253 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8254 to print the specified premise. TermStyle.add_style provides an ML
8255 interface for introducing further styles. See also the "LaTeX Sugar"
8256 document practical applications. The ML antiquotation prints
8257 type-checked ML expressions verbatim.
8259 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8260 and 'text' support optional locale specification '(in loc)', which
8261 specifies the default context for interpreting antiquotations. For
8262 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8264 * Option 'locale=NAME' of antiquotations specifies an alternative
8265 context interpreting the subsequent argument. For example: @{thm
8266 [locale=lattice] inf_assoc}.
8268 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8271 * Proper output of antiquotations for theory commands involving a
8272 proof context (such as 'locale' or 'theorem (in loc) ...').
8274 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8275 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8277 * isatool usedir: new option -C (default true) controls whether option
8278 -D should include a copy of the original document directory; -C false
8279 prevents unwanted effects such as copying of administrative CVS data.
8284 * Considerably improved version of 'constdefs' command. Now performs
8285 automatic type-inference of declared constants; additional support for
8286 local structure declarations (cf. locales and HOL records), see also
8287 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8288 sequential dependencies of definitions within a single 'constdefs'
8289 section; moreover, the declared name needs to be an identifier. If
8290 all fails, consider to fall back on 'consts' and 'defs' separately.
8292 * Improved indexed syntax and implicit structures. First of all,
8293 indexed syntax provides a notational device for subscripted
8294 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8295 expressions. Secondly, in a local context with structure
8296 declarations, number indexes \<^sub>n or the empty index (default
8297 number 1) refer to a certain fixed variable implicitly; option
8298 show_structs controls printing of implicit structures. Typical
8299 applications of these concepts involve record types and locales.
8301 * New command 'no_syntax' removes grammar declarations (and
8302 translations) resulting from the given syntax specification, which is
8303 interpreted in the same manner as for the 'syntax' command.
8305 * 'Advanced' translation functions (parse_translation etc.) may depend
8306 on the signature of the theory context being presently used for
8307 parsing/printing, see also isar-ref manual.
8309 * Improved 'oracle' command provides a type-safe interface to turn an
8310 ML expression of type theory -> T -> term into a primitive rule of
8311 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8312 is already included here); see also FOL/ex/IffExample.thy;
8315 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8316 before); "cI" is no longer bound, use "c.intro" instead.
8317 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8318 axclasses vs. locales.
8320 * Improved internal renaming of symbolic identifiers -- attach primes
8321 instead of base 26 numbers.
8323 * New flag show_question_marks controls printing of leading question
8324 marks in schematic variable names.
8326 * In schematic variable names, *any* symbol following \<^isub> or
8327 \<^isup> is now treated as part of the base name. For example, the
8328 following works without printing of awkward ".0" indexes:
8330 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8333 * Inner syntax includes (*(*nested*) comments*).
8335 * Pretty printer now supports unbreakable blocks, specified in mixfix
8336 annotations as "(00...)".
8338 * Clear separation of logical types and nonterminals, where the latter
8339 may only occur in 'syntax' specifications or type abbreviations.
8340 Before that distinction was only partially implemented via type class
8341 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8342 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8343 exotic syntax specifications may require further adaption
8344 (e.g. Cube/Cube.thy).
8346 * Removed obsolete type class "logic", use the top sort {} instead.
8347 Note that non-logical types should be declared as 'nonterminals'
8348 rather than 'types'. INCOMPATIBILITY for new object-logic
8351 * Attributes 'induct' and 'cases': type or set names may now be
8352 locally fixed variables as well.
8354 * Simplifier: can now control the depth to which conditional rewriting
8355 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8358 * Simplifier: simplification procedures may now take the current
8359 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8360 interface), which is very useful for calling the Simplifier
8361 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8362 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8363 low-level mk_simproc no longer applies Logic.varify internally, to
8364 allow for use in a context of fixed variables.
8366 * thin_tac now works even if the assumption being deleted contains !!
8367 or ==>. More generally, erule now works even if the major premise of
8368 the elimination rule contains !! or ==>.
8370 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8372 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8373 from Pure, which contains all common declarations already. Both
8374 theories are defined via plain Isabelle/Isar .thy files.
8375 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8376 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8377 use isatool fixcpure to adapt your theory and ML sources.
8379 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8380 selections of theorems in named facts via index ranges.
8382 * 'print_theorems': in theory mode, really print the difference
8383 wrt. the last state (works for interactive theory development only),
8384 in proof mode print all local facts (cf. 'print_facts');
8386 * 'hide': option '(open)' hides only base names.
8388 * More efficient treatment of intermediate checkpoints in interactive
8391 * Code generator is now invoked via code_module (incremental code
8392 generation) and code_library (modular code generation, ML structures
8393 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8394 must be quoted when used as identifiers.
8396 * New 'value' command for reading, evaluating and printing terms using
8397 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8398 quoted when used as identifier.
8403 * New commands for the interpretation of locale expressions in
8404 theories (1), locales (2) and proof contexts (3). These generate
8405 proof obligations from the expression specification. After the
8406 obligations have been discharged, theorems of the expression are added
8407 to the theory, target locale or proof context. The synopsis of the
8408 commands is a follows:
8410 (1) interpretation expr inst
8411 (2) interpretation target < expr
8412 (3) interpret expr inst
8414 Interpretation in theories and proof contexts require a parameter
8415 instantiation of terms from the current context. This is applied to
8416 specifications and theorems of the interpreted expression.
8417 Interpretation in locales only permits parameter renaming through the
8418 locale expression. Interpretation is smart in that interpretations
8419 that are active already do not occur in proof obligations, neither are
8420 instantiated theorems stored in duplicate. Use 'print_interps' to
8421 inspect active interpretations of a particular locale. For details,
8422 see the Isar Reference manual. Examples can be found in
8423 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8425 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8426 'interpret' instead.
8428 * New context element 'constrains' for adding type constraints to
8431 * Context expressions: renaming of parameters with syntax
8434 * Locale declaration: 'includes' disallowed.
8436 * Proper static binding of attribute syntax -- i.e. types / terms /
8437 facts mentioned as arguments are always those of the locale definition
8438 context, independently of the context of later invocations. Moreover,
8439 locale operations (renaming and type / term instantiation) are applied
8440 to attribute arguments as expected.
8442 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8443 actual attributes; rare situations may require Attrib.attribute to
8444 embed those attributes into Attrib.src that lack concrete syntax.
8445 Attribute implementations need to cooperate properly with the static
8446 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8447 Attrib.XXX_thm etc. already do the right thing without further
8448 intervention. Only unusual applications -- such as "where" or "of"
8449 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8450 on the context and the facts involved -- may have to assign parsed
8451 values to argument tokens explicitly.
8453 * Changed parameter management in theorem generation for long goal
8454 statements with 'includes'. INCOMPATIBILITY: produces a different
8455 theorem statement in rare situations.
8457 * Locale inspection command 'print_locale' omits notes elements. Use
8458 'print_locale!' to have them included in the output.
8463 * Provers/hypsubst.ML: improved version of the subst method, for
8464 single-step rewriting: it now works in bound variable contexts. New is
8465 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8466 rewrite a different subterm than the original subst method, which is
8467 still available as 'simplesubst'.
8469 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8472 * Provers/trancl.ML: new transitivity reasoner for transitive and
8473 reflexive-transitive closure of relations.
8475 * Provers/blast.ML: new reference depth_limit to make blast's depth
8476 limit (previously hard-coded with a value of 20) user-definable.
8478 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8479 is peformed already. Object-logics merely need to finish their
8480 initial simpset configuration as before. INCOMPATIBILITY.
8485 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8488 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8490 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8491 and x-symbol; use option '-m epsilon' to get it actually printed.
8492 Moreover, the mathematically important symbolic identifier \<epsilon>
8493 becomes available as variable, constant etc. INCOMPATIBILITY,
8495 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8496 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8497 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8498 support corresponding Isar calculations.
8500 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8503 * theory SetInterval: changed the syntax for open intervals:
8512 The old syntax is still supported but will disappear in the next
8513 release. For conversion use the following Emacs search and replace
8514 patterns (these are not perfect but work quite well):
8516 {)\([^\.]*\)\.\. -> {\1<\.\.}
8517 \.\.\([^(}]*\)(} -> \.\.<\1}
8519 * Theory Commutative_Ring (in Library): method comm_ring for proving
8520 equalities in commutative rings; method 'algebra' provides a generic
8523 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8524 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8525 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8528 Some new syntax forms are available:
8530 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8531 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8532 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8533 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8535 The latter form "\<Sum>x < k. e" used to be based on a separate
8536 function "Summation", which has been discontinued.
8538 * theory Finite_Set: in structured induction proofs, the insert case
8539 is now 'case (insert x F)' instead of the old counterintuitive 'case
8542 * The 'refute' command has been extended to support a much larger
8543 fragment of HOL, including axiomatic type classes, constdefs and
8544 typedefs, inductive datatypes and recursion.
8546 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8547 Requires zChaff with proof generation to be installed. See
8548 HOL/ex/SAT_Examples.thy for examples.
8550 * Datatype induction via method 'induct' now preserves the name of the
8551 induction variable. For example, when proving P(xs::'a list) by
8552 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8553 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8554 in unstructured proof scripts.
8556 * Reworked implementation of records. Improved scalability for
8557 records with many fields, avoiding performance problems for type
8558 inference. Records are no longer composed of nested field types, but
8559 of nested extension types. Therefore the record type only grows linear
8560 in the number of extensions and not in the number of fields. The
8561 top-level (users) view on records is preserved. Potential
8562 INCOMPATIBILITY only in strange cases, where the theory depends on the
8563 old record representation. The type generated for a record is called
8564 <record_name>_ext_type.
8566 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8567 proofs triggered by a record definition or a simproc (if
8568 quick_and_dirty is enabled). Definitions of large records can take
8571 New simproc record_upd_simproc for simplification of multiple record
8572 updates enabled by default. Moreover, trivial updates are also
8573 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8574 occasionally, since simplification is more powerful by default.
8576 * typedef: proper support for polymorphic sets, which contain extra
8577 type-variables in the term.
8579 * Simplifier: automatically reasons about transitivity chains
8580 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8581 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8582 old proofs break occasionally as simplification may now solve more
8583 goals than previously.
8585 * Simplifier: converts x <= y into x = y if assumption y <= x is
8586 present. Works for all partial orders (class "order"), in particular
8587 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8590 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8591 bound variable or a constant then the let is unfolded. Otherwise
8592 first a is simplified to b, and then f b is simplified to g. If
8593 possible we abstract b from g arriving at "let x = b in h x",
8594 otherwise we unfold the let and arrive at g. The simproc can be
8595 enabled/disabled by the reference use_let_simproc. Potential
8596 INCOMPATIBILITY since simplification is more powerful by default.
8598 * Classical reasoning: the meson method now accepts theorems as arguments.
8600 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8601 jobs to provide advice on the provability of subgoals.
8603 * Theory OrderedGroup and Ring_and_Field: various additions and
8604 improvements to faciliate calculations involving equalities and
8607 The following theorems have been eliminated or modified
8610 abs_eq now named abs_of_nonneg
8611 abs_of_ge_0 now named abs_of_nonneg
8612 abs_minus_eq now named abs_of_nonpos
8613 imp_abs_id now named abs_of_nonneg
8614 imp_abs_neg_id now named abs_of_nonpos
8615 mult_pos now named mult_pos_pos
8616 mult_pos_le now named mult_nonneg_nonneg
8617 mult_pos_neg_le now named mult_nonneg_nonpos
8618 mult_pos_neg2_le now named mult_nonneg_nonpos2
8619 mult_neg now named mult_neg_neg
8620 mult_neg_le now named mult_nonpos_nonpos
8622 * The following lemmas in Ring_and_Field have been added to the simplifier:
8625 not_square_less_zero
8627 The following lemmas have been deleted from Real/RealPow:
8637 * Theory Parity: added rules for simplifying exponents.
8641 The following theorems have been eliminated or modified
8644 list_all_Nil now named list_all.simps(1)
8645 list_all_Cons now named list_all.simps(2)
8646 list_all_conv now named list_all_iff
8647 set_mem_eq now named mem_iff
8649 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8650 asymptotic "big O" calculations. See the notes in BigO.thy.
8655 * Theory RealDef: better support for embedding natural numbers and
8656 integers in the reals.
8658 The following theorems have been eliminated or modified
8661 exp_ge_add_one_self now requires no hypotheses
8662 real_of_int_add reversed direction of equality (use [symmetric])
8663 real_of_int_minus reversed direction of equality (use [symmetric])
8664 real_of_int_diff reversed direction of equality (use [symmetric])
8665 real_of_int_mult reversed direction of equality (use [symmetric])
8667 * Theory RComplete: expanded support for floor and ceiling functions.
8669 * Theory Ln is new, with properties of the natural logarithm
8671 * Hyperreal: There is a new type constructor "star" for making
8672 nonstandard types. The old type names are now type synonyms:
8676 hcomplex = complex star
8678 * Hyperreal: Many groups of similarly-defined constants have been
8679 replaced by polymorphic versions (INCOMPATIBILITY):
8681 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8683 starset <-- starsetNat, starsetC
8684 *s* <-- *sNat*, *sc*
8685 starset_n <-- starsetNat_n, starsetC_n
8686 *sn* <-- *sNatn*, *scn*
8687 InternalSets <-- InternalNatSets, InternalCSets
8689 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8690 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8691 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8692 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8693 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8695 * Hyperreal: Many type-specific theorems have been removed in favor of
8696 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8698 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8699 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8700 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8701 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8702 right_minus <-- hypreal_add_minus
8703 left_minus <-- {hypreal,hcomplex}_add_minus_left
8704 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8705 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8706 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8707 mult_1_right <-- hcomplex_mult_one_right
8708 mult_zero_left <-- hcomplex_mult_zero_left
8709 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8710 right_distrib <-- hypnat_add_mult_distrib2
8711 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8712 right_inverse <-- hypreal_mult_inverse
8713 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8714 order_refl <-- {hypreal,hypnat}_le_refl
8715 order_trans <-- {hypreal,hypnat}_le_trans
8716 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8717 order_less_le <-- {hypreal,hypnat}_less_le
8718 linorder_linear <-- {hypreal,hypnat}_le_linear
8719 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8720 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8721 add_nonneg_nonneg <-- hypreal_le_add_order
8723 * Hyperreal: Separate theorems having to do with type-specific
8724 versions of constants have been merged into theorems that apply to the
8725 new polymorphic constants (INCOMPATIBILITY):
8727 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8728 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8729 STAR_Un <-- {STAR,NatStar,STARC}_Un
8730 STAR_Int <-- {STAR,NatStar,STARC}_Int
8731 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8732 STAR_subset <-- {STAR,NatStar,STARC}_subset
8733 STAR_mem <-- {STAR,NatStar,STARC}_mem
8734 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8735 STAR_diff <-- {STAR,STARC}_diff
8736 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8737 STARC_hcomplex_of_complex}_image_subset
8738 starset_n_Un <-- starset{Nat,C}_n_Un
8739 starset_n_Int <-- starset{Nat,C}_n_Int
8740 starset_n_Compl <-- starset{Nat,C}_n_Compl
8741 starset_n_diff <-- starset{Nat,C}_n_diff
8742 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8743 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8744 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8745 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8746 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8747 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8748 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8749 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8750 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8751 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8752 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8753 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8754 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8755 starfun_diff <-- starfun{C,RC,CR}_diff
8756 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8757 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8758 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8759 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8760 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8761 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8762 starfun_Id <-- starfunC_Id
8763 starfun_approx <-- starfun{Nat,CR}_approx
8764 starfun_capprox <-- starfun{C,RC}_capprox
8765 starfun_abs <-- starfunNat_rabs
8766 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8767 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8768 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8769 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8770 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8771 starfun_add_approx <-- starfunCR_add_approx
8772 starfun_inverse_inverse <-- starfunC_inverse_inverse
8773 starfun_divide <-- starfun{C,CR,RC}_divide
8774 starfun_n <-- starfun{Nat,C}_n
8775 starfun_n_mult <-- starfun{Nat,C}_n_mult
8776 starfun_n_add <-- starfun{Nat,C}_n_add
8777 starfun_n_add_minus <-- starfunNat_n_add_minus
8778 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8779 starfun_n_minus <-- starfun{Nat,C}_n_minus
8780 starfun_n_eq <-- starfun{Nat,C}_n_eq
8782 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8783 star_n_minus <-- {hypreal,hcomplex}_minus
8784 star_n_diff <-- {hypreal,hcomplex}_diff
8785 star_n_mult <-- {hypreal,hcomplex}_mult
8786 star_n_inverse <-- {hypreal,hcomplex}_inverse
8787 star_n_le <-- {hypreal,hypnat}_le
8788 star_n_less <-- {hypreal,hypnat}_less
8789 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8790 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8791 star_n_abs <-- hypreal_hrabs
8792 star_n_divide <-- hcomplex_divide
8794 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8795 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8796 star_of_diff <-- hypreal_of_real_diff
8797 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8798 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8799 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8800 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8801 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8802 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8803 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8804 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8805 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8806 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8807 star_of_number_of <-- {hypreal,hcomplex}_number_of
8808 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8809 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8810 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8811 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8812 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8813 star_of_power <-- hypreal_of_real_power
8814 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8816 * Hyperreal: new method "transfer" that implements the transfer
8817 principle of nonstandard analysis. With a subgoal that mentions
8818 nonstandard types like "'a star", the command "apply transfer"
8819 replaces it with an equivalent one that mentions only standard types.
8820 To be successful, all free variables must have standard types; non-
8821 standard variables must have explicit universal quantifiers.
8823 * Hyperreal: A theory of Taylor series.
8828 * Discontinued special version of 'constdefs' (which used to support
8829 continuous functions) in favor of the general Pure one with full
8832 * New simplification procedure for solving continuity conditions; it
8833 is much faster on terms with many nested lambda abstractions (cubic
8834 instead of exponential time).
8836 * New syntax for domain package: selector names are now optional.
8837 Parentheses should be omitted unless argument is lazy, for example:
8839 domain 'a stream = cons "'a" (lazy "'a stream")
8841 * New command 'fixrec' for defining recursive functions with pattern
8842 matching; defining multiple functions with mutual recursion is also
8843 supported. Patterns may include the constants cpair, spair, up, sinl,
8844 sinr, or any data constructor defined by the domain package. The given
8845 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8846 syntax and examples.
8848 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8849 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8850 but the proof obligation additionally includes an admissibility
8851 requirement. The packages generate instances of class cpo or pcpo,
8852 with continuity and strictness theorems for Rep and Abs.
8854 * HOLCF: Many theorems have been renamed according to a more standard naming
8855 scheme (INCOMPATIBILITY):
8857 foo_inject: "foo$x = foo$y ==> x = y"
8858 foo_eq: "(foo$x = foo$y) = (x = y)"
8859 foo_less: "(foo$x << foo$y) = (x << y)"
8860 foo_strict: "foo$UU = UU"
8861 foo_defined: "... ==> foo$x ~= UU"
8862 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8867 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8868 including the First Isomorphism Theorem (on quotienting by the kernel
8871 * ZF/Simplifier: install second copy of type solver that actually
8872 makes use of TC rules declared to Isar proof contexts (or locales);
8873 the old version is still required for ML proof scripts.
8878 * Converted to Isar theory format; use locales instead of axiomatic
8884 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8887 * Pure/library.ML no longer defines its own option datatype, but uses
8888 that of the SML basis, which has constructors NONE and SOME instead of
8889 None and Some, as well as exception Option.Option instead of OPTION.
8890 The functions the, if_none, is_some, is_none have been adapted
8891 accordingly, while Option.map replaces apsome.
8893 * Pure/library.ML: the exception LIST has been given up in favour of
8894 the standard exceptions Empty and Subscript, as well as
8895 Library.UnequalLengths. Function like Library.hd and Library.tl are
8896 superceded by the standard hd and tl functions etc.
8898 A number of basic list functions are no longer exported to the ML
8899 toplevel, as they are variants of predefined functions. The following
8900 suggests how one can translate existing code:
8902 rev_append xs ys = List.revAppend (xs, ys)
8903 nth_elem (i, xs) = List.nth (xs, i)
8904 last_elem xs = List.last xs
8905 flat xss = List.concat xss
8906 seq fs = List.app fs
8907 partition P xs = List.partition P xs
8908 mapfilter f xs = List.mapPartial f xs
8910 * Pure/library.ML: several combinators for linear functional
8911 transformations, notably reverse application and composition:
8914 (x, y) |-> f f #-> g
8916 * Pure/library.ML: introduced/changed precedence of infix operators:
8918 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8920 infix 3 o oo ooo oooo;
8921 infix 4 ~~ upto downto;
8923 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8926 * Pure/library.ML: natural list combinators fold, fold_rev, and
8927 fold_map support linear functional transformations and nesting. For
8930 fold f [x1, ..., xN] y =
8931 y |> f x1 |> ... |> f xN
8933 (fold o fold) f [xs1, ..., xsN] y =
8934 y |> fold f xs1 |> ... |> fold f xsN
8936 fold f [x1, ..., xN] =
8939 (fold o fold) f [xs1, ..., xsN] =
8940 fold f xs1 #> ... #> fold f xsN
8942 * Pure/library.ML: the following selectors on type 'a option are
8945 the: 'a option -> 'a (*partial*)
8946 these: 'a option -> 'a where 'a = 'b list
8947 the_default: 'a -> 'a option -> 'a
8948 the_list: 'a option -> 'a list
8950 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8951 basic operations for association lists, following natural argument
8952 order; moreover the explicit equality predicate passed here avoids
8953 potentially expensive polymorphic runtime equality checks.
8954 The old functions may be expressed as follows:
8956 assoc = uncurry (AList.lookup (op =))
8957 assocs = these oo AList.lookup (op =)
8958 overwrite = uncurry (AList.update (op =)) o swap
8960 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8962 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8963 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8965 replacing make_keylist and keyfilter (occassionally used)
8968 make_keylist = AList.make
8969 keyfilter = AList.find (op =)
8971 * eq_fst and eq_snd now take explicit equality parameter, thus
8972 avoiding eqtypes. Naive rewrites:
8974 eq_fst = eq_fst (op =)
8975 eq_snd = eq_snd (op =)
8977 * Removed deprecated apl and apr (rarely used).
8980 apl (n, op) =>>= curry op n
8981 apr (op, m) =>>= fn n => op (n, m)
8983 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8984 provides a reasonably efficient light-weight implementation of sets as
8987 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8988 few new operations; existing lookup and update are now curried to
8989 follow natural argument order (for use with fold etc.);
8990 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8992 * Pure/General: output via the Isabelle channels of
8993 writeln/warning/error etc. is now passed through Output.output, with a
8994 hook for arbitrary transformations depending on the print_mode
8995 (cf. Output.add_mode -- the first active mode that provides a output
8996 function wins). Already formatted output may be embedded into further
8997 text via Output.raw; the result of Pretty.string_of/str_of and derived
8998 functions (string_of_term/cterm/thm etc.) is already marked raw to
8999 accommodate easy composition of diagnostic messages etc. Programmers
9000 rarely need to care about Output.output or Output.raw at all, with
9001 some notable exceptions: Output.output is required when bypassing the
9002 standard channels (writeln etc.), or in token translations to produce
9003 properly formatted results; Output.raw is required when capturing
9004 already output material that will eventually be presented to the user
9005 a second time. For the default print mode, both Output.output and
9006 Output.raw have no effect.
9008 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9009 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9010 cumulative results are displayed at the end of a batch session.
9012 * Pure/General: File.sysify_path and File.quote_sysify path have been
9013 replaced by File.platform_path and File.shell_path (with appropriate
9014 hooks). This provides a clean interface for unusual systems where the
9015 internal and external process view of file names are different.
9017 * Pure: more efficient orders for basic syntactic entities: added
9018 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9019 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9020 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9021 orders now -- potential INCOMPATIBILITY for code that depends on a
9022 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9023 Library.sort_strings on result).
9025 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9026 fold_types traverse types/terms from left to right, observing natural
9027 argument order. Supercedes previous foldl_XXX versions, add_frees,
9028 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9030 * Pure: name spaces have been refined, with significant changes of the
9031 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9032 to extern(_table). The plain name entry path is superceded by a
9033 general 'naming' context, which also includes the 'policy' to produce
9034 a fully qualified name and external accesses of a fully qualified
9035 name; NameSpace.extend is superceded by context dependent
9036 Sign.declare_name. Several theory and proof context operations modify
9037 the naming context. Especially note Theory.restore_naming and
9038 ProofContext.restore_naming to get back to a sane state; note that
9039 Theory.add_path is no longer sufficient to recover from
9040 Theory.absolute_path in particular.
9042 * Pure: new flags short_names (default false) and unique_names
9043 (default true) for controlling output of qualified names. If
9044 short_names is set, names are printed unqualified. If unique_names is
9045 reset, the name prefix is reduced to the minimum required to achieve
9046 the original result when interning again, even if there is an overlap
9047 with earlier declarations.
9049 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9050 now 'extend', and 'merge' gets an additional Pretty.pp argument
9051 (useful for printing error messages). INCOMPATIBILITY.
9053 * Pure: major reorganization of the theory context. Type Sign.sg and
9054 Theory.theory are now identified, referring to the universal
9055 Context.theory (see Pure/context.ML). Actual signature and theory
9056 content is managed as theory data. The old code and interfaces were
9057 spread over many files and structures; the new arrangement introduces
9058 considerable INCOMPATIBILITY to gain more clarity:
9060 Context -- theory management operations (name, identity, inclusion,
9061 parents, ancestors, merge, etc.), plus generic theory data;
9063 Sign -- logical signature and syntax operations (declaring consts,
9064 types, etc.), plus certify/read for common entities;
9066 Theory -- logical theory operations (stating axioms, definitions,
9067 oracles), plus a copy of logical signature operations (consts,
9068 types, etc.); also a few basic management operations (Theory.copy,
9071 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9072 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9073 for convenience -- they merely return the theory.
9075 * Pure: type Type.tsig is superceded by theory in most interfaces.
9077 * Pure: the Isar proof context type is already defined early in Pure
9078 as Context.proof (note that ProofContext.context and Proof.context are
9079 aliases, where the latter is the preferred name). This enables other
9080 Isabelle components to refer to that type even before Isar is present.
9082 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9083 typeK, constK, axiomK, oracleK), but provide explicit operations for
9084 any of these kinds. For example, Sign.intern typeK is now
9085 Sign.intern_type, Theory.hide_space Sign.typeK is now
9086 Theory.hide_types. Also note that former
9087 Theory.hide_classes/types/consts are now
9088 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9089 internalize their arguments! INCOMPATIBILITY.
9091 * Pure: get_thm interface (of PureThy and ProofContext) expects
9092 datatype thmref (with constructors Name and NameSelection) instead of
9093 plain string -- INCOMPATIBILITY;
9095 * Pure: cases produced by proof methods specify options, where NONE
9096 means to remove case bindings -- INCOMPATIBILITY in
9099 * Pure: the following operations retrieve axioms or theorems from a
9100 theory node or theory hierarchy, respectively:
9102 Theory.axioms_of: theory -> (string * term) list
9103 Theory.all_axioms_of: theory -> (string * term) list
9104 PureThy.thms_of: theory -> (string * thm) list
9105 PureThy.all_thms_of: theory -> (string * thm) list
9107 * Pure: print_tac now outputs the goal through the trace channel.
9109 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9110 Reference Toplevel.debug (default false) controls detailed printing
9111 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9112 controls execution profiling -- set to 1 for time and 2 for space
9113 (both increase the runtime).
9115 * Isar session: The initial use of ROOT.ML is now always timed,
9116 i.e. the log will show the actual process times, in contrast to the
9117 elapsed wall-clock time that the outer shell wrapper produces.
9119 * Simplifier: improved handling of bound variables (nameless
9120 representation, avoid allocating new strings). Simprocs that invoke
9121 the Simplifier recursively should use Simplifier.inherit_bounds to
9122 avoid local name clashes. Failure to do so produces warnings
9123 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9124 for further details.
9126 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9127 bindings for all theorems stored within a given theory; this may help
9128 in porting non-Isar theories to Isar ones, while keeping ML proof
9129 scripts for the time being.
9131 * ML operator HTML.with_charset specifies the charset begin used for
9132 generated HTML files. For example:
9134 HTML.with_charset "utf-8" use_thy "Hebrew";
9135 HTML.with_charset "utf-8" use_thy "Chinese";
9140 * Allow symlinks to all proper Isabelle executables (Isabelle,
9141 isabelle, isatool etc.).
9143 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9144 isatool doc, isatool mkdir, display_drafts etc.).
9146 * isatool usedir: option -f allows specification of the ML file to be
9147 used by Isabelle; default is ROOT.ML.
9149 * New isatool version outputs the version identifier of the Isabelle
9150 distribution being used.
9152 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9153 (containing Boolean satisfiability problems) into Isabelle/HOL
9158 New in Isabelle2004 (April 2004)
9159 --------------------------------
9163 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9164 Replaces linorder.ML.
9166 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9167 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9168 (\<a>...\<z>), are now considered normal letters, and can therefore
9169 be used anywhere where an ASCII letter (a...zA...Z) has until
9170 now. COMPATIBILITY: This obviously changes the parsing of some
9171 terms, especially where a symbol has been used as a binder, say
9172 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9173 as an identifier. Fix it by inserting a space around former
9174 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9175 existing theory and ML files.
9177 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9179 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9180 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9181 a normal (but invisible) letter. For multiple letter subscripts repeat
9182 \<^isub> like this: x\<^isub>1\<^isub>2.
9184 * Pure: There are now sub-/superscripts that can span more than one
9185 character. Text between \<^bsub> and \<^esub> is set in subscript in
9186 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9187 superscript. The new control characters are not identifier parts.
9189 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9190 content of "..." to the latex file instead of \isacntrl... . The "..."
9191 may consist of any printable characters excluding the end bracket >.
9193 * Pure: Using new Isar command "finalconsts" (or the ML functions
9194 Theory.add_finals or Theory.add_finals_i) it is now possible to
9195 declare constants "final", which prevents their being given a definition
9196 later. It is useful for constants whose behaviour is fixed axiomatically
9197 rather than definitionally, such as the meta-logic connectives.
9199 * Pure: 'instance' now handles general arities with general sorts
9200 (i.e. intersections of classes),
9202 * Presentation: generated HTML now uses a CSS style sheet to make layout
9203 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9204 It can be changed to alter the colors/layout of generated pages.
9209 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9210 cut_tac, subgoal_tac and thin_tac:
9211 - Now understand static (Isar) contexts. As a consequence, users of Isar
9212 locales are no longer forced to write Isar proof scripts.
9213 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9215 - INCOMPATIBILITY: names of variables to be instantiated may no
9216 longer be enclosed in quotes. Instead, precede variable name with `?'.
9217 This is consistent with the instantiation attribute "where".
9219 * Attributes "where" and "of":
9220 - Now take type variables of instantiated theorem into account when reading
9221 the instantiation string. This fixes a bug that caused instantiated
9222 theorems to have too special types in some circumstances.
9223 - "where" permits explicit instantiations of type variables.
9225 * Calculation commands "moreover" and "also" no longer interfere with
9226 current facts ("this"), admitting arbitrary combinations with "then"
9230 - Goal statements involving the context element "includes" no longer
9231 generate theorems with internal delta predicates (those ending on
9232 "_axioms") in the premise.
9233 Resolve particular premise with <locale>.intro to obtain old form.
9234 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9235 specification and "includes" elements in goal statement.
9236 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9237 [intro?] and [elim?] (respectively) by default.
9238 - Experimental command for instantiation of locales in proof contexts:
9239 instantiate <label>[<attrs>]: <loc>
9240 Instantiates locale <loc> and adds all its theorems to the current context
9241 taking into account their attributes. Label and attrs are optional
9242 modifiers, like in theorem declarations. If present, names of
9243 instantiated theorems are qualified with <label>, and the attributes
9244 <attrs> are applied after any attributes these theorems might have already.
9245 If the locale has assumptions, a chained fact of the form
9246 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9247 are derived. The command does not support old-style locales declared
9248 with "locale (open)".
9249 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9251 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9257 * Proof import: new image HOL4 contains the imported library from
9258 the HOL4 system with about 2500 theorems. It is imported by
9259 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9260 can be used like any other Isabelle image. See
9261 HOL/Import/HOL/README for more information.
9264 - Much improved handling of linear and partial orders.
9265 Reasoners for linear and partial orders are set up for type classes
9266 "linorder" and "order" respectively, and are added to the default simpset
9267 as solvers. This means that the simplifier can build transitivity chains
9268 to solve goals from the assumptions.
9269 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9270 of blast or auto after simplification become unnecessary because the goal
9271 is solved by simplification already.
9273 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9274 all proved in axiomatic type classes for semirings, rings and fields.
9277 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9278 now formalized using the Ring_and_Field theory mentioned above.
9279 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9280 than before, because now they are set up once in a generic manner.
9281 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9282 Look for the general versions in Ring_and_Field (and Power if they concern
9285 * Type "rat" of the rational numbers is now available in HOL-Complex.
9288 - Record types are now by default printed with their type abbreviation
9289 instead of the list of all field types. This can be configured via
9290 the reference "print_record_type_abbr".
9291 - Simproc "record_upd_simproc" for simplification of multiple updates added
9292 (not enabled by default).
9293 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9294 EX x. x = sel r to True (not enabled by default).
9295 - Tactic "record_split_simp_tac" to split and simplify records added.
9297 * 'specification' command added, allowing for definition by
9298 specification. There is also an 'ax_specification' command that
9299 introduces the new constants axiomatically.
9301 * arith(_tac) is now able to generate counterexamples for reals as well.
9303 * HOL-Algebra: new locale "ring" for non-commutative rings.
9305 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9306 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9308 * HOL-Matrix: a first theory for matrices in HOL with an application of
9309 matrix theory to linear programming.
9311 * Unions and Intersections:
9312 The latex output syntax of UN and INT has been changed
9313 from "\Union x \in A. B" to "\Union_{x \in A} B"
9314 i.e. the index formulae has become a subscript.
9315 Similarly for "\Union x. B", and for \Inter instead of \Union.
9317 * Unions and Intersections over Intervals:
9318 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9319 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9320 like in normal math, and corresponding versions for < and for intersection.
9322 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9323 lexicographic dictonary ordering has been added as "lexord".
9325 * ML: the legacy theory structures Int and List have been removed. They had
9326 conflicted with ML Basis Library structures having the same names.
9328 * 'refute' command added to search for (finite) countermodels. Only works
9329 for a fragment of HOL. The installation of an external SAT solver is
9330 highly recommended. See "HOL/Refute.thy" for details.
9332 * 'quickcheck' command: Allows to find counterexamples by evaluating
9333 formulae under an assignment of free variables to random values.
9334 In contrast to 'refute', it can deal with inductive datatypes,
9335 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9341 * Streams now come with concatenation and are part of the HOLCF image
9345 New in Isabelle2003 (May 2003)
9346 ------------------------------
9350 * Provers/simplifier:
9352 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9353 Assumptions are now subject to complete mutual simplification,
9354 not just from left to right. The simplifier now preserves
9355 the order of assumptions.
9357 Potential INCOMPATIBILITY:
9359 -- simp sometimes diverges where the old version did
9360 not, e.g. invoking simp on the goal
9362 [| P (f x); y = x; f x = f y |] ==> Q
9364 now gives rise to the infinite reduction sequence
9366 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9368 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9371 -- Tactics combining classical reasoner and simplification (such as auto)
9372 are also affected by this change, because many of them rely on
9373 simp. They may sometimes diverge as well or yield a different numbers
9374 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9375 in case of problems. Sometimes subsequent calls to the classical
9376 reasoner will fail because a preceeding call to the simplifier too
9377 eagerly simplified the goal, e.g. deleted redundant premises.
9379 - The simplifier trace now shows the names of the applied rewrite rules
9381 - You can limit the number of recursive invocations of the simplifier
9382 during conditional rewriting (where the simplifie tries to solve the
9383 conditions before applying the rewrite rule):
9384 ML "simp_depth_limit := n"
9385 where n is an integer. Thus you can force termination where previously
9386 the simplifier would diverge.
9388 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9390 - No longer aborts on failed congruence proof. Instead, the
9391 congruence is ignored.
9393 * Pure: New generic framework for extracting programs from constructive
9394 proofs. See HOL/Extraction.thy for an example instantiation, as well
9395 as HOL/Extraction for some case studies.
9397 * Pure: The main goal of the proof state is no longer shown by default, only
9398 the subgoals. This behaviour is controlled by a new flag.
9399 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9400 (ML: Proof.show_main_goal).
9402 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9403 rules whose conclusion matches subgoal 1:
9404 PG menu: Isabelle/Isar -> Show me -> matching rules
9405 The rules are ordered by how closely they match the subgoal.
9406 In particular, rules that solve a subgoal outright are displayed first
9407 (or rather last, the way they are printed).
9408 (ML: ProofGeneral.print_intros())
9410 * Pure: New flag trace_unify_fail causes unification to print
9411 diagnostic information (PG: in trace buffer) when it fails. This is
9412 useful for figuring out why single step proofs like rule, erule or
9415 * Pure: Locale specifications now produce predicate definitions
9416 according to the body of text (covering assumptions modulo local
9417 definitions); predicate "loc_axioms" covers newly introduced text,
9418 while "loc" is cumulative wrt. all included locale expressions; the
9419 latter view is presented only on export into the global theory
9420 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9421 on the old view without predicates;
9423 * Pure: predefined locales "var" and "struct" are useful for sharing
9424 parameters (as in CASL, for example); just specify something like
9425 ``var x + var y + struct M'' as import;
9427 * Pure: improved thms_containing: proper indexing of facts instead of
9428 raw theorems; check validity of results wrt. current name space;
9429 include local facts of proof configuration (also covers active
9430 locales), cover fixed variables in index; may use "_" in term
9431 specification; an optional limit for the number of printed facts may
9432 be given (the default is 40);
9434 * Pure: disallow duplicate fact bindings within new-style theory files
9437 * Provers: improved induct method: assumptions introduced by case
9438 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9439 the goal statement); "foo" still refers to all facts collectively;
9441 * Provers: the function blast.overloaded has been removed: all constants
9442 are regarded as potentially overloaded, which improves robustness in exchange
9443 for slight decrease in efficiency;
9445 * Provers/linorder: New generic prover for transitivity reasoning over
9446 linear orders. Note: this prover is not efficient!
9448 * Isar: preview of problems to finish 'show' now produce an error
9449 rather than just a warning (in interactive mode);
9456 - Produces a counter example if it cannot prove a goal.
9457 Note that the counter example may be spurious if the goal is not a formula
9458 of quantifier-free linear arithmetic.
9459 In ProofGeneral the counter example appears in the trace buffer.
9461 - Knows about div k and mod k where k is a numeral of type nat or int.
9463 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9464 linear arithmetic fails. This takes account of quantifiers and divisibility.
9465 Presburger arithmetic can also be called explicitly via presburger(_tac).
9467 * simp's arithmetic capabilities have been enhanced a bit: it now
9468 takes ~= in premises into account (by performing a case split);
9470 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9471 are distributed over a sum of terms;
9473 * New tactic "trans_tac" and method "trans" instantiate
9474 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9477 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9478 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9480 * 'typedef' command has new option "open" to suppress the set
9483 * functions Min and Max on finite sets have been introduced (theory
9486 * attribute [symmetric] now works for relations as well; it turns
9487 (x,y) : R^-1 into (y,x) : R, and vice versa;
9489 * induct over a !!-quantified statement (say !!x1..xn):
9490 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9492 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9493 %x. None. Warning: empty_def now refers to the previously hidden definition
9496 * Algebra: formalization of classical algebra. Intended as base for
9497 any algebraic development in Isabelle. Currently covers group theory
9498 (up to Sylow's theorem) and ring theory (Universal Property of
9499 Univariate Polynomials). Contributions welcome;
9501 * GroupTheory: deleted, since its material has been moved to Algebra;
9503 * Complex: new directory of the complex numbers with numeric constants,
9504 nonstandard complex numbers, and some complex analysis, standard and
9505 nonstandard (Jacques Fleuriot);
9507 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9509 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9512 * Real/HahnBanach: updated and adapted to locales;
9514 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9517 * UNITY: added the Meier-Sanders theory of progress sets;
9519 * MicroJava: bytecode verifier and lightweight bytecode verifier
9520 as abstract algorithms, instantiated to the JVM;
9522 * Bali: Java source language formalization. Type system, operational
9523 semantics, axiomatic semantics. Supported language features:
9524 classes, interfaces, objects,virtual methods, static methods,
9525 static/instance fields, arrays, access modifiers, definite
9526 assignment, exceptions.
9531 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9534 * Main ZF: virtually all theories converted to new-style format;
9539 * Pure: Tactic.prove provides sane interface for internal proofs;
9540 omits the infamous "standard" operation, so this is more appropriate
9541 than prove_goalw_cterm in many situations (e.g. in simprocs);
9543 * Pure: improved error reporting of simprocs;
9545 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9549 *** Document preparation ***
9551 * uses \par instead of \\ for line breaks in theory text. This may
9552 shift some page breaks in large documents. To get the old behaviour
9553 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9555 * minimized dependencies of isabelle.sty and isabellesym.sty on
9558 * \<euro> now needs package babel/greek instead of marvosym (which
9561 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9566 New in Isabelle2002 (March 2002)
9567 --------------------------------
9569 *** Document preparation ***
9571 * greatly simplified document preparation setup, including more
9572 graceful interpretation of isatool usedir -i/-d/-D options, and more
9573 instructive isatool mkdir; users should basically be able to get
9574 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9575 users may run a separate document processing stage manually like this:
9576 "isatool usedir -D output HOL Test && isatool document Test/output";
9578 * theory dependency graph may now be incorporated into documents;
9579 isatool usedir -g true will produce session_graph.eps/.pdf for use
9580 with \includegraphics of LaTeX;
9582 * proper spacing of consecutive markup elements, especially text
9583 blocks after section headings;
9585 * support bold style (for single symbols only), input syntax is like
9586 this: "\<^bold>\<alpha>" or "\<^bold>A";
9588 * \<bullet> is now output as bold \cdot by default, which looks much
9589 better in printed text;
9591 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9592 note that these symbols are currently unavailable in Proof General /
9593 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9595 * isatool latex no longer depends on changed TEXINPUTS, instead
9596 isatool document copies the Isabelle style files to the target
9602 * Pure/Provers: improved proof by cases and induction;
9603 - 'case' command admits impromptu naming of parameters (such as
9605 - 'induct' method divinates rule instantiation from the inductive
9606 claim; no longer requires excessive ?P bindings for proper
9607 instantiation of cases;
9608 - 'induct' method properly enumerates all possibilities of set/type
9609 rules; as a consequence facts may be also passed through *type*
9610 rules without further ado;
9611 - 'induct' method now derives symbolic cases from the *rulified*
9612 rule (before it used to rulify cases stemming from the internal
9613 atomized version); this means that the context of a non-atomic
9614 statement becomes is included in the hypothesis, avoiding the
9615 slightly cumbersome show "PROP ?case" form;
9616 - 'induct' may now use elim-style induction rules without chaining
9617 facts, using ``missing'' premises from the goal state; this allows
9618 rules stemming from inductive sets to be applied in unstructured
9619 scripts, while still benefitting from proper handling of non-atomic
9620 statements; NB: major inductive premises need to be put first, all
9621 the rest of the goal is passed through the induction;
9622 - 'induct' proper support for mutual induction involving non-atomic
9623 rule statements (uses the new concept of simultaneous goals, see
9625 - append all possible rule selections, but only use the first
9626 success (no backtracking);
9627 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9628 - undeclared rule case names default to numbers 1, 2, 3, ...;
9629 - added 'print_induct_rules' (covered by help item in recent Proof
9631 - moved induct/cases attributes to Pure, methods to Provers;
9632 - generic method setup instantiated for FOL and HOL;
9634 * Pure: support multiple simultaneous goal statements, for example
9635 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9636 meta-level mechanism, this acts as if several individual goals had
9637 been stated separately; in particular common proof methods need to be
9638 repeated in order to cover all claims; note that a single elimination
9639 step is *not* sufficient to establish the two conjunctions, so this
9642 assume "A & B" then have A and B .. (*".." fails*)
9644 better use "obtain" in situations as above; alternative refer to
9645 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9647 * Pure: proper integration with ``locales''; unlike the original
9648 version by Florian Kammller, Isar locales package high-level proof
9649 contexts rather than raw logical ones (e.g. we admit to include
9650 attributes everywhere); operations on locales include merge and
9651 rename; support for implicit arguments (``structures''); simultaneous
9652 type-inference over imports and text; see also HOL/ex/Locales.thy for
9655 * Pure: the following commands have been ``localized'', supporting a
9656 target locale specification "(in name)": 'lemma', 'theorem',
9657 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9658 stored both within the locale and at the theory level (exported and
9659 qualified by the locale name);
9661 * Pure: theory goals may now be specified in ``long'' form, with
9662 ad-hoc contexts consisting of arbitrary locale elements. for example
9663 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9664 definitions may be given, too); the result is a meta-level rule with
9665 the context elements being discharged in the obvious way;
9667 * Pure: new proof command 'using' allows to augment currently used
9668 facts after a goal statement ('using' is syntactically analogous to
9669 'apply', but acts on the goal's facts only); this allows chained facts
9670 to be separated into parts given before and after a claim, as in
9671 ``from a and b have C using d and e <proof>'';
9673 * Pure: renamed "antecedent" case to "rule_context";
9675 * Pure: new 'judgment' command records explicit information about the
9676 object-logic embedding (used by several tools internally); no longer
9677 use hard-wired "Trueprop";
9679 * Pure: added 'corollary' command;
9681 * Pure: fixed 'token_translation' command;
9683 * Pure: removed obsolete 'exported' attribute;
9685 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9686 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9687 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9689 * Pure: method 'atomize' presents local goal premises as object-level
9690 statements (atomic meta-level propositions); setup controlled via
9691 rewrite rules declarations of 'atomize' attribute; example
9692 application: 'induct' method with proper rule statements in improper
9695 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9696 now consider the syntactic context of assumptions, giving a better
9697 chance to get type-inference of the arguments right (this is
9698 especially important for locales);
9700 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9703 * Pure/obtain: the formal conclusion "thesis", being marked as
9704 ``internal'', may no longer be reference directly in the text;
9705 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9708 * Pure: generic 'sym' attribute which declares a rule both as pure
9709 'elim?' and for the 'symmetric' operation;
9711 * Pure: marginal comments ``--'' may now occur just anywhere in the
9712 text; the fixed correlation with particular command syntax has been
9715 * Pure: new method 'rules' is particularly well-suited for proof
9716 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9717 but often produces more compact proof terms with less detours;
9719 * Pure/Provers/classical: simplified integration with pure rule
9720 attributes and methods; the classical "intro?/elim?/dest?"
9721 declarations coincide with the pure ones; the "rule" method no longer
9722 includes classically swapped intros; "intro" and "elim" methods no
9723 longer pick rules from the context; also got rid of ML declarations
9724 AddXIs/AddXEs/AddXDs; all of this has some potential for
9727 * Provers/classical: attribute 'swapped' produces classical inversions
9728 of introduction rules;
9730 * Provers/simplifier: 'simplified' attribute may refer to explicit
9731 rules instead of full simplifier context; 'iff' attribute handles
9734 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9736 * HOL: 'recdef' now fails on unfinished automated proofs, use
9737 "(permissive)" option to recover old behavior;
9739 * HOL: 'inductive' no longer features separate (collective) attributes
9740 for 'intros' (was found too confusing);
9742 * HOL: properly declared induction rules less_induct and
9748 * HOL: moved over to sane numeral syntax; the new policy is as
9751 - 0 and 1 are polymorphic constants, which are defined on any
9752 numeric type (nat, int, real etc.);
9754 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9755 binary representation internally;
9757 - type nat has special constructor Suc, and generally prefers Suc 0
9758 over 1::nat and Suc (Suc 0) over 2::nat;
9760 This change may cause significant problems of INCOMPATIBILITY; here
9761 are some hints on converting existing sources:
9763 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9764 entities, so expressions involving "-" (unary or binary minus) need
9765 to be spaced properly;
9767 - existing occurrences of "1" may need to be constraint "1::nat" or
9768 even replaced by Suc 0; similar for old "2";
9770 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9772 - remove all special provisions on numerals in proofs;
9774 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9775 representation (depends on bin_arith_simps in the default context);
9777 * HOL: symbolic syntax for x^2 (numeral 2);
9779 * HOL: the class of all HOL types is now called "type" rather than
9780 "term"; INCOMPATIBILITY, need to adapt references to this type class
9781 in axclass/classes, instance/arities, and (usually rare) occurrences
9782 in typings (of consts etc.); internally the class is called
9783 "HOL.type", ML programs should refer to HOLogic.typeS;
9785 * HOL/record package improvements:
9786 - new derived operations "fields" to build a partial record section,
9787 "extend" to promote a fixed record to a record scheme, and
9788 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9789 declared as simp by default;
9790 - shared operations ("more", "fields", etc.) now need to be always
9791 qualified) --- potential INCOMPATIBILITY;
9792 - removed "make_scheme" operations (use "make" with "extend") --
9794 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9795 - provides cases/induct rules for use with corresponding Isar
9796 methods (for concrete records, record schemes, concrete more
9797 parts, and schematic more parts -- in that order);
9798 - internal definitions directly based on a light-weight abstract
9799 theory of product types over typedef rather than datatype;
9801 * HOL: generic code generator for generating executable ML code from
9802 specifications; specific support for HOL constructs such as inductive
9803 datatypes and sets, as well as recursive functions; can be invoked
9804 via 'generate_code' theory section;
9806 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9808 * HOL: consolidated and renamed several theories. In particular:
9809 Ord.thy has been absorbed into HOL.thy
9810 String.thy has been absorbed into List.thy
9812 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9813 (beware of argument permutation!);
9815 * HOL: linorder_less_split superseded by linorder_cases;
9817 * HOL/List: "nodups" renamed to "distinct";
9819 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9820 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9821 - Ex_def has changed, now need to use some_eq_ex
9823 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9824 in this (rare) case use:
9826 delSWrapper "split_all_tac"
9827 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9829 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9832 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9833 Isabelle's type classes, ^ on functions and relations has too general
9834 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9835 necessary to attach explicit type constraints;
9837 * HOL/Relation: the prefix name of the infix "O" has been changed from
9838 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9839 renamed accordingly (eg "compI" -> "rel_compI").
9841 * HOL: syntax translations now work properly with numerals and records
9844 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9845 of "lam" -- INCOMPATIBILITY;
9847 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9848 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9849 renamed "Product_Type.unit";
9851 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9853 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9854 the "cases" method);
9856 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9859 * HOL/IMP: updated and converted to new-style theory format; several
9860 parts turned into readable document, with proper Isar proof texts and
9861 some explanations (by Gerwin Klein);
9863 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9865 * HOL-Hyperreal is now a logic image;
9870 * Isar: consts/constdefs supports mixfix syntax for continuous
9873 * Isar: domain package adapted to new-style theory format, e.g. see
9876 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9877 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9878 lift.induct_tac, always use UU instead of Undef;
9880 * HOLCF/IMP: updated and converted to new-style theory;
9885 * Isar: proper integration of logic-specific tools and packages,
9886 including theory commands '(co)inductive', '(co)datatype',
9887 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9888 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9890 * theory Main no longer includes AC; for the Axiom of Choice, base
9891 your theory on Main_ZFC;
9893 * the integer library now covers quotients and remainders, with many
9894 laws relating division to addition, multiplication, etc.;
9896 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9897 typeless version of the formalism;
9899 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9902 * ZF/Induct: new directory for examples of inductive definitions,
9903 including theory Multiset for multiset orderings; converted to
9904 new-style theory format;
9906 * ZF: many new theorems about lists, ordinals, etc.;
9911 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9912 variable proof controls level of detail: 0 = no proofs (only oracle
9913 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9914 also ref manual for further ML interfaces;
9916 * Pure/axclass: removed obsolete ML interface
9917 goal_subclass/goal_arity;
9919 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9920 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9921 separate tokens, so expressions involving minus need to be spaced
9924 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9925 rather than "infixl" or "infixr";
9927 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9928 sort constraint specifications in type inference; e.g. "x::_::foo"
9929 ensures that the type of "x" is of sort "foo" (but not necessarily a
9932 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9933 control output of nested => (types); the default behavior is
9936 * Pure/syntax: builtin parse translation for "_constify" turns valued
9937 tokens into AST constants;
9939 * Pure/syntax: prefer later declarations of translations and print
9940 translation functions; potential INCOMPATIBILITY: need to reverse
9941 multiple declarations for same syntax element constant;
9943 * Pure/show_hyps reset by default (in accordance to existing Isar
9946 * Provers/classical: renamed addaltern to addafter, addSaltern to
9949 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9952 * system: tested support for MacOS X; should be able to get Isabelle +
9953 Proof General to work in a plain Terminal after installing Poly/ML
9954 (e.g. from the Isabelle distribution area) and GNU bash alone
9955 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9956 support requires further installations, e.g. from
9957 http://fink.sourceforge.net/);
9959 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9961 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9962 of 40 MB), cf. ML_OPTIONS;
9964 * system: Proof General keywords specification is now part of the
9965 Isabelle distribution (see etc/isar-keywords.el);
9967 * system: support for persistent Proof General sessions (refrain from
9968 outdating all loaded theories on startup); user may create writable
9969 logic images like this: ``isabelle -q HOL Test'';
9971 * system: smart selection of Isabelle process versus Isabelle
9972 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9973 run both "isabelle" and "Isabelle" even if file names are badly
9974 damaged (executable inspects the case of the first letter of its own
9975 name); added separate "isabelle-process" and "isabelle-interface";
9977 * system: refrain from any attempt at filtering input streams; no
9978 longer support ``8bit'' encoding of old isabelle font, instead proper
9979 iso-latin characters may now be used; the related isatools
9980 "symbolinput" and "nonascii" have disappeared as well;
9982 * system: removed old "xterm" interface (the print modes "xterm" and
9983 "xterm_color" are still available for direct use in a suitable
9988 New in Isabelle99-2 (February 2001)
9989 -----------------------------------
9991 *** Overview of INCOMPATIBILITIES ***
9993 * HOL: please note that theories in the Library and elsewhere often use the
9994 new-style (Isar) format; to refer to their theorems in an ML script you must
9995 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9997 * HOL: inductive package no longer splits induction rule aggressively,
9998 but only as far as specified by the introductions given; the old
9999 format may be recovered via ML function complete_split_rule or attribute
10000 'split_rule (complete)';
10002 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10003 gfp_Tarski to gfp_unfold;
10005 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10007 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10008 relation); infix "^^" has been renamed "``"; infix "``" has been
10009 renamed "`"; "univalent" has been renamed "single_valued";
10011 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10014 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10016 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10018 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10019 consequence, it is no longer monotonic wrt. the local goal context
10020 (which is now passed through the inductive cases);
10022 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10023 \<gg> to \<ggreater>;
10026 *** Document preparation ***
10028 * \isabellestyle{NAME} selects version of Isabelle output (currently
10029 available: are "it" for near math-mode best-style output, "sl" for
10030 slanted text style, and "tt" for plain type-writer; if no
10031 \isabellestyle command is given, output is according to slanted
10034 * support sub/super scripts (for single symbols only), input syntax is
10035 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10037 * some more standard symbols; see Appendix A of the system manual for
10038 the complete list of symbols defined in isabellesym.sty;
10040 * improved isabelle style files; more abstract symbol implementation
10041 (should now use \isamath{...} and \isatext{...} in custom symbol
10044 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10045 state; Note that presentation of goal states does not conform to
10046 actual human-readable proof documents. Please do not include goal
10047 states into document output unless you really know what you are doing!
10049 * proper indentation of antiquoted output with proportional LaTeX
10052 * no_document ML operator temporarily disables LaTeX document
10055 * isatool unsymbolize tunes sources for plain ASCII communication;
10060 * Pure: Isar now suffers initial goal statements to contain unbound
10061 schematic variables (this does not conform to actual readable proof
10062 documents, due to unpredictable outcome and non-compositional proof
10063 checking); users who know what they are doing may use schematic goals
10064 for Prolog-style synthesis of proven results;
10066 * Pure: assumption method (an implicit finishing) now handles actual
10069 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10070 initial goal, declare "that" only as Pure intro (only for single
10071 steps); the "that" rule assumption may now be involved in implicit
10072 finishing, thus ".." becomes a feasible for trivial obtains;
10074 * Pure: default proof step now includes 'intro_classes'; thus trivial
10075 instance proofs may be performed by "..";
10077 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10078 statements as well;
10080 * Pure: more robust selection of calculational rules;
10082 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10083 rule (as well as the assumption rule);
10085 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10086 lemmas, using the graph browser tool;
10088 * Pure: predict failure of "show" in interactive mode;
10090 * Pure: 'thms_containing' now takes actual terms as arguments;
10092 * HOL: improved method 'induct' --- now handles non-atomic goals
10093 (potential INCOMPATIBILITY); tuned error handling;
10095 * HOL: cases and induct rules now provide explicit hints about the
10096 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10097 any remaining facts are inserted into the goal verbatim;
10099 * HOL: local contexts (aka cases) may now contain term bindings as
10100 well; the 'cases' and 'induct' methods new provide a ?case binding for
10101 the result to be shown in each case;
10103 * HOL: added 'recdef_tc' command;
10105 * isatool convert assists in eliminating legacy ML scripts;
10110 * HOL/Library: a collection of generic theories to be used together
10111 with main HOL; the theory loader path already includes this directory
10112 by default; the following existing theories have been moved here:
10113 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10114 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10116 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10117 modelling and verification task performed in Isabelle/HOL +
10118 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10120 * HOL/Algebra: special summation operator SUM no longer exists, it has
10121 been replaced by setsum; infix 'assoc' now has priority 50 (like
10122 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10123 'domain', this makes the theory consistent with mathematical
10126 * HOL basics: added overloaded operations "inverse" and "divide"
10127 (infix "/"), syntax for generic "abs" operation, generic summation
10130 * HOL/typedef: simplified package, provide more useful rules (see also
10133 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10134 now expressed as a proper nested rule (old-style tactic scripts may
10135 require atomize_strip_tac to cope with non-atomic premises);
10137 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10138 to "split_conv" (old name still available for compatibility);
10140 * HOL: improved concrete syntax for strings (e.g. allows translation
10141 rules with string literals);
10143 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10144 and Fleuriot's mechanization of analysis, including the transcendental
10145 functions for the reals;
10147 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10152 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10153 "lam" is displayed as TWO lambda-symbols
10155 * CTT: theory Main now available, containing everything (that is, Bool
10161 * Pure: the Simplifier has been implemented properly as a derived rule
10162 outside of the actual kernel (at last!); the overall performance
10163 penalty in practical applications is about 50%, while reliability of
10164 the Isabelle inference kernel has been greatly improved;
10166 * print modes "brackets" and "no_brackets" control output of nested =>
10167 (types) and ==> (props); the default behaviour is "brackets";
10169 * Provers: fast_tac (and friends) now handle actual object-logic rules
10170 as assumptions as well;
10172 * system: support Poly/ML 4.0;
10174 * system: isatool install handles KDE version 1 or 2;
10178 New in Isabelle99-1 (October 2000)
10179 ----------------------------------
10181 *** Overview of INCOMPATIBILITIES ***
10183 * HOL: simplification of natural numbers is much changed; to partly
10184 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10185 issue the following ML commands:
10187 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10188 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10190 * HOL: simplification no longer dives into case-expressions; this is
10191 controlled by "t.weak_case_cong" for each datatype t;
10193 * HOL: nat_less_induct renamed to less_induct;
10195 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10196 fixsome to patch .thy and .ML sources automatically;
10198 select_equality -> some_equality
10199 select_eq_Ex -> some_eq_ex
10200 selectI2EX -> someI2_ex
10203 select1_equality -> some1_equality
10204 Eps_sym_eq -> some_sym_eq_trivial
10205 Eps_eq -> some_eq_trivial
10207 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10209 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10212 * HOL: the recursion equations generated by 'recdef' are now called
10213 f.simps instead of f.rules;
10215 * HOL: qed_spec_mp now also handles bounded ALL as well;
10217 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10218 sometimes be needed;
10220 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10222 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10224 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10225 product is now "<*>" instead of "Times"; the lexicographic product is
10226 now "<*lex*>" instead of "**";
10228 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10229 of main HOL, but was unused); better use HOL's datatype package;
10231 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10232 the old syntax may be recovered as follows:
10235 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10236 (infixl "\\<oplus>" 100)
10238 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10240 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10241 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10244 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10245 changed from A/r to A//r;
10247 * ZF: new treatment of arithmetic (nat & int) may break some old
10250 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10251 rulify -> rule_format, elimify -> elim_format, ...);
10253 * Isar/Provers: intro/elim/dest attributes changed; renamed
10254 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10255 should have to change intro!! to intro? only); replaced "delrule" by
10258 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10260 * Provers: strengthened force_tac by using new first_best_tac;
10262 * LaTeX document preparation: several changes of isabelle.sty (see
10266 *** Document preparation ***
10268 * formal comments (text blocks etc.) in new-style theories may now
10269 contain antiquotations of thm/prop/term/typ/text to be presented
10270 according to latex print mode; concrete syntax is like this:
10271 @{term[show_types] "f(x) = a + x"};
10273 * isatool mkdir provides easy setup of Isabelle session directories,
10274 including proper document sources;
10276 * generated LaTeX sources are now deleted after successful run
10277 (isatool document -c); may retain a copy somewhere else via -D option
10280 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10281 style files, achieving self-contained LaTeX sources and simplifying
10284 * old-style theories now produce (crude) LaTeX output as well;
10286 * browser info session directories are now self-contained (may be put
10287 on WWW server seperately); improved graphs of nested sessions; removed
10288 graph for 'all sessions';
10290 * several improvements in isabelle style files; \isabellestyle{it}
10291 produces fake math mode output; \isamarkupheader is now \section by
10292 default; see lib/texinputs/isabelle.sty etc.;
10297 * Isar/Pure: local results and corresponding term bindings are now
10298 subject to Hindley-Milner polymorphism (similar to ML); this
10299 accommodates incremental type-inference very nicely;
10301 * Isar/Pure: new derived language element 'obtain' supports
10302 generalized existence reasoning;
10304 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10305 support accumulation of results, without applying any rules yet;
10306 useful to collect intermediate results without explicit name
10307 references, and for use with transitivity rules with more than 2
10310 * Isar/Pure: scalable support for case-analysis type proofs: new
10311 'case' language element refers to local contexts symbolically, as
10312 produced by certain proof methods; internally, case names are attached
10313 to theorems as "tags";
10315 * Isar/Pure: theory command 'hide' removes declarations from
10316 class/type/const name spaces;
10318 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10319 indicate potential overloading;
10321 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10323 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10324 "{a,b,c}" instead of {a,b,c};
10326 * Isar/Pure now provides its own version of intro/elim/dest
10327 attributes; useful for building new logics, but beware of confusion
10328 with the version in Provers/classical;
10330 * Isar/Pure: the local context of (non-atomic) goals is provided via
10331 case name 'antecedent';
10333 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10334 to the current context is now done automatically);
10336 * Isar/Pure: theory command 'method_setup' provides a simple interface
10337 for definining proof methods in ML;
10339 * Isar/Provers: intro/elim/dest attributes changed; renamed
10340 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10341 most cases, one should have to change intro!! to intro? only);
10342 replaced "delrule" by "rule del";
10344 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10345 'symmetric' attribute (the latter supercedes [RS sym]);
10347 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10348 method modifier); 'simp' method: 'only:' modifier removes loopers as
10349 well (including splits);
10351 * Isar/Provers: Simplifier and Classical methods now support all kind
10352 of modifiers used in the past, including 'cong', 'iff', etc.
10354 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10355 of Simplifier and Classical reasoner);
10357 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10358 now support named cases; major packages (inductive, datatype, primrec,
10359 recdef) support case names and properly name parameters;
10361 * Isar/HOL: new transitivity rules for substitution in inequalities --
10362 monotonicity conditions are extracted to be proven at end of
10365 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10368 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10369 split_if split_if_asm; datatype package provides theorems foo.splits =
10370 foo.split foo.split_asm for each datatype;
10372 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10373 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10374 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10375 use "(cases (simplified))" method in proper proof texts);
10377 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10379 * Isar: names of theorems etc. may be natural numbers as well;
10381 * Isar: 'pr' command: optional arguments for goals_limit and
10382 ProofContext.prems_limit; no longer prints theory contexts, but only
10385 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10386 additional print modes to be specified; e.g. "pr(latex)" will print
10387 proof state according to the Isabelle LaTeX style;
10389 * Isar: improved support for emulating tactic scripts, including proof
10390 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10391 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10392 (for HOL datatypes);
10394 * Isar: simplified (more robust) goal selection of proof methods: 1st
10395 goal, all goals, or explicit goal specifier (tactic emulation); thus
10396 'proof method scripts' have to be in depth-first order;
10398 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10400 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10401 should instead use individual commands for printing items
10402 (print_commands, print_methods etc.);
10404 * Isar: added 'nothing' --- the empty list of theorems;
10409 * HOL/MicroJava: formalization of a fragment of Java, together with a
10410 corresponding virtual machine and a specification of its bytecode
10411 verifier and a lightweight bytecode verifier, including proofs of
10412 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10413 Cornelia Pusch (see also the homepage of project Bali at
10414 http://isabelle.in.tum.de/Bali/);
10416 * HOL/Algebra: new theory of rings and univariate polynomials, by
10419 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10420 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10423 * HOL/Lattice: fundamental concepts of lattice theory and order
10424 structures, including duals, properties of bounds versus algebraic
10425 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10426 Theorem for complete lattices etc.; may also serve as a demonstration
10427 for abstract algebraic reasoning using axiomatic type classes, and
10428 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10430 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10433 * HOL/IMPP: extension of IMP with local variables and mutually
10434 recursive procedures, by David von Oheimb;
10436 * HOL/Lambda: converted into new-style theory and document;
10438 * HOL/ex/Multiquote: example of multiple nested quotations and
10439 anti-quotations -- basically a generalized version of de-Bruijn
10440 representation; very useful in avoiding lifting of operations;
10442 * HOL/record: added general record equality rule to simpset; fixed
10443 select-update simplification procedure to handle extended records as
10444 well; admit "r" as field name;
10446 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10447 other numeric types and also as the identity of groups, rings, etc.;
10449 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10450 Types nat and int belong to this axclass;
10452 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10453 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10454 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10455 two terms #m*u and #n*u are replaced by #(m+n)*u
10456 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10457 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10458 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10460 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10461 powerful prover for predicate logic but knows nothing of clasets; see
10462 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10464 * HOL: new version of "case_tac" subsumes both boolean case split and
10465 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10466 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10468 * HOL: simplification no longer dives into case-expressions: only the
10469 selector expression is simplified, but not the remaining arms; to
10470 enable full simplification of case-expressions for datatype t, you may
10471 remove t.weak_case_cong from the simpset, either globally (Delcongs
10472 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10474 * HOL/recdef: the recursion equations generated by 'recdef' for
10475 function 'f' are now called f.simps instead of f.rules; if all
10476 termination conditions are proved automatically, these simplification
10477 rules are added to the simpset, as in primrec; rules may be named
10478 individually as well, resulting in a separate list of theorems for
10481 * HOL/While is a new theory that provides a while-combinator. It
10482 permits the definition of tail-recursive functions without the
10483 provision of a termination measure. The latter is necessary once the
10484 invariant proof rule for while is applied.
10486 * HOL: new (overloaded) notation for the set of elements below/above
10487 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10489 * HOL: theorems impI, allI, ballI bound as "strip";
10491 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10492 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10493 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10495 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10497 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10498 main HOL, but was unused);
10500 * HOL: fewer consts declared as global (e.g. have to refer to
10501 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10503 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10504 in case of overlap with user translations (e.g. judgements over
10505 tuples); (note that the underlying logical represenation is still
10511 * ZF: simplification automatically cancels common terms in arithmetic
10512 expressions over nat and int;
10514 * ZF: new treatment of nat to minimize type-checking: all operators
10515 coerce their operands to a natural number using the function natify,
10516 making the algebraic laws unconditional;
10518 * ZF: as above, for int: operators coerce their operands to an integer
10519 using the function intify;
10521 * ZF: the integer library now contains many of the usual laws for the
10522 orderings, including $<=, and monotonicity laws for $+ and $*;
10524 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10527 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10528 to the simplifier and classical reasoner simultaneously;
10533 * Provers: blast_tac now handles actual object-logic rules as
10534 assumptions; note that auto_tac uses blast_tac internally as well;
10536 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10537 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10539 * Provers: delrules now handles destruct rules as well (no longer need
10540 explicit make_elim);
10542 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10543 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10544 use instead the strong form,
10545 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10546 in HOL, FOL and ZF the function cla_make_elim will create such rules
10547 from destruct-rules;
10549 * Provers: Simplifier.easy_setup provides a fast path to basic
10550 Simplifier setup for new object-logics;
10552 * Pure: AST translation rules no longer require constant head on LHS;
10554 * Pure: improved name spaces: ambiguous output is qualified; support
10555 for hiding of names;
10557 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10558 XSYMBOL_HOME; no longer need to do manual configuration in most
10561 * system: compression of ML heaps images may now be controlled via -c
10562 option of isabelle and isatool usedir (currently only observed by
10565 * system: isatool installfonts may handle X-Symbol fonts as well (very
10566 useful for remote X11);
10568 * system: provide TAGS file for Isabelle sources;
10570 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10573 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10574 timing flag supersedes proof_timing and Toplevel.trace;
10576 * ML: new combinators |>> and |>>> for incremental transformations
10577 with secondary results (e.g. certain theory extensions):
10579 * ML: PureThy.add_defs gets additional argument to indicate potential
10580 overloading (usually false);
10582 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10587 New in Isabelle99 (October 1999)
10588 --------------------------------
10590 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10592 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10593 are no longer simplified. (This allows the simplifier to unfold recursive
10594 functional programs.) To restore the old behaviour, declare
10596 Delcongs [if_weak_cong];
10598 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10601 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10603 * HOL/datatype: mutual_induct_tac no longer exists --
10604 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10606 * HOL/typedef: fixed type inference for representing set; type
10607 arguments now have to occur explicitly on the rhs as type constraints;
10609 * ZF: The con_defs part of an inductive definition may no longer refer
10610 to constants declared in the same theory;
10612 * HOL, ZF: the function mk_cases, generated by the inductive
10613 definition package, has lost an argument. To simplify its result, it
10614 uses the default simpset instead of a supplied list of theorems.
10616 * HOL/List: the constructors of type list are now Nil and Cons;
10618 * Simplifier: the type of the infix ML functions
10619 setSSolver addSSolver setSolver addSolver
10620 is now simpset * solver -> simpset where `solver' is a new abstract type
10621 for packaging solvers. A solver is created via
10622 mk_solver: string -> (thm list -> int -> tactic) -> solver
10623 where the string argument is only a comment.
10626 *** Proof tools ***
10628 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10629 decision procedure for linear arithmetic. Currently it is used for
10630 types `nat', `int', and `real' in HOL (see below); it can, should and
10631 will be instantiated for other types and logics as well.
10633 * The simplifier now accepts rewrite rules with flexible heads, eg
10634 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10635 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10641 * New Isabelle/Isar subsystem provides an alternative to traditional
10642 tactical theorem proving; together with the ProofGeneral/isar user
10643 interface it offers an interactive environment for developing human
10644 readable proof documents (Isar == Intelligible semi-automated
10645 reasoning); for further information see isatool doc isar-ref,
10646 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10648 * improved and simplified presentation of theories: better HTML markup
10649 (including colors), graph views in several sizes; isatool usedir now
10650 provides a proper interface for user theories (via -P option); actual
10651 document preparation based on (PDF)LaTeX is available as well (for
10652 new-style theories only); see isatool doc system for more information;
10654 * native support for Proof General, both for classic Isabelle and
10657 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10658 using the graph browser tool;
10660 * Isabelle manuals now also available as PDF;
10662 * theory loader rewritten from scratch (may not be fully
10663 bug-compatible); old loadpath variable has been replaced by show_path,
10664 add_path, del_path, reset_path functions; new operations such as
10665 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10668 * improved isatool install: option -k creates KDE application icon,
10669 option -p DIR installs standalone binaries;
10671 * added ML_PLATFORM setting (useful for cross-platform installations);
10672 more robust handling of platform specific ML images for SML/NJ;
10674 * the settings environment is now statically scoped, i.e. it is never
10675 created again in sub-processes invoked from isabelle, isatool, or
10678 * path element specification '~~' refers to '$ISABELLE_HOME';
10680 * in locales, the "assumes" and "defines" parts may be omitted if
10683 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10686 * new print_mode "HTML";
10688 * new flag show_tags controls display of tags of theorems (which are
10689 basically just comments that may be attached by some tools);
10691 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10692 mode and goal output format:
10694 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10696 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10698 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10699 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10701 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10703 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10705 * function bind_thms stores lists of theorems (cf. bind_thm);
10707 * new shorthand tactics ftac, eatac, datac, fatac;
10709 * qed (and friends) now accept "" as result name; in that case the
10710 theorem is not stored, but proper checks and presentation of the
10711 result still apply;
10713 * theorem database now also indexes constants "Trueprop", "all",
10714 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10719 ** HOL arithmetic **
10721 * There are now decision procedures for linear arithmetic over nat and
10724 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10725 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10726 are treated as atomic; subformulae not involving type `nat' or `int'
10727 are ignored; quantified subformulae are ignored unless they are
10728 positive universal or negative existential. The tactic has to be
10729 invoked by hand and can be a little bit slow. In particular, the
10730 running time is exponential in the number of occurrences of `min' and
10731 `max', and `-' on `nat'.
10733 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10734 (negated) (in)equalities among the premises and the conclusion into
10735 account (i.e. no compound formulae) and does not know about `min' and
10736 `max', and `-' on `nat'. It is fast and is used automatically by the
10739 NB: At the moment, these decision procedures do not cope with mixed
10740 nat/int formulae where the two parts interact, such as `m < n ==>
10743 * HOL/Numeral provides a generic theory of numerals (encoded
10744 efficiently as bit strings); setup for types nat/int/real is in place;
10745 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10746 int, existing theories and proof scripts may require a few additional
10749 * integer division and remainder can now be performed on constant
10752 * many properties of integer multiplication, division and remainder
10755 * An interface to the Stanford Validity Checker (SVC) is available through the
10756 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10757 are proved automatically. SVC must be installed separately, and its results
10758 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10759 invocation of the underlying oracle). For SVC see
10760 http://verify.stanford.edu/SVC
10762 * IsaMakefile: the HOL-Real target now builds an actual image;
10767 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10768 (in Isabelle/Isar) -- by Gertrud Bauer;
10770 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10771 analysis for assembly languages with subtypes;
10773 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10774 -- avoids syntactic ambiguities and treats state, transition, and
10775 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10776 changed syntax and (many) tactics;
10778 * HOL/inductive: Now also handles more general introduction rules such
10779 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10780 theorems are now maintained within the theory (maintained via the
10783 * HOL/datatype: Now also handles arbitrarily branching datatypes
10784 (using function types) such as
10786 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10788 * HOL/record: record_simproc (part of the default simpset) takes care
10789 of selectors applied to updated records; record_split_tac is no longer
10790 part of the default claset; update_defs may now be removed from the
10791 simpset in many cases; COMPATIBILITY: old behavior achieved by
10793 claset_ref () := claset() addSWrapper record_split_wrapper;
10794 Delsimprocs [record_simproc]
10796 * HOL/typedef: fixed type inference for representing set; type
10797 arguments now have to occur explicitly on the rhs as type constraints;
10799 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10800 names rather than an ML expression;
10802 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10803 supplied later. Program schemes can be defined, such as
10804 "While B C s = (if B s then While B C (C s) else s)"
10805 where the well-founded relation can be chosen after B and C have been given.
10807 * HOL/List: the constructors of type list are now Nil and Cons;
10808 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10809 course, ML tools referring to List.list.op # etc. have to be adapted;
10811 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10812 disabled by default; run isabelle with option -m HOL to get back to
10813 the original Gordon/HOL-style output;
10815 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10816 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10818 * HOL basic syntax simplified (more orthogonal): all variants of
10819 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10820 Eps operator is provided as well: "SOME x. P[x]";
10822 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10824 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10825 thus available for user theories;
10827 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10828 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10831 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10832 several times and then mp;
10837 * the notation <<...>> is now available as a notation for sequences of
10840 * the simplifier is now installed
10842 * the axiom system has been generalized (thanks to Soren Heilmann)
10844 * the classical reasoner now has a default rule database
10849 * new primrec section allows primitive recursive functions to be given
10850 directly (as in HOL) over datatypes and the natural numbers;
10852 * new tactics induct_tac and exhaust_tac for induction (or case
10853 analysis) over datatypes and the natural numbers;
10855 * the datatype declaration of type T now defines the recursor T_rec;
10857 * simplification automatically does freeness reasoning for datatype
10860 * automatic type-inference, with AddTCs command to insert new
10861 type-checking rules;
10863 * datatype introduction rules are now added as Safe Introduction rules
10866 * the syntax "if P then x else y" is now available in addition to
10870 *** Internal programming interfaces ***
10872 * tuned simplifier trace output; new flag debug_simp;
10874 * structures Vartab / Termtab (instances of TableFun) offer efficient
10875 tables indexed by indexname_ord / term_ord (compatible with aconv);
10877 * AxClass.axclass_tac lost the theory argument;
10879 * tuned current_goals_markers semantics: begin / end goal avoids
10880 printing empty lines;
10882 * removed prs and prs_fn hook, which was broken because it did not
10883 include \n in its semantics, forcing writeln to add one
10884 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10885 string -> unit if you really want to output text without newline;
10887 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10888 plain output, interface builders may have to enable 'isabelle_font'
10889 mode to get Isabelle font glyphs as before;
10891 * refined token_translation interface; INCOMPATIBILITY: output length
10892 now of type real instead of int;
10894 * theory loader actions may be traced via new ThyInfo.add_hook
10895 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10896 your own database of information attached to *whole* theories -- as
10897 opposed to intra-theory data slots offered via TheoryDataFun;
10899 * proper handling of dangling sort hypotheses (at last!);
10900 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10901 extra sort hypotheses that can be witnessed from the type signature;
10902 the force_strip_shyps flag is gone, any remaining shyps are simply
10903 left in the theorem (with a warning issued by strip_shyps_warning);
10907 New in Isabelle98-1 (October 1998)
10908 ----------------------------------
10910 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10912 * several changes of automated proof tools;
10914 * HOL: major changes to the inductive and datatype packages, including
10915 some minor incompatibilities of theory syntax;
10917 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10920 * HOL: removed duplicate thms in Arith:
10921 less_imp_add_less should be replaced by trans_less_add1
10922 le_imp_add_le should be replaced by trans_le_add1
10924 * HOL: unary minus is now overloaded (new type constraints may be
10927 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10928 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10929 now taken as an integer constant.
10931 * Pure: ML function 'theory_of' renamed to 'theory';
10934 *** Proof tools ***
10937 1. Asm_full_simp_tac is now more aggressive.
10938 1. It will sometimes reorient premises if that increases their power to
10940 2. It does no longer proceed strictly from left to right but may also
10941 rotate premises to achieve further simplification.
10942 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10943 old Asm_full_simp_tac in that it does not rotate premises.
10944 2. The simplifier now knows a little bit about nat-arithmetic.
10946 * Classical reasoner: wrapper mechanism for the classical reasoner now
10947 allows for selected deletion of wrappers, by introduction of names for
10948 wrapper functionals. This implies that addbefore, addSbefore,
10949 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10950 and that adding two tactics with the same name overwrites the first
10951 one (emitting a warning).
10952 type wrapper = (int -> tactic) -> (int -> tactic)
10953 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10954 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10955 delWrapper, delSWrapper: claset * string -> claset
10956 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10958 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10959 semantics; addbefore now affects only the unsafe part of step_tac
10960 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10961 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10964 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10965 compWrapper; added safe wrapper (and access functions for it);
10967 * HOL/split_all_tac is now much faster and fails if there is nothing
10968 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10969 and the names of the automatically generated variables have changed.
10970 split_all_tac has moved within claset() from unsafe wrappers to safe
10971 wrappers, which means that !!-bound variables are split much more
10972 aggressively, and safe_tac and clarify_tac now split such variables.
10973 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10974 Note: the same holds for record_split_tac, which does the job of
10975 split_all_tac for record fields.
10977 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10978 permanently to the default simpset using Addsplits just like
10979 Addsimps. They can be removed via Delsplits just like
10980 Delsimps. Lower-case versions are also available.
10982 * HOL/Simplifier: The rule split_if is now part of the default
10983 simpset. This means that the simplifier will eliminate all occurrences
10984 of if-then-else in the conclusion of a goal. To prevent this, you can
10985 either remove split_if completely from the default simpset by
10986 `Delsplits [split_if]' or remove it in a specific call of the
10987 simplifier using `... delsplits [split_if]'. You can also add/delete
10988 other case splitting rules to/from the default simpset: every datatype
10989 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10990 t is the name of the datatype).
10992 * Classical reasoner / Simplifier combination: new force_tac (and
10993 derivatives Force_tac, force) combines rewriting and classical
10994 reasoning (and whatever other tools) similarly to auto_tac, but is
10995 aimed to solve the given subgoal completely.
11000 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11001 and `goalw': the theory is no longer needed as an explicit argument -
11002 the current theory context is used; assumptions are no longer returned
11003 at the ML-level unless one of them starts with ==> or !!; it is
11004 recommended to convert to these new commands using isatool fixgoal
11005 (backup your sources first!);
11007 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11008 the current theory context, and 'theory' to lookup stored theories;
11010 * new theory section 'locale' for declaring constants, assumptions and
11011 definitions that have local scope;
11013 * new theory section 'nonterminals' for purely syntactic types;
11015 * new theory section 'setup' for generic ML setup functions
11016 (e.g. package initialization);
11018 * the distribution now includes Isabelle icons: see
11019 lib/logo/isabelle-{small,tiny}.xpm;
11021 * isatool install - install binaries with absolute references to
11024 * isatool logo -- create instances of the Isabelle logo (as EPS);
11026 * print mode 'emacs' reserved for Isamode;
11028 * support multiple print (ast) translations per constant name;
11030 * theorems involving oracles are now printed with a suffixed [!];
11035 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11037 * HOL/inductive package reorganized and improved: now supports mutual
11038 definitions such as
11043 oddI "n : EVEN ==> Suc n : ODD"
11044 evenI "n : ODD ==> Suc n : EVEN"
11046 new theorem list "elims" contains an elimination rule for each of the
11047 recursive sets; inductive definitions now handle disjunctive premises
11048 correctly (also ZF);
11050 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11051 "mutual_induct" no longer exists - the induction rule is always
11052 contained in "induct";
11055 * HOL/datatype package re-implemented and greatly improved: now
11056 supports mutually recursive datatypes such as
11059 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11060 | SUM ('a aexp) ('a aexp)
11061 | DIFF ('a aexp) ('a aexp)
11064 'a bexp = LESS ('a aexp) ('a aexp)
11065 | AND ('a bexp) ('a bexp)
11066 | OR ('a bexp) ('a bexp)
11068 as well as indirectly recursive datatypes such as
11071 ('a, 'b) term = Var 'a
11072 | App 'b ((('a, 'b) term) list)
11074 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11075 induction on mutually / indirectly recursive datatypes.
11077 Primrec equations are now stored in theory and can be accessed via
11078 <function_name>.simps.
11082 - Theories using datatypes must now have theory Datatype as an
11084 - The specific <typename>.induct_tac no longer exists - use the
11085 generic induct_tac instead.
11086 - natE has been renamed to nat.exhaust - use exhaust_tac
11087 instead of res_inst_tac ... natE. Note that the variable
11088 names in nat.exhaust differ from the names in natE, this
11089 may cause some "fragile" proofs to fail.
11090 - The theorems split_<typename>_case and split_<typename>_case_asm
11091 have been renamed to <typename>.split and <typename>.split_asm.
11092 - Since default sorts of type variables are now handled correctly,
11093 some datatype definitions may have to be annotated with explicit
11095 - Primrec definitions no longer require function name and type
11096 of recursive argument.
11098 Consider using isatool fixdatatype to adapt your theories and proof
11099 scripts to the new package (backup your sources first!).
11102 * HOL/record package: considerably improved implementation; now
11103 includes concrete syntax for record types, terms, updates; theorems
11104 for surjective pairing and splitting !!-bound record variables; proof
11105 support is as follows:
11107 1) standard conversions (selectors or updates applied to record
11108 constructor terms) are part of the standard simpset;
11110 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11111 made part of standard simpset and claset via addIffs;
11113 3) a tactic for record field splitting (record_split_tac) is part of
11114 the standard claset (addSWrapper);
11116 To get a better idea about these rules you may retrieve them via
11117 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11118 the name of your record type.
11120 The split tactic 3) conceptually simplifies by the following rule:
11122 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11124 Thus any record variable that is bound by meta-all will automatically
11125 blow up into some record constructor term, consequently the
11126 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11127 solve record problems automatically.
11130 * reorganized the main HOL image: HOL/Integ and String loaded by
11131 default; theory Main includes everything;
11133 * automatic simplification of integer sums and comparisons, using cancellation;
11135 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11137 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11139 * many new identities for unions, intersections, set difference, etc.;
11141 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11142 called split_if, split_split, split_sum_case and split_nat_case (to go
11143 with add/delsplits);
11145 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11146 (?x::unit) = (); this is made part of the default simpset, which COULD
11147 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11148 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11149 unit_abs_eta_conv is added in order to counter the effect of
11150 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11153 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11156 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11157 It and 'sym RS equals0D' are now in the default claset, giving automatic
11158 disjointness reasoning but breaking a few old proofs.
11160 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11161 to 'converse' from 'inverse' (for compatibility with ZF and some
11164 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11165 the well-founded relation;
11167 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11168 Compl A. The "Compl" syntax remains available as input syntax for this
11171 * HOL/Update: new theory of function updates:
11172 f(a:=b) == %x. if x=a then b else f x
11173 may also be iterated as in f(a:=b,c:=d,...);
11175 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11178 - new function list_update written xs[i:=v] that updates the i-th
11179 list position. May also be iterated as in xs[i:=a,j:=b,...].
11180 - new function `upt' written [i..j(] which generates the list
11181 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11182 bound write [i..j], which is a shorthand for [i..j+1(].
11183 - new lexicographic orderings and corresponding wellfoundedness theorems.
11186 - removed 'pred' (predecessor) function;
11187 - generalized some theorems about n-1;
11188 - many new laws about "div" and "mod";
11189 - new laws about greatest common divisors (see theory ex/Primes);
11191 * HOL/Relation: renamed the relational operator r^-1 "converse"
11192 instead of "inverse";
11194 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11195 of the multiset ordering;
11197 * directory HOL/Real: a construction of the reals using Dedekind cuts
11198 (not included by default);
11200 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11202 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11203 programs, i.e. different program variables may have different types.
11205 * calling (stac rew i) now fails if "rew" has no effect on the goal
11206 [previously, this check worked only if the rewrite rule was unconditional]
11207 Now rew can involve either definitions or equalities (either == or =).
11212 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11213 only the theorems proved on ZF.ML;
11215 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11216 It and 'sym RS equals0D' are now in the default claset, giving automatic
11217 disjointness reasoning but breaking a few old proofs.
11219 * ZF/Update: new theory of function updates
11220 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11221 may also be iterated as in f(a:=b,c:=d,...);
11223 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11225 * calling (stac rew i) now fails if "rew" has no effect on the goal
11226 [previously, this check worked only if the rewrite rule was unconditional]
11227 Now rew can involve either definitions or equalities (either == or =).
11229 * case_tac provided for compatibility with HOL
11230 (like the old excluded_middle_tac, but with subgoals swapped)
11233 *** Internal programming interfaces ***
11235 * Pure: several new basic modules made available for general use, see
11236 also src/Pure/README;
11238 * improved the theory data mechanism to support encapsulation (data
11239 kind name replaced by private Object.kind, acting as authorization
11240 key); new type-safe user interface via functor TheoryDataFun; generic
11241 print_data function becomes basically useless;
11243 * removed global_names compatibility flag -- all theory declarations
11244 are qualified by default;
11246 * module Pure/Syntax now offers quote / antiquote translation
11247 functions (useful for Hoare logic etc. with implicit dependencies);
11248 see HOL/ex/Antiquote for an example use;
11250 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11253 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11256 * Display.print_goals function moved to Locale.print_goals;
11258 * standard print function for goals supports current_goals_markers
11259 variable for marking begin of proof, end of proof, start of goal; the
11260 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11261 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11266 New in Isabelle98 (January 1998)
11267 --------------------------------
11269 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11271 * changed lexical syntax of terms / types: dots made part of long
11272 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11274 * simpset (and claset) reference variable replaced by functions
11275 simpset / simpset_ref;
11277 * no longer supports theory aliases (via merge) and non-trivial
11278 implicit merge of thms' signatures;
11280 * most internal names of constants changed due to qualified names;
11282 * changed Pure/Sequence interface (see Pure/seq.ML);
11285 *** General Changes ***
11287 * hierachically structured name spaces (for consts, types, axms, thms
11288 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11289 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11290 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11291 long_names for fully qualified output names; NOTE: ML programs
11292 (special tactics, packages etc.) referring to internal names may have
11293 to be adapted to cope with fully qualified names; in case of severe
11294 backward campatibility problems try setting 'global_names' at compile
11295 time to have enrything declared within a flat name space; one may also
11296 fine tune name declarations in theories via the 'global' and 'local'
11299 * reimplemented the implicit simpset and claset using the new anytype
11300 data filed in signatures; references simpset:simpset ref etc. are
11301 replaced by functions simpset:unit->simpset and
11302 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11303 to patch your ML files accordingly;
11305 * HTML output now includes theory graph data for display with Java
11306 applet or isatool browser; data generated automatically via isatool
11307 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11309 * defs may now be conditional; improved rewrite_goals_tac to handle
11310 conditional equations;
11312 * defs now admits additional type arguments, using TYPE('a) syntax;
11314 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11315 creates a new theory node; implicit merge of thms' signatures is
11316 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11317 transfer:theory->thm->thm in (rare) cases;
11319 * improved handling of draft signatures / theories; draft thms (and
11320 ctyps, cterms) are automatically promoted to real ones;
11322 * slightly changed interfaces for oracles: admit many per theory, named
11323 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11325 * print_goals: optional output of const types (set show_consts and
11328 * improved output of warnings (###) and errors (***);
11330 * subgoal_tac displays a warning if the new subgoal has type variables;
11332 * removed old README and Makefiles;
11334 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11336 * removed obsolete init_pps and init_database;
11338 * deleted the obsolete tactical STATE, which was declared by
11339 fun STATE tacfun st = tacfun st st;
11341 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11342 (which abbreviates $HOME);
11344 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11345 use isatool fixseq to adapt your ML programs (this works for fully
11346 qualified references to the Sequence structure only!);
11348 * use_thy no longer requires writable current directory; it always
11349 reloads .ML *and* .thy file, if either one is out of date;
11352 *** Classical Reasoner ***
11354 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11355 tactics that use classical reasoning to simplify a subgoal without
11356 splitting it into several subgoals;
11358 * Safe_tac: like safe_tac but uses the default claset;
11363 * added simplification meta rules:
11364 (asm_)(full_)simplify: simpset -> thm -> thm;
11366 * simplifier.ML no longer part of Pure -- has to be loaded by object
11369 * added prems argument to simplification procedures;
11371 * HOL, FOL, ZF: added infix function `addsplits':
11372 instead of `<simpset> setloop (split_tac <thms>)'
11373 you can simply write `<simpset> addsplits <thms>'
11378 * TYPE('a) syntax for type reflection terms;
11380 * no longer handles consts with name "" -- declare as 'syntax' instead;
11382 * pretty printer: changed order of mixfix annotation preference (again!);
11384 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11389 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11390 with `addloop' of the simplifier to faciliate case splitting in premises.
11392 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11394 * HOL/Auth: new protocol proofs including some for the Internet
11397 * HOL/Map: new theory of `maps' a la VDM;
11399 * HOL/simplifier: simplification procedures nat_cancel_sums for
11400 cancelling out common nat summands from =, <, <= (in)equalities, or
11401 differences; simplification procedures nat_cancel_factor for
11402 cancelling common factor from =, <, <= (in)equalities over natural
11403 sums; nat_cancel contains both kinds of procedures, it is installed by
11404 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11406 * HOL/simplifier: terms of the form
11407 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11409 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11410 and those of the form
11411 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11413 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11416 Each datatype `t' now comes with a theorem `split_t_case' of the form
11418 P(t_case f1 ... fn x) =
11419 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11421 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11424 and a theorem `split_t_case_asm' of the form
11426 P(t_case f1 ... fn x) =
11427 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11429 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11431 which can be added to a simpset via `addsplits'. The existing theorems
11432 expand_list_case and expand_option_case have been renamed to
11433 split_list_case and split_option_case.
11436 - `pred n' is automatically converted to `n-1'.
11437 Users are strongly encouraged not to use `pred' any longer,
11438 because it will disappear altogether at some point.
11439 - Users are strongly encouraged to write "0 < n" rather than
11440 "n ~= 0". Theorems and proof tools have been modified towards this
11444 the function "set_of_list" has been renamed "set" (and its theorems too);
11445 the function "nth" now takes its arguments in the reverse order and
11446 has acquired the infix notation "!" as in "xs!n".
11448 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11450 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11451 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11453 * HOL/record: extensible records with schematic structural subtyping
11454 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11455 still lacks various theorems and concrete record syntax;
11460 * removed "axioms" and "generated by" sections;
11462 * replaced "ops" section by extended "consts" section, which is capable of
11463 handling the continuous function space "->" directly;
11466 . proves theorems immediately and stores them in the theory,
11467 . creates hierachical name space,
11468 . now uses normal mixfix annotations (instead of cinfix...),
11469 . minor changes to some names and values (for consistency),
11470 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11471 . separator between mutual domain defs: changed "," to "and",
11472 . improved handling of sort constraints; now they have to
11473 appear on the left-hand side of the equations only;
11475 * fixed LAM <x,y,zs>.b syntax;
11477 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11478 adm (%x. P (t x)), where P is chainfinite and t continuous;
11483 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11484 with `addloop' of the simplifier to faciliate case splitting in premises.
11486 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11487 in HOL, they strip ALL and --> from proved theorems;
11491 New in Isabelle94-8 (May 1997)
11492 ------------------------------
11494 *** General Changes ***
11496 * new utilities to build / run / maintain Isabelle etc. (in parts
11497 still somewhat experimental); old Makefiles etc. still functional;
11499 * new 'Isabelle System Manual';
11501 * INSTALL text, together with ./configure and ./build scripts;
11503 * reimplemented type inference for greater efficiency, better error
11504 messages and clean internal interface;
11506 * prlim command for dealing with lots of subgoals (an easier way of
11507 setting goals_limit);
11512 * supports alternative (named) syntax tables (parser and pretty
11513 printer); internal interface is provided by add_modesyntax(_i);
11515 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11516 be used in conjunction with the Isabelle symbol font; uses the
11517 "symbols" syntax table;
11519 * added token_translation interface (may translate name tokens in
11520 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11521 the current print_mode); IMPORTANT: user print translation functions
11522 are responsible for marking newly introduced bounds
11523 (Syntax.mark_boundT);
11525 * token translations for modes "xterm" and "xterm_color" that display
11526 names in bold, underline etc. or colors (which requires a color
11529 * infixes may now be declared with names independent of their syntax;
11531 * added typed_print_translation (like print_translation, but may
11532 access type of constant);
11535 *** Classical Reasoner ***
11537 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11538 some limitations. Blast_tac...
11539 + ignores addss, addbefore, addafter; this restriction is intrinsic
11540 + ignores elimination rules that don't have the correct format
11541 (the conclusion MUST be a formula variable)
11542 + ignores types, which can make HOL proofs fail
11543 + rules must not require higher-order unification, e.g. apply_type in ZF
11544 [message "Function Var's argument not a bound variable" relates to this]
11545 + its proof strategy is more general but can actually be slower
11547 * substitution with equality assumptions no longer permutes other
11550 * minor changes in semantics of addafter (now called addaltern); renamed
11551 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11552 (and access functions for it);
11554 * improved combination of classical reasoner and simplifier:
11555 + functions for handling clasimpsets
11556 + improvement of addss: now the simplifier is called _after_ the
11558 + safe variant of addss called addSss: uses safe simplifications
11559 _during_ the safe steps. It is more complete as it allows multiple
11560 instantiations of unknowns (e.g. with slow_tac).
11564 * added interface for simplification procedures (functions that
11565 produce *proven* rewrite rules on the fly, depending on current
11568 * ordering on terms as parameter (used for ordered rewriting);
11570 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11572 * the solver is now split into a safe and an unsafe part.
11573 This should be invisible for the normal user, except that the
11574 functions setsolver and addsolver have been renamed to setSolver and
11575 addSolver; added safe_asm_full_simp_tac;
11580 * a generic induction tactic `induct_tac' which works for all datatypes and
11581 also for type `nat';
11583 * a generic case distinction tactic `exhaust_tac' which works for all
11584 datatypes and also for type `nat';
11586 * each datatype comes with a function `size';
11588 * patterns in case expressions allow tuple patterns as arguments to
11589 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11591 * primrec now also works with type nat;
11593 * recdef: a new declaration form, allows general recursive functions to be
11594 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11596 * the constant for negation has been renamed from "not" to "Not" to
11597 harmonize with FOL, ZF, LK, etc.;
11599 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11602 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11604 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11605 problems in commutative rings, using axiomatic type classes for + and *;
11607 * more examples in HOL/MiniML and HOL/Auth;
11609 * more default rewrite rules for quantifiers, union/intersection;
11611 * a new constant `arbitrary == @x.False';
11613 * HOLCF/IOA replaces old HOL/IOA;
11615 * HOLCF changes: derived all rules and arities
11616 + axiomatic type classes instead of classes
11617 + typedef instead of faking type definitions
11618 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11619 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11620 + eliminated the types void, one, tr
11621 + use unit lift and bool lift (with translations) instead of one and tr
11622 + eliminated blift from Lift3.thy (use Def instead of blift)
11623 all eliminated rules are derived as theorems --> no visible changes ;
11628 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11629 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11630 as ZF_cs addSIs [equalityI];
11634 New in Isabelle94-7 (November 96)
11635 ---------------------------------
11637 * allowing negative levels (as offsets) in prlev and choplev;
11639 * super-linear speedup for large simplifications;
11641 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11642 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11643 FAIL); can suppress it using the command Delsimps (ex_simps @
11644 all_simps); De Morgan laws are also now included, by default;
11646 * improved printing of ==> : ~:
11648 * new object-logic "Sequents" adds linear logic, while replacing LK
11649 and Modal (thanks to Sara Kalvala);
11651 * HOL/Auth: correctness proofs for authentication protocols;
11653 * HOL: new auto_tac combines rewriting and classical reasoning (many
11654 examples on HOL/Auth);
11656 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11657 the rewriter and classical reasoner simultaneously;
11659 * function uresult no longer returns theorems in "standard" format;
11660 regain previous version by: val uresult = standard o uresult;
11664 New in Isabelle94-6
11665 -------------------
11667 * oracles -- these establish an interface between Isabelle and trusted
11668 external reasoners, which may deliver results as theorems;
11670 * proof objects (in particular record all uses of oracles);
11672 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11674 * "constdefs" section in theory files;
11676 * "primrec" section (HOL) no longer requires names;
11678 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11682 New in Isabelle94-5
11683 -------------------
11685 * reduced space requirements;
11687 * automatic HTML generation from theories;
11689 * theory files no longer require "..." (quotes) around most types;
11691 * new examples, including two proofs of the Church-Rosser theorem;
11693 * non-curried (1994) version of HOL is no longer distributed;
11697 New in Isabelle94-4
11698 -------------------
11700 * greatly reduced space requirements;
11702 * theory files (.thy) no longer require \...\ escapes at line breaks;
11704 * searchable theorem database (see the section "Retrieving theorems" on
11705 page 8 of the Reference Manual);
11707 * new examples, including Grabczewski's monumental case study of the
11710 * The previous version of HOL renamed to Old_HOL;
11712 * The new version of HOL (previously called CHOL) uses a curried syntax
11713 for functions. Application looks like f a b instead of f(a,b);
11715 * Mutually recursive inductive definitions finally work in HOL;
11717 * In ZF, pattern-matching on tuples is now available in all abstractions and
11718 translates to the operator "split";
11722 New in Isabelle94-3
11723 -------------------
11725 * new infix operator, addss, allowing the classical reasoner to
11726 perform simplification at each step of its search. Example:
11727 fast_tac (cs addss ss)
11729 * a new logic, CHOL, the same as HOL, but with a curried syntax
11730 for functions. Application looks like f a b instead of f(a,b). Also pairs
11731 look like (a,b) instead of <a,b>;
11733 * PLEASE NOTE: CHOL will eventually replace HOL!
11735 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11736 It translates to the operator "split". A new theory of integers is available;
11738 * In ZF, integer numerals now denote two's-complement binary integers.
11739 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11741 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11742 of the Axiom of Choice;
11746 New in Isabelle94-2
11747 -------------------
11749 * Significantly faster resolution;
11751 * the different sections in a .thy file can now be mixed and repeated
11754 * Database of theorems for FOL, HOL and ZF. New
11755 commands including qed, qed_goal and bind_thm store theorems in the database.
11757 * Simple database queries: return a named theorem (get_thm) or all theorems of
11758 a given theory (thms_of), or find out what theory a theorem was proved in
11761 * Bugs fixed in the inductive definition and datatype packages;
11763 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11764 and HOL_dup_cs obsolete;
11766 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11769 * Simpler definition of function space in ZF;
11771 * new results about cardinal and ordinal arithmetic in ZF;
11773 * 'subtype' facility in HOL for introducing new types as subsets of existing
11776 :mode=isabelle-news:wrap=hard:maxLineLen=72: