1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2014 (August 2014)
5 ---------------------------------
9 * Support for official Standard ML within the Isabelle context.
10 Command 'SML_file' reads and evaluates the given Standard ML file.
11 Toplevel bindings are stored within the theory context; the initial
12 environment is restricted to the Standard ML implementation of
13 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'
14 and 'SML_export' allow to exchange toplevel bindings between the two
15 separate environments. See also ~~/src/Tools/SML/Examples.thy for
18 * More static checking of proof methods, which allows the system to
19 form a closure over the concrete syntax. Method arguments should be
20 processed in the original proof context as far as possible, before
21 operating on the goal state. In any case, the standard discipline for
22 subgoal-addressing needs to be observed: no subgoals or a subgoal
23 number that is out of range produces an empty result sequence, not an
24 exception. Potential INCOMPATIBILITY for non-conformant tactical
27 * Lexical syntax (inner and outer) supports text cartouches with
28 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
29 supports input via ` (backquote).
31 * The outer syntax categories "text" (for formal comments and document
32 markup commands) and "altstring" (for literal fact references) allow
33 cartouches as well, in addition to the traditional mix of quotations.
35 * Syntax of document antiquotation @{rail} now uses \<newline> instead
36 of "\\", to avoid the optical illusion of escaped backslash within
37 string token. General renovation of its syntax using text cartouces.
38 Minor INCOMPATIBILITY.
40 * Discontinued legacy_isub_isup, which was a temporary workaround for
41 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts
42 old identifier syntax with \<^isub> or \<^isup>. Potential
45 * Document antiquotation @{url} produces markup for the given URL,
46 which results in an active hyperlink within the text.
48 * Document antiquotation @{file_unchecked} is like @{file}, but does
49 not check existence within the file-system.
51 * Updated and extended manuals: codegen, datatypes, implementation,
52 isar-ref, jedit, system.
55 *** Prover IDE -- Isabelle/Scala/jEdit ***
57 * Improved Document panel: simplied interaction where every single
58 mouse click (re)opens document via desktop environment or as jEdit
61 * Support for Navigator plugin (with toolbar buttons), with connection
64 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
65 Open text buffers take precedence over copies within the file-system.
67 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
70 * Improved syntactic and semantic completion mechanism, with simple
71 templates, completion language context, name-space completion,
72 file-name completion, spell-checker completion.
74 * Refined GUI popup for completion: more robust key/mouse event
75 handling and propagation to enclosing text area -- avoid loosing
76 keystrokes with slow / remote graphics displays.
78 * Refined insertion of completion items wrt. jEdit text: multiple
79 selections, rectangular selections, rectangular selection as "tall
82 * Integrated spell-checker for document text, comments etc. with
83 completion popup and context-menu.
85 * More general "Query" panel supersedes "Find" panel, with GUI access
86 to commands 'find_theorems' and 'find_consts', as well as print
87 operations for the context. Minor incompatibility in keyboard
88 shortcuts etc.: replace action isabelle-find by isabelle-query.
90 * Search field for all output panels ("Output", "Query", "Info" etc.)
91 to highlight text via regular expression.
93 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
94 General") allows to specify additional print modes for the prover
95 process, without requiring old-fashioned command-line invocation of
96 "isabelle jedit -m MODE".
98 * More support for remote files (e.g. http) using standard Java
99 networking operations instead of jEdit virtual file-systems.
101 * Improved Console/Scala plugin: more uniform scala.Console output,
102 more robust treatment of threads and interrupts.
104 * Improved management of dockable windows: clarified keyboard focus
105 and window placement wrt. main editor view; optional menu item to
106 "Detach" a copy where this makes sense.
108 * New Simplifier Trace panel provides an interactive view of the
109 simplification process, enabled by the "simplifier_trace" attribute
116 * Basic constants of Pure use more conventional names and are always
117 qualified. Rare INCOMPATIBILITY, but with potentially serious
118 consequences, notably for tools in Isabelle/ML. The following
119 renaming needs to be applied:
125 dummy_pattern ~> Pure.dummy_pattern
127 Systematic porting works by using the following theory setup on a
128 *previous* Isabelle version to introduce the new name accesses for the
134 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
135 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
136 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
137 |> Sign.restore_naming thy
140 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
141 Later the application is moved to the current Isabelle version, and
142 the auxiliary aliases are deleted.
144 * Low-level type-class commands 'classes', 'classrel', 'arities' have
145 been discontinued to avoid the danger of non-trivial axiomatization
146 that is not immediately visible. INCOMPATIBILITY, use regular
147 'instance' command with proof. The required OFCLASS(...) theorem
148 might be postulated via 'axiomatization' beforehand, or the proof
149 finished trivially if the underlying class definition is made vacuous
150 (without any assumptions). See also Isabelle/ML operations
151 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
152 Axclass.arity_axiomatization.
154 * Attributes "where" and "of" allow an optional context of local
155 variables ('for' declaration): these variables become schematic in the
156 instantiated theorem.
158 * Obsolete attribute "standard" has been discontinued (legacy since
159 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
160 where instantiations with schematic variables are intended (for
161 declaration commands like 'lemmas' or attributes like "of"). The
162 following temporary definition may help to port old applications:
164 attribute_setup standard =
165 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
167 * More thorough check of proof context for goal statements and
168 attributed fact expressions (concerning background theory, declared
169 hyps). Potential INCOMPATIBILITY, tools need to observe standard
170 context discipline. See also Assumption.add_assumes and the more
171 primitive Thm.assume_hyps.
173 * Inner syntax token language allows regular quoted strings "..."
174 (only makes sense in practice, if outer syntax is delimited
175 differently, e.g. via cartouches).
177 * Code generator preprocessor: explicit control of simp tracing on a
178 per-constant basis. See attribute "code_preproc".
180 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
181 but the latter is retained some time as Proof General legacy.
186 * Qualified String.implode and String.explode. INCOMPATIBILITY.
188 * Command and antiquotation "value" are now hardcoded against nbe and
189 ML. Minor INCOMPATIBILITY.
191 * Separate command "approximate" for approximative computation in
192 src/HOL/Decision_Procs/Approximation. Minor INCOMPATIBILITY.
194 * Adjustion of INF and SUP operations:
195 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
196 - Consolidated theorem names containing INFI and SUPR: have INF and
197 SUP instead uniformly.
198 - More aggressive normalization of expressions involving INF and Inf
200 - INF_image and SUP_image do not unfold composition.
201 - Dropped facts INF_comp, SUP_comp.
202 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
203 simplifier implication in premises. Generalize and replace former
208 * Revisions to HOL/Number_Theory
209 - consolidated the proofs of the binomial theorem
210 - the function fib is again of type nat=>nat and not overloaded
211 - no more references to Old_Number_Theory in the HOL libraries (except the AFP)
215 * Swapped orientation of facts image_comp and vimage_comp:
217 image_compose ~> image_comp [symmetric]
218 image_comp ~> image_comp [symmetric]
219 vimage_compose ~> vimage_comp [symmetric]
220 vimage_comp ~> vimage_comp [symmetric]
224 * Simplifier: Enhanced solver of preconditions of rewrite rules can
225 now deal with conjunctions. For help with converting proofs, the old
226 behaviour of the simplifier can be restored like this: declare/using
227 [[simp_legacy_precond]]. This configuration option will disappear
228 again in the future. INCOMPATIBILITY.
231 - Abandoned fact collection "word_arith_alts", which is a duplicate
233 - Dropped first (duplicated) element in fact collections
234 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
235 "uint_word_arith_bintrs".
237 * Code generator: enforce case of identifiers only for strict target
238 language requirements. INCOMPATIBILITY.
240 * Code generator: explicit proof contexts in many ML interfaces.
243 * Code generator: minimize exported identifiers by default. Minor
246 * Code generation for SML and OCaml: dropped arcane "no_signatures"
247 option. Minor INCOMPATIBILITY.
249 * Simproc "finite_Collect" is no longer enabled by default, due to
250 spurious crashes and other surprises. Potential INCOMPATIBILITY.
252 * Moved new (co)datatype package and its dependencies from session
253 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
254 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
255 part of theory "Main".
258 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
259 Library/Wfrec.thy ~> Wfrec.thy
260 Library/Zorn.thy ~> Zorn.thy
261 Cardinals/Order_Relation.thy ~> Order_Relation.thy
262 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
263 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
264 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
265 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
266 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
267 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
268 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
269 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
270 BNF/BNF_Comp.thy ~> BNF_Comp.thy
271 BNF/BNF_Def.thy ~> BNF_Def.thy
272 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
273 BNF/BNF_GFP.thy ~> BNF_GFP.thy
274 BNF/BNF_LFP.thy ~> BNF_LFP.thy
275 BNF/BNF_Util.thy ~> BNF_Util.thy
276 BNF/Coinduction.thy ~> Coinduction.thy
277 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
278 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
279 BNF/Examples/* ~> BNF_Examples/*
282 Wellorder_Extension.thy (split from Zorn.thy)
283 Library/Cardinal_Notations.thy
284 Library/BNF_Axomatization.thy
285 BNF_Examples/Misc_Primcorec.thy
286 BNF_Examples/Stream_Processor.thy
288 Discontinued theories:
290 BNF/Equiv_Relations_More.thy
294 * New (co)datatype package:
295 - Command 'primcorec' is fully implemented.
296 - Command 'datatype_new' generates size functions ("size_xxx" and
297 "size") as required by 'fun'.
298 - BNFs are integrated with the Lifting tool and new-style
299 (co)datatypes with Transfer.
301 datatype_new_compat ~> datatype_compat
302 primrec_new ~> primrec
303 wrap_free_constructors ~> free_constructors
305 - The generated constants "xxx_case" and "xxx_rec" have been renamed
306 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
308 - The constant "xxx_(un)fold" and related theorems are no longer
309 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
312 - No discriminators are generated for nullary constructors by
313 default, eliminating the need for the odd "=:" syntax.
315 - No discriminators or selectors are generated by default by
316 "datatype_new", unless custom names are specified or the new
317 "discs_sels" option is passed.
320 * Old datatype package:
321 - The generated theorems "xxx.cases" and "xxx.recs" have been
322 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
323 "sum.case"). INCOMPATIBILITY.
324 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
325 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
326 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
328 * The types "'a list" and "'a option", their set and map functions,
329 their relators, and their selectors are now produced using the new
330 BNF-based datatype package.
333 Option.set ~> set_option
334 Option.map ~> map_option
335 option_rel ~> rel_option
338 set_def ~> set_rec[abs_def]
339 map_def ~> map_rec[abs_def]
340 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
341 option.recs ~> option.rec
342 list_all2_def ~> list_all2_iff
343 set.simps ~> set_simps (or the slightly different "list.set")
344 map.simps ~> list.map
345 hd.simps ~> list.sel(1)
346 tl.simps ~> list.sel(2-3)
347 the.simps ~> option.sel
351 * The following map functions and relators have been renamed:
358 filter_rel ~> rel_filter
359 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
360 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
361 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
365 * New theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
367 * New theory src/HOL/Library/Tree.thy.
369 * Theory reorganization:
370 Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
372 * Consolidated some facts about big group operators:
374 setsum_0' ~> setsum.neutral
375 setsum_0 ~> setsum.neutral_const
376 setsum_addf ~> setsum.distrib
377 setsum_cartesian_product ~> setsum.cartesian_product
378 setsum_cases ~> setsum.If_cases
379 setsum_commute ~> setsum.commute
380 setsum_cong ~> setsum.cong
381 setsum_delta ~> setsum.delta
382 setsum_delta' ~> setsum.delta'
383 setsum_diff1' ~> setsum.remove
384 setsum_empty ~> setsum.empty
385 setsum_infinite ~> setsum.infinite
386 setsum_insert ~> setsum.insert
387 setsum_inter_restrict'' ~> setsum.inter_filter
388 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
389 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
390 setsum_mono_zero_left ~> setsum.mono_neutral_left
391 setsum_mono_zero_right ~> setsum.mono_neutral_right
392 setsum_reindex ~> setsum.reindex
393 setsum_reindex_cong ~> setsum.reindex_cong
394 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
395 setsum_restrict_set ~> setsum.inter_restrict
396 setsum_Plus ~> setsum.Plus
397 setsum_setsum_restrict ~> setsum.commute_restrict
398 setsum_Sigma ~> setsum.Sigma
399 setsum_subset_diff ~> setsum.subset_diff
400 setsum_Un_disjoint ~> setsum.union_disjoint
401 setsum_UN_disjoint ~> setsum.UNION_disjoint
402 setsum_Un_Int ~> setsum.union_inter
403 setsum_Union_disjoint ~> setsum.Union_disjoint
404 setsum_UNION_zero ~> setsum.Union_comp
405 setsum_Un_zero ~> setsum.union_inter_neutral
406 strong_setprod_cong ~> setprod.strong_cong
407 strong_setsum_cong ~> setsum.strong_cong
408 setprod_1' ~> setprod.neutral
409 setprod_1 ~> setprod.neutral_const
410 setprod_cartesian_product ~> setprod.cartesian_product
411 setprod_cong ~> setprod.cong
412 setprod_delta ~> setprod.delta
413 setprod_delta' ~> setprod.delta'
414 setprod_empty ~> setprod.empty
415 setprod_infinite ~> setprod.infinite
416 setprod_insert ~> setprod.insert
417 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
418 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
419 setprod_mono_one_left ~> setprod.mono_neutral_left
420 setprod_mono_one_right ~> setprod.mono_neutral_right
421 setprod_reindex ~> setprod.reindex
422 setprod_reindex_cong ~> setprod.reindex_cong
423 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
424 setprod_Sigma ~> setprod.Sigma
425 setprod_subset_diff ~> setprod.subset_diff
426 setprod_timesf ~> setprod.distrib
427 setprod_Un2 ~> setprod.union_diff2
428 setprod_Un_disjoint ~> setprod.union_disjoint
429 setprod_UN_disjoint ~> setprod.UNION_disjoint
430 setprod_Un_Int ~> setprod.union_inter
431 setprod_Union_disjoint ~> setprod.Union_disjoint
432 setprod_Un_one ~> setprod.union_inter_neutral
434 Dropped setsum_cong2 (simple variant of setsum.cong).
435 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
436 Dropped setsum_reindex_id, setprod_reindex_id
437 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
441 * New internal SAT solver "cdclite" that produces models and proof
442 traces. This solver replaces the internal SAT solvers "enumerate" and
443 "dpll". Applications that explicitly used one of these two SAT
444 solvers should use "cdclite" instead. In addition, "cdclite" is now
445 the default SAT solver for the "sat" and "satx" proof methods and
446 corresponding tactics; the old default can be restored using "declare
447 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
449 * SMT module: A new version of the SMT module, temporarily called
450 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
451 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
452 supported as oracles. Yices is no longer supported, because no version
453 of the solver can handle both SMT-LIB 2 and quantifiers.
456 - Z3 can now produce Isar proofs.
458 . New SML-based learning engines eliminate the dependency on
459 Python and increase performance and reliability.
460 . MaSh and MeSh are now used by default together with the
461 traditional MePo (Meng-Paulson) relevance filter. To disable
462 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
463 Options / Isabelle / General to "none".
467 isar_compress ~> compress
472 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
473 (full_types)' instead. INCOMPATIBILITY.
475 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
477 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
479 * The symbol "\<newline>" may be used within char or string literals
480 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
482 * Activation of Z3 now works via "z3_non_commercial" system option
483 (without requiring restart), instead of former settings variable
484 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
485 Plugin Options / Isabelle / General.
487 * "declare [[code abort: ...]]" replaces "code_abort ...".
490 * "declare [[code drop: ...]]" drops all code equations associated
491 with the given constants.
493 * Abolished slightly odd global lattice interpretation for min/max.
496 min_max.inf_assoc ~> min.assoc
497 min_max.inf_commute ~> min.commute
498 min_max.inf_left_commute ~> min.left_commute
499 min_max.inf_idem ~> min.idem
500 min_max.inf_left_idem ~> min.left_idem
501 min_max.inf_right_idem ~> min.right_idem
502 min_max.sup_assoc ~> max.assoc
503 min_max.sup_commute ~> max.commute
504 min_max.sup_left_commute ~> max.left_commute
505 min_max.sup_idem ~> max.idem
506 min_max.sup_left_idem ~> max.left_idem
507 min_max.sup_inf_distrib1 ~> max_min_distrib2
508 min_max.sup_inf_distrib2 ~> max_min_distrib1
509 min_max.inf_sup_distrib1 ~> min_max_distrib2
510 min_max.inf_sup_distrib2 ~> min_max_distrib1
511 min_max.distrib ~> min_max_distribs
512 min_max.inf_absorb1 ~> min.absorb1
513 min_max.inf_absorb2 ~> min.absorb2
514 min_max.sup_absorb1 ~> max.absorb1
515 min_max.sup_absorb2 ~> max.absorb2
516 min_max.le_iff_inf ~> min.absorb_iff1
517 min_max.le_iff_sup ~> max.absorb_iff2
518 min_max.inf_le1 ~> min.cobounded1
519 min_max.inf_le2 ~> min.cobounded2
520 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
521 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
522 min_max.le_infI1 ~> min.coboundedI1
523 min_max.le_infI2 ~> min.coboundedI2
524 min_max.le_supI1 ~> max.coboundedI1
525 min_max.le_supI2 ~> max.coboundedI2
526 min_max.less_infI1 ~> min.strict_coboundedI1
527 min_max.less_infI2 ~> min.strict_coboundedI2
528 min_max.less_supI1 ~> max.strict_coboundedI1
529 min_max.less_supI2 ~> max.strict_coboundedI2
530 min_max.inf_mono ~> min.mono
531 min_max.sup_mono ~> max.mono
532 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
533 min_max.le_supI, min_max.sup_least ~> max.boundedI
534 min_max.le_inf_iff ~> min.bounded_iff
535 min_max.le_sup_iff ~> max.bounded_iff
537 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
538 min.left_commute, min.left_idem, max.commute, max.assoc,
539 max.left_commute, max.left_idem directly.
541 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
542 min.cobounded2, max.cobounded1m max.cobounded2 directly.
544 For min_ac or max_ac, prefer more general collection ac_simps.
548 * HOL-Word: bit representations prefer type bool over type bit.
551 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
552 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
554 * Code generations are provided for make, fields, extend and truncate
555 operations on records.
557 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
560 * Fact generalization and consolidation:
561 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
565 * Purely algebraic definition of even. Fact generalization and
567 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
568 even_zero_(nat|int) ~> even_zero
572 * Abolished neg_numeral.
573 - Canonical representation for minus one is "- 1".
574 - Canonical representation for other negative numbers is "- (numeral _)".
575 - When devising rule sets for number calculation, consider the
576 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
577 - HOLogic.dest_number also recognizes numerals in non-canonical forms
578 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
579 - Syntax for negative numerals is mere input syntax.
583 * Elimination of fact duplicates:
584 equals_zero_I ~> minus_unique
585 diff_eq_0_iff_eq ~> right_minus_eq
586 nat_infinite ~> infinite_UNIV_nat
587 int_infinite ~> infinite_UNIV_int
591 * Fact name consolidation:
592 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
593 minus_le_self_iff ~> neg_less_eq_nonneg
594 le_minus_self_iff ~> less_eq_neg_nonpos
595 neg_less_nonneg ~> neg_less_pos
596 less_minus_self_iff ~> less_neg_neg [simp]
600 * More simplification rules on unary and binary minus:
601 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
602 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
603 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
604 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
605 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
606 been taken away from fact collections algebra_simps and field_simps.
609 To restore proofs, the following patterns are helpful:
611 a) Arbitrary failing proof not involving "diff_def":
612 Consider simplification with algebra_simps or field_simps.
614 b) Lifting rules from addition to subtraction:
615 Try with "using <rule for addition> of [... "- _" ...]" by simp".
617 c) Simplification with "diff_def": just drop "diff_def".
618 Consider simplification with algebra_simps or field_simps;
619 or the brute way with
620 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
622 * SUP and INF generalized to conditionally_complete_lattice.
624 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
625 Conditionally_Complete_Lattices. INCOMPATIBILITY.
627 * Introduce bdd_above and bdd_below in theory
628 Conditionally_Complete_Lattices, use them instead of explicitly
629 stating boundedness of sets.
631 * ccpo.admissible quantifies only over non-empty chains to allow more
632 syntax-directed proof rules; the case of the empty chain shows up as
633 additional case in fixpoint induction proofs. INCOMPATIBILITY.
635 * Removed and renamed theorems in Series:
636 summable_le ~> suminf_le
637 suminf_le ~> suminf_le_const
638 series_pos_le ~> setsum_le_suminf
639 series_pos_less ~> setsum_less_suminf
640 suminf_ge_zero ~> suminf_nonneg
641 suminf_gt_zero ~> suminf_pos
642 suminf_gt_zero_iff ~> suminf_pos_iff
643 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
644 suminf_0_le ~> suminf_nonneg [rotate]
645 pos_summable ~> summableI_nonneg_bounded
646 ratio_test ~> summable_ratio_test
648 removed series_zero, replaced by sums_finite
650 removed auxiliary lemmas:
652 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
653 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
654 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
655 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
656 summable_convergent_sumr_iff, sumr_diff_mult_const
660 * Replace (F)DERIV syntax by has_derivative:
661 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
663 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
665 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
667 - removed constant isDiff
669 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
672 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
674 - Renamed FDERIV_... lemmas to has_derivative_...
676 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
678 - removed DERIV_intros, has_derivative_eq_intros
680 - introduced derivative_intros and deriative_eq_intros which
681 includes now rules for DERIV, has_derivative and
682 has_vector_derivative.
685 differentiable_def ~> real_differentiable_def
686 differentiableE ~> real_differentiableE
687 fderiv_def ~> has_derivative_at
688 field_fderiv_def ~> field_has_derivative_at
689 isDiff_der ~> differentiable_def
690 deriv_fderiv ~> has_field_derivative_def
691 deriv_def ~> DERIV_def
695 * Include more theorems in continuous_intros. Remove the
696 continuous_on_intros, isCont_intros collections, these facts are now
697 in continuous_intros.
699 * Theorems about complex numbers are now stated only using Re and Im,
700 the Complex constructor is not used anymore. It is possible to use
701 primcorec to defined the behaviour of a complex-valued function.
703 Removed theorems about the Complex constructor from the simpset, they
704 are available as the lemma collection legacy_Complex_simps. This
707 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
709 Instead the reverse direction is supported with
710 Complex_eq: "Complex a b = a + \<i> * b"
712 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
716 complex_Re/Im_zero ~> zero_complex.sel
717 complex_Re/Im_add ~> plus_complex.sel
718 complex_Re/Im_minus ~> uminus_complex.sel
719 complex_Re/Im_diff ~> minus_complex.sel
720 complex_Re/Im_one ~> one_complex.sel
721 complex_Re/Im_mult ~> times_complex.sel
722 complex_Re/Im_inverse ~> inverse_complex.sel
723 complex_Re/Im_scaleR ~> scaleR_complex.sel
724 complex_Re/Im_i ~> ii.sel
725 complex_Re/Im_cnj ~> cnj.sel
728 complex_divide_def ~> divide_complex_def
729 complex_norm_def ~> norm_complex_def
730 cmod_def ~> norm_complex_de
744 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
747 - Fixed soundness bug whereby mutually recursive datatypes could
748 take infinite values.
749 - Fixed soundness bug with low-level number functions such as
750 "Abs_Integ" and "Rep_Integ".
751 - Removed "std" option.
752 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
755 * HOL-Multivariate_Analysis:
756 - Type class ordered_real_vector for ordered vector spaces.
757 - New theory Complex_Basic_Analysis defining complex derivatives,
758 holomorphic functions, etc., ported from HOL Light's canal.ml.
759 - Changed order of ordered_euclidean_space to be compatible with
760 pointwise ordering on products. Therefore instance of
761 conditionally_complete_lattice and ordered_real_vector.
762 INCOMPATIBILITY: use box instead of greaterThanLessThan or
763 explicit set-comprehensions with eucl_less for other (half-)open
766 derivative_linear ~> has_derivative_bounded_linear
767 derivative_is_linear ~> has_derivative_linear
768 bounded_linear_imp_linear ~> bounded_linear.linear
771 - replaced the Lebesgue integral on real numbers by the more general
772 Bochner integral for functions into a real-normed vector space.
774 integral_zero ~> integral_zero / integrable_zero
775 integral_minus ~> integral_minus / integrable_minus
776 integral_add ~> integral_add / integrable_add
777 integral_diff ~> integral_diff / integrable_diff
778 integral_setsum ~> integral_setsum / integrable_setsum
779 integral_multc ~> integral_mult_left / integrable_mult_left
780 integral_cmult ~> integral_mult_right / integrable_mult_right
781 integral_triangle_inequality~> integral_norm_bound
782 integrable_nonneg ~> integrableI_nonneg
783 integral_positive ~> integral_nonneg_AE
784 integrable_abs_iff ~> integrable_abs_cancel
785 positive_integral_lim_INF ~> positive_integral_liminf
786 lebesgue_real_affine ~> lborel_real_affine
787 borel_integral_has_integral ~> has_integral_lebesgue_integral
788 integral_indicator ~>
789 integral_real_indicator / integrable_real_indicator
790 positive_integral_fst ~> positive_integral_fst'
791 positive_integral_fst_measurable ~> positive_integral_fst
792 positive_integral_snd_measurable ~> positive_integral_snd
794 integrable_fst_measurable ~>
795 integral_fst / integrable_fst / AE_integrable_fst
797 integrable_snd_measurable ~>
798 integral_snd / integrable_snd / AE_integrable_snd
800 integral_monotone_convergence ~>
801 integral_monotone_convergence / integrable_monotone_convergence
803 integral_monotone_convergence_at_top ~>
804 integral_monotone_convergence_at_top /
805 integrable_monotone_convergence_at_top
807 has_integral_iff_positive_integral_lebesgue ~>
808 has_integral_iff_has_bochner_integral_lebesgue_nonneg
810 lebesgue_integral_has_integral ~>
811 has_integral_integrable_lebesgue_nonneg
813 positive_integral_lebesgue_has_integral ~>
814 integral_has_integral_lebesgue_nonneg /
815 integrable_has_integral_lebesgue_nonneg
817 lebesgue_integral_real_affine ~>
818 positive_integral_real_affine
820 has_integral_iff_positive_integral_lborel ~>
821 integral_has_integral_nonneg / integrable_has_integral_nonneg
823 The following theorems where removed:
825 lebesgue_integral_nonneg
826 lebesgue_integral_uminus
827 lebesgue_integral_cmult
828 lebesgue_integral_multc
829 lebesgue_integral_cmult_nonneg
830 integral_cmul_indicator
833 - Renamed positive_integral to nn_integral:
835 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
836 positive_integral_positive ~> nn_integral_nonneg
838 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
840 - Formalized properties about exponentially, Erlang, and normal
841 distributed random variables.
843 * Removed theory src/HOL/Library/Kleene_Algebra.thy; it is subsumed by
844 session Kleene_Algebra in AFP.
849 * The signature and semantics of Document.Snapshot.cumulate_markup /
850 select_markup have been clarified. Markup is now traversed in the
851 order of reports given by the prover: later markup is usually more
852 specific and may override results accumulated so far. The elements
853 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
855 * Substantial reworking of internal PIDE protocol communication
856 channels. INCOMPATIBILITY.
861 * Moved ML_Compiler.exn_trace and other operations on exceptions to
862 structure Runtime. Minor INCOMPATIBILITY.
864 * Discontinued old Toplevel.debug in favour of system option
865 "ML_exception_trace", which may be also declared within the context
866 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
868 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
871 * Configuration option "ML_print_depth" controls the pretty-printing
872 depth of the ML compiler within the context. The old print_depth in
873 ML is still available as default_print_depth, but rarely used. Minor
876 * Proper context discipline for read_instantiate and instantiate_tac:
877 variables that are meant to become schematic need to be given as
878 fixed, and are generalized by the explicit context of local variables.
879 This corresponds to Isar attributes "where" and "of" with 'for'
880 declaration. INCOMPATIBILITY, also due to potential change of indices
881 of schematic variables.
883 * Toplevel function "use" refers to raw ML bootstrap environment,
884 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
885 Note that 'ML_file' is the canonical command to load ML files into the
888 * Proper context for basic Simplifier operations: rewrite_rule,
889 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
890 pass runtime Proof.context (and ensure that the simplified entity
891 actually belongs to it).
893 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
894 compared (according to Thm.thm_ord), but assumed to be covered by the
895 current background theory. Thus equivalent data produced in different
896 branches of the theory graph usually coincides (e.g. relevant for
897 theory merge). Note that the softer Thm.eq_thm_prop is often more
898 appropriate than Thm.eq_thm.
900 * Simplified programming interface to define ML antiquotations, see
901 structure ML_Antiquotation. Minor INCOMPATIBILITY.
903 * ML antiquotation @{here} refers to its source position, which is
904 occasionally useful for experimentation and diagnostic purposes.
906 * ML antiquotation @{path} produces a Path.T value, similarly to
907 Path.explode, but with compile-time check against the file-system and
908 some PIDE markup. Note that unlike theory source, ML does not have a
909 well-defined master directory, so an absolute symbolic path
910 specification is usually required, e.g. "~~/src/HOL".
912 * ML antiquotation @{print} inlines a function to print an arbitrary
913 ML value, which is occasionally useful for diagnostic or demonstration
919 * Proof General with its traditional helper scripts is now an optional
920 Isabelle component, e.g. ProofGeneral-4.2-2 from the Isabelle
921 component repository http://isabelle.in.tum.de/components/. See also
922 the "system" manual for general explanations about add-on components,
923 notably those that are not bundled with the normal release.
925 * The raw Isabelle process executable has been renamed from
926 "isabelle-process" to "isabelle_process", which conforms to common
927 shell naming conventions, and allows to define a shell function within
928 the Isabelle environment to avoid dynamic path lookup. Rare
929 incompatibility for old tools that do not use the $ISABELLE_PROCESS
930 settings variable yet.
932 * Former "isabelle tty" has been superseded by "isabelle console",
933 with implicit build like "isabelle jedit", and without the mostly
934 obsolete Isar TTY loop.
936 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
937 and PDF_VIEWER now refer to the actual programs, not shell
938 command-lines. Discontinued option -c: invocation may be asynchronous
939 via desktop environment, without any special precautions. Potential
940 INCOMPATIBILITY with ambitious private settings.
942 * Removed obsolete "isabelle unsymbolize". Note that the usual format
943 for email communication is the Unicode rendering of Isabelle symbols,
944 as produced by Isabelle/jEdit, for example.
946 * Removed obsolete tool "wwwfind". Similar functionality may be
947 integrated into Isabelle/jEdit eventually.
949 * Improved 'display_drafts' concerning desktop integration and
950 repeated invocation in PIDE front-end: re-use single file
951 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
953 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
954 of TeX Live from Cygwin.
956 * Session ROOT specifications require explicit 'document_files' for
957 robust dependencies on LaTeX sources. Only these explicitly given
958 files are copied to the document output directory, before document
959 processing is started.
963 New in Isabelle2013-2 (December 2013)
964 -------------------------------------
966 *** Prover IDE -- Isabelle/Scala/jEdit ***
968 * More robust editing of running commands with internal forks,
969 e.g. non-terminating 'by' steps.
971 * More relaxed Sledgehammer panel: avoid repeated application of query
972 after edits surrounding the command location.
974 * More status information about commands that are interrupted
975 accidentally (via physical event or Poly/ML runtime system signal,
981 * More robust termination of external processes managed by
982 Isabelle/ML: support cancellation of tasks within the range of
983 milliseconds, as required for PIDE document editing with automatically
984 tried tools (e.g. Sledgehammer).
986 * Reactivated Isabelle/Scala kill command for external processes on
987 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
988 workaround for some Debian/Ubuntu Linux versions from 2013.
992 New in Isabelle2013-1 (November 2013)
993 -------------------------------------
997 * Discontinued obsolete 'uses' within theory header. Note that
998 commands like 'ML_file' work without separate declaration of file
999 dependencies. Minor INCOMPATIBILITY.
1001 * Discontinued redundant 'use' command, which was superseded by
1002 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1004 * Simplified subscripts within identifiers, using plain \<^sub>
1005 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1006 only for literal tokens within notation; explicit mixfix annotations
1007 for consts or fixed variables may be used as fall-back for unusual
1008 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1009 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1010 standardize symbols as a starting point for further manual cleanup.
1011 The ML reference variable "legacy_isub_isup" may be set as temporary
1012 workaround, to make the prover accept a subset of the old identifier
1015 * Document antiquotations: term style "isub" has been renamed to
1016 "sub". Minor INCOMPATIBILITY.
1018 * Uniform management of "quick_and_dirty" as system option (see also
1019 "isabelle options"), configuration option within the context (see also
1020 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1021 INCOMPATIBILITY, need to use more official Isabelle means to access
1022 quick_and_dirty, instead of historical poking into mutable reference.
1024 * Renamed command 'print_configs' to 'print_options'. Minor
1027 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1028 implicit change of some global references) is retained for now as
1029 control command, e.g. for ProofGeneral 3.7.x.
1031 * Discontinued 'print_drafts' command with its old-fashioned PS output
1032 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1033 'display_drafts' instead and print via the regular document viewer.
1035 * Updated and extended "isar-ref" and "implementation" manual,
1036 eliminated old "ref" manual.
1039 *** Prover IDE -- Isabelle/Scala/jEdit ***
1041 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1042 Documentation panel.
1044 * Dockable window "Documentation" provides access to Isabelle
1047 * Dockable window "Find" provides query operations for formal entities
1048 (GUI front-end to 'find_theorems' command).
1050 * Dockable window "Sledgehammer" manages asynchronous / parallel
1051 sledgehammer runs over existing document sources, independently of
1052 normal editing and checking process.
1054 * Dockable window "Timing" provides an overview of relevant command
1055 timing information, depending on option jedit_timing_threshold. The
1056 same timing information is shown in the extended tooltip of the
1057 command keyword, when hovering the mouse over it while the CONTROL or
1058 COMMAND modifier is pressed.
1060 * Improved dockable window "Theories": Continuous checking of proof
1061 document (visible and required parts) may be controlled explicitly,
1062 using check box or shortcut "C+e ENTER". Individual theory nodes may
1063 be marked explicitly as required and checked in full, using check box
1064 or shortcut "C+e SPACE".
1066 * Improved completion mechanism, which is now managed by the
1067 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1068 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1070 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1071 isabelle.complete for explicit completion in Isabelle sources.
1072 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1073 to resolve conflict.
1075 * Improved support of various "minor modes" for Isabelle NEWS,
1076 options, session ROOT etc., with completion and SideKick tree view.
1078 * Strictly monotonic document update, without premature cancellation of
1079 running transactions that are still needed: avoid reset/restart of
1080 such command executions while editing.
1082 * Support for asynchronous print functions, as overlay to existing
1085 * Support for automatic tools in HOL, which try to prove or disprove
1086 toplevel theorem statements.
1088 * Action isabelle.reset-font-size resets main text area font size
1089 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1090 also "Plugin Options / Isabelle / General"). It can be bound to some
1091 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1093 * File specifications in jEdit (e.g. file browser) may refer to
1094 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1095 obsolete $ISABELLE_HOME_WINDOWS variable.
1097 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1098 / Global Options / Appearance".
1100 * Improved support of native Mac OS X functionality via "MacOSX"
1101 plugin, which is now enabled by default.
1106 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1107 In particular, 'interpretation' allows for non-persistent
1108 interpretation within "context ... begin ... end" blocks offering a
1109 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1112 * Improved locales diagnostic command 'print_dependencies'.
1114 * Discontinued obsolete 'axioms' command, which has been marked as
1115 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1116 instead, while observing its uniform scope for polymorphism.
1118 * Discontinued empty name bindings in 'axiomatization'.
1121 * System option "proofs" has been discontinued. Instead the global
1122 state of Proofterm.proofs is persistently compiled into logic images
1123 as required, notably HOL-Proofs. Users no longer need to change
1124 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1126 * Syntax translation functions (print_translation etc.) always depend
1127 on Proof.context. Discontinued former "(advanced)" option -- this is
1128 now the default. Minor INCOMPATIBILITY.
1130 * Former global reference trace_unify_fail is now available as
1131 configuration option "unify_trace_failure" (global context only).
1133 * SELECT_GOAL now retains the syntactic context of the overall goal
1134 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1140 * Stronger precedence of syntax for big intersection and union on
1141 sets, in accordance with corresponding lattice operations.
1144 * Notation "{p:A. P}" now allows tuple patterns as well.
1146 * Nested case expressions are now translated in a separate check phase
1147 rather than during parsing. The data for case combinators is separated
1148 from the datatype package. The declaration attribute
1149 "case_translation" can be used to register new case combinators:
1151 declare [[case_translation case_combinator constructor1 ... constructorN]]
1154 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1156 - 'code_identifier' declares name hints for arbitrary identifiers in
1157 generated code, subsuming 'code_modulename'.
1159 See the isar-ref manual for syntax diagrams, and the HOL theories for
1162 * Attibute 'code': 'code' now declares concrete and abstract code
1163 equations uniformly. Use explicit 'code equation' and 'code abstract'
1164 to distinguish both when desired.
1166 * Discontinued theories Code_Integer and Efficient_Nat by a more
1167 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1168 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1169 generation for details. INCOMPATIBILITY.
1171 * Numeric types are mapped by default to target language numerals:
1172 natural (replaces former code_numeral) and integer (replaces former
1173 code_int). Conversions are available as integer_of_natural /
1174 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1175 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1176 ML). INCOMPATIBILITY.
1178 * Function package: For mutually recursive functions f and g, separate
1179 cases rules f.cases and g.cases are generated instead of unusable
1180 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1181 in the case that the unusable rule was used nevertheless.
1183 * Function package: For each function f, new rules f.elims are
1184 generated, which eliminate equalities of the form "f x = t".
1186 * New command 'fun_cases' derives ad-hoc elimination rules for
1187 function equations as simplified instances of f.elims, analogous to
1188 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1191 - parametrized correspondence relations are now supported:
1192 + parametricity theorems for the raw term can be specified in
1193 the command lift_definition, which allow us to generate stronger
1195 + setup_lifting generates stronger transfer rules if parametric
1196 correspondence relation can be generated
1197 + various new properties of the relator must be specified to support
1199 + parametricity theorem for the Quotient relation can be specified
1200 - setup_lifting generates domain rules for the Transfer package
1201 - stronger reflexivity prover of respectfulness theorems for type
1203 - ===> and --> are now local. The symbols can be introduced
1204 by interpreting the locale lifting_syntax (typically in an
1206 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1207 Main. Potential INCOMPATIBILITY
1208 - new commands for restoring and deleting Lifting/Transfer context:
1209 lifting_forget, lifting_update
1210 - the command print_quotmaps was renamed to print_quot_maps.
1214 - better support for domains in Transfer: replace Domainp T
1215 by the actual invariant in a transferred goal
1216 - transfer rules can have as assumptions other transfer rules
1217 - Experimental support for transferring from the raw level to the
1218 abstract level: Transfer.transferred attribute
1219 - Attribute version of the transfer method: untransferred attribute
1221 * Reification and reflection:
1222 - Reification is now directly available in HOL-Main in structure
1224 - Reflection now handles multiple lists with variables also.
1225 - The whole reflection stack has been decomposed into conversions.
1228 * Revised devices for recursive definitions over finite sets:
1229 - Only one fundamental fold combinator on finite set remains:
1230 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1231 This is now identity on infinite sets.
1232 - Locales ("mini packages") for fundamental definitions with
1233 Finite_Set.fold: folding, folding_idem.
1234 - Locales comm_monoid_set, semilattice_order_set and
1235 semilattice_neutr_order_set for big operators on sets.
1236 See theory Big_Operators for canonical examples.
1237 Note that foundational constants comm_monoid_set.F and
1238 semilattice_set.F correspond to former combinators fold_image
1239 and fold1 respectively. These are now gone. You may use
1240 those foundational constants as substitutes, but it is
1241 preferable to interpret the above locales accordingly.
1242 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1243 no longer needed in connection with Finite_Set.fold etc.)
1245 card.union_inter ~> card_Un_Int [symmetric]
1246 card.union_disjoint ~> card_Un_disjoint
1249 * Locale hierarchy for abstract orderings and (semi)lattices.
1251 * Complete_Partial_Order.admissible is defined outside the type class
1252 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1253 class predicate assumption or sort constraint when possible.
1256 * Introduce type class "conditionally_complete_lattice": Like a
1257 complete lattice but does not assume the existence of the top and
1258 bottom elements. Allows to generalize some lemmas about reals and
1259 extended reals. Removed SupInf and replaced it by the instantiation
1260 of conditionally_complete_lattice for real. Renamed lemmas about
1261 conditionally-complete lattice from Sup_... to cSup_... and from
1262 Inf_... to cInf_... to avoid hidding of similar complete lattice
1265 * Introduce type class linear_continuum as combination of
1266 conditionally-complete lattices and inner dense linorders which have
1267 more than one element. INCOMPATIBILITY.
1269 * Introduced type classes order_top and order_bot. The old classes top
1270 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1271 Rename bot -> order_bot, top -> order_top
1273 * Introduce type classes "no_top" and "no_bot" for orderings without
1274 top and bottom elements.
1276 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1278 * Complex_Main: Unify and move various concepts from
1279 HOL-Multivariate_Analysis to HOL-Complex_Main.
1281 - Introduce type class (lin)order_topology and
1282 linear_continuum_topology. Allows to generalize theorems about
1283 limits and order. Instances are reals and extended reals.
1285 - continuous and continuos_on from Multivariate_Analysis:
1286 "continuous" is the continuity of a function at a filter. "isCont"
1287 is now an abbrevitation: "isCont x f == continuous (at _) f".
1289 Generalized continuity lemmas from isCont to continuous on an
1292 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1293 compactness of closed intervals on reals. Continuous functions
1294 attain infimum and supremum on compact sets. The inverse of a
1295 continuous function is continuous, when the function is continuous
1298 - connected from Multivariate_Analysis. Use it to prove the
1299 intermediate value theorem. Show connectedness of intervals on
1300 linear_continuum_topology).
1302 - first_countable_topology from Multivariate_Analysis. Is used to
1303 show equivalence of properties on the neighbourhood filter of x and
1304 on all sequences converging to x.
1306 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1307 theorems from Library/FDERIV.thy to Deriv.thy and base the
1308 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1309 which are restricted to sets, i.e. to represent derivatives from
1312 - Removed the within-filter. It is replaced by the principal filter:
1314 F within X = inf F (principal X)
1316 - Introduce "at x within U" as a single constant, "at x" is now an
1317 abbreviation for "at x within UNIV"
1319 - Introduce named theorem collections tendsto_intros,
1320 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1321 in tendsto_intros (or FDERIV_intros) are also available as
1322 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1323 is replaced by a congruence rule. This allows to apply them as
1324 intro rules and then proving equivalence by the simplifier.
1326 - Restructured theories in HOL-Complex_Main:
1328 + Moved RealDef and RComplete into Real
1330 + Introduced Topological_Spaces and moved theorems about
1331 topological spaces, filters, limits and continuity to it
1333 + Renamed RealVector to Real_Vector_Spaces
1335 + Split Lim, SEQ, Series into Topological_Spaces,
1336 Real_Vector_Spaces, and Limits
1338 + Moved Ln and Log to Transcendental
1340 + Moved theorems about continuity from Deriv to Topological_Spaces
1342 - Remove various auxiliary lemmas.
1347 - Added option "spy".
1348 - Reduce incidence of "too high arity" errors.
1352 isar_shrink ~> isar_compress
1354 - Added options "isar_try0", "spy".
1355 - Better support for "isar_proofs".
1356 - MaSh has been fined-tuned and now runs as a local server.
1358 * Improved support for ad hoc overloading of constants (see also
1359 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1361 * Library/Polynomial.thy:
1362 - Use lifting for primitive definitions.
1363 - Explicit conversions from and to lists of coefficients, used for
1365 - Replaced recursion operator poly_rec by fold_coeffs.
1366 - Prefer pre-existing gcd operation for gcd.
1368 poly_eq_iff ~> poly_eq_poly_eq_iff
1369 poly_ext ~> poly_eqI
1370 expand_poly_eq ~> poly_eq_iff
1373 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1374 case_of_simps to convert function definitions between a list of
1375 equations with patterns on the lhs and a single equation with case
1376 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1378 * New Library/FSet.thy: type of finite sets defined as a subtype of
1379 sets defined by Lifting/Transfer.
1381 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1383 * Consolidation of library theories on product orders:
1385 Product_Lattice ~> Product_Order -- pointwise order on products
1386 Product_ord ~> Product_Lexorder -- lexicographic order on products
1390 * Imperative-HOL: The MREC combinator is considered legacy and no
1391 longer included by default. INCOMPATIBILITY, use partial_function
1392 instead, or import theory Legacy_Mrec as a fallback.
1394 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1395 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1396 ~~/src/HOL/Library/Polynomial instead. The latter provides
1397 integration with HOL's type classes for rings. INCOMPATIBILITY.
1400 - Various improvements to BNF-based (co)datatype package, including
1401 new commands "primrec_new", "primcorec", and
1402 "datatype_new_compat", as well as documentation. See
1403 "datatypes.pdf" for details.
1404 - New "coinduction" method to avoid some boilerplate (compared to
1407 data ~> datatype_new
1408 codata ~> codatatype
1410 - Renamed many generated theorems, including
1412 map_comp' ~> map_comp
1422 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1423 "check_property" allows to check specifications of the form "ALL x y
1424 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1425 Examples.thy in particular.
1427 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1428 tracing output in the command transaction context instead of physical
1429 stdout. See also Toplevel.debug, Toplevel.debugging and
1430 ML_Compiler.exn_trace.
1432 * ML type "theory" is now immutable, without any special treatment of
1433 drafts or linear updates (which could lead to "stale theory" errors in
1434 the past). Discontinued obsolete operations like Theory.copy,
1435 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1438 * More uniform naming of goal functions for skipped proofs:
1440 Skip_Proof.prove ~> Goal.prove_sorry
1441 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1443 Minor INCOMPATIBILITY.
1445 * Simplifier tactics and tools use proper Proof.context instead of
1446 historic type simpset. Old-style declarations like addsimps,
1447 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1448 retains its use as snapshot of the main Simplifier context, using
1449 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1450 old tools by making them depend on (ctxt : Proof.context) instead of
1451 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1453 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1454 operate on Proof.context instead of claset, for uniformity with addIs,
1455 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1456 clasets separately from the context.
1458 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1459 INCOMPATIBILITY, use @{context} instead.
1461 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1462 presents the result as initial Proof.context.
1467 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1468 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1470 * Discontinued obsolete isabelle-process options -f and -u (former
1471 administrative aliases of option -e). Minor INCOMPATIBILITY.
1473 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1476 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1477 document formats: dvi.gz, ps, ps.gz -- the default document format is
1480 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1481 specify global resources of the JVM process run by isabelle build.
1483 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1484 to run Isabelle/Scala source files as standalone programs.
1486 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1487 keyword tables): use Isabelle/Scala operations, which inspect outer
1488 syntax without requiring to build sessions first.
1490 * Sessions may be organized via 'chapter' specifications in the ROOT
1491 file, which determines a two-level hierarchy of browser info. The old
1492 tree-like organization via implicit sub-session relation (with its
1493 tendency towards erratic fluctuation of URLs) has been discontinued.
1494 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1495 for HTML presentation of theories.
1499 New in Isabelle2013 (February 2013)
1500 -----------------------------------
1504 * Theorem status about oracles and unfinished/failed future proofs is
1505 no longer printed by default, since it is incompatible with
1506 incremental / parallel checking of the persistent document model. ML
1507 function Thm.peek_status may be used to inspect a snapshot of the
1508 ongoing evaluation process. Note that in batch mode --- notably
1509 isabelle build --- the system ensures that future proofs of all
1510 accessible theorems in the theory context are finished (as before).
1512 * Configuration option show_markup controls direct inlining of markup
1513 into the printed representation of formal entities --- notably type
1514 and sort constraints. This enables Prover IDE users to retrieve that
1515 information via tooltips in the output window, for example.
1517 * Command 'ML_file' evaluates ML text from a file directly within the
1518 theory, without any predeclaration via 'uses' in the theory header.
1520 * Old command 'use' command and corresponding keyword 'uses' in the
1521 theory header are legacy features and will be discontinued soon.
1522 Tools that load their additional source files may imitate the
1523 'ML_file' implementation, such that the system can take care of
1524 dependencies properly.
1526 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1527 is called fastforce / fast_force_tac already since Isabelle2011-1.
1529 * Updated and extended "isar-ref" and "implementation" manual, reduced
1530 remaining material in old "ref" manual.
1532 * Improved support for auxiliary contexts that indicate block structure
1533 for specifications. Nesting of "context fixes ... context assumes ..."
1534 and "class ... context ...".
1536 * Attribute "consumes" allows a negative value as well, which is
1537 interpreted relatively to the total number of premises of the rule in
1538 the target context. This form of declaration is stable when exported
1539 from a nested 'context' with additional assumptions. It is the
1540 preferred form for definitional packages, notably cases/rules produced
1541 in HOL/inductive and HOL/function.
1543 * More informative error messages for Isar proof commands involving
1544 lazy enumerations (method applications etc.).
1546 * Refined 'help' command to retrieve outer syntax commands according
1547 to name patterns (with clickable results).
1550 *** Prover IDE -- Isabelle/Scala/jEdit ***
1552 * Parallel terminal proofs ('by') are enabled by default, likewise
1553 proofs that are built into packages like 'datatype', 'function'. This
1554 allows to "run ahead" checking the theory specifications on the
1555 surface, while the prover is still crunching on internal
1556 justifications. Unfinished / cancelled proofs are restarted as
1557 required to complete full proof checking eventually.
1559 * Improved output panel with tooltips, hyperlinks etc. based on the
1560 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1561 tooltips leads to some window that supports the same recursively,
1562 which can lead to stacks of tooltips as the semantic document content
1563 is explored. ESCAPE closes the whole stack, individual windows may be
1564 closed separately, or detached to become independent jEdit dockables.
1566 * Improved support for commands that produce graph output: the text
1567 message contains a clickable area to open a new instance of the graph
1570 * More robust incremental parsing of outer syntax (partial comments,
1571 malformed symbols). Changing the balance of open/close quotes and
1572 comment delimiters works more conveniently with unfinished situations
1573 that frequently occur in user interaction.
1575 * More efficient painting and improved reactivity when editing large
1576 files. More scalable management of formal document content.
1578 * Smarter handling of tracing messages: prover process pauses after
1579 certain number of messages per command transaction, with some user
1580 dialog to stop or continue. This avoids swamping the front-end with
1581 potentially infinite message streams.
1583 * More plugin options and preferences, based on Isabelle/Scala. The
1584 jEdit plugin option panel provides access to some Isabelle/Scala
1585 options, including tuning parameters for editor reactivity and color
1588 * Dockable window "Symbols" provides some editing support for Isabelle
1591 * Dockable window "Monitor" shows ML runtime statistics. Note that
1592 continuous display of the chart slows down the system.
1594 * Improved editing support for control styles: subscript, superscript,
1595 bold, reset of style -- operating on single symbols or text
1596 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1598 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1599 adjust the main text area font size, and its derivatives for output,
1600 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1601 need to be adapted to local keyboard layouts.
1603 * More reactive completion popup by default: use \t (TAB) instead of
1604 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1605 also "Plugin Options / SideKick / General / Code Completion Options".
1607 * Implicit check and build dialog of the specified logic session
1608 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1609 demand, without bundling big platform-dependent heap images in the
1610 Isabelle distribution.
1612 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1613 from Oracle provide better multi-platform experience. This version is
1614 now bundled exclusively with Isabelle.
1619 * Code generation for Haskell: restrict unqualified imports from
1620 Haskell Prelude to a small set of fundamental operations.
1622 * Command 'export_code': relative file names are interpreted
1623 relatively to master directory of current theory rather than the
1624 rather arbitrary current working directory. INCOMPATIBILITY.
1626 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1627 use regular rule composition via "OF" / "THEN", or explicit proof
1628 structure instead. Note that Isabelle/ML provides a variety of
1629 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1630 with some care where this is really required.
1632 * Command 'typ' supports an additional variant with explicit sort
1633 constraint, to infer and check the most general type conforming to a
1634 given sort. Example (in HOL):
1636 typ "_ * _ * bool * unit" :: finite
1638 * Command 'locale_deps' visualizes all locales and their relations as
1646 - Added MaSh relevance filter based on machine-learning; see the
1647 Sledgehammer manual for details.
1648 - Polished Isar proofs generated with "isar_proofs" option.
1649 - Rationalized type encodings ("type_enc" option).
1650 - Renamed "kill_provers" subcommand to "kill_all".
1652 isar_proof ~> isar_proofs
1653 isar_shrink_factor ~> isar_shrink
1654 max_relevant ~> max_facts
1655 relevance_thresholds ~> fact_thresholds
1657 * Quickcheck: added an optimisation for equality premises. It is
1658 switched on by default, and can be switched off by setting the
1659 configuration quickcheck_optimise_equality to false.
1661 * Quotient: only one quotient can be defined by quotient_type
1665 - generation of an abstraction function equation in lift_definition
1666 - quot_del attribute
1667 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1669 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1672 * Preprocessing of the code generator rewrites set comprehensions into
1673 pointfree expressions.
1675 * The SMT solver Z3 has now by default a restricted set of directly
1676 supported features. For the full set of features (div/mod, nonlinear
1677 arithmetic, datatypes/records) with potential proof reconstruction
1678 failures, enable the configuration option "z3_with_extensions". Minor
1681 * Simplified 'typedef' specifications: historical options for implicit
1682 set definition and alternative name have been discontinued. The
1683 former behavior of "typedef (open) t = A" is now the default, but
1684 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1687 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1688 directly. INCOMPATIBILITY.
1690 * Moved operation product, sublists and n_lists from theory Enum to
1691 List. INCOMPATIBILITY.
1693 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1695 * Class "comm_monoid_diff" formalises properties of bounded
1696 subtraction, with natural numbers and multisets as typical instances.
1698 * Added combinator "Option.these" with type "'a option set => 'a set".
1700 * Theory "Transitive_Closure": renamed lemmas
1702 reflcl_tranclp -> reflclp_tranclp
1703 rtranclp_reflcl -> rtranclp_reflclp
1707 * Theory "Rings": renamed lemmas (in class semiring)
1709 left_distrib ~> distrib_right
1710 right_distrib ~> distrib_left
1714 * Generalized the definition of limits:
1716 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1717 expresses that when the input values x converge to F then the
1718 output f x converges to G.
1720 - Added filters for convergence to positive (at_top) and negative
1723 - Moved infinity in the norm (at_infinity) from
1724 Multivariate_Analysis to Complex_Main.
1726 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1731 * Theory "Library/Option_ord" provides instantiation of option type to
1732 lattice type classes.
1734 * Theory "Library/Multiset": renamed
1736 constant fold_mset ~> Multiset.fold
1737 fact fold_mset_commute ~> fold_mset_comm
1741 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1744 - Renamed constants (and related lemmas)
1747 strict_prefix ~> prefix
1749 - Replaced constant "postfix" by "suffixeq" with swapped argument
1750 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1751 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1752 Renamed lemmas accordingly.
1754 - Added constant "list_hembeq" for homeomorphic embedding on
1755 lists. Added abbreviation "sublisteq" for special case
1756 "list_hembeq (op =)".
1758 - Theory Library/Sublist no longer provides "order" and "bot" type
1759 class instances for the prefix order (merely corresponding locale
1760 interpretations). The type class instances are now in theory
1761 Library/Prefix_Order.
1763 - The sublist relation of theory Library/Sublist_Order is now based
1764 on "Sublist.sublisteq". Renamed lemmas accordingly:
1766 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1767 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1768 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1769 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1770 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1771 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1772 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1773 le_list_drop_many ~> Sublist.sublisteq_drop_many
1774 le_list_filter_left ~> Sublist.sublisteq_filter_left
1775 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1776 le_list_rev_take_iff ~> Sublist.sublisteq_append
1777 le_list_same_length ~> Sublist.sublisteq_same_length
1778 le_list_take_many_iff ~> Sublist.sublisteq_append'
1779 less_eq_list.drop ~> less_eq_list_drop
1780 less_eq_list.induct ~> less_eq_list_induct
1781 not_le_list_length ~> Sublist.not_sublisteq_length
1785 * New theory Library/Countable_Set.
1787 * Theory Library/Debug and Library/Parallel provide debugging and
1788 parallel execution for code generated towards Isabelle/ML.
1790 * Theory Library/FuncSet: Extended support for Pi and extensional and
1791 introduce the extensional dependent function space "PiE". Replaced
1792 extensional_funcset by an abbreviation, and renamed lemmas from
1793 extensional_funcset to PiE as follows:
1795 extensional_empty ~> PiE_empty
1796 extensional_funcset_empty_domain ~> PiE_empty_domain
1797 extensional_funcset_empty_range ~> PiE_empty_range
1798 extensional_funcset_arb ~> PiE_arb
1799 extensional_funcset_mem ~> PiE_mem
1800 extensional_funcset_extend_domainI ~> PiE_fun_upd
1801 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1802 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1803 card_extensional_funcset ~> card_PiE
1804 finite_extensional_funcset ~> finite_PiE
1808 * Theory Library/FinFun: theory of almost everywhere constant
1809 functions (supersedes the AFP entry "Code Generation for Functions as
1812 * Theory Library/Phantom: generic phantom type to make a type
1813 parameter appear in a constant's type. This alternative to adding
1814 TYPE('a) as another parameter avoids unnecessary closures in generated
1817 * Theory Library/RBT_Impl: efficient construction of red-black trees
1818 from sorted associative lists. Merging two trees with rbt_union may
1819 return a structurally different tree than before. Potential
1822 * Theory Library/IArray: immutable arrays with code generation.
1824 * Theory Library/Finite_Lattice: theory of finite lattices.
1826 * HOL/Multivariate_Analysis: replaced
1828 "basis :: 'a::euclidean_space => nat => real"
1829 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1831 on euclidean spaces by using the inner product "_ \<bullet> _" with
1832 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1833 "SUM i : Basis. f i * r i".
1835 With this change the following constants are also changed or removed:
1837 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1838 a $$ i ~> inner a i (where i : Basis)
1840 \<pi>, \<pi>' removed
1842 Theorems about these constants where removed.
1846 component_le_norm ~> Basis_le_norm
1847 euclidean_eq ~> euclidean_eq_iff
1848 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1849 euclidean_simps ~> inner_simps
1850 independent_basis ~> independent_Basis
1851 span_basis ~> span_Basis
1852 in_span_basis ~> in_span_Basis
1853 norm_bound_component_le ~> norm_boound_Basis_le
1854 norm_bound_component_lt ~> norm_boound_Basis_lt
1855 component_le_infnorm ~> Basis_le_infnorm
1861 - Added simproc "measurable" to automatically prove measurability.
1863 - Added induction rules for sigma sets with disjoint union
1864 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1865 (borel_measurable_induct).
1867 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1870 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1871 AFP entry "Ordinals_and_Cardinals").
1873 * HOL/BNF: New (co)datatype package based on bounded natural functors
1874 with support for mixed, nested recursion and interesting non-free
1877 * HOL/Finite_Set and Relation: added new set and relation operations
1878 expressed by Finite_Set.fold.
1880 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1881 trees for the code generator.
1883 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1885 possible INCOMPATIBILITY.
1887 * HOL/Set: renamed Set.project -> Set.filter
1891 *** Document preparation ***
1893 * Dropped legacy antiquotations "term_style" and "thm_style", since
1894 styles may be given as arguments to "term" and "thm" already.
1895 Discontinued legacy styles "prem1" .. "prem19".
1897 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1898 instead of slightly exotic babel/greek.
1900 * Document variant NAME may use different LaTeX entry point
1901 document/root_NAME.tex if that file exists, instead of the common
1904 * Simplified custom document/build script, instead of old-style
1905 document/IsaMakefile. Minor INCOMPATIBILITY.
1910 * The default limit for maximum number of worker threads is now 8,
1911 instead of 4, in correspondence to capabilities of contemporary
1912 hardware and Poly/ML runtime system.
1914 * Type Seq.results and related operations support embedded error
1915 messages within lazy enumerations, and thus allow to provide
1916 informative errors in the absence of any usable results.
1918 * Renamed Position.str_of to Position.here to emphasize that this is a
1919 formal device to inline positions into message text, but not
1920 necessarily printing visible text.
1925 * Advanced support for Isabelle sessions and build management, see
1926 "system" manual for the chapter of that name, especially the "isabelle
1927 build" tool and its examples. The "isabelle mkroot" tool prepares
1928 session root directories for use with "isabelle build", similar to
1929 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1930 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1931 mkdir / make are rendered obsolete.
1933 * Discontinued obsolete Isabelle/build script, it is superseded by the
1934 regular isabelle build tool. For example:
1936 isabelle build -s -b HOL
1938 * Discontinued obsolete "isabelle makeall".
1940 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1941 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1942 provides some traditional targets that invoke "isabelle build". Note
1943 that this is inefficient! Applications of Isabelle/HOL involving
1944 "isabelle make" should be upgraded to use "isabelle build" directly.
1946 * The "isabelle options" tool prints Isabelle system options, as
1947 required for "isabelle build", for example.
1949 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1950 Minor INCOMPATIBILITY in command-line options.
1952 * The "isabelle install" tool has now a simpler command-line. Minor
1955 * The "isabelle components" tool helps to resolve add-on components
1956 that are not bundled, or referenced from a bare-bones repository
1957 version of Isabelle.
1959 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1960 platform family: "linux", "macos", "windows".
1962 * The ML system is configured as regular component, and no longer
1963 picked up from some surrounding directory. Potential INCOMPATIBILITY
1964 for home-made settings.
1966 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1968 * Discontinued support for Poly/ML 5.2.1, which was the last version
1969 without exception positions and advanced ML compiler/toplevel
1972 * Discontinued special treatment of Proof General -- no longer guess
1973 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1974 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1975 settings manually, or use a Proof General version that has been
1976 bundled as Isabelle component.
1980 New in Isabelle2012 (May 2012)
1981 ------------------------------
1985 * Prover IDE (PIDE) improvements:
1987 - more robust Sledgehammer integration (as before the sledgehammer
1988 command-line needs to be typed into the source buffer)
1989 - markup for bound variables
1990 - markup for types of term variables (displayed as tooltips)
1991 - support for user-defined Isar commands within the running session
1992 - improved support for Unicode outside original 16bit range
1993 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1995 * Forward declaration of outer syntax keywords within the theory
1996 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1997 commands to be used in the same theory where defined.
1999 * Auxiliary contexts indicate block structure for specifications with
2000 additional parameters and assumptions. Such unnamed contexts may be
2001 nested within other targets, like 'theory', 'locale', 'class',
2002 'instantiation' etc. Results from the local context are generalized
2003 accordingly and applied to the enclosing target context. Example:
2007 assumes xy: "x = y" and yz: "y = z"
2010 lemma my_trans: "x = z" using xy yz by simp
2016 The most basic application is to factor-out context elements of
2017 several fixes/assumes/shows theorem statements, e.g. see
2018 ~~/src/HOL/Isar_Examples/Group_Context.thy
2020 Any other local theory specification element works within the "context
2021 ... begin ... end" block as well.
2023 * Bundled declarations associate attributed fact expressions with a
2024 given name in the context. These may be later included in other
2025 contexts. This allows to manage context extensions casually, without
2026 the logical dependencies of locales and locale interpretation. See
2027 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2029 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2030 declaration, and results are standardized before being stored. Thus
2031 old-style "standard" after instantiation or composition of facts
2032 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2033 indices of schematic variables.
2035 * Rule attributes in local theory declarations (e.g. locale or class)
2036 are now statically evaluated: the resulting theorem is stored instead
2037 of the original expression. INCOMPATIBILITY in rare situations, where
2038 the historic accident of dynamic re-evaluation in interpretations
2041 * New tutorial "Programming and Proving in Isabelle/HOL"
2042 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2043 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2044 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2045 Logic" as the recommended beginners tutorial, but does not cover all
2046 of the material of that old tutorial.
2048 * Updated and extended reference manuals: "isar-ref",
2049 "implementation", "system"; reduced remaining material in old "ref"
2055 * Command 'definition' no longer exports the foundational "raw_def"
2056 into the user context. Minor INCOMPATIBILITY, may use the regular
2057 "def" result with attribute "abs_def" to imitate the old version.
2059 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2060 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2061 expand it. This also works for object-logic equality. (Formerly
2062 undocumented feature.)
2064 * Sort constraints are now propagated in simultaneous statements, just
2065 like type constraints. INCOMPATIBILITY in rare situations, where
2066 distinct sorts used to be assigned accidentally. For example:
2068 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2070 lemma "P (x::'a)" and "Q (y::'a::bar)"
2071 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2073 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2074 tolerant against multiple unifiers, as long as the final result is
2075 unique. (As before, rules are composed in canonical right-to-left
2076 order to accommodate newly introduced premises.)
2078 * Renamed some inner syntax categories:
2084 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2085 "num_position" etc. are mainly used instead (which also include
2086 position information via constraints).
2088 * Simplified configuration options for syntax ambiguity: see
2089 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2090 manual. Minor INCOMPATIBILITY.
2092 * Discontinued configuration option "syntax_positions": atomic terms
2093 in parse trees are always annotated by position constraints.
2095 * Old code generator for SML and its commands 'code_module',
2096 'code_library', 'consts_code', 'types_code' have been discontinued.
2097 Use commands of the generic code generator instead. INCOMPATIBILITY.
2099 * Redundant attribute "code_inline" has been discontinued. Use
2100 "code_unfold" instead. INCOMPATIBILITY.
2102 * Dropped attribute "code_unfold_post" in favor of the its dual
2103 "code_abbrev", which yields a common pattern in definitions like
2105 definition [code_abbrev]: "f = t"
2109 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2110 instead. INCOMPATIBILITY.
2112 * Discontinued old "prems" fact, which used to refer to the accidental
2113 collection of foundational premises in the context (already marked as
2114 legacy since Isabelle2011).
2119 * Type 'a set is now a proper type constructor (just as before
2120 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2121 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2122 sets separate, it is often sufficient to rephrase some set S that has
2123 been accidentally used as predicates by "%x. x : S", and some
2124 predicate P that has been accidentally used as set by "{x. P x}".
2125 Corresponding proofs in a first step should be pruned from any
2126 tinkering with former theorems mem_def and Collect_def as far as
2129 For developments which deliberately mix predicates and sets, a
2130 planning step is necessary to determine what should become a predicate
2131 and what a set. It can be helpful to carry out that step in
2132 Isabelle2011-1 before jumping right into the current release.
2134 * Code generation by default implements sets as container type rather
2135 than predicates. INCOMPATIBILITY.
2137 * New type synonym 'a rel = ('a * 'a) set
2139 * The representation of numerals has changed. Datatype "num"
2140 represents strictly positive binary numerals, along with functions
2141 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2142 positive and negated numeric literals, respectively. See also
2143 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2144 user theories may require adaptations as follows:
2146 - Theorems with number_ring or number_semiring constraints: These
2147 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2149 - Theories defining numeric types: Remove number, number_semiring,
2150 and number_ring instances. Defer all theorems about numerals until
2151 after classes one and semigroup_add have been instantiated.
2153 - Numeral-only simp rules: Replace each rule having a "number_of v"
2154 pattern with two copies, one for numeral and one for neg_numeral.
2156 - Theorems about subclasses of semiring_1 or ring_1: These classes
2157 automatically support numerals now, so more simp rules and
2158 simprocs may now apply within the proof.
2160 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2161 Redefine using other integer operations.
2163 * Transfer: New package intended to generalize the existing
2164 "descending" method and related theorem attributes from the Quotient
2165 package. (Not all functionality is implemented yet, but future
2166 development will focus on Transfer as an eventual replacement for the
2167 corresponding parts of the Quotient package.)
2169 - transfer_rule attribute: Maintains a collection of transfer rules,
2170 which relate constants at two different types. Transfer rules may
2171 relate different type instances of the same polymorphic constant,
2172 or they may relate an operation on a raw type to a corresponding
2173 operation on an abstract type (quotient or subtype). For example:
2175 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2176 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2178 - transfer method: Replaces a subgoal on abstract types with an
2179 equivalent subgoal on the corresponding raw types. Constants are
2180 replaced with corresponding ones according to the transfer rules.
2181 Goals are generalized over all free variables by default; this is
2182 necessary for variables whose types change, but can be overridden
2183 for specific variables with e.g. "transfer fixing: x y z". The
2184 variant transfer' method allows replacing a subgoal with one that
2185 is logically stronger (rather than equivalent).
2187 - relator_eq attribute: Collects identity laws for relators of
2188 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2189 transfer method uses these lemmas to infer transfer rules for
2190 non-polymorphic constants on the fly.
2192 - transfer_prover method: Assists with proving a transfer rule for a
2193 new constant, provided the constant is defined in terms of other
2194 constants that already have transfer rules. It should be applied
2195 after unfolding the constant definitions.
2197 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2198 from type nat to type int.
2200 * Lifting: New package intended to generalize the quotient_definition
2201 facility of the Quotient package; designed to work with Transfer.
2203 - lift_definition command: Defines operations on an abstract type in
2204 terms of a corresponding operation on a representation
2205 type. Example syntax:
2207 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2210 Users must discharge a respectfulness proof obligation when each
2211 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2212 the proof is discharged automatically.) The obligation is
2213 presented in a user-friendly, readable form; a respectfulness
2214 theorem in the standard format and a transfer rule are generated
2217 - Integration with code_abstype: For typedefs (e.g. subtypes
2218 corresponding to a datatype invariant, such as dlist),
2219 lift_definition generates a code certificate theorem and sets up
2220 code generation for each constant.
2222 - setup_lifting command: Sets up the Lifting package to work with a
2223 user-defined type. The user must provide either a quotient theorem
2224 or a type_definition theorem. The package configures transfer
2225 rules for equality and quantifiers on the type, and sets up the
2226 lift_definition command to work with the type.
2228 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2229 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2230 Word/Word.thy and Library/Float.thy.
2234 - The 'quotient_type' command now supports a 'morphisms' option with
2235 rep and abs functions, similar to typedef.
2237 - 'quotient_type' sets up new types to work with the Lifting and
2238 Transfer packages, as with 'setup_lifting'.
2240 - The 'quotient_definition' command now requires the user to prove a
2241 respectfulness property at the point where the constant is
2242 defined, similar to lift_definition; INCOMPATIBILITY.
2244 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2245 accordingly, INCOMPATIBILITY.
2247 * New diagnostic command 'find_unused_assms' to find potentially
2248 superfluous assumptions in theorems using Quickcheck.
2252 - Quickcheck returns variable assignments as counterexamples, which
2253 allows to reveal the underspecification of functions under test.
2254 For example, refuting "hd xs = x", it presents the variable
2255 assignment xs = [] and x = a1 as a counterexample, assuming that
2256 any property is false whenever "hd []" occurs in it.
2258 These counterexample are marked as potentially spurious, as
2259 Quickcheck also returns "xs = []" as a counterexample to the
2260 obvious theorem "hd xs = hd xs".
2262 After finding a potentially spurious counterexample, Quickcheck
2263 continues searching for genuine ones.
2265 By default, Quickcheck shows potentially spurious and genuine
2266 counterexamples. The option "genuine_only" sets quickcheck to only
2267 show genuine counterexamples.
2269 - The command 'quickcheck_generator' creates random and exhaustive
2270 value generators for a given type and operations.
2272 It generates values by using the operations as if they were
2273 constructors of that type.
2275 - Support for multisets.
2277 - Added "use_subtype" options.
2279 - Added "quickcheck_locale" configuration to specify how to process
2280 conjectures in a locale context.
2282 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2283 and affecting 'rat' and 'real'.
2286 - Integrated more tightly with SPASS, as described in the ITP 2012
2287 paper "More SPASS with Isabelle".
2288 - Made it try "smt" as a fallback if "metis" fails or times out.
2289 - Added support for the following provers: Alt-Ergo (via Why3 and
2290 TFF1), iProver, iProver-Eq.
2291 - Sped up the minimizer.
2292 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2293 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2294 - Renamed "sound" option to "strict".
2296 * Metis: Added possibility to specify lambda translations scheme as a
2297 parenthesized argument (e.g., "by (metis (lifting) ...)").
2299 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2301 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2303 * New "case_product" attribute to generate a case rule doing multiple
2304 case distinctions at the same time. E.g.
2306 list.exhaust [case_product nat.exhaust]
2308 produces a rule which can be used to perform case distinction on both
2311 * New "eventually_elim" method as a generalized variant of the
2312 eventually_elim* rules. Supports structured proofs.
2314 * Typedef with implicit set definition is considered legacy. Use
2315 "typedef (open)" form instead, which will eventually become the
2318 * Record: code generation can be switched off manually with
2320 declare [[record_coden = false]] -- "default true"
2322 * Datatype: type parameters allow explicit sort constraints.
2324 * Concrete syntax for case expressions includes constraints for source
2325 positions, and thus produces Prover IDE markup for its bindings.
2326 INCOMPATIBILITY for old-style syntax translations that augment the
2327 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2330 * Clarified attribute "mono_set": pure declaration without modifying
2331 the result of the fact expression.
2333 * More default pred/set conversions on a couple of relation operations
2334 and predicates. Added powers of predicate relations. Consolidation
2335 of some relation theorems:
2337 converse_def ~> converse_unfold
2338 rel_comp_def ~> relcomp_unfold
2339 symp_def ~> (modified, use symp_def and sym_def instead)
2340 transp_def ~> transp_trans
2341 Domain_def ~> Domain_unfold
2342 Range_def ~> Domain_converse [symmetric]
2344 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2346 See theory "Relation" for examples for making use of pred/set
2347 conversions by means of attributes "to_set" and "to_pred".
2351 * Renamed facts about the power operation on relations, i.e., relpow
2352 to match the constant's name:
2354 rel_pow_1 ~> relpow_1
2355 rel_pow_0_I ~> relpow_0_I
2356 rel_pow_Suc_I ~> relpow_Suc_I
2357 rel_pow_Suc_I2 ~> relpow_Suc_I2
2358 rel_pow_0_E ~> relpow_0_E
2359 rel_pow_Suc_E ~> relpow_Suc_E
2360 rel_pow_E ~> relpow_E
2361 rel_pow_Suc_D2 ~> relpow_Suc_D2
2362 rel_pow_Suc_E2 ~> relpow_Suc_E2
2363 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2364 rel_pow_E2 ~> relpow_E2
2365 rel_pow_add ~> relpow_add
2366 rel_pow_commute ~> relpow
2367 rel_pow_empty ~> relpow_empty:
2368 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2369 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2370 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2371 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2372 rel_pow_fun_conv ~> relpow_fun_conv
2373 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2374 rel_pow_finite_bounded ~> relpow_finite_bounded
2375 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2376 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2377 single_valued_rel_pow ~> single_valued_relpow
2381 * Theory Relation: Consolidated constant name for relation composition
2382 and corresponding theorem names:
2384 - Renamed constant rel_comp to relcomp.
2386 - Dropped abbreviation pred_comp. Use relcompp instead.
2390 rel_compI ~> relcompI
2391 rel_compEpair ~> relcompEpair
2392 rel_compE ~> relcompE
2393 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2394 rel_comp_empty1 ~> relcomp_empty1
2395 rel_comp_mono ~> relcomp_mono
2396 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2397 rel_comp_distrib ~> relcomp_distrib
2398 rel_comp_distrib2 ~> relcomp_distrib2
2399 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2400 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2401 single_valued_rel_comp ~> single_valued_relcomp
2402 rel_comp_def ~> relcomp_unfold
2403 converse_rel_comp ~> converse_relcomp
2404 pred_compI ~> relcomppI
2405 pred_compE ~> relcomppE
2406 pred_comp_bot1 ~> relcompp_bot1
2407 pred_comp_bot2 ~> relcompp_bot2
2408 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2409 pred_comp_mono ~> relcompp_mono
2410 pred_comp_distrib ~> relcompp_distrib
2411 pred_comp_distrib2 ~> relcompp_distrib2
2412 converse_pred_comp ~> converse_relcompp
2414 finite_rel_comp ~> finite_relcomp
2416 set_rel_comp ~> set_relcomp
2420 * Theory Divides: Discontinued redundant theorems about div and mod.
2421 INCOMPATIBILITY, use the corresponding generic theorems instead.
2423 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2424 zdiv_self ~> div_self
2425 zmod_self ~> mod_self
2428 zdiv_zmod_equality ~> div_mod_equality2
2429 zdiv_zmod_equality2 ~> div_mod_equality
2430 zmod_zdiv_trivial ~> mod_div_trivial
2431 zdiv_zminus_zminus ~> div_minus_minus
2432 zmod_zminus_zminus ~> mod_minus_minus
2433 zdiv_zminus2 ~> div_minus_right
2434 zmod_zminus2 ~> mod_minus_right
2435 zdiv_minus1_right ~> div_minus1_right
2436 zmod_minus1_right ~> mod_minus1_right
2437 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2438 zmod_zmult1_eq ~> mod_mult_right_eq
2439 zpower_zmod ~> power_mod
2440 zdvd_zmod ~> dvd_mod
2441 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2442 mod_mult_distrib ~> mult_mod_left
2443 mod_mult_distrib2 ~> mult_mod_right
2445 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2446 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2448 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2450 * Consolidated theorem names concerning fold combinators:
2452 inf_INFI_fold_inf ~> inf_INF_fold_inf
2453 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2454 INFI_fold_inf ~> INF_fold_inf
2455 SUPR_fold_sup ~> SUP_fold_sup
2456 union_set ~> union_set_fold
2457 minus_set ~> minus_set_fold
2458 INFI_set_fold ~> INF_set_fold
2459 SUPR_set_fold ~> SUP_set_fold
2460 INF_code ~> INF_set_foldr
2461 SUP_code ~> SUP_set_foldr
2462 foldr.simps ~> foldr.simps (in point-free formulation)
2463 foldr_fold_rev ~> foldr_conv_fold
2464 foldl_fold ~> foldl_conv_fold
2465 foldr_foldr ~> foldr_conv_foldl
2466 foldl_foldr ~> foldl_conv_foldr
2467 fold_set_remdups ~> fold_set_fold_remdups
2468 fold_set ~> fold_set_fold
2469 fold1_set ~> fold1_set_fold
2473 * Dropped rarely useful theorems concerning fold combinators:
2474 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2475 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2476 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2477 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2478 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2479 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2480 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2481 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2482 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2483 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2485 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2486 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2487 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2488 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2489 lemmas over fold rather than foldr, or make use of lemmas
2490 fold_conv_foldr and fold_rev.
2492 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2493 through option types.
2495 * "Transitive_Closure.ntrancl": bounded transitive closure on
2498 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2500 * Theory Int: Discontinued many legacy theorems specific to type int.
2501 INCOMPATIBILITY, use the corresponding generic theorems instead.
2503 zminus_zminus ~> minus_minus
2504 zminus_0 ~> minus_zero
2505 zminus_zadd_distrib ~> minus_add_distrib
2506 zadd_commute ~> add_commute
2507 zadd_assoc ~> add_assoc
2508 zadd_left_commute ~> add_left_commute
2511 zadd_0 ~> add_0_left
2512 zadd_0_right ~> add_0_right
2513 zadd_zminus_inverse2 ~> left_minus
2514 zmult_zminus ~> mult_minus_left
2515 zmult_commute ~> mult_commute
2516 zmult_assoc ~> mult_assoc
2517 zadd_zmult_distrib ~> left_distrib
2518 zadd_zmult_distrib2 ~> right_distrib
2519 zdiff_zmult_distrib ~> left_diff_distrib
2520 zdiff_zmult_distrib2 ~> right_diff_distrib
2521 zmult_1 ~> mult_1_left
2522 zmult_1_right ~> mult_1_right
2523 zle_refl ~> order_refl
2524 zle_trans ~> order_trans
2525 zle_antisym ~> order_antisym
2526 zle_linear ~> linorder_linear
2527 zless_linear ~> linorder_less_linear
2528 zadd_left_mono ~> add_left_mono
2529 zadd_strict_right_mono ~> add_strict_right_mono
2530 zadd_zless_mono ~> add_less_le_mono
2531 int_0_less_1 ~> zero_less_one
2532 int_0_neq_1 ~> zero_neq_one
2534 zpower_zadd_distrib ~> power_add
2535 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2536 zero_le_zpower_abs ~> zero_le_power_abs
2538 * Theory Deriv: Renamed
2540 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2542 * Theory Library/Multiset: Improved code generation of multisets.
2544 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2545 are expressed via type classes again. The special syntax
2546 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2547 setsum_set, which is now subsumed by Big_Operators.setsum.
2550 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2551 use theory HOL/Library/Nat_Bijection instead.
2553 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2554 trees is now inside a type class context. Names of affected
2555 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2556 theories working directly with raw red-black trees, adapt the names as
2560 bulkload -> rbt_bulkload
2561 del_from_left -> rbt_del_from_left
2562 del_from_right -> rbt_del_from_right
2564 delete -> rbt_delete
2566 insert -> rbt_insert
2567 insertw -> rbt_insert_with
2568 insert_with_key -> rbt_insert_with_key
2569 map_entry -> rbt_map_entry
2570 lookup -> rbt_lookup
2571 sorted -> rbt_sorted
2572 tree_greater -> rbt_greater
2573 tree_less -> rbt_less
2574 tree_less_symbol -> rbt_less_symbol
2576 union_with -> rbt_union_with
2577 union_with_key -> rbt_union_with_key
2580 balance_left_sorted -> balance_left_rbt_sorted
2581 balance_left_tree_greater -> balance_left_rbt_greater
2582 balance_left_tree_less -> balance_left_rbt_less
2583 balance_right_sorted -> balance_right_rbt_sorted
2584 balance_right_tree_greater -> balance_right_rbt_greater
2585 balance_right_tree_less -> balance_right_rbt_less
2586 balance_sorted -> balance_rbt_sorted
2587 balance_tree_greater -> balance_rbt_greater
2588 balance_tree_less -> balance_rbt_less
2589 bulkload_is_rbt -> rbt_bulkload_is_rbt
2590 combine_sorted -> combine_rbt_sorted
2591 combine_tree_greater -> combine_rbt_greater
2592 combine_tree_less -> combine_rbt_less
2593 delete_in_tree -> rbt_delete_in_tree
2594 delete_is_rbt -> rbt_delete_is_rbt
2595 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2596 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2597 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2598 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2599 del_in_tree -> rbt_del_in_tree
2600 del_inv1_inv2 -> rbt_del_inv1_inv2
2601 del_sorted -> rbt_del_rbt_sorted
2602 del_tree_greater -> rbt_del_rbt_greater
2603 del_tree_less -> rbt_del_rbt_less
2604 dom_lookup_Branch -> dom_rbt_lookup_Branch
2605 entries_lookup -> entries_rbt_lookup
2606 finite_dom_lookup -> finite_dom_rbt_lookup
2607 insert_sorted -> rbt_insert_rbt_sorted
2608 insertw_is_rbt -> rbt_insertw_is_rbt
2609 insertwk_is_rbt -> rbt_insertwk_is_rbt
2610 insertwk_sorted -> rbt_insertwk_rbt_sorted
2611 insertw_sorted -> rbt_insertw_rbt_sorted
2612 ins_sorted -> ins_rbt_sorted
2613 ins_tree_greater -> ins_rbt_greater
2614 ins_tree_less -> ins_rbt_less
2615 is_rbt_sorted -> is_rbt_rbt_sorted
2616 lookup_balance -> rbt_lookup_balance
2617 lookup_bulkload -> rbt_lookup_rbt_bulkload
2618 lookup_delete -> rbt_lookup_rbt_delete
2619 lookup_Empty -> rbt_lookup_Empty
2620 lookup_from_in_tree -> rbt_lookup_from_in_tree
2621 lookup_in_tree -> rbt_lookup_in_tree
2622 lookup_ins -> rbt_lookup_ins
2623 lookup_insert -> rbt_lookup_rbt_insert
2624 lookup_insertw -> rbt_lookup_rbt_insertw
2625 lookup_insertwk -> rbt_lookup_rbt_insertwk
2626 lookup_keys -> rbt_lookup_keys
2627 lookup_map -> rbt_lookup_map
2628 lookup_map_entry -> rbt_lookup_rbt_map_entry
2629 lookup_tree_greater -> rbt_lookup_rbt_greater
2630 lookup_tree_less -> rbt_lookup_rbt_less
2631 lookup_union -> rbt_lookup_rbt_union
2632 map_entry_color_of -> rbt_map_entry_color_of
2633 map_entry_inv1 -> rbt_map_entry_inv1
2634 map_entry_inv2 -> rbt_map_entry_inv2
2635 map_entry_is_rbt -> rbt_map_entry_is_rbt
2636 map_entry_sorted -> rbt_map_entry_rbt_sorted
2637 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2638 map_entry_tree_less -> rbt_map_entry_rbt_less
2639 map_tree_greater -> map_rbt_greater
2640 map_tree_less -> map_rbt_less
2641 map_sorted -> map_rbt_sorted
2642 paint_sorted -> paint_rbt_sorted
2643 paint_lookup -> paint_rbt_lookup
2644 paint_tree_greater -> paint_rbt_greater
2645 paint_tree_less -> paint_rbt_less
2646 sorted_entries -> rbt_sorted_entries
2647 tree_greater_eq_trans -> rbt_greater_eq_trans
2648 tree_greater_nit -> rbt_greater_nit
2649 tree_greater_prop -> rbt_greater_prop
2650 tree_greater_simps -> rbt_greater_simps
2651 tree_greater_trans -> rbt_greater_trans
2652 tree_less_eq_trans -> rbt_less_eq_trans
2653 tree_less_nit -> rbt_less_nit
2654 tree_less_prop -> rbt_less_prop
2655 tree_less_simps -> rbt_less_simps
2656 tree_less_trans -> rbt_less_trans
2657 tree_ord_props -> rbt_ord_props
2658 union_Branch -> rbt_union_Branch
2659 union_is_rbt -> rbt_union_is_rbt
2660 unionw_is_rbt -> rbt_unionw_is_rbt
2661 unionwk_is_rbt -> rbt_unionwk_is_rbt
2662 unionwk_sorted -> rbt_unionwk_rbt_sorted
2664 * Theory HOL/Library/Float: Floating point numbers are now defined as
2665 a subset of the real numbers. All operations are defined using the
2666 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2673 round_down -> float_round_down
2674 round_up -> float_round_up
2678 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2681 abs_float_def -> Float.compute_float_abs
2682 bitlen_ge0 -> bitlen_nonneg
2683 bitlen.simps -> Float.compute_bitlen
2684 float_components -> Float_mantissa_exponent
2685 float_divl.simps -> Float.compute_float_divl
2686 float_divr.simps -> Float.compute_float_divr
2687 float_eq_odd -> mult_powr_eq_mult_powr_iff
2688 float_power -> real_of_float_power
2689 lapprox_posrat_def -> Float.compute_lapprox_posrat
2690 lapprox_rat.simps -> Float.compute_lapprox_rat
2691 le_float_def' -> Float.compute_float_le
2692 le_float_def -> less_eq_float.rep_eq
2693 less_float_def' -> Float.compute_float_less
2694 less_float_def -> less_float.rep_eq
2695 normfloat_def -> Float.compute_normfloat
2696 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2697 normfloat -> normfloat_def
2698 normfloat_unique -> use normfloat_def
2699 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2700 one_float_def -> Float.compute_float_one
2701 plus_float_def -> Float.compute_float_plus
2702 rapprox_posrat_def -> Float.compute_rapprox_posrat
2703 rapprox_rat.simps -> Float.compute_rapprox_rat
2704 real_of_float_0 -> zero_float.rep_eq
2705 real_of_float_1 -> one_float.rep_eq
2706 real_of_float_abs -> abs_float.rep_eq
2707 real_of_float_add -> plus_float.rep_eq
2708 real_of_float_minus -> uminus_float.rep_eq
2709 real_of_float_mult -> times_float.rep_eq
2710 real_of_float_simp -> Float.rep_eq
2711 real_of_float_sub -> minus_float.rep_eq
2712 round_down.simps -> Float.compute_float_round_down
2713 round_up.simps -> Float.compute_float_round_up
2714 times_float_def -> Float.compute_float_times
2715 uminus_float_def -> Float.compute_float_uminus
2716 zero_float_def -> Float.compute_float_zero
2718 Lemmas not necessary anymore, use the transfer method:
2719 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2720 float_divr, float_le_simp, float_less1_mantissa_bound,
2721 float_less_simp, float_less_zero, float_le_zero,
2722 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2723 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2724 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2725 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2726 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2727 round_up, zero_le_float, zero_less_float
2729 * New theory HOL/Library/DAList provides an abstract type for
2730 association lists with distinct keys.
2732 * Session HOL/IMP: Added new theory of abstract interpretation of
2735 * Session HOL-Import: Re-implementation from scratch is faster,
2736 simpler, and more scalable. Requires a proof bundle, which is
2737 available as an external component. Discontinued old (and mostly
2738 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2740 * Session HOL-Word: Discontinued many redundant theorems specific to
2741 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2744 word_sub_alt ~> word_sub_wi
2745 word_add_alt ~> word_add_def
2746 word_mult_alt ~> word_mult_def
2747 word_minus_alt ~> word_minus_def
2748 word_0_alt ~> word_0_wi
2749 word_1_alt ~> word_1_wi
2750 word_add_0 ~> add_0_left
2751 word_add_0_right ~> add_0_right
2752 word_mult_1 ~> mult_1_left
2753 word_mult_1_right ~> mult_1_right
2754 word_add_commute ~> add_commute
2755 word_add_assoc ~> add_assoc
2756 word_add_left_commute ~> add_left_commute
2757 word_mult_commute ~> mult_commute
2758 word_mult_assoc ~> mult_assoc
2759 word_mult_left_commute ~> mult_left_commute
2760 word_left_distrib ~> left_distrib
2761 word_right_distrib ~> right_distrib
2762 word_left_minus ~> left_minus
2763 word_diff_0_right ~> diff_0_right
2764 word_diff_self ~> diff_self
2765 word_sub_def ~> diff_minus
2766 word_diff_minus ~> diff_minus
2767 word_add_ac ~> add_ac
2768 word_mult_ac ~> mult_ac
2769 word_plus_ac0 ~> add_0_left add_0_right add_ac
2770 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2771 word_order_trans ~> order_trans
2772 word_order_refl ~> order_refl
2773 word_order_antisym ~> order_antisym
2774 word_order_linear ~> linorder_linear
2775 lenw1_zero_neq_one ~> zero_neq_one
2776 word_number_of_eq ~> number_of_eq
2777 word_of_int_add_hom ~> wi_hom_add
2778 word_of_int_sub_hom ~> wi_hom_sub
2779 word_of_int_mult_hom ~> wi_hom_mult
2780 word_of_int_minus_hom ~> wi_hom_neg
2781 word_of_int_succ_hom ~> wi_hom_succ
2782 word_of_int_pred_hom ~> wi_hom_pred
2783 word_of_int_0_hom ~> word_0_wi
2784 word_of_int_1_hom ~> word_1_wi
2786 * Session HOL-Word: New proof method "word_bitwise" for splitting
2787 machine word equalities and inequalities into logical circuits,
2788 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2789 multiplication, shifting by constants, bitwise operators and numeric
2790 constants. Requires fixed-length word types, not 'a word. Solves
2791 many standard word identities outright and converts more into first
2792 order problems amenable to blast or similar. See also examples in
2793 HOL/Word/Examples/WordExamples.thy.
2795 * Session HOL-Probability: Introduced the type "'a measure" to
2796 represent measures, this replaces the records 'a algebra and 'a
2797 measure_space. The locales based on subset_class now have two
2798 locale-parameters the space \<Omega> and the set of measurable sets M.
2799 The product of probability spaces uses now the same constant as the
2800 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2801 measure". Most constants are defined now outside of locales and gain
2802 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2803 Measure space constructions for distributions and densities now got
2804 their own constants distr and density. Instead of using locales to
2805 describe measure spaces with a finite space, the measure count_space
2806 and point_measure is introduced. INCOMPATIBILITY.
2810 finite_measure.\<mu>' -> measure
2811 product_algebra_generator -> prod_algebra
2812 product_prob_space.emb -> prod_emb
2813 product_prob_space.infprod_algebra -> PiM
2816 completeable_measure_space
2817 finite_measure_space
2819 finite_product_finite_prob_space
2820 finite_product_sigma_algebra
2821 finite_sigma_algebra
2823 pair_finite_prob_space
2824 pair_finite_sigma_algebra
2827 product_sigma_algebra
2831 distribution -> use distr measure, or distributed predicate
2833 joint_distribution -> use distr measure, or distributed predicate
2834 pair_measure_generator
2835 product_prob_space.infprod_algebra -> use PiM
2838 Replacement theorems:
2839 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2840 finite_measure.empty_measure -> measure_empty
2841 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2842 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2843 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2844 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2845 finite_measure.finite_measure -> finite_measure.emeasure_finite
2846 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2847 finite_measure.positive_measure' -> measure_nonneg
2848 finite_measure.real_measure -> finite_measure.emeasure_real
2849 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2850 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2851 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2852 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2853 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2854 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2855 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2856 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2857 information_space.entropy_commute -> information_space.entropy_commute_simple
2858 information_space.entropy_eq -> information_space.entropy_simple_distributed
2859 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2860 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2861 information_space.entropy_uniform_max -> information_space.entropy_uniform
2862 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2863 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2864 information_space.KL_ge_0 -> information_space.KL_nonneg
2865 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2866 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2867 Int_stable_cuboids -> Int_stable_atLeastAtMost
2868 Int_stable_product_algebra_generator -> positive_integral
2869 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2870 measure_space.additive -> emeasure_additive
2871 measure_space.AE_iff_null_set -> AE_iff_null
2872 measure_space.almost_everywhere_def -> eventually_ae_filter
2873 measure_space.almost_everywhere_vimage -> AE_distrD
2874 measure_space.continuity_from_above -> INF_emeasure_decseq
2875 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2876 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2877 measure_space.continuity_from_below -> SUP_emeasure_incseq
2878 measure_space_density -> emeasure_density
2879 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2880 measure_space.integrable_vimage -> integrable_distr
2881 measure_space.integral_translated_density -> integral_density
2882 measure_space.integral_vimage -> integral_distr
2883 measure_space.measure_additive -> plus_emeasure
2884 measure_space.measure_compl -> emeasure_compl
2885 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2886 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2887 measure_space.measure_decseq -> decseq_emeasure
2888 measure_space.measure_Diff -> emeasure_Diff
2889 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2890 measure_space.measure_eq_0 -> emeasure_eq_0
2891 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2892 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2893 measure_space.measure_incseq -> incseq_emeasure
2894 measure_space.measure_insert -> emeasure_insert
2895 measure_space.measure_mono -> emeasure_mono
2896 measure_space.measure_not_negative -> emeasure_not_MInf
2897 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2898 measure_space.measure_setsum -> setsum_emeasure
2899 measure_space.measure_setsum_split -> setsum_emeasure_cover
2900 measure_space.measure_space_vimage -> emeasure_distr
2901 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2902 measure_space.measure_subadditive -> subadditive
2903 measure_space.measure_top -> emeasure_space
2904 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2905 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2906 measure_space.positive_integral_translated_density -> positive_integral_density
2907 measure_space.positive_integral_vimage -> positive_integral_distr
2908 measure_space.real_continuity_from_above -> Lim_measure_decseq
2909 measure_space.real_continuity_from_below -> Lim_measure_incseq
2910 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2911 measure_space.real_measure_Diff -> measure_Diff
2912 measure_space.real_measure_finite_Union -> measure_finite_Union
2913 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2914 measure_space.real_measure_subadditive -> measure_subadditive
2915 measure_space.real_measure_Union -> measure_Union
2916 measure_space.real_measure_UNION -> measure_UNION
2917 measure_space.simple_function_vimage -> simple_function_comp
2918 measure_space.simple_integral_vimage -> simple_integral_distr
2919 measure_space.simple_integral_vimage -> simple_integral_distr
2920 measure_unique_Int_stable -> measure_eqI_generator_eq
2921 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2922 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2923 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2924 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2925 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2926 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2927 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2928 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2929 pair_sigma_algebra.sets_swap -> sets_pair_swap
2930 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2931 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2932 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2933 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2934 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2935 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2936 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2937 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2938 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2939 prob_space.prob_space_vimage -> prob_space_distr
2940 prob_space.random_variable_restrict -> measurable_restrict
2941 prob_space_unique_Int_stable -> measure_eqI_prob_space
2942 product_algebraE -> prod_algebraE_all
2943 product_algebra_generator_der -> prod_algebra_eq_finite
2944 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2945 product_algebraI -> sets_PiM_I_finite
2946 product_measure_exists -> product_sigma_finite.sigma_finite
2947 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2948 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2949 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2950 product_prob_space.measurable_component -> measurable_component_singleton
2951 product_prob_space.measurable_emb -> measurable_prod_emb
2952 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2953 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2954 product_prob_space.measure_emb -> emeasure_prod_emb
2955 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2956 product_sigma_algebra.product_algebra_into_space -> space_closed
2957 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2958 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2959 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2960 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2961 sets_product_algebra -> sets_PiM
2962 sigma_algebra.measurable_sigma -> measurable_measure_of
2963 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2964 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2965 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2966 space_product_algebra -> space_PiM
2968 * Session HOL-TPTP: support to parse and import TPTP problems (all
2969 languages) into Isabelle/HOL.
2974 * New "case_product" attribute (see HOL).
2979 * Greater support for structured proofs involving induction or case
2982 * Much greater use of mathematical symbols.
2984 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2989 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2990 from a minor keyword introduced via theory header declaration.
2992 * Antiquotation @{command_spec "name"} produces the
2993 Outer_Syntax.command_spec from a major keyword introduced via theory
2994 header declaration; it can be passed to Outer_Syntax.command etc.
2996 * Local_Theory.define no longer hard-wires default theorem name
2997 "foo_def", but retains the binding as given. If that is Binding.empty
2998 / Attrib.empty_binding, the result is not registered as user-level
2999 fact. The Local_Theory.define_internal variant allows to specify a
3000 non-empty name (used for the foundation in the background theory),
3001 while omitting the fact binding in the user-context. Potential
3002 INCOMPATIBILITY for derived definitional packages: need to specify
3003 naming policy for primitive definitions more explicitly.
3005 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3006 conformance with similar operations in structure Term and Logic.
3008 * Antiquotation @{attributes [...]} embeds attribute source
3009 representation into the ML text, which is particularly useful with
3010 declarations like Local_Theory.note.
3012 * Structure Proof_Context follows standard naming scheme. Old
3013 ProofContext has been discontinued. INCOMPATIBILITY.
3015 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3016 change of semantics: update is applied to auxiliary local theory
3019 * Modernized some old-style infix operations:
3021 addeqcongs ~> Simplifier.add_eqcong
3022 deleqcongs ~> Simplifier.del_eqcong
3023 addcongs ~> Simplifier.add_cong
3024 delcongs ~> Simplifier.del_cong
3025 setmksimps ~> Simplifier.set_mksimps
3026 setmkcong ~> Simplifier.set_mkcong
3027 setmksym ~> Simplifier.set_mksym
3028 setmkeqTrue ~> Simplifier.set_mkeqTrue
3029 settermless ~> Simplifier.set_termless
3030 setsubgoaler ~> Simplifier.set_subgoaler
3031 addsplits ~> Splitter.add_split
3032 delsplits ~> Splitter.del_split
3037 * USER_HOME settings variable points to cross-platform user home
3038 directory, which coincides with HOME on POSIX systems only. Likewise,
3039 the Isabelle path specification "~" now expands to $USER_HOME, instead
3040 of former $HOME. A different default for USER_HOME may be set
3041 explicitly in shell environment, before Isabelle settings are
3042 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3043 the generic user home was intended.
3045 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3046 notation, which is useful for the jEdit file browser, for example.
3048 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3053 New in Isabelle2011-1 (October 2011)
3054 ------------------------------------
3058 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3059 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3061 - Management of multiple theory files directly from the editor
3062 buffer store -- bypassing the file-system (no requirement to save
3063 files for checking).
3065 - Markup of formal entities within the text buffer, with semantic
3066 highlighting, tooltips and hyperlinks to jump to defining source
3069 - Improved text rendering, with sub/superscripts in the source
3070 buffer (including support for copy/paste wrt. output panel, HTML
3071 theory output and other non-Isabelle text boxes).
3073 - Refined scheduling of proof checking and printing of results,
3074 based on interactive editor view. (Note: jEdit folding and
3075 narrowing allows to restrict buffer perspectives explicitly.)
3077 - Reduced CPU performance requirements, usable on machines with few
3080 - Reduced memory requirements due to pruning of unused document
3081 versions (garbage collection).
3083 See also ~~/src/Tools/jEdit/README.html for further information,
3084 including some remaining limitations.
3086 * Theory loader: source files are exclusively located via the master
3087 directory of each theory node (where the .thy file itself resides).
3088 The global load path (such as src/HOL/Library) has been discontinued.
3089 Note that the path element ~~ may be used to reference theories in the
3090 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3093 * Theory loader: source files are identified by content via SHA1
3094 digests. Discontinued former path/modtime identification and optional
3095 ISABELLE_FILE_IDENT plugin scripts.
3097 * Parallelization of nested Isar proofs is subject to
3098 Goal.parallel_proofs_threshold (default 100). See also isabelle
3101 * Name space: former unsynchronized references are now proper
3102 configuration options, with more conventional names:
3104 long_names ~> names_long
3105 short_names ~> names_short
3106 unique_names ~> names_unique
3108 Minor INCOMPATIBILITY, need to declare options in context like this:
3110 declare [[names_unique = false]]
3112 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3113 that the result needs to be unique, which means fact specifications
3114 may have to be refined after enriching a proof context.
3116 * Attribute "case_names" has been refined: the assumptions in each case
3117 can be named now by following the case name with [name1 name2 ...].
3119 * Isabelle/Isar reference manual has been updated and extended:
3120 - "Synopsis" provides a catalog of main Isar language concepts.
3121 - Formal references in syntax diagrams, via @{rail} antiquotation.
3122 - Updated material from classic "ref" manual, notably about
3123 "Classical Reasoner".
3128 * Class bot and top require underlying partial order rather than
3129 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3131 * Class complete_lattice: generalized a couple of lemmas from sets;
3132 generalized theorems INF_cong and SUP_cong. New type classes for
3133 complete boolean algebras and complete linear orders. Lemmas
3134 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3135 class complete_linorder.
3137 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3138 Sup_fun_def, Inf_apply, Sup_apply.
3140 Removed redundant lemmas (the right hand side gives hints how to
3141 replace them for (metis ...), or (simp only: ...) proofs):
3143 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3144 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3145 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3146 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3147 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3148 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3149 Inter_def ~> INF_def, image_def
3150 Union_def ~> SUP_def, image_def
3151 INT_eq ~> INF_def, and image_def
3152 UN_eq ~> SUP_def, and image_def
3153 INF_subset ~> INF_superset_mono [OF _ order_refl]
3155 More consistent and comprehensive names:
3157 INTER_eq_Inter_image ~> INF_def
3158 UNION_eq_Union_image ~> SUP_def
3161 INF_leI ~> INF_lower
3162 INF_leI2 ~> INF_lower2
3163 le_INFI ~> INF_greatest
3164 le_SUPI ~> SUP_upper
3165 le_SUPI2 ~> SUP_upper2
3166 SUP_leI ~> SUP_least
3167 INFI_bool_eq ~> INF_bool_eq
3168 SUPR_bool_eq ~> SUP_bool_eq
3169 INFI_apply ~> INF_apply
3170 SUPR_apply ~> SUP_apply
3171 INTER_def ~> INTER_eq
3172 UNION_def ~> UNION_eq
3176 * Renamed theory Complete_Lattice to Complete_Lattices.
3179 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3180 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3181 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3182 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3184 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3185 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3186 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3189 * Added syntactic classes "inf" and "sup" for the respective
3190 constants. INCOMPATIBILITY: Changes in the argument order of the
3191 (mostly internal) locale predicates for some derived classes.
3193 * Theorem collections ball_simps and bex_simps do not contain theorems
3194 referring to UNION any longer; these have been moved to collection
3195 UN_ball_bex_simps. INCOMPATIBILITY.
3197 * Theory Archimedean_Field: floor now is defined as parameter of a
3198 separate type class floor_ceiling.
3200 * Theory Finite_Set: more coherent development of fold_set locales:
3202 locale fun_left_comm ~> locale comp_fun_commute
3203 locale fun_left_comm_idem ~> locale comp_fun_idem
3205 Both use point-free characterization; interpretation proofs may need
3206 adjustment. INCOMPATIBILITY.
3208 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3209 accordance with standard mathematical terminology. INCOMPATIBILITY.
3211 * Theory Complex_Main: The locale interpretations for the
3212 bounded_linear and bounded_bilinear locales have been removed, in
3213 order to reduce the number of duplicate lemmas. Users must use the
3214 original names for distributivity theorems, potential INCOMPATIBILITY.
3216 divide.add ~> add_divide_distrib
3217 divide.diff ~> diff_divide_distrib
3218 divide.setsum ~> setsum_divide_distrib
3219 mult.add_right ~> right_distrib
3220 mult.diff_right ~> right_diff_distrib
3221 mult_right.setsum ~> setsum_right_distrib
3222 mult_left.diff ~> left_diff_distrib
3224 * Theory Complex_Main: Several redundant theorems have been removed or
3225 replaced by more general versions. INCOMPATIBILITY.
3227 real_diff_def ~> minus_real_def
3228 real_divide_def ~> divide_real_def
3229 real_less_def ~> less_le
3230 real_abs_def ~> abs_real_def
3231 real_sgn_def ~> sgn_real_def
3232 real_mult_commute ~> mult_commute
3233 real_mult_assoc ~> mult_assoc
3234 real_mult_1 ~> mult_1_left
3235 real_add_mult_distrib ~> left_distrib
3236 real_zero_not_eq_one ~> zero_neq_one
3237 real_mult_inverse_left ~> left_inverse
3238 INVERSE_ZERO ~> inverse_zero
3239 real_le_refl ~> order_refl
3240 real_le_antisym ~> order_antisym
3241 real_le_trans ~> order_trans
3242 real_le_linear ~> linear
3243 real_le_eq_diff ~> le_iff_diff_le_0
3244 real_add_left_mono ~> add_left_mono
3245 real_mult_order ~> mult_pos_pos
3246 real_mult_less_mono2 ~> mult_strict_left_mono
3247 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3248 real_0_le_divide_iff ~> zero_le_divide_iff
3249 realpow_two_disj ~> power2_eq_iff
3250 real_squared_diff_one_factored ~> square_diff_one_factored
3251 realpow_two_diff ~> square_diff_square_factored
3252 reals_complete2 ~> complete_real
3253 real_sum_squared_expand ~> power2_sum
3254 exp_ln_eq ~> ln_unique
3256 expi_zero ~> exp_zero
3257 lemma_DERIV_subst ~> DERIV_cong
3258 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3259 LIMSEQ_const ~> tendsto_const
3260 LIMSEQ_norm ~> tendsto_norm
3261 LIMSEQ_add ~> tendsto_add
3262 LIMSEQ_minus ~> tendsto_minus
3263 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3264 LIMSEQ_diff ~> tendsto_diff
3265 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3266 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3267 LIMSEQ_mult ~> tendsto_mult
3268 LIMSEQ_inverse ~> tendsto_inverse
3269 LIMSEQ_divide ~> tendsto_divide
3270 LIMSEQ_pow ~> tendsto_power
3271 LIMSEQ_setsum ~> tendsto_setsum
3272 LIMSEQ_setprod ~> tendsto_setprod
3273 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3274 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3275 LIMSEQ_imp_rabs ~> tendsto_rabs
3276 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3277 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3278 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3279 LIMSEQ_Complex ~> tendsto_Complex
3280 LIM_ident ~> tendsto_ident_at
3281 LIM_const ~> tendsto_const
3282 LIM_add ~> tendsto_add
3283 LIM_add_zero ~> tendsto_add_zero
3284 LIM_minus ~> tendsto_minus
3285 LIM_diff ~> tendsto_diff
3286 LIM_norm ~> tendsto_norm
3287 LIM_norm_zero ~> tendsto_norm_zero
3288 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3289 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3290 LIM_rabs ~> tendsto_rabs
3291 LIM_rabs_zero ~> tendsto_rabs_zero
3292 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3293 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3294 LIM_compose ~> tendsto_compose
3295 LIM_mult ~> tendsto_mult
3296 LIM_scaleR ~> tendsto_scaleR
3297 LIM_of_real ~> tendsto_of_real
3298 LIM_power ~> tendsto_power
3299 LIM_inverse ~> tendsto_inverse
3300 LIM_sgn ~> tendsto_sgn
3301 isCont_LIM_compose ~> isCont_tendsto_compose
3302 bounded_linear.LIM ~> bounded_linear.tendsto
3303 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3304 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3305 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3306 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3307 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3308 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3310 * Theory Complex_Main: The definition of infinite series was
3311 generalized. Now it is defined on the type class {topological_space,
3312 comm_monoid_add}. Hence it is useable also for extended real numbers.
3314 * Theory Complex_Main: The complex exponential function "expi" is now
3315 a type-constrained abbreviation for "exp :: complex => complex"; thus
3316 several polymorphic lemmas about "exp" are now applicable to "expi".
3320 - Theory Library/Code_Char_ord provides native ordering of
3321 characters in the target language.
3323 - Commands code_module and code_library are legacy, use export_code
3326 - Method "evaluation" is legacy, use method "eval" instead.
3328 - Legacy evaluator "SML" is deactivated by default. May be
3329 reactivated by the following theory command:
3331 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3333 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3335 * New proof method "induction" that gives induction hypotheses the
3336 name "IH", thus distinguishing them from further hypotheses that come
3337 from rule induction. The latter are still called "hyps". Method
3338 "induction" is a thin wrapper around "induct" and follows the same
3341 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3342 still available as a legacy feature for some time.
3345 - Added "need" and "total_consts" options.
3346 - Reintroduced "show_skolems" option by popular demand.
3347 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3351 - Use quasi-sound (and efficient) translations by default.
3352 - Added support for the following provers: E-ToFoF, LEO-II,
3353 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3354 - Automatically preplay and minimize proofs before showing them if
3355 this can be done within reasonable time.
3356 - sledgehammer available_provers ~> sledgehammer supported_provers.
3358 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3359 "max_mono_iters", and "max_new_mono_instances" options.
3360 - Removed "explicit_apply" and "full_types" options as well as "Full
3361 Types" Proof General menu item. INCOMPATIBILITY.
3364 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3365 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3369 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3370 "elim:" options. INCOMPATIBILITY.
3371 - Introduced 'try' that not only runs 'try_methods' but also
3372 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3375 - Added "eval" option to evaluate terms for the found counterexample
3376 (currently only supported by the default (exhaustive) tester).
3377 - Added post-processing of terms to obtain readable counterexamples
3378 (currently only supported by the default (exhaustive) tester).
3379 - New counterexample generator quickcheck[narrowing] enables
3380 narrowing-based testing. Requires the Glasgow Haskell compiler
3381 with its installation location defined in the Isabelle settings
3382 environment as ISABELLE_GHC.
3383 - Removed quickcheck tester "SML" based on the SML code generator
3384 (formly in HOL/Library).
3386 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3387 use 'partial_function' instead.
3389 * Theory Library/Extended_Reals replaces now the positive extended
3390 reals found in probability theory. This file is extended by
3391 Multivariate_Analysis/Extended_Real_Limits.
3393 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3394 from where it must be imported explicitly if it is really required.
3397 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3398 been moved here. INCOMPATIBILITY.
3400 * Theory Library/Saturated provides type of numbers with saturated
3403 * Theory Library/Product_Lattice defines a pointwise ordering for the
3404 product type 'a * 'b, and provides instance proofs for various order
3405 and lattice type classes.
3407 * Theory Library/Countable now provides the "countable_datatype" proof
3408 method for proving "countable" class instances for datatypes.
3410 * Theory Library/Cset_Monad allows do notation for computable sets
3411 (cset) via the generic monad ad-hoc overloading facility.
3413 * Library: Theories of common data structures are split into theories
3414 for implementation, an invariant-ensuring type, and connection to an
3415 abstract type. INCOMPATIBILITY.
3417 - RBT is split into RBT and RBT_Mapping.
3418 - AssocList is split and renamed into AList and AList_Mapping.
3419 - DList is split into DList_Impl, DList, and DList_Cset.
3420 - Cset is split into Cset and List_Cset.
3422 * Theory Library/Nat_Infinity has been renamed to
3423 Library/Extended_Nat, with name changes of the following types and
3426 type inat ~> type enat
3428 Infty ~> infinity (overloaded)
3432 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3433 been renamed accordingly. INCOMPATIBILITY.
3435 * Session Multivariate_Analysis: The euclidean_space type class now
3436 fixes a constant "Basis :: 'a set" consisting of the standard
3437 orthonormal basis for the type. Users now have the option of
3438 quantifying over this set instead of using the "basis" function, e.g.
3439 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3441 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3442 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3443 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3444 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3445 changed to match. Definition theorems for overloaded constants now use
3446 the standard "foo_vec_def" naming scheme. A few other theorems have
3447 been renamed as follows (INCOMPATIBILITY):
3449 Cart_eq ~> vec_eq_iff
3450 dist_nth_le_cart ~> dist_vec_nth_le
3451 tendsto_vector ~> vec_tendstoI
3452 Cauchy_vector ~> vec_CauchyI
3454 * Session Multivariate_Analysis: Several duplicate theorems have been
3455 removed, and other theorems have been renamed or replaced with more
3456 general versions. INCOMPATIBILITY.
3458 finite_choice ~> finite_set_choice
3459 eventually_conjI ~> eventually_conj
3460 eventually_and ~> eventually_conj_iff
3461 eventually_false ~> eventually_False
3462 setsum_norm ~> norm_setsum
3463 Lim_sequentially ~> LIMSEQ_def
3464 Lim_ident_at ~> LIM_ident
3465 Lim_const ~> tendsto_const
3466 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3467 Lim_neg ~> tendsto_minus
3468 Lim_add ~> tendsto_add
3469 Lim_sub ~> tendsto_diff
3470 Lim_mul ~> tendsto_scaleR
3471 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3472 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3473 Lim_linear ~> bounded_linear.tendsto
3474 Lim_component ~> tendsto_euclidean_component
3475 Lim_component_cart ~> tendsto_vec_nth
3476 Lim_inner ~> tendsto_inner [OF tendsto_const]
3477 dot_lsum ~> inner_setsum_left
3478 dot_rsum ~> inner_setsum_right
3479 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3480 continuous_neg ~> continuous_minus
3481 continuous_sub ~> continuous_diff
3482 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3483 continuous_mul ~> continuous_scaleR
3484 continuous_inv ~> continuous_inverse
3485 continuous_at_within_inv ~> continuous_at_within_inverse
3486 continuous_at_inv ~> continuous_at_inverse
3487 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3488 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3489 continuous_at_component ~> continuous_component [OF continuous_at_id]
3490 continuous_on_neg ~> continuous_on_minus
3491 continuous_on_sub ~> continuous_on_diff
3492 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3493 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3494 continuous_on_mul ~> continuous_on_scaleR
3495 continuous_on_mul_real ~> continuous_on_mult
3496 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3497 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3498 continuous_on_inverse ~> continuous_on_inv
3499 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3500 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3501 subset_interior ~> interior_mono
3502 subset_closure ~> closure_mono
3503 closure_univ ~> closure_UNIV
3504 real_arch_lt ~> reals_Archimedean2
3505 real_arch ~> reals_Archimedean3
3506 real_abs_norm ~> abs_norm_cancel
3507 real_abs_sub_norm ~> norm_triangle_ineq3
3508 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3510 * Session HOL-Probability:
3511 - Caratheodory's extension lemma is now proved for ring_of_sets.
3512 - Infinite products of probability measures are now available.
3513 - Sigma closure is independent, if the generator is independent
3514 - Use extended reals instead of positive extended
3515 reals. INCOMPATIBILITY.
3517 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3519 expand_fun_below ~> fun_below_iff
3520 below_fun_ext ~> fun_belowI
3521 expand_cfun_eq ~> cfun_eq_iff
3522 ext_cfun ~> cfun_eqI
3523 expand_cfun_below ~> cfun_below_iff
3524 below_cfun_ext ~> cfun_belowI
3525 monofun_fun_fun ~> fun_belowD
3526 monofun_fun_arg ~> monofunE
3527 monofun_lub_fun ~> adm_monofun [THEN admD]
3528 cont_lub_fun ~> adm_cont [THEN admD]
3529 cont2cont_Rep_CFun ~> cont2cont_APP
3530 cont_Rep_CFun_app ~> cont_APP_app
3531 cont_Rep_CFun_app_app ~> cont_APP_app_app
3532 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3533 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3534 contlub_cfun ~> lub_APP [symmetric]
3535 contlub_LAM ~> lub_LAM [symmetric]
3538 lift_distinct1 ~> lift.distinct(1)
3539 lift_distinct2 ~> lift.distinct(2)
3540 Def_not_UU ~> lift.distinct(2)
3541 Def_inject ~> lift.inject
3542 below_UU_iff ~> below_bottom_iff
3543 eq_UU_iff ~> eq_bottom_iff
3546 *** Document preparation ***
3548 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3549 isar-ref manual, both for description and actual application of the
3552 * Antiquotation @{value} evaluates the given term and presents its
3555 * Antiquotations: term style "isub" provides ad-hoc conversion of
3556 variables x1, y23 into subscripted form x\<^isub>1,
3557 y\<^isub>2\<^isub>3.
3559 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3560 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3562 * Localized \isabellestyle switch can be used within blocks or groups
3565 \isabellestyle{it} %preferred default
3566 {\isabellestylett @{text "typewriter stuff"}}
3568 * Discontinued special treatment of hard tabulators. Implicit
3569 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3575 * The inner syntax of sort/type/term/prop supports inlined YXML
3576 representations within quoted string tokens. By encoding logical
3577 entities via Term_XML (in ML or Scala) concrete syntax can be
3578 bypassed, which is particularly useful for producing bits of text
3579 under external program control.
3581 * Antiquotations for ML and document preparation are managed as theory
3582 data, which requires explicit setup.
3584 * Isabelle_Process.is_active allows tools to check if the official
3585 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3586 (better known as Proof General).
3588 * Structure Proof_Context follows standard naming scheme. Old
3589 ProofContext is still available for some time as legacy alias.
3591 * Structure Timing provides various operations for timing; supersedes
3592 former start_timing/end_timing etc.
3594 * Path.print is the official way to show file-system paths to users
3595 (including quotes etc.).
3597 * Inner syntax: identifiers in parse trees of generic categories
3598 "logic", "aprop", "idt" etc. carry position information (disguised as
3599 type constraints). Occasional INCOMPATIBILITY with non-compliant
3600 translations that choke on unexpected type constraints. Positions can
3601 be stripped in ML translations via Syntax.strip_positions /
3602 Syntax.strip_positions_ast, or via the syntax constant
3603 "_strip_positions" within parse trees. As last resort, positions can
3604 be disabled via the configuration option Syntax.positions, which is
3605 called "syntax_positions" in Isar attribute syntax.
3607 * Discontinued special status of various ML structures that contribute
3608 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3609 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3610 refer directly to Ast.Constant, Lexicon.is_identifier,
3611 Syntax_Trans.mk_binder_tr etc.
3613 * Typed print translation: discontinued show_sorts argument, which is
3614 already available via context of "advanced" translation.
3616 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3617 goal states; body tactic needs to address all subgoals uniformly.
3619 * Slightly more special eq_list/eq_set, with shortcut involving
3620 pointer equality (assumes that eq relation is reflexive).
3622 * Classical tactics use proper Proof.context instead of historic types
3623 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3624 operate directly on Proof.context. Raw type claset retains its use as
3625 snapshot of the classical context, which can be recovered via
3626 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3627 INCOMPATIBILITY, classical tactics and derived proof methods require
3628 proper Proof.context.
3633 * Discontinued support for Poly/ML 5.2, which was the last version
3634 without proper multithreading and TimeLimit implementation.
3636 * Discontinued old lib/scripts/polyml-platform, which has been
3637 obsolete since Isabelle2009-2.
3639 * Various optional external tools are referenced more robustly and
3640 uniformly by explicit Isabelle settings as follows:
3642 ISABELLE_CSDP (formerly CSDP_EXE)
3643 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3644 ISABELLE_OCAML (formerly EXEC_OCAML)
3645 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3646 ISABELLE_YAP (formerly EXEC_YAP)
3648 Note that automated detection from the file-system or search path has
3649 been discontinued. INCOMPATIBILITY.
3651 * Scala layer provides JVM method invocation service for static
3652 methods of type (String)String, see Invoke_Scala.method in ML. For
3655 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3657 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3658 this allows to pass structured values between ML and Scala.
3660 * The IsabelleText fonts includes some further glyphs to support the
3661 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3662 installed a local copy (which is normally *not* required) need to
3663 delete or update it from ~~/lib/fonts/.
3667 New in Isabelle2011 (January 2011)
3668 ----------------------------------
3672 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3673 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3674 useful tooltips and hyperlinks produced from its static analysis. The
3675 bundled component provides an executable Isabelle tool that can be run
3678 Isabelle2011/bin/isabelle jedit
3680 * Significantly improved Isabelle/Isar implementation manual.
3682 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3683 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3684 while the default heap location within that directory lacks that extra
3685 suffix. This isolates multiple Isabelle installations from each
3686 other, avoiding problems with old settings in new versions.
3687 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3689 * Source files are always encoded as UTF-8, instead of old-fashioned
3690 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3691 the following package declarations:
3693 \usepackage[utf8]{inputenc}
3694 \usepackage{textcomp}
3696 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3697 a Unicode character is treated as a single symbol, not a sequence of
3698 non-ASCII bytes as before. Since Isabelle/ML string literals may
3699 contain symbols without further backslash escapes, Unicode can now be
3700 used here as well. Recall that Symbol.explode in ML provides a
3701 consistent view on symbols, while raw explode (or String.explode)
3702 merely give a byte-oriented representation.
3704 * Theory loader: source files are primarily located via the master
3705 directory of each theory node (where the .thy file itself resides).
3706 The global load path is still partially available as legacy feature.
3707 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3708 explicit paths, relatively to the theory.
3710 * Special treatment of ML file names has been discontinued.
3711 Historically, optional extensions .ML or .sml were added on demand --
3712 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3713 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3715 * Various options that affect pretty printing etc. are now properly
3716 handled within the context via configuration options, instead of
3717 unsynchronized references or print modes. There are both ML Config.T
3718 entities and Isar declaration attributes to access these.
3720 ML (Config.T) Isar (attribute)
3722 eta_contract eta_contract
3723 show_brackets show_brackets
3724 show_sorts show_sorts
3725 show_types show_types
3726 show_question_marks show_question_marks
3727 show_consts show_consts
3728 show_abbrevs show_abbrevs
3730 Syntax.ast_trace syntax_ast_trace
3731 Syntax.ast_stat syntax_ast_stat
3732 Syntax.ambiguity_level syntax_ambiguity_level
3734 Goal_Display.goals_limit goals_limit
3735 Goal_Display.show_main_goal show_main_goal
3737 Method.rule_trace rule_trace
3739 Thy_Output.display thy_output_display
3740 Thy_Output.quotes thy_output_quotes
3741 Thy_Output.indent thy_output_indent
3742 Thy_Output.source thy_output_source
3743 Thy_Output.break thy_output_break
3745 Note that corresponding "..._default" references in ML may only be
3746 changed globally at the ROOT session setup, but *not* within a theory.
3747 The option "show_abbrevs" supersedes the former print mode
3748 "no_abbrevs" with inverted meaning.
3750 * More systematic naming of some configuration options.
3753 trace_simp ~> simp_trace
3754 debug_simp ~> simp_debug
3756 * Support for real valued configuration options, using simplistic
3757 floating-point notation that coincides with the inner syntax for
3760 * Support for real valued preferences (with approximative PGIP type):
3761 front-ends need to accept "pgint" values in float notation.
3764 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3767 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3772 * Command 'type_synonym' (with single argument) replaces somewhat
3773 outdated 'types', which is still available as legacy feature for some
3776 * Command 'nonterminal' (with 'and' separated list of arguments)
3777 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3779 * Command 'notepad' replaces former 'example_proof' for
3780 experimentation in Isar without any result. INCOMPATIBILITY.
3782 * Locale interpretation commands 'interpret' and 'sublocale' accept
3783 lists of equations to map definitions in a locale to appropriate
3784 entities in the context of the interpretation. The 'interpretation'
3785 command already provided this functionality.
3787 * Diagnostic command 'print_dependencies' prints the locale instances
3788 that would be activated if the specified expression was interpreted in
3789 the current context. Variant "print_dependencies!" assumes a context
3790 without interpretations.
3792 * Diagnostic command 'print_interps' prints interpretations in proofs
3793 in addition to interpretations in theories.
3795 * Discontinued obsolete 'global' and 'local' commands to manipulate
3796 the theory name space. Rare INCOMPATIBILITY. The ML functions
3797 Sign.root_path and Sign.local_path may be applied directly where this
3798 feature is still required for historical reasons.
3800 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3801 'definition' instead.
3803 * The "prems" fact, which refers to the accidental collection of
3804 foundational premises in the context, is now explicitly marked as
3805 legacy feature and will be discontinued soon. Consider using "assms"
3806 of the head statement or reference facts by explicit names.
3808 * Document antiquotations @{class} and @{type} print classes and type
3811 * Document antiquotation @{file} checks file/directory entries within
3812 the local file system.
3817 * Coercive subtyping: functions can be declared as coercions and type
3818 inference will add them as necessary upon input of a term. Theory
3819 Complex_Main declares real :: nat => real and real :: int => real as
3820 coercions. A coercion function f is declared like this:
3822 declare [[coercion f]]
3824 To lift coercions through type constructors (e.g. from nat => real to
3825 nat list => real list), map functions can be declared, e.g.
3827 declare [[coercion_map map]]
3829 Currently coercion inference is activated only in theories including
3830 real numbers, i.e. descendants of Complex_Main. This is controlled by
3831 the configuration option "coercion_enabled", e.g. it can be enabled in
3832 other theories like this:
3834 declare [[coercion_enabled]]
3836 * Command 'partial_function' provides basic support for recursive
3837 function definitions over complete partial orders. Concrete instances
3838 are provided for i) the option type, ii) tail recursion on arbitrary
3839 types, and iii) the heap monad of Imperative_HOL. See
3840 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3843 * Function package: f.psimps rules are no longer implicitly declared
3844 as [simp]. INCOMPATIBILITY.
3846 * Datatype package: theorems generated for executable equality (class
3847 "eq") carry proper names and are treated as default code equations.
3849 * Inductive package: now offers command 'inductive_simps' to
3850 automatically derive instantiated and simplified equations for
3851 inductive predicates, similar to 'inductive_cases'.
3853 * Command 'enriched_type' allows to register properties of the
3854 functorial structure of types.
3856 * Improved infrastructure for term evaluation using code generator
3857 techniques, in particular static evaluation conversions.
3859 * Code generator: Scala (2.8 or higher) has been added to the target
3862 * Code generator: globbing constant expressions "*" and "Theory.*"
3863 have been replaced by the more idiomatic "_" and "Theory._".
3866 * Code generator: export_code without explicit file declaration prints
3867 to standard output. INCOMPATIBILITY.
3869 * Code generator: do not print function definitions for case
3870 combinators any longer.
3872 * Code generator: simplification with rules determined with
3873 src/Tools/Code/code_simp.ML and method "code_simp".
3875 * Code generator for records: more idiomatic representation of record
3876 types. Warning: records are not covered by ancient SML code
3877 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3878 rep_datatype declaration helps to succeed then:
3882 rep_datatype foo_ext ...
3884 * Records: logical foundation type for records does not carry a
3885 '_type' suffix any longer (obsolete due to authentic syntax).
3888 * Quickcheck now by default uses exhaustive testing instead of random
3889 testing. Random testing can be invoked by "quickcheck [random]",
3890 exhaustive testing by "quickcheck [exhaustive]".
3892 * Quickcheck instantiates polymorphic types with small finite
3893 datatypes by default. This enables a simple execution mechanism to
3894 handle quantifiers and function equality over the finite datatypes.
3896 * Quickcheck random generator has been renamed from "code" to
3897 "random". INCOMPATIBILITY.
3899 * Quickcheck now has a configurable time limit which is set to 30
3900 seconds by default. This can be changed by adding [timeout = n] to the
3901 quickcheck command. The time limit for Auto Quickcheck is still set
3904 * Quickcheck in locales considers interpretations of that locale for
3905 counter example search.
3908 - Added "smt" and "remote_smt" provers based on the "smt" proof
3909 method. See the Sledgehammer manual for details ("isabelle doc
3912 sledgehammer atp_info ~> sledgehammer running_provers
3913 sledgehammer atp_kill ~> sledgehammer kill_provers
3914 sledgehammer available_atps ~> sledgehammer available_provers
3917 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3918 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3919 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3920 (and "ms" and "min" are no longer supported)
3925 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3926 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3928 - Added support for partial quotient types.
3929 - Added local versions of the "Nitpick.register_xxx" functions.
3930 - Added "whack" option.
3931 - Allow registration of quotient types as codatatypes.
3932 - Improved "merge_type_vars" option to merge more types.
3933 - Removed unsound "fast_descrs" option.
3934 - Added custom symmetry breaking for datatypes, making it possible to reach
3935 higher cardinalities.
3936 - Prevent the expansion of too large definitions.
3938 * Proof methods "metis" and "meson" now have configuration options
3939 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3940 to diagnose these tools. E.g.
3942 using [[metis_trace = true]]
3944 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3945 manually as command 'solve_direct'.
3947 * The default SMT solver Z3 must be enabled explicitly (due to
3948 licensing issues) by setting the environment variable
3949 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3950 commercial applications, the SMT solver CVC3 is provided as fall-back;
3951 changing the SMT solver is done via the configuration option
3954 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3955 i.e. "remote_cvc3" and "remote_z3".
3957 * Added basic SMT support for datatypes, records, and typedefs using
3958 the oracle mode (no proofs). Direct support of pairs has been dropped
3959 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3960 support for a similar behavior). Minor INCOMPATIBILITY.
3962 * Changed SMT configuration options:
3964 z3_proofs ~> smt_oracle (with inverted meaning)
3965 z3_trace_assms ~> smt_trace_used_facts
3978 * Boogie output files (.b2i files) need to be declared in the theory
3981 * Simplification procedure "list_to_set_comprehension" rewrites list
3982 comprehensions applied to List.set to set comprehensions. Occasional
3983 INCOMPATIBILITY, may be deactivated like this:
3985 declare [[simproc del: list_to_set_comprehension]]
3987 * Removed old version of primrec package. INCOMPATIBILITY.
3989 * Removed simplifier congruence rule of "prod_case", as has for long
3990 been the case with "split". INCOMPATIBILITY.
3992 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3994 * Removed [split_format ... and ... and ...] version of
3995 [split_format]. Potential INCOMPATIBILITY.
3997 * Predicate "sorted" now defined inductively, with nice induction
3998 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4000 * Constant "contents" renamed to "the_elem", to free the generic name
4001 contents for other uses. INCOMPATIBILITY.
4003 * Renamed class eq and constant eq (for code generation) to class
4004 equal and constant equal, plus renaming of related facts and various
4005 tuning. INCOMPATIBILITY.
4007 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4009 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4012 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4013 avoid confusion with finite sets. INCOMPATIBILITY.
4015 * Abandoned locales equiv, congruent and congruent2 for equivalence
4016 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4019 * Some previously unqualified names have been qualified:
4026 Trueprop ~> HOL.Trueprop
4031 op --> ~> HOL.implies
4043 Pair ~> Product_Type.Pair
4044 fst ~> Product_Type.fst
4045 snd ~> Product_Type.snd
4046 curry ~> Product_Type.curry
4048 Collect ~> Set.Collect
4052 * More canonical naming convention for some fundamental definitions:
4054 bot_bool_eq ~> bot_bool_def
4055 top_bool_eq ~> top_bool_def
4056 inf_bool_eq ~> inf_bool_def
4057 sup_bool_eq ~> sup_bool_def
4058 bot_fun_eq ~> bot_fun_def
4059 top_fun_eq ~> top_fun_def
4060 inf_fun_eq ~> inf_fun_def
4061 sup_fun_eq ~> sup_fun_def
4065 * More stylized fact names:
4067 expand_fun_eq ~> fun_eq_iff
4068 expand_set_eq ~> set_eq_iff
4070 nat_number ~> eval_nat_numeral
4074 * Refactoring of code-generation specific operations in theory List:
4080 mem_iff ~> member_def
4081 null_empty ~> null_def
4083 INCOMPATIBILITY. Note that these were not supposed to be used
4084 regularly unless for striking reasons; their main purpose was code
4087 Various operations from the Haskell prelude are used for generating
4090 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4091 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4092 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4094 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4095 "*" and "+" respectively. INCOMPATIBILITY.
4097 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4098 "Sum_Type.Plus" instead.
4100 * Constant "split" has been merged with constant "prod_case"; names of
4101 ML functions, facts etc. involving split have been retained so far,
4102 though. INCOMPATIBILITY.
4104 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4105 instead. INCOMPATIBILITY.
4107 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4110 * Former theory Library/Enum is now part of the HOL-Main image.
4111 INCOMPATIBILITY: all constants of the Enum theory now have to be
4112 referred to by its qualified name.
4115 nlists ~> Enum.nlists
4116 product ~> Enum.product
4118 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4119 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4122 * Theory Library/SetsAndFunctions has been split into
4123 Library/Function_Algebras and Library/Set_Algebras; canonical names
4124 for instance definitions for functions; various improvements.
4127 * Theory Library/Multiset provides stable quicksort implementation of
4130 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4133 * Session Multivariate_Analysis: introduced a type class for euclidean
4134 space. Most theorems are now stated in terms of euclidean spaces
4135 instead of finite cartesian products.
4138 real ^ 'n ~> 'a::real_vector
4139 ~> 'a::euclidean_space
4140 ~> 'a::ordered_euclidean_space
4141 (depends on your needs)
4145 \<chi> x. _ ~> \<chi>\<chi> x. _
4148 Also note that the indices are now natural numbers and not from some
4149 finite type. Finite cartesian products of euclidean spaces, products
4150 of euclidean spaces the real and complex numbers are instantiated to
4151 be euclidean_spaces. INCOMPATIBILITY.
4153 * Session Probability: introduced pextreal as positive extended real
4154 numbers. Use pextreal as value for measures. Introduce the
4155 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4156 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4157 the integral in Multivariate Analysis. INCOMPATIBILITY.
4159 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4162 * Session SPARK (with image HOL-SPARK) provides commands to load and
4163 prove verification conditions generated by the SPARK Ada program
4164 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4169 * Theorems for additive ring operations (locale abelian_monoid and
4170 descendants) are generated by interpretation from their multiplicative
4171 counterparts. Names (in particular theorem names) have the mandatory
4172 qualifier 'add'. Previous theorem names are redeclared for
4175 * Structure "int_ring" is now an abbreviation (previously a
4176 definition). This fits more natural with advanced interpretations.
4181 * The domain package now runs in definitional mode by default: The
4182 former command 'new_domain' is now called 'domain'. To use the domain
4183 package in its original axiomatic mode, use 'domain (unsafe)'.
4186 * The new class "domain" is now the default sort. Class "predomain"
4187 is an unpointed version of "domain". Theories can be updated by
4188 replacing sort annotations as shown below. INCOMPATIBILITY.
4190 'a::type ~> 'a::countable
4191 'a::cpo ~> 'a::predomain
4192 'a::pcpo ~> 'a::domain
4194 * The old type class "rep" has been superseded by class "domain".
4195 Accordingly, users of the definitional package must remove any
4196 "default_sort rep" declarations. INCOMPATIBILITY.
4198 * The domain package (definitional mode) now supports unpointed
4199 predomain argument types, as long as they are marked 'lazy'. (Strict
4200 arguments must be in class "domain".) For example, the following
4201 domain definition now works:
4203 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4205 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4206 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4207 'a option, and 'a list. Additionally, it configures fixrec and the
4208 domain package to work with these types. For example:
4210 fixrec isInl :: "('a + 'b) u -> tr"
4211 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4213 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4215 * The "(permissive)" option of fixrec has been replaced with a
4216 per-equation "(unchecked)" option. See
4217 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4219 * The "bifinite" class no longer fixes a constant "approx"; the class
4220 now just asserts that such a function exists. INCOMPATIBILITY.
4222 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4223 defines an embedding of type 'a defl into udom by default; instances
4224 of "bifinite" and "domain" classes are available in
4225 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4227 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4229 * The predicate "directed" has been removed. INCOMPATIBILITY.
4231 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4233 * The function "cprod_map" has been renamed to "prod_map".
4236 * The monadic bind operator on each powerdomain has new binder syntax
4237 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4238 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4240 * The infix syntax for binary union on each powerdomain has changed
4241 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4242 syntax. INCOMPATIBILITY.
4244 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4245 still supported as an input translation.
4247 * Renamed some theorems (the original names are also still available).
4249 expand_fun_below ~> fun_below_iff
4250 below_fun_ext ~> fun_belowI
4251 expand_cfun_eq ~> cfun_eq_iff
4252 ext_cfun ~> cfun_eqI
4253 expand_cfun_below ~> cfun_below_iff
4254 below_cfun_ext ~> cfun_belowI
4255 cont2cont_Rep_CFun ~> cont2cont_APP
4257 * The Abs and Rep functions for various types have changed names.
4258 Related theorem names have also changed to match. INCOMPATIBILITY.
4260 Rep_CFun ~> Rep_cfun
4261 Abs_CFun ~> Abs_cfun
4262 Rep_Sprod ~> Rep_sprod
4263 Abs_Sprod ~> Abs_sprod
4264 Rep_Ssum ~> Rep_ssum
4265 Abs_Ssum ~> Abs_ssum
4267 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4268 been renamed to *_bottom_iff. INCOMPATIBILITY.
4270 * Various changes to bisimulation/coinduction with domain package:
4272 - Definitions of "bisim" constants no longer mention definedness.
4273 - With mutual recursion, "bisim" predicate is now curried.
4274 - With mutual recursion, each type gets a separate coind theorem.
4275 - Variable names in bisim_def and coinduct rules have changed.
4279 * Case combinators generated by the domain package for type "foo" are
4280 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4282 * Several theorems have been renamed to more accurately reflect the
4283 names of constants and types involved. INCOMPATIBILITY.
4285 thelub_const ~> lub_const
4286 lub_const ~> is_lub_const
4288 is_lub_lub ~> is_lubD2
4290 unique_lub ~> is_lub_unique
4291 is_ub_lub ~> is_lub_rangeD1
4292 lub_bin_chain ~> is_lub_bin_chain
4293 lub_fun ~> is_lub_fun
4294 thelub_fun ~> lub_fun
4295 thelub_cfun ~> lub_cfun
4296 thelub_Pair ~> lub_Pair
4297 lub_cprod ~> is_lub_prod
4298 thelub_cprod ~> lub_prod
4299 minimal_cprod ~> minimal_prod
4300 inst_cprod_pcpo ~> inst_prod_pcpo
4302 compact_UU ~> compact_bottom
4303 deflation_UU ~> deflation_bottom
4304 finite_deflation_UU ~> finite_deflation_bottom
4306 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4308 sq_ord_less_eq_trans ~> below_eq_trans
4309 sq_ord_eq_less_trans ~> eq_below_trans
4310 refl_less ~> below_refl
4311 trans_less ~> below_trans
4312 antisym_less ~> below_antisym
4313 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4314 box_less ~> box_below
4315 rev_trans_less ~> rev_below_trans
4316 not_less2not_eq ~> not_below2not_eq
4317 less_UU_iff ~> below_UU_iff
4318 flat_less_iff ~> flat_below_iff
4319 adm_less ~> adm_below
4320 adm_not_less ~> adm_not_below
4321 adm_compact_not_less ~> adm_compact_not_below
4322 less_fun_def ~> below_fun_def
4323 expand_fun_less ~> fun_below_iff
4324 less_fun_ext ~> fun_belowI
4325 less_discr_def ~> below_discr_def
4326 discr_less_eq ~> discr_below_eq
4327 less_unit_def ~> below_unit_def
4328 less_cprod_def ~> below_prod_def
4329 prod_lessI ~> prod_belowI
4330 Pair_less_iff ~> Pair_below_iff
4331 fst_less_iff ~> fst_below_iff
4332 snd_less_iff ~> snd_below_iff
4333 expand_cfun_less ~> cfun_below_iff
4334 less_cfun_ext ~> cfun_belowI
4335 injection_less ~> injection_below
4336 less_up_def ~> below_up_def
4337 not_Iup_less ~> not_Iup_below
4338 Iup_less ~> Iup_below
4340 Def_inject_less_eq ~> Def_below_Def
4341 Def_less_is_eq ~> Def_below_iff
4342 spair_less_iff ~> spair_below_iff
4343 less_sprod ~> below_sprod
4344 spair_less ~> spair_below
4345 sfst_less_iff ~> sfst_below_iff
4346 ssnd_less_iff ~> ssnd_below_iff
4347 fix_least_less ~> fix_least_below
4348 dist_less_one ~> dist_below_one
4349 less_ONE ~> below_ONE
4350 ONE_less_iff ~> ONE_below_iff
4351 less_sinlD ~> below_sinlD
4352 less_sinrD ~> below_sinrD
4357 * All constant names are now qualified internally and use proper
4358 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4363 * Antiquotation @{assert} inlines a function bool -> unit that raises
4364 Fail if the argument is false. Due to inlining the source position of
4365 failed assertions is included in the error output.
4367 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4368 text is in practice always evaluated with a stable theory checkpoint.
4369 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4371 * Antiquotation @{theory A} refers to theory A from the ancestry of
4372 the current context, not any accidental theory loader state as before.
4373 Potential INCOMPATIBILITY, subtle change in semantics.
4375 * Syntax.pretty_priority (default 0) configures the required priority
4376 of pretty-printed output and thus affects insertion of parentheses.
4378 * Syntax.default_root (default "any") configures the inner syntax
4379 category (nonterminal symbol) for parsing of terms.
4381 * Former exception Library.UnequalLengths now coincides with
4382 ListPair.UnequalLengths.
4384 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4385 main functionality is provided by structure Simplifier.
4387 * Renamed raw "explode" function to "raw_explode" to emphasize its
4388 meaning. Note that internally to Isabelle, Symbol.explode is used in
4389 almost all situations.
4391 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4392 See implementation manual for further details on exceptions in
4395 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4398 * Renamed structure PureThy to Pure_Thy and moved most of its
4399 operations to structure Global_Theory, to emphasize that this is
4400 rarely-used global-only stuff.
4402 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4403 instead (or tracing for high-volume output).
4405 * Configuration option show_question_marks only affects regular pretty
4406 printing of types and terms, not raw Term.string_of_vname.
4408 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4409 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4410 @{thms} for most purposes.
4412 * ML structure Unsynchronized is never opened, not even in Isar
4413 interaction mode as before. Old Unsynchronized.set etc. have been
4414 discontinued -- use plain := instead. This should be *rare* anyway,
4415 since modern tools always work via official context data, notably
4416 configuration options.
4418 * Parallel and asynchronous execution requires special care concerning
4419 interrupts. Structure Exn provides some convenience functions that
4420 avoid working directly with raw Interrupt. User code must not absorb
4421 interrupts -- intermediate handling (for cleanup etc.) needs to be
4422 followed by re-raising of the original exception. Another common
4423 source of mistakes are "handle _" patterns, which make the meaning of
4424 the program subject to physical effects of the environment.
4428 New in Isabelle2009-2 (June 2010)
4429 ---------------------------------
4433 * Authentic syntax for *all* logical entities (type classes, type
4434 constructors, term constants): provides simple and robust
4435 correspondence between formal entities and concrete syntax. Within
4436 the parse tree / AST representations, "constants" are decorated by
4437 their category (class, type, const) and spelled out explicitly with
4438 their full internal name.
4440 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4441 and translations (translation rules and translation functions in ML).
4442 Some hints on upgrading:
4444 - Many existing uses of 'syntax' and 'translations' can be replaced
4445 by more modern 'type_notation', 'notation' and 'abbreviation',
4446 which are independent of this issue.
4448 - 'translations' require markup within the AST; the term syntax
4449 provides the following special forms:
4451 CONST c -- produces syntax version of constant c from context
4452 XCONST c -- literally c, checked as constant from context
4453 c -- literally c, if declared by 'syntax'
4455 Plain identifiers are treated as AST variables -- occasionally the
4456 system indicates accidental variables via the error "rhs contains
4459 Type classes and type constructors are marked according to their
4460 concrete syntax. Some old translations rules need to be written
4461 for the "type" category, using type constructor application
4462 instead of pseudo-term application of the default category
4465 - 'parse_translation' etc. in ML may use the following
4468 @{class_syntax c} -- type class c within parse tree / AST
4469 @{term_syntax c} -- type constructor c within parse tree / AST
4470 @{const_syntax c} -- ML version of "CONST c" above
4471 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4473 - Literal types within 'typed_print_translations', i.e. those *not*
4474 represented as pseudo-terms are represented verbatim. Use @{class
4475 c} or @{type_name c} here instead of the above syntax
4478 Note that old non-authentic syntax was based on unqualified base
4479 names, so all of the above "constant" names would coincide. Recall
4480 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4481 diagnose syntax problems.
4483 * Type constructors admit general mixfix syntax, not just infix.
4485 * Concrete syntax may be attached to local entities without a proof
4486 body, too. This works via regular mixfix annotations for 'fix',
4487 'def', 'obtain' etc. or via the explicit 'write' command, which is
4488 similar to the 'notation' command in theory specifications.
4490 * Discontinued unnamed infix syntax (legacy feature for many years) --
4491 need to specify constant name and syntax separately. Internal ML
4492 datatype constructors have been renamed from InfixName to Infix etc.
4493 Minor INCOMPATIBILITY.
4495 * Schematic theorem statements need to be explicitly markup as such,
4496 via commands 'schematic_lemma', 'schematic_theorem',
4497 'schematic_corollary'. Thus the relevance of the proof is made
4498 syntactically clear, which impacts performance in a parallel or
4499 asynchronous interactive environment. Minor INCOMPATIBILITY.
4501 * Use of cumulative prems via "!" in some proof methods has been
4502 discontinued (old legacy feature).
4504 * References 'trace_simp' and 'debug_simp' have been replaced by
4505 configuration options stored in the context. Enabling tracing (the
4506 case of debugging is similar) in proofs works via
4508 using [[trace_simp = true]]
4510 Tracing is then active for all invocations of the simplifier in
4511 subsequent goal refinement steps. Tracing may also still be enabled or
4512 disabled via the ProofGeneral settings menu.
4514 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4515 'hide_fact' replace the former 'hide' KIND command. Minor
4518 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4519 more efficient than combinations with -q1 or -q2.
4524 * Proofterms record type-class reasoning explicitly, using the
4525 "unconstrain" operation internally. This eliminates all sort
4526 constraints from a theorem and proof, introducing explicit
4527 OFCLASS-premises. On the proof term level, this operation is
4528 automatically applied at theorem boundaries, such that closed proofs
4529 are always free of sort constraints. INCOMPATIBILITY for tools that
4530 inspect proof terms.
4532 * Local theory specifications may depend on extra type variables that
4533 are not present in the result type -- arguments TYPE('a) :: 'a itself
4534 are added internally. For example:
4536 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4538 * Predicates of locales introduced by classes carry a mandatory
4539 "class" prefix. INCOMPATIBILITY.
4541 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4543 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4546 * Command 'code_reflect' allows to incorporate generated ML code into
4547 runtime environment; replaces immature code_datatype antiquotation.
4550 * Code generator: simple concept for abstract datatypes obeying
4553 * Code generator: details of internal data cache have no impact on the
4554 user space functionality any longer.
4556 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4557 subgoals. This is more appropriate for interpretations with 'where'.
4560 * Command 'example_proof' opens an empty proof body. This allows to
4561 experiment with Isar, without producing any persistent result.
4563 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4564 within a local theory context, with explicit checking of the
4565 constructors involved (in contrast to the raw 'syntax' versions).
4567 * Commands 'types' and 'typedecl' now work within a local theory
4568 context -- without introducing dependencies on parameters or
4569 assumptions, which is not possible in Isabelle/Pure.
4571 * Command 'defaultsort' has been renamed to 'default_sort', it works
4572 within a local theory context. Minor INCOMPATIBILITY.
4577 * Command 'typedef' now works within a local theory context -- without
4578 introducing dependencies on parameters or assumptions, which is not
4579 possible in Isabelle/Pure/HOL. Note that the logical environment may
4580 contain multiple interpretations of local typedefs (with different
4581 non-emptiness proofs), even in a global theory context.
4583 * New package for quotient types. Commands 'quotient_type' and
4584 'quotient_definition' may be used for defining types and constants by
4585 quotient constructions. An example is the type of integers created by
4586 quotienting pairs of natural numbers:
4589 intrel :: "(nat * nat) => (nat * nat) => bool"
4591 "intrel (x, y) (u, v) = (x + v = u + y)"
4593 quotient_type int = "nat * nat" / intrel
4594 by (auto simp add: equivp_def expand_fun_eq)
4597 "0::int" is "(0::nat, 0::nat)"
4599 The method "lifting" can be used to lift of theorems from the
4600 underlying "raw" type to the quotient type. The example
4601 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4602 construction and provides a reasoning infrastructure for finite sets.
4604 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4605 clash with new theory Quotient in Main HOL.
4607 * Moved the SMT binding into the main HOL session, eliminating
4608 separate HOL-SMT session.
4610 * List membership infix mem operation is only an input abbreviation.
4613 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4614 for future developements; former Library/Word.thy is still present in
4615 the AFP entry RSAPPS.
4617 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4618 longer shadowed. INCOMPATIBILITY.
4620 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4623 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4626 * Dropped normalizing_semiring etc; use the facts in semiring classes
4627 instead. INCOMPATIBILITY.
4629 * Dropped several real-specific versions of lemmas about floor and
4630 ceiling; use the generic lemmas from theory "Archimedean_Field"
4631 instead. INCOMPATIBILITY.
4633 floor_number_of_eq ~> floor_number_of
4634 le_floor_eq_number_of ~> number_of_le_floor
4635 le_floor_eq_zero ~> zero_le_floor
4636 le_floor_eq_one ~> one_le_floor
4637 floor_less_eq_number_of ~> floor_less_number_of
4638 floor_less_eq_zero ~> floor_less_zero
4639 floor_less_eq_one ~> floor_less_one
4640 less_floor_eq_number_of ~> number_of_less_floor
4641 less_floor_eq_zero ~> zero_less_floor
4642 less_floor_eq_one ~> one_less_floor
4643 floor_le_eq_number_of ~> floor_le_number_of
4644 floor_le_eq_zero ~> floor_le_zero
4645 floor_le_eq_one ~> floor_le_one
4646 floor_subtract_number_of ~> floor_diff_number_of
4647 floor_subtract_one ~> floor_diff_one
4648 ceiling_number_of_eq ~> ceiling_number_of
4649 ceiling_le_eq_number_of ~> ceiling_le_number_of
4650 ceiling_le_zero_eq ~> ceiling_le_zero
4651 ceiling_le_eq_one ~> ceiling_le_one
4652 less_ceiling_eq_number_of ~> number_of_less_ceiling
4653 less_ceiling_eq_zero ~> zero_less_ceiling
4654 less_ceiling_eq_one ~> one_less_ceiling
4655 ceiling_less_eq_number_of ~> ceiling_less_number_of
4656 ceiling_less_eq_zero ~> ceiling_less_zero
4657 ceiling_less_eq_one ~> ceiling_less_one
4658 le_ceiling_eq_number_of ~> number_of_le_ceiling
4659 le_ceiling_eq_zero ~> zero_le_ceiling
4660 le_ceiling_eq_one ~> one_le_ceiling
4661 ceiling_subtract_number_of ~> ceiling_diff_number_of
4662 ceiling_subtract_one ~> ceiling_diff_one
4664 * Theory "Finite_Set": various folding_XXX locales facilitate the
4665 application of the various fold combinators on finite sets.
4667 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4668 provides abstract red-black tree type which is backed by "RBT_Impl" as
4669 implementation. INCOMPATIBILTY.
4671 * Theory Library/Coinductive_List has been removed -- superseded by
4672 AFP/thys/Coinductive.
4674 * Theory PReal, including the type "preal" and related operations, has
4675 been removed. INCOMPATIBILITY.
4677 * Real: new development using Cauchy Sequences.
4679 * Split off theory "Big_Operators" containing setsum, setprod,
4680 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4682 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4683 "Int" etc. INCOMPATIBILITY.
4685 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4687 * New set of rules "ac_simps" provides combined assoc / commute
4688 rewrites for all interpretations of the appropriate generic locales.
4690 * Renamed theory "OrderedGroup" to "Groups" and split theory
4691 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4692 appropriate and more consistent names suitable for name prefixes
4693 within the HOL theories. INCOMPATIBILITY.
4695 * Some generic constants have been put to appropriate theories:
4696 - less_eq, less: Orderings
4697 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4698 - inverse, divide: Rings
4701 * More consistent naming of type classes involving orderings (and
4704 lower_semilattice ~> semilattice_inf
4705 upper_semilattice ~> semilattice_sup
4707 dense_linear_order ~> dense_linorder
4709 pordered_ab_group_add ~> ordered_ab_group_add
4710 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4711 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4712 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4713 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4714 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4715 pordered_cancel_semiring ~> ordered_cancel_semiring
4716 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4717 pordered_comm_ring ~> ordered_comm_ring
4718 pordered_comm_semiring ~> ordered_comm_semiring
4719 pordered_ring ~> ordered_ring
4720 pordered_ring_abs ~> ordered_ring_abs
4721 pordered_semiring ~> ordered_semiring
4723 ordered_ab_group_add ~> linordered_ab_group_add
4724 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4725 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4726 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4727 ordered_field ~> linordered_field
4728 ordered_field_no_lb ~> linordered_field_no_lb
4729 ordered_field_no_ub ~> linordered_field_no_ub
4730 ordered_field_dense_linear_order ~> dense_linordered_field
4731 ordered_idom ~> linordered_idom
4732 ordered_ring ~> linordered_ring
4733 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4734 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4735 ordered_ring_strict ~> linordered_ring_strict
4736 ordered_semidom ~> linordered_semidom
4737 ordered_semiring ~> linordered_semiring
4738 ordered_semiring_1 ~> linordered_semiring_1
4739 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4740 ordered_semiring_strict ~> linordered_semiring_strict
4742 The following slightly odd type classes have been moved to a
4743 separate theory Library/Lattice_Algebras:
4745 lordered_ab_group_add ~> lattice_ab_group_add
4746 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4747 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4748 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4749 lordered_ring ~> lattice_ring
4753 * Refined field classes:
4754 - classes division_ring_inverse_zero, field_inverse_zero,
4755 linordered_field_inverse_zero include rule inverse 0 = 0 --
4756 subsumes former division_by_zero class;
4757 - numerous lemmas have been ported from field to division_ring.
4760 * Refined algebra theorem collections:
4761 - dropped theorem group group_simps, use algebra_simps instead;
4762 - dropped theorem group ring_simps, use field_simps instead;
4763 - proper theorem collection field_simps subsumes former theorem
4764 groups field_eq_simps and field_simps;
4765 - dropped lemma eq_minus_self_iff which is a duplicate for
4769 * Theory Finite_Set and List: some lemmas have been generalized from
4772 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4773 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4774 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4775 union_Union_fold_union ~> sup_Sup_fold_sup
4776 Inter_fold_inter ~> Inf_fold_inf
4777 Union_fold_union ~> Sup_fold_sup
4778 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4779 union_UNION_fold_union ~> sup_SUPR_fold_sup
4780 INTER_fold_inter ~> INFI_fold_inf
4781 UNION_fold_union ~> SUPR_fold_sup
4783 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4784 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4785 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4786 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4787 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4788 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4790 * Reorganized theory Multiset: swapped notation of pointwise and
4793 - pointwise ordering is instance of class order with standard syntax
4795 - multiset ordering has syntax <=# and <#; partial order properties
4796 are provided by means of interpretation with prefix
4798 - less duplication, less historical organization of sections,
4799 conversion from associations lists to multisets, rudimentary code
4801 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4806 multiset_eq_conv_count_eq ~> multiset_ext_iff
4807 multi_count_ext ~> multiset_ext
4808 diff_union_inverse2 ~> diff_union_cancelR
4812 * Theory Permutation: replaced local "remove" by List.remove1.
4814 * Code generation: ML and OCaml code is decorated with signatures.
4816 * Theory List: added transpose.
4818 * Library/Nat_Bijection.thy is a collection of bijective functions
4819 between nat and other types, which supersedes the older libraries
4820 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4823 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4824 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4825 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4826 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4827 Countable.pair_encode ~> prod_encode
4828 NatIso.prod2nat ~> prod_encode
4829 NatIso.nat2prod ~> prod_decode
4830 NatIso.sum2nat ~> sum_encode
4831 NatIso.nat2sum ~> sum_decode
4832 NatIso.list2nat ~> list_encode
4833 NatIso.nat2list ~> list_decode
4834 NatIso.set2nat ~> set_encode
4835 NatIso.nat2set ~> set_decode
4838 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4839 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4840 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4841 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4842 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4843 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4844 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4845 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4846 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4847 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4848 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4849 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4850 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4853 - Renamed ATP commands:
4854 atp_info ~> sledgehammer running_atps
4855 atp_kill ~> sledgehammer kill_atps
4856 atp_messages ~> sledgehammer messages
4857 atp_minimize ~> sledgehammer minimize
4858 print_atps ~> sledgehammer available_atps
4860 - Added user's manual ("isabelle doc sledgehammer").
4861 - Added option syntax and "sledgehammer_params" to customize
4862 Sledgehammer's behavior. See the manual for details.
4863 - Modified the Isar proof reconstruction code so that it produces
4864 direct proofs rather than proofs by contradiction. (This feature
4865 is still experimental.)
4866 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4868 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4871 - Added and implemented "binary_ints" and "bits" options.
4872 - Added "std" option and implemented support for nonstandard models.
4873 - Added and implemented "finitize" option to improve the precision
4874 of infinite datatypes based on a monotonicity analysis.
4875 - Added support for quotient types.
4876 - Added support for "specification" and "ax_specification"
4878 - Added support for local definitions (for "function" and
4879 "termination" proofs).
4880 - Added support for term postprocessors.
4881 - Optimized "Multiset.multiset" and "FinFun.finfun".
4882 - Improved efficiency of "destroy_constrs" optimization.
4883 - Fixed soundness bugs related to "destroy_constrs" optimization and
4885 - Fixed soundness bug related to higher-order constructors.
4886 - Fixed soundness bug when "full_descrs" is enabled.
4887 - Improved precision of set constructs.
4888 - Added "atoms" option.
4889 - Added cache to speed up repeated Kodkod invocations on the same
4891 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4892 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4893 "SAT4J_Light". INCOMPATIBILITY.
4894 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4895 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4896 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4898 * Method "induct" now takes instantiations of the form t, where t is not
4899 a variable, as a shorthand for "x == t", where x is a fresh variable.
4900 If this is not intended, t has to be enclosed in parentheses.
4901 By default, the equalities generated by definitional instantiations
4902 are pre-simplified, which may cause parameters of inductive cases
4903 to disappear, or may even delete some of the inductive cases.
4904 Use "induct (no_simp)" instead of "induct" to restore the old
4905 behaviour. The (no_simp) option is also understood by the "cases"
4906 and "nominal_induct" methods, which now perform pre-simplification, too.
4912 * Variable names in lemmas generated by the domain package have
4913 changed; the naming scheme is now consistent with the HOL datatype
4914 package. Some proof scripts may be affected, INCOMPATIBILITY.
4916 * The domain package no longer defines the function "foo_copy" for
4917 recursive domain "foo". The reach lemma is now stated directly in
4918 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4919 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4921 * Most definedness lemmas generated by the domain package (previously
4922 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4923 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4924 Proofs that used definedness lemmas as intro rules may break,
4925 potential INCOMPATIBILITY.
4927 * Induction and casedist rules generated by the domain package now
4928 declare proper case_names (one called "bottom", and one named for each
4929 constructor). INCOMPATIBILITY.
4931 * For mutually-recursive domains, separate "reach" and "take_lemma"
4932 rules are generated for each domain, INCOMPATIBILITY.
4934 foo_bar.reach ~> foo.reach bar.reach
4935 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4937 * Some lemmas generated by the domain package have been renamed for
4938 consistency with the datatype package, INCOMPATIBILITY.
4940 foo.ind ~> foo.induct
4941 foo.finite_ind ~> foo.finite_induct
4942 foo.coind ~> foo.coinduct
4943 foo.casedist ~> foo.exhaust
4944 foo.exhaust ~> foo.nchotomy
4946 * For consistency with other definition packages, the fixrec package
4947 now generates qualified theorem names, INCOMPATIBILITY.
4949 foo_simps ~> foo.simps
4950 foo_unfold ~> foo.unfold
4951 foo_induct ~> foo.induct
4953 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4954 method and internal fixrec proofs now use the default simpset instead.
4957 * The "contlub" predicate has been removed. Proof scripts should use
4958 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4960 * The "admw" predicate has been removed, INCOMPATIBILITY.
4962 * The constants cpair, cfst, and csnd have been removed in favor of
4963 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4968 * Antiquotations for basic formal entities:
4970 @{class NAME} -- type class
4971 @{class_syntax NAME} -- syntax representation of the above
4973 @{type_name NAME} -- logical type
4974 @{type_abbrev NAME} -- type abbreviation
4975 @{nonterminal NAME} -- type of concrete syntactic category
4976 @{type_syntax NAME} -- syntax representation of any of the above
4978 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4979 @{const_abbrev NAME} -- abbreviated constant
4980 @{const_syntax NAME} -- syntax representation of any of the above
4982 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4983 syntax constant (cf. 'syntax' command).
4985 * Antiquotation @{make_string} inlines a function to print arbitrary
4986 values similar to the ML toplevel. The result is compiler dependent
4987 and may fall back on "?" in certain situations.
4989 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4990 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4991 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4992 not work with the asynchronous Isar document model.
4994 * Configuration options now admit dynamic default values, depending on
4995 the context or even global references.
4997 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4998 uses an efficient external library if available (for Poly/ML).
5000 * Renamed some important ML structures, while keeping the old names
5001 for some time as aliases within the structure Legacy:
5003 OuterKeyword ~> Keyword
5006 OuterSyntax ~> Outer_Syntax
5007 PrintMode ~> Print_Mode
5008 SpecParse ~> Parse_Spec
5011 ThyOutput ~> Thy_Output
5012 TypeInfer ~> Type_Infer
5014 Note that "open Legacy" simplifies porting of sources, but forgetting
5015 to remove it again will complicate porting again in the future.
5017 * Most operations that refer to a global context are named
5018 accordingly, e.g. Simplifier.global_context or
5019 ProofContext.init_global. There are some situations where a global
5020 context actually works, but under normal circumstances one needs to
5021 pass the proper local context through the code!
5023 * Discontinued old TheoryDataFun with its copy/init operation -- data
5024 needs to be pure. Functor Theory_Data_PP retains the traditional
5025 Pretty.pp argument to merge, which is absent in the standard
5026 Theory_Data version.
5028 * Sorts.certify_sort and derived "cert" operations for types and terms
5029 no longer minimize sorts. Thus certification at the boundary of the
5030 inference kernel becomes invariant under addition of class relations,
5031 which is an important monotonicity principle. Sorts are now minimized
5032 in the syntax layer only, at the boundary between the end-user and the
5033 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5034 explicitly in rare situations.
5036 * Renamed old-style Drule.standard to Drule.export_without_context, to
5037 emphasize that this is in no way a standard operation.
5040 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5041 usual for resolution. Rare INCOMPATIBILITY.
5043 * Renamed varify/unvarify operations to varify_global/unvarify_global
5044 to emphasize that these only work in a global situation (which is
5047 * Curried take and drop in library.ML; negative length is interpreted
5048 as infinity (as in chop). Subtle INCOMPATIBILITY.
5050 * Proof terms: type substitutions on proof constants now use canonical
5051 order of type variables. INCOMPATIBILITY for tools working with proof
5054 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5055 may no longer carry premises. User-level specifications are
5056 transformed accordingly by Thm.add_axiom/add_def.
5061 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5062 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5063 proof terms are enabled unconditionally in the new HOL-Proofs image.
5065 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5066 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5069 * Old lib/scripts/polyml-platform is superseded by the
5070 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5071 variant, even on a 64 bit machine. The following example setting
5072 prefers 64 bit if available:
5074 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5076 * The preliminary Isabelle/jEdit application demonstrates the emerging
5077 Isabelle/Scala layer for advanced prover interaction and integration.
5078 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5081 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5082 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5083 similar to the default assignment of the document preparation system
5084 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5085 provides some operations for direct access to the font without asking
5086 the user for manual installation.
5090 New in Isabelle2009-1 (December 2009)
5091 -------------------------------------
5095 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5096 one backslash should be used, even in ML sources.
5101 * Locale interpretation propagates mixins along the locale hierarchy.
5102 The currently only available mixins are the equations used to map
5103 local definitions to terms of the target domain of an interpretation.
5105 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5106 loc" to print all interpretations of locale "loc" in the theory.
5107 Interpretations in proofs are not shown.
5109 * Thoroughly revised locales tutorial. New section on conditional
5112 * On instantiation of classes, remaining undefined class parameters
5113 are formally declared. INCOMPATIBILITY.
5116 *** Document preparation ***
5118 * New generalized style concept for printing terms: @{foo (style) ...}
5119 instead of @{foo_style style ...} (old form is still retained for
5120 backward compatibility). Styles can be also applied for
5121 antiquotations prop, term_type and typeof.
5126 * New proof method "smt" for a combination of first-order logic with
5127 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5128 fixed-size bitvectors; there is also basic support for higher-order
5129 features (esp. lambda abstractions). It is an incomplete decision
5130 procedure based on external SMT solvers using the oracle mechanism;
5131 for the SMT solver Z3, this method is proof-producing. Certificates
5132 are provided to avoid calling the external solvers solely for
5133 re-checking proofs. Due to a remote SMT service there is no need for
5134 installing SMT solvers locally. See src/HOL/SMT.
5136 * New commands to load and prove verification conditions generated by
5137 the Boogie program verifier or derived systems (e.g. the Verifying C
5138 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5140 * New counterexample generator tool 'nitpick' based on the Kodkod
5141 relational model finder. See src/HOL/Tools/Nitpick and
5142 src/HOL/Nitpick_Examples.
5144 * New commands 'code_pred' and 'values' to invoke the predicate
5145 compiler and to enumerate values of inductive predicates.
5147 * A tabled implementation of the reflexive transitive closure.
5149 * New implementation of quickcheck uses generic code generator;
5150 default generators are provided for all suitable HOL types, records
5151 and datatypes. Old quickcheck can be re-activated importing theory
5152 Library/SML_Quickcheck.
5154 * New testing tool Mirabelle for automated proof tools. Applies
5155 several tools and tactics like sledgehammer, metis, or quickcheck, to
5156 every proof step in a theory. To be used in batch mode via the
5157 "mirabelle" utility.
5159 * New proof method "sos" (sum of squares) for nonlinear real
5160 arithmetic (originally due to John Harison). It requires theory
5161 Library/Sum_Of_Squares. It is not a complete decision procedure but
5162 works well in practice on quantifier-free real arithmetic with +, -,
5163 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5164 inequalities between polynomials. It makes use of external
5165 semidefinite programming solvers. Method "sos" generates a
5166 certificate that can be pasted into the proof thus avoiding the need
5167 to call an external tool every time the proof is checked. See
5168 src/HOL/Library/Sum_Of_Squares.
5170 * New method "linarith" invokes existing linear arithmetic decision
5173 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5175 * New Sledgehammer option "Full Types" in Proof General settings menu.
5176 Causes full type information to be output to the ATPs. This slows
5177 ATPs down considerably but eliminates a source of unsound "proofs"
5180 * New method "metisFT": A version of metis that uses full type
5181 information in order to avoid failures of proof reconstruction.
5183 * New evaluator "approximate" approximates an real valued term using
5184 the same method as the approximation method.
5186 * Method "approximate" now supports arithmetic expressions as
5187 boundaries of intervals and implements interval splitting and Taylor
5190 * ML antiquotation @{code_datatype} inserts definition of a datatype
5191 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5193 * New theory SupInf of the supremum and infimum operators for sets of
5196 * New theory Probability, which contains a development of measure
5197 theory, eventually leading to Lebesgue integration and probability.
5199 * Extended Multivariate Analysis to include derivation and Brouwer's
5202 * Reorganization of number theory, INCOMPATIBILITY:
5203 - new number theory development for nat and int, in theories Divides
5204 and GCD as well as in new session Number_Theory
5205 - some constants and facts now suffixed with _nat and _int
5207 - former session NumberTheory now named Old_Number_Theory, including
5208 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5209 - moved theory Pocklington from src/HOL/Library to
5210 src/HOL/Old_Number_Theory
5212 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5213 lcm of finite and infinite sets. It is shown that they form a complete
5216 * Class semiring_div requires superclass no_zero_divisors and proof of
5217 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5218 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5219 generalized to class semiring_div, subsuming former theorems
5220 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5221 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5224 * Refinements to lattice classes and sets:
5225 - less default intro/elim rules in locale variant, more default
5226 intro/elim rules in class variant: more uniformity
5227 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5229 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5231 - renamed ACI to inf_sup_aci
5232 - new class "boolean_algebra"
5233 - class "complete_lattice" moved to separate theory
5234 "Complete_Lattice"; corresponding constants (and abbreviations)
5235 renamed and with authentic syntax:
5236 Set.Inf ~> Complete_Lattice.Inf
5237 Set.Sup ~> Complete_Lattice.Sup
5238 Set.INFI ~> Complete_Lattice.INFI
5239 Set.SUPR ~> Complete_Lattice.SUPR
5240 Set.Inter ~> Complete_Lattice.Inter
5241 Set.Union ~> Complete_Lattice.Union
5242 Set.INTER ~> Complete_Lattice.INTER
5243 Set.UNION ~> Complete_Lattice.UNION
5244 - authentic syntax for
5247 - mere abbreviations:
5250 Set.inter (for inf, formerly Set.Int)
5251 Set.union (for sup, formerly Set.Un)
5252 Complete_Lattice.Inter (for Inf)
5253 Complete_Lattice.Union (for Sup)
5254 Complete_Lattice.INTER (for INFI)
5255 Complete_Lattice.UNION (for SUPR)
5256 - object-logic definitions as far as appropriate
5258 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5259 Un_subset_iff are explicitly deleted as default simp rules; then also
5260 their lattice counterparts le_inf_iff and le_sup_iff have to be
5261 deleted to achieve the desired effect.
5263 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5264 rules by default any longer; the same applies to min_max.inf_absorb1
5265 etc. INCOMPATIBILITY.
5267 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5268 pred_set_conv by default. INCOMPATIBILITY.
5270 * Power operations on relations and functions are now one dedicated
5271 constant "compow" with infix syntax "^^". Power operation on
5272 multiplicative monoids retains syntax "^" and is now defined generic
5273 in class power. INCOMPATIBILITY.
5275 * Relation composition "R O S" now has a more standard argument order:
5276 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5277 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5278 break, since the O_assoc rule was not rewritten like this. Fix using
5279 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5281 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5282 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5285 * Most rules produced by inductive and datatype package have mandatory
5286 prefixes. INCOMPATIBILITY.
5288 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5289 the attribute of the same name. Each of the theorems in the list
5290 DERIV_intros assumes composition with an additional function and
5291 matches a variable to the derivative, which has to be solved by the
5292 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5293 of most elementary terms. Former Maclauren.DERIV_tac and
5294 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5297 * Code generator attributes follow the usual underscore convention:
5298 code_unfold replaces code unfold
5299 code_post replaces code post
5304 sizechange -> size_change
5305 induct_scheme -> induction_schema
5308 * Discontinued abbreviation "arbitrary" of constant "undefined".
5309 INCOMPATIBILITY, use "undefined" directly.
5312 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5313 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5314 Suc_plus1 -> Suc_eq_plus1
5315 *anti_sym -> *antisym*
5316 vector_less_eq_def -> vector_le_def
5319 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5322 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5328 * Theory Representable defines a class "rep" of domains that are
5329 representable (via an ep-pair) in the universal domain type "udom".
5330 Instances are provided for all type constructors defined in HOLCF.
5332 * The 'new_domain' command is a purely definitional version of the
5333 domain package, for representable domains. Syntax is identical to the
5334 old domain package. The 'new_domain' package also supports indirect
5335 recursion using previously-defined type constructors. See
5336 src/HOLCF/ex/New_Domain.thy for examples.
5338 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5339 on the left-hand side of an equation, and then performs
5340 simplification. Rewriting is done using rules declared with the
5341 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5342 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5344 * The pattern-match compiler in 'fixrec' can now handle constructors
5345 with HOL function types. Pattern-match combinators for the Pair
5346 constructor are pre-configured.
5348 * The 'fixrec' package now produces better fixed-point induction rules
5349 for mutually-recursive definitions: Induction rules have conclusions
5350 of the form "P foo bar" instead of "P <foo, bar>".
5352 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5353 been renamed to "below". The name "below" now replaces "less" in many
5354 theorem names. (Legacy theorem names using "less" are still supported
5357 * The 'fixrec' package now supports "bottom patterns". Bottom
5358 patterns can be used to generate strictness rules, or to make
5359 functions more strict (much like the bang-patterns supported by the
5360 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5366 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5367 errors and run-time exceptions, including detailed source positions.
5369 * Structure Name_Space (formerly NameSpace) now manages uniquely
5370 identified entries, with some additional information such as source
5371 position, logical grouping etc.
5373 * Theory and context data is now introduced by the simplified and
5374 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5375 to be pure, but the old TheoryDataFun for mutable data (with explicit
5376 copy operation) is still available for some time.
5378 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5379 provides a high-level programming interface to synchronized state
5380 variables with atomic update. This works via pure function
5381 application within a critical section -- its runtime should be as
5382 short as possible; beware of deadlocks if critical code is nested,
5383 either directly or indirectly via other synchronized variables!
5385 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5386 wraps raw ML references, explicitly indicating their non-thread-safe
5387 behaviour. The Isar toplevel keeps this structure open, to
5388 accommodate Proof General as well as quick and dirty interactive
5389 experiments with references.
5391 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5392 parallel tactical reasoning.
5394 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5395 are similar to SUBPROOF, but are slightly more flexible: only the
5396 specified parts of the subgoal are imported into the context, and the
5397 body tactic may introduce new subgoals and schematic variables.
5399 * Old tactical METAHYPS, which does not observe the proof context, has
5400 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5401 or Subgoal.FOCUS etc.
5403 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5404 functors have their own ML name space there is no point to mark them
5405 separately.) Minor INCOMPATIBILITY.
5407 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5409 * Renamed several structures FooBar to Foo_Bar. Occasional,
5412 * Operations of structure Skip_Proof no longer require quick_and_dirty
5413 mode, which avoids critical setmp.
5415 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5416 combinators for "args". INCOMPATIBILITY, need to use simplified
5417 Attrib/Method.setup introduced in Isabelle2009.
5419 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5420 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5421 last resort. INCOMPATIBILITY.
5423 * Display.pretty_thm now requires a proper context (cf. former
5424 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5425 or even Display.pretty_thm_without_context as last resort.
5428 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5429 Syntax.pretty_typ/term directly, preferably with proper context
5430 instead of global theory.
5435 * Further fine tuning of parallel proof checking, scales up to 8 cores
5436 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5439 * Support for additional "Isabelle components" via etc/components, see
5440 also the system manual.
5442 * The isabelle makeall tool now operates on all components with
5443 IsaMakefile, not just hardwired "logics".
5445 * Removed "compress" option from isabelle-process and isabelle usedir;
5446 this is always enabled.
5448 * Discontinued support for Poly/ML 4.x versions.
5450 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5451 on a given logic image. This requires the lighttpd webserver and is
5452 currently supported on Linux only.
5456 New in Isabelle2009 (April 2009)
5457 --------------------------------
5461 * Simplified main Isabelle executables, with less surprises on
5462 case-insensitive file-systems (such as Mac OS).
5464 - The main Isabelle tool wrapper is now called "isabelle" instead of
5467 - The former "isabelle" alias for "isabelle-process" has been
5468 removed (should rarely occur to regular users).
5470 - The former "isabelle-interface" and its alias "Isabelle" have been
5471 removed (interfaces are now regular Isabelle tools).
5473 Within scripts and make files, the Isabelle environment variables
5474 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5475 respectively. (The latter are still available as legacy feature.)
5477 The old isabelle-interface wrapper could react in confusing ways if
5478 the interface was uninstalled or changed otherwise. Individual
5479 interface tool configuration is now more explicit, see also the
5480 Isabelle system manual. In particular, Proof General is now available
5481 via "isabelle emacs".
5483 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5484 purge installed copies of Isabelle executables and re-run "isabelle
5485 install -p ...", or use symlinks.
5487 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5488 old ~/isabelle, which was slightly non-standard and apt to cause
5489 surprises on case-insensitive file-systems (such as Mac OS).
5491 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5492 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5493 care is required when using older releases of Isabelle. Note that
5494 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5495 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5497 * Proofs of fully specified statements are run in parallel on
5498 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5499 a regular 4-core machine, if the initial heap space is made reasonably
5500 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5502 * The main reference manuals ("isar-ref", "implementation", and
5503 "system") have been updated and extended. Formally checked references
5504 as hyperlinks are now available uniformly.
5509 * Complete re-implementation of locales. INCOMPATIBILITY in several
5510 respects. The most important changes are listed below. See the
5511 Tutorial on Locales ("locales" manual) for details.
5513 - In locale expressions, instantiation replaces renaming. Parameters
5514 must be declared in a for clause. To aid compatibility with previous
5515 parameter inheritance, in locale declarations, parameters that are not
5516 'touched' (instantiation position "_" or omitted) are implicitly added
5517 with their syntax at the beginning of the for clause.
5519 - Syntax from abbreviations and definitions in locales is available in
5520 locale expressions and context elements. The latter is particularly
5521 useful in locale declarations.
5523 - More flexible mechanisms to qualify names generated by locale
5524 expressions. Qualifiers (prefixes) may be specified in locale
5525 expressions, and can be marked as mandatory (syntax: "name!:") or
5526 optional (syntax "name?:"). The default depends for plain "name:"
5527 depends on the situation where a locale expression is used: in
5528 commands 'locale' and 'sublocale' prefixes are optional, in
5529 'interpretation' and 'interpret' prefixes are mandatory. The old
5530 implicit qualifiers derived from the parameter names of a locale are
5531 no longer generated.
5533 - Command "sublocale l < e" replaces "interpretation l < e". The
5534 instantiation clause in "interpretation" and "interpret" (square
5535 brackets) is no longer available. Use locale expressions.
5537 - When converting proof scripts, mandatory qualifiers in
5538 'interpretation' and 'interpret' should be retained by default, even
5539 if this is an INCOMPATIBILITY compared to former behavior. In the
5540 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5541 in locale expressions range over a single locale instance only.
5543 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5544 In existing theorem specifications replace the includes element by the
5545 respective context elements of the included locale, omitting those
5546 that are already present in the theorem specification. Multiple
5547 assume elements of a locale should be replaced by a single one
5548 involving the locale predicate. In the proof body, declarations (most
5549 notably theorems) may be regained by interpreting the respective
5550 locales in the proof context as required (command "interpret").
5552 If using "includes" in replacement of a target solely because the
5553 parameter types in the theorem are not as general as in the target,
5554 consider declaring a new locale with additional type constraints on
5555 the parameters (context element "constrains").
5557 - Discontinued "locale (open)". INCOMPATIBILITY.
5559 - Locale interpretation commands no longer attempt to simplify goal.
5560 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5561 methods intro_locales and unfold_locales to clarify.
5563 - Locale interpretation commands no longer accept interpretation
5564 attributes. INCOMPATIBILITY.
5566 * Class declaration: so-called "base sort" must not be given in import
5567 list any longer, but is inferred from the specification. Particularly
5574 class foo = type + ...
5576 * Class target: global versions of theorems stemming do not carry a
5577 parameter prefix any longer. INCOMPATIBILITY.
5579 * Class 'instance' command no longer accepts attached definitions.
5580 INCOMPATIBILITY, use proper 'instantiation' target instead.
5582 * Recovered hiding of consts, which was accidentally broken in
5583 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5584 makes c inaccessible; consider using ``hide (open) const c'' instead.
5586 * Slightly more coherent Pure syntax, with updated documentation in
5587 isar-ref manual. Removed locales meta_term_syntax and
5588 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5589 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5590 directly in regular applications.
5592 * There is a new syntactic category "float_const" for signed decimal
5593 fractions (e.g. 123.45 or -123.45).
5595 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5596 interface with 'setup' command instead.
5598 * Command 'local_setup' is similar to 'setup', but operates on a local
5601 * The 'axiomatization' command now only works within a global theory
5602 context. INCOMPATIBILITY.
5604 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5605 hypotheses. Sorts required in the course of reasoning need to be
5606 covered by the constraints in the initial statement, completed by the
5607 type instance information of the background theory. Non-trivial sort
5608 hypotheses, which rarely occur in practice, may be specified via
5609 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5611 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5613 The result contains an implicit sort hypotheses as before --
5614 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5617 * Generalized Isar history, with support for linear undo, direct state
5620 * Changed defaults for unify configuration options:
5622 unify_trace_bound = 50 (formerly 25)
5623 unify_search_bound = 60 (formerly 30)
5625 * Different bookkeeping for code equations (INCOMPATIBILITY):
5627 a) On theory merge, the last set of code equations for a particular
5628 constant is taken (in accordance with the policy applied by other
5629 parts of the code generator framework).
5631 b) Code equations stemming from explicit declarations (e.g. code
5632 attribute) gain priority over default code equations stemming
5633 from definition, primrec, fun etc.
5635 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5637 * Unified theorem tables for both code generators. Thus [code
5638 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5640 * Command 'find_consts' searches for constants based on type and name
5643 find_consts "_ => bool"
5645 By default, matching is against subtypes, but it may be restricted to
5646 the whole type. Searching by name is possible. Multiple queries are
5647 conjunctive and queries may be negated by prefixing them with a
5650 find_consts strict: "_ => bool" name: "Int" -"int => int"
5652 * New 'find_theorems' criterion "solves" matches theorems that
5653 directly solve the current goal (modulo higher-order unification).
5655 * Auto solve feature for main theorem statements: whenever a new goal
5656 is stated, "find_theorems solves" is called; any theorems that could
5657 solve the lemma directly are listed as part of the goal state.
5658 Cf. associated options in Proof General Isabelle settings menu,
5659 enabled by default, with reasonable timeout for pathological cases of
5660 higher-order unification.
5663 *** Document preparation ***
5665 * Antiquotation @{lemma} now imitates a regular terminal proof,
5666 demanding keyword 'by' and supporting the full method expression
5667 syntax just like the Isar command 'by'.
5672 * Integrated main parts of former image HOL-Complex with HOL. Entry
5673 points Main and Complex_Main remain as before.
5675 * Logic image HOL-Plain provides a minimal HOL with the most important
5676 tools available (inductive, datatype, primrec, ...). This facilitates
5677 experimentation and tool development. Note that user applications
5678 (and library theories) should never refer to anything below theory
5681 * Logic image HOL-Main stops at theory Main, and thus facilitates
5682 experimentation due to shorter build times.
5684 * Logic image HOL-NSA contains theories of nonstandard analysis which
5685 were previously part of former HOL-Complex. Entry point Hyperreal
5686 remains valid, but theories formerly using Complex_Main should now use
5687 new entry point Hypercomplex.
5689 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5690 Posix processes. Avoids potentially expensive forking of the ML
5691 process. New thread-based implementation also works on non-Unix
5692 platforms (Cygwin). Provers are no longer hardwired, but defined
5693 within the theory via plain ML wrapper functions. Basic Sledgehammer
5694 commands are covered in the isar-ref manual.
5696 * Wrapper scripts for remote SystemOnTPTP service allows to use
5697 sledgehammer without local ATP installation (Vampire etc.). Other
5698 provers may be included via suitable ML wrappers, see also
5699 src/HOL/ATP_Linkup.thy.
5701 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5704 * The metis method no longer fails because the theorem is too trivial
5705 (contains the empty clause).
5707 * The metis method now fails in the usual manner, rather than raising
5708 an exception, if it determines that it cannot prove the theorem.
5710 * Method "coherent" implements a prover for coherent logic (see also
5711 src/Tools/coherent.ML).
5713 * Constants "undefined" and "default" replace "arbitrary". Usually
5714 "undefined" is the right choice to replace "arbitrary", though
5715 logically there is no difference. INCOMPATIBILITY.
5717 * Command "value" now integrates different evaluation mechanisms. The
5718 result of the first successful evaluation mechanism is printed. In
5719 square brackets a particular named evaluation mechanisms may be
5720 specified (currently, [SML], [code] or [nbe]). See further
5721 src/HOL/ex/Eval_Examples.thy.
5723 * Normalization by evaluation now allows non-leftlinear equations.
5724 Declare with attribute [code nbe].
5726 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5727 as the structured Isar versions "cases" and "induct", cf. the
5728 corresponding "cases" and "induct" attributes. Mutual induction rules
5729 are now presented as a list of individual projections
5730 (e.g. foo_bar.inducts for types foo and bar); the old format with
5731 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5732 rare situations a different rule is selected --- notably nested tuple
5733 elimination instead of former prod.exhaust: use explicit (case_tac t
5734 rule: prod.exhaust) here.
5736 * Attributes "cases", "induct", "coinduct" support "del" option.
5738 * Removed fact "case_split_thm", which duplicates "case_split".
5740 * The option datatype has been moved to a new theory Option. Renamed
5741 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5743 * New predicate "strict_mono" classifies strict functions on partial
5744 orders. With strict functions on linear orders, reasoning about
5745 (in)equalities is facilitated by theorems "strict_mono_eq",
5746 "strict_mono_less_eq" and "strict_mono_less".
5748 * Some set operations are now proper qualified constants with
5749 authentic syntax. INCOMPATIBILITY:
5760 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5763 * Auxiliary class "itself" has disappeared -- classes without any
5764 parameter are treated as expected by the 'class' command.
5766 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5768 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5769 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5771 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5772 method "approximation". It proves formulas on real values by using
5773 interval arithmetic. In the formulas are also the transcendental
5774 functions sin, cos, tan, atan, ln, exp and the constant pi are
5775 allowed. For examples see
5776 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5778 * Theory "Reflection" now resides in HOL/Library.
5780 * Entry point to Word library now simply named "Word".
5783 * Made source layout more coherent with logical distribution
5786 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5787 src/HOL/Library/Code_Message.thy ~> src/HOL/
5788 src/HOL/Library/GCD.thy ~> src/HOL/
5789 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5790 src/HOL/Library/Parity.thy ~> src/HOL/
5791 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5792 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5793 src/HOL/Real/Lubs.thy ~> src/HOL/
5794 src/HOL/Real/PReal.thy ~> src/HOL/
5795 src/HOL/Real/Rational.thy ~> src/HOL/
5796 src/HOL/Real/RComplete.thy ~> src/HOL/
5797 src/HOL/Real/RealDef.thy ~> src/HOL/
5798 src/HOL/Real/RealPow.thy ~> src/HOL/
5799 src/HOL/Real/Real.thy ~> src/HOL/
5800 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5801 src/HOL/Complex/Complex.thy ~> src/HOL/
5802 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5803 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5804 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5805 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5806 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5807 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5808 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5809 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5810 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5811 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5812 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5813 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5814 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5815 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5816 src/HOL/Real/Float ~> src/HOL/Library/
5817 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5818 src/HOL/Real/RealVector.thy ~> src/HOL/
5820 src/HOL/arith_data.ML ~> src/HOL/Tools
5821 src/HOL/hologic.ML ~> src/HOL/Tools
5822 src/HOL/simpdata.ML ~> src/HOL/Tools
5823 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5824 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5825 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5826 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5827 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5828 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5829 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5831 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5832 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5833 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5834 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5835 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5836 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5838 * If methods "eval" and "evaluation" encounter a structured proof
5839 state with !!/==>, only the conclusion is evaluated to True (if
5840 possible), avoiding strange error messages.
5842 * Method "sizechange" automates termination proofs using (a
5843 modification of) the size-change principle. Requires SAT solver. See
5844 src/HOL/ex/Termination.thy for examples.
5846 * Simplifier: simproc for let expressions now unfolds if bound
5847 variable occurs at most once in let expression body. INCOMPATIBILITY.
5849 * Method "arith": Linear arithmetic now ignores all inequalities when
5850 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5852 * New attribute "arith" for facts that should always be used
5853 automatically by arithmetic. It is intended to be used locally in
5856 assumes [arith]: "x > 0"
5858 Global usage is discouraged because of possible performance impact.
5860 * New classes "top" and "bot" with corresponding operations "top" and
5861 "bot" in theory Orderings; instantiation of class "complete_lattice"
5862 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5864 * Changed definition lemma "less_fun_def" in order to provide an
5865 instance for preorders on functions; use lemma "less_le" instead.
5868 * Theory Orderings: class "wellorder" moved here, with explicit
5869 induction rule "less_induct" as assumption. For instantiation of
5870 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5873 * Theory Orderings: added class "preorder" as superclass of "order".
5874 INCOMPATIBILITY: Instantiation proofs for order, linorder
5875 etc. slightly changed. Some theorems named order_class.* now named
5878 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5881 * Theory Finite_Set: added a new fold combinator of type
5883 ('a => 'b => 'b) => 'b => 'a set => 'b
5885 Occasionally this is more convenient than the old fold combinator
5886 which is now defined in terms of the new one and renamed to
5889 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5890 and "ring_simps" have been replaced by "algebra_simps" (which can be
5891 extended with further lemmas!). At the moment both still exist but
5892 the former will disappear at some point.
5894 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5895 class recpower. Type-specific simp rules for various recpower types
5896 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5898 rat_power_0 -> power_0
5899 rat_power_Suc -> power_Suc
5900 realpow_0 -> power_0
5901 realpow_Suc -> power_Suc
5902 complexpow_0 -> power_0
5903 complexpow_Suc -> power_Suc
5904 power_poly_0 -> power_0
5905 power_poly_Suc -> power_Suc
5907 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5908 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5909 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5910 of lemmas from Divides has been generalized from nat to class
5911 semiring_div. INCOMPATIBILITY. This involves the following theorem
5912 renames resulting from duplicate elimination:
5914 dvd_def_mod ~> dvd_eq_mod_eq_0
5915 zero_dvd_iff ~> dvd_0_left_iff
5916 dvd_0 ~> dvd_0_right
5917 DIVISION_BY_ZERO_DIV ~> div_by_0
5918 DIVISION_BY_ZERO_MOD ~> mod_by_0
5919 mult_div ~> div_mult_self2_is_id
5920 mult_mod ~> mod_mult_self2_is_0
5922 * Theory IntDiv: removed many lemmas that are instances of class-based
5923 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5924 rename old lemmas as follows:
5926 dvd_diff -> nat_dvd_diff
5927 dvd_zminus_iff -> dvd_minus_iff
5928 mod_add1_eq -> mod_add_eq
5929 mod_mult1_eq -> mod_mult_right_eq
5930 mod_mult1_eq' -> mod_mult_left_eq
5931 mod_mult_distrib_mod -> mod_mult_eq
5932 nat_mod_add_left_eq -> mod_add_left_eq
5933 nat_mod_add_right_eq -> mod_add_right_eq
5934 nat_mod_div_trivial -> mod_div_trivial
5935 nat_mod_mod_trivial -> mod_mod_trivial
5936 zdiv_zadd_self1 -> div_add_self1
5937 zdiv_zadd_self2 -> div_add_self2
5938 zdiv_zmult_self1 -> div_mult_self2_is_id
5939 zdiv_zmult_self2 -> div_mult_self1_is_id
5940 zdvd_triv_left -> dvd_triv_left
5941 zdvd_triv_right -> dvd_triv_right
5942 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5943 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5944 zmod_zadd_left_eq -> mod_add_left_eq
5945 zmod_zadd_right_eq -> mod_add_right_eq
5946 zmod_zadd_self1 -> mod_add_self1
5947 zmod_zadd_self2 -> mod_add_self2
5948 zmod_zadd1_eq -> mod_add_eq
5949 zmod_zdiff1_eq -> mod_diff_eq
5950 zmod_zdvd_zmod -> mod_mod_cancel
5951 zmod_zmod_cancel -> mod_mod_cancel
5952 zmod_zmult_self1 -> mod_mult_self2_is_0
5953 zmod_zmult_self2 -> mod_mult_self1_is_0
5956 zdvd_abs1 -> abs_dvd_iff
5957 zdvd_abs2 -> dvd_abs_iff
5958 zdvd_refl -> dvd_refl
5959 zdvd_trans -> dvd_trans
5960 zdvd_zadd -> dvd_add
5961 zdvd_zdiff -> dvd_diff
5962 zdvd_zminus_iff -> dvd_minus_iff
5963 zdvd_zminus2_iff -> minus_dvd_iff
5964 zdvd_zmultD -> dvd_mult_right
5965 zdvd_zmultD2 -> dvd_mult_left
5966 zdvd_zmult_mono -> mult_dvd_mono
5967 zdvd_0_right -> dvd_0_right
5968 zdvd_0_left -> dvd_0_left_iff
5969 zdvd_1_left -> one_dvd
5970 zminus_dvd_iff -> minus_dvd_iff
5972 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5974 * The real numbers offer decimal input syntax: 12.34 is translated
5975 into 1234/10^2. This translation is not reversed upon output.
5977 * Theory Library/Polynomial defines an abstract type 'a poly of
5978 univariate polynomials with coefficients of type 'a. In addition to
5979 the standard ring operations, it also supports div and mod. Code
5980 generation is also supported, using list-style constructors.
5982 * Theory Library/Inner_Product defines a class of real_inner for real
5983 inner product spaces, with an overloaded operation inner :: 'a => 'a
5984 => real. Class real_inner is a subclass of real_normed_vector from
5987 * Theory Library/Product_Vector provides instances for the product
5988 type 'a * 'b of several classes from RealVector and Inner_Product.
5989 Definitions of addition, subtraction, scalar multiplication, norms,
5990 and inner products are included.
5992 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5993 addition to the field operations, numerals and case syntax are also
5996 * Theory Library/Diagonalize provides constructive version of Cantor's
5997 first diagonalization argument.
5999 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6000 zlcm (for int); carried together from various gcd/lcm developements in
6001 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6002 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6003 may recover tupled syntax as follows:
6005 hide (open) const gcd
6006 abbreviation gcd where
6007 "gcd == (%(a, b). GCD.gcd a b)"
6009 GCD.gcd ("gcd '(_, _')")
6011 The same works for lcm, zgcd, zlcm.
6013 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6014 instantiations for algebraic structures. Removed some duplicate
6015 theorems. Changes in simp rules. INCOMPATIBILITY.
6017 * ML antiquotation @{code} takes a constant as argument and generates
6018 corresponding code in background and inserts name of the corresponding
6019 resulting ML value/function/datatype constructor binding in place.
6020 All occurrences of @{code} with a single ML block are generated
6021 simultaneously. Provides a generic and safe interface for
6022 instrumentalizing code generation. See
6023 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6024 In future you ought to refrain from ad-hoc compiling generated SML
6025 code on the ML toplevel. Note that (for technical reasons) @{code}
6026 cannot refer to constants for which user-defined serializations are
6027 set. Refer to the corresponding ML counterpart directly in that
6030 * Command 'rep_datatype': instead of theorem names the command now
6031 takes a list of terms denoting the constructors of the type to be
6032 represented as datatype. The characteristic theorems have to be
6033 proven. INCOMPATIBILITY. Also observe that the following theorems
6034 have disappeared in favour of existing ones:
6036 unit_induct ~> unit.induct
6037 prod_induct ~> prod.induct
6038 sum_induct ~> sum.induct
6039 Suc_Suc_eq ~> nat.inject
6040 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6045 * New locales for orders and lattices where the equivalence relation
6046 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6047 locales use a record structure with field eq for the equivalence.
6049 * New theory of factorial domains.
6051 * Units_l_inv and Units_r_inv are now simp rules by default.
6052 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6053 and/or r_inv will now also require deletion of these lemmas.
6055 * Renamed the following theorems, INCOMPATIBILITY:
6057 UpperD ~> Upper_memD
6058 LowerD ~> Lower_memD
6059 least_carrier ~> least_closed
6060 greatest_carrier ~> greatest_closed
6061 greatest_Lower_above ~> greatest_Lower_below
6062 one_zero ~> carrier_one_zero
6063 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6068 * Nominal datatypes can now contain type-variables.
6070 * Commands 'nominal_inductive' and 'equivariance' work with local
6073 * Nominal primrec can now works with local theory targets and its
6074 specification syntax now conforms to the general format as seen in
6077 * Method "perm_simp" honours the standard simplifier attributes
6078 (no_asm), (no_asm_use) etc.
6080 * The new predicate #* is defined like freshness, except that on the
6081 left hand side can be a set or list of atoms.
6083 * Experimental command 'nominal_inductive2' derives strong induction
6084 principles for inductive definitions. In contrast to
6085 'nominal_inductive', which can only deal with a fixed number of
6086 binders, it can deal with arbitrary expressions standing for sets of
6087 atoms to be avoided. The only inductive definition we have at the
6088 moment that needs this generalisation is the typing rule for Lets in
6091 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6092 -----------------------------------------------------------------
6093 Gamma |- Let x be t1 in t2 : T2
6095 In this rule one wants to avoid all the binders that are introduced by
6096 "close Gamma T1". We are looking for other examples where this
6097 feature might be useful. Please let us know.
6102 * Reimplemented the simplification procedure for proving continuity
6103 subgoals. The new simproc is extensible; users can declare additional
6104 continuity introduction rules with the attribute [cont2cont].
6106 * The continuity simproc now uses a different introduction rule for
6107 solving continuity subgoals on terms with lambda abstractions. In
6108 some rare cases the new simproc may fail to solve subgoals that the
6109 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6110 Potential INCOMPATIBILITY.
6112 * Command 'fixrec': specification syntax now conforms to the general
6113 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6114 examples. INCOMPATIBILITY.
6119 * Proof of Zorn's Lemma for partial orders.
6124 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6125 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6126 depends on multithreading, so timouts will not work before Poly/ML
6129 * High-level support for concurrent ML programming, see
6130 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6131 particularly convenient to organize independent functional
6132 computations. The concept of "synchronized variables" provides a
6133 higher-order interface for components with shared state, avoiding the
6134 delicate details of mutexes and condition variables. (Requires
6135 Poly/ML 5.2.1 or later.)
6137 * ML bindings produced via Isar commands are stored within the Isar
6138 context (theory or proof). Consequently, commands like 'use' and 'ML'
6139 become thread-safe and work with undo as expected (concerning
6140 top-level bindings, not side-effects on global references).
6141 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6142 compiler at runtime; really global bindings need to be given outside a
6143 theory. (Requires Poly/ML 5.2 or later.)
6145 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6146 context. Top-level ML bindings are stored within the proof context in
6147 a purely sequential fashion, disregarding the nested proof structure.
6148 ML bindings introduced by 'ML_prf' are discarded at the end of the
6149 proof. (Requires Poly/ML 5.2 or later.)
6151 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6152 and Method.setup, as well as Isar commands 'attribute_setup' and
6153 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6154 existing code accordingly, or use plain 'setup' together with old
6157 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6158 to 'a -> thm, while results are always tagged with an authentic oracle
6159 name. The Isar command 'oracle' is now polymorphic, no argument type
6160 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6161 accordingly. Note that extra performance may be gained by producing
6162 the cterm carefully, avoiding slow Thm.cterm_of.
6164 * Simplified interface for defining document antiquotations via
6165 ThyOutput.antiquotation, ThyOutput.output, and optionally
6166 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6167 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6170 * More systematic treatment of long names, abstract name bindings, and
6171 name space operations. Basic operations on qualified names have been
6172 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6173 Long_Name.append. Old type bstring has been mostly replaced by
6174 abstract type binding (see structure Binding), which supports precise
6175 qualification by packages and local theory targets, as well as proper
6176 tracking of source positions. INCOMPATIBILITY, need to wrap old
6177 bstring values into Binding.name, or better pass through abstract
6178 bindings everywhere. See further src/Pure/General/long_name.ML,
6179 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6181 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6182 LocalTheory.note etc.) now refer to the *full* internal name, not the
6183 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6185 * Disposed old type and term read functions (Sign.read_def_typ,
6186 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6187 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6188 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6189 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6190 resort for legacy applications.
6192 * Disposed old declarations, tactics, tactic combinators that refer to
6193 the simpset or claset of an implicit theory (such as Addsimps,
6194 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6195 embedded ML text, or local_simpset_of with a proper context passed as
6196 explicit runtime argument.
6198 * Rules and tactics that read instantiations (read_instantiate,
6199 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6200 context, which is required for parsing and type-checking. Moreover,
6201 the variables are specified as plain indexnames, not string encodings
6202 thereof. INCOMPATIBILITY.
6204 * Generic Toplevel.add_hook interface allows to analyze the result of
6205 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6206 for theorem dependency output of transactions resulting in a new
6209 * ML antiquotations: block-structured compilation context indicated by
6210 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6212 @{binding name} - basic name binding
6213 @{let ?pat = term} - term abbreviation (HO matching)
6214 @{note name = fact} - fact abbreviation
6215 @{thm fact} - singleton fact (with attributes)
6216 @{thms fact} - general fact (with attributes)
6217 @{lemma prop by method} - singleton goal
6218 @{lemma prop by meth1 meth2} - singleton goal
6219 @{lemma prop1 ... propN by method} - general goal
6220 @{lemma prop1 ... propN by meth1 meth2} - general goal
6221 @{lemma (open) ...} - open derivation
6226 * The Isabelle "emacs" tool provides a specific interface to invoke
6227 Proof General / Emacs, with more explicit failure if that is not
6228 installed (the old isabelle-interface script silently falls back on
6229 isabelle-process). The PROOFGENERAL_HOME setting determines the
6230 installation location of the Proof General distribution.
6232 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6233 the Isabelle process into a JVM/Scala application. See
6234 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6235 process wrapper has been discontinued.)
6237 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6239 * Various status messages (with exact source position information) are
6240 emitted, if proper markup print mode is enabled. This allows
6241 user-interface components to provide detailed feedback on internal
6246 New in Isabelle2008 (June 2008)
6247 -------------------------------
6251 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6252 and updated, with formally checked references as hyperlinks.
6254 * Theory loader: use_thy (and similar operations) no longer set the
6255 implicit ML context, which was occasionally hard to predict and in
6256 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6257 provides a proper context already.
6259 * Theory loader: old-style ML proof scripts being *attached* to a thy
6260 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6261 'use' within a theory file will do the job.
6263 * Name space merge now observes canonical order, i.e. the second space
6264 is inserted into the first one, while existing entries in the first
6265 space take precedence. INCOMPATIBILITY in rare situations, may try to
6266 swap theory imports.
6268 * Syntax: symbol \<chi> is now considered a letter. Potential
6269 INCOMPATIBILITY in identifier syntax etc.
6271 * Outer syntax: string tokens no longer admit escaped white space,
6272 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6273 white space without escapes.
6275 * Outer syntax: string tokens may contain arbitrary character codes
6276 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6282 * Context-dependent token translations. Default setup reverts locally
6283 fixed variables, and adds hilite markup for undeclared frees.
6285 * Unused theorems can be found using the new command 'unused_thms'.
6286 There are three ways of invoking it:
6289 Only finds unused theorems in the current theory.
6291 (2) unused_thms thy_1 ... thy_n -
6292 Finds unused theorems in the current theory and all of its ancestors,
6293 excluding the theories thy_1 ... thy_n and all of their ancestors.
6295 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6296 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6297 their ancestors, excluding the theories thy_1 ... thy_n and all of
6300 In order to increase the readability of the list produced by
6301 unused_thms, theorems that have been created by a particular instance
6302 of a theory command such as 'inductive' or 'function' are considered
6303 to belong to the same "group", meaning that if at least one theorem in
6304 this group is used, the other theorems in the same group are no longer
6305 reported as unused. Moreover, if all theorems in the group are
6306 unused, only one theorem in the group is displayed.
6308 Note that proof objects have to be switched on in order for
6309 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6310 usually the case when using Proof General with the default settings).
6312 * Authentic naming of facts disallows ad-hoc overwriting of previous
6313 theorems within the same name space. INCOMPATIBILITY, need to remove
6314 duplicate fact bindings, or even accidental fact duplications. Note
6315 that tools may maintain dynamically scoped facts systematically, using
6316 PureThy.add_thms_dynamic.
6318 * Command 'hide' now allows to hide from "fact" name space as well.
6320 * Eliminated destructive theorem database, simpset, claset, and
6321 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6322 update of theories within ML code.
6324 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6325 INCOMPATIBILITY, object-logics depending on former Pure require
6326 additional setup PureThy.old_appl_syntax_setup; object-logics
6327 depending on former CPure need to refer to Pure.
6329 * Commands 'use' and 'ML' are now purely functional, operating on
6330 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6331 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6334 * Command 'setup': discontinued implicit version with ML reference.
6336 * Instantiation target allows for simultaneous specification of class
6337 instance operations together with an instantiation proof.
6338 Type-checking phase allows to refer to class operations uniformly.
6339 See src/HOL/Complex/Complex.thy for an Isar example and
6340 src/HOL/Library/Eval.thy for an ML example.
6342 * Indexing of literal facts: be more serious about including only
6343 facts from the visible specification/proof context, but not the
6344 background context (locale etc.). Affects `prop` notation and method
6345 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6348 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6349 "(open)" option, which used to expose internal bound variables to the
6352 * Isar statements: removed obsolete case "rule_context".
6353 INCOMPATIBILITY, better use explicit fixes/assumes.
6355 * Locale proofs: default proof step now includes 'unfold_locales';
6356 hence 'proof' without argument may be used to unfold locale
6360 *** Document preparation ***
6362 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6363 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6364 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6365 spot); renamed link color from "darkblue" to "linkcolor" (default
6366 value unchanged, can be redefined via \definecolor); no longer sets
6367 "a4paper" option (unnecessary or even intrusive).
6369 * Antiquotation @{lemma A method} proves proposition A by the given
6370 method (either a method name or a method name plus (optional) method
6371 arguments in parentheses) and prints A just like @{prop A}.
6376 * New primrec package. Specification syntax conforms in style to
6377 definition/function/.... No separate induction rule is provided. The
6378 "primrec" command distinguishes old-style and new-style specifications
6379 by syntax. The former primrec package is now named OldPrimrecPackage.
6380 When adjusting theories, beware: constants stemming from new-style
6381 primrec specifications have authentic syntax.
6383 * Metis prover is now an order of magnitude faster, and also works
6384 with multithreading.
6386 * Metis: the maximum number of clauses that can be produced from a
6387 theorem is now given by the attribute max_clauses. Theorems that
6388 exceed this number are ignored, with a warning printed.
6390 * Sledgehammer no longer produces structured proofs by default. To
6391 enable, declare [[sledgehammer_full = true]]. Attributes
6392 reconstruction_modulus, reconstruction_sorts renamed
6393 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6395 * Method "induct_scheme" derives user-specified induction rules
6396 from well-founded induction and completeness of patterns. This factors
6397 out some operations that are done internally by the function package
6398 and makes them available separately. See
6399 src/HOL/ex/Induction_Scheme.thy for examples.
6401 * More flexible generation of measure functions for termination
6402 proofs: Measure functions can be declared by proving a rule of the
6403 form "is_measure f" and giving it the [measure_function] attribute.
6404 The "is_measure" predicate is logically meaningless (always true), and
6405 just guides the heuristic. To find suitable measure functions, the
6406 termination prover sets up the goal "is_measure ?f" of the appropriate
6407 type and generates all solutions by Prolog-style backward proof using
6410 This setup also deals with rules like
6412 "is_measure f ==> is_measure (list_size f)"
6414 which accommodates nested datatypes that recurse through lists.
6415 Similar rules are predeclared for products and option types.
6417 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6421 - Definitions of overloaded constants on sets have to be replaced by
6422 definitions on => and bool.
6424 - Some definitions of overloaded operators on sets can now be proved
6425 using the definitions of the operators on => and bool. Therefore,
6426 the following theorems have been renamed:
6428 subset_def -> subset_eq
6429 psubset_def -> psubset_eq
6430 set_diff_def -> set_diff_eq
6431 Compl_def -> Compl_eq
6432 Sup_set_def -> Sup_set_eq
6433 Inf_set_def -> Inf_set_eq
6434 sup_set_def -> sup_set_eq
6435 inf_set_def -> inf_set_eq
6437 - Due to the incompleteness of the HO unification algorithm, some
6438 rules such as subst may require manual instantiation, if some of
6439 the unknowns in the rule is a set.
6441 - Higher order unification and forward proofs:
6444 have "P (S::'a set)" <...>
6445 then have "EX S. P S" ..
6447 no longer works (due to the incompleteness of the HO unification
6448 algorithm) and must be replaced by the pattern
6455 - Calculational reasoning with subst (or similar rules):
6458 have "P (S::'a set)" <...>
6459 also have "S = T" <...>
6460 finally have "P T" .
6462 no longer works (for similar reasons as the previous example) and
6463 must be replaced by something like
6465 have "P (S::'a set)" <...>
6466 moreover have "S = T" <...>
6467 ultimately have "P T" by simp
6469 - Tactics or packages written in ML code:
6470 Code performing pattern matching on types via
6472 Type ("set", [T]) => ...
6474 must be rewritten. Moreover, functions like strip_type or
6475 binder_types no longer return the right value when applied to a
6478 T1 => ... => Tn => U => bool
6482 T1 => ... => Tn => U set
6484 * Merged theories Wellfounded_Recursion, Accessible_Part and
6485 Wellfounded_Relations to theory Wellfounded.
6487 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6489 * Class finite no longer treats UNIV as class parameter. Use class
6490 enum from theory Library/Enum instead to achieve a similar effect.
6493 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6494 and "Cons". INCOMPATIBILITY.
6496 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6497 Potential INCOMPATIBILITY.
6499 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6500 injective_fst_snd removed, use split_eta and prod_eqI instead.
6501 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6503 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6504 the same name in theory Orderings:
6514 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6515 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6516 and different variable names.
6518 * Library/Option_ord.thy: Canonical order on option type.
6520 * Library/RBT.thy: Red-black trees, an efficient implementation of
6523 * Library/Countable.thy: Type class for countable types.
6525 * Theory Int: The representation of numerals has changed. The infix
6526 operator BIT and the bit datatype with constructors B0 and B1 have
6527 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6528 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6529 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6532 * Theory Nat: definition of <= and < on natural numbers no longer
6533 depend on well-founded relations. INCOMPATIBILITY. Definitions
6534 le_def and less_def have disappeared. Consider lemmas not_less
6535 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6537 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6538 (whose purpose mainly is for various fold_set functionals) have been
6539 abandoned in favor of the existing algebraic classes
6540 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6541 lower_semilattice (resp. upper_semilattice) and linorder.
6544 * Theory Transitive_Closure: induct and cases rules now declare proper
6545 case_names ("base" and "step"). INCOMPATIBILITY.
6547 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6548 lattices. The form set-specific version is available as
6549 Inductive.lfp_ordinal_induct_set.
6551 * Renamed theorems "power.simps" to "power_int.simps".
6554 * Class semiring_div provides basic abstract properties of semirings
6555 with division and modulo operations. Subsumes former class dvd_mod.
6557 * Merged theories IntDef, Numeral and IntArith into unified theory
6558 Int. INCOMPATIBILITY.
6560 * Theory Library/Code_Index: type "index" now represents natural
6561 numbers rather than integers. INCOMPATIBILITY.
6563 * New class "uminus" with operation "uminus" (split of from class
6564 "minus" which now only has operation "minus", binary).
6567 * Constants "card", "internal_split", "option_map" now with authentic
6568 syntax. INCOMPATIBILITY.
6570 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6571 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6572 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6573 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6574 Sup_set_def, le_def, less_def, option_map_def now with object
6575 equality. INCOMPATIBILITY.
6577 * Records. Removed K_record, and replaced it by pure lambda term
6578 %x. c. The simplifier setup is now more robust against eta expansion.
6579 INCOMPATIBILITY: in cases explicitly referring to K_record.
6581 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6583 * Library/ListVector: new theory of arithmetic vector operations.
6585 * Library/Order_Relation: new theory of various orderings as sets of
6586 pairs. Defines preorders, partial orders, linear orders and
6587 well-orders on sets and on types.
6592 * Renamed some theories to allow to loading both ZF and HOL in the
6595 Datatype -> Datatype_ZF
6596 Inductive -> Inductive_ZF
6603 INCOMPATIBILITY: ZF theories that import individual theories below
6604 Main might need to be adapted. Regular theory Main is still
6605 available, as trivial extension of Main_ZF.
6610 * ML within Isar: antiquotation @{const name} or @{const
6611 name(typargs)} produces statically-checked Const term.
6613 * Functor NamedThmsFun: data is available to the user as dynamic fact
6614 (of the same name). Removed obsolete print command.
6616 * Removed obsolete "use_legacy_bindings" function.
6618 * The ``print mode'' is now a thread-local value derived from a global
6619 template (the former print_mode reference), thus access becomes
6620 non-critical. The global print_mode reference is for session
6621 management only; user-code should use print_mode_value,
6622 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6624 * Functions system/system_out provide a robust way to invoke external
6625 shell commands, with propagation of interrupts (requires Poly/ML
6626 5.2.1). Do not use OS.Process.system etc. from the basis library!
6631 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6632 in accordance with Proof General 3.7, which prefers GNU emacs.
6634 * isatool tty runs Isabelle process with plain tty interaction;
6635 optional line editor may be specified via ISABELLE_LINE_EDITOR
6636 setting, the default settings attempt to locate "ledit" and "rlwrap".
6638 * isatool browser now works with Cygwin as well, using general
6639 "javapath" function defined in Isabelle process environment.
6641 * YXML notation provides a simple and efficient alternative to
6642 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6643 isatool yxml as described in the Isabelle system manual.
6645 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6646 provides general wrapper for managing an Isabelle process in a robust
6647 fashion, with ``cooked'' output from stdin/stderr.
6649 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6650 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6652 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6653 way of changing the user's settings is via
6654 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6657 * Multithreading.max_threads := 0 refers to the number of actual CPU
6658 cores of the underlying machine, which is a good starting point for
6659 optimal performance tuning. The corresponding usedir option -M allows
6660 "max" as an alias for "0". WARNING: does not work on certain versions
6661 of Mac OS (with Poly/ML 5.1).
6663 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6664 adverse effect of Isabelle flooding interactive front-ends (notably
6665 ProofGeneral / XEmacs).
6669 New in Isabelle2007 (November 2007)
6670 -----------------------------------
6674 * More uniform information about legacy features, notably a
6675 warning/error of "Legacy feature: ...", depending on the state of the
6676 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6677 legacy features will disappear eventually.
6679 * Theory syntax: the header format ``theory A = B + C:'' has been
6680 discontinued in favour of ``theory A imports B C begin''. Use isatool
6681 fixheaders to convert existing theory files. INCOMPATIBILITY.
6683 * Theory syntax: the old non-Isar theory file format has been
6684 discontinued altogether. Note that ML proof scripts may still be used
6685 with Isar theories; migration is usually quite simple with the ML
6686 function use_legacy_bindings. INCOMPATIBILITY.
6688 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6689 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6692 * Theory loader: be more serious about observing the static theory
6693 header specifications (including optional directories), but not the
6694 accidental file locations of previously successful loads. The strict
6695 update policy of former update_thy is now already performed by
6696 use_thy, so the former has been removed; use_thys updates several
6697 theories simultaneously, just as 'imports' within a theory header
6698 specification, but without merging the results. Potential
6699 INCOMPATIBILITY: may need to refine theory headers and commands
6700 ROOT.ML which depend on load order.
6702 * Theory loader: optional support for content-based file
6703 identification, instead of the traditional scheme of full physical
6704 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6705 (cf. the system manual). The new scheme allows to work with
6706 non-finished theories in persistent session images, such that source
6707 files may be moved later on without requiring reloads.
6709 * Theory loader: old-style ML proof scripts being *attached* to a thy
6710 file (with the same base name as the theory) are considered a legacy
6711 feature, which will disappear eventually. Even now, the theory loader
6712 no longer maintains dependencies on such files.
6714 * Syntax: the scope for resolving ambiguities via type-inference is
6715 now limited to individual terms, instead of whole simultaneous
6716 specifications as before. This greatly reduces the complexity of the
6717 syntax module and improves flexibility by separating parsing and
6718 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6719 'fixes' etc.) are required in rare situations.
6721 * Syntax: constants introduced by new-style packages ('definition',
6722 'abbreviation' etc.) are passed through the syntax module in
6723 ``authentic mode''. This means that associated mixfix annotations
6724 really stick to such constants, independently of potential name space
6725 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6726 trees are represented slightly differently, may need to adapt syntax
6727 translations accordingly. Use CONST marker in 'translations' and
6728 @{const_syntax} antiquotation in 'parse_translation' etc.
6730 * Legacy goal package: reduced interface to the bare minimum required
6731 to keep existing proof scripts running. Most other user-level
6732 functions are now part of the OldGoals structure, which is *not* open
6733 by default (consider isatool expandshort before open OldGoals).
6734 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6735 these tend to cause confusion about the actual goal (!) context being
6736 used here, which is not necessarily the same as the_context().
6738 * Command 'find_theorems': supports "*" wild-card in "name:"
6739 criterion; "with_dups" option. Certain ProofGeneral versions might
6740 support a specific search form (see ProofGeneral/CHANGES).
6742 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6743 by default, which means that "prems" (and also "fixed variables") are
6744 suppressed from proof state output. Note that the ProofGeneral
6745 settings mechanism allows to change and save options persistently, but
6746 older versions of Isabelle will fail to start up if a negative prems
6749 * Local theory targets may be specified by non-nested blocks of
6750 ``context/locale/class ... begin'' followed by ``end''. The body may
6751 contain definitions, theorems etc., including any derived mechanism
6752 that has been implemented on top of these primitives. This concept
6753 generalizes the existing ``theorem (in ...)'' towards more versatility
6756 * Proof General interface: proper undo of final 'end' command;
6757 discontinued Isabelle/classic mode (ML proof scripts).
6760 *** Document preparation ***
6762 * Added antiquotation @{theory name} which prints the given name,
6763 after checking that it refers to a valid ancestor theory in the
6766 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6767 check the given source text as ML type/structure, printing verbatim.
6769 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6770 "c args == rhs" given in the current context. (Any number of
6771 arguments may be given on the LHS.)
6776 * The 'class' package offers a combination of axclass and locale to
6777 achieve Haskell-like type classes in Isabelle. Definitions and
6778 theorems within a class context produce both relative results (with
6779 implicit parameters according to the locale context), and polymorphic
6780 constants with qualified polymorphism (according to the class
6781 context). Within the body context of a 'class' target, a separate
6782 syntax layer ("user space type system") takes care of converting
6783 between global polymorphic consts and internal locale representation.
6784 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6785 "isatool doc classes" provides a tutorial.
6787 * Generic code generator framework allows to generate executable
6788 code for ML and Haskell (including Isabelle classes). A short usage
6791 internal compilation:
6792 export_code <list of constants (term syntax)> in SML
6793 writing SML code to a file:
6794 export_code <list of constants (term syntax)> in SML <filename>
6795 writing OCaml code to a file:
6796 export_code <list of constants (term syntax)> in OCaml <filename>
6797 writing Haskell code to a bunch of files:
6798 export_code <list of constants (term syntax)> in Haskell <filename>
6800 evaluating closed propositions to True/False using code generation:
6803 Reasonable default setup of framework in HOL.
6805 Theorem attributs for selecting and transforming function equations theorems:
6807 [code fun]: select a theorem as function equation for a specific constant
6808 [code fun del]: deselect a theorem as function equation for a specific constant
6809 [code inline]: select an equation theorem for unfolding (inlining) in place
6810 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6812 User-defined serializations (target in {SML, OCaml, Haskell}):
6814 code_const <and-list of constants (term syntax)>
6815 {(target) <and-list of const target syntax>}+
6817 code_type <and-list of type constructors>
6818 {(target) <and-list of type target syntax>}+
6820 code_instance <and-list of instances>
6822 where instance ::= <type constructor> :: <class>
6824 code_class <and_list of classes>
6825 {(target) <and-list of class target syntax>}+
6826 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6828 code_instance and code_class only are effective to target Haskell.
6830 For example usage see src/HOL/ex/Codegenerator.thy and
6831 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6832 generation from Isabelle/HOL theories is available via "isatool doc
6835 * Code generator: consts in 'consts_code' Isar commands are now
6836 referred to by usual term syntax (including optional type
6839 * Command 'no_translations' removes translation rules from theory
6842 * Overloaded definitions are now actually checked for acyclic
6843 dependencies. The overloading scheme is slightly more general than
6844 that of Haskell98, although Isabelle does not demand an exact
6845 correspondence to type class and instance declarations.
6846 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6847 exotic versions of overloading -- at the discretion of the user!
6849 Polymorphic constants are represented via type arguments, i.e. the
6850 instantiation that matches an instance against the most general
6851 declaration given in the signature. For example, with the declaration
6852 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6853 as c(nat). Overloading is essentially simultaneous structural
6854 recursion over such type arguments. Incomplete specification patterns
6855 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6856 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6857 Command 'print_theory' outputs the normalized system of recursive
6858 equations, see section "definitions".
6860 * Configuration options are maintained within the theory or proof
6861 context (with name and type bool/int/string), providing a very simple
6862 interface to a poor-man's version of general context data. Tools may
6863 declare options in ML (e.g. using Attrib.config_int) and then refer to
6864 these values using Config.get etc. Users may change options via an
6865 associated attribute of the same name. This form of context
6866 declaration works particularly well with commands 'declare' or
6867 'using', for example ``declare [[foo = 42]]''. Thus it has become
6868 very easy to avoid global references, which would not observe Isar
6869 toplevel undo/redo and fail to work with multithreading.
6871 Various global ML references of Pure and HOL have been turned into
6872 configuration options:
6874 Unify.search_bound unify_search_bound
6875 Unify.trace_bound unify_trace_bound
6876 Unify.trace_simp unify_trace_simp
6877 Unify.trace_types unify_trace_types
6878 Simplifier.simp_depth_limit simp_depth_limit
6879 Blast.depth_limit blast_depth_limit
6880 DatatypeProp.dtK datatype_distinctness_limit
6881 fast_arith_neq_limit fast_arith_neq_limit
6882 fast_arith_split_limit fast_arith_split_limit
6884 * Named collections of theorems may be easily installed as context
6885 data using the functor NamedThmsFun (see also
6886 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6887 attributes; there is also a toplevel print command. This facility is
6888 just a common case of general context data, which is the preferred way
6889 for anything more complex than just a list of facts in canonical
6892 * Isar: command 'declaration' augments a local theory by generic
6893 declaration functions written in ML. This enables arbitrary content
6894 being added to the context, depending on a morphism that tells the
6895 difference of the original declaration context wrt. the application
6896 context encountered later on.
6898 * Isar: proper interfaces for simplification procedures. Command
6899 'simproc_setup' declares named simprocs (with match patterns, and body
6900 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6901 context. ML antiquotation @{simproc name} retrieves named simprocs.
6903 * Isar: an extra pair of brackets around attribute declarations
6904 abbreviates a theorem reference involving an internal dummy fact,
6905 which will be ignored later --- only the effect of the attribute on
6906 the background context will persist. This form of in-place
6907 declarations is particularly useful with commands like 'declare' and
6908 'using', for example ``have A using [[simproc a]] by simp''.
6910 * Isar: method "assumption" (and implicit closing of subproofs) now
6911 takes simple non-atomic goal assumptions into account: after applying
6912 an assumption as a rule the resulting subgoals are solved by atomic
6913 assumption steps. This is particularly useful to finish 'obtain'
6914 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6915 without referring to the original premise "!!x. P x ==> thesis" in the
6916 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6919 * Isar: implicit use of prems from the Isar proof context is
6920 considered a legacy feature. Common applications like ``have A .''
6921 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6922 referencing facts explicitly here improves readability and
6923 maintainability of proof texts.
6925 * Isar: improper proof element 'guess' is like 'obtain', but derives
6926 the obtained context from the course of reasoning! For example:
6928 assume "EX x y. A x & B y" -- "any previous fact"
6929 then guess x and y by clarify
6931 This technique is potentially adventurous, depending on the facts and
6932 proof tools being involved here.
6934 * Isar: known facts from the proof context may be specified as literal
6935 propositions, using ASCII back-quote syntax. This works wherever
6936 named facts used to be allowed so far, in proof commands, proof
6937 methods, attributes etc. Literal facts are retrieved from the context
6938 according to unification of type and term parameters. For example,
6939 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6940 theorems in the current context, then these are valid literal facts:
6941 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6943 There is also a proof method "fact" which does the same composition
6944 for explicit goal states, e.g. the following proof texts coincide with
6945 certain special cases of literal facts:
6947 have "A" by fact == note `A`
6948 have "A ==> B" by fact == note `A ==> B`
6949 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6950 have "P a ==> Q a" by fact == note `P a ==> Q a`
6952 * Isar: ":" (colon) is no longer a symbolic identifier character in
6953 outer syntax. Thus symbolic identifiers may be used without
6954 additional white space in declarations like this: ``assume *: A''.
6956 * Isar: 'print_facts' prints all local facts of the current context,
6957 both named and unnamed ones.
6959 * Isar: 'def' now admits simultaneous definitions, e.g.:
6961 def x == "t" and y == "u"
6963 * Isar: added command 'unfolding', which is structurally similar to
6964 'using', but affects both the goal state and facts by unfolding given
6965 rewrite rules. Thus many occurrences of the 'unfold' method or
6966 'unfolded' attribute may be replaced by first-class proof text.
6968 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6969 and command 'unfolding' now all support object-level equalities
6970 (potentially conditional). The underlying notion of rewrite rule is
6971 analogous to the 'rule_format' attribute, but *not* that of the
6972 Simplifier (which is usually more generous).
6974 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6975 premises of a theorem by n. Useful in conjunction with drule.
6977 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6978 method expression within a sandbox consisting of the first N
6979 sub-goals, which need to exist. For example, ``simp_all [3]''
6980 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6981 simplifies all new goals that emerge from applying rule foo to the
6982 originally first one.
6984 * Isar: schematic goals are no longer restricted to higher-order
6985 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6988 * Isar: the conclusion of a long theorem statement is now either
6989 'shows' (a simultaneous conjunction, as before), or 'obtains'
6990 (essentially a disjunction of cases with local parameters and
6991 assumptions). The latter allows to express general elimination rules
6992 adequately; in this notation common elimination rules look like this:
6994 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6996 obtains x where "P x"
6998 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7002 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7008 The subsequent classical rules even refer to the formal "thesis"
7011 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7014 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7015 obtains "thesis ==> something"
7017 The actual proof of an 'obtains' statement is analogous to that of the
7018 Isar proof element 'obtain', only that there may be several cases.
7019 Optional case names may be specified in parentheses; these will be
7020 available both in the present proof and as annotations in the
7021 resulting rule, for later use with the 'cases' method (cf. attribute
7024 * Isar: the assumptions of a long theorem statement are available as
7025 "assms" fact in the proof context. This is more appropriate than the
7026 (historical) "prems", which refers to all assumptions of the current
7027 context, including those from the target locale, proof body etc.
7029 * Isar: 'print_statement' prints theorems from the current theory or
7030 proof context in long statement form, according to the syntax of a
7033 * Isar: 'obtain' takes an optional case name for the local context
7034 introduction rule (default "that").
7036 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7037 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7040 * Pure: syntax "CONST name" produces a fully internalized constant
7041 according to the current context. This is particularly useful for
7042 syntax translations that should refer to internal constant
7043 representations independently of name spaces.
7045 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7046 instead of "FOO ". This allows multiple binder declarations to coexist
7047 in the same context. INCOMPATIBILITY.
7049 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7050 primitive that also works in a locale context (both for constants and
7051 fixed variables). Type declaration and internal syntactic representation
7052 of given constants retrieved from the context. Likewise, the
7053 'no_notation' command allows to remove given syntax annotations from the
7056 * Isar/locales: new derived specification elements 'axiomatization',
7057 'definition', 'abbreviation', which support type-inference, admit
7058 object-level specifications (equality, equivalence). See also the
7059 isar-ref manual. Examples:
7062 eq (infix "===" 50) where
7063 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7065 definition "f x y = x + y + 1"
7066 definition g where "g x = f x x"
7069 neq (infix "=!=" 50) where
7070 "x =!= y == ~ (x === y)"
7072 These specifications may be also used in a locale context. Then the
7073 constants being introduced depend on certain fixed parameters, and the
7074 constant name is qualified by the locale base name. An internal
7075 abbreviation takes care for convenient input and output, making the
7076 parameters implicit and using the original short name. See also
7077 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7078 entities from a monomorphic theory.
7080 Presently, abbreviations are only available 'in' a target locale, but
7081 not inherited by general import expressions. Also note that
7082 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7083 'translations' in common applications. The "no_abbrevs" print mode
7084 prevents folding of abbreviations in term output.
7086 Concrete syntax is attached to specified constants in internal form,
7087 independently of name spaces. The parse tree representation is
7088 slightly different -- use 'notation' instead of raw 'syntax', and
7089 'translations' with explicit "CONST" markup to accommodate this.
7091 * Pure/Isar: unified syntax for new-style specification mechanisms
7092 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7093 full type inference and dummy patterns ("_"). For example:
7095 definition "K x _ = x"
7097 inductive conj for A B
7098 where "A ==> B ==> conj A B"
7100 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7101 the current context. Print mode "no_abbrevs" prevents inversion of
7102 abbreviations on output.
7104 * Isar/locales: improved parameter handling: use of locales "var" and
7105 "struct" no longer necessary; - parameter renamings are no longer
7106 required to be injective. For example, this allows to define
7107 endomorphisms as locale endom = homom mult mult h.
7109 * Isar/locales: changed the way locales with predicates are defined.
7110 Instead of accumulating the specification, the imported expression is
7111 now an interpretation. INCOMPATIBILITY: different normal form of
7112 locale expressions. In particular, in interpretations of locales with
7113 predicates, goals repesenting already interpreted fragments are not
7114 removed automatically. Use methods `intro_locales' and
7115 `unfold_locales'; see below.
7117 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7118 provide backward reasoning on locales predicates. The methods are
7119 aware of interpretations and discharge corresponding goals.
7120 `intro_locales' is less aggressive then `unfold_locales' and does not
7121 unfold predicates to assumptions.
7123 * Isar/locales: the order in which locale fragments are accumulated
7124 has changed. This enables to override declarations from fragments due
7125 to interpretations -- for example, unwanted simp rules.
7127 * Isar/locales: interpretation in theories and proof contexts has been
7128 extended. One may now specify (and prove) equations, which are
7129 unfolded in interpreted theorems. This is useful for replacing
7130 defined concepts (constants depending on locale parameters) by
7131 concepts already existing in the target context. Example:
7133 interpretation partial_order ["op <= :: [int, int] => bool"]
7134 where "partial_order.less (op <=) (x::int) y = (x < y)"
7136 Typically, the constant `partial_order.less' is created by a
7137 definition specification element in the context of locale
7140 * Method "induct": improved internal context management to support
7141 local fixes and defines on-the-fly. Thus explicit meta-level
7142 connectives !! and ==> are rarely required anymore in inductive goals
7143 (using object-logic connectives for this purpose has been long
7144 obsolete anyway). Common proof patterns are explained in
7145 src/HOL/Induct/Common_Patterns.thy, see also
7146 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7149 * Method "induct": improved handling of simultaneous goals. Instead of
7150 introducing object-level conjunction, the statement is now split into
7151 several conclusions, while the corresponding symbolic cases are nested
7152 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7153 see src/HOL/Induct/Common_Patterns.thy, for example.
7155 * Method "induct": mutual induction rules are now specified as a list
7156 of rule sharing the same induction cases. HOL packages usually provide
7157 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7158 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7159 mutual induction rules differently, i.e. like this:
7161 (induct rule: foo_bar.inducts)
7162 (induct set: foo bar)
7163 (induct pred: foo bar)
7164 (induct type: foo bar)
7166 The ML function ProjectRule.projections turns old-style rules into the
7169 * Method "coinduct": dual of induction, see
7170 src/HOL/Library/Coinductive_List.thy for various examples.
7172 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7173 considered a legacy feature.
7175 * Attribute "symmetric" produces result with standardized schematic
7176 variables (index 0). Potential INCOMPATIBILITY.
7178 * Simplifier: by default the simplifier trace only shows top level
7179 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7180 default. Thus there is less danger of being flooded by the trace. The
7181 trace indicates where parts have been suppressed.
7183 * Provers/classical: removed obsolete classical version of elim_format
7184 attribute; classical elim/dest rules are now treated uniformly when
7185 manipulating the claset.
7187 * Provers/classical: stricter checks to ensure that supplied intro,
7188 dest and elim rules are well-formed; dest and elim rules must have at
7191 * Provers/classical: attributes dest/elim/intro take an optional
7192 weight argument for the rule (just as the Pure versions). Weights are
7193 ignored by automated tools, but determine the search order of single
7196 * Syntax: input syntax now supports dummy variable binding "%_. b",
7197 where the body does not mention the bound variable. Note that dummy
7198 patterns implicitly depend on their context of bounds, which makes
7199 "{_. _}" match any set comprehension as expected. Potential
7200 INCOMPATIBILITY -- parse translations need to cope with syntactic
7201 constant "_idtdummy" in the binding position.
7203 * Syntax: removed obsolete syntactic constant "_K" and its associated
7204 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7205 for example "A -> B" => "Pi A (%_. B)".
7207 * Pure: 'class_deps' command visualizes the subclass relation, using
7208 the graph browser tool.
7210 * Pure: 'print_theory' now suppresses certain internal declarations by
7211 default; use '!' option for full details.
7216 * Method "metis" proves goals by applying the Metis general-purpose
7217 resolution prover (see also http://gilith.com/software/metis/).
7218 Examples are in the directory MetisExamples. WARNING: the
7219 Isabelle/HOL-Metis integration does not yet work properly with
7222 * Command 'sledgehammer' invokes external automatic theorem provers as
7223 background processes. It generates calls to the "metis" method if
7224 successful. These can be pasted into the proof. Users do not have to
7225 wait for the automatic provers to return. WARNING: does not really
7226 work with multi-threading.
7228 * New "auto_quickcheck" feature tests outermost goal statements for
7229 potential counter-examples. Controlled by ML references
7230 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7231 5000 milliseconds). Fails silently if statements is outside of
7232 executable fragment, or any other codgenerator problem occurs.
7234 * New constant "undefined" with axiom "undefined x = undefined".
7236 * Added class "HOL.eq", allowing for code generation with polymorphic
7239 * Some renaming of class constants due to canonical name prefixing in
7240 the new 'class' package:
7242 HOL.abs ~> HOL.abs_class.abs
7243 HOL.divide ~> HOL.divide_class.divide
7244 0 ~> HOL.zero_class.zero
7245 1 ~> HOL.one_class.one
7246 op + ~> HOL.plus_class.plus
7247 op - ~> HOL.minus_class.minus
7248 uminus ~> HOL.minus_class.uminus
7249 op * ~> HOL.times_class.times
7250 op < ~> HOL.ord_class.less
7251 op <= > HOL.ord_class.less_eq
7252 Nat.power ~> Power.power_class.power
7253 Nat.size ~> Nat.size_class.size
7254 Numeral.number_of ~> Numeral.number_class.number_of
7255 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7256 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7257 Orderings.min ~> Orderings.ord_class.min
7258 Orderings.max ~> Orderings.ord_class.max
7259 Divides.op div ~> Divides.div_class.div
7260 Divides.op mod ~> Divides.div_class.mod
7261 Divides.op dvd ~> Divides.div_class.dvd
7263 INCOMPATIBILITY. Adaptions may be required in the following cases:
7265 a) User-defined constants using any of the names "plus", "minus",
7266 "times", "less" or "less_eq". The standard syntax translations for
7267 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7270 b) Variables named "plus", "minus", "times", "less", "less_eq"
7271 INCOMPATIBILITY: use more specific names.
7273 c) Permutative equations (e.g. "a + b = b + a")
7274 Since the change of names also changes the order of terms, permutative
7275 rewrite rules may get applied in a different order. Experience shows
7276 that this is rarely the case (only two adaptions in the whole Isabelle
7277 distribution). INCOMPATIBILITY: rewrite proofs
7279 d) ML code directly refering to constant names
7280 This in general only affects hand-written proof tactics, simprocs and
7281 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7282 Consider using @{const_name} antiquotation.
7284 * New class "default" with associated constant "default".
7286 * Function "sgn" is now overloaded and available on int, real, complex
7287 (and other numeric types), using class "sgn". Two possible defs of
7288 sgn are given as equational assumptions in the classes sgn_if and
7289 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7292 * Locale "partial_order" now unified with class "order" (cf. theory
7293 Orderings), added parameter "less". INCOMPATIBILITY.
7295 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7296 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7297 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7299 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7300 changed order of proof goals in instance proofs.
7302 * The transitivity reasoner for partial and linear orders is set up
7303 for classes "order" and "linorder". Instances of the reasoner are available
7304 in all contexts importing or interpreting the corresponding locales.
7305 Method "order" invokes the reasoner separately; the reasoner
7306 is also integrated with the Simplifier as a solver. Diagnostic
7307 command 'print_orders' shows the available instances of the reasoner
7308 in the current context.
7310 * Localized monotonicity predicate in theory "Orderings"; integrated
7311 lemmas max_of_mono and min_of_mono with this predicate.
7314 * Formulation of theorem "dense" changed slightly due to integration
7315 with new class dense_linear_order.
7317 * Uniform lattice theory development in HOL.
7319 constants "meet" and "join" now named "inf" and "sup"
7320 constant "Meet" now named "Inf"
7322 classes "meet_semilorder" and "join_semilorder" now named
7323 "lower_semilattice" and "upper_semilattice"
7324 class "lorder" now named "lattice"
7325 class "comp_lat" now named "complete_lattice"
7327 Instantiation of lattice classes allows explicit definitions
7328 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7330 INCOMPATIBILITY. Theorem renames:
7332 meet_left_le ~> inf_le1
7333 meet_right_le ~> inf_le2
7334 join_left_le ~> sup_ge1
7335 join_right_le ~> sup_ge2
7336 meet_join_le ~> inf_sup_ord
7339 le_meet ~> le_inf_iff
7340 le_join ~> ge_sup_conv
7341 meet_idempotent ~> inf_idem
7342 join_idempotent ~> sup_idem
7343 meet_comm ~> inf_commute
7344 join_comm ~> sup_commute
7345 meet_leI1 ~> le_infI1
7346 meet_leI2 ~> le_infI2
7347 le_joinI1 ~> le_supI1
7348 le_joinI2 ~> le_supI2
7349 meet_assoc ~> inf_assoc
7350 join_assoc ~> sup_assoc
7351 meet_left_comm ~> inf_left_commute
7352 meet_left_idempotent ~> inf_left_idem
7353 join_left_comm ~> sup_left_commute
7354 join_left_idempotent ~> sup_left_idem
7357 le_def_meet ~> le_iff_inf
7358 le_def_join ~> le_iff_sup
7359 join_absorp2 ~> sup_absorb2
7360 join_absorp1 ~> sup_absorb1
7361 meet_absorp1 ~> inf_absorb1
7362 meet_absorp2 ~> inf_absorb2
7363 meet_join_absorp ~> inf_sup_absorb
7364 join_meet_absorp ~> sup_inf_absorb
7365 distrib_join_le ~> distrib_sup_le
7366 distrib_meet_le ~> distrib_inf_le
7368 add_meet_distrib_left ~> add_inf_distrib_left
7369 add_join_distrib_left ~> add_sup_distrib_left
7370 is_join_neg_meet ~> is_join_neg_inf
7371 is_meet_neg_join ~> is_meet_neg_sup
7372 add_meet_distrib_right ~> add_inf_distrib_right
7373 add_join_distrib_right ~> add_sup_distrib_right
7374 add_meet_join_distribs ~> add_sup_inf_distribs
7375 join_eq_neg_meet ~> sup_eq_neg_inf
7376 meet_eq_neg_join ~> inf_eq_neg_sup
7377 add_eq_meet_join ~> add_eq_inf_sup
7378 meet_0_imp_0 ~> inf_0_imp_0
7379 join_0_imp_0 ~> sup_0_imp_0
7380 meet_0_eq_0 ~> inf_0_eq_0
7381 join_0_eq_0 ~> sup_0_eq_0
7382 neg_meet_eq_join ~> neg_inf_eq_sup
7383 neg_join_eq_meet ~> neg_sup_eq_inf
7384 join_eq_if ~> sup_eq_if
7386 mono_meet ~> mono_inf
7387 mono_join ~> mono_sup
7388 meet_bool_eq ~> inf_bool_eq
7389 join_bool_eq ~> sup_bool_eq
7390 meet_fun_eq ~> inf_fun_eq
7391 join_fun_eq ~> sup_fun_eq
7392 meet_set_eq ~> inf_set_eq
7393 join_set_eq ~> sup_set_eq
7394 meet1_iff ~> inf1_iff
7395 meet2_iff ~> inf2_iff
7404 join1_iff ~> sup1_iff
7405 join2_iff ~> sup2_iff
7415 is_meet_Meet ~> is_meet_Inf
7416 Meet_bool_def ~> Inf_bool_def
7417 Meet_fun_def ~> Inf_fun_def
7418 Meet_greatest ~> Inf_greatest
7419 Meet_lower ~> Inf_lower
7420 Meet_set_def ~> Inf_set_def
7423 Sup_bool_eq ~> Sup_bool_def
7424 Sup_fun_eq ~> Sup_fun_def
7425 Sup_set_eq ~> Sup_set_def
7427 listsp_meetI ~> listsp_infI
7428 listsp_meet_eq ~> listsp_inf_eq
7433 * Added syntactic class "size"; overloaded constant "size" now has
7434 type "'a::size ==> bool"
7436 * Internal reorganisation of `size' of datatypes: size theorems
7437 "foo.size" are no longer subsumed by "foo.simps" (but are still
7438 simplification rules by default!); theorems "prod.size" now named
7441 * Class "div" now inherits from class "times" rather than "type".
7444 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7445 Linorder etc. have disappeared; operations defined in terms of
7446 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7448 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7450 * HOL-Word: New extensive library and type for generic, fixed size
7451 machine words, with arithmetic, bit-wise, shifting and rotating
7452 operations, reflection into int, nat, and bool lists, automation for
7453 linear arithmetic (by automatic reflection into nat or int), including
7454 lemmas on overflow and monotonicity. Instantiated to all appropriate
7455 arithmetic type classes, supporting automatic simplification of
7456 numerals on all operations.
7458 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7460 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7462 * Code generator library theories:
7463 - Code_Integer represents HOL integers by big integer literals in target
7465 - Code_Char represents HOL characters by character literals in target
7467 - Code_Char_chr like Code_Char, but also offers treatment of character
7468 codes; includes Code_Integer.
7469 - Executable_Set allows to generate code for finite sets using lists.
7470 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7472 - Executable_Real implements a subset of real numbers, namly those
7473 representable by rational numbers.
7474 - Efficient_Nat implements natural numbers by integers, which in general will
7475 result in higher efficency; pattern matching with 0/Suc is eliminated;
7476 includes Code_Integer.
7477 - Code_Index provides an additional datatype index which is mapped to
7478 target-language built-in integers.
7479 - Code_Message provides an additional datatype message_string which is isomorphic to
7480 strings; messages are mapped to target-language strings.
7482 * New package for inductive predicates
7484 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7487 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7488 for z_1 :: U_1 and ... and z_n :: U_m
7490 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7493 with full support for type-inference, rather than
7495 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7497 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7498 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7500 inductive "s z_1 ... z_m"
7502 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7505 For backward compatibility, there is a wrapper allowing inductive
7506 sets to be defined with the new package via
7509 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7510 for z_1 :: U_1 and ... and z_n :: U_m
7512 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7518 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7519 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7520 for z_1 :: U_1 and ... and z_n :: U_m
7522 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7523 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7526 if the additional syntax "p ..." is required.
7528 Numerous examples can be found in the subdirectories src/HOL/Auth,
7529 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7533 - Since declaration and definition of inductive sets or predicates
7534 is no longer separated, abbreviations involving the newly
7535 introduced sets or predicates must be specified together with the
7536 introduction rules after the 'where' keyword (see above), rather
7537 than before the actual inductive definition.
7539 - The variables in induction and elimination rules are now
7540 quantified in the order of their occurrence in the introduction
7541 rules, rather than in alphabetical order. Since this may break
7542 some proofs, these proofs either have to be repaired, e.g. by
7543 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7544 statements of the form
7546 case (rule_i a_i_1 ... a_i_{k_i})
7548 or the old order of quantification has to be restored by explicitly adding
7549 meta-level quantifiers in the introduction rules, i.e.
7551 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7553 - The format of the elimination rules is now
7555 p z_1 ... z_m x_1 ... x_n ==>
7556 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7561 (x_1, ..., x_n) : s z_1 ... z_m ==>
7562 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7565 for sets rather than
7567 x : s z_1 ... z_m ==>
7568 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7571 This may require terms in goals to be expanded to n-tuples
7572 (e.g. using case_tac or simplification with the split_paired_all
7573 rule) before the above elimination rule is applicable.
7575 - The elimination or case analysis rules for (mutually) inductive
7576 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7577 list of rules "p_1_..._p_k.elims" is no longer available.
7579 * New package "function"/"fun" for general recursive functions,
7580 supporting mutual and nested recursion, definitions in local contexts,
7581 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7582 for small examples, and the separate tutorial on the function
7583 package. The old recdef "package" is still available as before, but
7584 users are encouraged to use the new package.
7586 * Method "lexicographic_order" automatically synthesizes termination
7587 relations as lexicographic combinations of size measures.
7589 * Case-expressions allow arbitrary constructor-patterns (including
7590 "_") and take their order into account, like in functional
7591 programming. Internally, this is translated into nested
7592 case-expressions; missing cases are added and mapped to the predefined
7593 constant "undefined". In complicated cases printing may no longer show
7594 the original input but the internal form. Lambda-abstractions allow
7595 the same form of pattern matching: "% pat1 => e1 | ..." is an
7596 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7599 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7600 is an abbreviation for "of_nat :: nat => int". The simplification
7601 rules for "of_nat" have been changed to work like "int" did
7602 previously. Potential INCOMPATIBILITY:
7603 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7604 - of_nat_diff and of_nat_mult are no longer default simp rules
7606 * Method "algebra" solves polynomial equations over (semi)rings using
7607 Groebner bases. The (semi)ring structure is defined by locales and the
7608 tool setup depends on that generic context. Installing the method for
7609 a specific type involves instantiating the locale and possibly adding
7610 declarations for computation on the coefficients. The method is
7611 already instantiated for natural numbers and for the axiomatic class
7612 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7613 CALCULEMUS 2007 for the general principles underlying this
7614 architecture of context-aware proof-tools.
7616 * Method "ferrack" implements quantifier elimination over
7617 special-purpose dense linear orders using locales (analogous to
7618 "algebra"). The method is already installed for class
7619 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7622 * Former constant "List.op @" now named "List.append". Use ML
7623 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7624 circumvent possible incompatibilities when working on ML level.
7626 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7628 * New function listsum :: 'a list => 'a for arbitrary monoids.
7629 Special syntax: "SUM x <- xs. f x" (and latex variants)
7631 * New syntax for Haskell-like list comprehension (input only), eg.
7632 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7634 * The special syntax for function "filter" has changed from [x :
7635 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7636 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7638 * [a..b] is now defined for arbitrary linear orders. It used to be
7639 defined on nat only, as an abbreviation for [a..<Suc b]
7642 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7644 * New functions "sorted" and "sort" in src/HOL/List.thy.
7646 * New lemma collection field_simps (an extension of ring_simps) for
7647 manipulating (in)equations involving division. Multiplies with all
7648 denominators that can be proved to be non-zero (in equations) or
7649 positive/negative (in inequations).
7651 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7652 have been improved and renamed to ring_simps, group_simps and
7653 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7654 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7656 * Theory Library/Commutative_Ring: switched from recdef to function
7657 package; constants add, mul, pow now curried. Infix syntax for
7658 algebraic operations.
7660 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7663 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7666 * HOL/records: generalised field-update to take a function on the
7667 field rather than the new value: r(|A := x|) is translated to A_update
7668 (K x) r The K-combinator that is internally used is called K_record.
7669 INCOMPATIBILITY: Usage of the plain update functions has to be
7672 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7673 * x = 0, which are required for a semiring. Richer structures do not
7674 inherit from semiring_0 anymore, because this property is a theorem
7675 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7676 there is more to prove, but this is mostly trivial.
7678 * Class "recpower" is generalized to arbitrary monoids, not just
7679 commutative semirings. INCOMPATIBILITY: may need to incorporate
7680 commutativity or semiring properties additionally.
7682 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7683 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7684 better use 'abbreviation'.
7686 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7688 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7689 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7690 significant changes for setting up numeral syntax for types:
7691 - New constants Numeral.pred and Numeral.succ instead
7692 of former Numeral.bin_pred and Numeral.bin_succ.
7693 - Use integer operations instead of bin_add, bin_mult and so on.
7694 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7695 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7697 See src/HOL/Integ/IntArith.thy for an example setup.
7699 * Command 'normal_form' computes the normal form of a term that may
7700 contain free variables. For example ``normal_form "rev [a, b, c]"''
7701 produces ``[b, c, a]'' (without proof). This command is suitable for
7702 heavy-duty computations because the functions are compiled to ML
7703 first. Correspondingly, a method "normalization" is provided. See
7704 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7706 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7707 25 like -->); output depends on the "iff" print_mode, the default is
7708 "A = B" (with priority 50).
7710 * Relations less (<) and less_eq (<=) are also available on type bool.
7711 Modified syntax to disallow nesting without explicit parentheses,
7712 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7715 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7717 * Relation composition operator "op O" now has precedence 75 and binds
7718 stronger than union and intersection. INCOMPATIBILITY.
7720 * The old set interval syntax "{m..n(}" (and relatives) has been
7721 removed. Use "{m..<n}" (and relatives) instead.
7723 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7724 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7725 ``declare [[simproc del: neq]]''.
7727 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7730 * Theorem Cons_eq_map_conv no longer declared as "simp".
7732 * Theorem setsum_mult renamed to setsum_right_distrib.
7734 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7737 * Reimplemented methods "sat" and "satx", with several improvements:
7738 goals no longer need to be stated as "<prems> ==> False", equivalences
7739 (i.e. "=" on type bool) are handled, variable names of the form
7740 "lit_<n>" are no longer reserved, significant speedup.
7742 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7743 zChaff is still supported as well.
7745 * 'inductive' and 'datatype': provide projections of mutual rules,
7746 bundled as foo_bar.inducts;
7748 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7751 * Library: moved theory Accessible_Part to main HOL.
7753 * Library: added theory Coinductive_List of potentially infinite lists
7754 as greatest fixed-point.
7756 * Library: added theory AssocList which implements (finite) maps as
7759 * Method "evaluation" solves goals (i.e. a boolean expression)
7760 efficiently by compiling it to ML. The goal is "proved" (via an
7761 oracle) if it evaluates to True.
7763 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7764 also when invoked by the simplifier. This results in the Simplifier
7765 being more powerful on arithmetic goals. INCOMPATIBILITY.
7766 Configuration option fast_arith_split_limit=0 recovers the old
7769 * Support for hex (0x20) and binary (0b1001) numerals.
7771 * New method: reify eqs (t), where eqs are equations for an
7772 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7773 parameter, computes a term s::'b and a list xs::'a list and proves the
7774 theorem I xs s = t. This is also known as reification or quoting. The
7775 resulting theorem is applied to the subgoal to substitute t with I xs
7776 s. If t is omitted, the subgoal itself is reified.
7778 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7779 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7780 where f is supposed to be a computable function (in the sense of code
7781 generattion). The method uses reify to compute s and xs as above then
7782 applies corr_thm and uses normalization by evaluation to "prove" f s =
7783 r and finally gets the theorem t = r, which is again applied to the
7784 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7786 * Reflection: Automatic reification now handels binding, an example is
7787 available in src/HOL/ex/ReflectionEx.thy
7789 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7790 command 'statespace' that is similar to 'record', but introduces an
7791 abstract specification based on the locale infrastructure instead of
7792 HOL types. This leads to extra flexibility in composing state spaces,
7793 in particular multiple inheritance and renaming of components.
7798 * Hyperreal: Functions root and sqrt are now defined on negative real
7799 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7800 Nonnegativity side conditions have been removed from many lemmas, so
7801 that more subgoals may now be solved by simplification; potential
7804 * Real: new type classes formalize real normed vector spaces and
7805 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7806 and norm :: 'a => real.
7808 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7809 reals into other types. The overloaded constant Reals :: 'a set is now
7810 defined as range of_real; potential INCOMPATIBILITY.
7812 * Real: proper support for ML code generation, including 'quickcheck'.
7813 Reals are implemented as arbitrary precision rationals.
7815 * Hyperreal: Several constants that previously worked only for the
7816 reals have been generalized, so they now work over arbitrary vector
7817 spaces. Type annotations may need to be added in some cases; potential
7820 Infinitesimal :: ('a::real_normed_vector) star set
7821 HFinite :: ('a::real_normed_vector) star set
7822 HInfinite :: ('a::real_normed_vector) star set
7823 approx :: ('a::real_normed_vector) star => 'a star => bool
7824 monad :: ('a::real_normed_vector) star => 'a star set
7825 galaxy :: ('a::real_normed_vector) star => 'a star set
7826 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7827 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7828 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7829 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7830 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7831 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7832 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7833 sgn :: 'a::real_normed_vector => 'a
7834 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7836 * Complex: Some complex-specific constants are now abbreviations for
7837 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7838 hnorm. Other constants have been entirely removed in favor of the
7839 polymorphic versions (INCOMPATIBILITY):
7843 HInfinite <-- CInfinite
7844 Infinitesimal <-- CInfinitesimal
7847 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7848 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7849 (ns)deriv <-- (ns)cderiv
7854 * Formalisation of ideals and the quotient construction over rings.
7856 * Order and lattice theory no longer based on records.
7859 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7860 greatest_closed. INCOMPATIBILITY.
7862 * Method algebra is now set up via an attribute. For examples see
7863 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7864 of algebraic structures.
7866 * Renamed theory CRing to Ring.
7871 * Substantial, yet incomplete support for nominal datatypes (binding
7872 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7873 src/HOL/Nominal/Examples. Prospective users should consult
7874 http://isabelle.in.tum.de/nominal/
7879 * ML basics: just one true type int, which coincides with IntInf.int
7882 * ML within Isar: antiquotations allow to embed statically-checked
7883 formal entities in the source, referring to the context available at
7884 compile-time. For example:
7886 ML {* @{sort "{zero,one}"} *}
7887 ML {* @{typ "'a => 'b"} *}
7888 ML {* @{term "%x. x"} *}
7889 ML {* @{prop "x == y"} *}
7890 ML {* @{ctyp "'a => 'b"} *}
7891 ML {* @{cterm "%x. x"} *}
7892 ML {* @{cprop "x == y"} *}
7893 ML {* @{thm asm_rl} *}
7894 ML {* @{thms asm_rl} *}
7895 ML {* @{type_name c} *}
7896 ML {* @{type_syntax c} *}
7897 ML {* @{const_name c} *}
7898 ML {* @{const_syntax c} *}
7901 ML {* @{theory Pure} *}
7902 ML {* @{theory_ref} *}
7903 ML {* @{theory_ref Pure} *}
7906 ML {* @{clasimpset} *}
7908 The same works for sources being ``used'' within an Isar context.
7910 * ML in Isar: improved error reporting; extra verbosity with
7911 ML_Context.trace enabled.
7913 * Pure/General/table.ML: the join operations now works via exceptions
7914 DUP/SAME instead of type option. This is simpler in simple cases, and
7915 admits slightly more efficient complex applications.
7917 * Pure: 'advanced' translation functions (parse_translation etc.) now
7918 use Context.generic instead of just theory.
7920 * Pure: datatype Context.generic joins theory/Proof.context and
7921 provides some facilities for code that works in either kind of
7922 context, notably GenericDataFun for uniform theory and proof data.
7924 * Pure: simplified internal attribute type, which is now always
7925 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7926 local (Proof.context) attributes have been discontinued, while
7927 minimizing code duplication. Thm.rule_attribute and
7928 Thm.declaration_attribute build canonical attributes; see also structure
7929 Context for further operations on Context.generic, notably
7930 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7931 declarations and definitions.
7933 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7934 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7935 init only required for impure data. INCOMPATIBILITY: empty really need
7936 to be empty (no dependencies on theory content!)
7938 * Pure/kernel: consts certification ignores sort constraints given in
7939 signature declarations. (This information is not relevant to the
7940 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7941 potential INCOMPATIBILITY.
7943 * Pure: axiomatic type classes are now purely definitional, with
7944 explicit proofs of class axioms and super class relations performed
7945 internally. See Pure/axclass.ML for the main internal interfaces --
7946 notably AxClass.define_class supercedes AxClass.add_axclass, and
7947 AxClass.axiomatize_class/classrel/arity supersede
7948 Sign.add_classes/classrel/arities.
7950 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7951 global/local versions on theory vs. Proof.context have been
7952 discontinued; Attrib.syntax and Method.syntax have been adapted
7953 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7954 attributes, methods, etc.
7956 * Pure: several functions of signature "... -> theory -> theory * ..."
7957 have been reoriented to "... -> theory -> ... * theory" in order to
7958 allow natural usage in combination with the ||>, ||>>, |-> and
7959 fold_map combinators.
7961 * Pure: official theorem names (closed derivations) and additional
7962 comments (tags) are now strictly separate. Name hints -- which are
7963 maintained as tags -- may be attached any time without affecting the
7966 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7967 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7968 achieve the old behaviour.
7970 * Pure: the "Goal" constant is now called "prop", supporting a
7971 slightly more general idea of ``protecting'' meta-level rule
7974 * Pure: Logic.(un)varify only works in a global context, which is now
7975 enforced instead of silently assumed. INCOMPATIBILITY, may use
7976 Logic.legacy_(un)varify as temporary workaround.
7978 * Pure: structure Name provides scalable operations for generating
7979 internal variable names, notably Name.variants etc. This replaces
7980 some popular functions from term.ML:
7982 Term.variant -> Name.variant
7983 Term.variantlist -> Name.variant_list
7984 Term.invent_names -> Name.invent_list
7986 Note that low-level renaming rarely occurs in new code -- operations
7987 from structure Variable are used instead (see below).
7989 * Pure: structure Variable provides fundamental operations for proper
7990 treatment of fixed/schematic variables in a context. For example,
7991 Variable.import introduces fixes for schematics of given facts and
7992 Variable.export reverses the effect (up to renaming) -- this replaces
7993 various freeze_thaw operations.
7995 * Pure: structure Goal provides simple interfaces for
7996 init/conclude/finish and tactical prove operations (replacing former
7997 Tactic.prove). Goal.prove is the canonical way to prove results
7998 within a given context; Goal.prove_global is a degraded version for
7999 theory level goals, including a global Drule.standard. Note that
8000 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8001 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8002 in a locale context).
8004 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8005 and type checking (Syntax.check_term etc.), with common combinations
8006 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8007 which are considered legacy and await removal.
8009 * Pure/Syntax: generic interfaces for type unchecking
8010 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8011 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8012 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8013 available for convenience, but refer to the very same operations using
8014 a mere theory instead of a full context.
8016 * Isar: simplified treatment of user-level errors, using exception
8017 ERROR of string uniformly. Function error now merely raises ERROR,
8018 without any side effect on output channels. The Isar toplevel takes
8019 care of proper display of ERROR exceptions. ML code may use plain
8020 handle/can/try; cat_error may be used to concatenate errors like this:
8022 ... handle ERROR msg => cat_error msg "..."
8024 Toplevel ML code (run directly or through the Isar toplevel) may be
8025 embedded into the Isar toplevel with exception display/debug like
8028 Isar.toplevel (fn () => ...)
8030 INCOMPATIBILITY, removed special transform_error facilities, removed
8031 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8032 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8033 -- use plain ERROR instead.
8035 * Isar: theory setup now has type (theory -> theory), instead of a
8036 list. INCOMPATIBILITY, may use #> to compose setup functions.
8038 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8039 ProofContext.debug/verbose flags.
8041 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8042 theory before entering a proof state. Transactions now always see a
8043 quasi-functional intermediate checkpoint, both in interactive and
8046 * Isar: simplified interfaces for outer syntax. Renamed
8047 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8048 OuterSyntax.add_parsers -- this functionality is now included in
8049 OuterSyntax.command etc. INCOMPATIBILITY.
8051 * Simplifier: the simpset of a running simplification process now
8052 contains a proof context (cf. Simplifier.the_context), which is the
8053 very context that the initial simpset has been retrieved from (by
8054 simpset_of/local_simpset_of). Consequently, all plug-in components
8055 (solver, looper etc.) may depend on arbitrary proof data.
8057 * Simplifier.inherit_context inherits the proof context (plus the
8058 local bounds) of the current simplification process; any simproc
8059 etc. that calls the Simplifier recursively should do this! Removed
8060 former Simplifier.inherit_bounds, which is already included here --
8061 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8062 specify an explicit context using Simplifier.context/theory_context.
8064 * Simplifier/Classical Reasoner: more abstract interfaces
8065 change_simpset/claset for modifying the simpset/claset reference of a
8066 theory; raw versions simpset/claset_ref etc. have been discontinued --
8069 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8075 * settings: the default heap location within ISABELLE_HOME_USER now
8076 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8077 Isabelle installations.
8079 * isabelle-process: option -S (secure mode) disables some critical
8080 operations, notably runtime compilation and evaluation of ML source
8083 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8085 * Support for parallel execution, using native multicore support of
8086 Poly/ML 5.1. The theory loader exploits parallelism when processing
8087 independent theories, according to the given theory header
8088 specifications. The maximum number of worker threads is specified via
8089 usedir option -M or the "max-threads" setting in Proof General. A
8090 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8091 to 6 on a 8-core machine. User-code needs to observe certain
8092 guidelines for thread-safe programming, see appendix A in the Isar
8093 Implementation manual.
8097 New in Isabelle2005 (October 2005)
8098 ----------------------------------
8102 * Theory headers: the new header syntax for Isar theories is
8105 imports <theory1> ... <theoryN>
8106 uses <file1> ... <fileM>
8109 where the 'uses' part is optional. The previous syntax
8111 theory <name> = <theory1> + ... + <theoryN>:
8113 will disappear in the next release. Use isatool fixheaders to convert
8114 existing theory files. Note that there is no change in ancient
8115 non-Isar theories now, but these will disappear soon.
8117 * Theory loader: parent theories can now also be referred to via
8118 relative and absolute paths.
8120 * Command 'find_theorems' searches for a list of criteria instead of a
8121 list of constants. Known criteria are: intro, elim, dest, name:string,
8122 simp:term, and any term. Criteria can be preceded by '-' to select
8123 theorems that do not match. Intro, elim, dest select theorems that
8124 match the current goal, name:s selects theorems whose fully qualified
8125 name contain s, and simp:term selects all simplification rules whose
8126 lhs match term. Any other term is interpreted as pattern and selects
8127 all theorems matching the pattern. Available in ProofGeneral under
8128 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8130 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8132 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8133 matching the current goal as introduction rule and not having "HOL."
8134 in their name (i.e. not being defined in theory HOL).
8136 * Command 'thms_containing' has been discontinued in favour of
8137 'find_theorems'; INCOMPATIBILITY.
8139 * Communication with Proof General is now 8bit clean, which means that
8140 Unicode text in UTF-8 encoding may be used within theory texts (both
8141 formal and informal parts). Cf. option -U of the Isabelle Proof
8142 General interface. Here are some simple examples (cf. src/HOL/ex):
8144 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8145 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8147 * Improved efficiency of the Simplifier and, to a lesser degree, the
8148 Classical Reasoner. Typical big applications run around 2 times
8152 *** Document preparation ***
8154 * Commands 'display_drafts' and 'print_drafts' perform simple output
8155 of raw sources. Only those symbols that do not require additional
8156 LaTeX packages (depending on comments in isabellesym.sty) are
8157 displayed properly, everything else is left verbatim. isatool display
8158 and isatool print are used as front ends (these are subject to the
8159 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8161 * Command tags control specific markup of certain regions of text,
8162 notably folding and hiding. Predefined tags include "theory" (for
8163 theory begin and end), "proof" for proof commands, and "ML" for
8164 commands involving ML code; the additional tags "visible" and
8165 "invisible" are unused by default. Users may give explicit tag
8166 specifications in the text, e.g. ''by %invisible (auto)''. The
8167 interpretation of tags is determined by the LaTeX job during document
8168 preparation: see option -V of isatool usedir, or options -n and -t of
8169 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8172 Several document versions may be produced at the same time via isatool
8173 usedir (the generated index.html will link all of them). Typical
8174 specifications include ''-V document=theory,proof,ML'' to present
8175 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8176 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8177 these parts without any formal replacement text. The Isabelle site
8178 default settings produce ''document'' and ''outline'' versions as
8181 * Several new antiquotations:
8183 @{term_type term} prints a term with its type annotated;
8185 @{typeof term} prints the type of a term;
8187 @{const const} is the same as @{term const}, but checks that the
8188 argument is a known logical constant;
8190 @{term_style style term} and @{thm_style style thm} print a term or
8191 theorem applying a "style" to it
8195 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8196 definitions, equations, inequations etc., 'concl' printing only the
8197 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8198 to print the specified premise. TermStyle.add_style provides an ML
8199 interface for introducing further styles. See also the "LaTeX Sugar"
8200 document practical applications. The ML antiquotation prints
8201 type-checked ML expressions verbatim.
8203 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8204 and 'text' support optional locale specification '(in loc)', which
8205 specifies the default context for interpreting antiquotations. For
8206 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8208 * Option 'locale=NAME' of antiquotations specifies an alternative
8209 context interpreting the subsequent argument. For example: @{thm
8210 [locale=lattice] inf_assoc}.
8212 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8215 * Proper output of antiquotations for theory commands involving a
8216 proof context (such as 'locale' or 'theorem (in loc) ...').
8218 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8219 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8221 * isatool usedir: new option -C (default true) controls whether option
8222 -D should include a copy of the original document directory; -C false
8223 prevents unwanted effects such as copying of administrative CVS data.
8228 * Considerably improved version of 'constdefs' command. Now performs
8229 automatic type-inference of declared constants; additional support for
8230 local structure declarations (cf. locales and HOL records), see also
8231 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8232 sequential dependencies of definitions within a single 'constdefs'
8233 section; moreover, the declared name needs to be an identifier. If
8234 all fails, consider to fall back on 'consts' and 'defs' separately.
8236 * Improved indexed syntax and implicit structures. First of all,
8237 indexed syntax provides a notational device for subscripted
8238 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8239 expressions. Secondly, in a local context with structure
8240 declarations, number indexes \<^sub>n or the empty index (default
8241 number 1) refer to a certain fixed variable implicitly; option
8242 show_structs controls printing of implicit structures. Typical
8243 applications of these concepts involve record types and locales.
8245 * New command 'no_syntax' removes grammar declarations (and
8246 translations) resulting from the given syntax specification, which is
8247 interpreted in the same manner as for the 'syntax' command.
8249 * 'Advanced' translation functions (parse_translation etc.) may depend
8250 on the signature of the theory context being presently used for
8251 parsing/printing, see also isar-ref manual.
8253 * Improved 'oracle' command provides a type-safe interface to turn an
8254 ML expression of type theory -> T -> term into a primitive rule of
8255 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8256 is already included here); see also FOL/ex/IffExample.thy;
8259 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8260 before); "cI" is no longer bound, use "c.intro" instead.
8261 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8262 axclasses vs. locales.
8264 * Improved internal renaming of symbolic identifiers -- attach primes
8265 instead of base 26 numbers.
8267 * New flag show_question_marks controls printing of leading question
8268 marks in schematic variable names.
8270 * In schematic variable names, *any* symbol following \<^isub> or
8271 \<^isup> is now treated as part of the base name. For example, the
8272 following works without printing of awkward ".0" indexes:
8274 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8277 * Inner syntax includes (*(*nested*) comments*).
8279 * Pretty printer now supports unbreakable blocks, specified in mixfix
8280 annotations as "(00...)".
8282 * Clear separation of logical types and nonterminals, where the latter
8283 may only occur in 'syntax' specifications or type abbreviations.
8284 Before that distinction was only partially implemented via type class
8285 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8286 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8287 exotic syntax specifications may require further adaption
8288 (e.g. Cube/Cube.thy).
8290 * Removed obsolete type class "logic", use the top sort {} instead.
8291 Note that non-logical types should be declared as 'nonterminals'
8292 rather than 'types'. INCOMPATIBILITY for new object-logic
8295 * Attributes 'induct' and 'cases': type or set names may now be
8296 locally fixed variables as well.
8298 * Simplifier: can now control the depth to which conditional rewriting
8299 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8302 * Simplifier: simplification procedures may now take the current
8303 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8304 interface), which is very useful for calling the Simplifier
8305 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8306 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8307 low-level mk_simproc no longer applies Logic.varify internally, to
8308 allow for use in a context of fixed variables.
8310 * thin_tac now works even if the assumption being deleted contains !!
8311 or ==>. More generally, erule now works even if the major premise of
8312 the elimination rule contains !! or ==>.
8314 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8316 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8317 from Pure, which contains all common declarations already. Both
8318 theories are defined via plain Isabelle/Isar .thy files.
8319 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8320 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8321 use isatool fixcpure to adapt your theory and ML sources.
8323 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8324 selections of theorems in named facts via index ranges.
8326 * 'print_theorems': in theory mode, really print the difference
8327 wrt. the last state (works for interactive theory development only),
8328 in proof mode print all local facts (cf. 'print_facts');
8330 * 'hide': option '(open)' hides only base names.
8332 * More efficient treatment of intermediate checkpoints in interactive
8335 * Code generator is now invoked via code_module (incremental code
8336 generation) and code_library (modular code generation, ML structures
8337 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8338 must be quoted when used as identifiers.
8340 * New 'value' command for reading, evaluating and printing terms using
8341 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8342 quoted when used as identifier.
8347 * New commands for the interpretation of locale expressions in
8348 theories (1), locales (2) and proof contexts (3). These generate
8349 proof obligations from the expression specification. After the
8350 obligations have been discharged, theorems of the expression are added
8351 to the theory, target locale or proof context. The synopsis of the
8352 commands is a follows:
8354 (1) interpretation expr inst
8355 (2) interpretation target < expr
8356 (3) interpret expr inst
8358 Interpretation in theories and proof contexts require a parameter
8359 instantiation of terms from the current context. This is applied to
8360 specifications and theorems of the interpreted expression.
8361 Interpretation in locales only permits parameter renaming through the
8362 locale expression. Interpretation is smart in that interpretations
8363 that are active already do not occur in proof obligations, neither are
8364 instantiated theorems stored in duplicate. Use 'print_interps' to
8365 inspect active interpretations of a particular locale. For details,
8366 see the Isar Reference manual. Examples can be found in
8367 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8369 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8370 'interpret' instead.
8372 * New context element 'constrains' for adding type constraints to
8375 * Context expressions: renaming of parameters with syntax
8378 * Locale declaration: 'includes' disallowed.
8380 * Proper static binding of attribute syntax -- i.e. types / terms /
8381 facts mentioned as arguments are always those of the locale definition
8382 context, independently of the context of later invocations. Moreover,
8383 locale operations (renaming and type / term instantiation) are applied
8384 to attribute arguments as expected.
8386 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8387 actual attributes; rare situations may require Attrib.attribute to
8388 embed those attributes into Attrib.src that lack concrete syntax.
8389 Attribute implementations need to cooperate properly with the static
8390 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8391 Attrib.XXX_thm etc. already do the right thing without further
8392 intervention. Only unusual applications -- such as "where" or "of"
8393 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8394 on the context and the facts involved -- may have to assign parsed
8395 values to argument tokens explicitly.
8397 * Changed parameter management in theorem generation for long goal
8398 statements with 'includes'. INCOMPATIBILITY: produces a different
8399 theorem statement in rare situations.
8401 * Locale inspection command 'print_locale' omits notes elements. Use
8402 'print_locale!' to have them included in the output.
8407 * Provers/hypsubst.ML: improved version of the subst method, for
8408 single-step rewriting: it now works in bound variable contexts. New is
8409 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8410 rewrite a different subterm than the original subst method, which is
8411 still available as 'simplesubst'.
8413 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8416 * Provers/trancl.ML: new transitivity reasoner for transitive and
8417 reflexive-transitive closure of relations.
8419 * Provers/blast.ML: new reference depth_limit to make blast's depth
8420 limit (previously hard-coded with a value of 20) user-definable.
8422 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8423 is peformed already. Object-logics merely need to finish their
8424 initial simpset configuration as before. INCOMPATIBILITY.
8429 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8432 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8434 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8435 and x-symbol; use option '-m epsilon' to get it actually printed.
8436 Moreover, the mathematically important symbolic identifier \<epsilon>
8437 becomes available as variable, constant etc. INCOMPATIBILITY,
8439 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8440 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8441 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8442 support corresponding Isar calculations.
8444 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8447 * theory SetInterval: changed the syntax for open intervals:
8456 The old syntax is still supported but will disappear in the next
8457 release. For conversion use the following Emacs search and replace
8458 patterns (these are not perfect but work quite well):
8460 {)\([^\.]*\)\.\. -> {\1<\.\.}
8461 \.\.\([^(}]*\)(} -> \.\.<\1}
8463 * Theory Commutative_Ring (in Library): method comm_ring for proving
8464 equalities in commutative rings; method 'algebra' provides a generic
8467 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8468 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8469 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8472 Some new syntax forms are available:
8474 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8475 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8476 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8477 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8479 The latter form "\<Sum>x < k. e" used to be based on a separate
8480 function "Summation", which has been discontinued.
8482 * theory Finite_Set: in structured induction proofs, the insert case
8483 is now 'case (insert x F)' instead of the old counterintuitive 'case
8486 * The 'refute' command has been extended to support a much larger
8487 fragment of HOL, including axiomatic type classes, constdefs and
8488 typedefs, inductive datatypes and recursion.
8490 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8491 Requires zChaff with proof generation to be installed. See
8492 HOL/ex/SAT_Examples.thy for examples.
8494 * Datatype induction via method 'induct' now preserves the name of the
8495 induction variable. For example, when proving P(xs::'a list) by
8496 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8497 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8498 in unstructured proof scripts.
8500 * Reworked implementation of records. Improved scalability for
8501 records with many fields, avoiding performance problems for type
8502 inference. Records are no longer composed of nested field types, but
8503 of nested extension types. Therefore the record type only grows linear
8504 in the number of extensions and not in the number of fields. The
8505 top-level (users) view on records is preserved. Potential
8506 INCOMPATIBILITY only in strange cases, where the theory depends on the
8507 old record representation. The type generated for a record is called
8508 <record_name>_ext_type.
8510 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8511 proofs triggered by a record definition or a simproc (if
8512 quick_and_dirty is enabled). Definitions of large records can take
8515 New simproc record_upd_simproc for simplification of multiple record
8516 updates enabled by default. Moreover, trivial updates are also
8517 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8518 occasionally, since simplification is more powerful by default.
8520 * typedef: proper support for polymorphic sets, which contain extra
8521 type-variables in the term.
8523 * Simplifier: automatically reasons about transitivity chains
8524 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8525 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8526 old proofs break occasionally as simplification may now solve more
8527 goals than previously.
8529 * Simplifier: converts x <= y into x = y if assumption y <= x is
8530 present. Works for all partial orders (class "order"), in particular
8531 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8534 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8535 bound variable or a constant then the let is unfolded. Otherwise
8536 first a is simplified to b, and then f b is simplified to g. If
8537 possible we abstract b from g arriving at "let x = b in h x",
8538 otherwise we unfold the let and arrive at g. The simproc can be
8539 enabled/disabled by the reference use_let_simproc. Potential
8540 INCOMPATIBILITY since simplification is more powerful by default.
8542 * Classical reasoning: the meson method now accepts theorems as arguments.
8544 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8545 jobs to provide advice on the provability of subgoals.
8547 * Theory OrderedGroup and Ring_and_Field: various additions and
8548 improvements to faciliate calculations involving equalities and
8551 The following theorems have been eliminated or modified
8554 abs_eq now named abs_of_nonneg
8555 abs_of_ge_0 now named abs_of_nonneg
8556 abs_minus_eq now named abs_of_nonpos
8557 imp_abs_id now named abs_of_nonneg
8558 imp_abs_neg_id now named abs_of_nonpos
8559 mult_pos now named mult_pos_pos
8560 mult_pos_le now named mult_nonneg_nonneg
8561 mult_pos_neg_le now named mult_nonneg_nonpos
8562 mult_pos_neg2_le now named mult_nonneg_nonpos2
8563 mult_neg now named mult_neg_neg
8564 mult_neg_le now named mult_nonpos_nonpos
8566 * The following lemmas in Ring_and_Field have been added to the simplifier:
8569 not_square_less_zero
8571 The following lemmas have been deleted from Real/RealPow:
8581 * Theory Parity: added rules for simplifying exponents.
8585 The following theorems have been eliminated or modified
8588 list_all_Nil now named list_all.simps(1)
8589 list_all_Cons now named list_all.simps(2)
8590 list_all_conv now named list_all_iff
8591 set_mem_eq now named mem_iff
8593 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8594 asymptotic "big O" calculations. See the notes in BigO.thy.
8599 * Theory RealDef: better support for embedding natural numbers and
8600 integers in the reals.
8602 The following theorems have been eliminated or modified
8605 exp_ge_add_one_self now requires no hypotheses
8606 real_of_int_add reversed direction of equality (use [symmetric])
8607 real_of_int_minus reversed direction of equality (use [symmetric])
8608 real_of_int_diff reversed direction of equality (use [symmetric])
8609 real_of_int_mult reversed direction of equality (use [symmetric])
8611 * Theory RComplete: expanded support for floor and ceiling functions.
8613 * Theory Ln is new, with properties of the natural logarithm
8615 * Hyperreal: There is a new type constructor "star" for making
8616 nonstandard types. The old type names are now type synonyms:
8620 hcomplex = complex star
8622 * Hyperreal: Many groups of similarly-defined constants have been
8623 replaced by polymorphic versions (INCOMPATIBILITY):
8625 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8627 starset <-- starsetNat, starsetC
8628 *s* <-- *sNat*, *sc*
8629 starset_n <-- starsetNat_n, starsetC_n
8630 *sn* <-- *sNatn*, *scn*
8631 InternalSets <-- InternalNatSets, InternalCSets
8633 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8634 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8635 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8636 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8637 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8639 * Hyperreal: Many type-specific theorems have been removed in favor of
8640 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8642 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8643 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8644 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8645 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8646 right_minus <-- hypreal_add_minus
8647 left_minus <-- {hypreal,hcomplex}_add_minus_left
8648 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8649 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8650 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8651 mult_1_right <-- hcomplex_mult_one_right
8652 mult_zero_left <-- hcomplex_mult_zero_left
8653 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8654 right_distrib <-- hypnat_add_mult_distrib2
8655 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8656 right_inverse <-- hypreal_mult_inverse
8657 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8658 order_refl <-- {hypreal,hypnat}_le_refl
8659 order_trans <-- {hypreal,hypnat}_le_trans
8660 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8661 order_less_le <-- {hypreal,hypnat}_less_le
8662 linorder_linear <-- {hypreal,hypnat}_le_linear
8663 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8664 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8665 add_nonneg_nonneg <-- hypreal_le_add_order
8667 * Hyperreal: Separate theorems having to do with type-specific
8668 versions of constants have been merged into theorems that apply to the
8669 new polymorphic constants (INCOMPATIBILITY):
8671 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8672 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8673 STAR_Un <-- {STAR,NatStar,STARC}_Un
8674 STAR_Int <-- {STAR,NatStar,STARC}_Int
8675 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8676 STAR_subset <-- {STAR,NatStar,STARC}_subset
8677 STAR_mem <-- {STAR,NatStar,STARC}_mem
8678 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8679 STAR_diff <-- {STAR,STARC}_diff
8680 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8681 STARC_hcomplex_of_complex}_image_subset
8682 starset_n_Un <-- starset{Nat,C}_n_Un
8683 starset_n_Int <-- starset{Nat,C}_n_Int
8684 starset_n_Compl <-- starset{Nat,C}_n_Compl
8685 starset_n_diff <-- starset{Nat,C}_n_diff
8686 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8687 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8688 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8689 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8690 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8691 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8692 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8693 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8694 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8695 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8696 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8697 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8698 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8699 starfun_diff <-- starfun{C,RC,CR}_diff
8700 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8701 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8702 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8703 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8704 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8705 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8706 starfun_Id <-- starfunC_Id
8707 starfun_approx <-- starfun{Nat,CR}_approx
8708 starfun_capprox <-- starfun{C,RC}_capprox
8709 starfun_abs <-- starfunNat_rabs
8710 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8711 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8712 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8713 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8714 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8715 starfun_add_approx <-- starfunCR_add_approx
8716 starfun_inverse_inverse <-- starfunC_inverse_inverse
8717 starfun_divide <-- starfun{C,CR,RC}_divide
8718 starfun_n <-- starfun{Nat,C}_n
8719 starfun_n_mult <-- starfun{Nat,C}_n_mult
8720 starfun_n_add <-- starfun{Nat,C}_n_add
8721 starfun_n_add_minus <-- starfunNat_n_add_minus
8722 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8723 starfun_n_minus <-- starfun{Nat,C}_n_minus
8724 starfun_n_eq <-- starfun{Nat,C}_n_eq
8726 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8727 star_n_minus <-- {hypreal,hcomplex}_minus
8728 star_n_diff <-- {hypreal,hcomplex}_diff
8729 star_n_mult <-- {hypreal,hcomplex}_mult
8730 star_n_inverse <-- {hypreal,hcomplex}_inverse
8731 star_n_le <-- {hypreal,hypnat}_le
8732 star_n_less <-- {hypreal,hypnat}_less
8733 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8734 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8735 star_n_abs <-- hypreal_hrabs
8736 star_n_divide <-- hcomplex_divide
8738 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8739 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8740 star_of_diff <-- hypreal_of_real_diff
8741 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8742 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8743 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8744 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8745 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8746 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8747 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8748 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8749 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8750 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8751 star_of_number_of <-- {hypreal,hcomplex}_number_of
8752 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8753 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8754 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8755 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8756 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8757 star_of_power <-- hypreal_of_real_power
8758 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8760 * Hyperreal: new method "transfer" that implements the transfer
8761 principle of nonstandard analysis. With a subgoal that mentions
8762 nonstandard types like "'a star", the command "apply transfer"
8763 replaces it with an equivalent one that mentions only standard types.
8764 To be successful, all free variables must have standard types; non-
8765 standard variables must have explicit universal quantifiers.
8767 * Hyperreal: A theory of Taylor series.
8772 * Discontinued special version of 'constdefs' (which used to support
8773 continuous functions) in favor of the general Pure one with full
8776 * New simplification procedure for solving continuity conditions; it
8777 is much faster on terms with many nested lambda abstractions (cubic
8778 instead of exponential time).
8780 * New syntax for domain package: selector names are now optional.
8781 Parentheses should be omitted unless argument is lazy, for example:
8783 domain 'a stream = cons "'a" (lazy "'a stream")
8785 * New command 'fixrec' for defining recursive functions with pattern
8786 matching; defining multiple functions with mutual recursion is also
8787 supported. Patterns may include the constants cpair, spair, up, sinl,
8788 sinr, or any data constructor defined by the domain package. The given
8789 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8790 syntax and examples.
8792 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8793 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8794 but the proof obligation additionally includes an admissibility
8795 requirement. The packages generate instances of class cpo or pcpo,
8796 with continuity and strictness theorems for Rep and Abs.
8798 * HOLCF: Many theorems have been renamed according to a more standard naming
8799 scheme (INCOMPATIBILITY):
8801 foo_inject: "foo$x = foo$y ==> x = y"
8802 foo_eq: "(foo$x = foo$y) = (x = y)"
8803 foo_less: "(foo$x << foo$y) = (x << y)"
8804 foo_strict: "foo$UU = UU"
8805 foo_defined: "... ==> foo$x ~= UU"
8806 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8811 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8812 including the First Isomorphism Theorem (on quotienting by the kernel
8815 * ZF/Simplifier: install second copy of type solver that actually
8816 makes use of TC rules declared to Isar proof contexts (or locales);
8817 the old version is still required for ML proof scripts.
8822 * Converted to Isar theory format; use locales instead of axiomatic
8828 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8831 * Pure/library.ML no longer defines its own option datatype, but uses
8832 that of the SML basis, which has constructors NONE and SOME instead of
8833 None and Some, as well as exception Option.Option instead of OPTION.
8834 The functions the, if_none, is_some, is_none have been adapted
8835 accordingly, while Option.map replaces apsome.
8837 * Pure/library.ML: the exception LIST has been given up in favour of
8838 the standard exceptions Empty and Subscript, as well as
8839 Library.UnequalLengths. Function like Library.hd and Library.tl are
8840 superceded by the standard hd and tl functions etc.
8842 A number of basic list functions are no longer exported to the ML
8843 toplevel, as they are variants of predefined functions. The following
8844 suggests how one can translate existing code:
8846 rev_append xs ys = List.revAppend (xs, ys)
8847 nth_elem (i, xs) = List.nth (xs, i)
8848 last_elem xs = List.last xs
8849 flat xss = List.concat xss
8850 seq fs = List.app fs
8851 partition P xs = List.partition P xs
8852 mapfilter f xs = List.mapPartial f xs
8854 * Pure/library.ML: several combinators for linear functional
8855 transformations, notably reverse application and composition:
8858 (x, y) |-> f f #-> g
8860 * Pure/library.ML: introduced/changed precedence of infix operators:
8862 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8864 infix 3 o oo ooo oooo;
8865 infix 4 ~~ upto downto;
8867 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8870 * Pure/library.ML: natural list combinators fold, fold_rev, and
8871 fold_map support linear functional transformations and nesting. For
8874 fold f [x1, ..., xN] y =
8875 y |> f x1 |> ... |> f xN
8877 (fold o fold) f [xs1, ..., xsN] y =
8878 y |> fold f xs1 |> ... |> fold f xsN
8880 fold f [x1, ..., xN] =
8883 (fold o fold) f [xs1, ..., xsN] =
8884 fold f xs1 #> ... #> fold f xsN
8886 * Pure/library.ML: the following selectors on type 'a option are
8889 the: 'a option -> 'a (*partial*)
8890 these: 'a option -> 'a where 'a = 'b list
8891 the_default: 'a -> 'a option -> 'a
8892 the_list: 'a option -> 'a list
8894 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8895 basic operations for association lists, following natural argument
8896 order; moreover the explicit equality predicate passed here avoids
8897 potentially expensive polymorphic runtime equality checks.
8898 The old functions may be expressed as follows:
8900 assoc = uncurry (AList.lookup (op =))
8901 assocs = these oo AList.lookup (op =)
8902 overwrite = uncurry (AList.update (op =)) o swap
8904 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8906 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8907 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8909 replacing make_keylist and keyfilter (occassionally used)
8912 make_keylist = AList.make
8913 keyfilter = AList.find (op =)
8915 * eq_fst and eq_snd now take explicit equality parameter, thus
8916 avoiding eqtypes. Naive rewrites:
8918 eq_fst = eq_fst (op =)
8919 eq_snd = eq_snd (op =)
8921 * Removed deprecated apl and apr (rarely used).
8924 apl (n, op) =>>= curry op n
8925 apr (op, m) =>>= fn n => op (n, m)
8927 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8928 provides a reasonably efficient light-weight implementation of sets as
8931 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8932 few new operations; existing lookup and update are now curried to
8933 follow natural argument order (for use with fold etc.);
8934 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8936 * Pure/General: output via the Isabelle channels of
8937 writeln/warning/error etc. is now passed through Output.output, with a
8938 hook for arbitrary transformations depending on the print_mode
8939 (cf. Output.add_mode -- the first active mode that provides a output
8940 function wins). Already formatted output may be embedded into further
8941 text via Output.raw; the result of Pretty.string_of/str_of and derived
8942 functions (string_of_term/cterm/thm etc.) is already marked raw to
8943 accommodate easy composition of diagnostic messages etc. Programmers
8944 rarely need to care about Output.output or Output.raw at all, with
8945 some notable exceptions: Output.output is required when bypassing the
8946 standard channels (writeln etc.), or in token translations to produce
8947 properly formatted results; Output.raw is required when capturing
8948 already output material that will eventually be presented to the user
8949 a second time. For the default print mode, both Output.output and
8950 Output.raw have no effect.
8952 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8953 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8954 cumulative results are displayed at the end of a batch session.
8956 * Pure/General: File.sysify_path and File.quote_sysify path have been
8957 replaced by File.platform_path and File.shell_path (with appropriate
8958 hooks). This provides a clean interface for unusual systems where the
8959 internal and external process view of file names are different.
8961 * Pure: more efficient orders for basic syntactic entities: added
8962 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8963 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8964 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8965 orders now -- potential INCOMPATIBILITY for code that depends on a
8966 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8967 Library.sort_strings on result).
8969 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8970 fold_types traverse types/terms from left to right, observing natural
8971 argument order. Supercedes previous foldl_XXX versions, add_frees,
8972 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8974 * Pure: name spaces have been refined, with significant changes of the
8975 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8976 to extern(_table). The plain name entry path is superceded by a
8977 general 'naming' context, which also includes the 'policy' to produce
8978 a fully qualified name and external accesses of a fully qualified
8979 name; NameSpace.extend is superceded by context dependent
8980 Sign.declare_name. Several theory and proof context operations modify
8981 the naming context. Especially note Theory.restore_naming and
8982 ProofContext.restore_naming to get back to a sane state; note that
8983 Theory.add_path is no longer sufficient to recover from
8984 Theory.absolute_path in particular.
8986 * Pure: new flags short_names (default false) and unique_names
8987 (default true) for controlling output of qualified names. If
8988 short_names is set, names are printed unqualified. If unique_names is
8989 reset, the name prefix is reduced to the minimum required to achieve
8990 the original result when interning again, even if there is an overlap
8991 with earlier declarations.
8993 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8994 now 'extend', and 'merge' gets an additional Pretty.pp argument
8995 (useful for printing error messages). INCOMPATIBILITY.
8997 * Pure: major reorganization of the theory context. Type Sign.sg and
8998 Theory.theory are now identified, referring to the universal
8999 Context.theory (see Pure/context.ML). Actual signature and theory
9000 content is managed as theory data. The old code and interfaces were
9001 spread over many files and structures; the new arrangement introduces
9002 considerable INCOMPATIBILITY to gain more clarity:
9004 Context -- theory management operations (name, identity, inclusion,
9005 parents, ancestors, merge, etc.), plus generic theory data;
9007 Sign -- logical signature and syntax operations (declaring consts,
9008 types, etc.), plus certify/read for common entities;
9010 Theory -- logical theory operations (stating axioms, definitions,
9011 oracles), plus a copy of logical signature operations (consts,
9012 types, etc.); also a few basic management operations (Theory.copy,
9015 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9016 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9017 for convenience -- they merely return the theory.
9019 * Pure: type Type.tsig is superceded by theory in most interfaces.
9021 * Pure: the Isar proof context type is already defined early in Pure
9022 as Context.proof (note that ProofContext.context and Proof.context are
9023 aliases, where the latter is the preferred name). This enables other
9024 Isabelle components to refer to that type even before Isar is present.
9026 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9027 typeK, constK, axiomK, oracleK), but provide explicit operations for
9028 any of these kinds. For example, Sign.intern typeK is now
9029 Sign.intern_type, Theory.hide_space Sign.typeK is now
9030 Theory.hide_types. Also note that former
9031 Theory.hide_classes/types/consts are now
9032 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9033 internalize their arguments! INCOMPATIBILITY.
9035 * Pure: get_thm interface (of PureThy and ProofContext) expects
9036 datatype thmref (with constructors Name and NameSelection) instead of
9037 plain string -- INCOMPATIBILITY;
9039 * Pure: cases produced by proof methods specify options, where NONE
9040 means to remove case bindings -- INCOMPATIBILITY in
9043 * Pure: the following operations retrieve axioms or theorems from a
9044 theory node or theory hierarchy, respectively:
9046 Theory.axioms_of: theory -> (string * term) list
9047 Theory.all_axioms_of: theory -> (string * term) list
9048 PureThy.thms_of: theory -> (string * thm) list
9049 PureThy.all_thms_of: theory -> (string * thm) list
9051 * Pure: print_tac now outputs the goal through the trace channel.
9053 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9054 Reference Toplevel.debug (default false) controls detailed printing
9055 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9056 controls execution profiling -- set to 1 for time and 2 for space
9057 (both increase the runtime).
9059 * Isar session: The initial use of ROOT.ML is now always timed,
9060 i.e. the log will show the actual process times, in contrast to the
9061 elapsed wall-clock time that the outer shell wrapper produces.
9063 * Simplifier: improved handling of bound variables (nameless
9064 representation, avoid allocating new strings). Simprocs that invoke
9065 the Simplifier recursively should use Simplifier.inherit_bounds to
9066 avoid local name clashes. Failure to do so produces warnings
9067 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9068 for further details.
9070 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9071 bindings for all theorems stored within a given theory; this may help
9072 in porting non-Isar theories to Isar ones, while keeping ML proof
9073 scripts for the time being.
9075 * ML operator HTML.with_charset specifies the charset begin used for
9076 generated HTML files. For example:
9078 HTML.with_charset "utf-8" use_thy "Hebrew";
9079 HTML.with_charset "utf-8" use_thy "Chinese";
9084 * Allow symlinks to all proper Isabelle executables (Isabelle,
9085 isabelle, isatool etc.).
9087 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9088 isatool doc, isatool mkdir, display_drafts etc.).
9090 * isatool usedir: option -f allows specification of the ML file to be
9091 used by Isabelle; default is ROOT.ML.
9093 * New isatool version outputs the version identifier of the Isabelle
9094 distribution being used.
9096 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9097 (containing Boolean satisfiability problems) into Isabelle/HOL
9102 New in Isabelle2004 (April 2004)
9103 --------------------------------
9107 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9108 Replaces linorder.ML.
9110 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9111 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9112 (\<a>...\<z>), are now considered normal letters, and can therefore
9113 be used anywhere where an ASCII letter (a...zA...Z) has until
9114 now. COMPATIBILITY: This obviously changes the parsing of some
9115 terms, especially where a symbol has been used as a binder, say
9116 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9117 as an identifier. Fix it by inserting a space around former
9118 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9119 existing theory and ML files.
9121 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9123 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9124 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9125 a normal (but invisible) letter. For multiple letter subscripts repeat
9126 \<^isub> like this: x\<^isub>1\<^isub>2.
9128 * Pure: There are now sub-/superscripts that can span more than one
9129 character. Text between \<^bsub> and \<^esub> is set in subscript in
9130 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9131 superscript. The new control characters are not identifier parts.
9133 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9134 content of "..." to the latex file instead of \isacntrl... . The "..."
9135 may consist of any printable characters excluding the end bracket >.
9137 * Pure: Using new Isar command "finalconsts" (or the ML functions
9138 Theory.add_finals or Theory.add_finals_i) it is now possible to
9139 declare constants "final", which prevents their being given a definition
9140 later. It is useful for constants whose behaviour is fixed axiomatically
9141 rather than definitionally, such as the meta-logic connectives.
9143 * Pure: 'instance' now handles general arities with general sorts
9144 (i.e. intersections of classes),
9146 * Presentation: generated HTML now uses a CSS style sheet to make layout
9147 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9148 It can be changed to alter the colors/layout of generated pages.
9153 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9154 cut_tac, subgoal_tac and thin_tac:
9155 - Now understand static (Isar) contexts. As a consequence, users of Isar
9156 locales are no longer forced to write Isar proof scripts.
9157 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9159 - INCOMPATIBILITY: names of variables to be instantiated may no
9160 longer be enclosed in quotes. Instead, precede variable name with `?'.
9161 This is consistent with the instantiation attribute "where".
9163 * Attributes "where" and "of":
9164 - Now take type variables of instantiated theorem into account when reading
9165 the instantiation string. This fixes a bug that caused instantiated
9166 theorems to have too special types in some circumstances.
9167 - "where" permits explicit instantiations of type variables.
9169 * Calculation commands "moreover" and "also" no longer interfere with
9170 current facts ("this"), admitting arbitrary combinations with "then"
9174 - Goal statements involving the context element "includes" no longer
9175 generate theorems with internal delta predicates (those ending on
9176 "_axioms") in the premise.
9177 Resolve particular premise with <locale>.intro to obtain old form.
9178 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9179 specification and "includes" elements in goal statement.
9180 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9181 [intro?] and [elim?] (respectively) by default.
9182 - Experimental command for instantiation of locales in proof contexts:
9183 instantiate <label>[<attrs>]: <loc>
9184 Instantiates locale <loc> and adds all its theorems to the current context
9185 taking into account their attributes. Label and attrs are optional
9186 modifiers, like in theorem declarations. If present, names of
9187 instantiated theorems are qualified with <label>, and the attributes
9188 <attrs> are applied after any attributes these theorems might have already.
9189 If the locale has assumptions, a chained fact of the form
9190 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9191 are derived. The command does not support old-style locales declared
9192 with "locale (open)".
9193 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9195 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9201 * Proof import: new image HOL4 contains the imported library from
9202 the HOL4 system with about 2500 theorems. It is imported by
9203 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9204 can be used like any other Isabelle image. See
9205 HOL/Import/HOL/README for more information.
9208 - Much improved handling of linear and partial orders.
9209 Reasoners for linear and partial orders are set up for type classes
9210 "linorder" and "order" respectively, and are added to the default simpset
9211 as solvers. This means that the simplifier can build transitivity chains
9212 to solve goals from the assumptions.
9213 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9214 of blast or auto after simplification become unnecessary because the goal
9215 is solved by simplification already.
9217 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9218 all proved in axiomatic type classes for semirings, rings and fields.
9221 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9222 now formalized using the Ring_and_Field theory mentioned above.
9223 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9224 than before, because now they are set up once in a generic manner.
9225 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9226 Look for the general versions in Ring_and_Field (and Power if they concern
9229 * Type "rat" of the rational numbers is now available in HOL-Complex.
9232 - Record types are now by default printed with their type abbreviation
9233 instead of the list of all field types. This can be configured via
9234 the reference "print_record_type_abbr".
9235 - Simproc "record_upd_simproc" for simplification of multiple updates added
9236 (not enabled by default).
9237 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9238 EX x. x = sel r to True (not enabled by default).
9239 - Tactic "record_split_simp_tac" to split and simplify records added.
9241 * 'specification' command added, allowing for definition by
9242 specification. There is also an 'ax_specification' command that
9243 introduces the new constants axiomatically.
9245 * arith(_tac) is now able to generate counterexamples for reals as well.
9247 * HOL-Algebra: new locale "ring" for non-commutative rings.
9249 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9250 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9252 * HOL-Matrix: a first theory for matrices in HOL with an application of
9253 matrix theory to linear programming.
9255 * Unions and Intersections:
9256 The latex output syntax of UN and INT has been changed
9257 from "\Union x \in A. B" to "\Union_{x \in A} B"
9258 i.e. the index formulae has become a subscript.
9259 Similarly for "\Union x. B", and for \Inter instead of \Union.
9261 * Unions and Intersections over Intervals:
9262 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9263 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9264 like in normal math, and corresponding versions for < and for intersection.
9266 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9267 lexicographic dictonary ordering has been added as "lexord".
9269 * ML: the legacy theory structures Int and List have been removed. They had
9270 conflicted with ML Basis Library structures having the same names.
9272 * 'refute' command added to search for (finite) countermodels. Only works
9273 for a fragment of HOL. The installation of an external SAT solver is
9274 highly recommended. See "HOL/Refute.thy" for details.
9276 * 'quickcheck' command: Allows to find counterexamples by evaluating
9277 formulae under an assignment of free variables to random values.
9278 In contrast to 'refute', it can deal with inductive datatypes,
9279 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9285 * Streams now come with concatenation and are part of the HOLCF image
9289 New in Isabelle2003 (May 2003)
9290 ------------------------------
9294 * Provers/simplifier:
9296 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9297 Assumptions are now subject to complete mutual simplification,
9298 not just from left to right. The simplifier now preserves
9299 the order of assumptions.
9301 Potential INCOMPATIBILITY:
9303 -- simp sometimes diverges where the old version did
9304 not, e.g. invoking simp on the goal
9306 [| P (f x); y = x; f x = f y |] ==> Q
9308 now gives rise to the infinite reduction sequence
9310 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9312 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9315 -- Tactics combining classical reasoner and simplification (such as auto)
9316 are also affected by this change, because many of them rely on
9317 simp. They may sometimes diverge as well or yield a different numbers
9318 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9319 in case of problems. Sometimes subsequent calls to the classical
9320 reasoner will fail because a preceeding call to the simplifier too
9321 eagerly simplified the goal, e.g. deleted redundant premises.
9323 - The simplifier trace now shows the names of the applied rewrite rules
9325 - You can limit the number of recursive invocations of the simplifier
9326 during conditional rewriting (where the simplifie tries to solve the
9327 conditions before applying the rewrite rule):
9328 ML "simp_depth_limit := n"
9329 where n is an integer. Thus you can force termination where previously
9330 the simplifier would diverge.
9332 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9334 - No longer aborts on failed congruence proof. Instead, the
9335 congruence is ignored.
9337 * Pure: New generic framework for extracting programs from constructive
9338 proofs. See HOL/Extraction.thy for an example instantiation, as well
9339 as HOL/Extraction for some case studies.
9341 * Pure: The main goal of the proof state is no longer shown by default, only
9342 the subgoals. This behaviour is controlled by a new flag.
9343 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9344 (ML: Proof.show_main_goal).
9346 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9347 rules whose conclusion matches subgoal 1:
9348 PG menu: Isabelle/Isar -> Show me -> matching rules
9349 The rules are ordered by how closely they match the subgoal.
9350 In particular, rules that solve a subgoal outright are displayed first
9351 (or rather last, the way they are printed).
9352 (ML: ProofGeneral.print_intros())
9354 * Pure: New flag trace_unify_fail causes unification to print
9355 diagnostic information (PG: in trace buffer) when it fails. This is
9356 useful for figuring out why single step proofs like rule, erule or
9359 * Pure: Locale specifications now produce predicate definitions
9360 according to the body of text (covering assumptions modulo local
9361 definitions); predicate "loc_axioms" covers newly introduced text,
9362 while "loc" is cumulative wrt. all included locale expressions; the
9363 latter view is presented only on export into the global theory
9364 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9365 on the old view without predicates;
9367 * Pure: predefined locales "var" and "struct" are useful for sharing
9368 parameters (as in CASL, for example); just specify something like
9369 ``var x + var y + struct M'' as import;
9371 * Pure: improved thms_containing: proper indexing of facts instead of
9372 raw theorems; check validity of results wrt. current name space;
9373 include local facts of proof configuration (also covers active
9374 locales), cover fixed variables in index; may use "_" in term
9375 specification; an optional limit for the number of printed facts may
9376 be given (the default is 40);
9378 * Pure: disallow duplicate fact bindings within new-style theory files
9381 * Provers: improved induct method: assumptions introduced by case
9382 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9383 the goal statement); "foo" still refers to all facts collectively;
9385 * Provers: the function blast.overloaded has been removed: all constants
9386 are regarded as potentially overloaded, which improves robustness in exchange
9387 for slight decrease in efficiency;
9389 * Provers/linorder: New generic prover for transitivity reasoning over
9390 linear orders. Note: this prover is not efficient!
9392 * Isar: preview of problems to finish 'show' now produce an error
9393 rather than just a warning (in interactive mode);
9400 - Produces a counter example if it cannot prove a goal.
9401 Note that the counter example may be spurious if the goal is not a formula
9402 of quantifier-free linear arithmetic.
9403 In ProofGeneral the counter example appears in the trace buffer.
9405 - Knows about div k and mod k where k is a numeral of type nat or int.
9407 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9408 linear arithmetic fails. This takes account of quantifiers and divisibility.
9409 Presburger arithmetic can also be called explicitly via presburger(_tac).
9411 * simp's arithmetic capabilities have been enhanced a bit: it now
9412 takes ~= in premises into account (by performing a case split);
9414 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9415 are distributed over a sum of terms;
9417 * New tactic "trans_tac" and method "trans" instantiate
9418 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9421 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9422 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9424 * 'typedef' command has new option "open" to suppress the set
9427 * functions Min and Max on finite sets have been introduced (theory
9430 * attribute [symmetric] now works for relations as well; it turns
9431 (x,y) : R^-1 into (y,x) : R, and vice versa;
9433 * induct over a !!-quantified statement (say !!x1..xn):
9434 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9436 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9437 %x. None. Warning: empty_def now refers to the previously hidden definition
9440 * Algebra: formalization of classical algebra. Intended as base for
9441 any algebraic development in Isabelle. Currently covers group theory
9442 (up to Sylow's theorem) and ring theory (Universal Property of
9443 Univariate Polynomials). Contributions welcome;
9445 * GroupTheory: deleted, since its material has been moved to Algebra;
9447 * Complex: new directory of the complex numbers with numeric constants,
9448 nonstandard complex numbers, and some complex analysis, standard and
9449 nonstandard (Jacques Fleuriot);
9451 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9453 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9456 * Real/HahnBanach: updated and adapted to locales;
9458 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9461 * UNITY: added the Meier-Sanders theory of progress sets;
9463 * MicroJava: bytecode verifier and lightweight bytecode verifier
9464 as abstract algorithms, instantiated to the JVM;
9466 * Bali: Java source language formalization. Type system, operational
9467 semantics, axiomatic semantics. Supported language features:
9468 classes, interfaces, objects,virtual methods, static methods,
9469 static/instance fields, arrays, access modifiers, definite
9470 assignment, exceptions.
9475 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9478 * Main ZF: virtually all theories converted to new-style format;
9483 * Pure: Tactic.prove provides sane interface for internal proofs;
9484 omits the infamous "standard" operation, so this is more appropriate
9485 than prove_goalw_cterm in many situations (e.g. in simprocs);
9487 * Pure: improved error reporting of simprocs;
9489 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9493 *** Document preparation ***
9495 * uses \par instead of \\ for line breaks in theory text. This may
9496 shift some page breaks in large documents. To get the old behaviour
9497 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9499 * minimized dependencies of isabelle.sty and isabellesym.sty on
9502 * \<euro> now needs package babel/greek instead of marvosym (which
9505 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9510 New in Isabelle2002 (March 2002)
9511 --------------------------------
9513 *** Document preparation ***
9515 * greatly simplified document preparation setup, including more
9516 graceful interpretation of isatool usedir -i/-d/-D options, and more
9517 instructive isatool mkdir; users should basically be able to get
9518 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9519 users may run a separate document processing stage manually like this:
9520 "isatool usedir -D output HOL Test && isatool document Test/output";
9522 * theory dependency graph may now be incorporated into documents;
9523 isatool usedir -g true will produce session_graph.eps/.pdf for use
9524 with \includegraphics of LaTeX;
9526 * proper spacing of consecutive markup elements, especially text
9527 blocks after section headings;
9529 * support bold style (for single symbols only), input syntax is like
9530 this: "\<^bold>\<alpha>" or "\<^bold>A";
9532 * \<bullet> is now output as bold \cdot by default, which looks much
9533 better in printed text;
9535 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9536 note that these symbols are currently unavailable in Proof General /
9537 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9539 * isatool latex no longer depends on changed TEXINPUTS, instead
9540 isatool document copies the Isabelle style files to the target
9546 * Pure/Provers: improved proof by cases and induction;
9547 - 'case' command admits impromptu naming of parameters (such as
9549 - 'induct' method divinates rule instantiation from the inductive
9550 claim; no longer requires excessive ?P bindings for proper
9551 instantiation of cases;
9552 - 'induct' method properly enumerates all possibilities of set/type
9553 rules; as a consequence facts may be also passed through *type*
9554 rules without further ado;
9555 - 'induct' method now derives symbolic cases from the *rulified*
9556 rule (before it used to rulify cases stemming from the internal
9557 atomized version); this means that the context of a non-atomic
9558 statement becomes is included in the hypothesis, avoiding the
9559 slightly cumbersome show "PROP ?case" form;
9560 - 'induct' may now use elim-style induction rules without chaining
9561 facts, using ``missing'' premises from the goal state; this allows
9562 rules stemming from inductive sets to be applied in unstructured
9563 scripts, while still benefitting from proper handling of non-atomic
9564 statements; NB: major inductive premises need to be put first, all
9565 the rest of the goal is passed through the induction;
9566 - 'induct' proper support for mutual induction involving non-atomic
9567 rule statements (uses the new concept of simultaneous goals, see
9569 - append all possible rule selections, but only use the first
9570 success (no backtracking);
9571 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9572 - undeclared rule case names default to numbers 1, 2, 3, ...;
9573 - added 'print_induct_rules' (covered by help item in recent Proof
9575 - moved induct/cases attributes to Pure, methods to Provers;
9576 - generic method setup instantiated for FOL and HOL;
9578 * Pure: support multiple simultaneous goal statements, for example
9579 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9580 meta-level mechanism, this acts as if several individual goals had
9581 been stated separately; in particular common proof methods need to be
9582 repeated in order to cover all claims; note that a single elimination
9583 step is *not* sufficient to establish the two conjunctions, so this
9586 assume "A & B" then have A and B .. (*".." fails*)
9588 better use "obtain" in situations as above; alternative refer to
9589 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9591 * Pure: proper integration with ``locales''; unlike the original
9592 version by Florian Kammller, Isar locales package high-level proof
9593 contexts rather than raw logical ones (e.g. we admit to include
9594 attributes everywhere); operations on locales include merge and
9595 rename; support for implicit arguments (``structures''); simultaneous
9596 type-inference over imports and text; see also HOL/ex/Locales.thy for
9599 * Pure: the following commands have been ``localized'', supporting a
9600 target locale specification "(in name)": 'lemma', 'theorem',
9601 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9602 stored both within the locale and at the theory level (exported and
9603 qualified by the locale name);
9605 * Pure: theory goals may now be specified in ``long'' form, with
9606 ad-hoc contexts consisting of arbitrary locale elements. for example
9607 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9608 definitions may be given, too); the result is a meta-level rule with
9609 the context elements being discharged in the obvious way;
9611 * Pure: new proof command 'using' allows to augment currently used
9612 facts after a goal statement ('using' is syntactically analogous to
9613 'apply', but acts on the goal's facts only); this allows chained facts
9614 to be separated into parts given before and after a claim, as in
9615 ``from a and b have C using d and e <proof>'';
9617 * Pure: renamed "antecedent" case to "rule_context";
9619 * Pure: new 'judgment' command records explicit information about the
9620 object-logic embedding (used by several tools internally); no longer
9621 use hard-wired "Trueprop";
9623 * Pure: added 'corollary' command;
9625 * Pure: fixed 'token_translation' command;
9627 * Pure: removed obsolete 'exported' attribute;
9629 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9630 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9631 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9633 * Pure: method 'atomize' presents local goal premises as object-level
9634 statements (atomic meta-level propositions); setup controlled via
9635 rewrite rules declarations of 'atomize' attribute; example
9636 application: 'induct' method with proper rule statements in improper
9639 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9640 now consider the syntactic context of assumptions, giving a better
9641 chance to get type-inference of the arguments right (this is
9642 especially important for locales);
9644 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9647 * Pure/obtain: the formal conclusion "thesis", being marked as
9648 ``internal'', may no longer be reference directly in the text;
9649 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9652 * Pure: generic 'sym' attribute which declares a rule both as pure
9653 'elim?' and for the 'symmetric' operation;
9655 * Pure: marginal comments ``--'' may now occur just anywhere in the
9656 text; the fixed correlation with particular command syntax has been
9659 * Pure: new method 'rules' is particularly well-suited for proof
9660 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9661 but often produces more compact proof terms with less detours;
9663 * Pure/Provers/classical: simplified integration with pure rule
9664 attributes and methods; the classical "intro?/elim?/dest?"
9665 declarations coincide with the pure ones; the "rule" method no longer
9666 includes classically swapped intros; "intro" and "elim" methods no
9667 longer pick rules from the context; also got rid of ML declarations
9668 AddXIs/AddXEs/AddXDs; all of this has some potential for
9671 * Provers/classical: attribute 'swapped' produces classical inversions
9672 of introduction rules;
9674 * Provers/simplifier: 'simplified' attribute may refer to explicit
9675 rules instead of full simplifier context; 'iff' attribute handles
9678 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9680 * HOL: 'recdef' now fails on unfinished automated proofs, use
9681 "(permissive)" option to recover old behavior;
9683 * HOL: 'inductive' no longer features separate (collective) attributes
9684 for 'intros' (was found too confusing);
9686 * HOL: properly declared induction rules less_induct and
9692 * HOL: moved over to sane numeral syntax; the new policy is as
9695 - 0 and 1 are polymorphic constants, which are defined on any
9696 numeric type (nat, int, real etc.);
9698 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9699 binary representation internally;
9701 - type nat has special constructor Suc, and generally prefers Suc 0
9702 over 1::nat and Suc (Suc 0) over 2::nat;
9704 This change may cause significant problems of INCOMPATIBILITY; here
9705 are some hints on converting existing sources:
9707 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9708 entities, so expressions involving "-" (unary or binary minus) need
9709 to be spaced properly;
9711 - existing occurrences of "1" may need to be constraint "1::nat" or
9712 even replaced by Suc 0; similar for old "2";
9714 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9716 - remove all special provisions on numerals in proofs;
9718 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9719 representation (depends on bin_arith_simps in the default context);
9721 * HOL: symbolic syntax for x^2 (numeral 2);
9723 * HOL: the class of all HOL types is now called "type" rather than
9724 "term"; INCOMPATIBILITY, need to adapt references to this type class
9725 in axclass/classes, instance/arities, and (usually rare) occurrences
9726 in typings (of consts etc.); internally the class is called
9727 "HOL.type", ML programs should refer to HOLogic.typeS;
9729 * HOL/record package improvements:
9730 - new derived operations "fields" to build a partial record section,
9731 "extend" to promote a fixed record to a record scheme, and
9732 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9733 declared as simp by default;
9734 - shared operations ("more", "fields", etc.) now need to be always
9735 qualified) --- potential INCOMPATIBILITY;
9736 - removed "make_scheme" operations (use "make" with "extend") --
9738 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9739 - provides cases/induct rules for use with corresponding Isar
9740 methods (for concrete records, record schemes, concrete more
9741 parts, and schematic more parts -- in that order);
9742 - internal definitions directly based on a light-weight abstract
9743 theory of product types over typedef rather than datatype;
9745 * HOL: generic code generator for generating executable ML code from
9746 specifications; specific support for HOL constructs such as inductive
9747 datatypes and sets, as well as recursive functions; can be invoked
9748 via 'generate_code' theory section;
9750 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9752 * HOL: consolidated and renamed several theories. In particular:
9753 Ord.thy has been absorbed into HOL.thy
9754 String.thy has been absorbed into List.thy
9756 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9757 (beware of argument permutation!);
9759 * HOL: linorder_less_split superseded by linorder_cases;
9761 * HOL/List: "nodups" renamed to "distinct";
9763 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9764 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9765 - Ex_def has changed, now need to use some_eq_ex
9767 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9768 in this (rare) case use:
9770 delSWrapper "split_all_tac"
9771 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9773 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9776 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9777 Isabelle's type classes, ^ on functions and relations has too general
9778 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9779 necessary to attach explicit type constraints;
9781 * HOL/Relation: the prefix name of the infix "O" has been changed from
9782 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9783 renamed accordingly (eg "compI" -> "rel_compI").
9785 * HOL: syntax translations now work properly with numerals and records
9788 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9789 of "lam" -- INCOMPATIBILITY;
9791 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9792 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9793 renamed "Product_Type.unit";
9795 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9797 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9798 the "cases" method);
9800 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9803 * HOL/IMP: updated and converted to new-style theory format; several
9804 parts turned into readable document, with proper Isar proof texts and
9805 some explanations (by Gerwin Klein);
9807 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9809 * HOL-Hyperreal is now a logic image;
9814 * Isar: consts/constdefs supports mixfix syntax for continuous
9817 * Isar: domain package adapted to new-style theory format, e.g. see
9820 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9821 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9822 lift.induct_tac, always use UU instead of Undef;
9824 * HOLCF/IMP: updated and converted to new-style theory;
9829 * Isar: proper integration of logic-specific tools and packages,
9830 including theory commands '(co)inductive', '(co)datatype',
9831 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9832 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9834 * theory Main no longer includes AC; for the Axiom of Choice, base
9835 your theory on Main_ZFC;
9837 * the integer library now covers quotients and remainders, with many
9838 laws relating division to addition, multiplication, etc.;
9840 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9841 typeless version of the formalism;
9843 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9846 * ZF/Induct: new directory for examples of inductive definitions,
9847 including theory Multiset for multiset orderings; converted to
9848 new-style theory format;
9850 * ZF: many new theorems about lists, ordinals, etc.;
9855 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9856 variable proof controls level of detail: 0 = no proofs (only oracle
9857 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9858 also ref manual for further ML interfaces;
9860 * Pure/axclass: removed obsolete ML interface
9861 goal_subclass/goal_arity;
9863 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9864 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9865 separate tokens, so expressions involving minus need to be spaced
9868 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9869 rather than "infixl" or "infixr";
9871 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9872 sort constraint specifications in type inference; e.g. "x::_::foo"
9873 ensures that the type of "x" is of sort "foo" (but not necessarily a
9876 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9877 control output of nested => (types); the default behavior is
9880 * Pure/syntax: builtin parse translation for "_constify" turns valued
9881 tokens into AST constants;
9883 * Pure/syntax: prefer later declarations of translations and print
9884 translation functions; potential INCOMPATIBILITY: need to reverse
9885 multiple declarations for same syntax element constant;
9887 * Pure/show_hyps reset by default (in accordance to existing Isar
9890 * Provers/classical: renamed addaltern to addafter, addSaltern to
9893 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9896 * system: tested support for MacOS X; should be able to get Isabelle +
9897 Proof General to work in a plain Terminal after installing Poly/ML
9898 (e.g. from the Isabelle distribution area) and GNU bash alone
9899 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9900 support requires further installations, e.g. from
9901 http://fink.sourceforge.net/);
9903 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9905 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9906 of 40 MB), cf. ML_OPTIONS;
9908 * system: Proof General keywords specification is now part of the
9909 Isabelle distribution (see etc/isar-keywords.el);
9911 * system: support for persistent Proof General sessions (refrain from
9912 outdating all loaded theories on startup); user may create writable
9913 logic images like this: ``isabelle -q HOL Test'';
9915 * system: smart selection of Isabelle process versus Isabelle
9916 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9917 run both "isabelle" and "Isabelle" even if file names are badly
9918 damaged (executable inspects the case of the first letter of its own
9919 name); added separate "isabelle-process" and "isabelle-interface";
9921 * system: refrain from any attempt at filtering input streams; no
9922 longer support ``8bit'' encoding of old isabelle font, instead proper
9923 iso-latin characters may now be used; the related isatools
9924 "symbolinput" and "nonascii" have disappeared as well;
9926 * system: removed old "xterm" interface (the print modes "xterm" and
9927 "xterm_color" are still available for direct use in a suitable
9932 New in Isabelle99-2 (February 2001)
9933 -----------------------------------
9935 *** Overview of INCOMPATIBILITIES ***
9937 * HOL: please note that theories in the Library and elsewhere often use the
9938 new-style (Isar) format; to refer to their theorems in an ML script you must
9939 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9941 * HOL: inductive package no longer splits induction rule aggressively,
9942 but only as far as specified by the introductions given; the old
9943 format may be recovered via ML function complete_split_rule or attribute
9944 'split_rule (complete)';
9946 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9947 gfp_Tarski to gfp_unfold;
9949 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9951 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9952 relation); infix "^^" has been renamed "``"; infix "``" has been
9953 renamed "`"; "univalent" has been renamed "single_valued";
9955 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9958 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9960 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9962 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9963 consequence, it is no longer monotonic wrt. the local goal context
9964 (which is now passed through the inductive cases);
9966 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9967 \<gg> to \<ggreater>;
9970 *** Document preparation ***
9972 * \isabellestyle{NAME} selects version of Isabelle output (currently
9973 available: are "it" for near math-mode best-style output, "sl" for
9974 slanted text style, and "tt" for plain type-writer; if no
9975 \isabellestyle command is given, output is according to slanted
9978 * support sub/super scripts (for single symbols only), input syntax is
9979 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9981 * some more standard symbols; see Appendix A of the system manual for
9982 the complete list of symbols defined in isabellesym.sty;
9984 * improved isabelle style files; more abstract symbol implementation
9985 (should now use \isamath{...} and \isatext{...} in custom symbol
9988 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9989 state; Note that presentation of goal states does not conform to
9990 actual human-readable proof documents. Please do not include goal
9991 states into document output unless you really know what you are doing!
9993 * proper indentation of antiquoted output with proportional LaTeX
9996 * no_document ML operator temporarily disables LaTeX document
9999 * isatool unsymbolize tunes sources for plain ASCII communication;
10004 * Pure: Isar now suffers initial goal statements to contain unbound
10005 schematic variables (this does not conform to actual readable proof
10006 documents, due to unpredictable outcome and non-compositional proof
10007 checking); users who know what they are doing may use schematic goals
10008 for Prolog-style synthesis of proven results;
10010 * Pure: assumption method (an implicit finishing) now handles actual
10013 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10014 initial goal, declare "that" only as Pure intro (only for single
10015 steps); the "that" rule assumption may now be involved in implicit
10016 finishing, thus ".." becomes a feasible for trivial obtains;
10018 * Pure: default proof step now includes 'intro_classes'; thus trivial
10019 instance proofs may be performed by "..";
10021 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10022 statements as well;
10024 * Pure: more robust selection of calculational rules;
10026 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10027 rule (as well as the assumption rule);
10029 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10030 lemmas, using the graph browser tool;
10032 * Pure: predict failure of "show" in interactive mode;
10034 * Pure: 'thms_containing' now takes actual terms as arguments;
10036 * HOL: improved method 'induct' --- now handles non-atomic goals
10037 (potential INCOMPATIBILITY); tuned error handling;
10039 * HOL: cases and induct rules now provide explicit hints about the
10040 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10041 any remaining facts are inserted into the goal verbatim;
10043 * HOL: local contexts (aka cases) may now contain term bindings as
10044 well; the 'cases' and 'induct' methods new provide a ?case binding for
10045 the result to be shown in each case;
10047 * HOL: added 'recdef_tc' command;
10049 * isatool convert assists in eliminating legacy ML scripts;
10054 * HOL/Library: a collection of generic theories to be used together
10055 with main HOL; the theory loader path already includes this directory
10056 by default; the following existing theories have been moved here:
10057 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10058 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10060 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10061 modelling and verification task performed in Isabelle/HOL +
10062 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10064 * HOL/Algebra: special summation operator SUM no longer exists, it has
10065 been replaced by setsum; infix 'assoc' now has priority 50 (like
10066 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10067 'domain', this makes the theory consistent with mathematical
10070 * HOL basics: added overloaded operations "inverse" and "divide"
10071 (infix "/"), syntax for generic "abs" operation, generic summation
10074 * HOL/typedef: simplified package, provide more useful rules (see also
10077 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10078 now expressed as a proper nested rule (old-style tactic scripts may
10079 require atomize_strip_tac to cope with non-atomic premises);
10081 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10082 to "split_conv" (old name still available for compatibility);
10084 * HOL: improved concrete syntax for strings (e.g. allows translation
10085 rules with string literals);
10087 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10088 and Fleuriot's mechanization of analysis, including the transcendental
10089 functions for the reals;
10091 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10096 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10097 "lam" is displayed as TWO lambda-symbols
10099 * CTT: theory Main now available, containing everything (that is, Bool
10105 * Pure: the Simplifier has been implemented properly as a derived rule
10106 outside of the actual kernel (at last!); the overall performance
10107 penalty in practical applications is about 50%, while reliability of
10108 the Isabelle inference kernel has been greatly improved;
10110 * print modes "brackets" and "no_brackets" control output of nested =>
10111 (types) and ==> (props); the default behaviour is "brackets";
10113 * Provers: fast_tac (and friends) now handle actual object-logic rules
10114 as assumptions as well;
10116 * system: support Poly/ML 4.0;
10118 * system: isatool install handles KDE version 1 or 2;
10122 New in Isabelle99-1 (October 2000)
10123 ----------------------------------
10125 *** Overview of INCOMPATIBILITIES ***
10127 * HOL: simplification of natural numbers is much changed; to partly
10128 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10129 issue the following ML commands:
10131 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10132 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10134 * HOL: simplification no longer dives into case-expressions; this is
10135 controlled by "t.weak_case_cong" for each datatype t;
10137 * HOL: nat_less_induct renamed to less_induct;
10139 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10140 fixsome to patch .thy and .ML sources automatically;
10142 select_equality -> some_equality
10143 select_eq_Ex -> some_eq_ex
10144 selectI2EX -> someI2_ex
10147 select1_equality -> some1_equality
10148 Eps_sym_eq -> some_sym_eq_trivial
10149 Eps_eq -> some_eq_trivial
10151 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10153 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10156 * HOL: the recursion equations generated by 'recdef' are now called
10157 f.simps instead of f.rules;
10159 * HOL: qed_spec_mp now also handles bounded ALL as well;
10161 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10162 sometimes be needed;
10164 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10166 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10168 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10169 product is now "<*>" instead of "Times"; the lexicographic product is
10170 now "<*lex*>" instead of "**";
10172 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10173 of main HOL, but was unused); better use HOL's datatype package;
10175 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10176 the old syntax may be recovered as follows:
10179 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10180 (infixl "\\<oplus>" 100)
10182 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10184 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10185 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10188 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10189 changed from A/r to A//r;
10191 * ZF: new treatment of arithmetic (nat & int) may break some old
10194 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10195 rulify -> rule_format, elimify -> elim_format, ...);
10197 * Isar/Provers: intro/elim/dest attributes changed; renamed
10198 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10199 should have to change intro!! to intro? only); replaced "delrule" by
10202 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10204 * Provers: strengthened force_tac by using new first_best_tac;
10206 * LaTeX document preparation: several changes of isabelle.sty (see
10210 *** Document preparation ***
10212 * formal comments (text blocks etc.) in new-style theories may now
10213 contain antiquotations of thm/prop/term/typ/text to be presented
10214 according to latex print mode; concrete syntax is like this:
10215 @{term[show_types] "f(x) = a + x"};
10217 * isatool mkdir provides easy setup of Isabelle session directories,
10218 including proper document sources;
10220 * generated LaTeX sources are now deleted after successful run
10221 (isatool document -c); may retain a copy somewhere else via -D option
10224 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10225 style files, achieving self-contained LaTeX sources and simplifying
10228 * old-style theories now produce (crude) LaTeX output as well;
10230 * browser info session directories are now self-contained (may be put
10231 on WWW server seperately); improved graphs of nested sessions; removed
10232 graph for 'all sessions';
10234 * several improvements in isabelle style files; \isabellestyle{it}
10235 produces fake math mode output; \isamarkupheader is now \section by
10236 default; see lib/texinputs/isabelle.sty etc.;
10241 * Isar/Pure: local results and corresponding term bindings are now
10242 subject to Hindley-Milner polymorphism (similar to ML); this
10243 accommodates incremental type-inference very nicely;
10245 * Isar/Pure: new derived language element 'obtain' supports
10246 generalized existence reasoning;
10248 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10249 support accumulation of results, without applying any rules yet;
10250 useful to collect intermediate results without explicit name
10251 references, and for use with transitivity rules with more than 2
10254 * Isar/Pure: scalable support for case-analysis type proofs: new
10255 'case' language element refers to local contexts symbolically, as
10256 produced by certain proof methods; internally, case names are attached
10257 to theorems as "tags";
10259 * Isar/Pure: theory command 'hide' removes declarations from
10260 class/type/const name spaces;
10262 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10263 indicate potential overloading;
10265 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10267 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10268 "{a,b,c}" instead of {a,b,c};
10270 * Isar/Pure now provides its own version of intro/elim/dest
10271 attributes; useful for building new logics, but beware of confusion
10272 with the version in Provers/classical;
10274 * Isar/Pure: the local context of (non-atomic) goals is provided via
10275 case name 'antecedent';
10277 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10278 to the current context is now done automatically);
10280 * Isar/Pure: theory command 'method_setup' provides a simple interface
10281 for definining proof methods in ML;
10283 * Isar/Provers: intro/elim/dest attributes changed; renamed
10284 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10285 most cases, one should have to change intro!! to intro? only);
10286 replaced "delrule" by "rule del";
10288 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10289 'symmetric' attribute (the latter supercedes [RS sym]);
10291 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10292 method modifier); 'simp' method: 'only:' modifier removes loopers as
10293 well (including splits);
10295 * Isar/Provers: Simplifier and Classical methods now support all kind
10296 of modifiers used in the past, including 'cong', 'iff', etc.
10298 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10299 of Simplifier and Classical reasoner);
10301 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10302 now support named cases; major packages (inductive, datatype, primrec,
10303 recdef) support case names and properly name parameters;
10305 * Isar/HOL: new transitivity rules for substitution in inequalities --
10306 monotonicity conditions are extracted to be proven at end of
10309 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10312 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10313 split_if split_if_asm; datatype package provides theorems foo.splits =
10314 foo.split foo.split_asm for each datatype;
10316 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10317 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10318 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10319 use "(cases (simplified))" method in proper proof texts);
10321 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10323 * Isar: names of theorems etc. may be natural numbers as well;
10325 * Isar: 'pr' command: optional arguments for goals_limit and
10326 ProofContext.prems_limit; no longer prints theory contexts, but only
10329 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10330 additional print modes to be specified; e.g. "pr(latex)" will print
10331 proof state according to the Isabelle LaTeX style;
10333 * Isar: improved support for emulating tactic scripts, including proof
10334 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10335 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10336 (for HOL datatypes);
10338 * Isar: simplified (more robust) goal selection of proof methods: 1st
10339 goal, all goals, or explicit goal specifier (tactic emulation); thus
10340 'proof method scripts' have to be in depth-first order;
10342 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10344 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10345 should instead use individual commands for printing items
10346 (print_commands, print_methods etc.);
10348 * Isar: added 'nothing' --- the empty list of theorems;
10353 * HOL/MicroJava: formalization of a fragment of Java, together with a
10354 corresponding virtual machine and a specification of its bytecode
10355 verifier and a lightweight bytecode verifier, including proofs of
10356 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10357 Cornelia Pusch (see also the homepage of project Bali at
10358 http://isabelle.in.tum.de/Bali/);
10360 * HOL/Algebra: new theory of rings and univariate polynomials, by
10363 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10364 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10367 * HOL/Lattice: fundamental concepts of lattice theory and order
10368 structures, including duals, properties of bounds versus algebraic
10369 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10370 Theorem for complete lattices etc.; may also serve as a demonstration
10371 for abstract algebraic reasoning using axiomatic type classes, and
10372 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10374 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10377 * HOL/IMPP: extension of IMP with local variables and mutually
10378 recursive procedures, by David von Oheimb;
10380 * HOL/Lambda: converted into new-style theory and document;
10382 * HOL/ex/Multiquote: example of multiple nested quotations and
10383 anti-quotations -- basically a generalized version of de-Bruijn
10384 representation; very useful in avoiding lifting of operations;
10386 * HOL/record: added general record equality rule to simpset; fixed
10387 select-update simplification procedure to handle extended records as
10388 well; admit "r" as field name;
10390 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10391 other numeric types and also as the identity of groups, rings, etc.;
10393 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10394 Types nat and int belong to this axclass;
10396 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10397 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10398 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10399 two terms #m*u and #n*u are replaced by #(m+n)*u
10400 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10401 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10402 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10404 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10405 powerful prover for predicate logic but knows nothing of clasets; see
10406 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10408 * HOL: new version of "case_tac" subsumes both boolean case split and
10409 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10410 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10412 * HOL: simplification no longer dives into case-expressions: only the
10413 selector expression is simplified, but not the remaining arms; to
10414 enable full simplification of case-expressions for datatype t, you may
10415 remove t.weak_case_cong from the simpset, either globally (Delcongs
10416 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10418 * HOL/recdef: the recursion equations generated by 'recdef' for
10419 function 'f' are now called f.simps instead of f.rules; if all
10420 termination conditions are proved automatically, these simplification
10421 rules are added to the simpset, as in primrec; rules may be named
10422 individually as well, resulting in a separate list of theorems for
10425 * HOL/While is a new theory that provides a while-combinator. It
10426 permits the definition of tail-recursive functions without the
10427 provision of a termination measure. The latter is necessary once the
10428 invariant proof rule for while is applied.
10430 * HOL: new (overloaded) notation for the set of elements below/above
10431 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10433 * HOL: theorems impI, allI, ballI bound as "strip";
10435 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10436 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10437 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10439 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10441 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10442 main HOL, but was unused);
10444 * HOL: fewer consts declared as global (e.g. have to refer to
10445 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10447 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10448 in case of overlap with user translations (e.g. judgements over
10449 tuples); (note that the underlying logical represenation is still
10455 * ZF: simplification automatically cancels common terms in arithmetic
10456 expressions over nat and int;
10458 * ZF: new treatment of nat to minimize type-checking: all operators
10459 coerce their operands to a natural number using the function natify,
10460 making the algebraic laws unconditional;
10462 * ZF: as above, for int: operators coerce their operands to an integer
10463 using the function intify;
10465 * ZF: the integer library now contains many of the usual laws for the
10466 orderings, including $<=, and monotonicity laws for $+ and $*;
10468 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10471 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10472 to the simplifier and classical reasoner simultaneously;
10477 * Provers: blast_tac now handles actual object-logic rules as
10478 assumptions; note that auto_tac uses blast_tac internally as well;
10480 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10481 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10483 * Provers: delrules now handles destruct rules as well (no longer need
10484 explicit make_elim);
10486 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10487 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10488 use instead the strong form,
10489 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10490 in HOL, FOL and ZF the function cla_make_elim will create such rules
10491 from destruct-rules;
10493 * Provers: Simplifier.easy_setup provides a fast path to basic
10494 Simplifier setup for new object-logics;
10496 * Pure: AST translation rules no longer require constant head on LHS;
10498 * Pure: improved name spaces: ambiguous output is qualified; support
10499 for hiding of names;
10501 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10502 XSYMBOL_HOME; no longer need to do manual configuration in most
10505 * system: compression of ML heaps images may now be controlled via -c
10506 option of isabelle and isatool usedir (currently only observed by
10509 * system: isatool installfonts may handle X-Symbol fonts as well (very
10510 useful for remote X11);
10512 * system: provide TAGS file for Isabelle sources;
10514 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10517 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10518 timing flag supersedes proof_timing and Toplevel.trace;
10520 * ML: new combinators |>> and |>>> for incremental transformations
10521 with secondary results (e.g. certain theory extensions):
10523 * ML: PureThy.add_defs gets additional argument to indicate potential
10524 overloading (usually false);
10526 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10531 New in Isabelle99 (October 1999)
10532 --------------------------------
10534 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10536 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10537 are no longer simplified. (This allows the simplifier to unfold recursive
10538 functional programs.) To restore the old behaviour, declare
10540 Delcongs [if_weak_cong];
10542 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10545 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10547 * HOL/datatype: mutual_induct_tac no longer exists --
10548 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10550 * HOL/typedef: fixed type inference for representing set; type
10551 arguments now have to occur explicitly on the rhs as type constraints;
10553 * ZF: The con_defs part of an inductive definition may no longer refer
10554 to constants declared in the same theory;
10556 * HOL, ZF: the function mk_cases, generated by the inductive
10557 definition package, has lost an argument. To simplify its result, it
10558 uses the default simpset instead of a supplied list of theorems.
10560 * HOL/List: the constructors of type list are now Nil and Cons;
10562 * Simplifier: the type of the infix ML functions
10563 setSSolver addSSolver setSolver addSolver
10564 is now simpset * solver -> simpset where `solver' is a new abstract type
10565 for packaging solvers. A solver is created via
10566 mk_solver: string -> (thm list -> int -> tactic) -> solver
10567 where the string argument is only a comment.
10570 *** Proof tools ***
10572 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10573 decision procedure for linear arithmetic. Currently it is used for
10574 types `nat', `int', and `real' in HOL (see below); it can, should and
10575 will be instantiated for other types and logics as well.
10577 * The simplifier now accepts rewrite rules with flexible heads, eg
10578 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10579 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10585 * New Isabelle/Isar subsystem provides an alternative to traditional
10586 tactical theorem proving; together with the ProofGeneral/isar user
10587 interface it offers an interactive environment for developing human
10588 readable proof documents (Isar == Intelligible semi-automated
10589 reasoning); for further information see isatool doc isar-ref,
10590 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10592 * improved and simplified presentation of theories: better HTML markup
10593 (including colors), graph views in several sizes; isatool usedir now
10594 provides a proper interface for user theories (via -P option); actual
10595 document preparation based on (PDF)LaTeX is available as well (for
10596 new-style theories only); see isatool doc system for more information;
10598 * native support for Proof General, both for classic Isabelle and
10601 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10602 using the graph browser tool;
10604 * Isabelle manuals now also available as PDF;
10606 * theory loader rewritten from scratch (may not be fully
10607 bug-compatible); old loadpath variable has been replaced by show_path,
10608 add_path, del_path, reset_path functions; new operations such as
10609 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10612 * improved isatool install: option -k creates KDE application icon,
10613 option -p DIR installs standalone binaries;
10615 * added ML_PLATFORM setting (useful for cross-platform installations);
10616 more robust handling of platform specific ML images for SML/NJ;
10618 * the settings environment is now statically scoped, i.e. it is never
10619 created again in sub-processes invoked from isabelle, isatool, or
10622 * path element specification '~~' refers to '$ISABELLE_HOME';
10624 * in locales, the "assumes" and "defines" parts may be omitted if
10627 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10630 * new print_mode "HTML";
10632 * new flag show_tags controls display of tags of theorems (which are
10633 basically just comments that may be attached by some tools);
10635 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10636 mode and goal output format:
10638 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10640 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10642 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10643 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10645 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10647 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10649 * function bind_thms stores lists of theorems (cf. bind_thm);
10651 * new shorthand tactics ftac, eatac, datac, fatac;
10653 * qed (and friends) now accept "" as result name; in that case the
10654 theorem is not stored, but proper checks and presentation of the
10655 result still apply;
10657 * theorem database now also indexes constants "Trueprop", "all",
10658 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10663 ** HOL arithmetic **
10665 * There are now decision procedures for linear arithmetic over nat and
10668 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10669 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10670 are treated as atomic; subformulae not involving type `nat' or `int'
10671 are ignored; quantified subformulae are ignored unless they are
10672 positive universal or negative existential. The tactic has to be
10673 invoked by hand and can be a little bit slow. In particular, the
10674 running time is exponential in the number of occurrences of `min' and
10675 `max', and `-' on `nat'.
10677 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10678 (negated) (in)equalities among the premises and the conclusion into
10679 account (i.e. no compound formulae) and does not know about `min' and
10680 `max', and `-' on `nat'. It is fast and is used automatically by the
10683 NB: At the moment, these decision procedures do not cope with mixed
10684 nat/int formulae where the two parts interact, such as `m < n ==>
10687 * HOL/Numeral provides a generic theory of numerals (encoded
10688 efficiently as bit strings); setup for types nat/int/real is in place;
10689 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10690 int, existing theories and proof scripts may require a few additional
10693 * integer division and remainder can now be performed on constant
10696 * many properties of integer multiplication, division and remainder
10699 * An interface to the Stanford Validity Checker (SVC) is available through the
10700 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10701 are proved automatically. SVC must be installed separately, and its results
10702 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10703 invocation of the underlying oracle). For SVC see
10704 http://verify.stanford.edu/SVC
10706 * IsaMakefile: the HOL-Real target now builds an actual image;
10711 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10712 (in Isabelle/Isar) -- by Gertrud Bauer;
10714 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10715 analysis for assembly languages with subtypes;
10717 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10718 -- avoids syntactic ambiguities and treats state, transition, and
10719 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10720 changed syntax and (many) tactics;
10722 * HOL/inductive: Now also handles more general introduction rules such
10723 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10724 theorems are now maintained within the theory (maintained via the
10727 * HOL/datatype: Now also handles arbitrarily branching datatypes
10728 (using function types) such as
10730 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10732 * HOL/record: record_simproc (part of the default simpset) takes care
10733 of selectors applied to updated records; record_split_tac is no longer
10734 part of the default claset; update_defs may now be removed from the
10735 simpset in many cases; COMPATIBILITY: old behavior achieved by
10737 claset_ref () := claset() addSWrapper record_split_wrapper;
10738 Delsimprocs [record_simproc]
10740 * HOL/typedef: fixed type inference for representing set; type
10741 arguments now have to occur explicitly on the rhs as type constraints;
10743 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10744 names rather than an ML expression;
10746 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10747 supplied later. Program schemes can be defined, such as
10748 "While B C s = (if B s then While B C (C s) else s)"
10749 where the well-founded relation can be chosen after B and C have been given.
10751 * HOL/List: the constructors of type list are now Nil and Cons;
10752 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10753 course, ML tools referring to List.list.op # etc. have to be adapted;
10755 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10756 disabled by default; run isabelle with option -m HOL to get back to
10757 the original Gordon/HOL-style output;
10759 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10760 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10762 * HOL basic syntax simplified (more orthogonal): all variants of
10763 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10764 Eps operator is provided as well: "SOME x. P[x]";
10766 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10768 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10769 thus available for user theories;
10771 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10772 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10775 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10776 several times and then mp;
10781 * the notation <<...>> is now available as a notation for sequences of
10784 * the simplifier is now installed
10786 * the axiom system has been generalized (thanks to Soren Heilmann)
10788 * the classical reasoner now has a default rule database
10793 * new primrec section allows primitive recursive functions to be given
10794 directly (as in HOL) over datatypes and the natural numbers;
10796 * new tactics induct_tac and exhaust_tac for induction (or case
10797 analysis) over datatypes and the natural numbers;
10799 * the datatype declaration of type T now defines the recursor T_rec;
10801 * simplification automatically does freeness reasoning for datatype
10804 * automatic type-inference, with AddTCs command to insert new
10805 type-checking rules;
10807 * datatype introduction rules are now added as Safe Introduction rules
10810 * the syntax "if P then x else y" is now available in addition to
10814 *** Internal programming interfaces ***
10816 * tuned simplifier trace output; new flag debug_simp;
10818 * structures Vartab / Termtab (instances of TableFun) offer efficient
10819 tables indexed by indexname_ord / term_ord (compatible with aconv);
10821 * AxClass.axclass_tac lost the theory argument;
10823 * tuned current_goals_markers semantics: begin / end goal avoids
10824 printing empty lines;
10826 * removed prs and prs_fn hook, which was broken because it did not
10827 include \n in its semantics, forcing writeln to add one
10828 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10829 string -> unit if you really want to output text without newline;
10831 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10832 plain output, interface builders may have to enable 'isabelle_font'
10833 mode to get Isabelle font glyphs as before;
10835 * refined token_translation interface; INCOMPATIBILITY: output length
10836 now of type real instead of int;
10838 * theory loader actions may be traced via new ThyInfo.add_hook
10839 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10840 your own database of information attached to *whole* theories -- as
10841 opposed to intra-theory data slots offered via TheoryDataFun;
10843 * proper handling of dangling sort hypotheses (at last!);
10844 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10845 extra sort hypotheses that can be witnessed from the type signature;
10846 the force_strip_shyps flag is gone, any remaining shyps are simply
10847 left in the theorem (with a warning issued by strip_shyps_warning);
10851 New in Isabelle98-1 (October 1998)
10852 ----------------------------------
10854 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10856 * several changes of automated proof tools;
10858 * HOL: major changes to the inductive and datatype packages, including
10859 some minor incompatibilities of theory syntax;
10861 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10864 * HOL: removed duplicate thms in Arith:
10865 less_imp_add_less should be replaced by trans_less_add1
10866 le_imp_add_le should be replaced by trans_le_add1
10868 * HOL: unary minus is now overloaded (new type constraints may be
10871 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10872 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10873 now taken as an integer constant.
10875 * Pure: ML function 'theory_of' renamed to 'theory';
10878 *** Proof tools ***
10881 1. Asm_full_simp_tac is now more aggressive.
10882 1. It will sometimes reorient premises if that increases their power to
10884 2. It does no longer proceed strictly from left to right but may also
10885 rotate premises to achieve further simplification.
10886 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10887 old Asm_full_simp_tac in that it does not rotate premises.
10888 2. The simplifier now knows a little bit about nat-arithmetic.
10890 * Classical reasoner: wrapper mechanism for the classical reasoner now
10891 allows for selected deletion of wrappers, by introduction of names for
10892 wrapper functionals. This implies that addbefore, addSbefore,
10893 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10894 and that adding two tactics with the same name overwrites the first
10895 one (emitting a warning).
10896 type wrapper = (int -> tactic) -> (int -> tactic)
10897 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10898 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10899 delWrapper, delSWrapper: claset * string -> claset
10900 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10902 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10903 semantics; addbefore now affects only the unsafe part of step_tac
10904 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10905 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10908 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10909 compWrapper; added safe wrapper (and access functions for it);
10911 * HOL/split_all_tac is now much faster and fails if there is nothing
10912 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10913 and the names of the automatically generated variables have changed.
10914 split_all_tac has moved within claset() from unsafe wrappers to safe
10915 wrappers, which means that !!-bound variables are split much more
10916 aggressively, and safe_tac and clarify_tac now split such variables.
10917 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10918 Note: the same holds for record_split_tac, which does the job of
10919 split_all_tac for record fields.
10921 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10922 permanently to the default simpset using Addsplits just like
10923 Addsimps. They can be removed via Delsplits just like
10924 Delsimps. Lower-case versions are also available.
10926 * HOL/Simplifier: The rule split_if is now part of the default
10927 simpset. This means that the simplifier will eliminate all occurrences
10928 of if-then-else in the conclusion of a goal. To prevent this, you can
10929 either remove split_if completely from the default simpset by
10930 `Delsplits [split_if]' or remove it in a specific call of the
10931 simplifier using `... delsplits [split_if]'. You can also add/delete
10932 other case splitting rules to/from the default simpset: every datatype
10933 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10934 t is the name of the datatype).
10936 * Classical reasoner / Simplifier combination: new force_tac (and
10937 derivatives Force_tac, force) combines rewriting and classical
10938 reasoning (and whatever other tools) similarly to auto_tac, but is
10939 aimed to solve the given subgoal completely.
10944 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10945 and `goalw': the theory is no longer needed as an explicit argument -
10946 the current theory context is used; assumptions are no longer returned
10947 at the ML-level unless one of them starts with ==> or !!; it is
10948 recommended to convert to these new commands using isatool fixgoal
10949 (backup your sources first!);
10951 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10952 the current theory context, and 'theory' to lookup stored theories;
10954 * new theory section 'locale' for declaring constants, assumptions and
10955 definitions that have local scope;
10957 * new theory section 'nonterminals' for purely syntactic types;
10959 * new theory section 'setup' for generic ML setup functions
10960 (e.g. package initialization);
10962 * the distribution now includes Isabelle icons: see
10963 lib/logo/isabelle-{small,tiny}.xpm;
10965 * isatool install - install binaries with absolute references to
10968 * isatool logo -- create instances of the Isabelle logo (as EPS);
10970 * print mode 'emacs' reserved for Isamode;
10972 * support multiple print (ast) translations per constant name;
10974 * theorems involving oracles are now printed with a suffixed [!];
10979 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10981 * HOL/inductive package reorganized and improved: now supports mutual
10982 definitions such as
10987 oddI "n : EVEN ==> Suc n : ODD"
10988 evenI "n : ODD ==> Suc n : EVEN"
10990 new theorem list "elims" contains an elimination rule for each of the
10991 recursive sets; inductive definitions now handle disjunctive premises
10992 correctly (also ZF);
10994 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10995 "mutual_induct" no longer exists - the induction rule is always
10996 contained in "induct";
10999 * HOL/datatype package re-implemented and greatly improved: now
11000 supports mutually recursive datatypes such as
11003 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11004 | SUM ('a aexp) ('a aexp)
11005 | DIFF ('a aexp) ('a aexp)
11008 'a bexp = LESS ('a aexp) ('a aexp)
11009 | AND ('a bexp) ('a bexp)
11010 | OR ('a bexp) ('a bexp)
11012 as well as indirectly recursive datatypes such as
11015 ('a, 'b) term = Var 'a
11016 | App 'b ((('a, 'b) term) list)
11018 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11019 induction on mutually / indirectly recursive datatypes.
11021 Primrec equations are now stored in theory and can be accessed via
11022 <function_name>.simps.
11026 - Theories using datatypes must now have theory Datatype as an
11028 - The specific <typename>.induct_tac no longer exists - use the
11029 generic induct_tac instead.
11030 - natE has been renamed to nat.exhaust - use exhaust_tac
11031 instead of res_inst_tac ... natE. Note that the variable
11032 names in nat.exhaust differ from the names in natE, this
11033 may cause some "fragile" proofs to fail.
11034 - The theorems split_<typename>_case and split_<typename>_case_asm
11035 have been renamed to <typename>.split and <typename>.split_asm.
11036 - Since default sorts of type variables are now handled correctly,
11037 some datatype definitions may have to be annotated with explicit
11039 - Primrec definitions no longer require function name and type
11040 of recursive argument.
11042 Consider using isatool fixdatatype to adapt your theories and proof
11043 scripts to the new package (backup your sources first!).
11046 * HOL/record package: considerably improved implementation; now
11047 includes concrete syntax for record types, terms, updates; theorems
11048 for surjective pairing and splitting !!-bound record variables; proof
11049 support is as follows:
11051 1) standard conversions (selectors or updates applied to record
11052 constructor terms) are part of the standard simpset;
11054 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11055 made part of standard simpset and claset via addIffs;
11057 3) a tactic for record field splitting (record_split_tac) is part of
11058 the standard claset (addSWrapper);
11060 To get a better idea about these rules you may retrieve them via
11061 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11062 the name of your record type.
11064 The split tactic 3) conceptually simplifies by the following rule:
11066 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11068 Thus any record variable that is bound by meta-all will automatically
11069 blow up into some record constructor term, consequently the
11070 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11071 solve record problems automatically.
11074 * reorganized the main HOL image: HOL/Integ and String loaded by
11075 default; theory Main includes everything;
11077 * automatic simplification of integer sums and comparisons, using cancellation;
11079 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11081 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11083 * many new identities for unions, intersections, set difference, etc.;
11085 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11086 called split_if, split_split, split_sum_case and split_nat_case (to go
11087 with add/delsplits);
11089 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11090 (?x::unit) = (); this is made part of the default simpset, which COULD
11091 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11092 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11093 unit_abs_eta_conv is added in order to counter the effect of
11094 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11097 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11100 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11101 It and 'sym RS equals0D' are now in the default claset, giving automatic
11102 disjointness reasoning but breaking a few old proofs.
11104 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11105 to 'converse' from 'inverse' (for compatibility with ZF and some
11108 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11109 the well-founded relation;
11111 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11112 Compl A. The "Compl" syntax remains available as input syntax for this
11115 * HOL/Update: new theory of function updates:
11116 f(a:=b) == %x. if x=a then b else f x
11117 may also be iterated as in f(a:=b,c:=d,...);
11119 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11122 - new function list_update written xs[i:=v] that updates the i-th
11123 list position. May also be iterated as in xs[i:=a,j:=b,...].
11124 - new function `upt' written [i..j(] which generates the list
11125 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11126 bound write [i..j], which is a shorthand for [i..j+1(].
11127 - new lexicographic orderings and corresponding wellfoundedness theorems.
11130 - removed 'pred' (predecessor) function;
11131 - generalized some theorems about n-1;
11132 - many new laws about "div" and "mod";
11133 - new laws about greatest common divisors (see theory ex/Primes);
11135 * HOL/Relation: renamed the relational operator r^-1 "converse"
11136 instead of "inverse";
11138 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11139 of the multiset ordering;
11141 * directory HOL/Real: a construction of the reals using Dedekind cuts
11142 (not included by default);
11144 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11146 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11147 programs, i.e. different program variables may have different types.
11149 * calling (stac rew i) now fails if "rew" has no effect on the goal
11150 [previously, this check worked only if the rewrite rule was unconditional]
11151 Now rew can involve either definitions or equalities (either == or =).
11156 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11157 only the theorems proved on ZF.ML;
11159 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11160 It and 'sym RS equals0D' are now in the default claset, giving automatic
11161 disjointness reasoning but breaking a few old proofs.
11163 * ZF/Update: new theory of function updates
11164 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11165 may also be iterated as in f(a:=b,c:=d,...);
11167 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11169 * calling (stac rew i) now fails if "rew" has no effect on the goal
11170 [previously, this check worked only if the rewrite rule was unconditional]
11171 Now rew can involve either definitions or equalities (either == or =).
11173 * case_tac provided for compatibility with HOL
11174 (like the old excluded_middle_tac, but with subgoals swapped)
11177 *** Internal programming interfaces ***
11179 * Pure: several new basic modules made available for general use, see
11180 also src/Pure/README;
11182 * improved the theory data mechanism to support encapsulation (data
11183 kind name replaced by private Object.kind, acting as authorization
11184 key); new type-safe user interface via functor TheoryDataFun; generic
11185 print_data function becomes basically useless;
11187 * removed global_names compatibility flag -- all theory declarations
11188 are qualified by default;
11190 * module Pure/Syntax now offers quote / antiquote translation
11191 functions (useful for Hoare logic etc. with implicit dependencies);
11192 see HOL/ex/Antiquote for an example use;
11194 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11197 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11200 * Display.print_goals function moved to Locale.print_goals;
11202 * standard print function for goals supports current_goals_markers
11203 variable for marking begin of proof, end of proof, start of goal; the
11204 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11205 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11210 New in Isabelle98 (January 1998)
11211 --------------------------------
11213 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11215 * changed lexical syntax of terms / types: dots made part of long
11216 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11218 * simpset (and claset) reference variable replaced by functions
11219 simpset / simpset_ref;
11221 * no longer supports theory aliases (via merge) and non-trivial
11222 implicit merge of thms' signatures;
11224 * most internal names of constants changed due to qualified names;
11226 * changed Pure/Sequence interface (see Pure/seq.ML);
11229 *** General Changes ***
11231 * hierachically structured name spaces (for consts, types, axms, thms
11232 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11233 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11234 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11235 long_names for fully qualified output names; NOTE: ML programs
11236 (special tactics, packages etc.) referring to internal names may have
11237 to be adapted to cope with fully qualified names; in case of severe
11238 backward campatibility problems try setting 'global_names' at compile
11239 time to have enrything declared within a flat name space; one may also
11240 fine tune name declarations in theories via the 'global' and 'local'
11243 * reimplemented the implicit simpset and claset using the new anytype
11244 data filed in signatures; references simpset:simpset ref etc. are
11245 replaced by functions simpset:unit->simpset and
11246 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11247 to patch your ML files accordingly;
11249 * HTML output now includes theory graph data for display with Java
11250 applet or isatool browser; data generated automatically via isatool
11251 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11253 * defs may now be conditional; improved rewrite_goals_tac to handle
11254 conditional equations;
11256 * defs now admits additional type arguments, using TYPE('a) syntax;
11258 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11259 creates a new theory node; implicit merge of thms' signatures is
11260 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11261 transfer:theory->thm->thm in (rare) cases;
11263 * improved handling of draft signatures / theories; draft thms (and
11264 ctyps, cterms) are automatically promoted to real ones;
11266 * slightly changed interfaces for oracles: admit many per theory, named
11267 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11269 * print_goals: optional output of const types (set show_consts and
11272 * improved output of warnings (###) and errors (***);
11274 * subgoal_tac displays a warning if the new subgoal has type variables;
11276 * removed old README and Makefiles;
11278 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11280 * removed obsolete init_pps and init_database;
11282 * deleted the obsolete tactical STATE, which was declared by
11283 fun STATE tacfun st = tacfun st st;
11285 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11286 (which abbreviates $HOME);
11288 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11289 use isatool fixseq to adapt your ML programs (this works for fully
11290 qualified references to the Sequence structure only!);
11292 * use_thy no longer requires writable current directory; it always
11293 reloads .ML *and* .thy file, if either one is out of date;
11296 *** Classical Reasoner ***
11298 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11299 tactics that use classical reasoning to simplify a subgoal without
11300 splitting it into several subgoals;
11302 * Safe_tac: like safe_tac but uses the default claset;
11307 * added simplification meta rules:
11308 (asm_)(full_)simplify: simpset -> thm -> thm;
11310 * simplifier.ML no longer part of Pure -- has to be loaded by object
11313 * added prems argument to simplification procedures;
11315 * HOL, FOL, ZF: added infix function `addsplits':
11316 instead of `<simpset> setloop (split_tac <thms>)'
11317 you can simply write `<simpset> addsplits <thms>'
11322 * TYPE('a) syntax for type reflection terms;
11324 * no longer handles consts with name "" -- declare as 'syntax' instead;
11326 * pretty printer: changed order of mixfix annotation preference (again!);
11328 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11333 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11334 with `addloop' of the simplifier to faciliate case splitting in premises.
11336 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11338 * HOL/Auth: new protocol proofs including some for the Internet
11341 * HOL/Map: new theory of `maps' a la VDM;
11343 * HOL/simplifier: simplification procedures nat_cancel_sums for
11344 cancelling out common nat summands from =, <, <= (in)equalities, or
11345 differences; simplification procedures nat_cancel_factor for
11346 cancelling common factor from =, <, <= (in)equalities over natural
11347 sums; nat_cancel contains both kinds of procedures, it is installed by
11348 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11350 * HOL/simplifier: terms of the form
11351 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11353 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11354 and those of the form
11355 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11357 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11360 Each datatype `t' now comes with a theorem `split_t_case' of the form
11362 P(t_case f1 ... fn x) =
11363 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11365 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11368 and a theorem `split_t_case_asm' of the form
11370 P(t_case f1 ... fn x) =
11371 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11373 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11375 which can be added to a simpset via `addsplits'. The existing theorems
11376 expand_list_case and expand_option_case have been renamed to
11377 split_list_case and split_option_case.
11380 - `pred n' is automatically converted to `n-1'.
11381 Users are strongly encouraged not to use `pred' any longer,
11382 because it will disappear altogether at some point.
11383 - Users are strongly encouraged to write "0 < n" rather than
11384 "n ~= 0". Theorems and proof tools have been modified towards this
11388 the function "set_of_list" has been renamed "set" (and its theorems too);
11389 the function "nth" now takes its arguments in the reverse order and
11390 has acquired the infix notation "!" as in "xs!n".
11392 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11394 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11395 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11397 * HOL/record: extensible records with schematic structural subtyping
11398 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11399 still lacks various theorems and concrete record syntax;
11404 * removed "axioms" and "generated by" sections;
11406 * replaced "ops" section by extended "consts" section, which is capable of
11407 handling the continuous function space "->" directly;
11410 . proves theorems immediately and stores them in the theory,
11411 . creates hierachical name space,
11412 . now uses normal mixfix annotations (instead of cinfix...),
11413 . minor changes to some names and values (for consistency),
11414 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11415 . separator between mutual domain defs: changed "," to "and",
11416 . improved handling of sort constraints; now they have to
11417 appear on the left-hand side of the equations only;
11419 * fixed LAM <x,y,zs>.b syntax;
11421 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11422 adm (%x. P (t x)), where P is chainfinite and t continuous;
11427 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11428 with `addloop' of the simplifier to faciliate case splitting in premises.
11430 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11431 in HOL, they strip ALL and --> from proved theorems;
11435 New in Isabelle94-8 (May 1997)
11436 ------------------------------
11438 *** General Changes ***
11440 * new utilities to build / run / maintain Isabelle etc. (in parts
11441 still somewhat experimental); old Makefiles etc. still functional;
11443 * new 'Isabelle System Manual';
11445 * INSTALL text, together with ./configure and ./build scripts;
11447 * reimplemented type inference for greater efficiency, better error
11448 messages and clean internal interface;
11450 * prlim command for dealing with lots of subgoals (an easier way of
11451 setting goals_limit);
11456 * supports alternative (named) syntax tables (parser and pretty
11457 printer); internal interface is provided by add_modesyntax(_i);
11459 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11460 be used in conjunction with the Isabelle symbol font; uses the
11461 "symbols" syntax table;
11463 * added token_translation interface (may translate name tokens in
11464 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11465 the current print_mode); IMPORTANT: user print translation functions
11466 are responsible for marking newly introduced bounds
11467 (Syntax.mark_boundT);
11469 * token translations for modes "xterm" and "xterm_color" that display
11470 names in bold, underline etc. or colors (which requires a color
11473 * infixes may now be declared with names independent of their syntax;
11475 * added typed_print_translation (like print_translation, but may
11476 access type of constant);
11479 *** Classical Reasoner ***
11481 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11482 some limitations. Blast_tac...
11483 + ignores addss, addbefore, addafter; this restriction is intrinsic
11484 + ignores elimination rules that don't have the correct format
11485 (the conclusion MUST be a formula variable)
11486 + ignores types, which can make HOL proofs fail
11487 + rules must not require higher-order unification, e.g. apply_type in ZF
11488 [message "Function Var's argument not a bound variable" relates to this]
11489 + its proof strategy is more general but can actually be slower
11491 * substitution with equality assumptions no longer permutes other
11494 * minor changes in semantics of addafter (now called addaltern); renamed
11495 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11496 (and access functions for it);
11498 * improved combination of classical reasoner and simplifier:
11499 + functions for handling clasimpsets
11500 + improvement of addss: now the simplifier is called _after_ the
11502 + safe variant of addss called addSss: uses safe simplifications
11503 _during_ the safe steps. It is more complete as it allows multiple
11504 instantiations of unknowns (e.g. with slow_tac).
11508 * added interface for simplification procedures (functions that
11509 produce *proven* rewrite rules on the fly, depending on current
11512 * ordering on terms as parameter (used for ordered rewriting);
11514 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11516 * the solver is now split into a safe and an unsafe part.
11517 This should be invisible for the normal user, except that the
11518 functions setsolver and addsolver have been renamed to setSolver and
11519 addSolver; added safe_asm_full_simp_tac;
11524 * a generic induction tactic `induct_tac' which works for all datatypes and
11525 also for type `nat';
11527 * a generic case distinction tactic `exhaust_tac' which works for all
11528 datatypes and also for type `nat';
11530 * each datatype comes with a function `size';
11532 * patterns in case expressions allow tuple patterns as arguments to
11533 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11535 * primrec now also works with type nat;
11537 * recdef: a new declaration form, allows general recursive functions to be
11538 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11540 * the constant for negation has been renamed from "not" to "Not" to
11541 harmonize with FOL, ZF, LK, etc.;
11543 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11546 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11548 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11549 problems in commutative rings, using axiomatic type classes for + and *;
11551 * more examples in HOL/MiniML and HOL/Auth;
11553 * more default rewrite rules for quantifiers, union/intersection;
11555 * a new constant `arbitrary == @x.False';
11557 * HOLCF/IOA replaces old HOL/IOA;
11559 * HOLCF changes: derived all rules and arities
11560 + axiomatic type classes instead of classes
11561 + typedef instead of faking type definitions
11562 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11563 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11564 + eliminated the types void, one, tr
11565 + use unit lift and bool lift (with translations) instead of one and tr
11566 + eliminated blift from Lift3.thy (use Def instead of blift)
11567 all eliminated rules are derived as theorems --> no visible changes ;
11572 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11573 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11574 as ZF_cs addSIs [equalityI];
11578 New in Isabelle94-7 (November 96)
11579 ---------------------------------
11581 * allowing negative levels (as offsets) in prlev and choplev;
11583 * super-linear speedup for large simplifications;
11585 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11586 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11587 FAIL); can suppress it using the command Delsimps (ex_simps @
11588 all_simps); De Morgan laws are also now included, by default;
11590 * improved printing of ==> : ~:
11592 * new object-logic "Sequents" adds linear logic, while replacing LK
11593 and Modal (thanks to Sara Kalvala);
11595 * HOL/Auth: correctness proofs for authentication protocols;
11597 * HOL: new auto_tac combines rewriting and classical reasoning (many
11598 examples on HOL/Auth);
11600 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11601 the rewriter and classical reasoner simultaneously;
11603 * function uresult no longer returns theorems in "standard" format;
11604 regain previous version by: val uresult = standard o uresult;
11608 New in Isabelle94-6
11609 -------------------
11611 * oracles -- these establish an interface between Isabelle and trusted
11612 external reasoners, which may deliver results as theorems;
11614 * proof objects (in particular record all uses of oracles);
11616 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11618 * "constdefs" section in theory files;
11620 * "primrec" section (HOL) no longer requires names;
11622 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11626 New in Isabelle94-5
11627 -------------------
11629 * reduced space requirements;
11631 * automatic HTML generation from theories;
11633 * theory files no longer require "..." (quotes) around most types;
11635 * new examples, including two proofs of the Church-Rosser theorem;
11637 * non-curried (1994) version of HOL is no longer distributed;
11641 New in Isabelle94-4
11642 -------------------
11644 * greatly reduced space requirements;
11646 * theory files (.thy) no longer require \...\ escapes at line breaks;
11648 * searchable theorem database (see the section "Retrieving theorems" on
11649 page 8 of the Reference Manual);
11651 * new examples, including Grabczewski's monumental case study of the
11654 * The previous version of HOL renamed to Old_HOL;
11656 * The new version of HOL (previously called CHOL) uses a curried syntax
11657 for functions. Application looks like f a b instead of f(a,b);
11659 * Mutually recursive inductive definitions finally work in HOL;
11661 * In ZF, pattern-matching on tuples is now available in all abstractions and
11662 translates to the operator "split";
11666 New in Isabelle94-3
11667 -------------------
11669 * new infix operator, addss, allowing the classical reasoner to
11670 perform simplification at each step of its search. Example:
11671 fast_tac (cs addss ss)
11673 * a new logic, CHOL, the same as HOL, but with a curried syntax
11674 for functions. Application looks like f a b instead of f(a,b). Also pairs
11675 look like (a,b) instead of <a,b>;
11677 * PLEASE NOTE: CHOL will eventually replace HOL!
11679 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11680 It translates to the operator "split". A new theory of integers is available;
11682 * In ZF, integer numerals now denote two's-complement binary integers.
11683 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11685 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11686 of the Axiom of Choice;
11690 New in Isabelle94-2
11691 -------------------
11693 * Significantly faster resolution;
11695 * the different sections in a .thy file can now be mixed and repeated
11698 * Database of theorems for FOL, HOL and ZF. New
11699 commands including qed, qed_goal and bind_thm store theorems in the database.
11701 * Simple database queries: return a named theorem (get_thm) or all theorems of
11702 a given theory (thms_of), or find out what theory a theorem was proved in
11705 * Bugs fixed in the inductive definition and datatype packages;
11707 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11708 and HOL_dup_cs obsolete;
11710 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11713 * Simpler definition of function space in ZF;
11715 * new results about cardinal and ordinal arithmetic in ZF;
11717 * 'subtype' facility in HOL for introducing new types as subsets of existing
11720 :mode=isabelle-news:wrap=hard:maxLineLen=72: