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 * Swapped orientation of facts image_comp and vimage_comp:
210 image_compose ~> image_comp [symmetric]
211 image_comp ~> image_comp [symmetric]
212 vimage_compose ~> vimage_comp [symmetric]
213 vimage_comp ~> vimage_comp [symmetric]
217 * Simplifier: Enhanced solver of preconditions of rewrite rules can
218 now deal with conjunctions. For help with converting proofs, the old
219 behaviour of the simplifier can be restored like this: declare/using
220 [[simp_legacy_precond]]. This configuration option will disappear
221 again in the future. INCOMPATIBILITY.
224 - Abandoned fact collection "word_arith_alts", which is a duplicate
226 - Dropped first (duplicated) element in fact collections
227 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
228 "uint_word_arith_bintrs".
230 * Code generator: enforce case of identifiers only for strict target
231 language requirements. INCOMPATIBILITY.
233 * Code generator: explicit proof contexts in many ML interfaces.
236 * Code generator: minimize exported identifiers by default. Minor
239 * Code generation for SML and OCaml: dropped arcane "no_signatures"
240 option. Minor INCOMPATIBILITY.
242 * Simproc "finite_Collect" is no longer enabled by default, due to
243 spurious crashes and other surprises. Potential INCOMPATIBILITY.
245 * Moved new (co)datatype package and its dependencies from session
246 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
247 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
248 part of theory "Main".
251 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
252 Library/Wfrec.thy ~> Wfrec.thy
253 Library/Zorn.thy ~> Zorn.thy
254 Cardinals/Order_Relation.thy ~> Order_Relation.thy
255 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
256 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
257 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
258 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
259 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
260 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
261 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
262 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
263 BNF/BNF_Comp.thy ~> BNF_Comp.thy
264 BNF/BNF_Def.thy ~> BNF_Def.thy
265 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
266 BNF/BNF_GFP.thy ~> BNF_GFP.thy
267 BNF/BNF_LFP.thy ~> BNF_LFP.thy
268 BNF/BNF_Util.thy ~> BNF_Util.thy
269 BNF/Coinduction.thy ~> Coinduction.thy
270 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
271 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
272 BNF/Examples/* ~> BNF_Examples/*
275 Wellorder_Extension.thy (split from Zorn.thy)
276 Library/Cardinal_Notations.thy
277 Library/BNF_Axomatization.thy
278 BNF_Examples/Misc_Primcorec.thy
279 BNF_Examples/Stream_Processor.thy
281 Discontinued theories:
283 BNF/Equiv_Relations_More.thy
287 * New (co)datatype package:
288 - Command 'primcorec' is fully implemented.
289 - Command 'datatype_new' generates size functions ("size_xxx" and
290 "size") as required by 'fun'.
291 - BNFs are integrated with the Lifting tool and new-style
292 (co)datatypes with Transfer.
294 datatype_new_compat ~> datatype_compat
295 primrec_new ~> primrec
296 wrap_free_constructors ~> free_constructors
298 - The generated constants "xxx_case" and "xxx_rec" have been renamed
299 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
301 - The constant "xxx_(un)fold" and related theorems are no longer
302 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
305 - No discriminators are generated for nullary constructors by
306 default, eliminating the need for the odd "=:" syntax.
308 - No discriminators or selectors are generated by default by
309 "datatype_new", unless custom names are specified or the new
310 "discs_sels" option is passed.
313 * Old datatype package:
314 - The generated theorems "xxx.cases" and "xxx.recs" have been
315 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
316 "sum.case"). INCOMPATIBILITY.
317 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
318 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
319 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
321 * The types "'a list" and "'a option", their set and map functions,
322 their relators, and their selectors are now produced using the new
323 BNF-based datatype package.
326 Option.set ~> set_option
327 Option.map ~> map_option
328 option_rel ~> rel_option
331 set_def ~> set_rec[abs_def]
332 map_def ~> map_rec[abs_def]
333 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
334 option.recs ~> option.rec
335 list_all2_def ~> list_all2_iff
336 set.simps ~> set_simps (or the slightly different "list.set")
337 map.simps ~> list.map
338 hd.simps ~> list.sel(1)
339 tl.simps ~> list.sel(2-3)
340 the.simps ~> option.sel
344 * The following map functions and relators have been renamed:
351 filter_rel ~> rel_filter
352 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
353 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
354 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
358 * New theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
360 * New theory src/HOL/Library/Tree.thy.
362 * Theory reorganization:
363 Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
365 * Consolidated some facts about big group operators:
367 setsum_0' ~> setsum.neutral
368 setsum_0 ~> setsum.neutral_const
369 setsum_addf ~> setsum.distrib
370 setsum_cartesian_product ~> setsum.cartesian_product
371 setsum_cases ~> setsum.If_cases
372 setsum_commute ~> setsum.commute
373 setsum_cong ~> setsum.cong
374 setsum_delta ~> setsum.delta
375 setsum_delta' ~> setsum.delta'
376 setsum_diff1' ~> setsum.remove
377 setsum_empty ~> setsum.empty
378 setsum_infinite ~> setsum.infinite
379 setsum_insert ~> setsum.insert
380 setsum_inter_restrict'' ~> setsum.inter_filter
381 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
382 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
383 setsum_mono_zero_left ~> setsum.mono_neutral_left
384 setsum_mono_zero_right ~> setsum.mono_neutral_right
385 setsum_reindex ~> setsum.reindex
386 setsum_reindex_cong ~> setsum.reindex_cong
387 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
388 setsum_restrict_set ~> setsum.inter_restrict
389 setsum_Plus ~> setsum.Plus
390 setsum_setsum_restrict ~> setsum.commute_restrict
391 setsum_Sigma ~> setsum.Sigma
392 setsum_subset_diff ~> setsum.subset_diff
393 setsum_Un_disjoint ~> setsum.union_disjoint
394 setsum_UN_disjoint ~> setsum.UNION_disjoint
395 setsum_Un_Int ~> setsum.union_inter
396 setsum_Union_disjoint ~> setsum.Union_disjoint
397 setsum_UNION_zero ~> setsum.Union_comp
398 setsum_Un_zero ~> setsum.union_inter_neutral
399 strong_setprod_cong ~> setprod.strong_cong
400 strong_setsum_cong ~> setsum.strong_cong
401 setprod_1' ~> setprod.neutral
402 setprod_1 ~> setprod.neutral_const
403 setprod_cartesian_product ~> setprod.cartesian_product
404 setprod_cong ~> setprod.cong
405 setprod_delta ~> setprod.delta
406 setprod_delta' ~> setprod.delta'
407 setprod_empty ~> setprod.empty
408 setprod_infinite ~> setprod.infinite
409 setprod_insert ~> setprod.insert
410 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
411 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
412 setprod_mono_one_left ~> setprod.mono_neutral_left
413 setprod_mono_one_right ~> setprod.mono_neutral_right
414 setprod_reindex ~> setprod.reindex
415 setprod_reindex_cong ~> setprod.reindex_cong
416 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
417 setprod_Sigma ~> setprod.Sigma
418 setprod_subset_diff ~> setprod.subset_diff
419 setprod_timesf ~> setprod.distrib
420 setprod_Un2 ~> setprod.union_diff2
421 setprod_Un_disjoint ~> setprod.union_disjoint
422 setprod_UN_disjoint ~> setprod.UNION_disjoint
423 setprod_Un_Int ~> setprod.union_inter
424 setprod_Union_disjoint ~> setprod.Union_disjoint
425 setprod_Un_one ~> setprod.union_inter_neutral
427 Dropped setsum_cong2 (simple variant of setsum.cong).
428 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
429 Dropped setsum_reindex_id, setprod_reindex_id
430 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
434 * New internal SAT solver "cdclite" that produces models and proof
435 traces. This solver replaces the internal SAT solvers "enumerate" and
436 "dpll". Applications that explicitly used one of these two SAT
437 solvers should use "cdclite" instead. In addition, "cdclite" is now
438 the default SAT solver for the "sat" and "satx" proof methods and
439 corresponding tactics; the old default can be restored using "declare
440 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
442 * SMT module: A new version of the SMT module, temporarily called
443 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
444 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
445 supported as oracles. Yices is no longer supported, because no version
446 of the solver can handle both SMT-LIB 2 and quantifiers.
449 - Z3 can now produce Isar proofs.
451 . New SML-based learning engines eliminate the dependency on
452 Python and increase performance and reliability.
453 . MaSh and MeSh are now used by default together with the
454 traditional MePo (Meng-Paulson) relevance filter. To disable
455 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
456 Options / Isabelle / General to "none".
460 isar_compress ~> compress
465 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
466 (full_types)' instead. INCOMPATIBILITY.
468 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
470 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
472 * The symbol "\<newline>" may be used within char or string literals
473 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
475 * Activation of Z3 now works via "z3_non_commercial" system option
476 (without requiring restart), instead of former settings variable
477 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
478 Plugin Options / Isabelle / General.
480 * "declare [[code abort: ...]]" replaces "code_abort ...".
483 * "declare [[code drop: ...]]" drops all code equations associated
484 with the given constants.
486 * Abolished slightly odd global lattice interpretation for min/max.
489 min_max.inf_assoc ~> min.assoc
490 min_max.inf_commute ~> min.commute
491 min_max.inf_left_commute ~> min.left_commute
492 min_max.inf_idem ~> min.idem
493 min_max.inf_left_idem ~> min.left_idem
494 min_max.inf_right_idem ~> min.right_idem
495 min_max.sup_assoc ~> max.assoc
496 min_max.sup_commute ~> max.commute
497 min_max.sup_left_commute ~> max.left_commute
498 min_max.sup_idem ~> max.idem
499 min_max.sup_left_idem ~> max.left_idem
500 min_max.sup_inf_distrib1 ~> max_min_distrib2
501 min_max.sup_inf_distrib2 ~> max_min_distrib1
502 min_max.inf_sup_distrib1 ~> min_max_distrib2
503 min_max.inf_sup_distrib2 ~> min_max_distrib1
504 min_max.distrib ~> min_max_distribs
505 min_max.inf_absorb1 ~> min.absorb1
506 min_max.inf_absorb2 ~> min.absorb2
507 min_max.sup_absorb1 ~> max.absorb1
508 min_max.sup_absorb2 ~> max.absorb2
509 min_max.le_iff_inf ~> min.absorb_iff1
510 min_max.le_iff_sup ~> max.absorb_iff2
511 min_max.inf_le1 ~> min.cobounded1
512 min_max.inf_le2 ~> min.cobounded2
513 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
514 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
515 min_max.le_infI1 ~> min.coboundedI1
516 min_max.le_infI2 ~> min.coboundedI2
517 min_max.le_supI1 ~> max.coboundedI1
518 min_max.le_supI2 ~> max.coboundedI2
519 min_max.less_infI1 ~> min.strict_coboundedI1
520 min_max.less_infI2 ~> min.strict_coboundedI2
521 min_max.less_supI1 ~> max.strict_coboundedI1
522 min_max.less_supI2 ~> max.strict_coboundedI2
523 min_max.inf_mono ~> min.mono
524 min_max.sup_mono ~> max.mono
525 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
526 min_max.le_supI, min_max.sup_least ~> max.boundedI
527 min_max.le_inf_iff ~> min.bounded_iff
528 min_max.le_sup_iff ~> max.bounded_iff
530 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
531 min.left_commute, min.left_idem, max.commute, max.assoc,
532 max.left_commute, max.left_idem directly.
534 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
535 min.cobounded2, max.cobounded1m max.cobounded2 directly.
537 For min_ac or max_ac, prefer more general collection ac_simps.
541 * HOL-Word: bit representations prefer type bool over type bit.
544 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
545 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
547 * Code generations are provided for make, fields, extend and truncate
548 operations on records.
550 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
553 * Fact generalization and consolidation:
554 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
558 * Purely algebraic definition of even. Fact generalization and
560 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
561 even_zero_(nat|int) ~> even_zero
565 * Abolished neg_numeral.
566 - Canonical representation for minus one is "- 1".
567 - Canonical representation for other negative numbers is "- (numeral _)".
568 - When devising rule sets for number calculation, consider the
569 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
570 - HOLogic.dest_number also recognizes numerals in non-canonical forms
571 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
572 - Syntax for negative numerals is mere input syntax.
576 * Elimination of fact duplicates:
577 equals_zero_I ~> minus_unique
578 diff_eq_0_iff_eq ~> right_minus_eq
579 nat_infinite ~> infinite_UNIV_nat
580 int_infinite ~> infinite_UNIV_int
584 * Fact name consolidation:
585 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
586 minus_le_self_iff ~> neg_less_eq_nonneg
587 le_minus_self_iff ~> less_eq_neg_nonpos
588 neg_less_nonneg ~> neg_less_pos
589 less_minus_self_iff ~> less_neg_neg [simp]
593 * More simplification rules on unary and binary minus:
594 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
595 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
596 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
597 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
598 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
599 been taken away from fact collections algebra_simps and field_simps.
602 To restore proofs, the following patterns are helpful:
604 a) Arbitrary failing proof not involving "diff_def":
605 Consider simplification with algebra_simps or field_simps.
607 b) Lifting rules from addition to subtraction:
608 Try with "using <rule for addition> of [... "- _" ...]" by simp".
610 c) Simplification with "diff_def": just drop "diff_def".
611 Consider simplification with algebra_simps or field_simps;
612 or the brute way with
613 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
615 * SUP and INF generalized to conditionally_complete_lattice.
617 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
618 Conditionally_Complete_Lattices. INCOMPATIBILITY.
620 * Introduce bdd_above and bdd_below in theory
621 Conditionally_Complete_Lattices, use them instead of explicitly
622 stating boundedness of sets.
624 * ccpo.admissible quantifies only over non-empty chains to allow more
625 syntax-directed proof rules; the case of the empty chain shows up as
626 additional case in fixpoint induction proofs. INCOMPATIBILITY.
628 * Removed and renamed theorems in Series:
629 summable_le ~> suminf_le
630 suminf_le ~> suminf_le_const
631 series_pos_le ~> setsum_le_suminf
632 series_pos_less ~> setsum_less_suminf
633 suminf_ge_zero ~> suminf_nonneg
634 suminf_gt_zero ~> suminf_pos
635 suminf_gt_zero_iff ~> suminf_pos_iff
636 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
637 suminf_0_le ~> suminf_nonneg [rotate]
638 pos_summable ~> summableI_nonneg_bounded
639 ratio_test ~> summable_ratio_test
641 removed series_zero, replaced by sums_finite
643 removed auxiliary lemmas:
645 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
646 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
647 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
648 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
649 summable_convergent_sumr_iff, sumr_diff_mult_const
653 * Replace (F)DERIV syntax by has_derivative:
654 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
656 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
658 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
660 - removed constant isDiff
662 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
665 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
667 - Renamed FDERIV_... lemmas to has_derivative_...
669 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
671 - removed DERIV_intros, has_derivative_eq_intros
673 - introduced derivative_intros and deriative_eq_intros which
674 includes now rules for DERIV, has_derivative and
675 has_vector_derivative.
678 differentiable_def ~> real_differentiable_def
679 differentiableE ~> real_differentiableE
680 fderiv_def ~> has_derivative_at
681 field_fderiv_def ~> field_has_derivative_at
682 isDiff_der ~> differentiable_def
683 deriv_fderiv ~> has_field_derivative_def
684 deriv_def ~> DERIV_def
688 * Include more theorems in continuous_intros. Remove the
689 continuous_on_intros, isCont_intros collections, these facts are now
690 in continuous_intros.
692 * Theorems about complex numbers are now stated only using Re and Im,
693 the Complex constructor is not used anymore. It is possible to use
694 primcorec to defined the behaviour of a complex-valued function.
696 Removed theorems about the Complex constructor from the simpset, they
697 are available as the lemma collection legacy_Complex_simps. This
700 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
702 Instead the reverse direction is supported with
703 Complex_eq: "Complex a b = a + \<i> * b"
705 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
709 complex_Re/Im_zero ~> zero_complex.sel
710 complex_Re/Im_add ~> plus_complex.sel
711 complex_Re/Im_minus ~> uminus_complex.sel
712 complex_Re/Im_diff ~> minus_complex.sel
713 complex_Re/Im_one ~> one_complex.sel
714 complex_Re/Im_mult ~> times_complex.sel
715 complex_Re/Im_inverse ~> inverse_complex.sel
716 complex_Re/Im_scaleR ~> scaleR_complex.sel
717 complex_Re/Im_i ~> ii.sel
718 complex_Re/Im_cnj ~> cnj.sel
721 complex_divide_def ~> divide_complex_def
722 complex_norm_def ~> norm_complex_def
723 cmod_def ~> norm_complex_de
737 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
740 - Fixed soundness bug whereby mutually recursive datatypes could
741 take infinite values.
742 - Fixed soundness bug with low-level number functions such as
743 "Abs_Integ" and "Rep_Integ".
744 - Removed "std" option.
745 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
748 * HOL-Multivariate_Analysis:
749 - Type class ordered_real_vector for ordered vector spaces.
750 - New theory Complex_Basic_Analysis defining complex derivatives,
751 holomorphic functions, etc., ported from HOL Light's canal.ml.
752 - Changed order of ordered_euclidean_space to be compatible with
753 pointwise ordering on products. Therefore instance of
754 conditionally_complete_lattice and ordered_real_vector.
755 INCOMPATIBILITY: use box instead of greaterThanLessThan or
756 explicit set-comprehensions with eucl_less for other (half-)open
759 derivative_linear ~> has_derivative_bounded_linear
760 derivative_is_linear ~> has_derivative_linear
761 bounded_linear_imp_linear ~> bounded_linear.linear
764 - replaced the Lebesgue integral on real numbers by the more general
765 Bochner integral for functions into a real-normed vector space.
767 integral_zero ~> integral_zero / integrable_zero
768 integral_minus ~> integral_minus / integrable_minus
769 integral_add ~> integral_add / integrable_add
770 integral_diff ~> integral_diff / integrable_diff
771 integral_setsum ~> integral_setsum / integrable_setsum
772 integral_multc ~> integral_mult_left / integrable_mult_left
773 integral_cmult ~> integral_mult_right / integrable_mult_right
774 integral_triangle_inequality~> integral_norm_bound
775 integrable_nonneg ~> integrableI_nonneg
776 integral_positive ~> integral_nonneg_AE
777 integrable_abs_iff ~> integrable_abs_cancel
778 positive_integral_lim_INF ~> positive_integral_liminf
779 lebesgue_real_affine ~> lborel_real_affine
780 borel_integral_has_integral ~> has_integral_lebesgue_integral
781 integral_indicator ~>
782 integral_real_indicator / integrable_real_indicator
783 positive_integral_fst ~> positive_integral_fst'
784 positive_integral_fst_measurable ~> positive_integral_fst
785 positive_integral_snd_measurable ~> positive_integral_snd
787 integrable_fst_measurable ~>
788 integral_fst / integrable_fst / AE_integrable_fst
790 integrable_snd_measurable ~>
791 integral_snd / integrable_snd / AE_integrable_snd
793 integral_monotone_convergence ~>
794 integral_monotone_convergence / integrable_monotone_convergence
796 integral_monotone_convergence_at_top ~>
797 integral_monotone_convergence_at_top /
798 integrable_monotone_convergence_at_top
800 has_integral_iff_positive_integral_lebesgue ~>
801 has_integral_iff_has_bochner_integral_lebesgue_nonneg
803 lebesgue_integral_has_integral ~>
804 has_integral_integrable_lebesgue_nonneg
806 positive_integral_lebesgue_has_integral ~>
807 integral_has_integral_lebesgue_nonneg /
808 integrable_has_integral_lebesgue_nonneg
810 lebesgue_integral_real_affine ~>
811 positive_integral_real_affine
813 has_integral_iff_positive_integral_lborel ~>
814 integral_has_integral_nonneg / integrable_has_integral_nonneg
816 The following theorems where removed:
818 lebesgue_integral_nonneg
819 lebesgue_integral_uminus
820 lebesgue_integral_cmult
821 lebesgue_integral_multc
822 lebesgue_integral_cmult_nonneg
823 integral_cmul_indicator
826 - Renamed positive_integral to nn_integral:
828 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
829 positive_integral_positive ~> nn_integral_nonneg
831 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
833 - Formalized properties about exponentially, Erlang, and normal
834 distributed random variables.
836 * Removed theory src/HOL/Library/Kleene_Algebra.thy; it is subsumed by
837 session Kleene_Algebra in AFP.
842 * The signature and semantics of Document.Snapshot.cumulate_markup /
843 select_markup have been clarified. Markup is now traversed in the
844 order of reports given by the prover: later markup is usually more
845 specific and may override results accumulated so far. The elements
846 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
848 * Substantial reworking of internal PIDE protocol communication
849 channels. INCOMPATIBILITY.
854 * Moved ML_Compiler.exn_trace and other operations on exceptions to
855 structure Runtime. Minor INCOMPATIBILITY.
857 * Discontinued old Toplevel.debug in favour of system option
858 "ML_exception_trace", which may be also declared within the context
859 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
861 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
864 * Configuration option "ML_print_depth" controls the pretty-printing
865 depth of the ML compiler within the context. The old print_depth in
866 ML is still available as default_print_depth, but rarely used. Minor
869 * Proper context discipline for read_instantiate and instantiate_tac:
870 variables that are meant to become schematic need to be given as
871 fixed, and are generalized by the explicit context of local variables.
872 This corresponds to Isar attributes "where" and "of" with 'for'
873 declaration. INCOMPATIBILITY, also due to potential change of indices
874 of schematic variables.
876 * Toplevel function "use" refers to raw ML bootstrap environment,
877 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
878 Note that 'ML_file' is the canonical command to load ML files into the
881 * Proper context for basic Simplifier operations: rewrite_rule,
882 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
883 pass runtime Proof.context (and ensure that the simplified entity
884 actually belongs to it).
886 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
887 compared (according to Thm.thm_ord), but assumed to be covered by the
888 current background theory. Thus equivalent data produced in different
889 branches of the theory graph usually coincides (e.g. relevant for
890 theory merge). Note that the softer Thm.eq_thm_prop is often more
891 appropriate than Thm.eq_thm.
893 * Simplified programming interface to define ML antiquotations, see
894 structure ML_Antiquotation. Minor INCOMPATIBILITY.
896 * ML antiquotation @{here} refers to its source position, which is
897 occasionally useful for experimentation and diagnostic purposes.
899 * ML antiquotation @{path} produces a Path.T value, similarly to
900 Path.explode, but with compile-time check against the file-system and
901 some PIDE markup. Note that unlike theory source, ML does not have a
902 well-defined master directory, so an absolute symbolic path
903 specification is usually required, e.g. "~~/src/HOL".
905 * ML antiquotation @{print} inlines a function to print an arbitrary
906 ML value, which is occasionally useful for diagnostic or demonstration
912 * Proof General with its traditional helper scripts is now an optional
913 Isabelle component, e.g. ProofGeneral-4.2-2 from the Isabelle
914 component repository http://isabelle.in.tum.de/components/. See also
915 the "system" manual for general explanations about add-on components,
916 notably those that are not bundled with the normal release.
918 * The raw Isabelle process executable has been renamed from
919 "isabelle-process" to "isabelle_process", which conforms to common
920 shell naming conventions, and allows to define a shell function within
921 the Isabelle environment to avoid dynamic path lookup. Rare
922 incompatibility for old tools that do not use the $ISABELLE_PROCESS
923 settings variable yet.
925 * Former "isabelle tty" has been superseded by "isabelle console",
926 with implicit build like "isabelle jedit", and without the mostly
927 obsolete Isar TTY loop.
929 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
930 and PDF_VIEWER now refer to the actual programs, not shell
931 command-lines. Discontinued option -c: invocation may be asynchronous
932 via desktop environment, without any special precautions. Potential
933 INCOMPATIBILITY with ambitious private settings.
935 * Removed obsolete "isabelle unsymbolize". Note that the usual format
936 for email communication is the Unicode rendering of Isabelle symbols,
937 as produced by Isabelle/jEdit, for example.
939 * Removed obsolete tool "wwwfind". Similar functionality may be
940 integrated into Isabelle/jEdit eventually.
942 * Improved 'display_drafts' concerning desktop integration and
943 repeated invocation in PIDE front-end: re-use single file
944 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
946 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
947 of TeX Live from Cygwin.
949 * Session ROOT specifications require explicit 'document_files' for
950 robust dependencies on LaTeX sources. Only these explicitly given
951 files are copied to the document output directory, before document
952 processing is started.
956 New in Isabelle2013-2 (December 2013)
957 -------------------------------------
959 *** Prover IDE -- Isabelle/Scala/jEdit ***
961 * More robust editing of running commands with internal forks,
962 e.g. non-terminating 'by' steps.
964 * More relaxed Sledgehammer panel: avoid repeated application of query
965 after edits surrounding the command location.
967 * More status information about commands that are interrupted
968 accidentally (via physical event or Poly/ML runtime system signal,
974 * More robust termination of external processes managed by
975 Isabelle/ML: support cancellation of tasks within the range of
976 milliseconds, as required for PIDE document editing with automatically
977 tried tools (e.g. Sledgehammer).
979 * Reactivated Isabelle/Scala kill command for external processes on
980 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
981 workaround for some Debian/Ubuntu Linux versions from 2013.
985 New in Isabelle2013-1 (November 2013)
986 -------------------------------------
990 * Discontinued obsolete 'uses' within theory header. Note that
991 commands like 'ML_file' work without separate declaration of file
992 dependencies. Minor INCOMPATIBILITY.
994 * Discontinued redundant 'use' command, which was superseded by
995 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
997 * Simplified subscripts within identifiers, using plain \<^sub>
998 instead of the second copy \<^isub> and \<^isup>. Superscripts are
999 only for literal tokens within notation; explicit mixfix annotations
1000 for consts or fixed variables may be used as fall-back for unusual
1001 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1002 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1003 standardize symbols as a starting point for further manual cleanup.
1004 The ML reference variable "legacy_isub_isup" may be set as temporary
1005 workaround, to make the prover accept a subset of the old identifier
1008 * Document antiquotations: term style "isub" has been renamed to
1009 "sub". Minor INCOMPATIBILITY.
1011 * Uniform management of "quick_and_dirty" as system option (see also
1012 "isabelle options"), configuration option within the context (see also
1013 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1014 INCOMPATIBILITY, need to use more official Isabelle means to access
1015 quick_and_dirty, instead of historical poking into mutable reference.
1017 * Renamed command 'print_configs' to 'print_options'. Minor
1020 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1021 implicit change of some global references) is retained for now as
1022 control command, e.g. for ProofGeneral 3.7.x.
1024 * Discontinued 'print_drafts' command with its old-fashioned PS output
1025 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1026 'display_drafts' instead and print via the regular document viewer.
1028 * Updated and extended "isar-ref" and "implementation" manual,
1029 eliminated old "ref" manual.
1032 *** Prover IDE -- Isabelle/Scala/jEdit ***
1034 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1035 Documentation panel.
1037 * Dockable window "Documentation" provides access to Isabelle
1040 * Dockable window "Find" provides query operations for formal entities
1041 (GUI front-end to 'find_theorems' command).
1043 * Dockable window "Sledgehammer" manages asynchronous / parallel
1044 sledgehammer runs over existing document sources, independently of
1045 normal editing and checking process.
1047 * Dockable window "Timing" provides an overview of relevant command
1048 timing information, depending on option jedit_timing_threshold. The
1049 same timing information is shown in the extended tooltip of the
1050 command keyword, when hovering the mouse over it while the CONTROL or
1051 COMMAND modifier is pressed.
1053 * Improved dockable window "Theories": Continuous checking of proof
1054 document (visible and required parts) may be controlled explicitly,
1055 using check box or shortcut "C+e ENTER". Individual theory nodes may
1056 be marked explicitly as required and checked in full, using check box
1057 or shortcut "C+e SPACE".
1059 * Improved completion mechanism, which is now managed by the
1060 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1061 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1063 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1064 isabelle.complete for explicit completion in Isabelle sources.
1065 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1066 to resolve conflict.
1068 * Improved support of various "minor modes" for Isabelle NEWS,
1069 options, session ROOT etc., with completion and SideKick tree view.
1071 * Strictly monotonic document update, without premature cancellation of
1072 running transactions that are still needed: avoid reset/restart of
1073 such command executions while editing.
1075 * Support for asynchronous print functions, as overlay to existing
1078 * Support for automatic tools in HOL, which try to prove or disprove
1079 toplevel theorem statements.
1081 * Action isabelle.reset-font-size resets main text area font size
1082 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1083 also "Plugin Options / Isabelle / General"). It can be bound to some
1084 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1086 * File specifications in jEdit (e.g. file browser) may refer to
1087 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1088 obsolete $ISABELLE_HOME_WINDOWS variable.
1090 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1091 / Global Options / Appearance".
1093 * Improved support of native Mac OS X functionality via "MacOSX"
1094 plugin, which is now enabled by default.
1099 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1100 In particular, 'interpretation' allows for non-persistent
1101 interpretation within "context ... begin ... end" blocks offering a
1102 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1105 * Improved locales diagnostic command 'print_dependencies'.
1107 * Discontinued obsolete 'axioms' command, which has been marked as
1108 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1109 instead, while observing its uniform scope for polymorphism.
1111 * Discontinued empty name bindings in 'axiomatization'.
1114 * System option "proofs" has been discontinued. Instead the global
1115 state of Proofterm.proofs is persistently compiled into logic images
1116 as required, notably HOL-Proofs. Users no longer need to change
1117 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1119 * Syntax translation functions (print_translation etc.) always depend
1120 on Proof.context. Discontinued former "(advanced)" option -- this is
1121 now the default. Minor INCOMPATIBILITY.
1123 * Former global reference trace_unify_fail is now available as
1124 configuration option "unify_trace_failure" (global context only).
1126 * SELECT_GOAL now retains the syntactic context of the overall goal
1127 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1133 * Stronger precedence of syntax for big intersection and union on
1134 sets, in accordance with corresponding lattice operations.
1137 * Notation "{p:A. P}" now allows tuple patterns as well.
1139 * Nested case expressions are now translated in a separate check phase
1140 rather than during parsing. The data for case combinators is separated
1141 from the datatype package. The declaration attribute
1142 "case_translation" can be used to register new case combinators:
1144 declare [[case_translation case_combinator constructor1 ... constructorN]]
1147 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1149 - 'code_identifier' declares name hints for arbitrary identifiers in
1150 generated code, subsuming 'code_modulename'.
1152 See the isar-ref manual for syntax diagrams, and the HOL theories for
1155 * Attibute 'code': 'code' now declares concrete and abstract code
1156 equations uniformly. Use explicit 'code equation' and 'code abstract'
1157 to distinguish both when desired.
1159 * Discontinued theories Code_Integer and Efficient_Nat by a more
1160 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1161 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1162 generation for details. INCOMPATIBILITY.
1164 * Numeric types are mapped by default to target language numerals:
1165 natural (replaces former code_numeral) and integer (replaces former
1166 code_int). Conversions are available as integer_of_natural /
1167 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1168 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1169 ML). INCOMPATIBILITY.
1171 * Function package: For mutually recursive functions f and g, separate
1172 cases rules f.cases and g.cases are generated instead of unusable
1173 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1174 in the case that the unusable rule was used nevertheless.
1176 * Function package: For each function f, new rules f.elims are
1177 generated, which eliminate equalities of the form "f x = t".
1179 * New command 'fun_cases' derives ad-hoc elimination rules for
1180 function equations as simplified instances of f.elims, analogous to
1181 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1184 - parametrized correspondence relations are now supported:
1185 + parametricity theorems for the raw term can be specified in
1186 the command lift_definition, which allow us to generate stronger
1188 + setup_lifting generates stronger transfer rules if parametric
1189 correspondence relation can be generated
1190 + various new properties of the relator must be specified to support
1192 + parametricity theorem for the Quotient relation can be specified
1193 - setup_lifting generates domain rules for the Transfer package
1194 - stronger reflexivity prover of respectfulness theorems for type
1196 - ===> and --> are now local. The symbols can be introduced
1197 by interpreting the locale lifting_syntax (typically in an
1199 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1200 Main. Potential INCOMPATIBILITY
1201 - new commands for restoring and deleting Lifting/Transfer context:
1202 lifting_forget, lifting_update
1203 - the command print_quotmaps was renamed to print_quot_maps.
1207 - better support for domains in Transfer: replace Domainp T
1208 by the actual invariant in a transferred goal
1209 - transfer rules can have as assumptions other transfer rules
1210 - Experimental support for transferring from the raw level to the
1211 abstract level: Transfer.transferred attribute
1212 - Attribute version of the transfer method: untransferred attribute
1214 * Reification and reflection:
1215 - Reification is now directly available in HOL-Main in structure
1217 - Reflection now handles multiple lists with variables also.
1218 - The whole reflection stack has been decomposed into conversions.
1221 * Revised devices for recursive definitions over finite sets:
1222 - Only one fundamental fold combinator on finite set remains:
1223 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1224 This is now identity on infinite sets.
1225 - Locales ("mini packages") for fundamental definitions with
1226 Finite_Set.fold: folding, folding_idem.
1227 - Locales comm_monoid_set, semilattice_order_set and
1228 semilattice_neutr_order_set for big operators on sets.
1229 See theory Big_Operators for canonical examples.
1230 Note that foundational constants comm_monoid_set.F and
1231 semilattice_set.F correspond to former combinators fold_image
1232 and fold1 respectively. These are now gone. You may use
1233 those foundational constants as substitutes, but it is
1234 preferable to interpret the above locales accordingly.
1235 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1236 no longer needed in connection with Finite_Set.fold etc.)
1238 card.union_inter ~> card_Un_Int [symmetric]
1239 card.union_disjoint ~> card_Un_disjoint
1242 * Locale hierarchy for abstract orderings and (semi)lattices.
1244 * Complete_Partial_Order.admissible is defined outside the type class
1245 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1246 class predicate assumption or sort constraint when possible.
1249 * Introduce type class "conditionally_complete_lattice": Like a
1250 complete lattice but does not assume the existence of the top and
1251 bottom elements. Allows to generalize some lemmas about reals and
1252 extended reals. Removed SupInf and replaced it by the instantiation
1253 of conditionally_complete_lattice for real. Renamed lemmas about
1254 conditionally-complete lattice from Sup_... to cSup_... and from
1255 Inf_... to cInf_... to avoid hidding of similar complete lattice
1258 * Introduce type class linear_continuum as combination of
1259 conditionally-complete lattices and inner dense linorders which have
1260 more than one element. INCOMPATIBILITY.
1262 * Introduced type classes order_top and order_bot. The old classes top
1263 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1264 Rename bot -> order_bot, top -> order_top
1266 * Introduce type classes "no_top" and "no_bot" for orderings without
1267 top and bottom elements.
1269 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1271 * Complex_Main: Unify and move various concepts from
1272 HOL-Multivariate_Analysis to HOL-Complex_Main.
1274 - Introduce type class (lin)order_topology and
1275 linear_continuum_topology. Allows to generalize theorems about
1276 limits and order. Instances are reals and extended reals.
1278 - continuous and continuos_on from Multivariate_Analysis:
1279 "continuous" is the continuity of a function at a filter. "isCont"
1280 is now an abbrevitation: "isCont x f == continuous (at _) f".
1282 Generalized continuity lemmas from isCont to continuous on an
1285 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1286 compactness of closed intervals on reals. Continuous functions
1287 attain infimum and supremum on compact sets. The inverse of a
1288 continuous function is continuous, when the function is continuous
1291 - connected from Multivariate_Analysis. Use it to prove the
1292 intermediate value theorem. Show connectedness of intervals on
1293 linear_continuum_topology).
1295 - first_countable_topology from Multivariate_Analysis. Is used to
1296 show equivalence of properties on the neighbourhood filter of x and
1297 on all sequences converging to x.
1299 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1300 theorems from Library/FDERIV.thy to Deriv.thy and base the
1301 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1302 which are restricted to sets, i.e. to represent derivatives from
1305 - Removed the within-filter. It is replaced by the principal filter:
1307 F within X = inf F (principal X)
1309 - Introduce "at x within U" as a single constant, "at x" is now an
1310 abbreviation for "at x within UNIV"
1312 - Introduce named theorem collections tendsto_intros,
1313 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1314 in tendsto_intros (or FDERIV_intros) are also available as
1315 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1316 is replaced by a congruence rule. This allows to apply them as
1317 intro rules and then proving equivalence by the simplifier.
1319 - Restructured theories in HOL-Complex_Main:
1321 + Moved RealDef and RComplete into Real
1323 + Introduced Topological_Spaces and moved theorems about
1324 topological spaces, filters, limits and continuity to it
1326 + Renamed RealVector to Real_Vector_Spaces
1328 + Split Lim, SEQ, Series into Topological_Spaces,
1329 Real_Vector_Spaces, and Limits
1331 + Moved Ln and Log to Transcendental
1333 + Moved theorems about continuity from Deriv to Topological_Spaces
1335 - Remove various auxiliary lemmas.
1340 - Added option "spy".
1341 - Reduce incidence of "too high arity" errors.
1345 isar_shrink ~> isar_compress
1347 - Added options "isar_try0", "spy".
1348 - Better support for "isar_proofs".
1349 - MaSh has been fined-tuned and now runs as a local server.
1351 * Improved support for ad hoc overloading of constants (see also
1352 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1354 * Library/Polynomial.thy:
1355 - Use lifting for primitive definitions.
1356 - Explicit conversions from and to lists of coefficients, used for
1358 - Replaced recursion operator poly_rec by fold_coeffs.
1359 - Prefer pre-existing gcd operation for gcd.
1361 poly_eq_iff ~> poly_eq_poly_eq_iff
1362 poly_ext ~> poly_eqI
1363 expand_poly_eq ~> poly_eq_iff
1366 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1367 case_of_simps to convert function definitions between a list of
1368 equations with patterns on the lhs and a single equation with case
1369 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1371 * New Library/FSet.thy: type of finite sets defined as a subtype of
1372 sets defined by Lifting/Transfer.
1374 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1376 * Consolidation of library theories on product orders:
1378 Product_Lattice ~> Product_Order -- pointwise order on products
1379 Product_ord ~> Product_Lexorder -- lexicographic order on products
1383 * Imperative-HOL: The MREC combinator is considered legacy and no
1384 longer included by default. INCOMPATIBILITY, use partial_function
1385 instead, or import theory Legacy_Mrec as a fallback.
1387 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1388 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1389 ~~/src/HOL/Library/Polynomial instead. The latter provides
1390 integration with HOL's type classes for rings. INCOMPATIBILITY.
1393 - Various improvements to BNF-based (co)datatype package, including
1394 new commands "primrec_new", "primcorec", and
1395 "datatype_new_compat", as well as documentation. See
1396 "datatypes.pdf" for details.
1397 - New "coinduction" method to avoid some boilerplate (compared to
1400 data ~> datatype_new
1401 codata ~> codatatype
1403 - Renamed many generated theorems, including
1405 map_comp' ~> map_comp
1415 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1416 "check_property" allows to check specifications of the form "ALL x y
1417 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1418 Examples.thy in particular.
1420 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1421 tracing output in the command transaction context instead of physical
1422 stdout. See also Toplevel.debug, Toplevel.debugging and
1423 ML_Compiler.exn_trace.
1425 * ML type "theory" is now immutable, without any special treatment of
1426 drafts or linear updates (which could lead to "stale theory" errors in
1427 the past). Discontinued obsolete operations like Theory.copy,
1428 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1431 * More uniform naming of goal functions for skipped proofs:
1433 Skip_Proof.prove ~> Goal.prove_sorry
1434 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1436 Minor INCOMPATIBILITY.
1438 * Simplifier tactics and tools use proper Proof.context instead of
1439 historic type simpset. Old-style declarations like addsimps,
1440 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1441 retains its use as snapshot of the main Simplifier context, using
1442 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1443 old tools by making them depend on (ctxt : Proof.context) instead of
1444 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1446 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1447 operate on Proof.context instead of claset, for uniformity with addIs,
1448 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1449 clasets separately from the context.
1451 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1452 INCOMPATIBILITY, use @{context} instead.
1454 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1455 presents the result as initial Proof.context.
1460 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1461 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1463 * Discontinued obsolete isabelle-process options -f and -u (former
1464 administrative aliases of option -e). Minor INCOMPATIBILITY.
1466 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1469 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1470 document formats: dvi.gz, ps, ps.gz -- the default document format is
1473 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1474 specify global resources of the JVM process run by isabelle build.
1476 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1477 to run Isabelle/Scala source files as standalone programs.
1479 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1480 keyword tables): use Isabelle/Scala operations, which inspect outer
1481 syntax without requiring to build sessions first.
1483 * Sessions may be organized via 'chapter' specifications in the ROOT
1484 file, which determines a two-level hierarchy of browser info. The old
1485 tree-like organization via implicit sub-session relation (with its
1486 tendency towards erratic fluctuation of URLs) has been discontinued.
1487 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1488 for HTML presentation of theories.
1492 New in Isabelle2013 (February 2013)
1493 -----------------------------------
1497 * Theorem status about oracles and unfinished/failed future proofs is
1498 no longer printed by default, since it is incompatible with
1499 incremental / parallel checking of the persistent document model. ML
1500 function Thm.peek_status may be used to inspect a snapshot of the
1501 ongoing evaluation process. Note that in batch mode --- notably
1502 isabelle build --- the system ensures that future proofs of all
1503 accessible theorems in the theory context are finished (as before).
1505 * Configuration option show_markup controls direct inlining of markup
1506 into the printed representation of formal entities --- notably type
1507 and sort constraints. This enables Prover IDE users to retrieve that
1508 information via tooltips in the output window, for example.
1510 * Command 'ML_file' evaluates ML text from a file directly within the
1511 theory, without any predeclaration via 'uses' in the theory header.
1513 * Old command 'use' command and corresponding keyword 'uses' in the
1514 theory header are legacy features and will be discontinued soon.
1515 Tools that load their additional source files may imitate the
1516 'ML_file' implementation, such that the system can take care of
1517 dependencies properly.
1519 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1520 is called fastforce / fast_force_tac already since Isabelle2011-1.
1522 * Updated and extended "isar-ref" and "implementation" manual, reduced
1523 remaining material in old "ref" manual.
1525 * Improved support for auxiliary contexts that indicate block structure
1526 for specifications. Nesting of "context fixes ... context assumes ..."
1527 and "class ... context ...".
1529 * Attribute "consumes" allows a negative value as well, which is
1530 interpreted relatively to the total number of premises of the rule in
1531 the target context. This form of declaration is stable when exported
1532 from a nested 'context' with additional assumptions. It is the
1533 preferred form for definitional packages, notably cases/rules produced
1534 in HOL/inductive and HOL/function.
1536 * More informative error messages for Isar proof commands involving
1537 lazy enumerations (method applications etc.).
1539 * Refined 'help' command to retrieve outer syntax commands according
1540 to name patterns (with clickable results).
1543 *** Prover IDE -- Isabelle/Scala/jEdit ***
1545 * Parallel terminal proofs ('by') are enabled by default, likewise
1546 proofs that are built into packages like 'datatype', 'function'. This
1547 allows to "run ahead" checking the theory specifications on the
1548 surface, while the prover is still crunching on internal
1549 justifications. Unfinished / cancelled proofs are restarted as
1550 required to complete full proof checking eventually.
1552 * Improved output panel with tooltips, hyperlinks etc. based on the
1553 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1554 tooltips leads to some window that supports the same recursively,
1555 which can lead to stacks of tooltips as the semantic document content
1556 is explored. ESCAPE closes the whole stack, individual windows may be
1557 closed separately, or detached to become independent jEdit dockables.
1559 * Improved support for commands that produce graph output: the text
1560 message contains a clickable area to open a new instance of the graph
1563 * More robust incremental parsing of outer syntax (partial comments,
1564 malformed symbols). Changing the balance of open/close quotes and
1565 comment delimiters works more conveniently with unfinished situations
1566 that frequently occur in user interaction.
1568 * More efficient painting and improved reactivity when editing large
1569 files. More scalable management of formal document content.
1571 * Smarter handling of tracing messages: prover process pauses after
1572 certain number of messages per command transaction, with some user
1573 dialog to stop or continue. This avoids swamping the front-end with
1574 potentially infinite message streams.
1576 * More plugin options and preferences, based on Isabelle/Scala. The
1577 jEdit plugin option panel provides access to some Isabelle/Scala
1578 options, including tuning parameters for editor reactivity and color
1581 * Dockable window "Symbols" provides some editing support for Isabelle
1584 * Dockable window "Monitor" shows ML runtime statistics. Note that
1585 continuous display of the chart slows down the system.
1587 * Improved editing support for control styles: subscript, superscript,
1588 bold, reset of style -- operating on single symbols or text
1589 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1591 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1592 adjust the main text area font size, and its derivatives for output,
1593 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1594 need to be adapted to local keyboard layouts.
1596 * More reactive completion popup by default: use \t (TAB) instead of
1597 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1598 also "Plugin Options / SideKick / General / Code Completion Options".
1600 * Implicit check and build dialog of the specified logic session
1601 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1602 demand, without bundling big platform-dependent heap images in the
1603 Isabelle distribution.
1605 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1606 from Oracle provide better multi-platform experience. This version is
1607 now bundled exclusively with Isabelle.
1612 * Code generation for Haskell: restrict unqualified imports from
1613 Haskell Prelude to a small set of fundamental operations.
1615 * Command 'export_code': relative file names are interpreted
1616 relatively to master directory of current theory rather than the
1617 rather arbitrary current working directory. INCOMPATIBILITY.
1619 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1620 use regular rule composition via "OF" / "THEN", or explicit proof
1621 structure instead. Note that Isabelle/ML provides a variety of
1622 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1623 with some care where this is really required.
1625 * Command 'typ' supports an additional variant with explicit sort
1626 constraint, to infer and check the most general type conforming to a
1627 given sort. Example (in HOL):
1629 typ "_ * _ * bool * unit" :: finite
1631 * Command 'locale_deps' visualizes all locales and their relations as
1639 - Added MaSh relevance filter based on machine-learning; see the
1640 Sledgehammer manual for details.
1641 - Polished Isar proofs generated with "isar_proofs" option.
1642 - Rationalized type encodings ("type_enc" option).
1643 - Renamed "kill_provers" subcommand to "kill_all".
1645 isar_proof ~> isar_proofs
1646 isar_shrink_factor ~> isar_shrink
1647 max_relevant ~> max_facts
1648 relevance_thresholds ~> fact_thresholds
1650 * Quickcheck: added an optimisation for equality premises. It is
1651 switched on by default, and can be switched off by setting the
1652 configuration quickcheck_optimise_equality to false.
1654 * Quotient: only one quotient can be defined by quotient_type
1658 - generation of an abstraction function equation in lift_definition
1659 - quot_del attribute
1660 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1662 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1665 * Preprocessing of the code generator rewrites set comprehensions into
1666 pointfree expressions.
1668 * The SMT solver Z3 has now by default a restricted set of directly
1669 supported features. For the full set of features (div/mod, nonlinear
1670 arithmetic, datatypes/records) with potential proof reconstruction
1671 failures, enable the configuration option "z3_with_extensions". Minor
1674 * Simplified 'typedef' specifications: historical options for implicit
1675 set definition and alternative name have been discontinued. The
1676 former behavior of "typedef (open) t = A" is now the default, but
1677 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1680 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1681 directly. INCOMPATIBILITY.
1683 * Moved operation product, sublists and n_lists from theory Enum to
1684 List. INCOMPATIBILITY.
1686 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1688 * Class "comm_monoid_diff" formalises properties of bounded
1689 subtraction, with natural numbers and multisets as typical instances.
1691 * Added combinator "Option.these" with type "'a option set => 'a set".
1693 * Theory "Transitive_Closure": renamed lemmas
1695 reflcl_tranclp -> reflclp_tranclp
1696 rtranclp_reflcl -> rtranclp_reflclp
1700 * Theory "Rings": renamed lemmas (in class semiring)
1702 left_distrib ~> distrib_right
1703 right_distrib ~> distrib_left
1707 * Generalized the definition of limits:
1709 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1710 expresses that when the input values x converge to F then the
1711 output f x converges to G.
1713 - Added filters for convergence to positive (at_top) and negative
1716 - Moved infinity in the norm (at_infinity) from
1717 Multivariate_Analysis to Complex_Main.
1719 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1724 * Theory "Library/Option_ord" provides instantiation of option type to
1725 lattice type classes.
1727 * Theory "Library/Multiset": renamed
1729 constant fold_mset ~> Multiset.fold
1730 fact fold_mset_commute ~> fold_mset_comm
1734 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1737 - Renamed constants (and related lemmas)
1740 strict_prefix ~> prefix
1742 - Replaced constant "postfix" by "suffixeq" with swapped argument
1743 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1744 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1745 Renamed lemmas accordingly.
1747 - Added constant "list_hembeq" for homeomorphic embedding on
1748 lists. Added abbreviation "sublisteq" for special case
1749 "list_hembeq (op =)".
1751 - Theory Library/Sublist no longer provides "order" and "bot" type
1752 class instances for the prefix order (merely corresponding locale
1753 interpretations). The type class instances are now in theory
1754 Library/Prefix_Order.
1756 - The sublist relation of theory Library/Sublist_Order is now based
1757 on "Sublist.sublisteq". Renamed lemmas accordingly:
1759 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1760 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1761 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1762 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1763 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1764 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1765 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1766 le_list_drop_many ~> Sublist.sublisteq_drop_many
1767 le_list_filter_left ~> Sublist.sublisteq_filter_left
1768 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1769 le_list_rev_take_iff ~> Sublist.sublisteq_append
1770 le_list_same_length ~> Sublist.sublisteq_same_length
1771 le_list_take_many_iff ~> Sublist.sublisteq_append'
1772 less_eq_list.drop ~> less_eq_list_drop
1773 less_eq_list.induct ~> less_eq_list_induct
1774 not_le_list_length ~> Sublist.not_sublisteq_length
1778 * New theory Library/Countable_Set.
1780 * Theory Library/Debug and Library/Parallel provide debugging and
1781 parallel execution for code generated towards Isabelle/ML.
1783 * Theory Library/FuncSet: Extended support for Pi and extensional and
1784 introduce the extensional dependent function space "PiE". Replaced
1785 extensional_funcset by an abbreviation, and renamed lemmas from
1786 extensional_funcset to PiE as follows:
1788 extensional_empty ~> PiE_empty
1789 extensional_funcset_empty_domain ~> PiE_empty_domain
1790 extensional_funcset_empty_range ~> PiE_empty_range
1791 extensional_funcset_arb ~> PiE_arb
1792 extensional_funcset_mem ~> PiE_mem
1793 extensional_funcset_extend_domainI ~> PiE_fun_upd
1794 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1795 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1796 card_extensional_funcset ~> card_PiE
1797 finite_extensional_funcset ~> finite_PiE
1801 * Theory Library/FinFun: theory of almost everywhere constant
1802 functions (supersedes the AFP entry "Code Generation for Functions as
1805 * Theory Library/Phantom: generic phantom type to make a type
1806 parameter appear in a constant's type. This alternative to adding
1807 TYPE('a) as another parameter avoids unnecessary closures in generated
1810 * Theory Library/RBT_Impl: efficient construction of red-black trees
1811 from sorted associative lists. Merging two trees with rbt_union may
1812 return a structurally different tree than before. Potential
1815 * Theory Library/IArray: immutable arrays with code generation.
1817 * Theory Library/Finite_Lattice: theory of finite lattices.
1819 * HOL/Multivariate_Analysis: replaced
1821 "basis :: 'a::euclidean_space => nat => real"
1822 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1824 on euclidean spaces by using the inner product "_ \<bullet> _" with
1825 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1826 "SUM i : Basis. f i * r i".
1828 With this change the following constants are also changed or removed:
1830 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1831 a $$ i ~> inner a i (where i : Basis)
1833 \<pi>, \<pi>' removed
1835 Theorems about these constants where removed.
1839 component_le_norm ~> Basis_le_norm
1840 euclidean_eq ~> euclidean_eq_iff
1841 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1842 euclidean_simps ~> inner_simps
1843 independent_basis ~> independent_Basis
1844 span_basis ~> span_Basis
1845 in_span_basis ~> in_span_Basis
1846 norm_bound_component_le ~> norm_boound_Basis_le
1847 norm_bound_component_lt ~> norm_boound_Basis_lt
1848 component_le_infnorm ~> Basis_le_infnorm
1854 - Added simproc "measurable" to automatically prove measurability.
1856 - Added induction rules for sigma sets with disjoint union
1857 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1858 (borel_measurable_induct).
1860 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1863 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1864 AFP entry "Ordinals_and_Cardinals").
1866 * HOL/BNF: New (co)datatype package based on bounded natural functors
1867 with support for mixed, nested recursion and interesting non-free
1870 * HOL/Finite_Set and Relation: added new set and relation operations
1871 expressed by Finite_Set.fold.
1873 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1874 trees for the code generator.
1876 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1878 possible INCOMPATIBILITY.
1880 * HOL/Set: renamed Set.project -> Set.filter
1884 *** Document preparation ***
1886 * Dropped legacy antiquotations "term_style" and "thm_style", since
1887 styles may be given as arguments to "term" and "thm" already.
1888 Discontinued legacy styles "prem1" .. "prem19".
1890 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1891 instead of slightly exotic babel/greek.
1893 * Document variant NAME may use different LaTeX entry point
1894 document/root_NAME.tex if that file exists, instead of the common
1897 * Simplified custom document/build script, instead of old-style
1898 document/IsaMakefile. Minor INCOMPATIBILITY.
1903 * The default limit for maximum number of worker threads is now 8,
1904 instead of 4, in correspondence to capabilities of contemporary
1905 hardware and Poly/ML runtime system.
1907 * Type Seq.results and related operations support embedded error
1908 messages within lazy enumerations, and thus allow to provide
1909 informative errors in the absence of any usable results.
1911 * Renamed Position.str_of to Position.here to emphasize that this is a
1912 formal device to inline positions into message text, but not
1913 necessarily printing visible text.
1918 * Advanced support for Isabelle sessions and build management, see
1919 "system" manual for the chapter of that name, especially the "isabelle
1920 build" tool and its examples. The "isabelle mkroot" tool prepares
1921 session root directories for use with "isabelle build", similar to
1922 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1923 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1924 mkdir / make are rendered obsolete.
1926 * Discontinued obsolete Isabelle/build script, it is superseded by the
1927 regular isabelle build tool. For example:
1929 isabelle build -s -b HOL
1931 * Discontinued obsolete "isabelle makeall".
1933 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1934 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1935 provides some traditional targets that invoke "isabelle build". Note
1936 that this is inefficient! Applications of Isabelle/HOL involving
1937 "isabelle make" should be upgraded to use "isabelle build" directly.
1939 * The "isabelle options" tool prints Isabelle system options, as
1940 required for "isabelle build", for example.
1942 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1943 Minor INCOMPATIBILITY in command-line options.
1945 * The "isabelle install" tool has now a simpler command-line. Minor
1948 * The "isabelle components" tool helps to resolve add-on components
1949 that are not bundled, or referenced from a bare-bones repository
1950 version of Isabelle.
1952 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1953 platform family: "linux", "macos", "windows".
1955 * The ML system is configured as regular component, and no longer
1956 picked up from some surrounding directory. Potential INCOMPATIBILITY
1957 for home-made settings.
1959 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1961 * Discontinued support for Poly/ML 5.2.1, which was the last version
1962 without exception positions and advanced ML compiler/toplevel
1965 * Discontinued special treatment of Proof General -- no longer guess
1966 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1967 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1968 settings manually, or use a Proof General version that has been
1969 bundled as Isabelle component.
1973 New in Isabelle2012 (May 2012)
1974 ------------------------------
1978 * Prover IDE (PIDE) improvements:
1980 - more robust Sledgehammer integration (as before the sledgehammer
1981 command-line needs to be typed into the source buffer)
1982 - markup for bound variables
1983 - markup for types of term variables (displayed as tooltips)
1984 - support for user-defined Isar commands within the running session
1985 - improved support for Unicode outside original 16bit range
1986 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1988 * Forward declaration of outer syntax keywords within the theory
1989 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1990 commands to be used in the same theory where defined.
1992 * Auxiliary contexts indicate block structure for specifications with
1993 additional parameters and assumptions. Such unnamed contexts may be
1994 nested within other targets, like 'theory', 'locale', 'class',
1995 'instantiation' etc. Results from the local context are generalized
1996 accordingly and applied to the enclosing target context. Example:
2000 assumes xy: "x = y" and yz: "y = z"
2003 lemma my_trans: "x = z" using xy yz by simp
2009 The most basic application is to factor-out context elements of
2010 several fixes/assumes/shows theorem statements, e.g. see
2011 ~~/src/HOL/Isar_Examples/Group_Context.thy
2013 Any other local theory specification element works within the "context
2014 ... begin ... end" block as well.
2016 * Bundled declarations associate attributed fact expressions with a
2017 given name in the context. These may be later included in other
2018 contexts. This allows to manage context extensions casually, without
2019 the logical dependencies of locales and locale interpretation. See
2020 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2022 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2023 declaration, and results are standardized before being stored. Thus
2024 old-style "standard" after instantiation or composition of facts
2025 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2026 indices of schematic variables.
2028 * Rule attributes in local theory declarations (e.g. locale or class)
2029 are now statically evaluated: the resulting theorem is stored instead
2030 of the original expression. INCOMPATIBILITY in rare situations, where
2031 the historic accident of dynamic re-evaluation in interpretations
2034 * New tutorial "Programming and Proving in Isabelle/HOL"
2035 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2036 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2037 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2038 Logic" as the recommended beginners tutorial, but does not cover all
2039 of the material of that old tutorial.
2041 * Updated and extended reference manuals: "isar-ref",
2042 "implementation", "system"; reduced remaining material in old "ref"
2048 * Command 'definition' no longer exports the foundational "raw_def"
2049 into the user context. Minor INCOMPATIBILITY, may use the regular
2050 "def" result with attribute "abs_def" to imitate the old version.
2052 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2053 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2054 expand it. This also works for object-logic equality. (Formerly
2055 undocumented feature.)
2057 * Sort constraints are now propagated in simultaneous statements, just
2058 like type constraints. INCOMPATIBILITY in rare situations, where
2059 distinct sorts used to be assigned accidentally. For example:
2061 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2063 lemma "P (x::'a)" and "Q (y::'a::bar)"
2064 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2066 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2067 tolerant against multiple unifiers, as long as the final result is
2068 unique. (As before, rules are composed in canonical right-to-left
2069 order to accommodate newly introduced premises.)
2071 * Renamed some inner syntax categories:
2077 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2078 "num_position" etc. are mainly used instead (which also include
2079 position information via constraints).
2081 * Simplified configuration options for syntax ambiguity: see
2082 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2083 manual. Minor INCOMPATIBILITY.
2085 * Discontinued configuration option "syntax_positions": atomic terms
2086 in parse trees are always annotated by position constraints.
2088 * Old code generator for SML and its commands 'code_module',
2089 'code_library', 'consts_code', 'types_code' have been discontinued.
2090 Use commands of the generic code generator instead. INCOMPATIBILITY.
2092 * Redundant attribute "code_inline" has been discontinued. Use
2093 "code_unfold" instead. INCOMPATIBILITY.
2095 * Dropped attribute "code_unfold_post" in favor of the its dual
2096 "code_abbrev", which yields a common pattern in definitions like
2098 definition [code_abbrev]: "f = t"
2102 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2103 instead. INCOMPATIBILITY.
2105 * Discontinued old "prems" fact, which used to refer to the accidental
2106 collection of foundational premises in the context (already marked as
2107 legacy since Isabelle2011).
2112 * Type 'a set is now a proper type constructor (just as before
2113 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2114 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2115 sets separate, it is often sufficient to rephrase some set S that has
2116 been accidentally used as predicates by "%x. x : S", and some
2117 predicate P that has been accidentally used as set by "{x. P x}".
2118 Corresponding proofs in a first step should be pruned from any
2119 tinkering with former theorems mem_def and Collect_def as far as
2122 For developments which deliberately mix predicates and sets, a
2123 planning step is necessary to determine what should become a predicate
2124 and what a set. It can be helpful to carry out that step in
2125 Isabelle2011-1 before jumping right into the current release.
2127 * Code generation by default implements sets as container type rather
2128 than predicates. INCOMPATIBILITY.
2130 * New type synonym 'a rel = ('a * 'a) set
2132 * The representation of numerals has changed. Datatype "num"
2133 represents strictly positive binary numerals, along with functions
2134 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2135 positive and negated numeric literals, respectively. See also
2136 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2137 user theories may require adaptations as follows:
2139 - Theorems with number_ring or number_semiring constraints: These
2140 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2142 - Theories defining numeric types: Remove number, number_semiring,
2143 and number_ring instances. Defer all theorems about numerals until
2144 after classes one and semigroup_add have been instantiated.
2146 - Numeral-only simp rules: Replace each rule having a "number_of v"
2147 pattern with two copies, one for numeral and one for neg_numeral.
2149 - Theorems about subclasses of semiring_1 or ring_1: These classes
2150 automatically support numerals now, so more simp rules and
2151 simprocs may now apply within the proof.
2153 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2154 Redefine using other integer operations.
2156 * Transfer: New package intended to generalize the existing
2157 "descending" method and related theorem attributes from the Quotient
2158 package. (Not all functionality is implemented yet, but future
2159 development will focus on Transfer as an eventual replacement for the
2160 corresponding parts of the Quotient package.)
2162 - transfer_rule attribute: Maintains a collection of transfer rules,
2163 which relate constants at two different types. Transfer rules may
2164 relate different type instances of the same polymorphic constant,
2165 or they may relate an operation on a raw type to a corresponding
2166 operation on an abstract type (quotient or subtype). For example:
2168 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2169 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2171 - transfer method: Replaces a subgoal on abstract types with an
2172 equivalent subgoal on the corresponding raw types. Constants are
2173 replaced with corresponding ones according to the transfer rules.
2174 Goals are generalized over all free variables by default; this is
2175 necessary for variables whose types change, but can be overridden
2176 for specific variables with e.g. "transfer fixing: x y z". The
2177 variant transfer' method allows replacing a subgoal with one that
2178 is logically stronger (rather than equivalent).
2180 - relator_eq attribute: Collects identity laws for relators of
2181 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2182 transfer method uses these lemmas to infer transfer rules for
2183 non-polymorphic constants on the fly.
2185 - transfer_prover method: Assists with proving a transfer rule for a
2186 new constant, provided the constant is defined in terms of other
2187 constants that already have transfer rules. It should be applied
2188 after unfolding the constant definitions.
2190 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2191 from type nat to type int.
2193 * Lifting: New package intended to generalize the quotient_definition
2194 facility of the Quotient package; designed to work with Transfer.
2196 - lift_definition command: Defines operations on an abstract type in
2197 terms of a corresponding operation on a representation
2198 type. Example syntax:
2200 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2203 Users must discharge a respectfulness proof obligation when each
2204 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2205 the proof is discharged automatically.) The obligation is
2206 presented in a user-friendly, readable form; a respectfulness
2207 theorem in the standard format and a transfer rule are generated
2210 - Integration with code_abstype: For typedefs (e.g. subtypes
2211 corresponding to a datatype invariant, such as dlist),
2212 lift_definition generates a code certificate theorem and sets up
2213 code generation for each constant.
2215 - setup_lifting command: Sets up the Lifting package to work with a
2216 user-defined type. The user must provide either a quotient theorem
2217 or a type_definition theorem. The package configures transfer
2218 rules for equality and quantifiers on the type, and sets up the
2219 lift_definition command to work with the type.
2221 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2222 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2223 Word/Word.thy and Library/Float.thy.
2227 - The 'quotient_type' command now supports a 'morphisms' option with
2228 rep and abs functions, similar to typedef.
2230 - 'quotient_type' sets up new types to work with the Lifting and
2231 Transfer packages, as with 'setup_lifting'.
2233 - The 'quotient_definition' command now requires the user to prove a
2234 respectfulness property at the point where the constant is
2235 defined, similar to lift_definition; INCOMPATIBILITY.
2237 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2238 accordingly, INCOMPATIBILITY.
2240 * New diagnostic command 'find_unused_assms' to find potentially
2241 superfluous assumptions in theorems using Quickcheck.
2245 - Quickcheck returns variable assignments as counterexamples, which
2246 allows to reveal the underspecification of functions under test.
2247 For example, refuting "hd xs = x", it presents the variable
2248 assignment xs = [] and x = a1 as a counterexample, assuming that
2249 any property is false whenever "hd []" occurs in it.
2251 These counterexample are marked as potentially spurious, as
2252 Quickcheck also returns "xs = []" as a counterexample to the
2253 obvious theorem "hd xs = hd xs".
2255 After finding a potentially spurious counterexample, Quickcheck
2256 continues searching for genuine ones.
2258 By default, Quickcheck shows potentially spurious and genuine
2259 counterexamples. The option "genuine_only" sets quickcheck to only
2260 show genuine counterexamples.
2262 - The command 'quickcheck_generator' creates random and exhaustive
2263 value generators for a given type and operations.
2265 It generates values by using the operations as if they were
2266 constructors of that type.
2268 - Support for multisets.
2270 - Added "use_subtype" options.
2272 - Added "quickcheck_locale" configuration to specify how to process
2273 conjectures in a locale context.
2275 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2276 and affecting 'rat' and 'real'.
2279 - Integrated more tightly with SPASS, as described in the ITP 2012
2280 paper "More SPASS with Isabelle".
2281 - Made it try "smt" as a fallback if "metis" fails or times out.
2282 - Added support for the following provers: Alt-Ergo (via Why3 and
2283 TFF1), iProver, iProver-Eq.
2284 - Sped up the minimizer.
2285 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2286 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2287 - Renamed "sound" option to "strict".
2289 * Metis: Added possibility to specify lambda translations scheme as a
2290 parenthesized argument (e.g., "by (metis (lifting) ...)").
2292 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2294 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2296 * New "case_product" attribute to generate a case rule doing multiple
2297 case distinctions at the same time. E.g.
2299 list.exhaust [case_product nat.exhaust]
2301 produces a rule which can be used to perform case distinction on both
2304 * New "eventually_elim" method as a generalized variant of the
2305 eventually_elim* rules. Supports structured proofs.
2307 * Typedef with implicit set definition is considered legacy. Use
2308 "typedef (open)" form instead, which will eventually become the
2311 * Record: code generation can be switched off manually with
2313 declare [[record_coden = false]] -- "default true"
2315 * Datatype: type parameters allow explicit sort constraints.
2317 * Concrete syntax for case expressions includes constraints for source
2318 positions, and thus produces Prover IDE markup for its bindings.
2319 INCOMPATIBILITY for old-style syntax translations that augment the
2320 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2323 * Clarified attribute "mono_set": pure declaration without modifying
2324 the result of the fact expression.
2326 * More default pred/set conversions on a couple of relation operations
2327 and predicates. Added powers of predicate relations. Consolidation
2328 of some relation theorems:
2330 converse_def ~> converse_unfold
2331 rel_comp_def ~> relcomp_unfold
2332 symp_def ~> (modified, use symp_def and sym_def instead)
2333 transp_def ~> transp_trans
2334 Domain_def ~> Domain_unfold
2335 Range_def ~> Domain_converse [symmetric]
2337 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2339 See theory "Relation" for examples for making use of pred/set
2340 conversions by means of attributes "to_set" and "to_pred".
2344 * Renamed facts about the power operation on relations, i.e., relpow
2345 to match the constant's name:
2347 rel_pow_1 ~> relpow_1
2348 rel_pow_0_I ~> relpow_0_I
2349 rel_pow_Suc_I ~> relpow_Suc_I
2350 rel_pow_Suc_I2 ~> relpow_Suc_I2
2351 rel_pow_0_E ~> relpow_0_E
2352 rel_pow_Suc_E ~> relpow_Suc_E
2353 rel_pow_E ~> relpow_E
2354 rel_pow_Suc_D2 ~> relpow_Suc_D2
2355 rel_pow_Suc_E2 ~> relpow_Suc_E2
2356 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2357 rel_pow_E2 ~> relpow_E2
2358 rel_pow_add ~> relpow_add
2359 rel_pow_commute ~> relpow
2360 rel_pow_empty ~> relpow_empty:
2361 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2362 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2363 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2364 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2365 rel_pow_fun_conv ~> relpow_fun_conv
2366 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2367 rel_pow_finite_bounded ~> relpow_finite_bounded
2368 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2369 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2370 single_valued_rel_pow ~> single_valued_relpow
2374 * Theory Relation: Consolidated constant name for relation composition
2375 and corresponding theorem names:
2377 - Renamed constant rel_comp to relcomp.
2379 - Dropped abbreviation pred_comp. Use relcompp instead.
2383 rel_compI ~> relcompI
2384 rel_compEpair ~> relcompEpair
2385 rel_compE ~> relcompE
2386 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2387 rel_comp_empty1 ~> relcomp_empty1
2388 rel_comp_mono ~> relcomp_mono
2389 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2390 rel_comp_distrib ~> relcomp_distrib
2391 rel_comp_distrib2 ~> relcomp_distrib2
2392 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2393 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2394 single_valued_rel_comp ~> single_valued_relcomp
2395 rel_comp_def ~> relcomp_unfold
2396 converse_rel_comp ~> converse_relcomp
2397 pred_compI ~> relcomppI
2398 pred_compE ~> relcomppE
2399 pred_comp_bot1 ~> relcompp_bot1
2400 pred_comp_bot2 ~> relcompp_bot2
2401 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2402 pred_comp_mono ~> relcompp_mono
2403 pred_comp_distrib ~> relcompp_distrib
2404 pred_comp_distrib2 ~> relcompp_distrib2
2405 converse_pred_comp ~> converse_relcompp
2407 finite_rel_comp ~> finite_relcomp
2409 set_rel_comp ~> set_relcomp
2413 * Theory Divides: Discontinued redundant theorems about div and mod.
2414 INCOMPATIBILITY, use the corresponding generic theorems instead.
2416 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2417 zdiv_self ~> div_self
2418 zmod_self ~> mod_self
2421 zdiv_zmod_equality ~> div_mod_equality2
2422 zdiv_zmod_equality2 ~> div_mod_equality
2423 zmod_zdiv_trivial ~> mod_div_trivial
2424 zdiv_zminus_zminus ~> div_minus_minus
2425 zmod_zminus_zminus ~> mod_minus_minus
2426 zdiv_zminus2 ~> div_minus_right
2427 zmod_zminus2 ~> mod_minus_right
2428 zdiv_minus1_right ~> div_minus1_right
2429 zmod_minus1_right ~> mod_minus1_right
2430 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2431 zmod_zmult1_eq ~> mod_mult_right_eq
2432 zpower_zmod ~> power_mod
2433 zdvd_zmod ~> dvd_mod
2434 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2435 mod_mult_distrib ~> mult_mod_left
2436 mod_mult_distrib2 ~> mult_mod_right
2438 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2439 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2441 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2443 * Consolidated theorem names concerning fold combinators:
2445 inf_INFI_fold_inf ~> inf_INF_fold_inf
2446 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2447 INFI_fold_inf ~> INF_fold_inf
2448 SUPR_fold_sup ~> SUP_fold_sup
2449 union_set ~> union_set_fold
2450 minus_set ~> minus_set_fold
2451 INFI_set_fold ~> INF_set_fold
2452 SUPR_set_fold ~> SUP_set_fold
2453 INF_code ~> INF_set_foldr
2454 SUP_code ~> SUP_set_foldr
2455 foldr.simps ~> foldr.simps (in point-free formulation)
2456 foldr_fold_rev ~> foldr_conv_fold
2457 foldl_fold ~> foldl_conv_fold
2458 foldr_foldr ~> foldr_conv_foldl
2459 foldl_foldr ~> foldl_conv_foldr
2460 fold_set_remdups ~> fold_set_fold_remdups
2461 fold_set ~> fold_set_fold
2462 fold1_set ~> fold1_set_fold
2466 * Dropped rarely useful theorems concerning fold combinators:
2467 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2468 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2469 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2470 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2471 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2472 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2473 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2474 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2475 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2476 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2478 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2479 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2480 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2481 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2482 lemmas over fold rather than foldr, or make use of lemmas
2483 fold_conv_foldr and fold_rev.
2485 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2486 through option types.
2488 * "Transitive_Closure.ntrancl": bounded transitive closure on
2491 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2493 * Theory Int: Discontinued many legacy theorems specific to type int.
2494 INCOMPATIBILITY, use the corresponding generic theorems instead.
2496 zminus_zminus ~> minus_minus
2497 zminus_0 ~> minus_zero
2498 zminus_zadd_distrib ~> minus_add_distrib
2499 zadd_commute ~> add_commute
2500 zadd_assoc ~> add_assoc
2501 zadd_left_commute ~> add_left_commute
2504 zadd_0 ~> add_0_left
2505 zadd_0_right ~> add_0_right
2506 zadd_zminus_inverse2 ~> left_minus
2507 zmult_zminus ~> mult_minus_left
2508 zmult_commute ~> mult_commute
2509 zmult_assoc ~> mult_assoc
2510 zadd_zmult_distrib ~> left_distrib
2511 zadd_zmult_distrib2 ~> right_distrib
2512 zdiff_zmult_distrib ~> left_diff_distrib
2513 zdiff_zmult_distrib2 ~> right_diff_distrib
2514 zmult_1 ~> mult_1_left
2515 zmult_1_right ~> mult_1_right
2516 zle_refl ~> order_refl
2517 zle_trans ~> order_trans
2518 zle_antisym ~> order_antisym
2519 zle_linear ~> linorder_linear
2520 zless_linear ~> linorder_less_linear
2521 zadd_left_mono ~> add_left_mono
2522 zadd_strict_right_mono ~> add_strict_right_mono
2523 zadd_zless_mono ~> add_less_le_mono
2524 int_0_less_1 ~> zero_less_one
2525 int_0_neq_1 ~> zero_neq_one
2527 zpower_zadd_distrib ~> power_add
2528 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2529 zero_le_zpower_abs ~> zero_le_power_abs
2531 * Theory Deriv: Renamed
2533 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2535 * Theory Library/Multiset: Improved code generation of multisets.
2537 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2538 are expressed via type classes again. The special syntax
2539 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2540 setsum_set, which is now subsumed by Big_Operators.setsum.
2543 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2544 use theory HOL/Library/Nat_Bijection instead.
2546 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2547 trees is now inside a type class context. Names of affected
2548 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2549 theories working directly with raw red-black trees, adapt the names as
2553 bulkload -> rbt_bulkload
2554 del_from_left -> rbt_del_from_left
2555 del_from_right -> rbt_del_from_right
2557 delete -> rbt_delete
2559 insert -> rbt_insert
2560 insertw -> rbt_insert_with
2561 insert_with_key -> rbt_insert_with_key
2562 map_entry -> rbt_map_entry
2563 lookup -> rbt_lookup
2564 sorted -> rbt_sorted
2565 tree_greater -> rbt_greater
2566 tree_less -> rbt_less
2567 tree_less_symbol -> rbt_less_symbol
2569 union_with -> rbt_union_with
2570 union_with_key -> rbt_union_with_key
2573 balance_left_sorted -> balance_left_rbt_sorted
2574 balance_left_tree_greater -> balance_left_rbt_greater
2575 balance_left_tree_less -> balance_left_rbt_less
2576 balance_right_sorted -> balance_right_rbt_sorted
2577 balance_right_tree_greater -> balance_right_rbt_greater
2578 balance_right_tree_less -> balance_right_rbt_less
2579 balance_sorted -> balance_rbt_sorted
2580 balance_tree_greater -> balance_rbt_greater
2581 balance_tree_less -> balance_rbt_less
2582 bulkload_is_rbt -> rbt_bulkload_is_rbt
2583 combine_sorted -> combine_rbt_sorted
2584 combine_tree_greater -> combine_rbt_greater
2585 combine_tree_less -> combine_rbt_less
2586 delete_in_tree -> rbt_delete_in_tree
2587 delete_is_rbt -> rbt_delete_is_rbt
2588 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2589 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2590 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2591 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2592 del_in_tree -> rbt_del_in_tree
2593 del_inv1_inv2 -> rbt_del_inv1_inv2
2594 del_sorted -> rbt_del_rbt_sorted
2595 del_tree_greater -> rbt_del_rbt_greater
2596 del_tree_less -> rbt_del_rbt_less
2597 dom_lookup_Branch -> dom_rbt_lookup_Branch
2598 entries_lookup -> entries_rbt_lookup
2599 finite_dom_lookup -> finite_dom_rbt_lookup
2600 insert_sorted -> rbt_insert_rbt_sorted
2601 insertw_is_rbt -> rbt_insertw_is_rbt
2602 insertwk_is_rbt -> rbt_insertwk_is_rbt
2603 insertwk_sorted -> rbt_insertwk_rbt_sorted
2604 insertw_sorted -> rbt_insertw_rbt_sorted
2605 ins_sorted -> ins_rbt_sorted
2606 ins_tree_greater -> ins_rbt_greater
2607 ins_tree_less -> ins_rbt_less
2608 is_rbt_sorted -> is_rbt_rbt_sorted
2609 lookup_balance -> rbt_lookup_balance
2610 lookup_bulkload -> rbt_lookup_rbt_bulkload
2611 lookup_delete -> rbt_lookup_rbt_delete
2612 lookup_Empty -> rbt_lookup_Empty
2613 lookup_from_in_tree -> rbt_lookup_from_in_tree
2614 lookup_in_tree -> rbt_lookup_in_tree
2615 lookup_ins -> rbt_lookup_ins
2616 lookup_insert -> rbt_lookup_rbt_insert
2617 lookup_insertw -> rbt_lookup_rbt_insertw
2618 lookup_insertwk -> rbt_lookup_rbt_insertwk
2619 lookup_keys -> rbt_lookup_keys
2620 lookup_map -> rbt_lookup_map
2621 lookup_map_entry -> rbt_lookup_rbt_map_entry
2622 lookup_tree_greater -> rbt_lookup_rbt_greater
2623 lookup_tree_less -> rbt_lookup_rbt_less
2624 lookup_union -> rbt_lookup_rbt_union
2625 map_entry_color_of -> rbt_map_entry_color_of
2626 map_entry_inv1 -> rbt_map_entry_inv1
2627 map_entry_inv2 -> rbt_map_entry_inv2
2628 map_entry_is_rbt -> rbt_map_entry_is_rbt
2629 map_entry_sorted -> rbt_map_entry_rbt_sorted
2630 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2631 map_entry_tree_less -> rbt_map_entry_rbt_less
2632 map_tree_greater -> map_rbt_greater
2633 map_tree_less -> map_rbt_less
2634 map_sorted -> map_rbt_sorted
2635 paint_sorted -> paint_rbt_sorted
2636 paint_lookup -> paint_rbt_lookup
2637 paint_tree_greater -> paint_rbt_greater
2638 paint_tree_less -> paint_rbt_less
2639 sorted_entries -> rbt_sorted_entries
2640 tree_greater_eq_trans -> rbt_greater_eq_trans
2641 tree_greater_nit -> rbt_greater_nit
2642 tree_greater_prop -> rbt_greater_prop
2643 tree_greater_simps -> rbt_greater_simps
2644 tree_greater_trans -> rbt_greater_trans
2645 tree_less_eq_trans -> rbt_less_eq_trans
2646 tree_less_nit -> rbt_less_nit
2647 tree_less_prop -> rbt_less_prop
2648 tree_less_simps -> rbt_less_simps
2649 tree_less_trans -> rbt_less_trans
2650 tree_ord_props -> rbt_ord_props
2651 union_Branch -> rbt_union_Branch
2652 union_is_rbt -> rbt_union_is_rbt
2653 unionw_is_rbt -> rbt_unionw_is_rbt
2654 unionwk_is_rbt -> rbt_unionwk_is_rbt
2655 unionwk_sorted -> rbt_unionwk_rbt_sorted
2657 * Theory HOL/Library/Float: Floating point numbers are now defined as
2658 a subset of the real numbers. All operations are defined using the
2659 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2666 round_down -> float_round_down
2667 round_up -> float_round_up
2671 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2674 abs_float_def -> Float.compute_float_abs
2675 bitlen_ge0 -> bitlen_nonneg
2676 bitlen.simps -> Float.compute_bitlen
2677 float_components -> Float_mantissa_exponent
2678 float_divl.simps -> Float.compute_float_divl
2679 float_divr.simps -> Float.compute_float_divr
2680 float_eq_odd -> mult_powr_eq_mult_powr_iff
2681 float_power -> real_of_float_power
2682 lapprox_posrat_def -> Float.compute_lapprox_posrat
2683 lapprox_rat.simps -> Float.compute_lapprox_rat
2684 le_float_def' -> Float.compute_float_le
2685 le_float_def -> less_eq_float.rep_eq
2686 less_float_def' -> Float.compute_float_less
2687 less_float_def -> less_float.rep_eq
2688 normfloat_def -> Float.compute_normfloat
2689 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2690 normfloat -> normfloat_def
2691 normfloat_unique -> use normfloat_def
2692 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2693 one_float_def -> Float.compute_float_one
2694 plus_float_def -> Float.compute_float_plus
2695 rapprox_posrat_def -> Float.compute_rapprox_posrat
2696 rapprox_rat.simps -> Float.compute_rapprox_rat
2697 real_of_float_0 -> zero_float.rep_eq
2698 real_of_float_1 -> one_float.rep_eq
2699 real_of_float_abs -> abs_float.rep_eq
2700 real_of_float_add -> plus_float.rep_eq
2701 real_of_float_minus -> uminus_float.rep_eq
2702 real_of_float_mult -> times_float.rep_eq
2703 real_of_float_simp -> Float.rep_eq
2704 real_of_float_sub -> minus_float.rep_eq
2705 round_down.simps -> Float.compute_float_round_down
2706 round_up.simps -> Float.compute_float_round_up
2707 times_float_def -> Float.compute_float_times
2708 uminus_float_def -> Float.compute_float_uminus
2709 zero_float_def -> Float.compute_float_zero
2711 Lemmas not necessary anymore, use the transfer method:
2712 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2713 float_divr, float_le_simp, float_less1_mantissa_bound,
2714 float_less_simp, float_less_zero, float_le_zero,
2715 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2716 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2717 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2718 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2719 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2720 round_up, zero_le_float, zero_less_float
2722 * New theory HOL/Library/DAList provides an abstract type for
2723 association lists with distinct keys.
2725 * Session HOL/IMP: Added new theory of abstract interpretation of
2728 * Session HOL-Import: Re-implementation from scratch is faster,
2729 simpler, and more scalable. Requires a proof bundle, which is
2730 available as an external component. Discontinued old (and mostly
2731 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2733 * Session HOL-Word: Discontinued many redundant theorems specific to
2734 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2737 word_sub_alt ~> word_sub_wi
2738 word_add_alt ~> word_add_def
2739 word_mult_alt ~> word_mult_def
2740 word_minus_alt ~> word_minus_def
2741 word_0_alt ~> word_0_wi
2742 word_1_alt ~> word_1_wi
2743 word_add_0 ~> add_0_left
2744 word_add_0_right ~> add_0_right
2745 word_mult_1 ~> mult_1_left
2746 word_mult_1_right ~> mult_1_right
2747 word_add_commute ~> add_commute
2748 word_add_assoc ~> add_assoc
2749 word_add_left_commute ~> add_left_commute
2750 word_mult_commute ~> mult_commute
2751 word_mult_assoc ~> mult_assoc
2752 word_mult_left_commute ~> mult_left_commute
2753 word_left_distrib ~> left_distrib
2754 word_right_distrib ~> right_distrib
2755 word_left_minus ~> left_minus
2756 word_diff_0_right ~> diff_0_right
2757 word_diff_self ~> diff_self
2758 word_sub_def ~> diff_minus
2759 word_diff_minus ~> diff_minus
2760 word_add_ac ~> add_ac
2761 word_mult_ac ~> mult_ac
2762 word_plus_ac0 ~> add_0_left add_0_right add_ac
2763 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2764 word_order_trans ~> order_trans
2765 word_order_refl ~> order_refl
2766 word_order_antisym ~> order_antisym
2767 word_order_linear ~> linorder_linear
2768 lenw1_zero_neq_one ~> zero_neq_one
2769 word_number_of_eq ~> number_of_eq
2770 word_of_int_add_hom ~> wi_hom_add
2771 word_of_int_sub_hom ~> wi_hom_sub
2772 word_of_int_mult_hom ~> wi_hom_mult
2773 word_of_int_minus_hom ~> wi_hom_neg
2774 word_of_int_succ_hom ~> wi_hom_succ
2775 word_of_int_pred_hom ~> wi_hom_pred
2776 word_of_int_0_hom ~> word_0_wi
2777 word_of_int_1_hom ~> word_1_wi
2779 * Session HOL-Word: New proof method "word_bitwise" for splitting
2780 machine word equalities and inequalities into logical circuits,
2781 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2782 multiplication, shifting by constants, bitwise operators and numeric
2783 constants. Requires fixed-length word types, not 'a word. Solves
2784 many standard word identities outright and converts more into first
2785 order problems amenable to blast or similar. See also examples in
2786 HOL/Word/Examples/WordExamples.thy.
2788 * Session HOL-Probability: Introduced the type "'a measure" to
2789 represent measures, this replaces the records 'a algebra and 'a
2790 measure_space. The locales based on subset_class now have two
2791 locale-parameters the space \<Omega> and the set of measurable sets M.
2792 The product of probability spaces uses now the same constant as the
2793 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2794 measure". Most constants are defined now outside of locales and gain
2795 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2796 Measure space constructions for distributions and densities now got
2797 their own constants distr and density. Instead of using locales to
2798 describe measure spaces with a finite space, the measure count_space
2799 and point_measure is introduced. INCOMPATIBILITY.
2803 finite_measure.\<mu>' -> measure
2804 product_algebra_generator -> prod_algebra
2805 product_prob_space.emb -> prod_emb
2806 product_prob_space.infprod_algebra -> PiM
2809 completeable_measure_space
2810 finite_measure_space
2812 finite_product_finite_prob_space
2813 finite_product_sigma_algebra
2814 finite_sigma_algebra
2816 pair_finite_prob_space
2817 pair_finite_sigma_algebra
2820 product_sigma_algebra
2824 distribution -> use distr measure, or distributed predicate
2826 joint_distribution -> use distr measure, or distributed predicate
2827 pair_measure_generator
2828 product_prob_space.infprod_algebra -> use PiM
2831 Replacement theorems:
2832 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2833 finite_measure.empty_measure -> measure_empty
2834 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2835 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2836 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2837 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2838 finite_measure.finite_measure -> finite_measure.emeasure_finite
2839 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2840 finite_measure.positive_measure' -> measure_nonneg
2841 finite_measure.real_measure -> finite_measure.emeasure_real
2842 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2843 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2844 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2845 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2846 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2847 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2848 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2849 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2850 information_space.entropy_commute -> information_space.entropy_commute_simple
2851 information_space.entropy_eq -> information_space.entropy_simple_distributed
2852 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2853 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2854 information_space.entropy_uniform_max -> information_space.entropy_uniform
2855 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2856 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2857 information_space.KL_ge_0 -> information_space.KL_nonneg
2858 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2859 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2860 Int_stable_cuboids -> Int_stable_atLeastAtMost
2861 Int_stable_product_algebra_generator -> positive_integral
2862 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2863 measure_space.additive -> emeasure_additive
2864 measure_space.AE_iff_null_set -> AE_iff_null
2865 measure_space.almost_everywhere_def -> eventually_ae_filter
2866 measure_space.almost_everywhere_vimage -> AE_distrD
2867 measure_space.continuity_from_above -> INF_emeasure_decseq
2868 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2869 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2870 measure_space.continuity_from_below -> SUP_emeasure_incseq
2871 measure_space_density -> emeasure_density
2872 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2873 measure_space.integrable_vimage -> integrable_distr
2874 measure_space.integral_translated_density -> integral_density
2875 measure_space.integral_vimage -> integral_distr
2876 measure_space.measure_additive -> plus_emeasure
2877 measure_space.measure_compl -> emeasure_compl
2878 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2879 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2880 measure_space.measure_decseq -> decseq_emeasure
2881 measure_space.measure_Diff -> emeasure_Diff
2882 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2883 measure_space.measure_eq_0 -> emeasure_eq_0
2884 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2885 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2886 measure_space.measure_incseq -> incseq_emeasure
2887 measure_space.measure_insert -> emeasure_insert
2888 measure_space.measure_mono -> emeasure_mono
2889 measure_space.measure_not_negative -> emeasure_not_MInf
2890 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2891 measure_space.measure_setsum -> setsum_emeasure
2892 measure_space.measure_setsum_split -> setsum_emeasure_cover
2893 measure_space.measure_space_vimage -> emeasure_distr
2894 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2895 measure_space.measure_subadditive -> subadditive
2896 measure_space.measure_top -> emeasure_space
2897 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2898 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2899 measure_space.positive_integral_translated_density -> positive_integral_density
2900 measure_space.positive_integral_vimage -> positive_integral_distr
2901 measure_space.real_continuity_from_above -> Lim_measure_decseq
2902 measure_space.real_continuity_from_below -> Lim_measure_incseq
2903 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2904 measure_space.real_measure_Diff -> measure_Diff
2905 measure_space.real_measure_finite_Union -> measure_finite_Union
2906 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2907 measure_space.real_measure_subadditive -> measure_subadditive
2908 measure_space.real_measure_Union -> measure_Union
2909 measure_space.real_measure_UNION -> measure_UNION
2910 measure_space.simple_function_vimage -> simple_function_comp
2911 measure_space.simple_integral_vimage -> simple_integral_distr
2912 measure_space.simple_integral_vimage -> simple_integral_distr
2913 measure_unique_Int_stable -> measure_eqI_generator_eq
2914 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2915 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2916 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2917 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2918 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2919 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2920 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2921 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2922 pair_sigma_algebra.sets_swap -> sets_pair_swap
2923 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2924 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2925 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2926 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2927 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2928 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2929 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2930 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2931 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2932 prob_space.prob_space_vimage -> prob_space_distr
2933 prob_space.random_variable_restrict -> measurable_restrict
2934 prob_space_unique_Int_stable -> measure_eqI_prob_space
2935 product_algebraE -> prod_algebraE_all
2936 product_algebra_generator_der -> prod_algebra_eq_finite
2937 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2938 product_algebraI -> sets_PiM_I_finite
2939 product_measure_exists -> product_sigma_finite.sigma_finite
2940 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2941 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2942 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2943 product_prob_space.measurable_component -> measurable_component_singleton
2944 product_prob_space.measurable_emb -> measurable_prod_emb
2945 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2946 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2947 product_prob_space.measure_emb -> emeasure_prod_emb
2948 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2949 product_sigma_algebra.product_algebra_into_space -> space_closed
2950 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2951 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2952 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2953 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2954 sets_product_algebra -> sets_PiM
2955 sigma_algebra.measurable_sigma -> measurable_measure_of
2956 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2957 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2958 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2959 space_product_algebra -> space_PiM
2961 * Session HOL-TPTP: support to parse and import TPTP problems (all
2962 languages) into Isabelle/HOL.
2967 * New "case_product" attribute (see HOL).
2972 * Greater support for structured proofs involving induction or case
2975 * Much greater use of mathematical symbols.
2977 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2982 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2983 from a minor keyword introduced via theory header declaration.
2985 * Antiquotation @{command_spec "name"} produces the
2986 Outer_Syntax.command_spec from a major keyword introduced via theory
2987 header declaration; it can be passed to Outer_Syntax.command etc.
2989 * Local_Theory.define no longer hard-wires default theorem name
2990 "foo_def", but retains the binding as given. If that is Binding.empty
2991 / Attrib.empty_binding, the result is not registered as user-level
2992 fact. The Local_Theory.define_internal variant allows to specify a
2993 non-empty name (used for the foundation in the background theory),
2994 while omitting the fact binding in the user-context. Potential
2995 INCOMPATIBILITY for derived definitional packages: need to specify
2996 naming policy for primitive definitions more explicitly.
2998 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2999 conformance with similar operations in structure Term and Logic.
3001 * Antiquotation @{attributes [...]} embeds attribute source
3002 representation into the ML text, which is particularly useful with
3003 declarations like Local_Theory.note.
3005 * Structure Proof_Context follows standard naming scheme. Old
3006 ProofContext has been discontinued. INCOMPATIBILITY.
3008 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3009 change of semantics: update is applied to auxiliary local theory
3012 * Modernized some old-style infix operations:
3014 addeqcongs ~> Simplifier.add_eqcong
3015 deleqcongs ~> Simplifier.del_eqcong
3016 addcongs ~> Simplifier.add_cong
3017 delcongs ~> Simplifier.del_cong
3018 setmksimps ~> Simplifier.set_mksimps
3019 setmkcong ~> Simplifier.set_mkcong
3020 setmksym ~> Simplifier.set_mksym
3021 setmkeqTrue ~> Simplifier.set_mkeqTrue
3022 settermless ~> Simplifier.set_termless
3023 setsubgoaler ~> Simplifier.set_subgoaler
3024 addsplits ~> Splitter.add_split
3025 delsplits ~> Splitter.del_split
3030 * USER_HOME settings variable points to cross-platform user home
3031 directory, which coincides with HOME on POSIX systems only. Likewise,
3032 the Isabelle path specification "~" now expands to $USER_HOME, instead
3033 of former $HOME. A different default for USER_HOME may be set
3034 explicitly in shell environment, before Isabelle settings are
3035 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3036 the generic user home was intended.
3038 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3039 notation, which is useful for the jEdit file browser, for example.
3041 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3046 New in Isabelle2011-1 (October 2011)
3047 ------------------------------------
3051 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3052 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3054 - Management of multiple theory files directly from the editor
3055 buffer store -- bypassing the file-system (no requirement to save
3056 files for checking).
3058 - Markup of formal entities within the text buffer, with semantic
3059 highlighting, tooltips and hyperlinks to jump to defining source
3062 - Improved text rendering, with sub/superscripts in the source
3063 buffer (including support for copy/paste wrt. output panel, HTML
3064 theory output and other non-Isabelle text boxes).
3066 - Refined scheduling of proof checking and printing of results,
3067 based on interactive editor view. (Note: jEdit folding and
3068 narrowing allows to restrict buffer perspectives explicitly.)
3070 - Reduced CPU performance requirements, usable on machines with few
3073 - Reduced memory requirements due to pruning of unused document
3074 versions (garbage collection).
3076 See also ~~/src/Tools/jEdit/README.html for further information,
3077 including some remaining limitations.
3079 * Theory loader: source files are exclusively located via the master
3080 directory of each theory node (where the .thy file itself resides).
3081 The global load path (such as src/HOL/Library) has been discontinued.
3082 Note that the path element ~~ may be used to reference theories in the
3083 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3086 * Theory loader: source files are identified by content via SHA1
3087 digests. Discontinued former path/modtime identification and optional
3088 ISABELLE_FILE_IDENT plugin scripts.
3090 * Parallelization of nested Isar proofs is subject to
3091 Goal.parallel_proofs_threshold (default 100). See also isabelle
3094 * Name space: former unsynchronized references are now proper
3095 configuration options, with more conventional names:
3097 long_names ~> names_long
3098 short_names ~> names_short
3099 unique_names ~> names_unique
3101 Minor INCOMPATIBILITY, need to declare options in context like this:
3103 declare [[names_unique = false]]
3105 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3106 that the result needs to be unique, which means fact specifications
3107 may have to be refined after enriching a proof context.
3109 * Attribute "case_names" has been refined: the assumptions in each case
3110 can be named now by following the case name with [name1 name2 ...].
3112 * Isabelle/Isar reference manual has been updated and extended:
3113 - "Synopsis" provides a catalog of main Isar language concepts.
3114 - Formal references in syntax diagrams, via @{rail} antiquotation.
3115 - Updated material from classic "ref" manual, notably about
3116 "Classical Reasoner".
3121 * Class bot and top require underlying partial order rather than
3122 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3124 * Class complete_lattice: generalized a couple of lemmas from sets;
3125 generalized theorems INF_cong and SUP_cong. New type classes for
3126 complete boolean algebras and complete linear orders. Lemmas
3127 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3128 class complete_linorder.
3130 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3131 Sup_fun_def, Inf_apply, Sup_apply.
3133 Removed redundant lemmas (the right hand side gives hints how to
3134 replace them for (metis ...), or (simp only: ...) proofs):
3136 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3137 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3138 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3139 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3140 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3141 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3142 Inter_def ~> INF_def, image_def
3143 Union_def ~> SUP_def, image_def
3144 INT_eq ~> INF_def, and image_def
3145 UN_eq ~> SUP_def, and image_def
3146 INF_subset ~> INF_superset_mono [OF _ order_refl]
3148 More consistent and comprehensive names:
3150 INTER_eq_Inter_image ~> INF_def
3151 UNION_eq_Union_image ~> SUP_def
3154 INF_leI ~> INF_lower
3155 INF_leI2 ~> INF_lower2
3156 le_INFI ~> INF_greatest
3157 le_SUPI ~> SUP_upper
3158 le_SUPI2 ~> SUP_upper2
3159 SUP_leI ~> SUP_least
3160 INFI_bool_eq ~> INF_bool_eq
3161 SUPR_bool_eq ~> SUP_bool_eq
3162 INFI_apply ~> INF_apply
3163 SUPR_apply ~> SUP_apply
3164 INTER_def ~> INTER_eq
3165 UNION_def ~> UNION_eq
3169 * Renamed theory Complete_Lattice to Complete_Lattices.
3172 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3173 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3174 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3175 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3177 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3178 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3179 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3182 * Added syntactic classes "inf" and "sup" for the respective
3183 constants. INCOMPATIBILITY: Changes in the argument order of the
3184 (mostly internal) locale predicates for some derived classes.
3186 * Theorem collections ball_simps and bex_simps do not contain theorems
3187 referring to UNION any longer; these have been moved to collection
3188 UN_ball_bex_simps. INCOMPATIBILITY.
3190 * Theory Archimedean_Field: floor now is defined as parameter of a
3191 separate type class floor_ceiling.
3193 * Theory Finite_Set: more coherent development of fold_set locales:
3195 locale fun_left_comm ~> locale comp_fun_commute
3196 locale fun_left_comm_idem ~> locale comp_fun_idem
3198 Both use point-free characterization; interpretation proofs may need
3199 adjustment. INCOMPATIBILITY.
3201 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3202 accordance with standard mathematical terminology. INCOMPATIBILITY.
3204 * Theory Complex_Main: The locale interpretations for the
3205 bounded_linear and bounded_bilinear locales have been removed, in
3206 order to reduce the number of duplicate lemmas. Users must use the
3207 original names for distributivity theorems, potential INCOMPATIBILITY.
3209 divide.add ~> add_divide_distrib
3210 divide.diff ~> diff_divide_distrib
3211 divide.setsum ~> setsum_divide_distrib
3212 mult.add_right ~> right_distrib
3213 mult.diff_right ~> right_diff_distrib
3214 mult_right.setsum ~> setsum_right_distrib
3215 mult_left.diff ~> left_diff_distrib
3217 * Theory Complex_Main: Several redundant theorems have been removed or
3218 replaced by more general versions. INCOMPATIBILITY.
3220 real_diff_def ~> minus_real_def
3221 real_divide_def ~> divide_real_def
3222 real_less_def ~> less_le
3223 real_abs_def ~> abs_real_def
3224 real_sgn_def ~> sgn_real_def
3225 real_mult_commute ~> mult_commute
3226 real_mult_assoc ~> mult_assoc
3227 real_mult_1 ~> mult_1_left
3228 real_add_mult_distrib ~> left_distrib
3229 real_zero_not_eq_one ~> zero_neq_one
3230 real_mult_inverse_left ~> left_inverse
3231 INVERSE_ZERO ~> inverse_zero
3232 real_le_refl ~> order_refl
3233 real_le_antisym ~> order_antisym
3234 real_le_trans ~> order_trans
3235 real_le_linear ~> linear
3236 real_le_eq_diff ~> le_iff_diff_le_0
3237 real_add_left_mono ~> add_left_mono
3238 real_mult_order ~> mult_pos_pos
3239 real_mult_less_mono2 ~> mult_strict_left_mono
3240 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3241 real_0_le_divide_iff ~> zero_le_divide_iff
3242 realpow_two_disj ~> power2_eq_iff
3243 real_squared_diff_one_factored ~> square_diff_one_factored
3244 realpow_two_diff ~> square_diff_square_factored
3245 reals_complete2 ~> complete_real
3246 real_sum_squared_expand ~> power2_sum
3247 exp_ln_eq ~> ln_unique
3249 expi_zero ~> exp_zero
3250 lemma_DERIV_subst ~> DERIV_cong
3251 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3252 LIMSEQ_const ~> tendsto_const
3253 LIMSEQ_norm ~> tendsto_norm
3254 LIMSEQ_add ~> tendsto_add
3255 LIMSEQ_minus ~> tendsto_minus
3256 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3257 LIMSEQ_diff ~> tendsto_diff
3258 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3259 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3260 LIMSEQ_mult ~> tendsto_mult
3261 LIMSEQ_inverse ~> tendsto_inverse
3262 LIMSEQ_divide ~> tendsto_divide
3263 LIMSEQ_pow ~> tendsto_power
3264 LIMSEQ_setsum ~> tendsto_setsum
3265 LIMSEQ_setprod ~> tendsto_setprod
3266 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3267 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3268 LIMSEQ_imp_rabs ~> tendsto_rabs
3269 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3270 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3271 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3272 LIMSEQ_Complex ~> tendsto_Complex
3273 LIM_ident ~> tendsto_ident_at
3274 LIM_const ~> tendsto_const
3275 LIM_add ~> tendsto_add
3276 LIM_add_zero ~> tendsto_add_zero
3277 LIM_minus ~> tendsto_minus
3278 LIM_diff ~> tendsto_diff
3279 LIM_norm ~> tendsto_norm
3280 LIM_norm_zero ~> tendsto_norm_zero
3281 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3282 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3283 LIM_rabs ~> tendsto_rabs
3284 LIM_rabs_zero ~> tendsto_rabs_zero
3285 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3286 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3287 LIM_compose ~> tendsto_compose
3288 LIM_mult ~> tendsto_mult
3289 LIM_scaleR ~> tendsto_scaleR
3290 LIM_of_real ~> tendsto_of_real
3291 LIM_power ~> tendsto_power
3292 LIM_inverse ~> tendsto_inverse
3293 LIM_sgn ~> tendsto_sgn
3294 isCont_LIM_compose ~> isCont_tendsto_compose
3295 bounded_linear.LIM ~> bounded_linear.tendsto
3296 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3297 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3298 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3299 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3300 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3301 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3303 * Theory Complex_Main: The definition of infinite series was
3304 generalized. Now it is defined on the type class {topological_space,
3305 comm_monoid_add}. Hence it is useable also for extended real numbers.
3307 * Theory Complex_Main: The complex exponential function "expi" is now
3308 a type-constrained abbreviation for "exp :: complex => complex"; thus
3309 several polymorphic lemmas about "exp" are now applicable to "expi".
3313 - Theory Library/Code_Char_ord provides native ordering of
3314 characters in the target language.
3316 - Commands code_module and code_library are legacy, use export_code
3319 - Method "evaluation" is legacy, use method "eval" instead.
3321 - Legacy evaluator "SML" is deactivated by default. May be
3322 reactivated by the following theory command:
3324 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3326 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3328 * New proof method "induction" that gives induction hypotheses the
3329 name "IH", thus distinguishing them from further hypotheses that come
3330 from rule induction. The latter are still called "hyps". Method
3331 "induction" is a thin wrapper around "induct" and follows the same
3334 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3335 still available as a legacy feature for some time.
3338 - Added "need" and "total_consts" options.
3339 - Reintroduced "show_skolems" option by popular demand.
3340 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3344 - Use quasi-sound (and efficient) translations by default.
3345 - Added support for the following provers: E-ToFoF, LEO-II,
3346 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3347 - Automatically preplay and minimize proofs before showing them if
3348 this can be done within reasonable time.
3349 - sledgehammer available_provers ~> sledgehammer supported_provers.
3351 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3352 "max_mono_iters", and "max_new_mono_instances" options.
3353 - Removed "explicit_apply" and "full_types" options as well as "Full
3354 Types" Proof General menu item. INCOMPATIBILITY.
3357 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3358 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3362 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3363 "elim:" options. INCOMPATIBILITY.
3364 - Introduced 'try' that not only runs 'try_methods' but also
3365 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3368 - Added "eval" option to evaluate terms for the found counterexample
3369 (currently only supported by the default (exhaustive) tester).
3370 - Added post-processing of terms to obtain readable counterexamples
3371 (currently only supported by the default (exhaustive) tester).
3372 - New counterexample generator quickcheck[narrowing] enables
3373 narrowing-based testing. Requires the Glasgow Haskell compiler
3374 with its installation location defined in the Isabelle settings
3375 environment as ISABELLE_GHC.
3376 - Removed quickcheck tester "SML" based on the SML code generator
3377 (formly in HOL/Library).
3379 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3380 use 'partial_function' instead.
3382 * Theory Library/Extended_Reals replaces now the positive extended
3383 reals found in probability theory. This file is extended by
3384 Multivariate_Analysis/Extended_Real_Limits.
3386 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3387 from where it must be imported explicitly if it is really required.
3390 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3391 been moved here. INCOMPATIBILITY.
3393 * Theory Library/Saturated provides type of numbers with saturated
3396 * Theory Library/Product_Lattice defines a pointwise ordering for the
3397 product type 'a * 'b, and provides instance proofs for various order
3398 and lattice type classes.
3400 * Theory Library/Countable now provides the "countable_datatype" proof
3401 method for proving "countable" class instances for datatypes.
3403 * Theory Library/Cset_Monad allows do notation for computable sets
3404 (cset) via the generic monad ad-hoc overloading facility.
3406 * Library: Theories of common data structures are split into theories
3407 for implementation, an invariant-ensuring type, and connection to an
3408 abstract type. INCOMPATIBILITY.
3410 - RBT is split into RBT and RBT_Mapping.
3411 - AssocList is split and renamed into AList and AList_Mapping.
3412 - DList is split into DList_Impl, DList, and DList_Cset.
3413 - Cset is split into Cset and List_Cset.
3415 * Theory Library/Nat_Infinity has been renamed to
3416 Library/Extended_Nat, with name changes of the following types and
3419 type inat ~> type enat
3421 Infty ~> infinity (overloaded)
3425 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3426 been renamed accordingly. INCOMPATIBILITY.
3428 * Session Multivariate_Analysis: The euclidean_space type class now
3429 fixes a constant "Basis :: 'a set" consisting of the standard
3430 orthonormal basis for the type. Users now have the option of
3431 quantifying over this set instead of using the "basis" function, e.g.
3432 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3434 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3435 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3436 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3437 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3438 changed to match. Definition theorems for overloaded constants now use
3439 the standard "foo_vec_def" naming scheme. A few other theorems have
3440 been renamed as follows (INCOMPATIBILITY):
3442 Cart_eq ~> vec_eq_iff
3443 dist_nth_le_cart ~> dist_vec_nth_le
3444 tendsto_vector ~> vec_tendstoI
3445 Cauchy_vector ~> vec_CauchyI
3447 * Session Multivariate_Analysis: Several duplicate theorems have been
3448 removed, and other theorems have been renamed or replaced with more
3449 general versions. INCOMPATIBILITY.
3451 finite_choice ~> finite_set_choice
3452 eventually_conjI ~> eventually_conj
3453 eventually_and ~> eventually_conj_iff
3454 eventually_false ~> eventually_False
3455 setsum_norm ~> norm_setsum
3456 Lim_sequentially ~> LIMSEQ_def
3457 Lim_ident_at ~> LIM_ident
3458 Lim_const ~> tendsto_const
3459 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3460 Lim_neg ~> tendsto_minus
3461 Lim_add ~> tendsto_add
3462 Lim_sub ~> tendsto_diff
3463 Lim_mul ~> tendsto_scaleR
3464 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3465 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3466 Lim_linear ~> bounded_linear.tendsto
3467 Lim_component ~> tendsto_euclidean_component
3468 Lim_component_cart ~> tendsto_vec_nth
3469 Lim_inner ~> tendsto_inner [OF tendsto_const]
3470 dot_lsum ~> inner_setsum_left
3471 dot_rsum ~> inner_setsum_right
3472 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3473 continuous_neg ~> continuous_minus
3474 continuous_sub ~> continuous_diff
3475 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3476 continuous_mul ~> continuous_scaleR
3477 continuous_inv ~> continuous_inverse
3478 continuous_at_within_inv ~> continuous_at_within_inverse
3479 continuous_at_inv ~> continuous_at_inverse
3480 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3481 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3482 continuous_at_component ~> continuous_component [OF continuous_at_id]
3483 continuous_on_neg ~> continuous_on_minus
3484 continuous_on_sub ~> continuous_on_diff
3485 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3486 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3487 continuous_on_mul ~> continuous_on_scaleR
3488 continuous_on_mul_real ~> continuous_on_mult
3489 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3490 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3491 continuous_on_inverse ~> continuous_on_inv
3492 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3493 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3494 subset_interior ~> interior_mono
3495 subset_closure ~> closure_mono
3496 closure_univ ~> closure_UNIV
3497 real_arch_lt ~> reals_Archimedean2
3498 real_arch ~> reals_Archimedean3
3499 real_abs_norm ~> abs_norm_cancel
3500 real_abs_sub_norm ~> norm_triangle_ineq3
3501 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3503 * Session HOL-Probability:
3504 - Caratheodory's extension lemma is now proved for ring_of_sets.
3505 - Infinite products of probability measures are now available.
3506 - Sigma closure is independent, if the generator is independent
3507 - Use extended reals instead of positive extended
3508 reals. INCOMPATIBILITY.
3510 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3512 expand_fun_below ~> fun_below_iff
3513 below_fun_ext ~> fun_belowI
3514 expand_cfun_eq ~> cfun_eq_iff
3515 ext_cfun ~> cfun_eqI
3516 expand_cfun_below ~> cfun_below_iff
3517 below_cfun_ext ~> cfun_belowI
3518 monofun_fun_fun ~> fun_belowD
3519 monofun_fun_arg ~> monofunE
3520 monofun_lub_fun ~> adm_monofun [THEN admD]
3521 cont_lub_fun ~> adm_cont [THEN admD]
3522 cont2cont_Rep_CFun ~> cont2cont_APP
3523 cont_Rep_CFun_app ~> cont_APP_app
3524 cont_Rep_CFun_app_app ~> cont_APP_app_app
3525 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3526 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3527 contlub_cfun ~> lub_APP [symmetric]
3528 contlub_LAM ~> lub_LAM [symmetric]
3531 lift_distinct1 ~> lift.distinct(1)
3532 lift_distinct2 ~> lift.distinct(2)
3533 Def_not_UU ~> lift.distinct(2)
3534 Def_inject ~> lift.inject
3535 below_UU_iff ~> below_bottom_iff
3536 eq_UU_iff ~> eq_bottom_iff
3539 *** Document preparation ***
3541 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3542 isar-ref manual, both for description and actual application of the
3545 * Antiquotation @{value} evaluates the given term and presents its
3548 * Antiquotations: term style "isub" provides ad-hoc conversion of
3549 variables x1, y23 into subscripted form x\<^isub>1,
3550 y\<^isub>2\<^isub>3.
3552 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3553 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3555 * Localized \isabellestyle switch can be used within blocks or groups
3558 \isabellestyle{it} %preferred default
3559 {\isabellestylett @{text "typewriter stuff"}}
3561 * Discontinued special treatment of hard tabulators. Implicit
3562 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3568 * The inner syntax of sort/type/term/prop supports inlined YXML
3569 representations within quoted string tokens. By encoding logical
3570 entities via Term_XML (in ML or Scala) concrete syntax can be
3571 bypassed, which is particularly useful for producing bits of text
3572 under external program control.
3574 * Antiquotations for ML and document preparation are managed as theory
3575 data, which requires explicit setup.
3577 * Isabelle_Process.is_active allows tools to check if the official
3578 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3579 (better known as Proof General).
3581 * Structure Proof_Context follows standard naming scheme. Old
3582 ProofContext is still available for some time as legacy alias.
3584 * Structure Timing provides various operations for timing; supersedes
3585 former start_timing/end_timing etc.
3587 * Path.print is the official way to show file-system paths to users
3588 (including quotes etc.).
3590 * Inner syntax: identifiers in parse trees of generic categories
3591 "logic", "aprop", "idt" etc. carry position information (disguised as
3592 type constraints). Occasional INCOMPATIBILITY with non-compliant
3593 translations that choke on unexpected type constraints. Positions can
3594 be stripped in ML translations via Syntax.strip_positions /
3595 Syntax.strip_positions_ast, or via the syntax constant
3596 "_strip_positions" within parse trees. As last resort, positions can
3597 be disabled via the configuration option Syntax.positions, which is
3598 called "syntax_positions" in Isar attribute syntax.
3600 * Discontinued special status of various ML structures that contribute
3601 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3602 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3603 refer directly to Ast.Constant, Lexicon.is_identifier,
3604 Syntax_Trans.mk_binder_tr etc.
3606 * Typed print translation: discontinued show_sorts argument, which is
3607 already available via context of "advanced" translation.
3609 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3610 goal states; body tactic needs to address all subgoals uniformly.
3612 * Slightly more special eq_list/eq_set, with shortcut involving
3613 pointer equality (assumes that eq relation is reflexive).
3615 * Classical tactics use proper Proof.context instead of historic types
3616 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3617 operate directly on Proof.context. Raw type claset retains its use as
3618 snapshot of the classical context, which can be recovered via
3619 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3620 INCOMPATIBILITY, classical tactics and derived proof methods require
3621 proper Proof.context.
3626 * Discontinued support for Poly/ML 5.2, which was the last version
3627 without proper multithreading and TimeLimit implementation.
3629 * Discontinued old lib/scripts/polyml-platform, which has been
3630 obsolete since Isabelle2009-2.
3632 * Various optional external tools are referenced more robustly and
3633 uniformly by explicit Isabelle settings as follows:
3635 ISABELLE_CSDP (formerly CSDP_EXE)
3636 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3637 ISABELLE_OCAML (formerly EXEC_OCAML)
3638 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3639 ISABELLE_YAP (formerly EXEC_YAP)
3641 Note that automated detection from the file-system or search path has
3642 been discontinued. INCOMPATIBILITY.
3644 * Scala layer provides JVM method invocation service for static
3645 methods of type (String)String, see Invoke_Scala.method in ML. For
3648 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3650 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3651 this allows to pass structured values between ML and Scala.
3653 * The IsabelleText fonts includes some further glyphs to support the
3654 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3655 installed a local copy (which is normally *not* required) need to
3656 delete or update it from ~~/lib/fonts/.
3660 New in Isabelle2011 (January 2011)
3661 ----------------------------------
3665 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3666 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3667 useful tooltips and hyperlinks produced from its static analysis. The
3668 bundled component provides an executable Isabelle tool that can be run
3671 Isabelle2011/bin/isabelle jedit
3673 * Significantly improved Isabelle/Isar implementation manual.
3675 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3676 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3677 while the default heap location within that directory lacks that extra
3678 suffix. This isolates multiple Isabelle installations from each
3679 other, avoiding problems with old settings in new versions.
3680 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3682 * Source files are always encoded as UTF-8, instead of old-fashioned
3683 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3684 the following package declarations:
3686 \usepackage[utf8]{inputenc}
3687 \usepackage{textcomp}
3689 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3690 a Unicode character is treated as a single symbol, not a sequence of
3691 non-ASCII bytes as before. Since Isabelle/ML string literals may
3692 contain symbols without further backslash escapes, Unicode can now be
3693 used here as well. Recall that Symbol.explode in ML provides a
3694 consistent view on symbols, while raw explode (or String.explode)
3695 merely give a byte-oriented representation.
3697 * Theory loader: source files are primarily located via the master
3698 directory of each theory node (where the .thy file itself resides).
3699 The global load path is still partially available as legacy feature.
3700 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3701 explicit paths, relatively to the theory.
3703 * Special treatment of ML file names has been discontinued.
3704 Historically, optional extensions .ML or .sml were added on demand --
3705 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3706 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3708 * Various options that affect pretty printing etc. are now properly
3709 handled within the context via configuration options, instead of
3710 unsynchronized references or print modes. There are both ML Config.T
3711 entities and Isar declaration attributes to access these.
3713 ML (Config.T) Isar (attribute)
3715 eta_contract eta_contract
3716 show_brackets show_brackets
3717 show_sorts show_sorts
3718 show_types show_types
3719 show_question_marks show_question_marks
3720 show_consts show_consts
3721 show_abbrevs show_abbrevs
3723 Syntax.ast_trace syntax_ast_trace
3724 Syntax.ast_stat syntax_ast_stat
3725 Syntax.ambiguity_level syntax_ambiguity_level
3727 Goal_Display.goals_limit goals_limit
3728 Goal_Display.show_main_goal show_main_goal
3730 Method.rule_trace rule_trace
3732 Thy_Output.display thy_output_display
3733 Thy_Output.quotes thy_output_quotes
3734 Thy_Output.indent thy_output_indent
3735 Thy_Output.source thy_output_source
3736 Thy_Output.break thy_output_break
3738 Note that corresponding "..._default" references in ML may only be
3739 changed globally at the ROOT session setup, but *not* within a theory.
3740 The option "show_abbrevs" supersedes the former print mode
3741 "no_abbrevs" with inverted meaning.
3743 * More systematic naming of some configuration options.
3746 trace_simp ~> simp_trace
3747 debug_simp ~> simp_debug
3749 * Support for real valued configuration options, using simplistic
3750 floating-point notation that coincides with the inner syntax for
3753 * Support for real valued preferences (with approximative PGIP type):
3754 front-ends need to accept "pgint" values in float notation.
3757 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3760 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3765 * Command 'type_synonym' (with single argument) replaces somewhat
3766 outdated 'types', which is still available as legacy feature for some
3769 * Command 'nonterminal' (with 'and' separated list of arguments)
3770 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3772 * Command 'notepad' replaces former 'example_proof' for
3773 experimentation in Isar without any result. INCOMPATIBILITY.
3775 * Locale interpretation commands 'interpret' and 'sublocale' accept
3776 lists of equations to map definitions in a locale to appropriate
3777 entities in the context of the interpretation. The 'interpretation'
3778 command already provided this functionality.
3780 * Diagnostic command 'print_dependencies' prints the locale instances
3781 that would be activated if the specified expression was interpreted in
3782 the current context. Variant "print_dependencies!" assumes a context
3783 without interpretations.
3785 * Diagnostic command 'print_interps' prints interpretations in proofs
3786 in addition to interpretations in theories.
3788 * Discontinued obsolete 'global' and 'local' commands to manipulate
3789 the theory name space. Rare INCOMPATIBILITY. The ML functions
3790 Sign.root_path and Sign.local_path may be applied directly where this
3791 feature is still required for historical reasons.
3793 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3794 'definition' instead.
3796 * The "prems" fact, which refers to the accidental collection of
3797 foundational premises in the context, is now explicitly marked as
3798 legacy feature and will be discontinued soon. Consider using "assms"
3799 of the head statement or reference facts by explicit names.
3801 * Document antiquotations @{class} and @{type} print classes and type
3804 * Document antiquotation @{file} checks file/directory entries within
3805 the local file system.
3810 * Coercive subtyping: functions can be declared as coercions and type
3811 inference will add them as necessary upon input of a term. Theory
3812 Complex_Main declares real :: nat => real and real :: int => real as
3813 coercions. A coercion function f is declared like this:
3815 declare [[coercion f]]
3817 To lift coercions through type constructors (e.g. from nat => real to
3818 nat list => real list), map functions can be declared, e.g.
3820 declare [[coercion_map map]]
3822 Currently coercion inference is activated only in theories including
3823 real numbers, i.e. descendants of Complex_Main. This is controlled by
3824 the configuration option "coercion_enabled", e.g. it can be enabled in
3825 other theories like this:
3827 declare [[coercion_enabled]]
3829 * Command 'partial_function' provides basic support for recursive
3830 function definitions over complete partial orders. Concrete instances
3831 are provided for i) the option type, ii) tail recursion on arbitrary
3832 types, and iii) the heap monad of Imperative_HOL. See
3833 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3836 * Function package: f.psimps rules are no longer implicitly declared
3837 as [simp]. INCOMPATIBILITY.
3839 * Datatype package: theorems generated for executable equality (class
3840 "eq") carry proper names and are treated as default code equations.
3842 * Inductive package: now offers command 'inductive_simps' to
3843 automatically derive instantiated and simplified equations for
3844 inductive predicates, similar to 'inductive_cases'.
3846 * Command 'enriched_type' allows to register properties of the
3847 functorial structure of types.
3849 * Improved infrastructure for term evaluation using code generator
3850 techniques, in particular static evaluation conversions.
3852 * Code generator: Scala (2.8 or higher) has been added to the target
3855 * Code generator: globbing constant expressions "*" and "Theory.*"
3856 have been replaced by the more idiomatic "_" and "Theory._".
3859 * Code generator: export_code without explicit file declaration prints
3860 to standard output. INCOMPATIBILITY.
3862 * Code generator: do not print function definitions for case
3863 combinators any longer.
3865 * Code generator: simplification with rules determined with
3866 src/Tools/Code/code_simp.ML and method "code_simp".
3868 * Code generator for records: more idiomatic representation of record
3869 types. Warning: records are not covered by ancient SML code
3870 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3871 rep_datatype declaration helps to succeed then:
3875 rep_datatype foo_ext ...
3877 * Records: logical foundation type for records does not carry a
3878 '_type' suffix any longer (obsolete due to authentic syntax).
3881 * Quickcheck now by default uses exhaustive testing instead of random
3882 testing. Random testing can be invoked by "quickcheck [random]",
3883 exhaustive testing by "quickcheck [exhaustive]".
3885 * Quickcheck instantiates polymorphic types with small finite
3886 datatypes by default. This enables a simple execution mechanism to
3887 handle quantifiers and function equality over the finite datatypes.
3889 * Quickcheck random generator has been renamed from "code" to
3890 "random". INCOMPATIBILITY.
3892 * Quickcheck now has a configurable time limit which is set to 30
3893 seconds by default. This can be changed by adding [timeout = n] to the
3894 quickcheck command. The time limit for Auto Quickcheck is still set
3897 * Quickcheck in locales considers interpretations of that locale for
3898 counter example search.
3901 - Added "smt" and "remote_smt" provers based on the "smt" proof
3902 method. See the Sledgehammer manual for details ("isabelle doc
3905 sledgehammer atp_info ~> sledgehammer running_provers
3906 sledgehammer atp_kill ~> sledgehammer kill_provers
3907 sledgehammer available_atps ~> sledgehammer available_provers
3910 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3911 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3912 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3913 (and "ms" and "min" are no longer supported)
3918 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3919 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3921 - Added support for partial quotient types.
3922 - Added local versions of the "Nitpick.register_xxx" functions.
3923 - Added "whack" option.
3924 - Allow registration of quotient types as codatatypes.
3925 - Improved "merge_type_vars" option to merge more types.
3926 - Removed unsound "fast_descrs" option.
3927 - Added custom symmetry breaking for datatypes, making it possible to reach
3928 higher cardinalities.
3929 - Prevent the expansion of too large definitions.
3931 * Proof methods "metis" and "meson" now have configuration options
3932 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3933 to diagnose these tools. E.g.
3935 using [[metis_trace = true]]
3937 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3938 manually as command 'solve_direct'.
3940 * The default SMT solver Z3 must be enabled explicitly (due to
3941 licensing issues) by setting the environment variable
3942 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3943 commercial applications, the SMT solver CVC3 is provided as fall-back;
3944 changing the SMT solver is done via the configuration option
3947 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3948 i.e. "remote_cvc3" and "remote_z3".
3950 * Added basic SMT support for datatypes, records, and typedefs using
3951 the oracle mode (no proofs). Direct support of pairs has been dropped
3952 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3953 support for a similar behavior). Minor INCOMPATIBILITY.
3955 * Changed SMT configuration options:
3957 z3_proofs ~> smt_oracle (with inverted meaning)
3958 z3_trace_assms ~> smt_trace_used_facts
3971 * Boogie output files (.b2i files) need to be declared in the theory
3974 * Simplification procedure "list_to_set_comprehension" rewrites list
3975 comprehensions applied to List.set to set comprehensions. Occasional
3976 INCOMPATIBILITY, may be deactivated like this:
3978 declare [[simproc del: list_to_set_comprehension]]
3980 * Removed old version of primrec package. INCOMPATIBILITY.
3982 * Removed simplifier congruence rule of "prod_case", as has for long
3983 been the case with "split". INCOMPATIBILITY.
3985 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3987 * Removed [split_format ... and ... and ...] version of
3988 [split_format]. Potential INCOMPATIBILITY.
3990 * Predicate "sorted" now defined inductively, with nice induction
3991 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3993 * Constant "contents" renamed to "the_elem", to free the generic name
3994 contents for other uses. INCOMPATIBILITY.
3996 * Renamed class eq and constant eq (for code generation) to class
3997 equal and constant equal, plus renaming of related facts and various
3998 tuning. INCOMPATIBILITY.
4000 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4002 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4005 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4006 avoid confusion with finite sets. INCOMPATIBILITY.
4008 * Abandoned locales equiv, congruent and congruent2 for equivalence
4009 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4012 * Some previously unqualified names have been qualified:
4019 Trueprop ~> HOL.Trueprop
4024 op --> ~> HOL.implies
4036 Pair ~> Product_Type.Pair
4037 fst ~> Product_Type.fst
4038 snd ~> Product_Type.snd
4039 curry ~> Product_Type.curry
4041 Collect ~> Set.Collect
4045 * More canonical naming convention for some fundamental definitions:
4047 bot_bool_eq ~> bot_bool_def
4048 top_bool_eq ~> top_bool_def
4049 inf_bool_eq ~> inf_bool_def
4050 sup_bool_eq ~> sup_bool_def
4051 bot_fun_eq ~> bot_fun_def
4052 top_fun_eq ~> top_fun_def
4053 inf_fun_eq ~> inf_fun_def
4054 sup_fun_eq ~> sup_fun_def
4058 * More stylized fact names:
4060 expand_fun_eq ~> fun_eq_iff
4061 expand_set_eq ~> set_eq_iff
4063 nat_number ~> eval_nat_numeral
4067 * Refactoring of code-generation specific operations in theory List:
4073 mem_iff ~> member_def
4074 null_empty ~> null_def
4076 INCOMPATIBILITY. Note that these were not supposed to be used
4077 regularly unless for striking reasons; their main purpose was code
4080 Various operations from the Haskell prelude are used for generating
4083 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4084 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4085 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4087 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4088 "*" and "+" respectively. INCOMPATIBILITY.
4090 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4091 "Sum_Type.Plus" instead.
4093 * Constant "split" has been merged with constant "prod_case"; names of
4094 ML functions, facts etc. involving split have been retained so far,
4095 though. INCOMPATIBILITY.
4097 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4098 instead. INCOMPATIBILITY.
4100 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4103 * Former theory Library/Enum is now part of the HOL-Main image.
4104 INCOMPATIBILITY: all constants of the Enum theory now have to be
4105 referred to by its qualified name.
4108 nlists ~> Enum.nlists
4109 product ~> Enum.product
4111 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4112 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4115 * Theory Library/SetsAndFunctions has been split into
4116 Library/Function_Algebras and Library/Set_Algebras; canonical names
4117 for instance definitions for functions; various improvements.
4120 * Theory Library/Multiset provides stable quicksort implementation of
4123 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4126 * Session Multivariate_Analysis: introduced a type class for euclidean
4127 space. Most theorems are now stated in terms of euclidean spaces
4128 instead of finite cartesian products.
4131 real ^ 'n ~> 'a::real_vector
4132 ~> 'a::euclidean_space
4133 ~> 'a::ordered_euclidean_space
4134 (depends on your needs)
4138 \<chi> x. _ ~> \<chi>\<chi> x. _
4141 Also note that the indices are now natural numbers and not from some
4142 finite type. Finite cartesian products of euclidean spaces, products
4143 of euclidean spaces the real and complex numbers are instantiated to
4144 be euclidean_spaces. INCOMPATIBILITY.
4146 * Session Probability: introduced pextreal as positive extended real
4147 numbers. Use pextreal as value for measures. Introduce the
4148 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4149 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4150 the integral in Multivariate Analysis. INCOMPATIBILITY.
4152 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4155 * Session SPARK (with image HOL-SPARK) provides commands to load and
4156 prove verification conditions generated by the SPARK Ada program
4157 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4162 * Theorems for additive ring operations (locale abelian_monoid and
4163 descendants) are generated by interpretation from their multiplicative
4164 counterparts. Names (in particular theorem names) have the mandatory
4165 qualifier 'add'. Previous theorem names are redeclared for
4168 * Structure "int_ring" is now an abbreviation (previously a
4169 definition). This fits more natural with advanced interpretations.
4174 * The domain package now runs in definitional mode by default: The
4175 former command 'new_domain' is now called 'domain'. To use the domain
4176 package in its original axiomatic mode, use 'domain (unsafe)'.
4179 * The new class "domain" is now the default sort. Class "predomain"
4180 is an unpointed version of "domain". Theories can be updated by
4181 replacing sort annotations as shown below. INCOMPATIBILITY.
4183 'a::type ~> 'a::countable
4184 'a::cpo ~> 'a::predomain
4185 'a::pcpo ~> 'a::domain
4187 * The old type class "rep" has been superseded by class "domain".
4188 Accordingly, users of the definitional package must remove any
4189 "default_sort rep" declarations. INCOMPATIBILITY.
4191 * The domain package (definitional mode) now supports unpointed
4192 predomain argument types, as long as they are marked 'lazy'. (Strict
4193 arguments must be in class "domain".) For example, the following
4194 domain definition now works:
4196 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4198 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4199 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4200 'a option, and 'a list. Additionally, it configures fixrec and the
4201 domain package to work with these types. For example:
4203 fixrec isInl :: "('a + 'b) u -> tr"
4204 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4206 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4208 * The "(permissive)" option of fixrec has been replaced with a
4209 per-equation "(unchecked)" option. See
4210 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4212 * The "bifinite" class no longer fixes a constant "approx"; the class
4213 now just asserts that such a function exists. INCOMPATIBILITY.
4215 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4216 defines an embedding of type 'a defl into udom by default; instances
4217 of "bifinite" and "domain" classes are available in
4218 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4220 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4222 * The predicate "directed" has been removed. INCOMPATIBILITY.
4224 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4226 * The function "cprod_map" has been renamed to "prod_map".
4229 * The monadic bind operator on each powerdomain has new binder syntax
4230 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4231 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4233 * The infix syntax for binary union on each powerdomain has changed
4234 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4235 syntax. INCOMPATIBILITY.
4237 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4238 still supported as an input translation.
4240 * Renamed some theorems (the original names are also still available).
4242 expand_fun_below ~> fun_below_iff
4243 below_fun_ext ~> fun_belowI
4244 expand_cfun_eq ~> cfun_eq_iff
4245 ext_cfun ~> cfun_eqI
4246 expand_cfun_below ~> cfun_below_iff
4247 below_cfun_ext ~> cfun_belowI
4248 cont2cont_Rep_CFun ~> cont2cont_APP
4250 * The Abs and Rep functions for various types have changed names.
4251 Related theorem names have also changed to match. INCOMPATIBILITY.
4253 Rep_CFun ~> Rep_cfun
4254 Abs_CFun ~> Abs_cfun
4255 Rep_Sprod ~> Rep_sprod
4256 Abs_Sprod ~> Abs_sprod
4257 Rep_Ssum ~> Rep_ssum
4258 Abs_Ssum ~> Abs_ssum
4260 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4261 been renamed to *_bottom_iff. INCOMPATIBILITY.
4263 * Various changes to bisimulation/coinduction with domain package:
4265 - Definitions of "bisim" constants no longer mention definedness.
4266 - With mutual recursion, "bisim" predicate is now curried.
4267 - With mutual recursion, each type gets a separate coind theorem.
4268 - Variable names in bisim_def and coinduct rules have changed.
4272 * Case combinators generated by the domain package for type "foo" are
4273 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4275 * Several theorems have been renamed to more accurately reflect the
4276 names of constants and types involved. INCOMPATIBILITY.
4278 thelub_const ~> lub_const
4279 lub_const ~> is_lub_const
4281 is_lub_lub ~> is_lubD2
4283 unique_lub ~> is_lub_unique
4284 is_ub_lub ~> is_lub_rangeD1
4285 lub_bin_chain ~> is_lub_bin_chain
4286 lub_fun ~> is_lub_fun
4287 thelub_fun ~> lub_fun
4288 thelub_cfun ~> lub_cfun
4289 thelub_Pair ~> lub_Pair
4290 lub_cprod ~> is_lub_prod
4291 thelub_cprod ~> lub_prod
4292 minimal_cprod ~> minimal_prod
4293 inst_cprod_pcpo ~> inst_prod_pcpo
4295 compact_UU ~> compact_bottom
4296 deflation_UU ~> deflation_bottom
4297 finite_deflation_UU ~> finite_deflation_bottom
4299 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4301 sq_ord_less_eq_trans ~> below_eq_trans
4302 sq_ord_eq_less_trans ~> eq_below_trans
4303 refl_less ~> below_refl
4304 trans_less ~> below_trans
4305 antisym_less ~> below_antisym
4306 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4307 box_less ~> box_below
4308 rev_trans_less ~> rev_below_trans
4309 not_less2not_eq ~> not_below2not_eq
4310 less_UU_iff ~> below_UU_iff
4311 flat_less_iff ~> flat_below_iff
4312 adm_less ~> adm_below
4313 adm_not_less ~> adm_not_below
4314 adm_compact_not_less ~> adm_compact_not_below
4315 less_fun_def ~> below_fun_def
4316 expand_fun_less ~> fun_below_iff
4317 less_fun_ext ~> fun_belowI
4318 less_discr_def ~> below_discr_def
4319 discr_less_eq ~> discr_below_eq
4320 less_unit_def ~> below_unit_def
4321 less_cprod_def ~> below_prod_def
4322 prod_lessI ~> prod_belowI
4323 Pair_less_iff ~> Pair_below_iff
4324 fst_less_iff ~> fst_below_iff
4325 snd_less_iff ~> snd_below_iff
4326 expand_cfun_less ~> cfun_below_iff
4327 less_cfun_ext ~> cfun_belowI
4328 injection_less ~> injection_below
4329 less_up_def ~> below_up_def
4330 not_Iup_less ~> not_Iup_below
4331 Iup_less ~> Iup_below
4333 Def_inject_less_eq ~> Def_below_Def
4334 Def_less_is_eq ~> Def_below_iff
4335 spair_less_iff ~> spair_below_iff
4336 less_sprod ~> below_sprod
4337 spair_less ~> spair_below
4338 sfst_less_iff ~> sfst_below_iff
4339 ssnd_less_iff ~> ssnd_below_iff
4340 fix_least_less ~> fix_least_below
4341 dist_less_one ~> dist_below_one
4342 less_ONE ~> below_ONE
4343 ONE_less_iff ~> ONE_below_iff
4344 less_sinlD ~> below_sinlD
4345 less_sinrD ~> below_sinrD
4350 * All constant names are now qualified internally and use proper
4351 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4356 * Antiquotation @{assert} inlines a function bool -> unit that raises
4357 Fail if the argument is false. Due to inlining the source position of
4358 failed assertions is included in the error output.
4360 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4361 text is in practice always evaluated with a stable theory checkpoint.
4362 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4364 * Antiquotation @{theory A} refers to theory A from the ancestry of
4365 the current context, not any accidental theory loader state as before.
4366 Potential INCOMPATIBILITY, subtle change in semantics.
4368 * Syntax.pretty_priority (default 0) configures the required priority
4369 of pretty-printed output and thus affects insertion of parentheses.
4371 * Syntax.default_root (default "any") configures the inner syntax
4372 category (nonterminal symbol) for parsing of terms.
4374 * Former exception Library.UnequalLengths now coincides with
4375 ListPair.UnequalLengths.
4377 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4378 main functionality is provided by structure Simplifier.
4380 * Renamed raw "explode" function to "raw_explode" to emphasize its
4381 meaning. Note that internally to Isabelle, Symbol.explode is used in
4382 almost all situations.
4384 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4385 See implementation manual for further details on exceptions in
4388 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4391 * Renamed structure PureThy to Pure_Thy and moved most of its
4392 operations to structure Global_Theory, to emphasize that this is
4393 rarely-used global-only stuff.
4395 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4396 instead (or tracing for high-volume output).
4398 * Configuration option show_question_marks only affects regular pretty
4399 printing of types and terms, not raw Term.string_of_vname.
4401 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4402 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4403 @{thms} for most purposes.
4405 * ML structure Unsynchronized is never opened, not even in Isar
4406 interaction mode as before. Old Unsynchronized.set etc. have been
4407 discontinued -- use plain := instead. This should be *rare* anyway,
4408 since modern tools always work via official context data, notably
4409 configuration options.
4411 * Parallel and asynchronous execution requires special care concerning
4412 interrupts. Structure Exn provides some convenience functions that
4413 avoid working directly with raw Interrupt. User code must not absorb
4414 interrupts -- intermediate handling (for cleanup etc.) needs to be
4415 followed by re-raising of the original exception. Another common
4416 source of mistakes are "handle _" patterns, which make the meaning of
4417 the program subject to physical effects of the environment.
4421 New in Isabelle2009-2 (June 2010)
4422 ---------------------------------
4426 * Authentic syntax for *all* logical entities (type classes, type
4427 constructors, term constants): provides simple and robust
4428 correspondence between formal entities and concrete syntax. Within
4429 the parse tree / AST representations, "constants" are decorated by
4430 their category (class, type, const) and spelled out explicitly with
4431 their full internal name.
4433 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4434 and translations (translation rules and translation functions in ML).
4435 Some hints on upgrading:
4437 - Many existing uses of 'syntax' and 'translations' can be replaced
4438 by more modern 'type_notation', 'notation' and 'abbreviation',
4439 which are independent of this issue.
4441 - 'translations' require markup within the AST; the term syntax
4442 provides the following special forms:
4444 CONST c -- produces syntax version of constant c from context
4445 XCONST c -- literally c, checked as constant from context
4446 c -- literally c, if declared by 'syntax'
4448 Plain identifiers are treated as AST variables -- occasionally the
4449 system indicates accidental variables via the error "rhs contains
4452 Type classes and type constructors are marked according to their
4453 concrete syntax. Some old translations rules need to be written
4454 for the "type" category, using type constructor application
4455 instead of pseudo-term application of the default category
4458 - 'parse_translation' etc. in ML may use the following
4461 @{class_syntax c} -- type class c within parse tree / AST
4462 @{term_syntax c} -- type constructor c within parse tree / AST
4463 @{const_syntax c} -- ML version of "CONST c" above
4464 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4466 - Literal types within 'typed_print_translations', i.e. those *not*
4467 represented as pseudo-terms are represented verbatim. Use @{class
4468 c} or @{type_name c} here instead of the above syntax
4471 Note that old non-authentic syntax was based on unqualified base
4472 names, so all of the above "constant" names would coincide. Recall
4473 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4474 diagnose syntax problems.
4476 * Type constructors admit general mixfix syntax, not just infix.
4478 * Concrete syntax may be attached to local entities without a proof
4479 body, too. This works via regular mixfix annotations for 'fix',
4480 'def', 'obtain' etc. or via the explicit 'write' command, which is
4481 similar to the 'notation' command in theory specifications.
4483 * Discontinued unnamed infix syntax (legacy feature for many years) --
4484 need to specify constant name and syntax separately. Internal ML
4485 datatype constructors have been renamed from InfixName to Infix etc.
4486 Minor INCOMPATIBILITY.
4488 * Schematic theorem statements need to be explicitly markup as such,
4489 via commands 'schematic_lemma', 'schematic_theorem',
4490 'schematic_corollary'. Thus the relevance of the proof is made
4491 syntactically clear, which impacts performance in a parallel or
4492 asynchronous interactive environment. Minor INCOMPATIBILITY.
4494 * Use of cumulative prems via "!" in some proof methods has been
4495 discontinued (old legacy feature).
4497 * References 'trace_simp' and 'debug_simp' have been replaced by
4498 configuration options stored in the context. Enabling tracing (the
4499 case of debugging is similar) in proofs works via
4501 using [[trace_simp = true]]
4503 Tracing is then active for all invocations of the simplifier in
4504 subsequent goal refinement steps. Tracing may also still be enabled or
4505 disabled via the ProofGeneral settings menu.
4507 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4508 'hide_fact' replace the former 'hide' KIND command. Minor
4511 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4512 more efficient than combinations with -q1 or -q2.
4517 * Proofterms record type-class reasoning explicitly, using the
4518 "unconstrain" operation internally. This eliminates all sort
4519 constraints from a theorem and proof, introducing explicit
4520 OFCLASS-premises. On the proof term level, this operation is
4521 automatically applied at theorem boundaries, such that closed proofs
4522 are always free of sort constraints. INCOMPATIBILITY for tools that
4523 inspect proof terms.
4525 * Local theory specifications may depend on extra type variables that
4526 are not present in the result type -- arguments TYPE('a) :: 'a itself
4527 are added internally. For example:
4529 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4531 * Predicates of locales introduced by classes carry a mandatory
4532 "class" prefix. INCOMPATIBILITY.
4534 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4536 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4539 * Command 'code_reflect' allows to incorporate generated ML code into
4540 runtime environment; replaces immature code_datatype antiquotation.
4543 * Code generator: simple concept for abstract datatypes obeying
4546 * Code generator: details of internal data cache have no impact on the
4547 user space functionality any longer.
4549 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4550 subgoals. This is more appropriate for interpretations with 'where'.
4553 * Command 'example_proof' opens an empty proof body. This allows to
4554 experiment with Isar, without producing any persistent result.
4556 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4557 within a local theory context, with explicit checking of the
4558 constructors involved (in contrast to the raw 'syntax' versions).
4560 * Commands 'types' and 'typedecl' now work within a local theory
4561 context -- without introducing dependencies on parameters or
4562 assumptions, which is not possible in Isabelle/Pure.
4564 * Command 'defaultsort' has been renamed to 'default_sort', it works
4565 within a local theory context. Minor INCOMPATIBILITY.
4570 * Command 'typedef' now works within a local theory context -- without
4571 introducing dependencies on parameters or assumptions, which is not
4572 possible in Isabelle/Pure/HOL. Note that the logical environment may
4573 contain multiple interpretations of local typedefs (with different
4574 non-emptiness proofs), even in a global theory context.
4576 * New package for quotient types. Commands 'quotient_type' and
4577 'quotient_definition' may be used for defining types and constants by
4578 quotient constructions. An example is the type of integers created by
4579 quotienting pairs of natural numbers:
4582 intrel :: "(nat * nat) => (nat * nat) => bool"
4584 "intrel (x, y) (u, v) = (x + v = u + y)"
4586 quotient_type int = "nat * nat" / intrel
4587 by (auto simp add: equivp_def expand_fun_eq)
4590 "0::int" is "(0::nat, 0::nat)"
4592 The method "lifting" can be used to lift of theorems from the
4593 underlying "raw" type to the quotient type. The example
4594 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4595 construction and provides a reasoning infrastructure for finite sets.
4597 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4598 clash with new theory Quotient in Main HOL.
4600 * Moved the SMT binding into the main HOL session, eliminating
4601 separate HOL-SMT session.
4603 * List membership infix mem operation is only an input abbreviation.
4606 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4607 for future developements; former Library/Word.thy is still present in
4608 the AFP entry RSAPPS.
4610 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4611 longer shadowed. INCOMPATIBILITY.
4613 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4616 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4619 * Dropped normalizing_semiring etc; use the facts in semiring classes
4620 instead. INCOMPATIBILITY.
4622 * Dropped several real-specific versions of lemmas about floor and
4623 ceiling; use the generic lemmas from theory "Archimedean_Field"
4624 instead. INCOMPATIBILITY.
4626 floor_number_of_eq ~> floor_number_of
4627 le_floor_eq_number_of ~> number_of_le_floor
4628 le_floor_eq_zero ~> zero_le_floor
4629 le_floor_eq_one ~> one_le_floor
4630 floor_less_eq_number_of ~> floor_less_number_of
4631 floor_less_eq_zero ~> floor_less_zero
4632 floor_less_eq_one ~> floor_less_one
4633 less_floor_eq_number_of ~> number_of_less_floor
4634 less_floor_eq_zero ~> zero_less_floor
4635 less_floor_eq_one ~> one_less_floor
4636 floor_le_eq_number_of ~> floor_le_number_of
4637 floor_le_eq_zero ~> floor_le_zero
4638 floor_le_eq_one ~> floor_le_one
4639 floor_subtract_number_of ~> floor_diff_number_of
4640 floor_subtract_one ~> floor_diff_one
4641 ceiling_number_of_eq ~> ceiling_number_of
4642 ceiling_le_eq_number_of ~> ceiling_le_number_of
4643 ceiling_le_zero_eq ~> ceiling_le_zero
4644 ceiling_le_eq_one ~> ceiling_le_one
4645 less_ceiling_eq_number_of ~> number_of_less_ceiling
4646 less_ceiling_eq_zero ~> zero_less_ceiling
4647 less_ceiling_eq_one ~> one_less_ceiling
4648 ceiling_less_eq_number_of ~> ceiling_less_number_of
4649 ceiling_less_eq_zero ~> ceiling_less_zero
4650 ceiling_less_eq_one ~> ceiling_less_one
4651 le_ceiling_eq_number_of ~> number_of_le_ceiling
4652 le_ceiling_eq_zero ~> zero_le_ceiling
4653 le_ceiling_eq_one ~> one_le_ceiling
4654 ceiling_subtract_number_of ~> ceiling_diff_number_of
4655 ceiling_subtract_one ~> ceiling_diff_one
4657 * Theory "Finite_Set": various folding_XXX locales facilitate the
4658 application of the various fold combinators on finite sets.
4660 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4661 provides abstract red-black tree type which is backed by "RBT_Impl" as
4662 implementation. INCOMPATIBILTY.
4664 * Theory Library/Coinductive_List has been removed -- superseded by
4665 AFP/thys/Coinductive.
4667 * Theory PReal, including the type "preal" and related operations, has
4668 been removed. INCOMPATIBILITY.
4670 * Real: new development using Cauchy Sequences.
4672 * Split off theory "Big_Operators" containing setsum, setprod,
4673 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4675 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4676 "Int" etc. INCOMPATIBILITY.
4678 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4680 * New set of rules "ac_simps" provides combined assoc / commute
4681 rewrites for all interpretations of the appropriate generic locales.
4683 * Renamed theory "OrderedGroup" to "Groups" and split theory
4684 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4685 appropriate and more consistent names suitable for name prefixes
4686 within the HOL theories. INCOMPATIBILITY.
4688 * Some generic constants have been put to appropriate theories:
4689 - less_eq, less: Orderings
4690 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4691 - inverse, divide: Rings
4694 * More consistent naming of type classes involving orderings (and
4697 lower_semilattice ~> semilattice_inf
4698 upper_semilattice ~> semilattice_sup
4700 dense_linear_order ~> dense_linorder
4702 pordered_ab_group_add ~> ordered_ab_group_add
4703 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4704 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4705 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4706 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4707 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4708 pordered_cancel_semiring ~> ordered_cancel_semiring
4709 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4710 pordered_comm_ring ~> ordered_comm_ring
4711 pordered_comm_semiring ~> ordered_comm_semiring
4712 pordered_ring ~> ordered_ring
4713 pordered_ring_abs ~> ordered_ring_abs
4714 pordered_semiring ~> ordered_semiring
4716 ordered_ab_group_add ~> linordered_ab_group_add
4717 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4718 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4719 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4720 ordered_field ~> linordered_field
4721 ordered_field_no_lb ~> linordered_field_no_lb
4722 ordered_field_no_ub ~> linordered_field_no_ub
4723 ordered_field_dense_linear_order ~> dense_linordered_field
4724 ordered_idom ~> linordered_idom
4725 ordered_ring ~> linordered_ring
4726 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4727 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4728 ordered_ring_strict ~> linordered_ring_strict
4729 ordered_semidom ~> linordered_semidom
4730 ordered_semiring ~> linordered_semiring
4731 ordered_semiring_1 ~> linordered_semiring_1
4732 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4733 ordered_semiring_strict ~> linordered_semiring_strict
4735 The following slightly odd type classes have been moved to a
4736 separate theory Library/Lattice_Algebras:
4738 lordered_ab_group_add ~> lattice_ab_group_add
4739 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4740 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4741 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4742 lordered_ring ~> lattice_ring
4746 * Refined field classes:
4747 - classes division_ring_inverse_zero, field_inverse_zero,
4748 linordered_field_inverse_zero include rule inverse 0 = 0 --
4749 subsumes former division_by_zero class;
4750 - numerous lemmas have been ported from field to division_ring.
4753 * Refined algebra theorem collections:
4754 - dropped theorem group group_simps, use algebra_simps instead;
4755 - dropped theorem group ring_simps, use field_simps instead;
4756 - proper theorem collection field_simps subsumes former theorem
4757 groups field_eq_simps and field_simps;
4758 - dropped lemma eq_minus_self_iff which is a duplicate for
4762 * Theory Finite_Set and List: some lemmas have been generalized from
4765 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4766 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4767 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4768 union_Union_fold_union ~> sup_Sup_fold_sup
4769 Inter_fold_inter ~> Inf_fold_inf
4770 Union_fold_union ~> Sup_fold_sup
4771 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4772 union_UNION_fold_union ~> sup_SUPR_fold_sup
4773 INTER_fold_inter ~> INFI_fold_inf
4774 UNION_fold_union ~> SUPR_fold_sup
4776 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4777 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4778 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4779 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4780 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4781 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4783 * Reorganized theory Multiset: swapped notation of pointwise and
4786 - pointwise ordering is instance of class order with standard syntax
4788 - multiset ordering has syntax <=# and <#; partial order properties
4789 are provided by means of interpretation with prefix
4791 - less duplication, less historical organization of sections,
4792 conversion from associations lists to multisets, rudimentary code
4794 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4799 multiset_eq_conv_count_eq ~> multiset_ext_iff
4800 multi_count_ext ~> multiset_ext
4801 diff_union_inverse2 ~> diff_union_cancelR
4805 * Theory Permutation: replaced local "remove" by List.remove1.
4807 * Code generation: ML and OCaml code is decorated with signatures.
4809 * Theory List: added transpose.
4811 * Library/Nat_Bijection.thy is a collection of bijective functions
4812 between nat and other types, which supersedes the older libraries
4813 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4816 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4817 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4818 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4819 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4820 Countable.pair_encode ~> prod_encode
4821 NatIso.prod2nat ~> prod_encode
4822 NatIso.nat2prod ~> prod_decode
4823 NatIso.sum2nat ~> sum_encode
4824 NatIso.nat2sum ~> sum_decode
4825 NatIso.list2nat ~> list_encode
4826 NatIso.nat2list ~> list_decode
4827 NatIso.set2nat ~> set_encode
4828 NatIso.nat2set ~> set_decode
4831 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4832 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4833 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4834 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4835 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4836 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4837 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4838 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4839 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4840 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4841 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4842 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4843 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4846 - Renamed ATP commands:
4847 atp_info ~> sledgehammer running_atps
4848 atp_kill ~> sledgehammer kill_atps
4849 atp_messages ~> sledgehammer messages
4850 atp_minimize ~> sledgehammer minimize
4851 print_atps ~> sledgehammer available_atps
4853 - Added user's manual ("isabelle doc sledgehammer").
4854 - Added option syntax and "sledgehammer_params" to customize
4855 Sledgehammer's behavior. See the manual for details.
4856 - Modified the Isar proof reconstruction code so that it produces
4857 direct proofs rather than proofs by contradiction. (This feature
4858 is still experimental.)
4859 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4861 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4864 - Added and implemented "binary_ints" and "bits" options.
4865 - Added "std" option and implemented support for nonstandard models.
4866 - Added and implemented "finitize" option to improve the precision
4867 of infinite datatypes based on a monotonicity analysis.
4868 - Added support for quotient types.
4869 - Added support for "specification" and "ax_specification"
4871 - Added support for local definitions (for "function" and
4872 "termination" proofs).
4873 - Added support for term postprocessors.
4874 - Optimized "Multiset.multiset" and "FinFun.finfun".
4875 - Improved efficiency of "destroy_constrs" optimization.
4876 - Fixed soundness bugs related to "destroy_constrs" optimization and
4878 - Fixed soundness bug related to higher-order constructors.
4879 - Fixed soundness bug when "full_descrs" is enabled.
4880 - Improved precision of set constructs.
4881 - Added "atoms" option.
4882 - Added cache to speed up repeated Kodkod invocations on the same
4884 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4885 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4886 "SAT4J_Light". INCOMPATIBILITY.
4887 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4888 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4889 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4891 * Method "induct" now takes instantiations of the form t, where t is not
4892 a variable, as a shorthand for "x == t", where x is a fresh variable.
4893 If this is not intended, t has to be enclosed in parentheses.
4894 By default, the equalities generated by definitional instantiations
4895 are pre-simplified, which may cause parameters of inductive cases
4896 to disappear, or may even delete some of the inductive cases.
4897 Use "induct (no_simp)" instead of "induct" to restore the old
4898 behaviour. The (no_simp) option is also understood by the "cases"
4899 and "nominal_induct" methods, which now perform pre-simplification, too.
4905 * Variable names in lemmas generated by the domain package have
4906 changed; the naming scheme is now consistent with the HOL datatype
4907 package. Some proof scripts may be affected, INCOMPATIBILITY.
4909 * The domain package no longer defines the function "foo_copy" for
4910 recursive domain "foo". The reach lemma is now stated directly in
4911 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4912 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4914 * Most definedness lemmas generated by the domain package (previously
4915 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4916 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4917 Proofs that used definedness lemmas as intro rules may break,
4918 potential INCOMPATIBILITY.
4920 * Induction and casedist rules generated by the domain package now
4921 declare proper case_names (one called "bottom", and one named for each
4922 constructor). INCOMPATIBILITY.
4924 * For mutually-recursive domains, separate "reach" and "take_lemma"
4925 rules are generated for each domain, INCOMPATIBILITY.
4927 foo_bar.reach ~> foo.reach bar.reach
4928 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4930 * Some lemmas generated by the domain package have been renamed for
4931 consistency with the datatype package, INCOMPATIBILITY.
4933 foo.ind ~> foo.induct
4934 foo.finite_ind ~> foo.finite_induct
4935 foo.coind ~> foo.coinduct
4936 foo.casedist ~> foo.exhaust
4937 foo.exhaust ~> foo.nchotomy
4939 * For consistency with other definition packages, the fixrec package
4940 now generates qualified theorem names, INCOMPATIBILITY.
4942 foo_simps ~> foo.simps
4943 foo_unfold ~> foo.unfold
4944 foo_induct ~> foo.induct
4946 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4947 method and internal fixrec proofs now use the default simpset instead.
4950 * The "contlub" predicate has been removed. Proof scripts should use
4951 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4953 * The "admw" predicate has been removed, INCOMPATIBILITY.
4955 * The constants cpair, cfst, and csnd have been removed in favor of
4956 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4961 * Antiquotations for basic formal entities:
4963 @{class NAME} -- type class
4964 @{class_syntax NAME} -- syntax representation of the above
4966 @{type_name NAME} -- logical type
4967 @{type_abbrev NAME} -- type abbreviation
4968 @{nonterminal NAME} -- type of concrete syntactic category
4969 @{type_syntax NAME} -- syntax representation of any of the above
4971 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4972 @{const_abbrev NAME} -- abbreviated constant
4973 @{const_syntax NAME} -- syntax representation of any of the above
4975 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4976 syntax constant (cf. 'syntax' command).
4978 * Antiquotation @{make_string} inlines a function to print arbitrary
4979 values similar to the ML toplevel. The result is compiler dependent
4980 and may fall back on "?" in certain situations.
4982 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4983 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4984 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4985 not work with the asynchronous Isar document model.
4987 * Configuration options now admit dynamic default values, depending on
4988 the context or even global references.
4990 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4991 uses an efficient external library if available (for Poly/ML).
4993 * Renamed some important ML structures, while keeping the old names
4994 for some time as aliases within the structure Legacy:
4996 OuterKeyword ~> Keyword
4999 OuterSyntax ~> Outer_Syntax
5000 PrintMode ~> Print_Mode
5001 SpecParse ~> Parse_Spec
5004 ThyOutput ~> Thy_Output
5005 TypeInfer ~> Type_Infer
5007 Note that "open Legacy" simplifies porting of sources, but forgetting
5008 to remove it again will complicate porting again in the future.
5010 * Most operations that refer to a global context are named
5011 accordingly, e.g. Simplifier.global_context or
5012 ProofContext.init_global. There are some situations where a global
5013 context actually works, but under normal circumstances one needs to
5014 pass the proper local context through the code!
5016 * Discontinued old TheoryDataFun with its copy/init operation -- data
5017 needs to be pure. Functor Theory_Data_PP retains the traditional
5018 Pretty.pp argument to merge, which is absent in the standard
5019 Theory_Data version.
5021 * Sorts.certify_sort and derived "cert" operations for types and terms
5022 no longer minimize sorts. Thus certification at the boundary of the
5023 inference kernel becomes invariant under addition of class relations,
5024 which is an important monotonicity principle. Sorts are now minimized
5025 in the syntax layer only, at the boundary between the end-user and the
5026 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5027 explicitly in rare situations.
5029 * Renamed old-style Drule.standard to Drule.export_without_context, to
5030 emphasize that this is in no way a standard operation.
5033 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5034 usual for resolution. Rare INCOMPATIBILITY.
5036 * Renamed varify/unvarify operations to varify_global/unvarify_global
5037 to emphasize that these only work in a global situation (which is
5040 * Curried take and drop in library.ML; negative length is interpreted
5041 as infinity (as in chop). Subtle INCOMPATIBILITY.
5043 * Proof terms: type substitutions on proof constants now use canonical
5044 order of type variables. INCOMPATIBILITY for tools working with proof
5047 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5048 may no longer carry premises. User-level specifications are
5049 transformed accordingly by Thm.add_axiom/add_def.
5054 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5055 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5056 proof terms are enabled unconditionally in the new HOL-Proofs image.
5058 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5059 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5062 * Old lib/scripts/polyml-platform is superseded by the
5063 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5064 variant, even on a 64 bit machine. The following example setting
5065 prefers 64 bit if available:
5067 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5069 * The preliminary Isabelle/jEdit application demonstrates the emerging
5070 Isabelle/Scala layer for advanced prover interaction and integration.
5071 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5074 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5075 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5076 similar to the default assignment of the document preparation system
5077 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5078 provides some operations for direct access to the font without asking
5079 the user for manual installation.
5083 New in Isabelle2009-1 (December 2009)
5084 -------------------------------------
5088 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5089 one backslash should be used, even in ML sources.
5094 * Locale interpretation propagates mixins along the locale hierarchy.
5095 The currently only available mixins are the equations used to map
5096 local definitions to terms of the target domain of an interpretation.
5098 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5099 loc" to print all interpretations of locale "loc" in the theory.
5100 Interpretations in proofs are not shown.
5102 * Thoroughly revised locales tutorial. New section on conditional
5105 * On instantiation of classes, remaining undefined class parameters
5106 are formally declared. INCOMPATIBILITY.
5109 *** Document preparation ***
5111 * New generalized style concept for printing terms: @{foo (style) ...}
5112 instead of @{foo_style style ...} (old form is still retained for
5113 backward compatibility). Styles can be also applied for
5114 antiquotations prop, term_type and typeof.
5119 * New proof method "smt" for a combination of first-order logic with
5120 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5121 fixed-size bitvectors; there is also basic support for higher-order
5122 features (esp. lambda abstractions). It is an incomplete decision
5123 procedure based on external SMT solvers using the oracle mechanism;
5124 for the SMT solver Z3, this method is proof-producing. Certificates
5125 are provided to avoid calling the external solvers solely for
5126 re-checking proofs. Due to a remote SMT service there is no need for
5127 installing SMT solvers locally. See src/HOL/SMT.
5129 * New commands to load and prove verification conditions generated by
5130 the Boogie program verifier or derived systems (e.g. the Verifying C
5131 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5133 * New counterexample generator tool 'nitpick' based on the Kodkod
5134 relational model finder. See src/HOL/Tools/Nitpick and
5135 src/HOL/Nitpick_Examples.
5137 * New commands 'code_pred' and 'values' to invoke the predicate
5138 compiler and to enumerate values of inductive predicates.
5140 * A tabled implementation of the reflexive transitive closure.
5142 * New implementation of quickcheck uses generic code generator;
5143 default generators are provided for all suitable HOL types, records
5144 and datatypes. Old quickcheck can be re-activated importing theory
5145 Library/SML_Quickcheck.
5147 * New testing tool Mirabelle for automated proof tools. Applies
5148 several tools and tactics like sledgehammer, metis, or quickcheck, to
5149 every proof step in a theory. To be used in batch mode via the
5150 "mirabelle" utility.
5152 * New proof method "sos" (sum of squares) for nonlinear real
5153 arithmetic (originally due to John Harison). It requires theory
5154 Library/Sum_Of_Squares. It is not a complete decision procedure but
5155 works well in practice on quantifier-free real arithmetic with +, -,
5156 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5157 inequalities between polynomials. It makes use of external
5158 semidefinite programming solvers. Method "sos" generates a
5159 certificate that can be pasted into the proof thus avoiding the need
5160 to call an external tool every time the proof is checked. See
5161 src/HOL/Library/Sum_Of_Squares.
5163 * New method "linarith" invokes existing linear arithmetic decision
5166 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5168 * New Sledgehammer option "Full Types" in Proof General settings menu.
5169 Causes full type information to be output to the ATPs. This slows
5170 ATPs down considerably but eliminates a source of unsound "proofs"
5173 * New method "metisFT": A version of metis that uses full type
5174 information in order to avoid failures of proof reconstruction.
5176 * New evaluator "approximate" approximates an real valued term using
5177 the same method as the approximation method.
5179 * Method "approximate" now supports arithmetic expressions as
5180 boundaries of intervals and implements interval splitting and Taylor
5183 * ML antiquotation @{code_datatype} inserts definition of a datatype
5184 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5186 * New theory SupInf of the supremum and infimum operators for sets of
5189 * New theory Probability, which contains a development of measure
5190 theory, eventually leading to Lebesgue integration and probability.
5192 * Extended Multivariate Analysis to include derivation and Brouwer's
5195 * Reorganization of number theory, INCOMPATIBILITY:
5196 - new number theory development for nat and int, in theories Divides
5197 and GCD as well as in new session Number_Theory
5198 - some constants and facts now suffixed with _nat and _int
5200 - former session NumberTheory now named Old_Number_Theory, including
5201 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5202 - moved theory Pocklington from src/HOL/Library to
5203 src/HOL/Old_Number_Theory
5205 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5206 lcm of finite and infinite sets. It is shown that they form a complete
5209 * Class semiring_div requires superclass no_zero_divisors and proof of
5210 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5211 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5212 generalized to class semiring_div, subsuming former theorems
5213 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5214 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5217 * Refinements to lattice classes and sets:
5218 - less default intro/elim rules in locale variant, more default
5219 intro/elim rules in class variant: more uniformity
5220 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5222 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5224 - renamed ACI to inf_sup_aci
5225 - new class "boolean_algebra"
5226 - class "complete_lattice" moved to separate theory
5227 "Complete_Lattice"; corresponding constants (and abbreviations)
5228 renamed and with authentic syntax:
5229 Set.Inf ~> Complete_Lattice.Inf
5230 Set.Sup ~> Complete_Lattice.Sup
5231 Set.INFI ~> Complete_Lattice.INFI
5232 Set.SUPR ~> Complete_Lattice.SUPR
5233 Set.Inter ~> Complete_Lattice.Inter
5234 Set.Union ~> Complete_Lattice.Union
5235 Set.INTER ~> Complete_Lattice.INTER
5236 Set.UNION ~> Complete_Lattice.UNION
5237 - authentic syntax for
5240 - mere abbreviations:
5243 Set.inter (for inf, formerly Set.Int)
5244 Set.union (for sup, formerly Set.Un)
5245 Complete_Lattice.Inter (for Inf)
5246 Complete_Lattice.Union (for Sup)
5247 Complete_Lattice.INTER (for INFI)
5248 Complete_Lattice.UNION (for SUPR)
5249 - object-logic definitions as far as appropriate
5251 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5252 Un_subset_iff are explicitly deleted as default simp rules; then also
5253 their lattice counterparts le_inf_iff and le_sup_iff have to be
5254 deleted to achieve the desired effect.
5256 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5257 rules by default any longer; the same applies to min_max.inf_absorb1
5258 etc. INCOMPATIBILITY.
5260 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5261 pred_set_conv by default. INCOMPATIBILITY.
5263 * Power operations on relations and functions are now one dedicated
5264 constant "compow" with infix syntax "^^". Power operation on
5265 multiplicative monoids retains syntax "^" and is now defined generic
5266 in class power. INCOMPATIBILITY.
5268 * Relation composition "R O S" now has a more standard argument order:
5269 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5270 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5271 break, since the O_assoc rule was not rewritten like this. Fix using
5272 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5274 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5275 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5278 * Most rules produced by inductive and datatype package have mandatory
5279 prefixes. INCOMPATIBILITY.
5281 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5282 the attribute of the same name. Each of the theorems in the list
5283 DERIV_intros assumes composition with an additional function and
5284 matches a variable to the derivative, which has to be solved by the
5285 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5286 of most elementary terms. Former Maclauren.DERIV_tac and
5287 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5290 * Code generator attributes follow the usual underscore convention:
5291 code_unfold replaces code unfold
5292 code_post replaces code post
5297 sizechange -> size_change
5298 induct_scheme -> induction_schema
5301 * Discontinued abbreviation "arbitrary" of constant "undefined".
5302 INCOMPATIBILITY, use "undefined" directly.
5305 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5306 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5307 Suc_plus1 -> Suc_eq_plus1
5308 *anti_sym -> *antisym*
5309 vector_less_eq_def -> vector_le_def
5312 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5315 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5321 * Theory Representable defines a class "rep" of domains that are
5322 representable (via an ep-pair) in the universal domain type "udom".
5323 Instances are provided for all type constructors defined in HOLCF.
5325 * The 'new_domain' command is a purely definitional version of the
5326 domain package, for representable domains. Syntax is identical to the
5327 old domain package. The 'new_domain' package also supports indirect
5328 recursion using previously-defined type constructors. See
5329 src/HOLCF/ex/New_Domain.thy for examples.
5331 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5332 on the left-hand side of an equation, and then performs
5333 simplification. Rewriting is done using rules declared with the
5334 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5335 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5337 * The pattern-match compiler in 'fixrec' can now handle constructors
5338 with HOL function types. Pattern-match combinators for the Pair
5339 constructor are pre-configured.
5341 * The 'fixrec' package now produces better fixed-point induction rules
5342 for mutually-recursive definitions: Induction rules have conclusions
5343 of the form "P foo bar" instead of "P <foo, bar>".
5345 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5346 been renamed to "below". The name "below" now replaces "less" in many
5347 theorem names. (Legacy theorem names using "less" are still supported
5350 * The 'fixrec' package now supports "bottom patterns". Bottom
5351 patterns can be used to generate strictness rules, or to make
5352 functions more strict (much like the bang-patterns supported by the
5353 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5359 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5360 errors and run-time exceptions, including detailed source positions.
5362 * Structure Name_Space (formerly NameSpace) now manages uniquely
5363 identified entries, with some additional information such as source
5364 position, logical grouping etc.
5366 * Theory and context data is now introduced by the simplified and
5367 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5368 to be pure, but the old TheoryDataFun for mutable data (with explicit
5369 copy operation) is still available for some time.
5371 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5372 provides a high-level programming interface to synchronized state
5373 variables with atomic update. This works via pure function
5374 application within a critical section -- its runtime should be as
5375 short as possible; beware of deadlocks if critical code is nested,
5376 either directly or indirectly via other synchronized variables!
5378 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5379 wraps raw ML references, explicitly indicating their non-thread-safe
5380 behaviour. The Isar toplevel keeps this structure open, to
5381 accommodate Proof General as well as quick and dirty interactive
5382 experiments with references.
5384 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5385 parallel tactical reasoning.
5387 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5388 are similar to SUBPROOF, but are slightly more flexible: only the
5389 specified parts of the subgoal are imported into the context, and the
5390 body tactic may introduce new subgoals and schematic variables.
5392 * Old tactical METAHYPS, which does not observe the proof context, has
5393 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5394 or Subgoal.FOCUS etc.
5396 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5397 functors have their own ML name space there is no point to mark them
5398 separately.) Minor INCOMPATIBILITY.
5400 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5402 * Renamed several structures FooBar to Foo_Bar. Occasional,
5405 * Operations of structure Skip_Proof no longer require quick_and_dirty
5406 mode, which avoids critical setmp.
5408 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5409 combinators for "args". INCOMPATIBILITY, need to use simplified
5410 Attrib/Method.setup introduced in Isabelle2009.
5412 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5413 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5414 last resort. INCOMPATIBILITY.
5416 * Display.pretty_thm now requires a proper context (cf. former
5417 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5418 or even Display.pretty_thm_without_context as last resort.
5421 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5422 Syntax.pretty_typ/term directly, preferably with proper context
5423 instead of global theory.
5428 * Further fine tuning of parallel proof checking, scales up to 8 cores
5429 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5432 * Support for additional "Isabelle components" via etc/components, see
5433 also the system manual.
5435 * The isabelle makeall tool now operates on all components with
5436 IsaMakefile, not just hardwired "logics".
5438 * Removed "compress" option from isabelle-process and isabelle usedir;
5439 this is always enabled.
5441 * Discontinued support for Poly/ML 4.x versions.
5443 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5444 on a given logic image. This requires the lighttpd webserver and is
5445 currently supported on Linux only.
5449 New in Isabelle2009 (April 2009)
5450 --------------------------------
5454 * Simplified main Isabelle executables, with less surprises on
5455 case-insensitive file-systems (such as Mac OS).
5457 - The main Isabelle tool wrapper is now called "isabelle" instead of
5460 - The former "isabelle" alias for "isabelle-process" has been
5461 removed (should rarely occur to regular users).
5463 - The former "isabelle-interface" and its alias "Isabelle" have been
5464 removed (interfaces are now regular Isabelle tools).
5466 Within scripts and make files, the Isabelle environment variables
5467 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5468 respectively. (The latter are still available as legacy feature.)
5470 The old isabelle-interface wrapper could react in confusing ways if
5471 the interface was uninstalled or changed otherwise. Individual
5472 interface tool configuration is now more explicit, see also the
5473 Isabelle system manual. In particular, Proof General is now available
5474 via "isabelle emacs".
5476 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5477 purge installed copies of Isabelle executables and re-run "isabelle
5478 install -p ...", or use symlinks.
5480 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5481 old ~/isabelle, which was slightly non-standard and apt to cause
5482 surprises on case-insensitive file-systems (such as Mac OS).
5484 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5485 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5486 care is required when using older releases of Isabelle. Note that
5487 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5488 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5490 * Proofs of fully specified statements are run in parallel on
5491 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5492 a regular 4-core machine, if the initial heap space is made reasonably
5493 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5495 * The main reference manuals ("isar-ref", "implementation", and
5496 "system") have been updated and extended. Formally checked references
5497 as hyperlinks are now available uniformly.
5502 * Complete re-implementation of locales. INCOMPATIBILITY in several
5503 respects. The most important changes are listed below. See the
5504 Tutorial on Locales ("locales" manual) for details.
5506 - In locale expressions, instantiation replaces renaming. Parameters
5507 must be declared in a for clause. To aid compatibility with previous
5508 parameter inheritance, in locale declarations, parameters that are not
5509 'touched' (instantiation position "_" or omitted) are implicitly added
5510 with their syntax at the beginning of the for clause.
5512 - Syntax from abbreviations and definitions in locales is available in
5513 locale expressions and context elements. The latter is particularly
5514 useful in locale declarations.
5516 - More flexible mechanisms to qualify names generated by locale
5517 expressions. Qualifiers (prefixes) may be specified in locale
5518 expressions, and can be marked as mandatory (syntax: "name!:") or
5519 optional (syntax "name?:"). The default depends for plain "name:"
5520 depends on the situation where a locale expression is used: in
5521 commands 'locale' and 'sublocale' prefixes are optional, in
5522 'interpretation' and 'interpret' prefixes are mandatory. The old
5523 implicit qualifiers derived from the parameter names of a locale are
5524 no longer generated.
5526 - Command "sublocale l < e" replaces "interpretation l < e". The
5527 instantiation clause in "interpretation" and "interpret" (square
5528 brackets) is no longer available. Use locale expressions.
5530 - When converting proof scripts, mandatory qualifiers in
5531 'interpretation' and 'interpret' should be retained by default, even
5532 if this is an INCOMPATIBILITY compared to former behavior. In the
5533 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5534 in locale expressions range over a single locale instance only.
5536 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5537 In existing theorem specifications replace the includes element by the
5538 respective context elements of the included locale, omitting those
5539 that are already present in the theorem specification. Multiple
5540 assume elements of a locale should be replaced by a single one
5541 involving the locale predicate. In the proof body, declarations (most
5542 notably theorems) may be regained by interpreting the respective
5543 locales in the proof context as required (command "interpret").
5545 If using "includes" in replacement of a target solely because the
5546 parameter types in the theorem are not as general as in the target,
5547 consider declaring a new locale with additional type constraints on
5548 the parameters (context element "constrains").
5550 - Discontinued "locale (open)". INCOMPATIBILITY.
5552 - Locale interpretation commands no longer attempt to simplify goal.
5553 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5554 methods intro_locales and unfold_locales to clarify.
5556 - Locale interpretation commands no longer accept interpretation
5557 attributes. INCOMPATIBILITY.
5559 * Class declaration: so-called "base sort" must not be given in import
5560 list any longer, but is inferred from the specification. Particularly
5567 class foo = type + ...
5569 * Class target: global versions of theorems stemming do not carry a
5570 parameter prefix any longer. INCOMPATIBILITY.
5572 * Class 'instance' command no longer accepts attached definitions.
5573 INCOMPATIBILITY, use proper 'instantiation' target instead.
5575 * Recovered hiding of consts, which was accidentally broken in
5576 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5577 makes c inaccessible; consider using ``hide (open) const c'' instead.
5579 * Slightly more coherent Pure syntax, with updated documentation in
5580 isar-ref manual. Removed locales meta_term_syntax and
5581 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5582 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5583 directly in regular applications.
5585 * There is a new syntactic category "float_const" for signed decimal
5586 fractions (e.g. 123.45 or -123.45).
5588 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5589 interface with 'setup' command instead.
5591 * Command 'local_setup' is similar to 'setup', but operates on a local
5594 * The 'axiomatization' command now only works within a global theory
5595 context. INCOMPATIBILITY.
5597 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5598 hypotheses. Sorts required in the course of reasoning need to be
5599 covered by the constraints in the initial statement, completed by the
5600 type instance information of the background theory. Non-trivial sort
5601 hypotheses, which rarely occur in practice, may be specified via
5602 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5604 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5606 The result contains an implicit sort hypotheses as before --
5607 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5610 * Generalized Isar history, with support for linear undo, direct state
5613 * Changed defaults for unify configuration options:
5615 unify_trace_bound = 50 (formerly 25)
5616 unify_search_bound = 60 (formerly 30)
5618 * Different bookkeeping for code equations (INCOMPATIBILITY):
5620 a) On theory merge, the last set of code equations for a particular
5621 constant is taken (in accordance with the policy applied by other
5622 parts of the code generator framework).
5624 b) Code equations stemming from explicit declarations (e.g. code
5625 attribute) gain priority over default code equations stemming
5626 from definition, primrec, fun etc.
5628 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5630 * Unified theorem tables for both code generators. Thus [code
5631 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5633 * Command 'find_consts' searches for constants based on type and name
5636 find_consts "_ => bool"
5638 By default, matching is against subtypes, but it may be restricted to
5639 the whole type. Searching by name is possible. Multiple queries are
5640 conjunctive and queries may be negated by prefixing them with a
5643 find_consts strict: "_ => bool" name: "Int" -"int => int"
5645 * New 'find_theorems' criterion "solves" matches theorems that
5646 directly solve the current goal (modulo higher-order unification).
5648 * Auto solve feature for main theorem statements: whenever a new goal
5649 is stated, "find_theorems solves" is called; any theorems that could
5650 solve the lemma directly are listed as part of the goal state.
5651 Cf. associated options in Proof General Isabelle settings menu,
5652 enabled by default, with reasonable timeout for pathological cases of
5653 higher-order unification.
5656 *** Document preparation ***
5658 * Antiquotation @{lemma} now imitates a regular terminal proof,
5659 demanding keyword 'by' and supporting the full method expression
5660 syntax just like the Isar command 'by'.
5665 * Integrated main parts of former image HOL-Complex with HOL. Entry
5666 points Main and Complex_Main remain as before.
5668 * Logic image HOL-Plain provides a minimal HOL with the most important
5669 tools available (inductive, datatype, primrec, ...). This facilitates
5670 experimentation and tool development. Note that user applications
5671 (and library theories) should never refer to anything below theory
5674 * Logic image HOL-Main stops at theory Main, and thus facilitates
5675 experimentation due to shorter build times.
5677 * Logic image HOL-NSA contains theories of nonstandard analysis which
5678 were previously part of former HOL-Complex. Entry point Hyperreal
5679 remains valid, but theories formerly using Complex_Main should now use
5680 new entry point Hypercomplex.
5682 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5683 Posix processes. Avoids potentially expensive forking of the ML
5684 process. New thread-based implementation also works on non-Unix
5685 platforms (Cygwin). Provers are no longer hardwired, but defined
5686 within the theory via plain ML wrapper functions. Basic Sledgehammer
5687 commands are covered in the isar-ref manual.
5689 * Wrapper scripts for remote SystemOnTPTP service allows to use
5690 sledgehammer without local ATP installation (Vampire etc.). Other
5691 provers may be included via suitable ML wrappers, see also
5692 src/HOL/ATP_Linkup.thy.
5694 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5697 * The metis method no longer fails because the theorem is too trivial
5698 (contains the empty clause).
5700 * The metis method now fails in the usual manner, rather than raising
5701 an exception, if it determines that it cannot prove the theorem.
5703 * Method "coherent" implements a prover for coherent logic (see also
5704 src/Tools/coherent.ML).
5706 * Constants "undefined" and "default" replace "arbitrary". Usually
5707 "undefined" is the right choice to replace "arbitrary", though
5708 logically there is no difference. INCOMPATIBILITY.
5710 * Command "value" now integrates different evaluation mechanisms. The
5711 result of the first successful evaluation mechanism is printed. In
5712 square brackets a particular named evaluation mechanisms may be
5713 specified (currently, [SML], [code] or [nbe]). See further
5714 src/HOL/ex/Eval_Examples.thy.
5716 * Normalization by evaluation now allows non-leftlinear equations.
5717 Declare with attribute [code nbe].
5719 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5720 as the structured Isar versions "cases" and "induct", cf. the
5721 corresponding "cases" and "induct" attributes. Mutual induction rules
5722 are now presented as a list of individual projections
5723 (e.g. foo_bar.inducts for types foo and bar); the old format with
5724 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5725 rare situations a different rule is selected --- notably nested tuple
5726 elimination instead of former prod.exhaust: use explicit (case_tac t
5727 rule: prod.exhaust) here.
5729 * Attributes "cases", "induct", "coinduct" support "del" option.
5731 * Removed fact "case_split_thm", which duplicates "case_split".
5733 * The option datatype has been moved to a new theory Option. Renamed
5734 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5736 * New predicate "strict_mono" classifies strict functions on partial
5737 orders. With strict functions on linear orders, reasoning about
5738 (in)equalities is facilitated by theorems "strict_mono_eq",
5739 "strict_mono_less_eq" and "strict_mono_less".
5741 * Some set operations are now proper qualified constants with
5742 authentic syntax. INCOMPATIBILITY:
5753 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5756 * Auxiliary class "itself" has disappeared -- classes without any
5757 parameter are treated as expected by the 'class' command.
5759 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5761 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5762 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5764 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5765 method "approximation". It proves formulas on real values by using
5766 interval arithmetic. In the formulas are also the transcendental
5767 functions sin, cos, tan, atan, ln, exp and the constant pi are
5768 allowed. For examples see
5769 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5771 * Theory "Reflection" now resides in HOL/Library.
5773 * Entry point to Word library now simply named "Word".
5776 * Made source layout more coherent with logical distribution
5779 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5780 src/HOL/Library/Code_Message.thy ~> src/HOL/
5781 src/HOL/Library/GCD.thy ~> src/HOL/
5782 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5783 src/HOL/Library/Parity.thy ~> src/HOL/
5784 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5785 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5786 src/HOL/Real/Lubs.thy ~> src/HOL/
5787 src/HOL/Real/PReal.thy ~> src/HOL/
5788 src/HOL/Real/Rational.thy ~> src/HOL/
5789 src/HOL/Real/RComplete.thy ~> src/HOL/
5790 src/HOL/Real/RealDef.thy ~> src/HOL/
5791 src/HOL/Real/RealPow.thy ~> src/HOL/
5792 src/HOL/Real/Real.thy ~> src/HOL/
5793 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5794 src/HOL/Complex/Complex.thy ~> src/HOL/
5795 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5796 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5797 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5798 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5799 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5800 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5801 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5802 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5803 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5804 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5805 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5806 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5807 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5808 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5809 src/HOL/Real/Float ~> src/HOL/Library/
5810 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5811 src/HOL/Real/RealVector.thy ~> src/HOL/
5813 src/HOL/arith_data.ML ~> src/HOL/Tools
5814 src/HOL/hologic.ML ~> src/HOL/Tools
5815 src/HOL/simpdata.ML ~> src/HOL/Tools
5816 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5817 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5818 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5819 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5820 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5821 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5822 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5824 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5825 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5826 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5827 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5828 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5829 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5831 * If methods "eval" and "evaluation" encounter a structured proof
5832 state with !!/==>, only the conclusion is evaluated to True (if
5833 possible), avoiding strange error messages.
5835 * Method "sizechange" automates termination proofs using (a
5836 modification of) the size-change principle. Requires SAT solver. See
5837 src/HOL/ex/Termination.thy for examples.
5839 * Simplifier: simproc for let expressions now unfolds if bound
5840 variable occurs at most once in let expression body. INCOMPATIBILITY.
5842 * Method "arith": Linear arithmetic now ignores all inequalities when
5843 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5845 * New attribute "arith" for facts that should always be used
5846 automatically by arithmetic. It is intended to be used locally in
5849 assumes [arith]: "x > 0"
5851 Global usage is discouraged because of possible performance impact.
5853 * New classes "top" and "bot" with corresponding operations "top" and
5854 "bot" in theory Orderings; instantiation of class "complete_lattice"
5855 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5857 * Changed definition lemma "less_fun_def" in order to provide an
5858 instance for preorders on functions; use lemma "less_le" instead.
5861 * Theory Orderings: class "wellorder" moved here, with explicit
5862 induction rule "less_induct" as assumption. For instantiation of
5863 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5866 * Theory Orderings: added class "preorder" as superclass of "order".
5867 INCOMPATIBILITY: Instantiation proofs for order, linorder
5868 etc. slightly changed. Some theorems named order_class.* now named
5871 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5874 * Theory Finite_Set: added a new fold combinator of type
5876 ('a => 'b => 'b) => 'b => 'a set => 'b
5878 Occasionally this is more convenient than the old fold combinator
5879 which is now defined in terms of the new one and renamed to
5882 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5883 and "ring_simps" have been replaced by "algebra_simps" (which can be
5884 extended with further lemmas!). At the moment both still exist but
5885 the former will disappear at some point.
5887 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5888 class recpower. Type-specific simp rules for various recpower types
5889 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5891 rat_power_0 -> power_0
5892 rat_power_Suc -> power_Suc
5893 realpow_0 -> power_0
5894 realpow_Suc -> power_Suc
5895 complexpow_0 -> power_0
5896 complexpow_Suc -> power_Suc
5897 power_poly_0 -> power_0
5898 power_poly_Suc -> power_Suc
5900 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5901 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5902 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5903 of lemmas from Divides has been generalized from nat to class
5904 semiring_div. INCOMPATIBILITY. This involves the following theorem
5905 renames resulting from duplicate elimination:
5907 dvd_def_mod ~> dvd_eq_mod_eq_0
5908 zero_dvd_iff ~> dvd_0_left_iff
5909 dvd_0 ~> dvd_0_right
5910 DIVISION_BY_ZERO_DIV ~> div_by_0
5911 DIVISION_BY_ZERO_MOD ~> mod_by_0
5912 mult_div ~> div_mult_self2_is_id
5913 mult_mod ~> mod_mult_self2_is_0
5915 * Theory IntDiv: removed many lemmas that are instances of class-based
5916 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5917 rename old lemmas as follows:
5919 dvd_diff -> nat_dvd_diff
5920 dvd_zminus_iff -> dvd_minus_iff
5921 mod_add1_eq -> mod_add_eq
5922 mod_mult1_eq -> mod_mult_right_eq
5923 mod_mult1_eq' -> mod_mult_left_eq
5924 mod_mult_distrib_mod -> mod_mult_eq
5925 nat_mod_add_left_eq -> mod_add_left_eq
5926 nat_mod_add_right_eq -> mod_add_right_eq
5927 nat_mod_div_trivial -> mod_div_trivial
5928 nat_mod_mod_trivial -> mod_mod_trivial
5929 zdiv_zadd_self1 -> div_add_self1
5930 zdiv_zadd_self2 -> div_add_self2
5931 zdiv_zmult_self1 -> div_mult_self2_is_id
5932 zdiv_zmult_self2 -> div_mult_self1_is_id
5933 zdvd_triv_left -> dvd_triv_left
5934 zdvd_triv_right -> dvd_triv_right
5935 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5936 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5937 zmod_zadd_left_eq -> mod_add_left_eq
5938 zmod_zadd_right_eq -> mod_add_right_eq
5939 zmod_zadd_self1 -> mod_add_self1
5940 zmod_zadd_self2 -> mod_add_self2
5941 zmod_zadd1_eq -> mod_add_eq
5942 zmod_zdiff1_eq -> mod_diff_eq
5943 zmod_zdvd_zmod -> mod_mod_cancel
5944 zmod_zmod_cancel -> mod_mod_cancel
5945 zmod_zmult_self1 -> mod_mult_self2_is_0
5946 zmod_zmult_self2 -> mod_mult_self1_is_0
5949 zdvd_abs1 -> abs_dvd_iff
5950 zdvd_abs2 -> dvd_abs_iff
5951 zdvd_refl -> dvd_refl
5952 zdvd_trans -> dvd_trans
5953 zdvd_zadd -> dvd_add
5954 zdvd_zdiff -> dvd_diff
5955 zdvd_zminus_iff -> dvd_minus_iff
5956 zdvd_zminus2_iff -> minus_dvd_iff
5957 zdvd_zmultD -> dvd_mult_right
5958 zdvd_zmultD2 -> dvd_mult_left
5959 zdvd_zmult_mono -> mult_dvd_mono
5960 zdvd_0_right -> dvd_0_right
5961 zdvd_0_left -> dvd_0_left_iff
5962 zdvd_1_left -> one_dvd
5963 zminus_dvd_iff -> minus_dvd_iff
5965 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5967 * The real numbers offer decimal input syntax: 12.34 is translated
5968 into 1234/10^2. This translation is not reversed upon output.
5970 * Theory Library/Polynomial defines an abstract type 'a poly of
5971 univariate polynomials with coefficients of type 'a. In addition to
5972 the standard ring operations, it also supports div and mod. Code
5973 generation is also supported, using list-style constructors.
5975 * Theory Library/Inner_Product defines a class of real_inner for real
5976 inner product spaces, with an overloaded operation inner :: 'a => 'a
5977 => real. Class real_inner is a subclass of real_normed_vector from
5980 * Theory Library/Product_Vector provides instances for the product
5981 type 'a * 'b of several classes from RealVector and Inner_Product.
5982 Definitions of addition, subtraction, scalar multiplication, norms,
5983 and inner products are included.
5985 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5986 addition to the field operations, numerals and case syntax are also
5989 * Theory Library/Diagonalize provides constructive version of Cantor's
5990 first diagonalization argument.
5992 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5993 zlcm (for int); carried together from various gcd/lcm developements in
5994 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5995 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5996 may recover tupled syntax as follows:
5998 hide (open) const gcd
5999 abbreviation gcd where
6000 "gcd == (%(a, b). GCD.gcd a b)"
6002 GCD.gcd ("gcd '(_, _')")
6004 The same works for lcm, zgcd, zlcm.
6006 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6007 instantiations for algebraic structures. Removed some duplicate
6008 theorems. Changes in simp rules. INCOMPATIBILITY.
6010 * ML antiquotation @{code} takes a constant as argument and generates
6011 corresponding code in background and inserts name of the corresponding
6012 resulting ML value/function/datatype constructor binding in place.
6013 All occurrences of @{code} with a single ML block are generated
6014 simultaneously. Provides a generic and safe interface for
6015 instrumentalizing code generation. See
6016 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6017 In future you ought to refrain from ad-hoc compiling generated SML
6018 code on the ML toplevel. Note that (for technical reasons) @{code}
6019 cannot refer to constants for which user-defined serializations are
6020 set. Refer to the corresponding ML counterpart directly in that
6023 * Command 'rep_datatype': instead of theorem names the command now
6024 takes a list of terms denoting the constructors of the type to be
6025 represented as datatype. The characteristic theorems have to be
6026 proven. INCOMPATIBILITY. Also observe that the following theorems
6027 have disappeared in favour of existing ones:
6029 unit_induct ~> unit.induct
6030 prod_induct ~> prod.induct
6031 sum_induct ~> sum.induct
6032 Suc_Suc_eq ~> nat.inject
6033 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6038 * New locales for orders and lattices where the equivalence relation
6039 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6040 locales use a record structure with field eq for the equivalence.
6042 * New theory of factorial domains.
6044 * Units_l_inv and Units_r_inv are now simp rules by default.
6045 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6046 and/or r_inv will now also require deletion of these lemmas.
6048 * Renamed the following theorems, INCOMPATIBILITY:
6050 UpperD ~> Upper_memD
6051 LowerD ~> Lower_memD
6052 least_carrier ~> least_closed
6053 greatest_carrier ~> greatest_closed
6054 greatest_Lower_above ~> greatest_Lower_below
6055 one_zero ~> carrier_one_zero
6056 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6061 * Nominal datatypes can now contain type-variables.
6063 * Commands 'nominal_inductive' and 'equivariance' work with local
6066 * Nominal primrec can now works with local theory targets and its
6067 specification syntax now conforms to the general format as seen in
6070 * Method "perm_simp" honours the standard simplifier attributes
6071 (no_asm), (no_asm_use) etc.
6073 * The new predicate #* is defined like freshness, except that on the
6074 left hand side can be a set or list of atoms.
6076 * Experimental command 'nominal_inductive2' derives strong induction
6077 principles for inductive definitions. In contrast to
6078 'nominal_inductive', which can only deal with a fixed number of
6079 binders, it can deal with arbitrary expressions standing for sets of
6080 atoms to be avoided. The only inductive definition we have at the
6081 moment that needs this generalisation is the typing rule for Lets in
6084 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6085 -----------------------------------------------------------------
6086 Gamma |- Let x be t1 in t2 : T2
6088 In this rule one wants to avoid all the binders that are introduced by
6089 "close Gamma T1". We are looking for other examples where this
6090 feature might be useful. Please let us know.
6095 * Reimplemented the simplification procedure for proving continuity
6096 subgoals. The new simproc is extensible; users can declare additional
6097 continuity introduction rules with the attribute [cont2cont].
6099 * The continuity simproc now uses a different introduction rule for
6100 solving continuity subgoals on terms with lambda abstractions. In
6101 some rare cases the new simproc may fail to solve subgoals that the
6102 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6103 Potential INCOMPATIBILITY.
6105 * Command 'fixrec': specification syntax now conforms to the general
6106 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6107 examples. INCOMPATIBILITY.
6112 * Proof of Zorn's Lemma for partial orders.
6117 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6118 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6119 depends on multithreading, so timouts will not work before Poly/ML
6122 * High-level support for concurrent ML programming, see
6123 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6124 particularly convenient to organize independent functional
6125 computations. The concept of "synchronized variables" provides a
6126 higher-order interface for components with shared state, avoiding the
6127 delicate details of mutexes and condition variables. (Requires
6128 Poly/ML 5.2.1 or later.)
6130 * ML bindings produced via Isar commands are stored within the Isar
6131 context (theory or proof). Consequently, commands like 'use' and 'ML'
6132 become thread-safe and work with undo as expected (concerning
6133 top-level bindings, not side-effects on global references).
6134 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6135 compiler at runtime; really global bindings need to be given outside a
6136 theory. (Requires Poly/ML 5.2 or later.)
6138 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6139 context. Top-level ML bindings are stored within the proof context in
6140 a purely sequential fashion, disregarding the nested proof structure.
6141 ML bindings introduced by 'ML_prf' are discarded at the end of the
6142 proof. (Requires Poly/ML 5.2 or later.)
6144 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6145 and Method.setup, as well as Isar commands 'attribute_setup' and
6146 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6147 existing code accordingly, or use plain 'setup' together with old
6150 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6151 to 'a -> thm, while results are always tagged with an authentic oracle
6152 name. The Isar command 'oracle' is now polymorphic, no argument type
6153 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6154 accordingly. Note that extra performance may be gained by producing
6155 the cterm carefully, avoiding slow Thm.cterm_of.
6157 * Simplified interface for defining document antiquotations via
6158 ThyOutput.antiquotation, ThyOutput.output, and optionally
6159 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6160 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6163 * More systematic treatment of long names, abstract name bindings, and
6164 name space operations. Basic operations on qualified names have been
6165 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6166 Long_Name.append. Old type bstring has been mostly replaced by
6167 abstract type binding (see structure Binding), which supports precise
6168 qualification by packages and local theory targets, as well as proper
6169 tracking of source positions. INCOMPATIBILITY, need to wrap old
6170 bstring values into Binding.name, or better pass through abstract
6171 bindings everywhere. See further src/Pure/General/long_name.ML,
6172 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6174 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6175 LocalTheory.note etc.) now refer to the *full* internal name, not the
6176 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6178 * Disposed old type and term read functions (Sign.read_def_typ,
6179 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6180 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6181 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6182 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6183 resort for legacy applications.
6185 * Disposed old declarations, tactics, tactic combinators that refer to
6186 the simpset or claset of an implicit theory (such as Addsimps,
6187 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6188 embedded ML text, or local_simpset_of with a proper context passed as
6189 explicit runtime argument.
6191 * Rules and tactics that read instantiations (read_instantiate,
6192 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6193 context, which is required for parsing and type-checking. Moreover,
6194 the variables are specified as plain indexnames, not string encodings
6195 thereof. INCOMPATIBILITY.
6197 * Generic Toplevel.add_hook interface allows to analyze the result of
6198 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6199 for theorem dependency output of transactions resulting in a new
6202 * ML antiquotations: block-structured compilation context indicated by
6203 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6205 @{binding name} - basic name binding
6206 @{let ?pat = term} - term abbreviation (HO matching)
6207 @{note name = fact} - fact abbreviation
6208 @{thm fact} - singleton fact (with attributes)
6209 @{thms fact} - general fact (with attributes)
6210 @{lemma prop by method} - singleton goal
6211 @{lemma prop by meth1 meth2} - singleton goal
6212 @{lemma prop1 ... propN by method} - general goal
6213 @{lemma prop1 ... propN by meth1 meth2} - general goal
6214 @{lemma (open) ...} - open derivation
6219 * The Isabelle "emacs" tool provides a specific interface to invoke
6220 Proof General / Emacs, with more explicit failure if that is not
6221 installed (the old isabelle-interface script silently falls back on
6222 isabelle-process). The PROOFGENERAL_HOME setting determines the
6223 installation location of the Proof General distribution.
6225 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6226 the Isabelle process into a JVM/Scala application. See
6227 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6228 process wrapper has been discontinued.)
6230 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6232 * Various status messages (with exact source position information) are
6233 emitted, if proper markup print mode is enabled. This allows
6234 user-interface components to provide detailed feedback on internal
6239 New in Isabelle2008 (June 2008)
6240 -------------------------------
6244 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6245 and updated, with formally checked references as hyperlinks.
6247 * Theory loader: use_thy (and similar operations) no longer set the
6248 implicit ML context, which was occasionally hard to predict and in
6249 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6250 provides a proper context already.
6252 * Theory loader: old-style ML proof scripts being *attached* to a thy
6253 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6254 'use' within a theory file will do the job.
6256 * Name space merge now observes canonical order, i.e. the second space
6257 is inserted into the first one, while existing entries in the first
6258 space take precedence. INCOMPATIBILITY in rare situations, may try to
6259 swap theory imports.
6261 * Syntax: symbol \<chi> is now considered a letter. Potential
6262 INCOMPATIBILITY in identifier syntax etc.
6264 * Outer syntax: string tokens no longer admit escaped white space,
6265 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6266 white space without escapes.
6268 * Outer syntax: string tokens may contain arbitrary character codes
6269 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6275 * Context-dependent token translations. Default setup reverts locally
6276 fixed variables, and adds hilite markup for undeclared frees.
6278 * Unused theorems can be found using the new command 'unused_thms'.
6279 There are three ways of invoking it:
6282 Only finds unused theorems in the current theory.
6284 (2) unused_thms thy_1 ... thy_n -
6285 Finds unused theorems in the current theory and all of its ancestors,
6286 excluding the theories thy_1 ... thy_n and all of their ancestors.
6288 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6289 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6290 their ancestors, excluding the theories thy_1 ... thy_n and all of
6293 In order to increase the readability of the list produced by
6294 unused_thms, theorems that have been created by a particular instance
6295 of a theory command such as 'inductive' or 'function' are considered
6296 to belong to the same "group", meaning that if at least one theorem in
6297 this group is used, the other theorems in the same group are no longer
6298 reported as unused. Moreover, if all theorems in the group are
6299 unused, only one theorem in the group is displayed.
6301 Note that proof objects have to be switched on in order for
6302 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6303 usually the case when using Proof General with the default settings).
6305 * Authentic naming of facts disallows ad-hoc overwriting of previous
6306 theorems within the same name space. INCOMPATIBILITY, need to remove
6307 duplicate fact bindings, or even accidental fact duplications. Note
6308 that tools may maintain dynamically scoped facts systematically, using
6309 PureThy.add_thms_dynamic.
6311 * Command 'hide' now allows to hide from "fact" name space as well.
6313 * Eliminated destructive theorem database, simpset, claset, and
6314 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6315 update of theories within ML code.
6317 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6318 INCOMPATIBILITY, object-logics depending on former Pure require
6319 additional setup PureThy.old_appl_syntax_setup; object-logics
6320 depending on former CPure need to refer to Pure.
6322 * Commands 'use' and 'ML' are now purely functional, operating on
6323 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6324 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6327 * Command 'setup': discontinued implicit version with ML reference.
6329 * Instantiation target allows for simultaneous specification of class
6330 instance operations together with an instantiation proof.
6331 Type-checking phase allows to refer to class operations uniformly.
6332 See src/HOL/Complex/Complex.thy for an Isar example and
6333 src/HOL/Library/Eval.thy for an ML example.
6335 * Indexing of literal facts: be more serious about including only
6336 facts from the visible specification/proof context, but not the
6337 background context (locale etc.). Affects `prop` notation and method
6338 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6341 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6342 "(open)" option, which used to expose internal bound variables to the
6345 * Isar statements: removed obsolete case "rule_context".
6346 INCOMPATIBILITY, better use explicit fixes/assumes.
6348 * Locale proofs: default proof step now includes 'unfold_locales';
6349 hence 'proof' without argument may be used to unfold locale
6353 *** Document preparation ***
6355 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6356 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6357 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6358 spot); renamed link color from "darkblue" to "linkcolor" (default
6359 value unchanged, can be redefined via \definecolor); no longer sets
6360 "a4paper" option (unnecessary or even intrusive).
6362 * Antiquotation @{lemma A method} proves proposition A by the given
6363 method (either a method name or a method name plus (optional) method
6364 arguments in parentheses) and prints A just like @{prop A}.
6369 * New primrec package. Specification syntax conforms in style to
6370 definition/function/.... No separate induction rule is provided. The
6371 "primrec" command distinguishes old-style and new-style specifications
6372 by syntax. The former primrec package is now named OldPrimrecPackage.
6373 When adjusting theories, beware: constants stemming from new-style
6374 primrec specifications have authentic syntax.
6376 * Metis prover is now an order of magnitude faster, and also works
6377 with multithreading.
6379 * Metis: the maximum number of clauses that can be produced from a
6380 theorem is now given by the attribute max_clauses. Theorems that
6381 exceed this number are ignored, with a warning printed.
6383 * Sledgehammer no longer produces structured proofs by default. To
6384 enable, declare [[sledgehammer_full = true]]. Attributes
6385 reconstruction_modulus, reconstruction_sorts renamed
6386 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6388 * Method "induct_scheme" derives user-specified induction rules
6389 from well-founded induction and completeness of patterns. This factors
6390 out some operations that are done internally by the function package
6391 and makes them available separately. See
6392 src/HOL/ex/Induction_Scheme.thy for examples.
6394 * More flexible generation of measure functions for termination
6395 proofs: Measure functions can be declared by proving a rule of the
6396 form "is_measure f" and giving it the [measure_function] attribute.
6397 The "is_measure" predicate is logically meaningless (always true), and
6398 just guides the heuristic. To find suitable measure functions, the
6399 termination prover sets up the goal "is_measure ?f" of the appropriate
6400 type and generates all solutions by Prolog-style backward proof using
6403 This setup also deals with rules like
6405 "is_measure f ==> is_measure (list_size f)"
6407 which accommodates nested datatypes that recurse through lists.
6408 Similar rules are predeclared for products and option types.
6410 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6414 - Definitions of overloaded constants on sets have to be replaced by
6415 definitions on => and bool.
6417 - Some definitions of overloaded operators on sets can now be proved
6418 using the definitions of the operators on => and bool. Therefore,
6419 the following theorems have been renamed:
6421 subset_def -> subset_eq
6422 psubset_def -> psubset_eq
6423 set_diff_def -> set_diff_eq
6424 Compl_def -> Compl_eq
6425 Sup_set_def -> Sup_set_eq
6426 Inf_set_def -> Inf_set_eq
6427 sup_set_def -> sup_set_eq
6428 inf_set_def -> inf_set_eq
6430 - Due to the incompleteness of the HO unification algorithm, some
6431 rules such as subst may require manual instantiation, if some of
6432 the unknowns in the rule is a set.
6434 - Higher order unification and forward proofs:
6437 have "P (S::'a set)" <...>
6438 then have "EX S. P S" ..
6440 no longer works (due to the incompleteness of the HO unification
6441 algorithm) and must be replaced by the pattern
6448 - Calculational reasoning with subst (or similar rules):
6451 have "P (S::'a set)" <...>
6452 also have "S = T" <...>
6453 finally have "P T" .
6455 no longer works (for similar reasons as the previous example) and
6456 must be replaced by something like
6458 have "P (S::'a set)" <...>
6459 moreover have "S = T" <...>
6460 ultimately have "P T" by simp
6462 - Tactics or packages written in ML code:
6463 Code performing pattern matching on types via
6465 Type ("set", [T]) => ...
6467 must be rewritten. Moreover, functions like strip_type or
6468 binder_types no longer return the right value when applied to a
6471 T1 => ... => Tn => U => bool
6475 T1 => ... => Tn => U set
6477 * Merged theories Wellfounded_Recursion, Accessible_Part and
6478 Wellfounded_Relations to theory Wellfounded.
6480 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6482 * Class finite no longer treats UNIV as class parameter. Use class
6483 enum from theory Library/Enum instead to achieve a similar effect.
6486 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6487 and "Cons". INCOMPATIBILITY.
6489 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6490 Potential INCOMPATIBILITY.
6492 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6493 injective_fst_snd removed, use split_eta and prod_eqI instead.
6494 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6496 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6497 the same name in theory Orderings:
6507 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6508 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6509 and different variable names.
6511 * Library/Option_ord.thy: Canonical order on option type.
6513 * Library/RBT.thy: Red-black trees, an efficient implementation of
6516 * Library/Countable.thy: Type class for countable types.
6518 * Theory Int: The representation of numerals has changed. The infix
6519 operator BIT and the bit datatype with constructors B0 and B1 have
6520 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6521 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6522 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6525 * Theory Nat: definition of <= and < on natural numbers no longer
6526 depend on well-founded relations. INCOMPATIBILITY. Definitions
6527 le_def and less_def have disappeared. Consider lemmas not_less
6528 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6530 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6531 (whose purpose mainly is for various fold_set functionals) have been
6532 abandoned in favor of the existing algebraic classes
6533 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6534 lower_semilattice (resp. upper_semilattice) and linorder.
6537 * Theory Transitive_Closure: induct and cases rules now declare proper
6538 case_names ("base" and "step"). INCOMPATIBILITY.
6540 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6541 lattices. The form set-specific version is available as
6542 Inductive.lfp_ordinal_induct_set.
6544 * Renamed theorems "power.simps" to "power_int.simps".
6547 * Class semiring_div provides basic abstract properties of semirings
6548 with division and modulo operations. Subsumes former class dvd_mod.
6550 * Merged theories IntDef, Numeral and IntArith into unified theory
6551 Int. INCOMPATIBILITY.
6553 * Theory Library/Code_Index: type "index" now represents natural
6554 numbers rather than integers. INCOMPATIBILITY.
6556 * New class "uminus" with operation "uminus" (split of from class
6557 "minus" which now only has operation "minus", binary).
6560 * Constants "card", "internal_split", "option_map" now with authentic
6561 syntax. INCOMPATIBILITY.
6563 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6564 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6565 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6566 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6567 Sup_set_def, le_def, less_def, option_map_def now with object
6568 equality. INCOMPATIBILITY.
6570 * Records. Removed K_record, and replaced it by pure lambda term
6571 %x. c. The simplifier setup is now more robust against eta expansion.
6572 INCOMPATIBILITY: in cases explicitly referring to K_record.
6574 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6576 * Library/ListVector: new theory of arithmetic vector operations.
6578 * Library/Order_Relation: new theory of various orderings as sets of
6579 pairs. Defines preorders, partial orders, linear orders and
6580 well-orders on sets and on types.
6585 * Renamed some theories to allow to loading both ZF and HOL in the
6588 Datatype -> Datatype_ZF
6589 Inductive -> Inductive_ZF
6596 INCOMPATIBILITY: ZF theories that import individual theories below
6597 Main might need to be adapted. Regular theory Main is still
6598 available, as trivial extension of Main_ZF.
6603 * ML within Isar: antiquotation @{const name} or @{const
6604 name(typargs)} produces statically-checked Const term.
6606 * Functor NamedThmsFun: data is available to the user as dynamic fact
6607 (of the same name). Removed obsolete print command.
6609 * Removed obsolete "use_legacy_bindings" function.
6611 * The ``print mode'' is now a thread-local value derived from a global
6612 template (the former print_mode reference), thus access becomes
6613 non-critical. The global print_mode reference is for session
6614 management only; user-code should use print_mode_value,
6615 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6617 * Functions system/system_out provide a robust way to invoke external
6618 shell commands, with propagation of interrupts (requires Poly/ML
6619 5.2.1). Do not use OS.Process.system etc. from the basis library!
6624 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6625 in accordance with Proof General 3.7, which prefers GNU emacs.
6627 * isatool tty runs Isabelle process with plain tty interaction;
6628 optional line editor may be specified via ISABELLE_LINE_EDITOR
6629 setting, the default settings attempt to locate "ledit" and "rlwrap".
6631 * isatool browser now works with Cygwin as well, using general
6632 "javapath" function defined in Isabelle process environment.
6634 * YXML notation provides a simple and efficient alternative to
6635 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6636 isatool yxml as described in the Isabelle system manual.
6638 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6639 provides general wrapper for managing an Isabelle process in a robust
6640 fashion, with ``cooked'' output from stdin/stderr.
6642 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6643 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6645 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6646 way of changing the user's settings is via
6647 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6650 * Multithreading.max_threads := 0 refers to the number of actual CPU
6651 cores of the underlying machine, which is a good starting point for
6652 optimal performance tuning. The corresponding usedir option -M allows
6653 "max" as an alias for "0". WARNING: does not work on certain versions
6654 of Mac OS (with Poly/ML 5.1).
6656 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6657 adverse effect of Isabelle flooding interactive front-ends (notably
6658 ProofGeneral / XEmacs).
6662 New in Isabelle2007 (November 2007)
6663 -----------------------------------
6667 * More uniform information about legacy features, notably a
6668 warning/error of "Legacy feature: ...", depending on the state of the
6669 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6670 legacy features will disappear eventually.
6672 * Theory syntax: the header format ``theory A = B + C:'' has been
6673 discontinued in favour of ``theory A imports B C begin''. Use isatool
6674 fixheaders to convert existing theory files. INCOMPATIBILITY.
6676 * Theory syntax: the old non-Isar theory file format has been
6677 discontinued altogether. Note that ML proof scripts may still be used
6678 with Isar theories; migration is usually quite simple with the ML
6679 function use_legacy_bindings. INCOMPATIBILITY.
6681 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6682 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6685 * Theory loader: be more serious about observing the static theory
6686 header specifications (including optional directories), but not the
6687 accidental file locations of previously successful loads. The strict
6688 update policy of former update_thy is now already performed by
6689 use_thy, so the former has been removed; use_thys updates several
6690 theories simultaneously, just as 'imports' within a theory header
6691 specification, but without merging the results. Potential
6692 INCOMPATIBILITY: may need to refine theory headers and commands
6693 ROOT.ML which depend on load order.
6695 * Theory loader: optional support for content-based file
6696 identification, instead of the traditional scheme of full physical
6697 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6698 (cf. the system manual). The new scheme allows to work with
6699 non-finished theories in persistent session images, such that source
6700 files may be moved later on without requiring reloads.
6702 * Theory loader: old-style ML proof scripts being *attached* to a thy
6703 file (with the same base name as the theory) are considered a legacy
6704 feature, which will disappear eventually. Even now, the theory loader
6705 no longer maintains dependencies on such files.
6707 * Syntax: the scope for resolving ambiguities via type-inference is
6708 now limited to individual terms, instead of whole simultaneous
6709 specifications as before. This greatly reduces the complexity of the
6710 syntax module and improves flexibility by separating parsing and
6711 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6712 'fixes' etc.) are required in rare situations.
6714 * Syntax: constants introduced by new-style packages ('definition',
6715 'abbreviation' etc.) are passed through the syntax module in
6716 ``authentic mode''. This means that associated mixfix annotations
6717 really stick to such constants, independently of potential name space
6718 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6719 trees are represented slightly differently, may need to adapt syntax
6720 translations accordingly. Use CONST marker in 'translations' and
6721 @{const_syntax} antiquotation in 'parse_translation' etc.
6723 * Legacy goal package: reduced interface to the bare minimum required
6724 to keep existing proof scripts running. Most other user-level
6725 functions are now part of the OldGoals structure, which is *not* open
6726 by default (consider isatool expandshort before open OldGoals).
6727 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6728 these tend to cause confusion about the actual goal (!) context being
6729 used here, which is not necessarily the same as the_context().
6731 * Command 'find_theorems': supports "*" wild-card in "name:"
6732 criterion; "with_dups" option. Certain ProofGeneral versions might
6733 support a specific search form (see ProofGeneral/CHANGES).
6735 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6736 by default, which means that "prems" (and also "fixed variables") are
6737 suppressed from proof state output. Note that the ProofGeneral
6738 settings mechanism allows to change and save options persistently, but
6739 older versions of Isabelle will fail to start up if a negative prems
6742 * Local theory targets may be specified by non-nested blocks of
6743 ``context/locale/class ... begin'' followed by ``end''. The body may
6744 contain definitions, theorems etc., including any derived mechanism
6745 that has been implemented on top of these primitives. This concept
6746 generalizes the existing ``theorem (in ...)'' towards more versatility
6749 * Proof General interface: proper undo of final 'end' command;
6750 discontinued Isabelle/classic mode (ML proof scripts).
6753 *** Document preparation ***
6755 * Added antiquotation @{theory name} which prints the given name,
6756 after checking that it refers to a valid ancestor theory in the
6759 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6760 check the given source text as ML type/structure, printing verbatim.
6762 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6763 "c args == rhs" given in the current context. (Any number of
6764 arguments may be given on the LHS.)
6769 * The 'class' package offers a combination of axclass and locale to
6770 achieve Haskell-like type classes in Isabelle. Definitions and
6771 theorems within a class context produce both relative results (with
6772 implicit parameters according to the locale context), and polymorphic
6773 constants with qualified polymorphism (according to the class
6774 context). Within the body context of a 'class' target, a separate
6775 syntax layer ("user space type system") takes care of converting
6776 between global polymorphic consts and internal locale representation.
6777 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6778 "isatool doc classes" provides a tutorial.
6780 * Generic code generator framework allows to generate executable
6781 code for ML and Haskell (including Isabelle classes). A short usage
6784 internal compilation:
6785 export_code <list of constants (term syntax)> in SML
6786 writing SML code to a file:
6787 export_code <list of constants (term syntax)> in SML <filename>
6788 writing OCaml code to a file:
6789 export_code <list of constants (term syntax)> in OCaml <filename>
6790 writing Haskell code to a bunch of files:
6791 export_code <list of constants (term syntax)> in Haskell <filename>
6793 evaluating closed propositions to True/False using code generation:
6796 Reasonable default setup of framework in HOL.
6798 Theorem attributs for selecting and transforming function equations theorems:
6800 [code fun]: select a theorem as function equation for a specific constant
6801 [code fun del]: deselect a theorem as function equation for a specific constant
6802 [code inline]: select an equation theorem for unfolding (inlining) in place
6803 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6805 User-defined serializations (target in {SML, OCaml, Haskell}):
6807 code_const <and-list of constants (term syntax)>
6808 {(target) <and-list of const target syntax>}+
6810 code_type <and-list of type constructors>
6811 {(target) <and-list of type target syntax>}+
6813 code_instance <and-list of instances>
6815 where instance ::= <type constructor> :: <class>
6817 code_class <and_list of classes>
6818 {(target) <and-list of class target syntax>}+
6819 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6821 code_instance and code_class only are effective to target Haskell.
6823 For example usage see src/HOL/ex/Codegenerator.thy and
6824 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6825 generation from Isabelle/HOL theories is available via "isatool doc
6828 * Code generator: consts in 'consts_code' Isar commands are now
6829 referred to by usual term syntax (including optional type
6832 * Command 'no_translations' removes translation rules from theory
6835 * Overloaded definitions are now actually checked for acyclic
6836 dependencies. The overloading scheme is slightly more general than
6837 that of Haskell98, although Isabelle does not demand an exact
6838 correspondence to type class and instance declarations.
6839 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6840 exotic versions of overloading -- at the discretion of the user!
6842 Polymorphic constants are represented via type arguments, i.e. the
6843 instantiation that matches an instance against the most general
6844 declaration given in the signature. For example, with the declaration
6845 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6846 as c(nat). Overloading is essentially simultaneous structural
6847 recursion over such type arguments. Incomplete specification patterns
6848 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6849 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6850 Command 'print_theory' outputs the normalized system of recursive
6851 equations, see section "definitions".
6853 * Configuration options are maintained within the theory or proof
6854 context (with name and type bool/int/string), providing a very simple
6855 interface to a poor-man's version of general context data. Tools may
6856 declare options in ML (e.g. using Attrib.config_int) and then refer to
6857 these values using Config.get etc. Users may change options via an
6858 associated attribute of the same name. This form of context
6859 declaration works particularly well with commands 'declare' or
6860 'using', for example ``declare [[foo = 42]]''. Thus it has become
6861 very easy to avoid global references, which would not observe Isar
6862 toplevel undo/redo and fail to work with multithreading.
6864 Various global ML references of Pure and HOL have been turned into
6865 configuration options:
6867 Unify.search_bound unify_search_bound
6868 Unify.trace_bound unify_trace_bound
6869 Unify.trace_simp unify_trace_simp
6870 Unify.trace_types unify_trace_types
6871 Simplifier.simp_depth_limit simp_depth_limit
6872 Blast.depth_limit blast_depth_limit
6873 DatatypeProp.dtK datatype_distinctness_limit
6874 fast_arith_neq_limit fast_arith_neq_limit
6875 fast_arith_split_limit fast_arith_split_limit
6877 * Named collections of theorems may be easily installed as context
6878 data using the functor NamedThmsFun (see also
6879 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6880 attributes; there is also a toplevel print command. This facility is
6881 just a common case of general context data, which is the preferred way
6882 for anything more complex than just a list of facts in canonical
6885 * Isar: command 'declaration' augments a local theory by generic
6886 declaration functions written in ML. This enables arbitrary content
6887 being added to the context, depending on a morphism that tells the
6888 difference of the original declaration context wrt. the application
6889 context encountered later on.
6891 * Isar: proper interfaces for simplification procedures. Command
6892 'simproc_setup' declares named simprocs (with match patterns, and body
6893 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6894 context. ML antiquotation @{simproc name} retrieves named simprocs.
6896 * Isar: an extra pair of brackets around attribute declarations
6897 abbreviates a theorem reference involving an internal dummy fact,
6898 which will be ignored later --- only the effect of the attribute on
6899 the background context will persist. This form of in-place
6900 declarations is particularly useful with commands like 'declare' and
6901 'using', for example ``have A using [[simproc a]] by simp''.
6903 * Isar: method "assumption" (and implicit closing of subproofs) now
6904 takes simple non-atomic goal assumptions into account: after applying
6905 an assumption as a rule the resulting subgoals are solved by atomic
6906 assumption steps. This is particularly useful to finish 'obtain'
6907 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6908 without referring to the original premise "!!x. P x ==> thesis" in the
6909 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6912 * Isar: implicit use of prems from the Isar proof context is
6913 considered a legacy feature. Common applications like ``have A .''
6914 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6915 referencing facts explicitly here improves readability and
6916 maintainability of proof texts.
6918 * Isar: improper proof element 'guess' is like 'obtain', but derives
6919 the obtained context from the course of reasoning! For example:
6921 assume "EX x y. A x & B y" -- "any previous fact"
6922 then guess x and y by clarify
6924 This technique is potentially adventurous, depending on the facts and
6925 proof tools being involved here.
6927 * Isar: known facts from the proof context may be specified as literal
6928 propositions, using ASCII back-quote syntax. This works wherever
6929 named facts used to be allowed so far, in proof commands, proof
6930 methods, attributes etc. Literal facts are retrieved from the context
6931 according to unification of type and term parameters. For example,
6932 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6933 theorems in the current context, then these are valid literal facts:
6934 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6936 There is also a proof method "fact" which does the same composition
6937 for explicit goal states, e.g. the following proof texts coincide with
6938 certain special cases of literal facts:
6940 have "A" by fact == note `A`
6941 have "A ==> B" by fact == note `A ==> B`
6942 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6943 have "P a ==> Q a" by fact == note `P a ==> Q a`
6945 * Isar: ":" (colon) is no longer a symbolic identifier character in
6946 outer syntax. Thus symbolic identifiers may be used without
6947 additional white space in declarations like this: ``assume *: A''.
6949 * Isar: 'print_facts' prints all local facts of the current context,
6950 both named and unnamed ones.
6952 * Isar: 'def' now admits simultaneous definitions, e.g.:
6954 def x == "t" and y == "u"
6956 * Isar: added command 'unfolding', which is structurally similar to
6957 'using', but affects both the goal state and facts by unfolding given
6958 rewrite rules. Thus many occurrences of the 'unfold' method or
6959 'unfolded' attribute may be replaced by first-class proof text.
6961 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6962 and command 'unfolding' now all support object-level equalities
6963 (potentially conditional). The underlying notion of rewrite rule is
6964 analogous to the 'rule_format' attribute, but *not* that of the
6965 Simplifier (which is usually more generous).
6967 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6968 premises of a theorem by n. Useful in conjunction with drule.
6970 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6971 method expression within a sandbox consisting of the first N
6972 sub-goals, which need to exist. For example, ``simp_all [3]''
6973 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6974 simplifies all new goals that emerge from applying rule foo to the
6975 originally first one.
6977 * Isar: schematic goals are no longer restricted to higher-order
6978 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6981 * Isar: the conclusion of a long theorem statement is now either
6982 'shows' (a simultaneous conjunction, as before), or 'obtains'
6983 (essentially a disjunction of cases with local parameters and
6984 assumptions). The latter allows to express general elimination rules
6985 adequately; in this notation common elimination rules look like this:
6987 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6989 obtains x where "P x"
6991 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6995 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7001 The subsequent classical rules even refer to the formal "thesis"
7004 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7007 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7008 obtains "thesis ==> something"
7010 The actual proof of an 'obtains' statement is analogous to that of the
7011 Isar proof element 'obtain', only that there may be several cases.
7012 Optional case names may be specified in parentheses; these will be
7013 available both in the present proof and as annotations in the
7014 resulting rule, for later use with the 'cases' method (cf. attribute
7017 * Isar: the assumptions of a long theorem statement are available as
7018 "assms" fact in the proof context. This is more appropriate than the
7019 (historical) "prems", which refers to all assumptions of the current
7020 context, including those from the target locale, proof body etc.
7022 * Isar: 'print_statement' prints theorems from the current theory or
7023 proof context in long statement form, according to the syntax of a
7026 * Isar: 'obtain' takes an optional case name for the local context
7027 introduction rule (default "that").
7029 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7030 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7033 * Pure: syntax "CONST name" produces a fully internalized constant
7034 according to the current context. This is particularly useful for
7035 syntax translations that should refer to internal constant
7036 representations independently of name spaces.
7038 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7039 instead of "FOO ". This allows multiple binder declarations to coexist
7040 in the same context. INCOMPATIBILITY.
7042 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7043 primitive that also works in a locale context (both for constants and
7044 fixed variables). Type declaration and internal syntactic representation
7045 of given constants retrieved from the context. Likewise, the
7046 'no_notation' command allows to remove given syntax annotations from the
7049 * Isar/locales: new derived specification elements 'axiomatization',
7050 'definition', 'abbreviation', which support type-inference, admit
7051 object-level specifications (equality, equivalence). See also the
7052 isar-ref manual. Examples:
7055 eq (infix "===" 50) where
7056 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7058 definition "f x y = x + y + 1"
7059 definition g where "g x = f x x"
7062 neq (infix "=!=" 50) where
7063 "x =!= y == ~ (x === y)"
7065 These specifications may be also used in a locale context. Then the
7066 constants being introduced depend on certain fixed parameters, and the
7067 constant name is qualified by the locale base name. An internal
7068 abbreviation takes care for convenient input and output, making the
7069 parameters implicit and using the original short name. See also
7070 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7071 entities from a monomorphic theory.
7073 Presently, abbreviations are only available 'in' a target locale, but
7074 not inherited by general import expressions. Also note that
7075 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7076 'translations' in common applications. The "no_abbrevs" print mode
7077 prevents folding of abbreviations in term output.
7079 Concrete syntax is attached to specified constants in internal form,
7080 independently of name spaces. The parse tree representation is
7081 slightly different -- use 'notation' instead of raw 'syntax', and
7082 'translations' with explicit "CONST" markup to accommodate this.
7084 * Pure/Isar: unified syntax for new-style specification mechanisms
7085 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7086 full type inference and dummy patterns ("_"). For example:
7088 definition "K x _ = x"
7090 inductive conj for A B
7091 where "A ==> B ==> conj A B"
7093 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7094 the current context. Print mode "no_abbrevs" prevents inversion of
7095 abbreviations on output.
7097 * Isar/locales: improved parameter handling: use of locales "var" and
7098 "struct" no longer necessary; - parameter renamings are no longer
7099 required to be injective. For example, this allows to define
7100 endomorphisms as locale endom = homom mult mult h.
7102 * Isar/locales: changed the way locales with predicates are defined.
7103 Instead of accumulating the specification, the imported expression is
7104 now an interpretation. INCOMPATIBILITY: different normal form of
7105 locale expressions. In particular, in interpretations of locales with
7106 predicates, goals repesenting already interpreted fragments are not
7107 removed automatically. Use methods `intro_locales' and
7108 `unfold_locales'; see below.
7110 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7111 provide backward reasoning on locales predicates. The methods are
7112 aware of interpretations and discharge corresponding goals.
7113 `intro_locales' is less aggressive then `unfold_locales' and does not
7114 unfold predicates to assumptions.
7116 * Isar/locales: the order in which locale fragments are accumulated
7117 has changed. This enables to override declarations from fragments due
7118 to interpretations -- for example, unwanted simp rules.
7120 * Isar/locales: interpretation in theories and proof contexts has been
7121 extended. One may now specify (and prove) equations, which are
7122 unfolded in interpreted theorems. This is useful for replacing
7123 defined concepts (constants depending on locale parameters) by
7124 concepts already existing in the target context. Example:
7126 interpretation partial_order ["op <= :: [int, int] => bool"]
7127 where "partial_order.less (op <=) (x::int) y = (x < y)"
7129 Typically, the constant `partial_order.less' is created by a
7130 definition specification element in the context of locale
7133 * Method "induct": improved internal context management to support
7134 local fixes and defines on-the-fly. Thus explicit meta-level
7135 connectives !! and ==> are rarely required anymore in inductive goals
7136 (using object-logic connectives for this purpose has been long
7137 obsolete anyway). Common proof patterns are explained in
7138 src/HOL/Induct/Common_Patterns.thy, see also
7139 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7142 * Method "induct": improved handling of simultaneous goals. Instead of
7143 introducing object-level conjunction, the statement is now split into
7144 several conclusions, while the corresponding symbolic cases are nested
7145 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7146 see src/HOL/Induct/Common_Patterns.thy, for example.
7148 * Method "induct": mutual induction rules are now specified as a list
7149 of rule sharing the same induction cases. HOL packages usually provide
7150 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7151 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7152 mutual induction rules differently, i.e. like this:
7154 (induct rule: foo_bar.inducts)
7155 (induct set: foo bar)
7156 (induct pred: foo bar)
7157 (induct type: foo bar)
7159 The ML function ProjectRule.projections turns old-style rules into the
7162 * Method "coinduct": dual of induction, see
7163 src/HOL/Library/Coinductive_List.thy for various examples.
7165 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7166 considered a legacy feature.
7168 * Attribute "symmetric" produces result with standardized schematic
7169 variables (index 0). Potential INCOMPATIBILITY.
7171 * Simplifier: by default the simplifier trace only shows top level
7172 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7173 default. Thus there is less danger of being flooded by the trace. The
7174 trace indicates where parts have been suppressed.
7176 * Provers/classical: removed obsolete classical version of elim_format
7177 attribute; classical elim/dest rules are now treated uniformly when
7178 manipulating the claset.
7180 * Provers/classical: stricter checks to ensure that supplied intro,
7181 dest and elim rules are well-formed; dest and elim rules must have at
7184 * Provers/classical: attributes dest/elim/intro take an optional
7185 weight argument for the rule (just as the Pure versions). Weights are
7186 ignored by automated tools, but determine the search order of single
7189 * Syntax: input syntax now supports dummy variable binding "%_. b",
7190 where the body does not mention the bound variable. Note that dummy
7191 patterns implicitly depend on their context of bounds, which makes
7192 "{_. _}" match any set comprehension as expected. Potential
7193 INCOMPATIBILITY -- parse translations need to cope with syntactic
7194 constant "_idtdummy" in the binding position.
7196 * Syntax: removed obsolete syntactic constant "_K" and its associated
7197 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7198 for example "A -> B" => "Pi A (%_. B)".
7200 * Pure: 'class_deps' command visualizes the subclass relation, using
7201 the graph browser tool.
7203 * Pure: 'print_theory' now suppresses certain internal declarations by
7204 default; use '!' option for full details.
7209 * Method "metis" proves goals by applying the Metis general-purpose
7210 resolution prover (see also http://gilith.com/software/metis/).
7211 Examples are in the directory MetisExamples. WARNING: the
7212 Isabelle/HOL-Metis integration does not yet work properly with
7215 * Command 'sledgehammer' invokes external automatic theorem provers as
7216 background processes. It generates calls to the "metis" method if
7217 successful. These can be pasted into the proof. Users do not have to
7218 wait for the automatic provers to return. WARNING: does not really
7219 work with multi-threading.
7221 * New "auto_quickcheck" feature tests outermost goal statements for
7222 potential counter-examples. Controlled by ML references
7223 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7224 5000 milliseconds). Fails silently if statements is outside of
7225 executable fragment, or any other codgenerator problem occurs.
7227 * New constant "undefined" with axiom "undefined x = undefined".
7229 * Added class "HOL.eq", allowing for code generation with polymorphic
7232 * Some renaming of class constants due to canonical name prefixing in
7233 the new 'class' package:
7235 HOL.abs ~> HOL.abs_class.abs
7236 HOL.divide ~> HOL.divide_class.divide
7237 0 ~> HOL.zero_class.zero
7238 1 ~> HOL.one_class.one
7239 op + ~> HOL.plus_class.plus
7240 op - ~> HOL.minus_class.minus
7241 uminus ~> HOL.minus_class.uminus
7242 op * ~> HOL.times_class.times
7243 op < ~> HOL.ord_class.less
7244 op <= > HOL.ord_class.less_eq
7245 Nat.power ~> Power.power_class.power
7246 Nat.size ~> Nat.size_class.size
7247 Numeral.number_of ~> Numeral.number_class.number_of
7248 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7249 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7250 Orderings.min ~> Orderings.ord_class.min
7251 Orderings.max ~> Orderings.ord_class.max
7252 Divides.op div ~> Divides.div_class.div
7253 Divides.op mod ~> Divides.div_class.mod
7254 Divides.op dvd ~> Divides.div_class.dvd
7256 INCOMPATIBILITY. Adaptions may be required in the following cases:
7258 a) User-defined constants using any of the names "plus", "minus",
7259 "times", "less" or "less_eq". The standard syntax translations for
7260 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7263 b) Variables named "plus", "minus", "times", "less", "less_eq"
7264 INCOMPATIBILITY: use more specific names.
7266 c) Permutative equations (e.g. "a + b = b + a")
7267 Since the change of names also changes the order of terms, permutative
7268 rewrite rules may get applied in a different order. Experience shows
7269 that this is rarely the case (only two adaptions in the whole Isabelle
7270 distribution). INCOMPATIBILITY: rewrite proofs
7272 d) ML code directly refering to constant names
7273 This in general only affects hand-written proof tactics, simprocs and
7274 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7275 Consider using @{const_name} antiquotation.
7277 * New class "default" with associated constant "default".
7279 * Function "sgn" is now overloaded and available on int, real, complex
7280 (and other numeric types), using class "sgn". Two possible defs of
7281 sgn are given as equational assumptions in the classes sgn_if and
7282 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7285 * Locale "partial_order" now unified with class "order" (cf. theory
7286 Orderings), added parameter "less". INCOMPATIBILITY.
7288 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7289 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7290 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7292 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7293 changed order of proof goals in instance proofs.
7295 * The transitivity reasoner for partial and linear orders is set up
7296 for classes "order" and "linorder". Instances of the reasoner are available
7297 in all contexts importing or interpreting the corresponding locales.
7298 Method "order" invokes the reasoner separately; the reasoner
7299 is also integrated with the Simplifier as a solver. Diagnostic
7300 command 'print_orders' shows the available instances of the reasoner
7301 in the current context.
7303 * Localized monotonicity predicate in theory "Orderings"; integrated
7304 lemmas max_of_mono and min_of_mono with this predicate.
7307 * Formulation of theorem "dense" changed slightly due to integration
7308 with new class dense_linear_order.
7310 * Uniform lattice theory development in HOL.
7312 constants "meet" and "join" now named "inf" and "sup"
7313 constant "Meet" now named "Inf"
7315 classes "meet_semilorder" and "join_semilorder" now named
7316 "lower_semilattice" and "upper_semilattice"
7317 class "lorder" now named "lattice"
7318 class "comp_lat" now named "complete_lattice"
7320 Instantiation of lattice classes allows explicit definitions
7321 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7323 INCOMPATIBILITY. Theorem renames:
7325 meet_left_le ~> inf_le1
7326 meet_right_le ~> inf_le2
7327 join_left_le ~> sup_ge1
7328 join_right_le ~> sup_ge2
7329 meet_join_le ~> inf_sup_ord
7332 le_meet ~> le_inf_iff
7333 le_join ~> ge_sup_conv
7334 meet_idempotent ~> inf_idem
7335 join_idempotent ~> sup_idem
7336 meet_comm ~> inf_commute
7337 join_comm ~> sup_commute
7338 meet_leI1 ~> le_infI1
7339 meet_leI2 ~> le_infI2
7340 le_joinI1 ~> le_supI1
7341 le_joinI2 ~> le_supI2
7342 meet_assoc ~> inf_assoc
7343 join_assoc ~> sup_assoc
7344 meet_left_comm ~> inf_left_commute
7345 meet_left_idempotent ~> inf_left_idem
7346 join_left_comm ~> sup_left_commute
7347 join_left_idempotent ~> sup_left_idem
7350 le_def_meet ~> le_iff_inf
7351 le_def_join ~> le_iff_sup
7352 join_absorp2 ~> sup_absorb2
7353 join_absorp1 ~> sup_absorb1
7354 meet_absorp1 ~> inf_absorb1
7355 meet_absorp2 ~> inf_absorb2
7356 meet_join_absorp ~> inf_sup_absorb
7357 join_meet_absorp ~> sup_inf_absorb
7358 distrib_join_le ~> distrib_sup_le
7359 distrib_meet_le ~> distrib_inf_le
7361 add_meet_distrib_left ~> add_inf_distrib_left
7362 add_join_distrib_left ~> add_sup_distrib_left
7363 is_join_neg_meet ~> is_join_neg_inf
7364 is_meet_neg_join ~> is_meet_neg_sup
7365 add_meet_distrib_right ~> add_inf_distrib_right
7366 add_join_distrib_right ~> add_sup_distrib_right
7367 add_meet_join_distribs ~> add_sup_inf_distribs
7368 join_eq_neg_meet ~> sup_eq_neg_inf
7369 meet_eq_neg_join ~> inf_eq_neg_sup
7370 add_eq_meet_join ~> add_eq_inf_sup
7371 meet_0_imp_0 ~> inf_0_imp_0
7372 join_0_imp_0 ~> sup_0_imp_0
7373 meet_0_eq_0 ~> inf_0_eq_0
7374 join_0_eq_0 ~> sup_0_eq_0
7375 neg_meet_eq_join ~> neg_inf_eq_sup
7376 neg_join_eq_meet ~> neg_sup_eq_inf
7377 join_eq_if ~> sup_eq_if
7379 mono_meet ~> mono_inf
7380 mono_join ~> mono_sup
7381 meet_bool_eq ~> inf_bool_eq
7382 join_bool_eq ~> sup_bool_eq
7383 meet_fun_eq ~> inf_fun_eq
7384 join_fun_eq ~> sup_fun_eq
7385 meet_set_eq ~> inf_set_eq
7386 join_set_eq ~> sup_set_eq
7387 meet1_iff ~> inf1_iff
7388 meet2_iff ~> inf2_iff
7397 join1_iff ~> sup1_iff
7398 join2_iff ~> sup2_iff
7408 is_meet_Meet ~> is_meet_Inf
7409 Meet_bool_def ~> Inf_bool_def
7410 Meet_fun_def ~> Inf_fun_def
7411 Meet_greatest ~> Inf_greatest
7412 Meet_lower ~> Inf_lower
7413 Meet_set_def ~> Inf_set_def
7416 Sup_bool_eq ~> Sup_bool_def
7417 Sup_fun_eq ~> Sup_fun_def
7418 Sup_set_eq ~> Sup_set_def
7420 listsp_meetI ~> listsp_infI
7421 listsp_meet_eq ~> listsp_inf_eq
7426 * Added syntactic class "size"; overloaded constant "size" now has
7427 type "'a::size ==> bool"
7429 * Internal reorganisation of `size' of datatypes: size theorems
7430 "foo.size" are no longer subsumed by "foo.simps" (but are still
7431 simplification rules by default!); theorems "prod.size" now named
7434 * Class "div" now inherits from class "times" rather than "type".
7437 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7438 Linorder etc. have disappeared; operations defined in terms of
7439 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7441 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7443 * HOL-Word: New extensive library and type for generic, fixed size
7444 machine words, with arithmetic, bit-wise, shifting and rotating
7445 operations, reflection into int, nat, and bool lists, automation for
7446 linear arithmetic (by automatic reflection into nat or int), including
7447 lemmas on overflow and monotonicity. Instantiated to all appropriate
7448 arithmetic type classes, supporting automatic simplification of
7449 numerals on all operations.
7451 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7453 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7455 * Code generator library theories:
7456 - Code_Integer represents HOL integers by big integer literals in target
7458 - Code_Char represents HOL characters by character literals in target
7460 - Code_Char_chr like Code_Char, but also offers treatment of character
7461 codes; includes Code_Integer.
7462 - Executable_Set allows to generate code for finite sets using lists.
7463 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7465 - Executable_Real implements a subset of real numbers, namly those
7466 representable by rational numbers.
7467 - Efficient_Nat implements natural numbers by integers, which in general will
7468 result in higher efficency; pattern matching with 0/Suc is eliminated;
7469 includes Code_Integer.
7470 - Code_Index provides an additional datatype index which is mapped to
7471 target-language built-in integers.
7472 - Code_Message provides an additional datatype message_string which is isomorphic to
7473 strings; messages are mapped to target-language strings.
7475 * New package for inductive predicates
7477 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7480 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7481 for z_1 :: U_1 and ... and z_n :: U_m
7483 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7486 with full support for type-inference, rather than
7488 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7490 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7491 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7493 inductive "s z_1 ... z_m"
7495 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7498 For backward compatibility, there is a wrapper allowing inductive
7499 sets to be defined with the new package via
7502 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7503 for z_1 :: U_1 and ... and z_n :: U_m
7505 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7511 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7512 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7513 for z_1 :: U_1 and ... and z_n :: U_m
7515 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7516 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7519 if the additional syntax "p ..." is required.
7521 Numerous examples can be found in the subdirectories src/HOL/Auth,
7522 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7526 - Since declaration and definition of inductive sets or predicates
7527 is no longer separated, abbreviations involving the newly
7528 introduced sets or predicates must be specified together with the
7529 introduction rules after the 'where' keyword (see above), rather
7530 than before the actual inductive definition.
7532 - The variables in induction and elimination rules are now
7533 quantified in the order of their occurrence in the introduction
7534 rules, rather than in alphabetical order. Since this may break
7535 some proofs, these proofs either have to be repaired, e.g. by
7536 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7537 statements of the form
7539 case (rule_i a_i_1 ... a_i_{k_i})
7541 or the old order of quantification has to be restored by explicitly adding
7542 meta-level quantifiers in the introduction rules, i.e.
7544 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7546 - The format of the elimination rules is now
7548 p z_1 ... z_m x_1 ... x_n ==>
7549 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7554 (x_1, ..., x_n) : s z_1 ... z_m ==>
7555 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7558 for sets rather than
7560 x : s z_1 ... z_m ==>
7561 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7564 This may require terms in goals to be expanded to n-tuples
7565 (e.g. using case_tac or simplification with the split_paired_all
7566 rule) before the above elimination rule is applicable.
7568 - The elimination or case analysis rules for (mutually) inductive
7569 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7570 list of rules "p_1_..._p_k.elims" is no longer available.
7572 * New package "function"/"fun" for general recursive functions,
7573 supporting mutual and nested recursion, definitions in local contexts,
7574 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7575 for small examples, and the separate tutorial on the function
7576 package. The old recdef "package" is still available as before, but
7577 users are encouraged to use the new package.
7579 * Method "lexicographic_order" automatically synthesizes termination
7580 relations as lexicographic combinations of size measures.
7582 * Case-expressions allow arbitrary constructor-patterns (including
7583 "_") and take their order into account, like in functional
7584 programming. Internally, this is translated into nested
7585 case-expressions; missing cases are added and mapped to the predefined
7586 constant "undefined". In complicated cases printing may no longer show
7587 the original input but the internal form. Lambda-abstractions allow
7588 the same form of pattern matching: "% pat1 => e1 | ..." is an
7589 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7592 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7593 is an abbreviation for "of_nat :: nat => int". The simplification
7594 rules for "of_nat" have been changed to work like "int" did
7595 previously. Potential INCOMPATIBILITY:
7596 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7597 - of_nat_diff and of_nat_mult are no longer default simp rules
7599 * Method "algebra" solves polynomial equations over (semi)rings using
7600 Groebner bases. The (semi)ring structure is defined by locales and the
7601 tool setup depends on that generic context. Installing the method for
7602 a specific type involves instantiating the locale and possibly adding
7603 declarations for computation on the coefficients. The method is
7604 already instantiated for natural numbers and for the axiomatic class
7605 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7606 CALCULEMUS 2007 for the general principles underlying this
7607 architecture of context-aware proof-tools.
7609 * Method "ferrack" implements quantifier elimination over
7610 special-purpose dense linear orders using locales (analogous to
7611 "algebra"). The method is already installed for class
7612 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7615 * Former constant "List.op @" now named "List.append". Use ML
7616 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7617 circumvent possible incompatibilities when working on ML level.
7619 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7621 * New function listsum :: 'a list => 'a for arbitrary monoids.
7622 Special syntax: "SUM x <- xs. f x" (and latex variants)
7624 * New syntax for Haskell-like list comprehension (input only), eg.
7625 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7627 * The special syntax for function "filter" has changed from [x :
7628 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7629 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7631 * [a..b] is now defined for arbitrary linear orders. It used to be
7632 defined on nat only, as an abbreviation for [a..<Suc b]
7635 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7637 * New functions "sorted" and "sort" in src/HOL/List.thy.
7639 * New lemma collection field_simps (an extension of ring_simps) for
7640 manipulating (in)equations involving division. Multiplies with all
7641 denominators that can be proved to be non-zero (in equations) or
7642 positive/negative (in inequations).
7644 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7645 have been improved and renamed to ring_simps, group_simps and
7646 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7647 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7649 * Theory Library/Commutative_Ring: switched from recdef to function
7650 package; constants add, mul, pow now curried. Infix syntax for
7651 algebraic operations.
7653 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7656 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7659 * HOL/records: generalised field-update to take a function on the
7660 field rather than the new value: r(|A := x|) is translated to A_update
7661 (K x) r The K-combinator that is internally used is called K_record.
7662 INCOMPATIBILITY: Usage of the plain update functions has to be
7665 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7666 * x = 0, which are required for a semiring. Richer structures do not
7667 inherit from semiring_0 anymore, because this property is a theorem
7668 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7669 there is more to prove, but this is mostly trivial.
7671 * Class "recpower" is generalized to arbitrary monoids, not just
7672 commutative semirings. INCOMPATIBILITY: may need to incorporate
7673 commutativity or semiring properties additionally.
7675 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7676 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7677 better use 'abbreviation'.
7679 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7681 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7682 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7683 significant changes for setting up numeral syntax for types:
7684 - New constants Numeral.pred and Numeral.succ instead
7685 of former Numeral.bin_pred and Numeral.bin_succ.
7686 - Use integer operations instead of bin_add, bin_mult and so on.
7687 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7688 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7690 See src/HOL/Integ/IntArith.thy for an example setup.
7692 * Command 'normal_form' computes the normal form of a term that may
7693 contain free variables. For example ``normal_form "rev [a, b, c]"''
7694 produces ``[b, c, a]'' (without proof). This command is suitable for
7695 heavy-duty computations because the functions are compiled to ML
7696 first. Correspondingly, a method "normalization" is provided. See
7697 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7699 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7700 25 like -->); output depends on the "iff" print_mode, the default is
7701 "A = B" (with priority 50).
7703 * Relations less (<) and less_eq (<=) are also available on type bool.
7704 Modified syntax to disallow nesting without explicit parentheses,
7705 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7708 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7710 * Relation composition operator "op O" now has precedence 75 and binds
7711 stronger than union and intersection. INCOMPATIBILITY.
7713 * The old set interval syntax "{m..n(}" (and relatives) has been
7714 removed. Use "{m..<n}" (and relatives) instead.
7716 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7717 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7718 ``declare [[simproc del: neq]]''.
7720 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7723 * Theorem Cons_eq_map_conv no longer declared as "simp".
7725 * Theorem setsum_mult renamed to setsum_right_distrib.
7727 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7730 * Reimplemented methods "sat" and "satx", with several improvements:
7731 goals no longer need to be stated as "<prems> ==> False", equivalences
7732 (i.e. "=" on type bool) are handled, variable names of the form
7733 "lit_<n>" are no longer reserved, significant speedup.
7735 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7736 zChaff is still supported as well.
7738 * 'inductive' and 'datatype': provide projections of mutual rules,
7739 bundled as foo_bar.inducts;
7741 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7744 * Library: moved theory Accessible_Part to main HOL.
7746 * Library: added theory Coinductive_List of potentially infinite lists
7747 as greatest fixed-point.
7749 * Library: added theory AssocList which implements (finite) maps as
7752 * Method "evaluation" solves goals (i.e. a boolean expression)
7753 efficiently by compiling it to ML. The goal is "proved" (via an
7754 oracle) if it evaluates to True.
7756 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7757 also when invoked by the simplifier. This results in the Simplifier
7758 being more powerful on arithmetic goals. INCOMPATIBILITY.
7759 Configuration option fast_arith_split_limit=0 recovers the old
7762 * Support for hex (0x20) and binary (0b1001) numerals.
7764 * New method: reify eqs (t), where eqs are equations for an
7765 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7766 parameter, computes a term s::'b and a list xs::'a list and proves the
7767 theorem I xs s = t. This is also known as reification or quoting. The
7768 resulting theorem is applied to the subgoal to substitute t with I xs
7769 s. If t is omitted, the subgoal itself is reified.
7771 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7772 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7773 where f is supposed to be a computable function (in the sense of code
7774 generattion). The method uses reify to compute s and xs as above then
7775 applies corr_thm and uses normalization by evaluation to "prove" f s =
7776 r and finally gets the theorem t = r, which is again applied to the
7777 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7779 * Reflection: Automatic reification now handels binding, an example is
7780 available in src/HOL/ex/ReflectionEx.thy
7782 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7783 command 'statespace' that is similar to 'record', but introduces an
7784 abstract specification based on the locale infrastructure instead of
7785 HOL types. This leads to extra flexibility in composing state spaces,
7786 in particular multiple inheritance and renaming of components.
7791 * Hyperreal: Functions root and sqrt are now defined on negative real
7792 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7793 Nonnegativity side conditions have been removed from many lemmas, so
7794 that more subgoals may now be solved by simplification; potential
7797 * Real: new type classes formalize real normed vector spaces and
7798 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7799 and norm :: 'a => real.
7801 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7802 reals into other types. The overloaded constant Reals :: 'a set is now
7803 defined as range of_real; potential INCOMPATIBILITY.
7805 * Real: proper support for ML code generation, including 'quickcheck'.
7806 Reals are implemented as arbitrary precision rationals.
7808 * Hyperreal: Several constants that previously worked only for the
7809 reals have been generalized, so they now work over arbitrary vector
7810 spaces. Type annotations may need to be added in some cases; potential
7813 Infinitesimal :: ('a::real_normed_vector) star set
7814 HFinite :: ('a::real_normed_vector) star set
7815 HInfinite :: ('a::real_normed_vector) star set
7816 approx :: ('a::real_normed_vector) star => 'a star => bool
7817 monad :: ('a::real_normed_vector) star => 'a star set
7818 galaxy :: ('a::real_normed_vector) star => 'a star set
7819 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7820 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7821 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7822 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7823 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7824 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7825 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7826 sgn :: 'a::real_normed_vector => 'a
7827 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7829 * Complex: Some complex-specific constants are now abbreviations for
7830 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7831 hnorm. Other constants have been entirely removed in favor of the
7832 polymorphic versions (INCOMPATIBILITY):
7836 HInfinite <-- CInfinite
7837 Infinitesimal <-- CInfinitesimal
7840 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7841 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7842 (ns)deriv <-- (ns)cderiv
7847 * Formalisation of ideals and the quotient construction over rings.
7849 * Order and lattice theory no longer based on records.
7852 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7853 greatest_closed. INCOMPATIBILITY.
7855 * Method algebra is now set up via an attribute. For examples see
7856 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7857 of algebraic structures.
7859 * Renamed theory CRing to Ring.
7864 * Substantial, yet incomplete support for nominal datatypes (binding
7865 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7866 src/HOL/Nominal/Examples. Prospective users should consult
7867 http://isabelle.in.tum.de/nominal/
7872 * ML basics: just one true type int, which coincides with IntInf.int
7875 * ML within Isar: antiquotations allow to embed statically-checked
7876 formal entities in the source, referring to the context available at
7877 compile-time. For example:
7879 ML {* @{sort "{zero,one}"} *}
7880 ML {* @{typ "'a => 'b"} *}
7881 ML {* @{term "%x. x"} *}
7882 ML {* @{prop "x == y"} *}
7883 ML {* @{ctyp "'a => 'b"} *}
7884 ML {* @{cterm "%x. x"} *}
7885 ML {* @{cprop "x == y"} *}
7886 ML {* @{thm asm_rl} *}
7887 ML {* @{thms asm_rl} *}
7888 ML {* @{type_name c} *}
7889 ML {* @{type_syntax c} *}
7890 ML {* @{const_name c} *}
7891 ML {* @{const_syntax c} *}
7894 ML {* @{theory Pure} *}
7895 ML {* @{theory_ref} *}
7896 ML {* @{theory_ref Pure} *}
7899 ML {* @{clasimpset} *}
7901 The same works for sources being ``used'' within an Isar context.
7903 * ML in Isar: improved error reporting; extra verbosity with
7904 ML_Context.trace enabled.
7906 * Pure/General/table.ML: the join operations now works via exceptions
7907 DUP/SAME instead of type option. This is simpler in simple cases, and
7908 admits slightly more efficient complex applications.
7910 * Pure: 'advanced' translation functions (parse_translation etc.) now
7911 use Context.generic instead of just theory.
7913 * Pure: datatype Context.generic joins theory/Proof.context and
7914 provides some facilities for code that works in either kind of
7915 context, notably GenericDataFun for uniform theory and proof data.
7917 * Pure: simplified internal attribute type, which is now always
7918 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7919 local (Proof.context) attributes have been discontinued, while
7920 minimizing code duplication. Thm.rule_attribute and
7921 Thm.declaration_attribute build canonical attributes; see also structure
7922 Context for further operations on Context.generic, notably
7923 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7924 declarations and definitions.
7926 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7927 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7928 init only required for impure data. INCOMPATIBILITY: empty really need
7929 to be empty (no dependencies on theory content!)
7931 * Pure/kernel: consts certification ignores sort constraints given in
7932 signature declarations. (This information is not relevant to the
7933 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7934 potential INCOMPATIBILITY.
7936 * Pure: axiomatic type classes are now purely definitional, with
7937 explicit proofs of class axioms and super class relations performed
7938 internally. See Pure/axclass.ML for the main internal interfaces --
7939 notably AxClass.define_class supercedes AxClass.add_axclass, and
7940 AxClass.axiomatize_class/classrel/arity supersede
7941 Sign.add_classes/classrel/arities.
7943 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7944 global/local versions on theory vs. Proof.context have been
7945 discontinued; Attrib.syntax and Method.syntax have been adapted
7946 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7947 attributes, methods, etc.
7949 * Pure: several functions of signature "... -> theory -> theory * ..."
7950 have been reoriented to "... -> theory -> ... * theory" in order to
7951 allow natural usage in combination with the ||>, ||>>, |-> and
7952 fold_map combinators.
7954 * Pure: official theorem names (closed derivations) and additional
7955 comments (tags) are now strictly separate. Name hints -- which are
7956 maintained as tags -- may be attached any time without affecting the
7959 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7960 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7961 achieve the old behaviour.
7963 * Pure: the "Goal" constant is now called "prop", supporting a
7964 slightly more general idea of ``protecting'' meta-level rule
7967 * Pure: Logic.(un)varify only works in a global context, which is now
7968 enforced instead of silently assumed. INCOMPATIBILITY, may use
7969 Logic.legacy_(un)varify as temporary workaround.
7971 * Pure: structure Name provides scalable operations for generating
7972 internal variable names, notably Name.variants etc. This replaces
7973 some popular functions from term.ML:
7975 Term.variant -> Name.variant
7976 Term.variantlist -> Name.variant_list
7977 Term.invent_names -> Name.invent_list
7979 Note that low-level renaming rarely occurs in new code -- operations
7980 from structure Variable are used instead (see below).
7982 * Pure: structure Variable provides fundamental operations for proper
7983 treatment of fixed/schematic variables in a context. For example,
7984 Variable.import introduces fixes for schematics of given facts and
7985 Variable.export reverses the effect (up to renaming) -- this replaces
7986 various freeze_thaw operations.
7988 * Pure: structure Goal provides simple interfaces for
7989 init/conclude/finish and tactical prove operations (replacing former
7990 Tactic.prove). Goal.prove is the canonical way to prove results
7991 within a given context; Goal.prove_global is a degraded version for
7992 theory level goals, including a global Drule.standard. Note that
7993 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7994 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7995 in a locale context).
7997 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7998 and type checking (Syntax.check_term etc.), with common combinations
7999 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8000 which are considered legacy and await removal.
8002 * Pure/Syntax: generic interfaces for type unchecking
8003 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8004 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8005 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8006 available for convenience, but refer to the very same operations using
8007 a mere theory instead of a full context.
8009 * Isar: simplified treatment of user-level errors, using exception
8010 ERROR of string uniformly. Function error now merely raises ERROR,
8011 without any side effect on output channels. The Isar toplevel takes
8012 care of proper display of ERROR exceptions. ML code may use plain
8013 handle/can/try; cat_error may be used to concatenate errors like this:
8015 ... handle ERROR msg => cat_error msg "..."
8017 Toplevel ML code (run directly or through the Isar toplevel) may be
8018 embedded into the Isar toplevel with exception display/debug like
8021 Isar.toplevel (fn () => ...)
8023 INCOMPATIBILITY, removed special transform_error facilities, removed
8024 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8025 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8026 -- use plain ERROR instead.
8028 * Isar: theory setup now has type (theory -> theory), instead of a
8029 list. INCOMPATIBILITY, may use #> to compose setup functions.
8031 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8032 ProofContext.debug/verbose flags.
8034 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8035 theory before entering a proof state. Transactions now always see a
8036 quasi-functional intermediate checkpoint, both in interactive and
8039 * Isar: simplified interfaces for outer syntax. Renamed
8040 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8041 OuterSyntax.add_parsers -- this functionality is now included in
8042 OuterSyntax.command etc. INCOMPATIBILITY.
8044 * Simplifier: the simpset of a running simplification process now
8045 contains a proof context (cf. Simplifier.the_context), which is the
8046 very context that the initial simpset has been retrieved from (by
8047 simpset_of/local_simpset_of). Consequently, all plug-in components
8048 (solver, looper etc.) may depend on arbitrary proof data.
8050 * Simplifier.inherit_context inherits the proof context (plus the
8051 local bounds) of the current simplification process; any simproc
8052 etc. that calls the Simplifier recursively should do this! Removed
8053 former Simplifier.inherit_bounds, which is already included here --
8054 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8055 specify an explicit context using Simplifier.context/theory_context.
8057 * Simplifier/Classical Reasoner: more abstract interfaces
8058 change_simpset/claset for modifying the simpset/claset reference of a
8059 theory; raw versions simpset/claset_ref etc. have been discontinued --
8062 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8068 * settings: the default heap location within ISABELLE_HOME_USER now
8069 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8070 Isabelle installations.
8072 * isabelle-process: option -S (secure mode) disables some critical
8073 operations, notably runtime compilation and evaluation of ML source
8076 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8078 * Support for parallel execution, using native multicore support of
8079 Poly/ML 5.1. The theory loader exploits parallelism when processing
8080 independent theories, according to the given theory header
8081 specifications. The maximum number of worker threads is specified via
8082 usedir option -M or the "max-threads" setting in Proof General. A
8083 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8084 to 6 on a 8-core machine. User-code needs to observe certain
8085 guidelines for thread-safe programming, see appendix A in the Isar
8086 Implementation manual.
8090 New in Isabelle2005 (October 2005)
8091 ----------------------------------
8095 * Theory headers: the new header syntax for Isar theories is
8098 imports <theory1> ... <theoryN>
8099 uses <file1> ... <fileM>
8102 where the 'uses' part is optional. The previous syntax
8104 theory <name> = <theory1> + ... + <theoryN>:
8106 will disappear in the next release. Use isatool fixheaders to convert
8107 existing theory files. Note that there is no change in ancient
8108 non-Isar theories now, but these will disappear soon.
8110 * Theory loader: parent theories can now also be referred to via
8111 relative and absolute paths.
8113 * Command 'find_theorems' searches for a list of criteria instead of a
8114 list of constants. Known criteria are: intro, elim, dest, name:string,
8115 simp:term, and any term. Criteria can be preceded by '-' to select
8116 theorems that do not match. Intro, elim, dest select theorems that
8117 match the current goal, name:s selects theorems whose fully qualified
8118 name contain s, and simp:term selects all simplification rules whose
8119 lhs match term. Any other term is interpreted as pattern and selects
8120 all theorems matching the pattern. Available in ProofGeneral under
8121 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8123 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8125 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8126 matching the current goal as introduction rule and not having "HOL."
8127 in their name (i.e. not being defined in theory HOL).
8129 * Command 'thms_containing' has been discontinued in favour of
8130 'find_theorems'; INCOMPATIBILITY.
8132 * Communication with Proof General is now 8bit clean, which means that
8133 Unicode text in UTF-8 encoding may be used within theory texts (both
8134 formal and informal parts). Cf. option -U of the Isabelle Proof
8135 General interface. Here are some simple examples (cf. src/HOL/ex):
8137 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8138 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8140 * Improved efficiency of the Simplifier and, to a lesser degree, the
8141 Classical Reasoner. Typical big applications run around 2 times
8145 *** Document preparation ***
8147 * Commands 'display_drafts' and 'print_drafts' perform simple output
8148 of raw sources. Only those symbols that do not require additional
8149 LaTeX packages (depending on comments in isabellesym.sty) are
8150 displayed properly, everything else is left verbatim. isatool display
8151 and isatool print are used as front ends (these are subject to the
8152 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8154 * Command tags control specific markup of certain regions of text,
8155 notably folding and hiding. Predefined tags include "theory" (for
8156 theory begin and end), "proof" for proof commands, and "ML" for
8157 commands involving ML code; the additional tags "visible" and
8158 "invisible" are unused by default. Users may give explicit tag
8159 specifications in the text, e.g. ''by %invisible (auto)''. The
8160 interpretation of tags is determined by the LaTeX job during document
8161 preparation: see option -V of isatool usedir, or options -n and -t of
8162 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8165 Several document versions may be produced at the same time via isatool
8166 usedir (the generated index.html will link all of them). Typical
8167 specifications include ''-V document=theory,proof,ML'' to present
8168 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8169 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8170 these parts without any formal replacement text. The Isabelle site
8171 default settings produce ''document'' and ''outline'' versions as
8174 * Several new antiquotations:
8176 @{term_type term} prints a term with its type annotated;
8178 @{typeof term} prints the type of a term;
8180 @{const const} is the same as @{term const}, but checks that the
8181 argument is a known logical constant;
8183 @{term_style style term} and @{thm_style style thm} print a term or
8184 theorem applying a "style" to it
8188 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8189 definitions, equations, inequations etc., 'concl' printing only the
8190 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8191 to print the specified premise. TermStyle.add_style provides an ML
8192 interface for introducing further styles. See also the "LaTeX Sugar"
8193 document practical applications. The ML antiquotation prints
8194 type-checked ML expressions verbatim.
8196 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8197 and 'text' support optional locale specification '(in loc)', which
8198 specifies the default context for interpreting antiquotations. For
8199 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8201 * Option 'locale=NAME' of antiquotations specifies an alternative
8202 context interpreting the subsequent argument. For example: @{thm
8203 [locale=lattice] inf_assoc}.
8205 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8208 * Proper output of antiquotations for theory commands involving a
8209 proof context (such as 'locale' or 'theorem (in loc) ...').
8211 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8212 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8214 * isatool usedir: new option -C (default true) controls whether option
8215 -D should include a copy of the original document directory; -C false
8216 prevents unwanted effects such as copying of administrative CVS data.
8221 * Considerably improved version of 'constdefs' command. Now performs
8222 automatic type-inference of declared constants; additional support for
8223 local structure declarations (cf. locales and HOL records), see also
8224 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8225 sequential dependencies of definitions within a single 'constdefs'
8226 section; moreover, the declared name needs to be an identifier. If
8227 all fails, consider to fall back on 'consts' and 'defs' separately.
8229 * Improved indexed syntax and implicit structures. First of all,
8230 indexed syntax provides a notational device for subscripted
8231 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8232 expressions. Secondly, in a local context with structure
8233 declarations, number indexes \<^sub>n or the empty index (default
8234 number 1) refer to a certain fixed variable implicitly; option
8235 show_structs controls printing of implicit structures. Typical
8236 applications of these concepts involve record types and locales.
8238 * New command 'no_syntax' removes grammar declarations (and
8239 translations) resulting from the given syntax specification, which is
8240 interpreted in the same manner as for the 'syntax' command.
8242 * 'Advanced' translation functions (parse_translation etc.) may depend
8243 on the signature of the theory context being presently used for
8244 parsing/printing, see also isar-ref manual.
8246 * Improved 'oracle' command provides a type-safe interface to turn an
8247 ML expression of type theory -> T -> term into a primitive rule of
8248 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8249 is already included here); see also FOL/ex/IffExample.thy;
8252 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8253 before); "cI" is no longer bound, use "c.intro" instead.
8254 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8255 axclasses vs. locales.
8257 * Improved internal renaming of symbolic identifiers -- attach primes
8258 instead of base 26 numbers.
8260 * New flag show_question_marks controls printing of leading question
8261 marks in schematic variable names.
8263 * In schematic variable names, *any* symbol following \<^isub> or
8264 \<^isup> is now treated as part of the base name. For example, the
8265 following works without printing of awkward ".0" indexes:
8267 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8270 * Inner syntax includes (*(*nested*) comments*).
8272 * Pretty printer now supports unbreakable blocks, specified in mixfix
8273 annotations as "(00...)".
8275 * Clear separation of logical types and nonterminals, where the latter
8276 may only occur in 'syntax' specifications or type abbreviations.
8277 Before that distinction was only partially implemented via type class
8278 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8279 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8280 exotic syntax specifications may require further adaption
8281 (e.g. Cube/Cube.thy).
8283 * Removed obsolete type class "logic", use the top sort {} instead.
8284 Note that non-logical types should be declared as 'nonterminals'
8285 rather than 'types'. INCOMPATIBILITY for new object-logic
8288 * Attributes 'induct' and 'cases': type or set names may now be
8289 locally fixed variables as well.
8291 * Simplifier: can now control the depth to which conditional rewriting
8292 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8295 * Simplifier: simplification procedures may now take the current
8296 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8297 interface), which is very useful for calling the Simplifier
8298 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8299 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8300 low-level mk_simproc no longer applies Logic.varify internally, to
8301 allow for use in a context of fixed variables.
8303 * thin_tac now works even if the assumption being deleted contains !!
8304 or ==>. More generally, erule now works even if the major premise of
8305 the elimination rule contains !! or ==>.
8307 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8309 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8310 from Pure, which contains all common declarations already. Both
8311 theories are defined via plain Isabelle/Isar .thy files.
8312 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8313 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8314 use isatool fixcpure to adapt your theory and ML sources.
8316 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8317 selections of theorems in named facts via index ranges.
8319 * 'print_theorems': in theory mode, really print the difference
8320 wrt. the last state (works for interactive theory development only),
8321 in proof mode print all local facts (cf. 'print_facts');
8323 * 'hide': option '(open)' hides only base names.
8325 * More efficient treatment of intermediate checkpoints in interactive
8328 * Code generator is now invoked via code_module (incremental code
8329 generation) and code_library (modular code generation, ML structures
8330 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8331 must be quoted when used as identifiers.
8333 * New 'value' command for reading, evaluating and printing terms using
8334 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8335 quoted when used as identifier.
8340 * New commands for the interpretation of locale expressions in
8341 theories (1), locales (2) and proof contexts (3). These generate
8342 proof obligations from the expression specification. After the
8343 obligations have been discharged, theorems of the expression are added
8344 to the theory, target locale or proof context. The synopsis of the
8345 commands is a follows:
8347 (1) interpretation expr inst
8348 (2) interpretation target < expr
8349 (3) interpret expr inst
8351 Interpretation in theories and proof contexts require a parameter
8352 instantiation of terms from the current context. This is applied to
8353 specifications and theorems of the interpreted expression.
8354 Interpretation in locales only permits parameter renaming through the
8355 locale expression. Interpretation is smart in that interpretations
8356 that are active already do not occur in proof obligations, neither are
8357 instantiated theorems stored in duplicate. Use 'print_interps' to
8358 inspect active interpretations of a particular locale. For details,
8359 see the Isar Reference manual. Examples can be found in
8360 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8362 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8363 'interpret' instead.
8365 * New context element 'constrains' for adding type constraints to
8368 * Context expressions: renaming of parameters with syntax
8371 * Locale declaration: 'includes' disallowed.
8373 * Proper static binding of attribute syntax -- i.e. types / terms /
8374 facts mentioned as arguments are always those of the locale definition
8375 context, independently of the context of later invocations. Moreover,
8376 locale operations (renaming and type / term instantiation) are applied
8377 to attribute arguments as expected.
8379 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8380 actual attributes; rare situations may require Attrib.attribute to
8381 embed those attributes into Attrib.src that lack concrete syntax.
8382 Attribute implementations need to cooperate properly with the static
8383 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8384 Attrib.XXX_thm etc. already do the right thing without further
8385 intervention. Only unusual applications -- such as "where" or "of"
8386 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8387 on the context and the facts involved -- may have to assign parsed
8388 values to argument tokens explicitly.
8390 * Changed parameter management in theorem generation for long goal
8391 statements with 'includes'. INCOMPATIBILITY: produces a different
8392 theorem statement in rare situations.
8394 * Locale inspection command 'print_locale' omits notes elements. Use
8395 'print_locale!' to have them included in the output.
8400 * Provers/hypsubst.ML: improved version of the subst method, for
8401 single-step rewriting: it now works in bound variable contexts. New is
8402 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8403 rewrite a different subterm than the original subst method, which is
8404 still available as 'simplesubst'.
8406 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8409 * Provers/trancl.ML: new transitivity reasoner for transitive and
8410 reflexive-transitive closure of relations.
8412 * Provers/blast.ML: new reference depth_limit to make blast's depth
8413 limit (previously hard-coded with a value of 20) user-definable.
8415 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8416 is peformed already. Object-logics merely need to finish their
8417 initial simpset configuration as before. INCOMPATIBILITY.
8422 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8425 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8427 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8428 and x-symbol; use option '-m epsilon' to get it actually printed.
8429 Moreover, the mathematically important symbolic identifier \<epsilon>
8430 becomes available as variable, constant etc. INCOMPATIBILITY,
8432 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8433 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8434 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8435 support corresponding Isar calculations.
8437 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8440 * theory SetInterval: changed the syntax for open intervals:
8449 The old syntax is still supported but will disappear in the next
8450 release. For conversion use the following Emacs search and replace
8451 patterns (these are not perfect but work quite well):
8453 {)\([^\.]*\)\.\. -> {\1<\.\.}
8454 \.\.\([^(}]*\)(} -> \.\.<\1}
8456 * Theory Commutative_Ring (in Library): method comm_ring for proving
8457 equalities in commutative rings; method 'algebra' provides a generic
8460 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8461 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8462 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8465 Some new syntax forms are available:
8467 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8468 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8469 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8470 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8472 The latter form "\<Sum>x < k. e" used to be based on a separate
8473 function "Summation", which has been discontinued.
8475 * theory Finite_Set: in structured induction proofs, the insert case
8476 is now 'case (insert x F)' instead of the old counterintuitive 'case
8479 * The 'refute' command has been extended to support a much larger
8480 fragment of HOL, including axiomatic type classes, constdefs and
8481 typedefs, inductive datatypes and recursion.
8483 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8484 Requires zChaff with proof generation to be installed. See
8485 HOL/ex/SAT_Examples.thy for examples.
8487 * Datatype induction via method 'induct' now preserves the name of the
8488 induction variable. For example, when proving P(xs::'a list) by
8489 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8490 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8491 in unstructured proof scripts.
8493 * Reworked implementation of records. Improved scalability for
8494 records with many fields, avoiding performance problems for type
8495 inference. Records are no longer composed of nested field types, but
8496 of nested extension types. Therefore the record type only grows linear
8497 in the number of extensions and not in the number of fields. The
8498 top-level (users) view on records is preserved. Potential
8499 INCOMPATIBILITY only in strange cases, where the theory depends on the
8500 old record representation. The type generated for a record is called
8501 <record_name>_ext_type.
8503 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8504 proofs triggered by a record definition or a simproc (if
8505 quick_and_dirty is enabled). Definitions of large records can take
8508 New simproc record_upd_simproc for simplification of multiple record
8509 updates enabled by default. Moreover, trivial updates are also
8510 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8511 occasionally, since simplification is more powerful by default.
8513 * typedef: proper support for polymorphic sets, which contain extra
8514 type-variables in the term.
8516 * Simplifier: automatically reasons about transitivity chains
8517 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8518 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8519 old proofs break occasionally as simplification may now solve more
8520 goals than previously.
8522 * Simplifier: converts x <= y into x = y if assumption y <= x is
8523 present. Works for all partial orders (class "order"), in particular
8524 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8527 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8528 bound variable or a constant then the let is unfolded. Otherwise
8529 first a is simplified to b, and then f b is simplified to g. If
8530 possible we abstract b from g arriving at "let x = b in h x",
8531 otherwise we unfold the let and arrive at g. The simproc can be
8532 enabled/disabled by the reference use_let_simproc. Potential
8533 INCOMPATIBILITY since simplification is more powerful by default.
8535 * Classical reasoning: the meson method now accepts theorems as arguments.
8537 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8538 jobs to provide advice on the provability of subgoals.
8540 * Theory OrderedGroup and Ring_and_Field: various additions and
8541 improvements to faciliate calculations involving equalities and
8544 The following theorems have been eliminated or modified
8547 abs_eq now named abs_of_nonneg
8548 abs_of_ge_0 now named abs_of_nonneg
8549 abs_minus_eq now named abs_of_nonpos
8550 imp_abs_id now named abs_of_nonneg
8551 imp_abs_neg_id now named abs_of_nonpos
8552 mult_pos now named mult_pos_pos
8553 mult_pos_le now named mult_nonneg_nonneg
8554 mult_pos_neg_le now named mult_nonneg_nonpos
8555 mult_pos_neg2_le now named mult_nonneg_nonpos2
8556 mult_neg now named mult_neg_neg
8557 mult_neg_le now named mult_nonpos_nonpos
8559 * The following lemmas in Ring_and_Field have been added to the simplifier:
8562 not_square_less_zero
8564 The following lemmas have been deleted from Real/RealPow:
8574 * Theory Parity: added rules for simplifying exponents.
8578 The following theorems have been eliminated or modified
8581 list_all_Nil now named list_all.simps(1)
8582 list_all_Cons now named list_all.simps(2)
8583 list_all_conv now named list_all_iff
8584 set_mem_eq now named mem_iff
8586 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8587 asymptotic "big O" calculations. See the notes in BigO.thy.
8592 * Theory RealDef: better support for embedding natural numbers and
8593 integers in the reals.
8595 The following theorems have been eliminated or modified
8598 exp_ge_add_one_self now requires no hypotheses
8599 real_of_int_add reversed direction of equality (use [symmetric])
8600 real_of_int_minus reversed direction of equality (use [symmetric])
8601 real_of_int_diff reversed direction of equality (use [symmetric])
8602 real_of_int_mult reversed direction of equality (use [symmetric])
8604 * Theory RComplete: expanded support for floor and ceiling functions.
8606 * Theory Ln is new, with properties of the natural logarithm
8608 * Hyperreal: There is a new type constructor "star" for making
8609 nonstandard types. The old type names are now type synonyms:
8613 hcomplex = complex star
8615 * Hyperreal: Many groups of similarly-defined constants have been
8616 replaced by polymorphic versions (INCOMPATIBILITY):
8618 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8620 starset <-- starsetNat, starsetC
8621 *s* <-- *sNat*, *sc*
8622 starset_n <-- starsetNat_n, starsetC_n
8623 *sn* <-- *sNatn*, *scn*
8624 InternalSets <-- InternalNatSets, InternalCSets
8626 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8627 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8628 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8629 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8630 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8632 * Hyperreal: Many type-specific theorems have been removed in favor of
8633 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8635 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8636 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8637 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8638 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8639 right_minus <-- hypreal_add_minus
8640 left_minus <-- {hypreal,hcomplex}_add_minus_left
8641 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8642 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8643 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8644 mult_1_right <-- hcomplex_mult_one_right
8645 mult_zero_left <-- hcomplex_mult_zero_left
8646 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8647 right_distrib <-- hypnat_add_mult_distrib2
8648 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8649 right_inverse <-- hypreal_mult_inverse
8650 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8651 order_refl <-- {hypreal,hypnat}_le_refl
8652 order_trans <-- {hypreal,hypnat}_le_trans
8653 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8654 order_less_le <-- {hypreal,hypnat}_less_le
8655 linorder_linear <-- {hypreal,hypnat}_le_linear
8656 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8657 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8658 add_nonneg_nonneg <-- hypreal_le_add_order
8660 * Hyperreal: Separate theorems having to do with type-specific
8661 versions of constants have been merged into theorems that apply to the
8662 new polymorphic constants (INCOMPATIBILITY):
8664 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8665 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8666 STAR_Un <-- {STAR,NatStar,STARC}_Un
8667 STAR_Int <-- {STAR,NatStar,STARC}_Int
8668 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8669 STAR_subset <-- {STAR,NatStar,STARC}_subset
8670 STAR_mem <-- {STAR,NatStar,STARC}_mem
8671 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8672 STAR_diff <-- {STAR,STARC}_diff
8673 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8674 STARC_hcomplex_of_complex}_image_subset
8675 starset_n_Un <-- starset{Nat,C}_n_Un
8676 starset_n_Int <-- starset{Nat,C}_n_Int
8677 starset_n_Compl <-- starset{Nat,C}_n_Compl
8678 starset_n_diff <-- starset{Nat,C}_n_diff
8679 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8680 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8681 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8682 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8683 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8684 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8685 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8686 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8687 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8688 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8689 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8690 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8691 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8692 starfun_diff <-- starfun{C,RC,CR}_diff
8693 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8694 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8695 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8696 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8697 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8698 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8699 starfun_Id <-- starfunC_Id
8700 starfun_approx <-- starfun{Nat,CR}_approx
8701 starfun_capprox <-- starfun{C,RC}_capprox
8702 starfun_abs <-- starfunNat_rabs
8703 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8704 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8705 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8706 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8707 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8708 starfun_add_approx <-- starfunCR_add_approx
8709 starfun_inverse_inverse <-- starfunC_inverse_inverse
8710 starfun_divide <-- starfun{C,CR,RC}_divide
8711 starfun_n <-- starfun{Nat,C}_n
8712 starfun_n_mult <-- starfun{Nat,C}_n_mult
8713 starfun_n_add <-- starfun{Nat,C}_n_add
8714 starfun_n_add_minus <-- starfunNat_n_add_minus
8715 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8716 starfun_n_minus <-- starfun{Nat,C}_n_minus
8717 starfun_n_eq <-- starfun{Nat,C}_n_eq
8719 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8720 star_n_minus <-- {hypreal,hcomplex}_minus
8721 star_n_diff <-- {hypreal,hcomplex}_diff
8722 star_n_mult <-- {hypreal,hcomplex}_mult
8723 star_n_inverse <-- {hypreal,hcomplex}_inverse
8724 star_n_le <-- {hypreal,hypnat}_le
8725 star_n_less <-- {hypreal,hypnat}_less
8726 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8727 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8728 star_n_abs <-- hypreal_hrabs
8729 star_n_divide <-- hcomplex_divide
8731 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8732 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8733 star_of_diff <-- hypreal_of_real_diff
8734 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8735 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8736 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8737 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8738 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8739 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8740 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8741 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8742 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8743 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8744 star_of_number_of <-- {hypreal,hcomplex}_number_of
8745 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8746 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8747 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8748 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8749 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8750 star_of_power <-- hypreal_of_real_power
8751 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8753 * Hyperreal: new method "transfer" that implements the transfer
8754 principle of nonstandard analysis. With a subgoal that mentions
8755 nonstandard types like "'a star", the command "apply transfer"
8756 replaces it with an equivalent one that mentions only standard types.
8757 To be successful, all free variables must have standard types; non-
8758 standard variables must have explicit universal quantifiers.
8760 * Hyperreal: A theory of Taylor series.
8765 * Discontinued special version of 'constdefs' (which used to support
8766 continuous functions) in favor of the general Pure one with full
8769 * New simplification procedure for solving continuity conditions; it
8770 is much faster on terms with many nested lambda abstractions (cubic
8771 instead of exponential time).
8773 * New syntax for domain package: selector names are now optional.
8774 Parentheses should be omitted unless argument is lazy, for example:
8776 domain 'a stream = cons "'a" (lazy "'a stream")
8778 * New command 'fixrec' for defining recursive functions with pattern
8779 matching; defining multiple functions with mutual recursion is also
8780 supported. Patterns may include the constants cpair, spair, up, sinl,
8781 sinr, or any data constructor defined by the domain package. The given
8782 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8783 syntax and examples.
8785 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8786 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8787 but the proof obligation additionally includes an admissibility
8788 requirement. The packages generate instances of class cpo or pcpo,
8789 with continuity and strictness theorems for Rep and Abs.
8791 * HOLCF: Many theorems have been renamed according to a more standard naming
8792 scheme (INCOMPATIBILITY):
8794 foo_inject: "foo$x = foo$y ==> x = y"
8795 foo_eq: "(foo$x = foo$y) = (x = y)"
8796 foo_less: "(foo$x << foo$y) = (x << y)"
8797 foo_strict: "foo$UU = UU"
8798 foo_defined: "... ==> foo$x ~= UU"
8799 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8804 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8805 including the First Isomorphism Theorem (on quotienting by the kernel
8808 * ZF/Simplifier: install second copy of type solver that actually
8809 makes use of TC rules declared to Isar proof contexts (or locales);
8810 the old version is still required for ML proof scripts.
8815 * Converted to Isar theory format; use locales instead of axiomatic
8821 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8824 * Pure/library.ML no longer defines its own option datatype, but uses
8825 that of the SML basis, which has constructors NONE and SOME instead of
8826 None and Some, as well as exception Option.Option instead of OPTION.
8827 The functions the, if_none, is_some, is_none have been adapted
8828 accordingly, while Option.map replaces apsome.
8830 * Pure/library.ML: the exception LIST has been given up in favour of
8831 the standard exceptions Empty and Subscript, as well as
8832 Library.UnequalLengths. Function like Library.hd and Library.tl are
8833 superceded by the standard hd and tl functions etc.
8835 A number of basic list functions are no longer exported to the ML
8836 toplevel, as they are variants of predefined functions. The following
8837 suggests how one can translate existing code:
8839 rev_append xs ys = List.revAppend (xs, ys)
8840 nth_elem (i, xs) = List.nth (xs, i)
8841 last_elem xs = List.last xs
8842 flat xss = List.concat xss
8843 seq fs = List.app fs
8844 partition P xs = List.partition P xs
8845 mapfilter f xs = List.mapPartial f xs
8847 * Pure/library.ML: several combinators for linear functional
8848 transformations, notably reverse application and composition:
8851 (x, y) |-> f f #-> g
8853 * Pure/library.ML: introduced/changed precedence of infix operators:
8855 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8857 infix 3 o oo ooo oooo;
8858 infix 4 ~~ upto downto;
8860 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8863 * Pure/library.ML: natural list combinators fold, fold_rev, and
8864 fold_map support linear functional transformations and nesting. For
8867 fold f [x1, ..., xN] y =
8868 y |> f x1 |> ... |> f xN
8870 (fold o fold) f [xs1, ..., xsN] y =
8871 y |> fold f xs1 |> ... |> fold f xsN
8873 fold f [x1, ..., xN] =
8876 (fold o fold) f [xs1, ..., xsN] =
8877 fold f xs1 #> ... #> fold f xsN
8879 * Pure/library.ML: the following selectors on type 'a option are
8882 the: 'a option -> 'a (*partial*)
8883 these: 'a option -> 'a where 'a = 'b list
8884 the_default: 'a -> 'a option -> 'a
8885 the_list: 'a option -> 'a list
8887 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8888 basic operations for association lists, following natural argument
8889 order; moreover the explicit equality predicate passed here avoids
8890 potentially expensive polymorphic runtime equality checks.
8891 The old functions may be expressed as follows:
8893 assoc = uncurry (AList.lookup (op =))
8894 assocs = these oo AList.lookup (op =)
8895 overwrite = uncurry (AList.update (op =)) o swap
8897 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8899 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8900 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8902 replacing make_keylist and keyfilter (occassionally used)
8905 make_keylist = AList.make
8906 keyfilter = AList.find (op =)
8908 * eq_fst and eq_snd now take explicit equality parameter, thus
8909 avoiding eqtypes. Naive rewrites:
8911 eq_fst = eq_fst (op =)
8912 eq_snd = eq_snd (op =)
8914 * Removed deprecated apl and apr (rarely used).
8917 apl (n, op) =>>= curry op n
8918 apr (op, m) =>>= fn n => op (n, m)
8920 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8921 provides a reasonably efficient light-weight implementation of sets as
8924 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8925 few new operations; existing lookup and update are now curried to
8926 follow natural argument order (for use with fold etc.);
8927 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8929 * Pure/General: output via the Isabelle channels of
8930 writeln/warning/error etc. is now passed through Output.output, with a
8931 hook for arbitrary transformations depending on the print_mode
8932 (cf. Output.add_mode -- the first active mode that provides a output
8933 function wins). Already formatted output may be embedded into further
8934 text via Output.raw; the result of Pretty.string_of/str_of and derived
8935 functions (string_of_term/cterm/thm etc.) is already marked raw to
8936 accommodate easy composition of diagnostic messages etc. Programmers
8937 rarely need to care about Output.output or Output.raw at all, with
8938 some notable exceptions: Output.output is required when bypassing the
8939 standard channels (writeln etc.), or in token translations to produce
8940 properly formatted results; Output.raw is required when capturing
8941 already output material that will eventually be presented to the user
8942 a second time. For the default print mode, both Output.output and
8943 Output.raw have no effect.
8945 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8946 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8947 cumulative results are displayed at the end of a batch session.
8949 * Pure/General: File.sysify_path and File.quote_sysify path have been
8950 replaced by File.platform_path and File.shell_path (with appropriate
8951 hooks). This provides a clean interface for unusual systems where the
8952 internal and external process view of file names are different.
8954 * Pure: more efficient orders for basic syntactic entities: added
8955 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8956 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8957 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8958 orders now -- potential INCOMPATIBILITY for code that depends on a
8959 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8960 Library.sort_strings on result).
8962 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8963 fold_types traverse types/terms from left to right, observing natural
8964 argument order. Supercedes previous foldl_XXX versions, add_frees,
8965 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8967 * Pure: name spaces have been refined, with significant changes of the
8968 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8969 to extern(_table). The plain name entry path is superceded by a
8970 general 'naming' context, which also includes the 'policy' to produce
8971 a fully qualified name and external accesses of a fully qualified
8972 name; NameSpace.extend is superceded by context dependent
8973 Sign.declare_name. Several theory and proof context operations modify
8974 the naming context. Especially note Theory.restore_naming and
8975 ProofContext.restore_naming to get back to a sane state; note that
8976 Theory.add_path is no longer sufficient to recover from
8977 Theory.absolute_path in particular.
8979 * Pure: new flags short_names (default false) and unique_names
8980 (default true) for controlling output of qualified names. If
8981 short_names is set, names are printed unqualified. If unique_names is
8982 reset, the name prefix is reduced to the minimum required to achieve
8983 the original result when interning again, even if there is an overlap
8984 with earlier declarations.
8986 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8987 now 'extend', and 'merge' gets an additional Pretty.pp argument
8988 (useful for printing error messages). INCOMPATIBILITY.
8990 * Pure: major reorganization of the theory context. Type Sign.sg and
8991 Theory.theory are now identified, referring to the universal
8992 Context.theory (see Pure/context.ML). Actual signature and theory
8993 content is managed as theory data. The old code and interfaces were
8994 spread over many files and structures; the new arrangement introduces
8995 considerable INCOMPATIBILITY to gain more clarity:
8997 Context -- theory management operations (name, identity, inclusion,
8998 parents, ancestors, merge, etc.), plus generic theory data;
9000 Sign -- logical signature and syntax operations (declaring consts,
9001 types, etc.), plus certify/read for common entities;
9003 Theory -- logical theory operations (stating axioms, definitions,
9004 oracles), plus a copy of logical signature operations (consts,
9005 types, etc.); also a few basic management operations (Theory.copy,
9008 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9009 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9010 for convenience -- they merely return the theory.
9012 * Pure: type Type.tsig is superceded by theory in most interfaces.
9014 * Pure: the Isar proof context type is already defined early in Pure
9015 as Context.proof (note that ProofContext.context and Proof.context are
9016 aliases, where the latter is the preferred name). This enables other
9017 Isabelle components to refer to that type even before Isar is present.
9019 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9020 typeK, constK, axiomK, oracleK), but provide explicit operations for
9021 any of these kinds. For example, Sign.intern typeK is now
9022 Sign.intern_type, Theory.hide_space Sign.typeK is now
9023 Theory.hide_types. Also note that former
9024 Theory.hide_classes/types/consts are now
9025 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9026 internalize their arguments! INCOMPATIBILITY.
9028 * Pure: get_thm interface (of PureThy and ProofContext) expects
9029 datatype thmref (with constructors Name and NameSelection) instead of
9030 plain string -- INCOMPATIBILITY;
9032 * Pure: cases produced by proof methods specify options, where NONE
9033 means to remove case bindings -- INCOMPATIBILITY in
9036 * Pure: the following operations retrieve axioms or theorems from a
9037 theory node or theory hierarchy, respectively:
9039 Theory.axioms_of: theory -> (string * term) list
9040 Theory.all_axioms_of: theory -> (string * term) list
9041 PureThy.thms_of: theory -> (string * thm) list
9042 PureThy.all_thms_of: theory -> (string * thm) list
9044 * Pure: print_tac now outputs the goal through the trace channel.
9046 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9047 Reference Toplevel.debug (default false) controls detailed printing
9048 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9049 controls execution profiling -- set to 1 for time and 2 for space
9050 (both increase the runtime).
9052 * Isar session: The initial use of ROOT.ML is now always timed,
9053 i.e. the log will show the actual process times, in contrast to the
9054 elapsed wall-clock time that the outer shell wrapper produces.
9056 * Simplifier: improved handling of bound variables (nameless
9057 representation, avoid allocating new strings). Simprocs that invoke
9058 the Simplifier recursively should use Simplifier.inherit_bounds to
9059 avoid local name clashes. Failure to do so produces warnings
9060 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9061 for further details.
9063 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9064 bindings for all theorems stored within a given theory; this may help
9065 in porting non-Isar theories to Isar ones, while keeping ML proof
9066 scripts for the time being.
9068 * ML operator HTML.with_charset specifies the charset begin used for
9069 generated HTML files. For example:
9071 HTML.with_charset "utf-8" use_thy "Hebrew";
9072 HTML.with_charset "utf-8" use_thy "Chinese";
9077 * Allow symlinks to all proper Isabelle executables (Isabelle,
9078 isabelle, isatool etc.).
9080 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9081 isatool doc, isatool mkdir, display_drafts etc.).
9083 * isatool usedir: option -f allows specification of the ML file to be
9084 used by Isabelle; default is ROOT.ML.
9086 * New isatool version outputs the version identifier of the Isabelle
9087 distribution being used.
9089 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9090 (containing Boolean satisfiability problems) into Isabelle/HOL
9095 New in Isabelle2004 (April 2004)
9096 --------------------------------
9100 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9101 Replaces linorder.ML.
9103 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9104 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9105 (\<a>...\<z>), are now considered normal letters, and can therefore
9106 be used anywhere where an ASCII letter (a...zA...Z) has until
9107 now. COMPATIBILITY: This obviously changes the parsing of some
9108 terms, especially where a symbol has been used as a binder, say
9109 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9110 as an identifier. Fix it by inserting a space around former
9111 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9112 existing theory and ML files.
9114 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9116 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9117 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9118 a normal (but invisible) letter. For multiple letter subscripts repeat
9119 \<^isub> like this: x\<^isub>1\<^isub>2.
9121 * Pure: There are now sub-/superscripts that can span more than one
9122 character. Text between \<^bsub> and \<^esub> is set in subscript in
9123 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9124 superscript. The new control characters are not identifier parts.
9126 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9127 content of "..." to the latex file instead of \isacntrl... . The "..."
9128 may consist of any printable characters excluding the end bracket >.
9130 * Pure: Using new Isar command "finalconsts" (or the ML functions
9131 Theory.add_finals or Theory.add_finals_i) it is now possible to
9132 declare constants "final", which prevents their being given a definition
9133 later. It is useful for constants whose behaviour is fixed axiomatically
9134 rather than definitionally, such as the meta-logic connectives.
9136 * Pure: 'instance' now handles general arities with general sorts
9137 (i.e. intersections of classes),
9139 * Presentation: generated HTML now uses a CSS style sheet to make layout
9140 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9141 It can be changed to alter the colors/layout of generated pages.
9146 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9147 cut_tac, subgoal_tac and thin_tac:
9148 - Now understand static (Isar) contexts. As a consequence, users of Isar
9149 locales are no longer forced to write Isar proof scripts.
9150 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9152 - INCOMPATIBILITY: names of variables to be instantiated may no
9153 longer be enclosed in quotes. Instead, precede variable name with `?'.
9154 This is consistent with the instantiation attribute "where".
9156 * Attributes "where" and "of":
9157 - Now take type variables of instantiated theorem into account when reading
9158 the instantiation string. This fixes a bug that caused instantiated
9159 theorems to have too special types in some circumstances.
9160 - "where" permits explicit instantiations of type variables.
9162 * Calculation commands "moreover" and "also" no longer interfere with
9163 current facts ("this"), admitting arbitrary combinations with "then"
9167 - Goal statements involving the context element "includes" no longer
9168 generate theorems with internal delta predicates (those ending on
9169 "_axioms") in the premise.
9170 Resolve particular premise with <locale>.intro to obtain old form.
9171 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9172 specification and "includes" elements in goal statement.
9173 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9174 [intro?] and [elim?] (respectively) by default.
9175 - Experimental command for instantiation of locales in proof contexts:
9176 instantiate <label>[<attrs>]: <loc>
9177 Instantiates locale <loc> and adds all its theorems to the current context
9178 taking into account their attributes. Label and attrs are optional
9179 modifiers, like in theorem declarations. If present, names of
9180 instantiated theorems are qualified with <label>, and the attributes
9181 <attrs> are applied after any attributes these theorems might have already.
9182 If the locale has assumptions, a chained fact of the form
9183 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9184 are derived. The command does not support old-style locales declared
9185 with "locale (open)".
9186 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9188 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9194 * Proof import: new image HOL4 contains the imported library from
9195 the HOL4 system with about 2500 theorems. It is imported by
9196 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9197 can be used like any other Isabelle image. See
9198 HOL/Import/HOL/README for more information.
9201 - Much improved handling of linear and partial orders.
9202 Reasoners for linear and partial orders are set up for type classes
9203 "linorder" and "order" respectively, and are added to the default simpset
9204 as solvers. This means that the simplifier can build transitivity chains
9205 to solve goals from the assumptions.
9206 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9207 of blast or auto after simplification become unnecessary because the goal
9208 is solved by simplification already.
9210 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9211 all proved in axiomatic type classes for semirings, rings and fields.
9214 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9215 now formalized using the Ring_and_Field theory mentioned above.
9216 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9217 than before, because now they are set up once in a generic manner.
9218 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9219 Look for the general versions in Ring_and_Field (and Power if they concern
9222 * Type "rat" of the rational numbers is now available in HOL-Complex.
9225 - Record types are now by default printed with their type abbreviation
9226 instead of the list of all field types. This can be configured via
9227 the reference "print_record_type_abbr".
9228 - Simproc "record_upd_simproc" for simplification of multiple updates added
9229 (not enabled by default).
9230 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9231 EX x. x = sel r to True (not enabled by default).
9232 - Tactic "record_split_simp_tac" to split and simplify records added.
9234 * 'specification' command added, allowing for definition by
9235 specification. There is also an 'ax_specification' command that
9236 introduces the new constants axiomatically.
9238 * arith(_tac) is now able to generate counterexamples for reals as well.
9240 * HOL-Algebra: new locale "ring" for non-commutative rings.
9242 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9243 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9245 * HOL-Matrix: a first theory for matrices in HOL with an application of
9246 matrix theory to linear programming.
9248 * Unions and Intersections:
9249 The latex output syntax of UN and INT has been changed
9250 from "\Union x \in A. B" to "\Union_{x \in A} B"
9251 i.e. the index formulae has become a subscript.
9252 Similarly for "\Union x. B", and for \Inter instead of \Union.
9254 * Unions and Intersections over Intervals:
9255 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9256 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9257 like in normal math, and corresponding versions for < and for intersection.
9259 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9260 lexicographic dictonary ordering has been added as "lexord".
9262 * ML: the legacy theory structures Int and List have been removed. They had
9263 conflicted with ML Basis Library structures having the same names.
9265 * 'refute' command added to search for (finite) countermodels. Only works
9266 for a fragment of HOL. The installation of an external SAT solver is
9267 highly recommended. See "HOL/Refute.thy" for details.
9269 * 'quickcheck' command: Allows to find counterexamples by evaluating
9270 formulae under an assignment of free variables to random values.
9271 In contrast to 'refute', it can deal with inductive datatypes,
9272 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9278 * Streams now come with concatenation and are part of the HOLCF image
9282 New in Isabelle2003 (May 2003)
9283 ------------------------------
9287 * Provers/simplifier:
9289 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9290 Assumptions are now subject to complete mutual simplification,
9291 not just from left to right. The simplifier now preserves
9292 the order of assumptions.
9294 Potential INCOMPATIBILITY:
9296 -- simp sometimes diverges where the old version did
9297 not, e.g. invoking simp on the goal
9299 [| P (f x); y = x; f x = f y |] ==> Q
9301 now gives rise to the infinite reduction sequence
9303 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9305 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9308 -- Tactics combining classical reasoner and simplification (such as auto)
9309 are also affected by this change, because many of them rely on
9310 simp. They may sometimes diverge as well or yield a different numbers
9311 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9312 in case of problems. Sometimes subsequent calls to the classical
9313 reasoner will fail because a preceeding call to the simplifier too
9314 eagerly simplified the goal, e.g. deleted redundant premises.
9316 - The simplifier trace now shows the names of the applied rewrite rules
9318 - You can limit the number of recursive invocations of the simplifier
9319 during conditional rewriting (where the simplifie tries to solve the
9320 conditions before applying the rewrite rule):
9321 ML "simp_depth_limit := n"
9322 where n is an integer. Thus you can force termination where previously
9323 the simplifier would diverge.
9325 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9327 - No longer aborts on failed congruence proof. Instead, the
9328 congruence is ignored.
9330 * Pure: New generic framework for extracting programs from constructive
9331 proofs. See HOL/Extraction.thy for an example instantiation, as well
9332 as HOL/Extraction for some case studies.
9334 * Pure: The main goal of the proof state is no longer shown by default, only
9335 the subgoals. This behaviour is controlled by a new flag.
9336 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9337 (ML: Proof.show_main_goal).
9339 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9340 rules whose conclusion matches subgoal 1:
9341 PG menu: Isabelle/Isar -> Show me -> matching rules
9342 The rules are ordered by how closely they match the subgoal.
9343 In particular, rules that solve a subgoal outright are displayed first
9344 (or rather last, the way they are printed).
9345 (ML: ProofGeneral.print_intros())
9347 * Pure: New flag trace_unify_fail causes unification to print
9348 diagnostic information (PG: in trace buffer) when it fails. This is
9349 useful for figuring out why single step proofs like rule, erule or
9352 * Pure: Locale specifications now produce predicate definitions
9353 according to the body of text (covering assumptions modulo local
9354 definitions); predicate "loc_axioms" covers newly introduced text,
9355 while "loc" is cumulative wrt. all included locale expressions; the
9356 latter view is presented only on export into the global theory
9357 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9358 on the old view without predicates;
9360 * Pure: predefined locales "var" and "struct" are useful for sharing
9361 parameters (as in CASL, for example); just specify something like
9362 ``var x + var y + struct M'' as import;
9364 * Pure: improved thms_containing: proper indexing of facts instead of
9365 raw theorems; check validity of results wrt. current name space;
9366 include local facts of proof configuration (also covers active
9367 locales), cover fixed variables in index; may use "_" in term
9368 specification; an optional limit for the number of printed facts may
9369 be given (the default is 40);
9371 * Pure: disallow duplicate fact bindings within new-style theory files
9374 * Provers: improved induct method: assumptions introduced by case
9375 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9376 the goal statement); "foo" still refers to all facts collectively;
9378 * Provers: the function blast.overloaded has been removed: all constants
9379 are regarded as potentially overloaded, which improves robustness in exchange
9380 for slight decrease in efficiency;
9382 * Provers/linorder: New generic prover for transitivity reasoning over
9383 linear orders. Note: this prover is not efficient!
9385 * Isar: preview of problems to finish 'show' now produce an error
9386 rather than just a warning (in interactive mode);
9393 - Produces a counter example if it cannot prove a goal.
9394 Note that the counter example may be spurious if the goal is not a formula
9395 of quantifier-free linear arithmetic.
9396 In ProofGeneral the counter example appears in the trace buffer.
9398 - Knows about div k and mod k where k is a numeral of type nat or int.
9400 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9401 linear arithmetic fails. This takes account of quantifiers and divisibility.
9402 Presburger arithmetic can also be called explicitly via presburger(_tac).
9404 * simp's arithmetic capabilities have been enhanced a bit: it now
9405 takes ~= in premises into account (by performing a case split);
9407 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9408 are distributed over a sum of terms;
9410 * New tactic "trans_tac" and method "trans" instantiate
9411 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9414 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9415 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9417 * 'typedef' command has new option "open" to suppress the set
9420 * functions Min and Max on finite sets have been introduced (theory
9423 * attribute [symmetric] now works for relations as well; it turns
9424 (x,y) : R^-1 into (y,x) : R, and vice versa;
9426 * induct over a !!-quantified statement (say !!x1..xn):
9427 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9429 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9430 %x. None. Warning: empty_def now refers to the previously hidden definition
9433 * Algebra: formalization of classical algebra. Intended as base for
9434 any algebraic development in Isabelle. Currently covers group theory
9435 (up to Sylow's theorem) and ring theory (Universal Property of
9436 Univariate Polynomials). Contributions welcome;
9438 * GroupTheory: deleted, since its material has been moved to Algebra;
9440 * Complex: new directory of the complex numbers with numeric constants,
9441 nonstandard complex numbers, and some complex analysis, standard and
9442 nonstandard (Jacques Fleuriot);
9444 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9446 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9449 * Real/HahnBanach: updated and adapted to locales;
9451 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9454 * UNITY: added the Meier-Sanders theory of progress sets;
9456 * MicroJava: bytecode verifier and lightweight bytecode verifier
9457 as abstract algorithms, instantiated to the JVM;
9459 * Bali: Java source language formalization. Type system, operational
9460 semantics, axiomatic semantics. Supported language features:
9461 classes, interfaces, objects,virtual methods, static methods,
9462 static/instance fields, arrays, access modifiers, definite
9463 assignment, exceptions.
9468 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9471 * Main ZF: virtually all theories converted to new-style format;
9476 * Pure: Tactic.prove provides sane interface for internal proofs;
9477 omits the infamous "standard" operation, so this is more appropriate
9478 than prove_goalw_cterm in many situations (e.g. in simprocs);
9480 * Pure: improved error reporting of simprocs;
9482 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9486 *** Document preparation ***
9488 * uses \par instead of \\ for line breaks in theory text. This may
9489 shift some page breaks in large documents. To get the old behaviour
9490 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9492 * minimized dependencies of isabelle.sty and isabellesym.sty on
9495 * \<euro> now needs package babel/greek instead of marvosym (which
9498 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9503 New in Isabelle2002 (March 2002)
9504 --------------------------------
9506 *** Document preparation ***
9508 * greatly simplified document preparation setup, including more
9509 graceful interpretation of isatool usedir -i/-d/-D options, and more
9510 instructive isatool mkdir; users should basically be able to get
9511 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9512 users may run a separate document processing stage manually like this:
9513 "isatool usedir -D output HOL Test && isatool document Test/output";
9515 * theory dependency graph may now be incorporated into documents;
9516 isatool usedir -g true will produce session_graph.eps/.pdf for use
9517 with \includegraphics of LaTeX;
9519 * proper spacing of consecutive markup elements, especially text
9520 blocks after section headings;
9522 * support bold style (for single symbols only), input syntax is like
9523 this: "\<^bold>\<alpha>" or "\<^bold>A";
9525 * \<bullet> is now output as bold \cdot by default, which looks much
9526 better in printed text;
9528 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9529 note that these symbols are currently unavailable in Proof General /
9530 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9532 * isatool latex no longer depends on changed TEXINPUTS, instead
9533 isatool document copies the Isabelle style files to the target
9539 * Pure/Provers: improved proof by cases and induction;
9540 - 'case' command admits impromptu naming of parameters (such as
9542 - 'induct' method divinates rule instantiation from the inductive
9543 claim; no longer requires excessive ?P bindings for proper
9544 instantiation of cases;
9545 - 'induct' method properly enumerates all possibilities of set/type
9546 rules; as a consequence facts may be also passed through *type*
9547 rules without further ado;
9548 - 'induct' method now derives symbolic cases from the *rulified*
9549 rule (before it used to rulify cases stemming from the internal
9550 atomized version); this means that the context of a non-atomic
9551 statement becomes is included in the hypothesis, avoiding the
9552 slightly cumbersome show "PROP ?case" form;
9553 - 'induct' may now use elim-style induction rules without chaining
9554 facts, using ``missing'' premises from the goal state; this allows
9555 rules stemming from inductive sets to be applied in unstructured
9556 scripts, while still benefitting from proper handling of non-atomic
9557 statements; NB: major inductive premises need to be put first, all
9558 the rest of the goal is passed through the induction;
9559 - 'induct' proper support for mutual induction involving non-atomic
9560 rule statements (uses the new concept of simultaneous goals, see
9562 - append all possible rule selections, but only use the first
9563 success (no backtracking);
9564 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9565 - undeclared rule case names default to numbers 1, 2, 3, ...;
9566 - added 'print_induct_rules' (covered by help item in recent Proof
9568 - moved induct/cases attributes to Pure, methods to Provers;
9569 - generic method setup instantiated for FOL and HOL;
9571 * Pure: support multiple simultaneous goal statements, for example
9572 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9573 meta-level mechanism, this acts as if several individual goals had
9574 been stated separately; in particular common proof methods need to be
9575 repeated in order to cover all claims; note that a single elimination
9576 step is *not* sufficient to establish the two conjunctions, so this
9579 assume "A & B" then have A and B .. (*".." fails*)
9581 better use "obtain" in situations as above; alternative refer to
9582 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9584 * Pure: proper integration with ``locales''; unlike the original
9585 version by Florian Kammller, Isar locales package high-level proof
9586 contexts rather than raw logical ones (e.g. we admit to include
9587 attributes everywhere); operations on locales include merge and
9588 rename; support for implicit arguments (``structures''); simultaneous
9589 type-inference over imports and text; see also HOL/ex/Locales.thy for
9592 * Pure: the following commands have been ``localized'', supporting a
9593 target locale specification "(in name)": 'lemma', 'theorem',
9594 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9595 stored both within the locale and at the theory level (exported and
9596 qualified by the locale name);
9598 * Pure: theory goals may now be specified in ``long'' form, with
9599 ad-hoc contexts consisting of arbitrary locale elements. for example
9600 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9601 definitions may be given, too); the result is a meta-level rule with
9602 the context elements being discharged in the obvious way;
9604 * Pure: new proof command 'using' allows to augment currently used
9605 facts after a goal statement ('using' is syntactically analogous to
9606 'apply', but acts on the goal's facts only); this allows chained facts
9607 to be separated into parts given before and after a claim, as in
9608 ``from a and b have C using d and e <proof>'';
9610 * Pure: renamed "antecedent" case to "rule_context";
9612 * Pure: new 'judgment' command records explicit information about the
9613 object-logic embedding (used by several tools internally); no longer
9614 use hard-wired "Trueprop";
9616 * Pure: added 'corollary' command;
9618 * Pure: fixed 'token_translation' command;
9620 * Pure: removed obsolete 'exported' attribute;
9622 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9623 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9624 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9626 * Pure: method 'atomize' presents local goal premises as object-level
9627 statements (atomic meta-level propositions); setup controlled via
9628 rewrite rules declarations of 'atomize' attribute; example
9629 application: 'induct' method with proper rule statements in improper
9632 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9633 now consider the syntactic context of assumptions, giving a better
9634 chance to get type-inference of the arguments right (this is
9635 especially important for locales);
9637 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9640 * Pure/obtain: the formal conclusion "thesis", being marked as
9641 ``internal'', may no longer be reference directly in the text;
9642 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9645 * Pure: generic 'sym' attribute which declares a rule both as pure
9646 'elim?' and for the 'symmetric' operation;
9648 * Pure: marginal comments ``--'' may now occur just anywhere in the
9649 text; the fixed correlation with particular command syntax has been
9652 * Pure: new method 'rules' is particularly well-suited for proof
9653 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9654 but often produces more compact proof terms with less detours;
9656 * Pure/Provers/classical: simplified integration with pure rule
9657 attributes and methods; the classical "intro?/elim?/dest?"
9658 declarations coincide with the pure ones; the "rule" method no longer
9659 includes classically swapped intros; "intro" and "elim" methods no
9660 longer pick rules from the context; also got rid of ML declarations
9661 AddXIs/AddXEs/AddXDs; all of this has some potential for
9664 * Provers/classical: attribute 'swapped' produces classical inversions
9665 of introduction rules;
9667 * Provers/simplifier: 'simplified' attribute may refer to explicit
9668 rules instead of full simplifier context; 'iff' attribute handles
9671 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9673 * HOL: 'recdef' now fails on unfinished automated proofs, use
9674 "(permissive)" option to recover old behavior;
9676 * HOL: 'inductive' no longer features separate (collective) attributes
9677 for 'intros' (was found too confusing);
9679 * HOL: properly declared induction rules less_induct and
9685 * HOL: moved over to sane numeral syntax; the new policy is as
9688 - 0 and 1 are polymorphic constants, which are defined on any
9689 numeric type (nat, int, real etc.);
9691 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9692 binary representation internally;
9694 - type nat has special constructor Suc, and generally prefers Suc 0
9695 over 1::nat and Suc (Suc 0) over 2::nat;
9697 This change may cause significant problems of INCOMPATIBILITY; here
9698 are some hints on converting existing sources:
9700 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9701 entities, so expressions involving "-" (unary or binary minus) need
9702 to be spaced properly;
9704 - existing occurrences of "1" may need to be constraint "1::nat" or
9705 even replaced by Suc 0; similar for old "2";
9707 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9709 - remove all special provisions on numerals in proofs;
9711 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9712 representation (depends on bin_arith_simps in the default context);
9714 * HOL: symbolic syntax for x^2 (numeral 2);
9716 * HOL: the class of all HOL types is now called "type" rather than
9717 "term"; INCOMPATIBILITY, need to adapt references to this type class
9718 in axclass/classes, instance/arities, and (usually rare) occurrences
9719 in typings (of consts etc.); internally the class is called
9720 "HOL.type", ML programs should refer to HOLogic.typeS;
9722 * HOL/record package improvements:
9723 - new derived operations "fields" to build a partial record section,
9724 "extend" to promote a fixed record to a record scheme, and
9725 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9726 declared as simp by default;
9727 - shared operations ("more", "fields", etc.) now need to be always
9728 qualified) --- potential INCOMPATIBILITY;
9729 - removed "make_scheme" operations (use "make" with "extend") --
9731 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9732 - provides cases/induct rules for use with corresponding Isar
9733 methods (for concrete records, record schemes, concrete more
9734 parts, and schematic more parts -- in that order);
9735 - internal definitions directly based on a light-weight abstract
9736 theory of product types over typedef rather than datatype;
9738 * HOL: generic code generator for generating executable ML code from
9739 specifications; specific support for HOL constructs such as inductive
9740 datatypes and sets, as well as recursive functions; can be invoked
9741 via 'generate_code' theory section;
9743 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9745 * HOL: consolidated and renamed several theories. In particular:
9746 Ord.thy has been absorbed into HOL.thy
9747 String.thy has been absorbed into List.thy
9749 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9750 (beware of argument permutation!);
9752 * HOL: linorder_less_split superseded by linorder_cases;
9754 * HOL/List: "nodups" renamed to "distinct";
9756 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9757 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9758 - Ex_def has changed, now need to use some_eq_ex
9760 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9761 in this (rare) case use:
9763 delSWrapper "split_all_tac"
9764 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9766 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9769 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9770 Isabelle's type classes, ^ on functions and relations has too general
9771 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9772 necessary to attach explicit type constraints;
9774 * HOL/Relation: the prefix name of the infix "O" has been changed from
9775 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9776 renamed accordingly (eg "compI" -> "rel_compI").
9778 * HOL: syntax translations now work properly with numerals and records
9781 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9782 of "lam" -- INCOMPATIBILITY;
9784 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9785 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9786 renamed "Product_Type.unit";
9788 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9790 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9791 the "cases" method);
9793 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9796 * HOL/IMP: updated and converted to new-style theory format; several
9797 parts turned into readable document, with proper Isar proof texts and
9798 some explanations (by Gerwin Klein);
9800 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9802 * HOL-Hyperreal is now a logic image;
9807 * Isar: consts/constdefs supports mixfix syntax for continuous
9810 * Isar: domain package adapted to new-style theory format, e.g. see
9813 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9814 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9815 lift.induct_tac, always use UU instead of Undef;
9817 * HOLCF/IMP: updated and converted to new-style theory;
9822 * Isar: proper integration of logic-specific tools and packages,
9823 including theory commands '(co)inductive', '(co)datatype',
9824 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9825 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9827 * theory Main no longer includes AC; for the Axiom of Choice, base
9828 your theory on Main_ZFC;
9830 * the integer library now covers quotients and remainders, with many
9831 laws relating division to addition, multiplication, etc.;
9833 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9834 typeless version of the formalism;
9836 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9839 * ZF/Induct: new directory for examples of inductive definitions,
9840 including theory Multiset for multiset orderings; converted to
9841 new-style theory format;
9843 * ZF: many new theorems about lists, ordinals, etc.;
9848 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9849 variable proof controls level of detail: 0 = no proofs (only oracle
9850 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9851 also ref manual for further ML interfaces;
9853 * Pure/axclass: removed obsolete ML interface
9854 goal_subclass/goal_arity;
9856 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9857 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9858 separate tokens, so expressions involving minus need to be spaced
9861 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9862 rather than "infixl" or "infixr";
9864 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9865 sort constraint specifications in type inference; e.g. "x::_::foo"
9866 ensures that the type of "x" is of sort "foo" (but not necessarily a
9869 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9870 control output of nested => (types); the default behavior is
9873 * Pure/syntax: builtin parse translation for "_constify" turns valued
9874 tokens into AST constants;
9876 * Pure/syntax: prefer later declarations of translations and print
9877 translation functions; potential INCOMPATIBILITY: need to reverse
9878 multiple declarations for same syntax element constant;
9880 * Pure/show_hyps reset by default (in accordance to existing Isar
9883 * Provers/classical: renamed addaltern to addafter, addSaltern to
9886 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9889 * system: tested support for MacOS X; should be able to get Isabelle +
9890 Proof General to work in a plain Terminal after installing Poly/ML
9891 (e.g. from the Isabelle distribution area) and GNU bash alone
9892 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9893 support requires further installations, e.g. from
9894 http://fink.sourceforge.net/);
9896 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9898 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9899 of 40 MB), cf. ML_OPTIONS;
9901 * system: Proof General keywords specification is now part of the
9902 Isabelle distribution (see etc/isar-keywords.el);
9904 * system: support for persistent Proof General sessions (refrain from
9905 outdating all loaded theories on startup); user may create writable
9906 logic images like this: ``isabelle -q HOL Test'';
9908 * system: smart selection of Isabelle process versus Isabelle
9909 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9910 run both "isabelle" and "Isabelle" even if file names are badly
9911 damaged (executable inspects the case of the first letter of its own
9912 name); added separate "isabelle-process" and "isabelle-interface";
9914 * system: refrain from any attempt at filtering input streams; no
9915 longer support ``8bit'' encoding of old isabelle font, instead proper
9916 iso-latin characters may now be used; the related isatools
9917 "symbolinput" and "nonascii" have disappeared as well;
9919 * system: removed old "xterm" interface (the print modes "xterm" and
9920 "xterm_color" are still available for direct use in a suitable
9925 New in Isabelle99-2 (February 2001)
9926 -----------------------------------
9928 *** Overview of INCOMPATIBILITIES ***
9930 * HOL: please note that theories in the Library and elsewhere often use the
9931 new-style (Isar) format; to refer to their theorems in an ML script you must
9932 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9934 * HOL: inductive package no longer splits induction rule aggressively,
9935 but only as far as specified by the introductions given; the old
9936 format may be recovered via ML function complete_split_rule or attribute
9937 'split_rule (complete)';
9939 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9940 gfp_Tarski to gfp_unfold;
9942 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9944 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9945 relation); infix "^^" has been renamed "``"; infix "``" has been
9946 renamed "`"; "univalent" has been renamed "single_valued";
9948 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9951 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9953 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9955 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9956 consequence, it is no longer monotonic wrt. the local goal context
9957 (which is now passed through the inductive cases);
9959 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9960 \<gg> to \<ggreater>;
9963 *** Document preparation ***
9965 * \isabellestyle{NAME} selects version of Isabelle output (currently
9966 available: are "it" for near math-mode best-style output, "sl" for
9967 slanted text style, and "tt" for plain type-writer; if no
9968 \isabellestyle command is given, output is according to slanted
9971 * support sub/super scripts (for single symbols only), input syntax is
9972 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9974 * some more standard symbols; see Appendix A of the system manual for
9975 the complete list of symbols defined in isabellesym.sty;
9977 * improved isabelle style files; more abstract symbol implementation
9978 (should now use \isamath{...} and \isatext{...} in custom symbol
9981 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9982 state; Note that presentation of goal states does not conform to
9983 actual human-readable proof documents. Please do not include goal
9984 states into document output unless you really know what you are doing!
9986 * proper indentation of antiquoted output with proportional LaTeX
9989 * no_document ML operator temporarily disables LaTeX document
9992 * isatool unsymbolize tunes sources for plain ASCII communication;
9997 * Pure: Isar now suffers initial goal statements to contain unbound
9998 schematic variables (this does not conform to actual readable proof
9999 documents, due to unpredictable outcome and non-compositional proof
10000 checking); users who know what they are doing may use schematic goals
10001 for Prolog-style synthesis of proven results;
10003 * Pure: assumption method (an implicit finishing) now handles actual
10006 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10007 initial goal, declare "that" only as Pure intro (only for single
10008 steps); the "that" rule assumption may now be involved in implicit
10009 finishing, thus ".." becomes a feasible for trivial obtains;
10011 * Pure: default proof step now includes 'intro_classes'; thus trivial
10012 instance proofs may be performed by "..";
10014 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10015 statements as well;
10017 * Pure: more robust selection of calculational rules;
10019 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10020 rule (as well as the assumption rule);
10022 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10023 lemmas, using the graph browser tool;
10025 * Pure: predict failure of "show" in interactive mode;
10027 * Pure: 'thms_containing' now takes actual terms as arguments;
10029 * HOL: improved method 'induct' --- now handles non-atomic goals
10030 (potential INCOMPATIBILITY); tuned error handling;
10032 * HOL: cases and induct rules now provide explicit hints about the
10033 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10034 any remaining facts are inserted into the goal verbatim;
10036 * HOL: local contexts (aka cases) may now contain term bindings as
10037 well; the 'cases' and 'induct' methods new provide a ?case binding for
10038 the result to be shown in each case;
10040 * HOL: added 'recdef_tc' command;
10042 * isatool convert assists in eliminating legacy ML scripts;
10047 * HOL/Library: a collection of generic theories to be used together
10048 with main HOL; the theory loader path already includes this directory
10049 by default; the following existing theories have been moved here:
10050 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10051 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10053 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10054 modelling and verification task performed in Isabelle/HOL +
10055 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10057 * HOL/Algebra: special summation operator SUM no longer exists, it has
10058 been replaced by setsum; infix 'assoc' now has priority 50 (like
10059 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10060 'domain', this makes the theory consistent with mathematical
10063 * HOL basics: added overloaded operations "inverse" and "divide"
10064 (infix "/"), syntax for generic "abs" operation, generic summation
10067 * HOL/typedef: simplified package, provide more useful rules (see also
10070 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10071 now expressed as a proper nested rule (old-style tactic scripts may
10072 require atomize_strip_tac to cope with non-atomic premises);
10074 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10075 to "split_conv" (old name still available for compatibility);
10077 * HOL: improved concrete syntax for strings (e.g. allows translation
10078 rules with string literals);
10080 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10081 and Fleuriot's mechanization of analysis, including the transcendental
10082 functions for the reals;
10084 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10089 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10090 "lam" is displayed as TWO lambda-symbols
10092 * CTT: theory Main now available, containing everything (that is, Bool
10098 * Pure: the Simplifier has been implemented properly as a derived rule
10099 outside of the actual kernel (at last!); the overall performance
10100 penalty in practical applications is about 50%, while reliability of
10101 the Isabelle inference kernel has been greatly improved;
10103 * print modes "brackets" and "no_brackets" control output of nested =>
10104 (types) and ==> (props); the default behaviour is "brackets";
10106 * Provers: fast_tac (and friends) now handle actual object-logic rules
10107 as assumptions as well;
10109 * system: support Poly/ML 4.0;
10111 * system: isatool install handles KDE version 1 or 2;
10115 New in Isabelle99-1 (October 2000)
10116 ----------------------------------
10118 *** Overview of INCOMPATIBILITIES ***
10120 * HOL: simplification of natural numbers is much changed; to partly
10121 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10122 issue the following ML commands:
10124 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10125 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10127 * HOL: simplification no longer dives into case-expressions; this is
10128 controlled by "t.weak_case_cong" for each datatype t;
10130 * HOL: nat_less_induct renamed to less_induct;
10132 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10133 fixsome to patch .thy and .ML sources automatically;
10135 select_equality -> some_equality
10136 select_eq_Ex -> some_eq_ex
10137 selectI2EX -> someI2_ex
10140 select1_equality -> some1_equality
10141 Eps_sym_eq -> some_sym_eq_trivial
10142 Eps_eq -> some_eq_trivial
10144 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10146 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10149 * HOL: the recursion equations generated by 'recdef' are now called
10150 f.simps instead of f.rules;
10152 * HOL: qed_spec_mp now also handles bounded ALL as well;
10154 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10155 sometimes be needed;
10157 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10159 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10161 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10162 product is now "<*>" instead of "Times"; the lexicographic product is
10163 now "<*lex*>" instead of "**";
10165 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10166 of main HOL, but was unused); better use HOL's datatype package;
10168 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10169 the old syntax may be recovered as follows:
10172 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10173 (infixl "\\<oplus>" 100)
10175 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10177 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10178 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10181 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10182 changed from A/r to A//r;
10184 * ZF: new treatment of arithmetic (nat & int) may break some old
10187 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10188 rulify -> rule_format, elimify -> elim_format, ...);
10190 * Isar/Provers: intro/elim/dest attributes changed; renamed
10191 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10192 should have to change intro!! to intro? only); replaced "delrule" by
10195 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10197 * Provers: strengthened force_tac by using new first_best_tac;
10199 * LaTeX document preparation: several changes of isabelle.sty (see
10203 *** Document preparation ***
10205 * formal comments (text blocks etc.) in new-style theories may now
10206 contain antiquotations of thm/prop/term/typ/text to be presented
10207 according to latex print mode; concrete syntax is like this:
10208 @{term[show_types] "f(x) = a + x"};
10210 * isatool mkdir provides easy setup of Isabelle session directories,
10211 including proper document sources;
10213 * generated LaTeX sources are now deleted after successful run
10214 (isatool document -c); may retain a copy somewhere else via -D option
10217 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10218 style files, achieving self-contained LaTeX sources and simplifying
10221 * old-style theories now produce (crude) LaTeX output as well;
10223 * browser info session directories are now self-contained (may be put
10224 on WWW server seperately); improved graphs of nested sessions; removed
10225 graph for 'all sessions';
10227 * several improvements in isabelle style files; \isabellestyle{it}
10228 produces fake math mode output; \isamarkupheader is now \section by
10229 default; see lib/texinputs/isabelle.sty etc.;
10234 * Isar/Pure: local results and corresponding term bindings are now
10235 subject to Hindley-Milner polymorphism (similar to ML); this
10236 accommodates incremental type-inference very nicely;
10238 * Isar/Pure: new derived language element 'obtain' supports
10239 generalized existence reasoning;
10241 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10242 support accumulation of results, without applying any rules yet;
10243 useful to collect intermediate results without explicit name
10244 references, and for use with transitivity rules with more than 2
10247 * Isar/Pure: scalable support for case-analysis type proofs: new
10248 'case' language element refers to local contexts symbolically, as
10249 produced by certain proof methods; internally, case names are attached
10250 to theorems as "tags";
10252 * Isar/Pure: theory command 'hide' removes declarations from
10253 class/type/const name spaces;
10255 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10256 indicate potential overloading;
10258 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10260 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10261 "{a,b,c}" instead of {a,b,c};
10263 * Isar/Pure now provides its own version of intro/elim/dest
10264 attributes; useful for building new logics, but beware of confusion
10265 with the version in Provers/classical;
10267 * Isar/Pure: the local context of (non-atomic) goals is provided via
10268 case name 'antecedent';
10270 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10271 to the current context is now done automatically);
10273 * Isar/Pure: theory command 'method_setup' provides a simple interface
10274 for definining proof methods in ML;
10276 * Isar/Provers: intro/elim/dest attributes changed; renamed
10277 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10278 most cases, one should have to change intro!! to intro? only);
10279 replaced "delrule" by "rule del";
10281 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10282 'symmetric' attribute (the latter supercedes [RS sym]);
10284 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10285 method modifier); 'simp' method: 'only:' modifier removes loopers as
10286 well (including splits);
10288 * Isar/Provers: Simplifier and Classical methods now support all kind
10289 of modifiers used in the past, including 'cong', 'iff', etc.
10291 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10292 of Simplifier and Classical reasoner);
10294 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10295 now support named cases; major packages (inductive, datatype, primrec,
10296 recdef) support case names and properly name parameters;
10298 * Isar/HOL: new transitivity rules for substitution in inequalities --
10299 monotonicity conditions are extracted to be proven at end of
10302 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10305 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10306 split_if split_if_asm; datatype package provides theorems foo.splits =
10307 foo.split foo.split_asm for each datatype;
10309 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10310 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10311 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10312 use "(cases (simplified))" method in proper proof texts);
10314 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10316 * Isar: names of theorems etc. may be natural numbers as well;
10318 * Isar: 'pr' command: optional arguments for goals_limit and
10319 ProofContext.prems_limit; no longer prints theory contexts, but only
10322 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10323 additional print modes to be specified; e.g. "pr(latex)" will print
10324 proof state according to the Isabelle LaTeX style;
10326 * Isar: improved support for emulating tactic scripts, including proof
10327 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10328 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10329 (for HOL datatypes);
10331 * Isar: simplified (more robust) goal selection of proof methods: 1st
10332 goal, all goals, or explicit goal specifier (tactic emulation); thus
10333 'proof method scripts' have to be in depth-first order;
10335 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10337 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10338 should instead use individual commands for printing items
10339 (print_commands, print_methods etc.);
10341 * Isar: added 'nothing' --- the empty list of theorems;
10346 * HOL/MicroJava: formalization of a fragment of Java, together with a
10347 corresponding virtual machine and a specification of its bytecode
10348 verifier and a lightweight bytecode verifier, including proofs of
10349 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10350 Cornelia Pusch (see also the homepage of project Bali at
10351 http://isabelle.in.tum.de/Bali/);
10353 * HOL/Algebra: new theory of rings and univariate polynomials, by
10356 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10357 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10360 * HOL/Lattice: fundamental concepts of lattice theory and order
10361 structures, including duals, properties of bounds versus algebraic
10362 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10363 Theorem for complete lattices etc.; may also serve as a demonstration
10364 for abstract algebraic reasoning using axiomatic type classes, and
10365 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10367 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10370 * HOL/IMPP: extension of IMP with local variables and mutually
10371 recursive procedures, by David von Oheimb;
10373 * HOL/Lambda: converted into new-style theory and document;
10375 * HOL/ex/Multiquote: example of multiple nested quotations and
10376 anti-quotations -- basically a generalized version of de-Bruijn
10377 representation; very useful in avoiding lifting of operations;
10379 * HOL/record: added general record equality rule to simpset; fixed
10380 select-update simplification procedure to handle extended records as
10381 well; admit "r" as field name;
10383 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10384 other numeric types and also as the identity of groups, rings, etc.;
10386 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10387 Types nat and int belong to this axclass;
10389 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10390 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10391 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10392 two terms #m*u and #n*u are replaced by #(m+n)*u
10393 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10394 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10395 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10397 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10398 powerful prover for predicate logic but knows nothing of clasets; see
10399 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10401 * HOL: new version of "case_tac" subsumes both boolean case split and
10402 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10403 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10405 * HOL: simplification no longer dives into case-expressions: only the
10406 selector expression is simplified, but not the remaining arms; to
10407 enable full simplification of case-expressions for datatype t, you may
10408 remove t.weak_case_cong from the simpset, either globally (Delcongs
10409 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10411 * HOL/recdef: the recursion equations generated by 'recdef' for
10412 function 'f' are now called f.simps instead of f.rules; if all
10413 termination conditions are proved automatically, these simplification
10414 rules are added to the simpset, as in primrec; rules may be named
10415 individually as well, resulting in a separate list of theorems for
10418 * HOL/While is a new theory that provides a while-combinator. It
10419 permits the definition of tail-recursive functions without the
10420 provision of a termination measure. The latter is necessary once the
10421 invariant proof rule for while is applied.
10423 * HOL: new (overloaded) notation for the set of elements below/above
10424 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10426 * HOL: theorems impI, allI, ballI bound as "strip";
10428 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10429 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10430 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10432 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10434 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10435 main HOL, but was unused);
10437 * HOL: fewer consts declared as global (e.g. have to refer to
10438 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10440 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10441 in case of overlap with user translations (e.g. judgements over
10442 tuples); (note that the underlying logical represenation is still
10448 * ZF: simplification automatically cancels common terms in arithmetic
10449 expressions over nat and int;
10451 * ZF: new treatment of nat to minimize type-checking: all operators
10452 coerce their operands to a natural number using the function natify,
10453 making the algebraic laws unconditional;
10455 * ZF: as above, for int: operators coerce their operands to an integer
10456 using the function intify;
10458 * ZF: the integer library now contains many of the usual laws for the
10459 orderings, including $<=, and monotonicity laws for $+ and $*;
10461 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10464 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10465 to the simplifier and classical reasoner simultaneously;
10470 * Provers: blast_tac now handles actual object-logic rules as
10471 assumptions; note that auto_tac uses blast_tac internally as well;
10473 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10474 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10476 * Provers: delrules now handles destruct rules as well (no longer need
10477 explicit make_elim);
10479 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10480 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10481 use instead the strong form,
10482 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10483 in HOL, FOL and ZF the function cla_make_elim will create such rules
10484 from destruct-rules;
10486 * Provers: Simplifier.easy_setup provides a fast path to basic
10487 Simplifier setup for new object-logics;
10489 * Pure: AST translation rules no longer require constant head on LHS;
10491 * Pure: improved name spaces: ambiguous output is qualified; support
10492 for hiding of names;
10494 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10495 XSYMBOL_HOME; no longer need to do manual configuration in most
10498 * system: compression of ML heaps images may now be controlled via -c
10499 option of isabelle and isatool usedir (currently only observed by
10502 * system: isatool installfonts may handle X-Symbol fonts as well (very
10503 useful for remote X11);
10505 * system: provide TAGS file for Isabelle sources;
10507 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10510 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10511 timing flag supersedes proof_timing and Toplevel.trace;
10513 * ML: new combinators |>> and |>>> for incremental transformations
10514 with secondary results (e.g. certain theory extensions):
10516 * ML: PureThy.add_defs gets additional argument to indicate potential
10517 overloading (usually false);
10519 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10524 New in Isabelle99 (October 1999)
10525 --------------------------------
10527 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10529 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10530 are no longer simplified. (This allows the simplifier to unfold recursive
10531 functional programs.) To restore the old behaviour, declare
10533 Delcongs [if_weak_cong];
10535 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10538 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10540 * HOL/datatype: mutual_induct_tac no longer exists --
10541 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10543 * HOL/typedef: fixed type inference for representing set; type
10544 arguments now have to occur explicitly on the rhs as type constraints;
10546 * ZF: The con_defs part of an inductive definition may no longer refer
10547 to constants declared in the same theory;
10549 * HOL, ZF: the function mk_cases, generated by the inductive
10550 definition package, has lost an argument. To simplify its result, it
10551 uses the default simpset instead of a supplied list of theorems.
10553 * HOL/List: the constructors of type list are now Nil and Cons;
10555 * Simplifier: the type of the infix ML functions
10556 setSSolver addSSolver setSolver addSolver
10557 is now simpset * solver -> simpset where `solver' is a new abstract type
10558 for packaging solvers. A solver is created via
10559 mk_solver: string -> (thm list -> int -> tactic) -> solver
10560 where the string argument is only a comment.
10563 *** Proof tools ***
10565 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10566 decision procedure for linear arithmetic. Currently it is used for
10567 types `nat', `int', and `real' in HOL (see below); it can, should and
10568 will be instantiated for other types and logics as well.
10570 * The simplifier now accepts rewrite rules with flexible heads, eg
10571 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10572 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10578 * New Isabelle/Isar subsystem provides an alternative to traditional
10579 tactical theorem proving; together with the ProofGeneral/isar user
10580 interface it offers an interactive environment for developing human
10581 readable proof documents (Isar == Intelligible semi-automated
10582 reasoning); for further information see isatool doc isar-ref,
10583 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10585 * improved and simplified presentation of theories: better HTML markup
10586 (including colors), graph views in several sizes; isatool usedir now
10587 provides a proper interface for user theories (via -P option); actual
10588 document preparation based on (PDF)LaTeX is available as well (for
10589 new-style theories only); see isatool doc system for more information;
10591 * native support for Proof General, both for classic Isabelle and
10594 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10595 using the graph browser tool;
10597 * Isabelle manuals now also available as PDF;
10599 * theory loader rewritten from scratch (may not be fully
10600 bug-compatible); old loadpath variable has been replaced by show_path,
10601 add_path, del_path, reset_path functions; new operations such as
10602 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10605 * improved isatool install: option -k creates KDE application icon,
10606 option -p DIR installs standalone binaries;
10608 * added ML_PLATFORM setting (useful for cross-platform installations);
10609 more robust handling of platform specific ML images for SML/NJ;
10611 * the settings environment is now statically scoped, i.e. it is never
10612 created again in sub-processes invoked from isabelle, isatool, or
10615 * path element specification '~~' refers to '$ISABELLE_HOME';
10617 * in locales, the "assumes" and "defines" parts may be omitted if
10620 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10623 * new print_mode "HTML";
10625 * new flag show_tags controls display of tags of theorems (which are
10626 basically just comments that may be attached by some tools);
10628 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10629 mode and goal output format:
10631 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10633 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10635 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10636 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10638 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10640 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10642 * function bind_thms stores lists of theorems (cf. bind_thm);
10644 * new shorthand tactics ftac, eatac, datac, fatac;
10646 * qed (and friends) now accept "" as result name; in that case the
10647 theorem is not stored, but proper checks and presentation of the
10648 result still apply;
10650 * theorem database now also indexes constants "Trueprop", "all",
10651 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10656 ** HOL arithmetic **
10658 * There are now decision procedures for linear arithmetic over nat and
10661 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10662 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10663 are treated as atomic; subformulae not involving type `nat' or `int'
10664 are ignored; quantified subformulae are ignored unless they are
10665 positive universal or negative existential. The tactic has to be
10666 invoked by hand and can be a little bit slow. In particular, the
10667 running time is exponential in the number of occurrences of `min' and
10668 `max', and `-' on `nat'.
10670 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10671 (negated) (in)equalities among the premises and the conclusion into
10672 account (i.e. no compound formulae) and does not know about `min' and
10673 `max', and `-' on `nat'. It is fast and is used automatically by the
10676 NB: At the moment, these decision procedures do not cope with mixed
10677 nat/int formulae where the two parts interact, such as `m < n ==>
10680 * HOL/Numeral provides a generic theory of numerals (encoded
10681 efficiently as bit strings); setup for types nat/int/real is in place;
10682 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10683 int, existing theories and proof scripts may require a few additional
10686 * integer division and remainder can now be performed on constant
10689 * many properties of integer multiplication, division and remainder
10692 * An interface to the Stanford Validity Checker (SVC) is available through the
10693 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10694 are proved automatically. SVC must be installed separately, and its results
10695 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10696 invocation of the underlying oracle). For SVC see
10697 http://verify.stanford.edu/SVC
10699 * IsaMakefile: the HOL-Real target now builds an actual image;
10704 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10705 (in Isabelle/Isar) -- by Gertrud Bauer;
10707 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10708 analysis for assembly languages with subtypes;
10710 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10711 -- avoids syntactic ambiguities and treats state, transition, and
10712 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10713 changed syntax and (many) tactics;
10715 * HOL/inductive: Now also handles more general introduction rules such
10716 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10717 theorems are now maintained within the theory (maintained via the
10720 * HOL/datatype: Now also handles arbitrarily branching datatypes
10721 (using function types) such as
10723 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10725 * HOL/record: record_simproc (part of the default simpset) takes care
10726 of selectors applied to updated records; record_split_tac is no longer
10727 part of the default claset; update_defs may now be removed from the
10728 simpset in many cases; COMPATIBILITY: old behavior achieved by
10730 claset_ref () := claset() addSWrapper record_split_wrapper;
10731 Delsimprocs [record_simproc]
10733 * HOL/typedef: fixed type inference for representing set; type
10734 arguments now have to occur explicitly on the rhs as type constraints;
10736 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10737 names rather than an ML expression;
10739 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10740 supplied later. Program schemes can be defined, such as
10741 "While B C s = (if B s then While B C (C s) else s)"
10742 where the well-founded relation can be chosen after B and C have been given.
10744 * HOL/List: the constructors of type list are now Nil and Cons;
10745 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10746 course, ML tools referring to List.list.op # etc. have to be adapted;
10748 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10749 disabled by default; run isabelle with option -m HOL to get back to
10750 the original Gordon/HOL-style output;
10752 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10753 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10755 * HOL basic syntax simplified (more orthogonal): all variants of
10756 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10757 Eps operator is provided as well: "SOME x. P[x]";
10759 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10761 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10762 thus available for user theories;
10764 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10765 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10768 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10769 several times and then mp;
10774 * the notation <<...>> is now available as a notation for sequences of
10777 * the simplifier is now installed
10779 * the axiom system has been generalized (thanks to Soren Heilmann)
10781 * the classical reasoner now has a default rule database
10786 * new primrec section allows primitive recursive functions to be given
10787 directly (as in HOL) over datatypes and the natural numbers;
10789 * new tactics induct_tac and exhaust_tac for induction (or case
10790 analysis) over datatypes and the natural numbers;
10792 * the datatype declaration of type T now defines the recursor T_rec;
10794 * simplification automatically does freeness reasoning for datatype
10797 * automatic type-inference, with AddTCs command to insert new
10798 type-checking rules;
10800 * datatype introduction rules are now added as Safe Introduction rules
10803 * the syntax "if P then x else y" is now available in addition to
10807 *** Internal programming interfaces ***
10809 * tuned simplifier trace output; new flag debug_simp;
10811 * structures Vartab / Termtab (instances of TableFun) offer efficient
10812 tables indexed by indexname_ord / term_ord (compatible with aconv);
10814 * AxClass.axclass_tac lost the theory argument;
10816 * tuned current_goals_markers semantics: begin / end goal avoids
10817 printing empty lines;
10819 * removed prs and prs_fn hook, which was broken because it did not
10820 include \n in its semantics, forcing writeln to add one
10821 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10822 string -> unit if you really want to output text without newline;
10824 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10825 plain output, interface builders may have to enable 'isabelle_font'
10826 mode to get Isabelle font glyphs as before;
10828 * refined token_translation interface; INCOMPATIBILITY: output length
10829 now of type real instead of int;
10831 * theory loader actions may be traced via new ThyInfo.add_hook
10832 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10833 your own database of information attached to *whole* theories -- as
10834 opposed to intra-theory data slots offered via TheoryDataFun;
10836 * proper handling of dangling sort hypotheses (at last!);
10837 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10838 extra sort hypotheses that can be witnessed from the type signature;
10839 the force_strip_shyps flag is gone, any remaining shyps are simply
10840 left in the theorem (with a warning issued by strip_shyps_warning);
10844 New in Isabelle98-1 (October 1998)
10845 ----------------------------------
10847 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10849 * several changes of automated proof tools;
10851 * HOL: major changes to the inductive and datatype packages, including
10852 some minor incompatibilities of theory syntax;
10854 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10857 * HOL: removed duplicate thms in Arith:
10858 less_imp_add_less should be replaced by trans_less_add1
10859 le_imp_add_le should be replaced by trans_le_add1
10861 * HOL: unary minus is now overloaded (new type constraints may be
10864 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10865 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10866 now taken as an integer constant.
10868 * Pure: ML function 'theory_of' renamed to 'theory';
10871 *** Proof tools ***
10874 1. Asm_full_simp_tac is now more aggressive.
10875 1. It will sometimes reorient premises if that increases their power to
10877 2. It does no longer proceed strictly from left to right but may also
10878 rotate premises to achieve further simplification.
10879 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10880 old Asm_full_simp_tac in that it does not rotate premises.
10881 2. The simplifier now knows a little bit about nat-arithmetic.
10883 * Classical reasoner: wrapper mechanism for the classical reasoner now
10884 allows for selected deletion of wrappers, by introduction of names for
10885 wrapper functionals. This implies that addbefore, addSbefore,
10886 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10887 and that adding two tactics with the same name overwrites the first
10888 one (emitting a warning).
10889 type wrapper = (int -> tactic) -> (int -> tactic)
10890 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10891 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10892 delWrapper, delSWrapper: claset * string -> claset
10893 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10895 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10896 semantics; addbefore now affects only the unsafe part of step_tac
10897 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10898 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10901 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10902 compWrapper; added safe wrapper (and access functions for it);
10904 * HOL/split_all_tac is now much faster and fails if there is nothing
10905 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10906 and the names of the automatically generated variables have changed.
10907 split_all_tac has moved within claset() from unsafe wrappers to safe
10908 wrappers, which means that !!-bound variables are split much more
10909 aggressively, and safe_tac and clarify_tac now split such variables.
10910 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10911 Note: the same holds for record_split_tac, which does the job of
10912 split_all_tac for record fields.
10914 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10915 permanently to the default simpset using Addsplits just like
10916 Addsimps. They can be removed via Delsplits just like
10917 Delsimps. Lower-case versions are also available.
10919 * HOL/Simplifier: The rule split_if is now part of the default
10920 simpset. This means that the simplifier will eliminate all occurrences
10921 of if-then-else in the conclusion of a goal. To prevent this, you can
10922 either remove split_if completely from the default simpset by
10923 `Delsplits [split_if]' or remove it in a specific call of the
10924 simplifier using `... delsplits [split_if]'. You can also add/delete
10925 other case splitting rules to/from the default simpset: every datatype
10926 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10927 t is the name of the datatype).
10929 * Classical reasoner / Simplifier combination: new force_tac (and
10930 derivatives Force_tac, force) combines rewriting and classical
10931 reasoning (and whatever other tools) similarly to auto_tac, but is
10932 aimed to solve the given subgoal completely.
10937 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10938 and `goalw': the theory is no longer needed as an explicit argument -
10939 the current theory context is used; assumptions are no longer returned
10940 at the ML-level unless one of them starts with ==> or !!; it is
10941 recommended to convert to these new commands using isatool fixgoal
10942 (backup your sources first!);
10944 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10945 the current theory context, and 'theory' to lookup stored theories;
10947 * new theory section 'locale' for declaring constants, assumptions and
10948 definitions that have local scope;
10950 * new theory section 'nonterminals' for purely syntactic types;
10952 * new theory section 'setup' for generic ML setup functions
10953 (e.g. package initialization);
10955 * the distribution now includes Isabelle icons: see
10956 lib/logo/isabelle-{small,tiny}.xpm;
10958 * isatool install - install binaries with absolute references to
10961 * isatool logo -- create instances of the Isabelle logo (as EPS);
10963 * print mode 'emacs' reserved for Isamode;
10965 * support multiple print (ast) translations per constant name;
10967 * theorems involving oracles are now printed with a suffixed [!];
10972 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10974 * HOL/inductive package reorganized and improved: now supports mutual
10975 definitions such as
10980 oddI "n : EVEN ==> Suc n : ODD"
10981 evenI "n : ODD ==> Suc n : EVEN"
10983 new theorem list "elims" contains an elimination rule for each of the
10984 recursive sets; inductive definitions now handle disjunctive premises
10985 correctly (also ZF);
10987 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10988 "mutual_induct" no longer exists - the induction rule is always
10989 contained in "induct";
10992 * HOL/datatype package re-implemented and greatly improved: now
10993 supports mutually recursive datatypes such as
10996 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10997 | SUM ('a aexp) ('a aexp)
10998 | DIFF ('a aexp) ('a aexp)
11001 'a bexp = LESS ('a aexp) ('a aexp)
11002 | AND ('a bexp) ('a bexp)
11003 | OR ('a bexp) ('a bexp)
11005 as well as indirectly recursive datatypes such as
11008 ('a, 'b) term = Var 'a
11009 | App 'b ((('a, 'b) term) list)
11011 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11012 induction on mutually / indirectly recursive datatypes.
11014 Primrec equations are now stored in theory and can be accessed via
11015 <function_name>.simps.
11019 - Theories using datatypes must now have theory Datatype as an
11021 - The specific <typename>.induct_tac no longer exists - use the
11022 generic induct_tac instead.
11023 - natE has been renamed to nat.exhaust - use exhaust_tac
11024 instead of res_inst_tac ... natE. Note that the variable
11025 names in nat.exhaust differ from the names in natE, this
11026 may cause some "fragile" proofs to fail.
11027 - The theorems split_<typename>_case and split_<typename>_case_asm
11028 have been renamed to <typename>.split and <typename>.split_asm.
11029 - Since default sorts of type variables are now handled correctly,
11030 some datatype definitions may have to be annotated with explicit
11032 - Primrec definitions no longer require function name and type
11033 of recursive argument.
11035 Consider using isatool fixdatatype to adapt your theories and proof
11036 scripts to the new package (backup your sources first!).
11039 * HOL/record package: considerably improved implementation; now
11040 includes concrete syntax for record types, terms, updates; theorems
11041 for surjective pairing and splitting !!-bound record variables; proof
11042 support is as follows:
11044 1) standard conversions (selectors or updates applied to record
11045 constructor terms) are part of the standard simpset;
11047 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11048 made part of standard simpset and claset via addIffs;
11050 3) a tactic for record field splitting (record_split_tac) is part of
11051 the standard claset (addSWrapper);
11053 To get a better idea about these rules you may retrieve them via
11054 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11055 the name of your record type.
11057 The split tactic 3) conceptually simplifies by the following rule:
11059 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11061 Thus any record variable that is bound by meta-all will automatically
11062 blow up into some record constructor term, consequently the
11063 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11064 solve record problems automatically.
11067 * reorganized the main HOL image: HOL/Integ and String loaded by
11068 default; theory Main includes everything;
11070 * automatic simplification of integer sums and comparisons, using cancellation;
11072 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11074 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11076 * many new identities for unions, intersections, set difference, etc.;
11078 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11079 called split_if, split_split, split_sum_case and split_nat_case (to go
11080 with add/delsplits);
11082 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11083 (?x::unit) = (); this is made part of the default simpset, which COULD
11084 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11085 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11086 unit_abs_eta_conv is added in order to counter the effect of
11087 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11090 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11093 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11094 It and 'sym RS equals0D' are now in the default claset, giving automatic
11095 disjointness reasoning but breaking a few old proofs.
11097 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11098 to 'converse' from 'inverse' (for compatibility with ZF and some
11101 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11102 the well-founded relation;
11104 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11105 Compl A. The "Compl" syntax remains available as input syntax for this
11108 * HOL/Update: new theory of function updates:
11109 f(a:=b) == %x. if x=a then b else f x
11110 may also be iterated as in f(a:=b,c:=d,...);
11112 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11115 - new function list_update written xs[i:=v] that updates the i-th
11116 list position. May also be iterated as in xs[i:=a,j:=b,...].
11117 - new function `upt' written [i..j(] which generates the list
11118 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11119 bound write [i..j], which is a shorthand for [i..j+1(].
11120 - new lexicographic orderings and corresponding wellfoundedness theorems.
11123 - removed 'pred' (predecessor) function;
11124 - generalized some theorems about n-1;
11125 - many new laws about "div" and "mod";
11126 - new laws about greatest common divisors (see theory ex/Primes);
11128 * HOL/Relation: renamed the relational operator r^-1 "converse"
11129 instead of "inverse";
11131 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11132 of the multiset ordering;
11134 * directory HOL/Real: a construction of the reals using Dedekind cuts
11135 (not included by default);
11137 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11139 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11140 programs, i.e. different program variables may have different types.
11142 * calling (stac rew i) now fails if "rew" has no effect on the goal
11143 [previously, this check worked only if the rewrite rule was unconditional]
11144 Now rew can involve either definitions or equalities (either == or =).
11149 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11150 only the theorems proved on ZF.ML;
11152 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11153 It and 'sym RS equals0D' are now in the default claset, giving automatic
11154 disjointness reasoning but breaking a few old proofs.
11156 * ZF/Update: new theory of function updates
11157 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11158 may also be iterated as in f(a:=b,c:=d,...);
11160 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11162 * calling (stac rew i) now fails if "rew" has no effect on the goal
11163 [previously, this check worked only if the rewrite rule was unconditional]
11164 Now rew can involve either definitions or equalities (either == or =).
11166 * case_tac provided for compatibility with HOL
11167 (like the old excluded_middle_tac, but with subgoals swapped)
11170 *** Internal programming interfaces ***
11172 * Pure: several new basic modules made available for general use, see
11173 also src/Pure/README;
11175 * improved the theory data mechanism to support encapsulation (data
11176 kind name replaced by private Object.kind, acting as authorization
11177 key); new type-safe user interface via functor TheoryDataFun; generic
11178 print_data function becomes basically useless;
11180 * removed global_names compatibility flag -- all theory declarations
11181 are qualified by default;
11183 * module Pure/Syntax now offers quote / antiquote translation
11184 functions (useful for Hoare logic etc. with implicit dependencies);
11185 see HOL/ex/Antiquote for an example use;
11187 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11190 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11193 * Display.print_goals function moved to Locale.print_goals;
11195 * standard print function for goals supports current_goals_markers
11196 variable for marking begin of proof, end of proof, start of goal; the
11197 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11198 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11203 New in Isabelle98 (January 1998)
11204 --------------------------------
11206 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11208 * changed lexical syntax of terms / types: dots made part of long
11209 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11211 * simpset (and claset) reference variable replaced by functions
11212 simpset / simpset_ref;
11214 * no longer supports theory aliases (via merge) and non-trivial
11215 implicit merge of thms' signatures;
11217 * most internal names of constants changed due to qualified names;
11219 * changed Pure/Sequence interface (see Pure/seq.ML);
11222 *** General Changes ***
11224 * hierachically structured name spaces (for consts, types, axms, thms
11225 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11226 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11227 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11228 long_names for fully qualified output names; NOTE: ML programs
11229 (special tactics, packages etc.) referring to internal names may have
11230 to be adapted to cope with fully qualified names; in case of severe
11231 backward campatibility problems try setting 'global_names' at compile
11232 time to have enrything declared within a flat name space; one may also
11233 fine tune name declarations in theories via the 'global' and 'local'
11236 * reimplemented the implicit simpset and claset using the new anytype
11237 data filed in signatures; references simpset:simpset ref etc. are
11238 replaced by functions simpset:unit->simpset and
11239 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11240 to patch your ML files accordingly;
11242 * HTML output now includes theory graph data for display with Java
11243 applet or isatool browser; data generated automatically via isatool
11244 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11246 * defs may now be conditional; improved rewrite_goals_tac to handle
11247 conditional equations;
11249 * defs now admits additional type arguments, using TYPE('a) syntax;
11251 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11252 creates a new theory node; implicit merge of thms' signatures is
11253 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11254 transfer:theory->thm->thm in (rare) cases;
11256 * improved handling of draft signatures / theories; draft thms (and
11257 ctyps, cterms) are automatically promoted to real ones;
11259 * slightly changed interfaces for oracles: admit many per theory, named
11260 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11262 * print_goals: optional output of const types (set show_consts and
11265 * improved output of warnings (###) and errors (***);
11267 * subgoal_tac displays a warning if the new subgoal has type variables;
11269 * removed old README and Makefiles;
11271 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11273 * removed obsolete init_pps and init_database;
11275 * deleted the obsolete tactical STATE, which was declared by
11276 fun STATE tacfun st = tacfun st st;
11278 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11279 (which abbreviates $HOME);
11281 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11282 use isatool fixseq to adapt your ML programs (this works for fully
11283 qualified references to the Sequence structure only!);
11285 * use_thy no longer requires writable current directory; it always
11286 reloads .ML *and* .thy file, if either one is out of date;
11289 *** Classical Reasoner ***
11291 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11292 tactics that use classical reasoning to simplify a subgoal without
11293 splitting it into several subgoals;
11295 * Safe_tac: like safe_tac but uses the default claset;
11300 * added simplification meta rules:
11301 (asm_)(full_)simplify: simpset -> thm -> thm;
11303 * simplifier.ML no longer part of Pure -- has to be loaded by object
11306 * added prems argument to simplification procedures;
11308 * HOL, FOL, ZF: added infix function `addsplits':
11309 instead of `<simpset> setloop (split_tac <thms>)'
11310 you can simply write `<simpset> addsplits <thms>'
11315 * TYPE('a) syntax for type reflection terms;
11317 * no longer handles consts with name "" -- declare as 'syntax' instead;
11319 * pretty printer: changed order of mixfix annotation preference (again!);
11321 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11326 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11327 with `addloop' of the simplifier to faciliate case splitting in premises.
11329 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11331 * HOL/Auth: new protocol proofs including some for the Internet
11334 * HOL/Map: new theory of `maps' a la VDM;
11336 * HOL/simplifier: simplification procedures nat_cancel_sums for
11337 cancelling out common nat summands from =, <, <= (in)equalities, or
11338 differences; simplification procedures nat_cancel_factor for
11339 cancelling common factor from =, <, <= (in)equalities over natural
11340 sums; nat_cancel contains both kinds of procedures, it is installed by
11341 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11343 * HOL/simplifier: terms of the form
11344 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11346 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11347 and those of the form
11348 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11350 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11353 Each datatype `t' now comes with a theorem `split_t_case' of the form
11355 P(t_case f1 ... fn x) =
11356 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11358 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11361 and a theorem `split_t_case_asm' of the form
11363 P(t_case f1 ... fn x) =
11364 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11366 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11368 which can be added to a simpset via `addsplits'. The existing theorems
11369 expand_list_case and expand_option_case have been renamed to
11370 split_list_case and split_option_case.
11373 - `pred n' is automatically converted to `n-1'.
11374 Users are strongly encouraged not to use `pred' any longer,
11375 because it will disappear altogether at some point.
11376 - Users are strongly encouraged to write "0 < n" rather than
11377 "n ~= 0". Theorems and proof tools have been modified towards this
11381 the function "set_of_list" has been renamed "set" (and its theorems too);
11382 the function "nth" now takes its arguments in the reverse order and
11383 has acquired the infix notation "!" as in "xs!n".
11385 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11387 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11388 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11390 * HOL/record: extensible records with schematic structural subtyping
11391 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11392 still lacks various theorems and concrete record syntax;
11397 * removed "axioms" and "generated by" sections;
11399 * replaced "ops" section by extended "consts" section, which is capable of
11400 handling the continuous function space "->" directly;
11403 . proves theorems immediately and stores them in the theory,
11404 . creates hierachical name space,
11405 . now uses normal mixfix annotations (instead of cinfix...),
11406 . minor changes to some names and values (for consistency),
11407 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11408 . separator between mutual domain defs: changed "," to "and",
11409 . improved handling of sort constraints; now they have to
11410 appear on the left-hand side of the equations only;
11412 * fixed LAM <x,y,zs>.b syntax;
11414 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11415 adm (%x. P (t x)), where P is chainfinite and t continuous;
11420 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11421 with `addloop' of the simplifier to faciliate case splitting in premises.
11423 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11424 in HOL, they strip ALL and --> from proved theorems;
11428 New in Isabelle94-8 (May 1997)
11429 ------------------------------
11431 *** General Changes ***
11433 * new utilities to build / run / maintain Isabelle etc. (in parts
11434 still somewhat experimental); old Makefiles etc. still functional;
11436 * new 'Isabelle System Manual';
11438 * INSTALL text, together with ./configure and ./build scripts;
11440 * reimplemented type inference for greater efficiency, better error
11441 messages and clean internal interface;
11443 * prlim command for dealing with lots of subgoals (an easier way of
11444 setting goals_limit);
11449 * supports alternative (named) syntax tables (parser and pretty
11450 printer); internal interface is provided by add_modesyntax(_i);
11452 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11453 be used in conjunction with the Isabelle symbol font; uses the
11454 "symbols" syntax table;
11456 * added token_translation interface (may translate name tokens in
11457 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11458 the current print_mode); IMPORTANT: user print translation functions
11459 are responsible for marking newly introduced bounds
11460 (Syntax.mark_boundT);
11462 * token translations for modes "xterm" and "xterm_color" that display
11463 names in bold, underline etc. or colors (which requires a color
11466 * infixes may now be declared with names independent of their syntax;
11468 * added typed_print_translation (like print_translation, but may
11469 access type of constant);
11472 *** Classical Reasoner ***
11474 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11475 some limitations. Blast_tac...
11476 + ignores addss, addbefore, addafter; this restriction is intrinsic
11477 + ignores elimination rules that don't have the correct format
11478 (the conclusion MUST be a formula variable)
11479 + ignores types, which can make HOL proofs fail
11480 + rules must not require higher-order unification, e.g. apply_type in ZF
11481 [message "Function Var's argument not a bound variable" relates to this]
11482 + its proof strategy is more general but can actually be slower
11484 * substitution with equality assumptions no longer permutes other
11487 * minor changes in semantics of addafter (now called addaltern); renamed
11488 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11489 (and access functions for it);
11491 * improved combination of classical reasoner and simplifier:
11492 + functions for handling clasimpsets
11493 + improvement of addss: now the simplifier is called _after_ the
11495 + safe variant of addss called addSss: uses safe simplifications
11496 _during_ the safe steps. It is more complete as it allows multiple
11497 instantiations of unknowns (e.g. with slow_tac).
11501 * added interface for simplification procedures (functions that
11502 produce *proven* rewrite rules on the fly, depending on current
11505 * ordering on terms as parameter (used for ordered rewriting);
11507 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11509 * the solver is now split into a safe and an unsafe part.
11510 This should be invisible for the normal user, except that the
11511 functions setsolver and addsolver have been renamed to setSolver and
11512 addSolver; added safe_asm_full_simp_tac;
11517 * a generic induction tactic `induct_tac' which works for all datatypes and
11518 also for type `nat';
11520 * a generic case distinction tactic `exhaust_tac' which works for all
11521 datatypes and also for type `nat';
11523 * each datatype comes with a function `size';
11525 * patterns in case expressions allow tuple patterns as arguments to
11526 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11528 * primrec now also works with type nat;
11530 * recdef: a new declaration form, allows general recursive functions to be
11531 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11533 * the constant for negation has been renamed from "not" to "Not" to
11534 harmonize with FOL, ZF, LK, etc.;
11536 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11539 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11541 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11542 problems in commutative rings, using axiomatic type classes for + and *;
11544 * more examples in HOL/MiniML and HOL/Auth;
11546 * more default rewrite rules for quantifiers, union/intersection;
11548 * a new constant `arbitrary == @x.False';
11550 * HOLCF/IOA replaces old HOL/IOA;
11552 * HOLCF changes: derived all rules and arities
11553 + axiomatic type classes instead of classes
11554 + typedef instead of faking type definitions
11555 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11556 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11557 + eliminated the types void, one, tr
11558 + use unit lift and bool lift (with translations) instead of one and tr
11559 + eliminated blift from Lift3.thy (use Def instead of blift)
11560 all eliminated rules are derived as theorems --> no visible changes ;
11565 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11566 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11567 as ZF_cs addSIs [equalityI];
11571 New in Isabelle94-7 (November 96)
11572 ---------------------------------
11574 * allowing negative levels (as offsets) in prlev and choplev;
11576 * super-linear speedup for large simplifications;
11578 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11579 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11580 FAIL); can suppress it using the command Delsimps (ex_simps @
11581 all_simps); De Morgan laws are also now included, by default;
11583 * improved printing of ==> : ~:
11585 * new object-logic "Sequents" adds linear logic, while replacing LK
11586 and Modal (thanks to Sara Kalvala);
11588 * HOL/Auth: correctness proofs for authentication protocols;
11590 * HOL: new auto_tac combines rewriting and classical reasoning (many
11591 examples on HOL/Auth);
11593 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11594 the rewriter and classical reasoner simultaneously;
11596 * function uresult no longer returns theorems in "standard" format;
11597 regain previous version by: val uresult = standard o uresult;
11601 New in Isabelle94-6
11602 -------------------
11604 * oracles -- these establish an interface between Isabelle and trusted
11605 external reasoners, which may deliver results as theorems;
11607 * proof objects (in particular record all uses of oracles);
11609 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11611 * "constdefs" section in theory files;
11613 * "primrec" section (HOL) no longer requires names;
11615 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11619 New in Isabelle94-5
11620 -------------------
11622 * reduced space requirements;
11624 * automatic HTML generation from theories;
11626 * theory files no longer require "..." (quotes) around most types;
11628 * new examples, including two proofs of the Church-Rosser theorem;
11630 * non-curried (1994) version of HOL is no longer distributed;
11634 New in Isabelle94-4
11635 -------------------
11637 * greatly reduced space requirements;
11639 * theory files (.thy) no longer require \...\ escapes at line breaks;
11641 * searchable theorem database (see the section "Retrieving theorems" on
11642 page 8 of the Reference Manual);
11644 * new examples, including Grabczewski's monumental case study of the
11647 * The previous version of HOL renamed to Old_HOL;
11649 * The new version of HOL (previously called CHOL) uses a curried syntax
11650 for functions. Application looks like f a b instead of f(a,b);
11652 * Mutually recursive inductive definitions finally work in HOL;
11654 * In ZF, pattern-matching on tuples is now available in all abstractions and
11655 translates to the operator "split";
11659 New in Isabelle94-3
11660 -------------------
11662 * new infix operator, addss, allowing the classical reasoner to
11663 perform simplification at each step of its search. Example:
11664 fast_tac (cs addss ss)
11666 * a new logic, CHOL, the same as HOL, but with a curried syntax
11667 for functions. Application looks like f a b instead of f(a,b). Also pairs
11668 look like (a,b) instead of <a,b>;
11670 * PLEASE NOTE: CHOL will eventually replace HOL!
11672 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11673 It translates to the operator "split". A new theory of integers is available;
11675 * In ZF, integer numerals now denote two's-complement binary integers.
11676 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11678 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11679 of the Axiom of Choice;
11683 New in Isabelle94-2
11684 -------------------
11686 * Significantly faster resolution;
11688 * the different sections in a .thy file can now be mixed and repeated
11691 * Database of theorems for FOL, HOL and ZF. New
11692 commands including qed, qed_goal and bind_thm store theorems in the database.
11694 * Simple database queries: return a named theorem (get_thm) or all theorems of
11695 a given theory (thms_of), or find out what theory a theorem was proved in
11698 * Bugs fixed in the inductive definition and datatype packages;
11700 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11701 and HOL_dup_cs obsolete;
11703 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11706 * Simpler definition of function space in ZF;
11708 * new results about cardinal and ordinal arithmetic in ZF;
11710 * 'subtype' facility in HOL for introducing new types as subsets of existing
11713 :mode=isabelle-news:wrap=hard:maxLineLen=72: