1 Isabelle NEWS -- history of user-relevant changes
2 =================================================
4 New in Isabelle2014 (August 2014)
5 ---------------------------------
9 * Support for official Standard ML within the Isabelle context.
10 Command 'SML_file' reads and evaluates the given Standard ML file.
11 Toplevel bindings are stored within the theory context; the initial
12 environment is restricted to the Standard ML implementation of
13 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'
14 and 'SML_export' allow to exchange toplevel bindings between the two
15 separate environments. See also ~~/src/Tools/SML/Examples.thy for
18 * Standard tactics and proof methods such as "clarsimp", "auto" and
19 "safe" now preserve equality hypotheses "x = expr" where x is a free
20 variable. Locale assumptions and chained facts containing "x"
21 continue to be useful. The new method "hypsubst_thin" and the
22 configuration option "hypsubst_thin" (within the attribute name space)
23 restore the previous behavior. INCOMPATIBILITY, especially where
24 induction is done after these methods or when the names of free and
25 bound variables clash. As first approximation, old proofs may be
26 repaired by "using [[hypsubst_thin = true]]" in the critical spot.
28 * More static checking of proof methods, which allows the system to
29 form a closure over the concrete syntax. Method arguments should be
30 processed in the original proof context as far as possible, before
31 operating on the goal state. In any case, the standard discipline for
32 subgoal-addressing needs to be observed: no subgoals or a subgoal
33 number that is out of range produces an empty result sequence, not an
34 exception. Potential INCOMPATIBILITY for non-conformant tactical
37 * Lexical syntax (inner and outer) supports text cartouches with
38 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
39 supports input via ` (backquote).
41 * The outer syntax categories "text" (for formal comments and document
42 markup commands) and "altstring" (for literal fact references) allow
43 cartouches as well, in addition to the traditional mix of quotations.
45 * Syntax of document antiquotation @{rail} now uses \<newline> instead
46 of "\\", to avoid the optical illusion of escaped backslash within
47 string token. General renovation of its syntax using text cartouches.
48 Minor INCOMPATIBILITY.
50 * Discontinued legacy_isub_isup, which was a temporary workaround for
51 Isabelle/ML in Isabelle2013-1. The prover process no longer accepts
52 old identifier syntax with \<^isub> or \<^isup>. Potential
55 * Document antiquotation @{url} produces markup for the given URL,
56 which results in an active hyperlink within the text.
58 * Document antiquotation @{file_unchecked} is like @{file}, but does
59 not check existence within the file-system.
61 * Updated and extended manuals: codegen, datatypes, implementation,
62 isar-ref, jedit, system.
65 *** Prover IDE -- Isabelle/Scala/jEdit ***
67 * Improved Document panel: simplified interaction where every single
68 mouse click (re)opens document via desktop environment or as jEdit
71 * Support for Navigator plugin (with toolbar buttons), with connection
74 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
75 Open text buffers take precedence over copies within the file-system.
77 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
80 * Improved syntactic and semantic completion mechanism, with simple
81 templates, completion language context, name-space completion,
82 file-name completion, spell-checker completion.
84 * Refined GUI popup for completion: more robust key/mouse event
85 handling and propagation to enclosing text area -- avoid loosing
86 keystrokes with slow / remote graphics displays.
88 * Refined insertion of completion items wrt. jEdit text: multiple
89 selections, rectangular selections, rectangular selection as "tall
92 * Integrated spell-checker for document text, comments etc. with
93 completion popup and context-menu.
95 * More general "Query" panel supersedes "Find" panel, with GUI access
96 to commands 'find_theorems' and 'find_consts', as well as print
97 operations for the context. Minor incompatibility in keyboard
98 shortcuts etc.: replace action isabelle-find by isabelle-query.
100 * Search field for all output panels ("Output", "Query", "Info" etc.)
101 to highlight text via regular expression.
103 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
104 General") allows to specify additional print modes for the prover
105 process, without requiring old-fashioned command-line invocation of
106 "isabelle jedit -m MODE".
108 * More support for remote files (e.g. http) using standard Java
109 networking operations instead of jEdit virtual file-systems.
111 * Empty editors buffers that are no longer required (e.g.\ via theory
112 imports) are automatically removed from the document model.
114 * Improved Console/Scala plugin: more uniform scala.Console output,
115 more robust treatment of threads and interrupts.
117 * Improved management of dockable windows: clarified keyboard focus
118 and window placement wrt. main editor view; optional menu item to
119 "Detach" a copy where this makes sense.
121 * New Simplifier Trace panel provides an interactive view of the
122 simplification process, enabled by the "simp_trace_new" attribute
128 * Low-level type-class commands 'classes', 'classrel', 'arities' have
129 been discontinued to avoid the danger of non-trivial axiomatization
130 that is not immediately visible. INCOMPATIBILITY, use regular
131 'instance' command with proof. The required OFCLASS(...) theorem
132 might be postulated via 'axiomatization' beforehand, or the proof
133 finished trivially if the underlying class definition is made vacuous
134 (without any assumptions). See also Isabelle/ML operations
135 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
136 Axclass.arity_axiomatization.
138 * Basic constants of Pure use more conventional names and are always
139 qualified. Rare INCOMPATIBILITY, but with potentially serious
140 consequences, notably for tools in Isabelle/ML. The following
141 renaming needs to be applied:
147 dummy_pattern ~> Pure.dummy_pattern
149 Systematic porting works by using the following theory setup on a
150 *previous* Isabelle version to introduce the new name accesses for the
156 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
157 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
158 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
159 |> Sign.restore_naming thy
162 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
163 Later the application is moved to the current Isabelle version, and
164 the auxiliary aliases are deleted.
166 * Attributes "where" and "of" allow an optional context of local
167 variables ('for' declaration): these variables become schematic in the
168 instantiated theorem.
170 * Obsolete attribute "standard" has been discontinued (legacy since
171 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
172 where instantiations with schematic variables are intended (for
173 declaration commands like 'lemmas' or attributes like "of"). The
174 following temporary definition may help to port old applications:
176 attribute_setup standard =
177 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
179 * More thorough check of proof context for goal statements and
180 attributed fact expressions (concerning background theory, declared
181 hyps). Potential INCOMPATIBILITY, tools need to observe standard
182 context discipline. See also Assumption.add_assumes and the more
183 primitive Thm.assume_hyps.
185 * Inner syntax token language allows regular quoted strings "..."
186 (only makes sense in practice, if outer syntax is delimited
187 differently, e.g. via cartouches).
189 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
190 but the latter is retained some time as Proof General legacy.
192 * Code generator preprocessor: explicit control of simp tracing on a
193 per-constant basis. See attribute "code_preproc".
198 * Code generator: enforce case of identifiers only for strict target
199 language requirements. INCOMPATIBILITY.
201 * Code generator: explicit proof contexts in many ML interfaces.
204 * Code generator: minimize exported identifiers by default. Minor
207 * Code generation for SML and OCaml: dropped arcane "no_signatures"
208 option. Minor INCOMPATIBILITY.
210 * "declare [[code abort: ...]]" replaces "code_abort ...".
213 * "declare [[code drop: ...]]" drops all code equations associated
214 with the given constants.
216 * Code generations are provided for make, fields, extend and truncate
217 operations on records.
219 * Command and antiquotation "value" are now hardcoded against nbe and
220 ML. Minor INCOMPATIBILITY.
222 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
224 * The symbol "\<newline>" may be used within char or string literals
225 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
227 * Qualified String.implode and String.explode. INCOMPATIBILITY.
229 * Simplifier: Enhanced solver of preconditions of rewrite rules can
230 now deal with conjunctions. For help with converting proofs, the old
231 behaviour of the simplifier can be restored like this: declare/using
232 [[simp_legacy_precond]]. This configuration option will disappear
233 again in the future. INCOMPATIBILITY.
235 * Simproc "finite_Collect" is no longer enabled by default, due to
236 spurious crashes and other surprises. Potential INCOMPATIBILITY.
238 * Moved new (co)datatype package and its dependencies from session
239 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
240 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
241 part of theory "Main".
244 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
245 Library/Wfrec.thy ~> Wfrec.thy
246 Library/Zorn.thy ~> Zorn.thy
247 Cardinals/Order_Relation.thy ~> Order_Relation.thy
248 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
249 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
250 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
251 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
252 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
253 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
254 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
255 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
256 BNF/BNF_Comp.thy ~> BNF_Comp.thy
257 BNF/BNF_Def.thy ~> BNF_Def.thy
258 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
259 BNF/BNF_GFP.thy ~> BNF_GFP.thy
260 BNF/BNF_LFP.thy ~> BNF_LFP.thy
261 BNF/BNF_Util.thy ~> BNF_Util.thy
262 BNF/Coinduction.thy ~> Coinduction.thy
263 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
264 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
265 BNF/Examples/* ~> BNF_Examples/*
268 Wellorder_Extension.thy (split from Zorn.thy)
269 Library/Cardinal_Notations.thy
270 Library/BNF_Axomatization.thy
271 BNF_Examples/Misc_Primcorec.thy
272 BNF_Examples/Stream_Processor.thy
274 Discontinued theories:
276 BNF/Equiv_Relations_More.thy
280 * New (co)datatype package:
281 - Command 'primcorec' is fully implemented.
282 - Command 'datatype_new' generates size functions ("size_xxx" and
283 "size") as required by 'fun'.
284 - BNFs are integrated with the Lifting tool and new-style
285 (co)datatypes with Transfer.
287 datatype_new_compat ~> datatype_compat
288 primrec_new ~> primrec
289 wrap_free_constructors ~> free_constructors
291 - The generated constants "xxx_case" and "xxx_rec" have been renamed
292 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
294 - The constant "xxx_(un)fold" and related theorems are no longer
295 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
298 - No discriminators are generated for nullary constructors by
299 default, eliminating the need for the odd "=:" syntax.
301 - No discriminators or selectors are generated by default by
302 "datatype_new", unless custom names are specified or the new
303 "discs_sels" option is passed.
306 * Old datatype package:
307 - The generated theorems "xxx.cases" and "xxx.recs" have been
308 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
309 "sum.case"). INCOMPATIBILITY.
310 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
311 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
312 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
314 * The types "'a list" and "'a option", their set and map functions,
315 their relators, and their selectors are now produced using the new
316 BNF-based datatype package.
319 Option.set ~> set_option
320 Option.map ~> map_option
321 option_rel ~> rel_option
324 set_def ~> set_rec[abs_def]
325 map_def ~> map_rec[abs_def]
326 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
327 option.recs ~> option.rec
328 list_all2_def ~> list_all2_iff
329 set.simps ~> set_simps (or the slightly different "list.set")
330 map.simps ~> list.map
331 hd.simps ~> list.sel(1)
332 tl.simps ~> list.sel(2-3)
333 the.simps ~> option.sel
337 * The following map functions and relators have been renamed:
344 filter_rel ~> rel_filter
345 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
346 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
347 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
351 * New internal SAT solver "cdclite" that produces models and proof
352 traces. This solver replaces the internal SAT solvers "enumerate" and
353 "dpll". Applications that explicitly used one of these two SAT
354 solvers should use "cdclite" instead. In addition, "cdclite" is now
355 the default SAT solver for the "sat" and "satx" proof methods and
356 corresponding tactics; the old default can be restored using "declare
357 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
359 * SMT module: A new version of the SMT module, temporarily called
360 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
361 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
362 supported as oracles. Yices is no longer supported, because no version
363 of the solver can handle both SMT-LIB 2 and quantifiers.
365 * Activation of Z3 now works via "z3_non_commercial" system option
366 (without requiring restart), instead of former settings variable
367 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
368 Plugin Options / Isabelle / General.
371 - Z3 can now produce Isar proofs.
373 . New SML-based learning algorithms eliminate the dependency on
374 Python and increase performance and reliability.
375 . MaSh and MeSh are now used by default together with the
376 traditional MePo (Meng-Paulson) relevance filter. To disable
377 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
378 Options / Isabelle / General to "none".
382 isar_compress ~> compress
387 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
390 - Fixed soundness bug whereby mutually recursive datatypes could
391 take infinite values.
392 - Fixed soundness bug with low-level number functions such as
393 "Abs_Integ" and "Rep_Integ".
394 - Removed "std" option.
395 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
398 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
399 (full_types)' instead. INCOMPATIBILITY.
401 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
403 * Adjustion of INF and SUP operations:
404 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
405 - Consolidated theorem names containing INFI and SUPR: have INF and
406 SUP instead uniformly.
407 - More aggressive normalization of expressions involving INF and Inf
409 - INF_image and SUP_image do not unfold composition.
410 - Dropped facts INF_comp, SUP_comp.
411 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
412 simplifier implication in premises. Generalize and replace former
417 * SUP and INF generalized to conditionally_complete_lattice.
419 * Swapped orientation of facts image_comp and vimage_comp:
421 image_compose ~> image_comp [symmetric]
422 image_comp ~> image_comp [symmetric]
423 vimage_compose ~> vimage_comp [symmetric]
424 vimage_comp ~> vimage_comp [symmetric]
428 * Theory reorganization: split of Big_Operators.thy into
429 Groups_Big.thy and Lattices_Big.thy.
431 * Consolidated some facts about big group operators:
433 setsum_0' ~> setsum.neutral
434 setsum_0 ~> setsum.neutral_const
435 setsum_addf ~> setsum.distrib
436 setsum_cartesian_product ~> setsum.cartesian_product
437 setsum_cases ~> setsum.If_cases
438 setsum_commute ~> setsum.commute
439 setsum_cong ~> setsum.cong
440 setsum_delta ~> setsum.delta
441 setsum_delta' ~> setsum.delta'
442 setsum_diff1' ~> setsum.remove
443 setsum_empty ~> setsum.empty
444 setsum_infinite ~> setsum.infinite
445 setsum_insert ~> setsum.insert
446 setsum_inter_restrict'' ~> setsum.inter_filter
447 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
448 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
449 setsum_mono_zero_left ~> setsum.mono_neutral_left
450 setsum_mono_zero_right ~> setsum.mono_neutral_right
451 setsum_reindex ~> setsum.reindex
452 setsum_reindex_cong ~> setsum.reindex_cong
453 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
454 setsum_restrict_set ~> setsum.inter_restrict
455 setsum_Plus ~> setsum.Plus
456 setsum_setsum_restrict ~> setsum.commute_restrict
457 setsum_Sigma ~> setsum.Sigma
458 setsum_subset_diff ~> setsum.subset_diff
459 setsum_Un_disjoint ~> setsum.union_disjoint
460 setsum_UN_disjoint ~> setsum.UNION_disjoint
461 setsum_Un_Int ~> setsum.union_inter
462 setsum_Union_disjoint ~> setsum.Union_disjoint
463 setsum_UNION_zero ~> setsum.Union_comp
464 setsum_Un_zero ~> setsum.union_inter_neutral
465 strong_setprod_cong ~> setprod.strong_cong
466 strong_setsum_cong ~> setsum.strong_cong
467 setprod_1' ~> setprod.neutral
468 setprod_1 ~> setprod.neutral_const
469 setprod_cartesian_product ~> setprod.cartesian_product
470 setprod_cong ~> setprod.cong
471 setprod_delta ~> setprod.delta
472 setprod_delta' ~> setprod.delta'
473 setprod_empty ~> setprod.empty
474 setprod_infinite ~> setprod.infinite
475 setprod_insert ~> setprod.insert
476 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
477 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
478 setprod_mono_one_left ~> setprod.mono_neutral_left
479 setprod_mono_one_right ~> setprod.mono_neutral_right
480 setprod_reindex ~> setprod.reindex
481 setprod_reindex_cong ~> setprod.reindex_cong
482 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
483 setprod_Sigma ~> setprod.Sigma
484 setprod_subset_diff ~> setprod.subset_diff
485 setprod_timesf ~> setprod.distrib
486 setprod_Un2 ~> setprod.union_diff2
487 setprod_Un_disjoint ~> setprod.union_disjoint
488 setprod_UN_disjoint ~> setprod.UNION_disjoint
489 setprod_Un_Int ~> setprod.union_inter
490 setprod_Union_disjoint ~> setprod.Union_disjoint
491 setprod_Un_one ~> setprod.union_inter_neutral
493 Dropped setsum_cong2 (simple variant of setsum.cong).
494 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
495 Dropped setsum_reindex_id, setprod_reindex_id
496 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
500 * Abolished slightly odd global lattice interpretation for min/max.
503 min_max.inf_assoc ~> min.assoc
504 min_max.inf_commute ~> min.commute
505 min_max.inf_left_commute ~> min.left_commute
506 min_max.inf_idem ~> min.idem
507 min_max.inf_left_idem ~> min.left_idem
508 min_max.inf_right_idem ~> min.right_idem
509 min_max.sup_assoc ~> max.assoc
510 min_max.sup_commute ~> max.commute
511 min_max.sup_left_commute ~> max.left_commute
512 min_max.sup_idem ~> max.idem
513 min_max.sup_left_idem ~> max.left_idem
514 min_max.sup_inf_distrib1 ~> max_min_distrib2
515 min_max.sup_inf_distrib2 ~> max_min_distrib1
516 min_max.inf_sup_distrib1 ~> min_max_distrib2
517 min_max.inf_sup_distrib2 ~> min_max_distrib1
518 min_max.distrib ~> min_max_distribs
519 min_max.inf_absorb1 ~> min.absorb1
520 min_max.inf_absorb2 ~> min.absorb2
521 min_max.sup_absorb1 ~> max.absorb1
522 min_max.sup_absorb2 ~> max.absorb2
523 min_max.le_iff_inf ~> min.absorb_iff1
524 min_max.le_iff_sup ~> max.absorb_iff2
525 min_max.inf_le1 ~> min.cobounded1
526 min_max.inf_le2 ~> min.cobounded2
527 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
528 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
529 min_max.le_infI1 ~> min.coboundedI1
530 min_max.le_infI2 ~> min.coboundedI2
531 min_max.le_supI1 ~> max.coboundedI1
532 min_max.le_supI2 ~> max.coboundedI2
533 min_max.less_infI1 ~> min.strict_coboundedI1
534 min_max.less_infI2 ~> min.strict_coboundedI2
535 min_max.less_supI1 ~> max.strict_coboundedI1
536 min_max.less_supI2 ~> max.strict_coboundedI2
537 min_max.inf_mono ~> min.mono
538 min_max.sup_mono ~> max.mono
539 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
540 min_max.le_supI, min_max.sup_least ~> max.boundedI
541 min_max.le_inf_iff ~> min.bounded_iff
542 min_max.le_sup_iff ~> max.bounded_iff
544 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
545 min.left_commute, min.left_idem, max.commute, max.assoc,
546 max.left_commute, max.left_idem directly.
548 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
549 min.cobounded2, max.cobounded1m max.cobounded2 directly.
551 For min_ac or max_ac, prefer more general collection ac_simps.
555 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
556 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
558 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
561 * Fact generalization and consolidation:
562 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
566 * Purely algebraic definition of even. Fact generalization and
568 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
569 even_zero_(nat|int) ~> even_zero
573 * Abolished neg_numeral.
574 - Canonical representation for minus one is "- 1".
575 - Canonical representation for other negative numbers is "- (numeral _)".
576 - When devising rule sets for number calculation, consider the
577 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
578 - HOLogic.dest_number also recognizes numerals in non-canonical forms
579 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
580 - Syntax for negative numerals is mere input syntax.
584 * Reduced name variants for rules on associativity and commutativity:
586 add_assoc ~> add.assoc
587 add_commute ~> add.commute
588 add_left_commute ~> add.left_commute
589 mult_assoc ~> mult.assoc
590 mult_commute ~> mult.commute
591 mult_left_commute ~> mult.left_commute
592 nat_add_assoc ~> add.assoc
593 nat_add_commute ~> add.commute
594 nat_add_left_commute ~> add.left_commute
595 nat_mult_assoc ~> mult.assoc
596 nat_mult_commute ~> mult.commute
597 eq_assoc ~> iff_assoc
598 eq_left_commute ~> iff_left_commute
602 * Fact collections add_ac and mult_ac are considered old-fashioned.
603 Prefer ac_simps instead, or specify rules
604 (add|mult).(assoc|commute|left_commute) individually.
606 * Elimination of fact duplicates:
607 equals_zero_I ~> minus_unique
608 diff_eq_0_iff_eq ~> right_minus_eq
609 nat_infinite ~> infinite_UNIV_nat
610 int_infinite ~> infinite_UNIV_int
614 * Fact name consolidation:
615 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
616 minus_le_self_iff ~> neg_less_eq_nonneg
617 le_minus_self_iff ~> less_eq_neg_nonpos
618 neg_less_nonneg ~> neg_less_pos
619 less_minus_self_iff ~> less_neg_neg [simp]
623 * More simplification rules on unary and binary minus:
624 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
625 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
626 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
627 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
628 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
629 been taken away from fact collections algebra_simps and field_simps.
632 To restore proofs, the following patterns are helpful:
634 a) Arbitrary failing proof not involving "diff_def":
635 Consider simplification with algebra_simps or field_simps.
637 b) Lifting rules from addition to subtraction:
638 Try with "using <rule for addition> of [... "- _" ...]" by simp".
640 c) Simplification with "diff_def": just drop "diff_def".
641 Consider simplification with algebra_simps or field_simps;
642 or the brute way with
643 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
645 * Introduce bdd_above and bdd_below in theory
646 Conditionally_Complete_Lattices, use them instead of explicitly
647 stating boundedness of sets.
649 * ccpo.admissible quantifies only over non-empty chains to allow more
650 syntax-directed proof rules; the case of the empty chain shows up as
651 additional case in fixpoint induction proofs. INCOMPATIBILITY.
653 * Removed and renamed theorems in Series:
654 summable_le ~> suminf_le
655 suminf_le ~> suminf_le_const
656 series_pos_le ~> setsum_le_suminf
657 series_pos_less ~> setsum_less_suminf
658 suminf_ge_zero ~> suminf_nonneg
659 suminf_gt_zero ~> suminf_pos
660 suminf_gt_zero_iff ~> suminf_pos_iff
661 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
662 suminf_0_le ~> suminf_nonneg [rotate]
663 pos_summable ~> summableI_nonneg_bounded
664 ratio_test ~> summable_ratio_test
666 removed series_zero, replaced by sums_finite
668 removed auxiliary lemmas:
670 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
671 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
672 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
673 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
674 summable_convergent_sumr_iff, sumr_diff_mult_const
678 * Replace (F)DERIV syntax by has_derivative:
679 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
681 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
683 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
685 - removed constant isDiff
687 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
690 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
692 - Renamed FDERIV_... lemmas to has_derivative_...
694 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
696 - removed DERIV_intros, has_derivative_eq_intros
698 - introduced derivative_intros and deriative_eq_intros which
699 includes now rules for DERIV, has_derivative and
700 has_vector_derivative.
703 differentiable_def ~> real_differentiable_def
704 differentiableE ~> real_differentiableE
705 fderiv_def ~> has_derivative_at
706 field_fderiv_def ~> field_has_derivative_at
707 isDiff_der ~> differentiable_def
708 deriv_fderiv ~> has_field_derivative_def
709 deriv_def ~> DERIV_def
713 * Include more theorems in continuous_intros. Remove the
714 continuous_on_intros, isCont_intros collections, these facts are now
715 in continuous_intros.
717 * Theorems about complex numbers are now stated only using Re and Im,
718 the Complex constructor is not used anymore. It is possible to use
719 primcorec to defined the behaviour of a complex-valued function.
721 Removed theorems about the Complex constructor from the simpset, they
722 are available as the lemma collection legacy_Complex_simps. This
725 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
727 Instead the reverse direction is supported with
728 Complex_eq: "Complex a b = a + \<i> * b"
730 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
734 complex_Re/Im_zero ~> zero_complex.sel
735 complex_Re/Im_add ~> plus_complex.sel
736 complex_Re/Im_minus ~> uminus_complex.sel
737 complex_Re/Im_diff ~> minus_complex.sel
738 complex_Re/Im_one ~> one_complex.sel
739 complex_Re/Im_mult ~> times_complex.sel
740 complex_Re/Im_inverse ~> inverse_complex.sel
741 complex_Re/Im_scaleR ~> scaleR_complex.sel
742 complex_Re/Im_i ~> ii.sel
743 complex_Re/Im_cnj ~> cnj.sel
746 complex_divide_def ~> divide_complex_def
747 complex_norm_def ~> norm_complex_def
748 cmod_def ~> norm_complex_de
762 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
763 Conditionally_Complete_Lattices. INCOMPATIBILITY.
765 * HOL-Library: new theory src/HOL/Library/Tree.thy.
767 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
768 is subsumed by session Kleene_Algebra in AFP.
770 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
772 * HOL-Word: bit representations prefer type bool over type bit.
776 - Abandoned fact collection "word_arith_alts", which is a duplicate
778 - Dropped first (duplicated) element in fact collections
779 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
780 "uint_word_arith_bintrs".
783 - consolidated the proofs of the binomial theorem
784 - the function fib is again of type nat => nat and not overloaded
785 - no more references to Old_Number_Theory in the HOL libraries
790 * HOL-Multivariate_Analysis:
791 - Type class ordered_real_vector for ordered vector spaces.
792 - New theory Complex_Basic_Analysis defining complex derivatives,
793 holomorphic functions, etc., ported from HOL Light's canal.ml.
794 - Changed order of ordered_euclidean_space to be compatible with
795 pointwise ordering on products. Therefore instance of
796 conditionally_complete_lattice and ordered_real_vector.
797 INCOMPATIBILITY: use box instead of greaterThanLessThan or
798 explicit set-comprehensions with eucl_less for other (half-)open
800 - removed dependencies on type class ordered_euclidean_space with
801 introduction of "cbox" on euclidean_space
804 mem_interval ~> mem_box
805 interval_eq_empty ~> box_eq_empty
806 interval_ne_empty ~> box_ne_empty
807 interval_sing(1) ~> cbox_sing
808 interval_sing(2) ~> box_sing
809 subset_interval_imp ~> subset_box_imp
810 subset_interval ~> subset_box
811 open_interval ~> open_box
812 closed_interval ~> closed_cbox
813 interior_closed_interval ~> interior_cbox
814 bounded_closed_interval ~> bounded_cbox
815 compact_interval ~> compact_cbox
816 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
817 bounded_subset_closed_interval ~> bounded_subset_cbox
818 mem_interval_componentwiseI ~> mem_box_componentwiseI
819 convex_box ~> convex_prod
820 rel_interior_real_interval ~> rel_interior_real_box
821 convex_interval ~> convex_box
822 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
823 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
824 content_closed_interval' ~> content_cbox'
825 elementary_subset_interval ~> elementary_subset_box
826 diameter_closed_interval ~> diameter_cbox
827 frontier_closed_interval ~> frontier_cbox
828 frontier_open_interval ~> frontier_box
829 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
830 closure_open_interval ~> closure_box
831 open_closed_interval_convex ~> open_cbox_convex
832 open_interval_midpoint ~> box_midpoint
833 content_image_affinity_interval ~> content_image_affinity_cbox
834 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
835 bounded_interval ~> bounded_closed_interval + bounded_boxes
837 - respective theorems for intervals over the reals:
838 content_closed_interval + content_cbox
839 has_integral + has_integral_real
840 fine_division_exists + fine_division_exists_real
841 has_integral_null + has_integral_null_real
842 tagged_division_union_interval + tagged_division_union_interval_real
843 has_integral_const + has_integral_const_real
844 integral_const + integral_const_real
845 has_integral_bound + has_integral_bound_real
846 integrable_continuous + integrable_continuous_real
847 integrable_subinterval + integrable_subinterval_real
848 has_integral_reflect_lemma + has_integral_reflect_lemma_real
849 integrable_reflect + integrable_reflect_real
850 integral_reflect + integral_reflect_real
851 image_affinity_interval + image_affinity_cbox
852 image_smult_interval + image_smult_cbox
853 integrable_const + integrable_const_ivl
854 integrable_on_subinterval + integrable_on_subcbox
857 derivative_linear ~> has_derivative_bounded_linear
858 derivative_is_linear ~> has_derivative_linear
859 bounded_linear_imp_linear ~> bounded_linear.linear
862 - Renamed positive_integral to nn_integral:
864 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
865 positive_integral_positive ~> nn_integral_nonneg
867 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
869 - replaced the Lebesgue integral on real numbers by the more general
870 Bochner integral for functions into a real-normed vector space.
872 integral_zero ~> integral_zero / integrable_zero
873 integral_minus ~> integral_minus / integrable_minus
874 integral_add ~> integral_add / integrable_add
875 integral_diff ~> integral_diff / integrable_diff
876 integral_setsum ~> integral_setsum / integrable_setsum
877 integral_multc ~> integral_mult_left / integrable_mult_left
878 integral_cmult ~> integral_mult_right / integrable_mult_right
879 integral_triangle_inequality~> integral_norm_bound
880 integrable_nonneg ~> integrableI_nonneg
881 integral_positive ~> integral_nonneg_AE
882 integrable_abs_iff ~> integrable_abs_cancel
883 positive_integral_lim_INF ~> nn_integral_liminf
884 lebesgue_real_affine ~> lborel_real_affine
885 borel_integral_has_integral ~> has_integral_lebesgue_integral
886 integral_indicator ~>
887 integral_real_indicator / integrable_real_indicator
888 positive_integral_fst ~> nn_integral_fst'
889 positive_integral_fst_measurable ~> nn_integral_fst
890 positive_integral_snd_measurable ~> nn_integral_snd
892 integrable_fst_measurable ~>
893 integral_fst / integrable_fst / AE_integrable_fst
895 integrable_snd_measurable ~>
896 integral_snd / integrable_snd / AE_integrable_snd
898 integral_monotone_convergence ~>
899 integral_monotone_convergence / integrable_monotone_convergence
901 integral_monotone_convergence_at_top ~>
902 integral_monotone_convergence_at_top /
903 integrable_monotone_convergence_at_top
905 has_integral_iff_positive_integral_lebesgue ~>
906 has_integral_iff_has_bochner_integral_lebesgue_nonneg
908 lebesgue_integral_has_integral ~>
909 has_integral_integrable_lebesgue_nonneg
911 positive_integral_lebesgue_has_integral ~>
912 integral_has_integral_lebesgue_nonneg /
913 integrable_has_integral_lebesgue_nonneg
915 lebesgue_integral_real_affine ~>
916 nn_integral_real_affine
918 has_integral_iff_positive_integral_lborel ~>
919 integral_has_integral_nonneg / integrable_has_integral_nonneg
921 The following theorems where removed:
923 lebesgue_integral_nonneg
924 lebesgue_integral_uminus
925 lebesgue_integral_cmult
926 lebesgue_integral_multc
927 lebesgue_integral_cmult_nonneg
928 integral_cmul_indicator
931 - Formalized properties about exponentially, Erlang, and normal
932 distributed random variables.
934 * HOL-Decision_Procs: Separate command 'approximate' for approximative
935 computation in src/HOL/Decision_Procs/Approximation. Minor
941 * The signature and semantics of Document.Snapshot.cumulate_markup /
942 select_markup have been clarified. Markup is now traversed in the
943 order of reports given by the prover: later markup is usually more
944 specific and may override results accumulated so far. The elements
945 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
947 * Substantial reworking of internal PIDE protocol communication
948 channels. INCOMPATIBILITY.
953 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
954 compared (according to Thm.thm_ord), but assumed to be covered by the
955 current background theory. Thus equivalent data produced in different
956 branches of the theory graph usually coincides (e.g. relevant for
957 theory merge). Note that the softer Thm.eq_thm_prop is often more
958 appropriate than Thm.eq_thm.
960 * Proper context for basic Simplifier operations: rewrite_rule,
961 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
962 pass runtime Proof.context (and ensure that the simplified entity
963 actually belongs to it).
965 * Proper context discipline for read_instantiate and instantiate_tac:
966 variables that are meant to become schematic need to be given as
967 fixed, and are generalized by the explicit context of local variables.
968 This corresponds to Isar attributes "where" and "of" with 'for'
969 declaration. INCOMPATIBILITY, also due to potential change of indices
970 of schematic variables.
972 * Moved ML_Compiler.exn_trace and other operations on exceptions to
973 structure Runtime. Minor INCOMPATIBILITY.
975 * Discontinued old Toplevel.debug in favour of system option
976 "ML_exception_trace", which may be also declared within the context
977 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
979 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
982 * Configuration option "ML_print_depth" controls the pretty-printing
983 depth of the ML compiler within the context. The old print_depth in
984 ML is still available as default_print_depth, but rarely used. Minor
987 * Toplevel function "use" refers to raw ML bootstrap environment,
988 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
989 Note that 'ML_file' is the canonical command to load ML files into the
992 * Simplified programming interface to define ML antiquotations, see
993 structure ML_Antiquotation. Minor INCOMPATIBILITY.
995 * ML antiquotation @{here} refers to its source position, which is
996 occasionally useful for experimentation and diagnostic purposes.
998 * ML antiquotation @{path} produces a Path.T value, similarly to
999 Path.explode, but with compile-time check against the file-system and
1000 some PIDE markup. Note that unlike theory source, ML does not have a
1001 well-defined master directory, so an absolute symbolic path
1002 specification is usually required, e.g. "~~/src/HOL".
1004 * ML antiquotation @{print} inlines a function to print an arbitrary
1005 ML value, which is occasionally useful for diagnostic or demonstration
1011 * Proof General with its traditional helper scripts is now an optional
1012 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
1013 component repository http://isabelle.in.tum.de/components/. Note that
1014 the "system" manual provides general explanations about add-on
1015 components, especially those that are not bundled with the release.
1017 * The raw Isabelle process executable has been renamed from
1018 "isabelle-process" to "isabelle_process", which conforms to common
1019 shell naming conventions, and allows to define a shell function within
1020 the Isabelle environment to avoid dynamic path lookup. Rare
1021 incompatibility for old tools that do not use the ISABELLE_PROCESS
1024 * Former "isabelle tty" has been superseded by "isabelle console",
1025 with implicit build like "isabelle jedit", and without the mostly
1026 obsolete Isar TTY loop.
1028 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
1029 and PDF_VIEWER now refer to the actual programs, not shell
1030 command-lines. Discontinued option -c: invocation may be asynchronous
1031 via desktop environment, without any special precautions. Potential
1032 INCOMPATIBILITY with ambitious private settings.
1034 * Removed obsolete "isabelle unsymbolize". Note that the usual format
1035 for email communication is the Unicode rendering of Isabelle symbols,
1036 as produced by Isabelle/jEdit, for example.
1038 * Removed obsolete tool "wwwfind". Similar functionality may be
1039 integrated into Isabelle/jEdit eventually.
1041 * Improved 'display_drafts' concerning desktop integration and
1042 repeated invocation in PIDE front-end: re-use single file
1043 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1045 * Session ROOT specifications require explicit 'document_files' for
1046 robust dependencies on LaTeX sources. Only these explicitly given
1047 files are copied to the document output directory, before document
1048 processing is started.
1050 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1051 of TeX Live from Cygwin.
1055 New in Isabelle2013-2 (December 2013)
1056 -------------------------------------
1058 *** Prover IDE -- Isabelle/Scala/jEdit ***
1060 * More robust editing of running commands with internal forks,
1061 e.g. non-terminating 'by' steps.
1063 * More relaxed Sledgehammer panel: avoid repeated application of query
1064 after edits surrounding the command location.
1066 * More status information about commands that are interrupted
1067 accidentally (via physical event or Poly/ML runtime system signal,
1068 e.g. out-of-memory).
1073 * More robust termination of external processes managed by
1074 Isabelle/ML: support cancellation of tasks within the range of
1075 milliseconds, as required for PIDE document editing with automatically
1076 tried tools (e.g. Sledgehammer).
1078 * Reactivated Isabelle/Scala kill command for external processes on
1079 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1080 workaround for some Debian/Ubuntu Linux versions from 2013.
1084 New in Isabelle2013-1 (November 2013)
1085 -------------------------------------
1089 * Discontinued obsolete 'uses' within theory header. Note that
1090 commands like 'ML_file' work without separate declaration of file
1091 dependencies. Minor INCOMPATIBILITY.
1093 * Discontinued redundant 'use' command, which was superseded by
1094 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1096 * Simplified subscripts within identifiers, using plain \<^sub>
1097 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1098 only for literal tokens within notation; explicit mixfix annotations
1099 for consts or fixed variables may be used as fall-back for unusual
1100 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1101 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1102 standardize symbols as a starting point for further manual cleanup.
1103 The ML reference variable "legacy_isub_isup" may be set as temporary
1104 workaround, to make the prover accept a subset of the old identifier
1107 * Document antiquotations: term style "isub" has been renamed to
1108 "sub". Minor INCOMPATIBILITY.
1110 * Uniform management of "quick_and_dirty" as system option (see also
1111 "isabelle options"), configuration option within the context (see also
1112 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1113 INCOMPATIBILITY, need to use more official Isabelle means to access
1114 quick_and_dirty, instead of historical poking into mutable reference.
1116 * Renamed command 'print_configs' to 'print_options'. Minor
1119 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1120 implicit change of some global references) is retained for now as
1121 control command, e.g. for ProofGeneral 3.7.x.
1123 * Discontinued 'print_drafts' command with its old-fashioned PS output
1124 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1125 'display_drafts' instead and print via the regular document viewer.
1127 * Updated and extended "isar-ref" and "implementation" manual,
1128 eliminated old "ref" manual.
1131 *** Prover IDE -- Isabelle/Scala/jEdit ***
1133 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1134 Documentation panel.
1136 * Dockable window "Documentation" provides access to Isabelle
1139 * Dockable window "Find" provides query operations for formal entities
1140 (GUI front-end to 'find_theorems' command).
1142 * Dockable window "Sledgehammer" manages asynchronous / parallel
1143 sledgehammer runs over existing document sources, independently of
1144 normal editing and checking process.
1146 * Dockable window "Timing" provides an overview of relevant command
1147 timing information, depending on option jedit_timing_threshold. The
1148 same timing information is shown in the extended tooltip of the
1149 command keyword, when hovering the mouse over it while the CONTROL or
1150 COMMAND modifier is pressed.
1152 * Improved dockable window "Theories": Continuous checking of proof
1153 document (visible and required parts) may be controlled explicitly,
1154 using check box or shortcut "C+e ENTER". Individual theory nodes may
1155 be marked explicitly as required and checked in full, using check box
1156 or shortcut "C+e SPACE".
1158 * Improved completion mechanism, which is now managed by the
1159 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1160 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1162 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1163 isabelle.complete for explicit completion in Isabelle sources.
1164 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1165 to resolve conflict.
1167 * Improved support of various "minor modes" for Isabelle NEWS,
1168 options, session ROOT etc., with completion and SideKick tree view.
1170 * Strictly monotonic document update, without premature cancellation of
1171 running transactions that are still needed: avoid reset/restart of
1172 such command executions while editing.
1174 * Support for asynchronous print functions, as overlay to existing
1177 * Support for automatic tools in HOL, which try to prove or disprove
1178 toplevel theorem statements.
1180 * Action isabelle.reset-font-size resets main text area font size
1181 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1182 also "Plugin Options / Isabelle / General"). It can be bound to some
1183 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1185 * File specifications in jEdit (e.g. file browser) may refer to
1186 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1187 obsolete $ISABELLE_HOME_WINDOWS variable.
1189 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1190 / Global Options / Appearance".
1192 * Improved support of native Mac OS X functionality via "MacOSX"
1193 plugin, which is now enabled by default.
1198 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1199 In particular, 'interpretation' allows for non-persistent
1200 interpretation within "context ... begin ... end" blocks offering a
1201 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1204 * Improved locales diagnostic command 'print_dependencies'.
1206 * Discontinued obsolete 'axioms' command, which has been marked as
1207 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1208 instead, while observing its uniform scope for polymorphism.
1210 * Discontinued empty name bindings in 'axiomatization'.
1213 * System option "proofs" has been discontinued. Instead the global
1214 state of Proofterm.proofs is persistently compiled into logic images
1215 as required, notably HOL-Proofs. Users no longer need to change
1216 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1218 * Syntax translation functions (print_translation etc.) always depend
1219 on Proof.context. Discontinued former "(advanced)" option -- this is
1220 now the default. Minor INCOMPATIBILITY.
1222 * Former global reference trace_unify_fail is now available as
1223 configuration option "unify_trace_failure" (global context only).
1225 * SELECT_GOAL now retains the syntactic context of the overall goal
1226 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1232 * Stronger precedence of syntax for big intersection and union on
1233 sets, in accordance with corresponding lattice operations.
1236 * Notation "{p:A. P}" now allows tuple patterns as well.
1238 * Nested case expressions are now translated in a separate check phase
1239 rather than during parsing. The data for case combinators is separated
1240 from the datatype package. The declaration attribute
1241 "case_translation" can be used to register new case combinators:
1243 declare [[case_translation case_combinator constructor1 ... constructorN]]
1246 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1248 - 'code_identifier' declares name hints for arbitrary identifiers in
1249 generated code, subsuming 'code_modulename'.
1251 See the isar-ref manual for syntax diagrams, and the HOL theories for
1254 * Attibute 'code': 'code' now declares concrete and abstract code
1255 equations uniformly. Use explicit 'code equation' and 'code abstract'
1256 to distinguish both when desired.
1258 * Discontinued theories Code_Integer and Efficient_Nat by a more
1259 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1260 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1261 generation for details. INCOMPATIBILITY.
1263 * Numeric types are mapped by default to target language numerals:
1264 natural (replaces former code_numeral) and integer (replaces former
1265 code_int). Conversions are available as integer_of_natural /
1266 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1267 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1268 ML). INCOMPATIBILITY.
1270 * Function package: For mutually recursive functions f and g, separate
1271 cases rules f.cases and g.cases are generated instead of unusable
1272 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1273 in the case that the unusable rule was used nevertheless.
1275 * Function package: For each function f, new rules f.elims are
1276 generated, which eliminate equalities of the form "f x = t".
1278 * New command 'fun_cases' derives ad-hoc elimination rules for
1279 function equations as simplified instances of f.elims, analogous to
1280 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1283 - parametrized correspondence relations are now supported:
1284 + parametricity theorems for the raw term can be specified in
1285 the command lift_definition, which allow us to generate stronger
1287 + setup_lifting generates stronger transfer rules if parametric
1288 correspondence relation can be generated
1289 + various new properties of the relator must be specified to support
1291 + parametricity theorem for the Quotient relation can be specified
1292 - setup_lifting generates domain rules for the Transfer package
1293 - stronger reflexivity prover of respectfulness theorems for type
1295 - ===> and --> are now local. The symbols can be introduced
1296 by interpreting the locale lifting_syntax (typically in an
1298 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1299 Main. Potential INCOMPATIBILITY
1300 - new commands for restoring and deleting Lifting/Transfer context:
1301 lifting_forget, lifting_update
1302 - the command print_quotmaps was renamed to print_quot_maps.
1306 - better support for domains in Transfer: replace Domainp T
1307 by the actual invariant in a transferred goal
1308 - transfer rules can have as assumptions other transfer rules
1309 - Experimental support for transferring from the raw level to the
1310 abstract level: Transfer.transferred attribute
1311 - Attribute version of the transfer method: untransferred attribute
1313 * Reification and reflection:
1314 - Reification is now directly available in HOL-Main in structure
1316 - Reflection now handles multiple lists with variables also.
1317 - The whole reflection stack has been decomposed into conversions.
1320 * Revised devices for recursive definitions over finite sets:
1321 - Only one fundamental fold combinator on finite set remains:
1322 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1323 This is now identity on infinite sets.
1324 - Locales ("mini packages") for fundamental definitions with
1325 Finite_Set.fold: folding, folding_idem.
1326 - Locales comm_monoid_set, semilattice_order_set and
1327 semilattice_neutr_order_set for big operators on sets.
1328 See theory Big_Operators for canonical examples.
1329 Note that foundational constants comm_monoid_set.F and
1330 semilattice_set.F correspond to former combinators fold_image
1331 and fold1 respectively. These are now gone. You may use
1332 those foundational constants as substitutes, but it is
1333 preferable to interpret the above locales accordingly.
1334 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1335 no longer needed in connection with Finite_Set.fold etc.)
1337 card.union_inter ~> card_Un_Int [symmetric]
1338 card.union_disjoint ~> card_Un_disjoint
1341 * Locale hierarchy for abstract orderings and (semi)lattices.
1343 * Complete_Partial_Order.admissible is defined outside the type class
1344 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1345 class predicate assumption or sort constraint when possible.
1348 * Introduce type class "conditionally_complete_lattice": Like a
1349 complete lattice but does not assume the existence of the top and
1350 bottom elements. Allows to generalize some lemmas about reals and
1351 extended reals. Removed SupInf and replaced it by the instantiation
1352 of conditionally_complete_lattice for real. Renamed lemmas about
1353 conditionally-complete lattice from Sup_... to cSup_... and from
1354 Inf_... to cInf_... to avoid hidding of similar complete lattice
1357 * Introduce type class linear_continuum as combination of
1358 conditionally-complete lattices and inner dense linorders which have
1359 more than one element. INCOMPATIBILITY.
1361 * Introduced type classes order_top and order_bot. The old classes top
1362 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1363 Rename bot -> order_bot, top -> order_top
1365 * Introduce type classes "no_top" and "no_bot" for orderings without
1366 top and bottom elements.
1368 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1370 * Complex_Main: Unify and move various concepts from
1371 HOL-Multivariate_Analysis to HOL-Complex_Main.
1373 - Introduce type class (lin)order_topology and
1374 linear_continuum_topology. Allows to generalize theorems about
1375 limits and order. Instances are reals and extended reals.
1377 - continuous and continuos_on from Multivariate_Analysis:
1378 "continuous" is the continuity of a function at a filter. "isCont"
1379 is now an abbrevitation: "isCont x f == continuous (at _) f".
1381 Generalized continuity lemmas from isCont to continuous on an
1384 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1385 compactness of closed intervals on reals. Continuous functions
1386 attain infimum and supremum on compact sets. The inverse of a
1387 continuous function is continuous, when the function is continuous
1390 - connected from Multivariate_Analysis. Use it to prove the
1391 intermediate value theorem. Show connectedness of intervals on
1392 linear_continuum_topology).
1394 - first_countable_topology from Multivariate_Analysis. Is used to
1395 show equivalence of properties on the neighbourhood filter of x and
1396 on all sequences converging to x.
1398 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1399 theorems from Library/FDERIV.thy to Deriv.thy and base the
1400 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1401 which are restricted to sets, i.e. to represent derivatives from
1404 - Removed the within-filter. It is replaced by the principal filter:
1406 F within X = inf F (principal X)
1408 - Introduce "at x within U" as a single constant, "at x" is now an
1409 abbreviation for "at x within UNIV"
1411 - Introduce named theorem collections tendsto_intros,
1412 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1413 in tendsto_intros (or FDERIV_intros) are also available as
1414 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1415 is replaced by a congruence rule. This allows to apply them as
1416 intro rules and then proving equivalence by the simplifier.
1418 - Restructured theories in HOL-Complex_Main:
1420 + Moved RealDef and RComplete into Real
1422 + Introduced Topological_Spaces and moved theorems about
1423 topological spaces, filters, limits and continuity to it
1425 + Renamed RealVector to Real_Vector_Spaces
1427 + Split Lim, SEQ, Series into Topological_Spaces,
1428 Real_Vector_Spaces, and Limits
1430 + Moved Ln and Log to Transcendental
1432 + Moved theorems about continuity from Deriv to Topological_Spaces
1434 - Remove various auxiliary lemmas.
1439 - Added option "spy".
1440 - Reduce incidence of "too high arity" errors.
1444 isar_shrink ~> isar_compress
1446 - Added options "isar_try0", "spy".
1447 - Better support for "isar_proofs".
1448 - MaSh has been fined-tuned and now runs as a local server.
1450 * Improved support for ad hoc overloading of constants (see also
1451 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1453 * Library/Polynomial.thy:
1454 - Use lifting for primitive definitions.
1455 - Explicit conversions from and to lists of coefficients, used for
1457 - Replaced recursion operator poly_rec by fold_coeffs.
1458 - Prefer pre-existing gcd operation for gcd.
1460 poly_eq_iff ~> poly_eq_poly_eq_iff
1461 poly_ext ~> poly_eqI
1462 expand_poly_eq ~> poly_eq_iff
1465 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1466 case_of_simps to convert function definitions between a list of
1467 equations with patterns on the lhs and a single equation with case
1468 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1470 * New Library/FSet.thy: type of finite sets defined as a subtype of
1471 sets defined by Lifting/Transfer.
1473 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1475 * Consolidation of library theories on product orders:
1477 Product_Lattice ~> Product_Order -- pointwise order on products
1478 Product_ord ~> Product_Lexorder -- lexicographic order on products
1482 * Imperative-HOL: The MREC combinator is considered legacy and no
1483 longer included by default. INCOMPATIBILITY, use partial_function
1484 instead, or import theory Legacy_Mrec as a fallback.
1486 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1487 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1488 ~~/src/HOL/Library/Polynomial instead. The latter provides
1489 integration with HOL's type classes for rings. INCOMPATIBILITY.
1492 - Various improvements to BNF-based (co)datatype package, including
1493 new commands "primrec_new", "primcorec", and
1494 "datatype_new_compat", as well as documentation. See
1495 "datatypes.pdf" for details.
1496 - New "coinduction" method to avoid some boilerplate (compared to
1499 data ~> datatype_new
1500 codata ~> codatatype
1502 - Renamed many generated theorems, including
1504 map_comp' ~> map_comp
1514 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1515 "check_property" allows to check specifications of the form "ALL x y
1516 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1517 Examples.thy in particular.
1519 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1520 tracing output in the command transaction context instead of physical
1521 stdout. See also Toplevel.debug, Toplevel.debugging and
1522 ML_Compiler.exn_trace.
1524 * ML type "theory" is now immutable, without any special treatment of
1525 drafts or linear updates (which could lead to "stale theory" errors in
1526 the past). Discontinued obsolete operations like Theory.copy,
1527 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1530 * More uniform naming of goal functions for skipped proofs:
1532 Skip_Proof.prove ~> Goal.prove_sorry
1533 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1535 Minor INCOMPATIBILITY.
1537 * Simplifier tactics and tools use proper Proof.context instead of
1538 historic type simpset. Old-style declarations like addsimps,
1539 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1540 retains its use as snapshot of the main Simplifier context, using
1541 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1542 old tools by making them depend on (ctxt : Proof.context) instead of
1543 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1545 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1546 operate on Proof.context instead of claset, for uniformity with addIs,
1547 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1548 clasets separately from the context.
1550 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1551 INCOMPATIBILITY, use @{context} instead.
1553 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1554 presents the result as initial Proof.context.
1559 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1560 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1562 * Discontinued obsolete isabelle-process options -f and -u (former
1563 administrative aliases of option -e). Minor INCOMPATIBILITY.
1565 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1568 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1569 document formats: dvi.gz, ps, ps.gz -- the default document format is
1572 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1573 specify global resources of the JVM process run by isabelle build.
1575 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1576 to run Isabelle/Scala source files as standalone programs.
1578 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1579 keyword tables): use Isabelle/Scala operations, which inspect outer
1580 syntax without requiring to build sessions first.
1582 * Sessions may be organized via 'chapter' specifications in the ROOT
1583 file, which determines a two-level hierarchy of browser info. The old
1584 tree-like organization via implicit sub-session relation (with its
1585 tendency towards erratic fluctuation of URLs) has been discontinued.
1586 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1587 for HTML presentation of theories.
1591 New in Isabelle2013 (February 2013)
1592 -----------------------------------
1596 * Theorem status about oracles and unfinished/failed future proofs is
1597 no longer printed by default, since it is incompatible with
1598 incremental / parallel checking of the persistent document model. ML
1599 function Thm.peek_status may be used to inspect a snapshot of the
1600 ongoing evaluation process. Note that in batch mode --- notably
1601 isabelle build --- the system ensures that future proofs of all
1602 accessible theorems in the theory context are finished (as before).
1604 * Configuration option show_markup controls direct inlining of markup
1605 into the printed representation of formal entities --- notably type
1606 and sort constraints. This enables Prover IDE users to retrieve that
1607 information via tooltips in the output window, for example.
1609 * Command 'ML_file' evaluates ML text from a file directly within the
1610 theory, without any predeclaration via 'uses' in the theory header.
1612 * Old command 'use' command and corresponding keyword 'uses' in the
1613 theory header are legacy features and will be discontinued soon.
1614 Tools that load their additional source files may imitate the
1615 'ML_file' implementation, such that the system can take care of
1616 dependencies properly.
1618 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1619 is called fastforce / fast_force_tac already since Isabelle2011-1.
1621 * Updated and extended "isar-ref" and "implementation" manual, reduced
1622 remaining material in old "ref" manual.
1624 * Improved support for auxiliary contexts that indicate block structure
1625 for specifications. Nesting of "context fixes ... context assumes ..."
1626 and "class ... context ...".
1628 * Attribute "consumes" allows a negative value as well, which is
1629 interpreted relatively to the total number of premises of the rule in
1630 the target context. This form of declaration is stable when exported
1631 from a nested 'context' with additional assumptions. It is the
1632 preferred form for definitional packages, notably cases/rules produced
1633 in HOL/inductive and HOL/function.
1635 * More informative error messages for Isar proof commands involving
1636 lazy enumerations (method applications etc.).
1638 * Refined 'help' command to retrieve outer syntax commands according
1639 to name patterns (with clickable results).
1642 *** Prover IDE -- Isabelle/Scala/jEdit ***
1644 * Parallel terminal proofs ('by') are enabled by default, likewise
1645 proofs that are built into packages like 'datatype', 'function'. This
1646 allows to "run ahead" checking the theory specifications on the
1647 surface, while the prover is still crunching on internal
1648 justifications. Unfinished / cancelled proofs are restarted as
1649 required to complete full proof checking eventually.
1651 * Improved output panel with tooltips, hyperlinks etc. based on the
1652 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1653 tooltips leads to some window that supports the same recursively,
1654 which can lead to stacks of tooltips as the semantic document content
1655 is explored. ESCAPE closes the whole stack, individual windows may be
1656 closed separately, or detached to become independent jEdit dockables.
1658 * Improved support for commands that produce graph output: the text
1659 message contains a clickable area to open a new instance of the graph
1662 * More robust incremental parsing of outer syntax (partial comments,
1663 malformed symbols). Changing the balance of open/close quotes and
1664 comment delimiters works more conveniently with unfinished situations
1665 that frequently occur in user interaction.
1667 * More efficient painting and improved reactivity when editing large
1668 files. More scalable management of formal document content.
1670 * Smarter handling of tracing messages: prover process pauses after
1671 certain number of messages per command transaction, with some user
1672 dialog to stop or continue. This avoids swamping the front-end with
1673 potentially infinite message streams.
1675 * More plugin options and preferences, based on Isabelle/Scala. The
1676 jEdit plugin option panel provides access to some Isabelle/Scala
1677 options, including tuning parameters for editor reactivity and color
1680 * Dockable window "Symbols" provides some editing support for Isabelle
1683 * Dockable window "Monitor" shows ML runtime statistics. Note that
1684 continuous display of the chart slows down the system.
1686 * Improved editing support for control styles: subscript, superscript,
1687 bold, reset of style -- operating on single symbols or text
1688 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1690 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1691 adjust the main text area font size, and its derivatives for output,
1692 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1693 need to be adapted to local keyboard layouts.
1695 * More reactive completion popup by default: use \t (TAB) instead of
1696 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1697 also "Plugin Options / SideKick / General / Code Completion Options".
1699 * Implicit check and build dialog of the specified logic session
1700 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1701 demand, without bundling big platform-dependent heap images in the
1702 Isabelle distribution.
1704 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1705 from Oracle provide better multi-platform experience. This version is
1706 now bundled exclusively with Isabelle.
1711 * Code generation for Haskell: restrict unqualified imports from
1712 Haskell Prelude to a small set of fundamental operations.
1714 * Command 'export_code': relative file names are interpreted
1715 relatively to master directory of current theory rather than the
1716 rather arbitrary current working directory. INCOMPATIBILITY.
1718 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1719 use regular rule composition via "OF" / "THEN", or explicit proof
1720 structure instead. Note that Isabelle/ML provides a variety of
1721 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1722 with some care where this is really required.
1724 * Command 'typ' supports an additional variant with explicit sort
1725 constraint, to infer and check the most general type conforming to a
1726 given sort. Example (in HOL):
1728 typ "_ * _ * bool * unit" :: finite
1730 * Command 'locale_deps' visualizes all locales and their relations as
1738 - Added MaSh relevance filter based on machine-learning; see the
1739 Sledgehammer manual for details.
1740 - Polished Isar proofs generated with "isar_proofs" option.
1741 - Rationalized type encodings ("type_enc" option).
1742 - Renamed "kill_provers" subcommand to "kill_all".
1744 isar_proof ~> isar_proofs
1745 isar_shrink_factor ~> isar_shrink
1746 max_relevant ~> max_facts
1747 relevance_thresholds ~> fact_thresholds
1749 * Quickcheck: added an optimisation for equality premises. It is
1750 switched on by default, and can be switched off by setting the
1751 configuration quickcheck_optimise_equality to false.
1753 * Quotient: only one quotient can be defined by quotient_type
1757 - generation of an abstraction function equation in lift_definition
1758 - quot_del attribute
1759 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1761 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1764 * Preprocessing of the code generator rewrites set comprehensions into
1765 pointfree expressions.
1767 * The SMT solver Z3 has now by default a restricted set of directly
1768 supported features. For the full set of features (div/mod, nonlinear
1769 arithmetic, datatypes/records) with potential proof reconstruction
1770 failures, enable the configuration option "z3_with_extensions". Minor
1773 * Simplified 'typedef' specifications: historical options for implicit
1774 set definition and alternative name have been discontinued. The
1775 former behavior of "typedef (open) t = A" is now the default, but
1776 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1779 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1780 directly. INCOMPATIBILITY.
1782 * Moved operation product, sublists and n_lists from theory Enum to
1783 List. INCOMPATIBILITY.
1785 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1787 * Class "comm_monoid_diff" formalises properties of bounded
1788 subtraction, with natural numbers and multisets as typical instances.
1790 * Added combinator "Option.these" with type "'a option set => 'a set".
1792 * Theory "Transitive_Closure": renamed lemmas
1794 reflcl_tranclp -> reflclp_tranclp
1795 rtranclp_reflcl -> rtranclp_reflclp
1799 * Theory "Rings": renamed lemmas (in class semiring)
1801 left_distrib ~> distrib_right
1802 right_distrib ~> distrib_left
1806 * Generalized the definition of limits:
1808 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1809 expresses that when the input values x converge to F then the
1810 output f x converges to G.
1812 - Added filters for convergence to positive (at_top) and negative
1815 - Moved infinity in the norm (at_infinity) from
1816 Multivariate_Analysis to Complex_Main.
1818 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1823 * Theory "Library/Option_ord" provides instantiation of option type to
1824 lattice type classes.
1826 * Theory "Library/Multiset": renamed
1828 constant fold_mset ~> Multiset.fold
1829 fact fold_mset_commute ~> fold_mset_comm
1833 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1836 - Renamed constants (and related lemmas)
1839 strict_prefix ~> prefix
1841 - Replaced constant "postfix" by "suffixeq" with swapped argument
1842 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1843 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1844 Renamed lemmas accordingly.
1846 - Added constant "list_hembeq" for homeomorphic embedding on
1847 lists. Added abbreviation "sublisteq" for special case
1848 "list_hembeq (op =)".
1850 - Theory Library/Sublist no longer provides "order" and "bot" type
1851 class instances for the prefix order (merely corresponding locale
1852 interpretations). The type class instances are now in theory
1853 Library/Prefix_Order.
1855 - The sublist relation of theory Library/Sublist_Order is now based
1856 on "Sublist.sublisteq". Renamed lemmas accordingly:
1858 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1859 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1860 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1861 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1862 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1863 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1864 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1865 le_list_drop_many ~> Sublist.sublisteq_drop_many
1866 le_list_filter_left ~> Sublist.sublisteq_filter_left
1867 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1868 le_list_rev_take_iff ~> Sublist.sublisteq_append
1869 le_list_same_length ~> Sublist.sublisteq_same_length
1870 le_list_take_many_iff ~> Sublist.sublisteq_append'
1871 less_eq_list.drop ~> less_eq_list_drop
1872 less_eq_list.induct ~> less_eq_list_induct
1873 not_le_list_length ~> Sublist.not_sublisteq_length
1877 * New theory Library/Countable_Set.
1879 * Theory Library/Debug and Library/Parallel provide debugging and
1880 parallel execution for code generated towards Isabelle/ML.
1882 * Theory Library/FuncSet: Extended support for Pi and extensional and
1883 introduce the extensional dependent function space "PiE". Replaced
1884 extensional_funcset by an abbreviation, and renamed lemmas from
1885 extensional_funcset to PiE as follows:
1887 extensional_empty ~> PiE_empty
1888 extensional_funcset_empty_domain ~> PiE_empty_domain
1889 extensional_funcset_empty_range ~> PiE_empty_range
1890 extensional_funcset_arb ~> PiE_arb
1891 extensional_funcset_mem ~> PiE_mem
1892 extensional_funcset_extend_domainI ~> PiE_fun_upd
1893 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1894 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1895 card_extensional_funcset ~> card_PiE
1896 finite_extensional_funcset ~> finite_PiE
1900 * Theory Library/FinFun: theory of almost everywhere constant
1901 functions (supersedes the AFP entry "Code Generation for Functions as
1904 * Theory Library/Phantom: generic phantom type to make a type
1905 parameter appear in a constant's type. This alternative to adding
1906 TYPE('a) as another parameter avoids unnecessary closures in generated
1909 * Theory Library/RBT_Impl: efficient construction of red-black trees
1910 from sorted associative lists. Merging two trees with rbt_union may
1911 return a structurally different tree than before. Potential
1914 * Theory Library/IArray: immutable arrays with code generation.
1916 * Theory Library/Finite_Lattice: theory of finite lattices.
1918 * HOL/Multivariate_Analysis: replaced
1920 "basis :: 'a::euclidean_space => nat => real"
1921 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1923 on euclidean spaces by using the inner product "_ \<bullet> _" with
1924 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1925 "SUM i : Basis. f i * r i".
1927 With this change the following constants are also changed or removed:
1929 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1930 a $$ i ~> inner a i (where i : Basis)
1932 \<pi>, \<pi>' removed
1934 Theorems about these constants where removed.
1938 component_le_norm ~> Basis_le_norm
1939 euclidean_eq ~> euclidean_eq_iff
1940 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1941 euclidean_simps ~> inner_simps
1942 independent_basis ~> independent_Basis
1943 span_basis ~> span_Basis
1944 in_span_basis ~> in_span_Basis
1945 norm_bound_component_le ~> norm_boound_Basis_le
1946 norm_bound_component_lt ~> norm_boound_Basis_lt
1947 component_le_infnorm ~> Basis_le_infnorm
1953 - Added simproc "measurable" to automatically prove measurability.
1955 - Added induction rules for sigma sets with disjoint union
1956 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1957 (borel_measurable_induct).
1959 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1962 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1963 AFP entry "Ordinals_and_Cardinals").
1965 * HOL/BNF: New (co)datatype package based on bounded natural functors
1966 with support for mixed, nested recursion and interesting non-free
1969 * HOL/Finite_Set and Relation: added new set and relation operations
1970 expressed by Finite_Set.fold.
1972 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1973 trees for the code generator.
1975 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1977 possible INCOMPATIBILITY.
1979 * HOL/Set: renamed Set.project -> Set.filter
1983 *** Document preparation ***
1985 * Dropped legacy antiquotations "term_style" and "thm_style", since
1986 styles may be given as arguments to "term" and "thm" already.
1987 Discontinued legacy styles "prem1" .. "prem19".
1989 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1990 instead of slightly exotic babel/greek.
1992 * Document variant NAME may use different LaTeX entry point
1993 document/root_NAME.tex if that file exists, instead of the common
1996 * Simplified custom document/build script, instead of old-style
1997 document/IsaMakefile. Minor INCOMPATIBILITY.
2002 * The default limit for maximum number of worker threads is now 8,
2003 instead of 4, in correspondence to capabilities of contemporary
2004 hardware and Poly/ML runtime system.
2006 * Type Seq.results and related operations support embedded error
2007 messages within lazy enumerations, and thus allow to provide
2008 informative errors in the absence of any usable results.
2010 * Renamed Position.str_of to Position.here to emphasize that this is a
2011 formal device to inline positions into message text, but not
2012 necessarily printing visible text.
2017 * Advanced support for Isabelle sessions and build management, see
2018 "system" manual for the chapter of that name, especially the "isabelle
2019 build" tool and its examples. The "isabelle mkroot" tool prepares
2020 session root directories for use with "isabelle build", similar to
2021 former "isabelle mkdir" for "isabelle usedir". Note that this affects
2022 document preparation as well. INCOMPATIBILITY, isabelle usedir /
2023 mkdir / make are rendered obsolete.
2025 * Discontinued obsolete Isabelle/build script, it is superseded by the
2026 regular isabelle build tool. For example:
2028 isabelle build -s -b HOL
2030 * Discontinued obsolete "isabelle makeall".
2032 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
2033 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
2034 provides some traditional targets that invoke "isabelle build". Note
2035 that this is inefficient! Applications of Isabelle/HOL involving
2036 "isabelle make" should be upgraded to use "isabelle build" directly.
2038 * The "isabelle options" tool prints Isabelle system options, as
2039 required for "isabelle build", for example.
2041 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2042 Minor INCOMPATIBILITY in command-line options.
2044 * The "isabelle install" tool has now a simpler command-line. Minor
2047 * The "isabelle components" tool helps to resolve add-on components
2048 that are not bundled, or referenced from a bare-bones repository
2049 version of Isabelle.
2051 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2052 platform family: "linux", "macos", "windows".
2054 * The ML system is configured as regular component, and no longer
2055 picked up from some surrounding directory. Potential INCOMPATIBILITY
2056 for home-made settings.
2058 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2060 * Discontinued support for Poly/ML 5.2.1, which was the last version
2061 without exception positions and advanced ML compiler/toplevel
2064 * Discontinued special treatment of Proof General -- no longer guess
2065 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2066 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2067 settings manually, or use a Proof General version that has been
2068 bundled as Isabelle component.
2072 New in Isabelle2012 (May 2012)
2073 ------------------------------
2077 * Prover IDE (PIDE) improvements:
2079 - more robust Sledgehammer integration (as before the sledgehammer
2080 command-line needs to be typed into the source buffer)
2081 - markup for bound variables
2082 - markup for types of term variables (displayed as tooltips)
2083 - support for user-defined Isar commands within the running session
2084 - improved support for Unicode outside original 16bit range
2085 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2087 * Forward declaration of outer syntax keywords within the theory
2088 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2089 commands to be used in the same theory where defined.
2091 * Auxiliary contexts indicate block structure for specifications with
2092 additional parameters and assumptions. Such unnamed contexts may be
2093 nested within other targets, like 'theory', 'locale', 'class',
2094 'instantiation' etc. Results from the local context are generalized
2095 accordingly and applied to the enclosing target context. Example:
2099 assumes xy: "x = y" and yz: "y = z"
2102 lemma my_trans: "x = z" using xy yz by simp
2108 The most basic application is to factor-out context elements of
2109 several fixes/assumes/shows theorem statements, e.g. see
2110 ~~/src/HOL/Isar_Examples/Group_Context.thy
2112 Any other local theory specification element works within the "context
2113 ... begin ... end" block as well.
2115 * Bundled declarations associate attributed fact expressions with a
2116 given name in the context. These may be later included in other
2117 contexts. This allows to manage context extensions casually, without
2118 the logical dependencies of locales and locale interpretation. See
2119 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2121 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2122 declaration, and results are standardized before being stored. Thus
2123 old-style "standard" after instantiation or composition of facts
2124 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2125 indices of schematic variables.
2127 * Rule attributes in local theory declarations (e.g. locale or class)
2128 are now statically evaluated: the resulting theorem is stored instead
2129 of the original expression. INCOMPATIBILITY in rare situations, where
2130 the historic accident of dynamic re-evaluation in interpretations
2133 * New tutorial "Programming and Proving in Isabelle/HOL"
2134 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2135 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2136 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2137 Logic" as the recommended beginners tutorial, but does not cover all
2138 of the material of that old tutorial.
2140 * Updated and extended reference manuals: "isar-ref",
2141 "implementation", "system"; reduced remaining material in old "ref"
2147 * Command 'definition' no longer exports the foundational "raw_def"
2148 into the user context. Minor INCOMPATIBILITY, may use the regular
2149 "def" result with attribute "abs_def" to imitate the old version.
2151 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2152 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2153 expand it. This also works for object-logic equality. (Formerly
2154 undocumented feature.)
2156 * Sort constraints are now propagated in simultaneous statements, just
2157 like type constraints. INCOMPATIBILITY in rare situations, where
2158 distinct sorts used to be assigned accidentally. For example:
2160 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2162 lemma "P (x::'a)" and "Q (y::'a::bar)"
2163 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2165 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2166 tolerant against multiple unifiers, as long as the final result is
2167 unique. (As before, rules are composed in canonical right-to-left
2168 order to accommodate newly introduced premises.)
2170 * Renamed some inner syntax categories:
2176 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2177 "num_position" etc. are mainly used instead (which also include
2178 position information via constraints).
2180 * Simplified configuration options for syntax ambiguity: see
2181 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2182 manual. Minor INCOMPATIBILITY.
2184 * Discontinued configuration option "syntax_positions": atomic terms
2185 in parse trees are always annotated by position constraints.
2187 * Old code generator for SML and its commands 'code_module',
2188 'code_library', 'consts_code', 'types_code' have been discontinued.
2189 Use commands of the generic code generator instead. INCOMPATIBILITY.
2191 * Redundant attribute "code_inline" has been discontinued. Use
2192 "code_unfold" instead. INCOMPATIBILITY.
2194 * Dropped attribute "code_unfold_post" in favor of the its dual
2195 "code_abbrev", which yields a common pattern in definitions like
2197 definition [code_abbrev]: "f = t"
2201 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2202 instead. INCOMPATIBILITY.
2204 * Discontinued old "prems" fact, which used to refer to the accidental
2205 collection of foundational premises in the context (already marked as
2206 legacy since Isabelle2011).
2211 * Type 'a set is now a proper type constructor (just as before
2212 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2213 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2214 sets separate, it is often sufficient to rephrase some set S that has
2215 been accidentally used as predicates by "%x. x : S", and some
2216 predicate P that has been accidentally used as set by "{x. P x}".
2217 Corresponding proofs in a first step should be pruned from any
2218 tinkering with former theorems mem_def and Collect_def as far as
2221 For developments which deliberately mix predicates and sets, a
2222 planning step is necessary to determine what should become a predicate
2223 and what a set. It can be helpful to carry out that step in
2224 Isabelle2011-1 before jumping right into the current release.
2226 * Code generation by default implements sets as container type rather
2227 than predicates. INCOMPATIBILITY.
2229 * New type synonym 'a rel = ('a * 'a) set
2231 * The representation of numerals has changed. Datatype "num"
2232 represents strictly positive binary numerals, along with functions
2233 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2234 positive and negated numeric literals, respectively. See also
2235 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2236 user theories may require adaptations as follows:
2238 - Theorems with number_ring or number_semiring constraints: These
2239 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2241 - Theories defining numeric types: Remove number, number_semiring,
2242 and number_ring instances. Defer all theorems about numerals until
2243 after classes one and semigroup_add have been instantiated.
2245 - Numeral-only simp rules: Replace each rule having a "number_of v"
2246 pattern with two copies, one for numeral and one for neg_numeral.
2248 - Theorems about subclasses of semiring_1 or ring_1: These classes
2249 automatically support numerals now, so more simp rules and
2250 simprocs may now apply within the proof.
2252 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2253 Redefine using other integer operations.
2255 * Transfer: New package intended to generalize the existing
2256 "descending" method and related theorem attributes from the Quotient
2257 package. (Not all functionality is implemented yet, but future
2258 development will focus on Transfer as an eventual replacement for the
2259 corresponding parts of the Quotient package.)
2261 - transfer_rule attribute: Maintains a collection of transfer rules,
2262 which relate constants at two different types. Transfer rules may
2263 relate different type instances of the same polymorphic constant,
2264 or they may relate an operation on a raw type to a corresponding
2265 operation on an abstract type (quotient or subtype). For example:
2267 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2268 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2270 - transfer method: Replaces a subgoal on abstract types with an
2271 equivalent subgoal on the corresponding raw types. Constants are
2272 replaced with corresponding ones according to the transfer rules.
2273 Goals are generalized over all free variables by default; this is
2274 necessary for variables whose types change, but can be overridden
2275 for specific variables with e.g. "transfer fixing: x y z". The
2276 variant transfer' method allows replacing a subgoal with one that
2277 is logically stronger (rather than equivalent).
2279 - relator_eq attribute: Collects identity laws for relators of
2280 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2281 transfer method uses these lemmas to infer transfer rules for
2282 non-polymorphic constants on the fly.
2284 - transfer_prover method: Assists with proving a transfer rule for a
2285 new constant, provided the constant is defined in terms of other
2286 constants that already have transfer rules. It should be applied
2287 after unfolding the constant definitions.
2289 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2290 from type nat to type int.
2292 * Lifting: New package intended to generalize the quotient_definition
2293 facility of the Quotient package; designed to work with Transfer.
2295 - lift_definition command: Defines operations on an abstract type in
2296 terms of a corresponding operation on a representation
2297 type. Example syntax:
2299 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2302 Users must discharge a respectfulness proof obligation when each
2303 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2304 the proof is discharged automatically.) The obligation is
2305 presented in a user-friendly, readable form; a respectfulness
2306 theorem in the standard format and a transfer rule are generated
2309 - Integration with code_abstype: For typedefs (e.g. subtypes
2310 corresponding to a datatype invariant, such as dlist),
2311 lift_definition generates a code certificate theorem and sets up
2312 code generation for each constant.
2314 - setup_lifting command: Sets up the Lifting package to work with a
2315 user-defined type. The user must provide either a quotient theorem
2316 or a type_definition theorem. The package configures transfer
2317 rules for equality and quantifiers on the type, and sets up the
2318 lift_definition command to work with the type.
2320 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2321 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2322 Word/Word.thy and Library/Float.thy.
2326 - The 'quotient_type' command now supports a 'morphisms' option with
2327 rep and abs functions, similar to typedef.
2329 - 'quotient_type' sets up new types to work with the Lifting and
2330 Transfer packages, as with 'setup_lifting'.
2332 - The 'quotient_definition' command now requires the user to prove a
2333 respectfulness property at the point where the constant is
2334 defined, similar to lift_definition; INCOMPATIBILITY.
2336 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2337 accordingly, INCOMPATIBILITY.
2339 * New diagnostic command 'find_unused_assms' to find potentially
2340 superfluous assumptions in theorems using Quickcheck.
2344 - Quickcheck returns variable assignments as counterexamples, which
2345 allows to reveal the underspecification of functions under test.
2346 For example, refuting "hd xs = x", it presents the variable
2347 assignment xs = [] and x = a1 as a counterexample, assuming that
2348 any property is false whenever "hd []" occurs in it.
2350 These counterexample are marked as potentially spurious, as
2351 Quickcheck also returns "xs = []" as a counterexample to the
2352 obvious theorem "hd xs = hd xs".
2354 After finding a potentially spurious counterexample, Quickcheck
2355 continues searching for genuine ones.
2357 By default, Quickcheck shows potentially spurious and genuine
2358 counterexamples. The option "genuine_only" sets quickcheck to only
2359 show genuine counterexamples.
2361 - The command 'quickcheck_generator' creates random and exhaustive
2362 value generators for a given type and operations.
2364 It generates values by using the operations as if they were
2365 constructors of that type.
2367 - Support for multisets.
2369 - Added "use_subtype" options.
2371 - Added "quickcheck_locale" configuration to specify how to process
2372 conjectures in a locale context.
2374 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2375 and affecting 'rat' and 'real'.
2378 - Integrated more tightly with SPASS, as described in the ITP 2012
2379 paper "More SPASS with Isabelle".
2380 - Made it try "smt" as a fallback if "metis" fails or times out.
2381 - Added support for the following provers: Alt-Ergo (via Why3 and
2382 TFF1), iProver, iProver-Eq.
2383 - Sped up the minimizer.
2384 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2385 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2386 - Renamed "sound" option to "strict".
2388 * Metis: Added possibility to specify lambda translations scheme as a
2389 parenthesized argument (e.g., "by (metis (lifting) ...)").
2391 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2393 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2395 * New "case_product" attribute to generate a case rule doing multiple
2396 case distinctions at the same time. E.g.
2398 list.exhaust [case_product nat.exhaust]
2400 produces a rule which can be used to perform case distinction on both
2403 * New "eventually_elim" method as a generalized variant of the
2404 eventually_elim* rules. Supports structured proofs.
2406 * Typedef with implicit set definition is considered legacy. Use
2407 "typedef (open)" form instead, which will eventually become the
2410 * Record: code generation can be switched off manually with
2412 declare [[record_coden = false]] -- "default true"
2414 * Datatype: type parameters allow explicit sort constraints.
2416 * Concrete syntax for case expressions includes constraints for source
2417 positions, and thus produces Prover IDE markup for its bindings.
2418 INCOMPATIBILITY for old-style syntax translations that augment the
2419 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2422 * Clarified attribute "mono_set": pure declaration without modifying
2423 the result of the fact expression.
2425 * More default pred/set conversions on a couple of relation operations
2426 and predicates. Added powers of predicate relations. Consolidation
2427 of some relation theorems:
2429 converse_def ~> converse_unfold
2430 rel_comp_def ~> relcomp_unfold
2431 symp_def ~> (modified, use symp_def and sym_def instead)
2432 transp_def ~> transp_trans
2433 Domain_def ~> Domain_unfold
2434 Range_def ~> Domain_converse [symmetric]
2436 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2438 See theory "Relation" for examples for making use of pred/set
2439 conversions by means of attributes "to_set" and "to_pred".
2443 * Renamed facts about the power operation on relations, i.e., relpow
2444 to match the constant's name:
2446 rel_pow_1 ~> relpow_1
2447 rel_pow_0_I ~> relpow_0_I
2448 rel_pow_Suc_I ~> relpow_Suc_I
2449 rel_pow_Suc_I2 ~> relpow_Suc_I2
2450 rel_pow_0_E ~> relpow_0_E
2451 rel_pow_Suc_E ~> relpow_Suc_E
2452 rel_pow_E ~> relpow_E
2453 rel_pow_Suc_D2 ~> relpow_Suc_D2
2454 rel_pow_Suc_E2 ~> relpow_Suc_E2
2455 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2456 rel_pow_E2 ~> relpow_E2
2457 rel_pow_add ~> relpow_add
2458 rel_pow_commute ~> relpow
2459 rel_pow_empty ~> relpow_empty:
2460 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2461 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2462 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2463 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2464 rel_pow_fun_conv ~> relpow_fun_conv
2465 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2466 rel_pow_finite_bounded ~> relpow_finite_bounded
2467 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2468 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2469 single_valued_rel_pow ~> single_valued_relpow
2473 * Theory Relation: Consolidated constant name for relation composition
2474 and corresponding theorem names:
2476 - Renamed constant rel_comp to relcomp.
2478 - Dropped abbreviation pred_comp. Use relcompp instead.
2482 rel_compI ~> relcompI
2483 rel_compEpair ~> relcompEpair
2484 rel_compE ~> relcompE
2485 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2486 rel_comp_empty1 ~> relcomp_empty1
2487 rel_comp_mono ~> relcomp_mono
2488 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2489 rel_comp_distrib ~> relcomp_distrib
2490 rel_comp_distrib2 ~> relcomp_distrib2
2491 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2492 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2493 single_valued_rel_comp ~> single_valued_relcomp
2494 rel_comp_def ~> relcomp_unfold
2495 converse_rel_comp ~> converse_relcomp
2496 pred_compI ~> relcomppI
2497 pred_compE ~> relcomppE
2498 pred_comp_bot1 ~> relcompp_bot1
2499 pred_comp_bot2 ~> relcompp_bot2
2500 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2501 pred_comp_mono ~> relcompp_mono
2502 pred_comp_distrib ~> relcompp_distrib
2503 pred_comp_distrib2 ~> relcompp_distrib2
2504 converse_pred_comp ~> converse_relcompp
2506 finite_rel_comp ~> finite_relcomp
2508 set_rel_comp ~> set_relcomp
2512 * Theory Divides: Discontinued redundant theorems about div and mod.
2513 INCOMPATIBILITY, use the corresponding generic theorems instead.
2515 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2516 zdiv_self ~> div_self
2517 zmod_self ~> mod_self
2520 zdiv_zmod_equality ~> div_mod_equality2
2521 zdiv_zmod_equality2 ~> div_mod_equality
2522 zmod_zdiv_trivial ~> mod_div_trivial
2523 zdiv_zminus_zminus ~> div_minus_minus
2524 zmod_zminus_zminus ~> mod_minus_minus
2525 zdiv_zminus2 ~> div_minus_right
2526 zmod_zminus2 ~> mod_minus_right
2527 zdiv_minus1_right ~> div_minus1_right
2528 zmod_minus1_right ~> mod_minus1_right
2529 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2530 zmod_zmult1_eq ~> mod_mult_right_eq
2531 zpower_zmod ~> power_mod
2532 zdvd_zmod ~> dvd_mod
2533 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2534 mod_mult_distrib ~> mult_mod_left
2535 mod_mult_distrib2 ~> mult_mod_right
2537 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2538 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2540 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2542 * Consolidated theorem names concerning fold combinators:
2544 inf_INFI_fold_inf ~> inf_INF_fold_inf
2545 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2546 INFI_fold_inf ~> INF_fold_inf
2547 SUPR_fold_sup ~> SUP_fold_sup
2548 union_set ~> union_set_fold
2549 minus_set ~> minus_set_fold
2550 INFI_set_fold ~> INF_set_fold
2551 SUPR_set_fold ~> SUP_set_fold
2552 INF_code ~> INF_set_foldr
2553 SUP_code ~> SUP_set_foldr
2554 foldr.simps ~> foldr.simps (in point-free formulation)
2555 foldr_fold_rev ~> foldr_conv_fold
2556 foldl_fold ~> foldl_conv_fold
2557 foldr_foldr ~> foldr_conv_foldl
2558 foldl_foldr ~> foldl_conv_foldr
2559 fold_set_remdups ~> fold_set_fold_remdups
2560 fold_set ~> fold_set_fold
2561 fold1_set ~> fold1_set_fold
2565 * Dropped rarely useful theorems concerning fold combinators:
2566 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2567 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2568 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2569 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2570 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2571 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2572 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2573 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2574 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2575 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2577 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2578 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2579 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2580 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2581 lemmas over fold rather than foldr, or make use of lemmas
2582 fold_conv_foldr and fold_rev.
2584 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2585 through option types.
2587 * "Transitive_Closure.ntrancl": bounded transitive closure on
2590 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2592 * Theory Int: Discontinued many legacy theorems specific to type int.
2593 INCOMPATIBILITY, use the corresponding generic theorems instead.
2595 zminus_zminus ~> minus_minus
2596 zminus_0 ~> minus_zero
2597 zminus_zadd_distrib ~> minus_add_distrib
2598 zadd_commute ~> add_commute
2599 zadd_assoc ~> add_assoc
2600 zadd_left_commute ~> add_left_commute
2603 zadd_0 ~> add_0_left
2604 zadd_0_right ~> add_0_right
2605 zadd_zminus_inverse2 ~> left_minus
2606 zmult_zminus ~> mult_minus_left
2607 zmult_commute ~> mult_commute
2608 zmult_assoc ~> mult_assoc
2609 zadd_zmult_distrib ~> left_distrib
2610 zadd_zmult_distrib2 ~> right_distrib
2611 zdiff_zmult_distrib ~> left_diff_distrib
2612 zdiff_zmult_distrib2 ~> right_diff_distrib
2613 zmult_1 ~> mult_1_left
2614 zmult_1_right ~> mult_1_right
2615 zle_refl ~> order_refl
2616 zle_trans ~> order_trans
2617 zle_antisym ~> order_antisym
2618 zle_linear ~> linorder_linear
2619 zless_linear ~> linorder_less_linear
2620 zadd_left_mono ~> add_left_mono
2621 zadd_strict_right_mono ~> add_strict_right_mono
2622 zadd_zless_mono ~> add_less_le_mono
2623 int_0_less_1 ~> zero_less_one
2624 int_0_neq_1 ~> zero_neq_one
2626 zpower_zadd_distrib ~> power_add
2627 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2628 zero_le_zpower_abs ~> zero_le_power_abs
2630 * Theory Deriv: Renamed
2632 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2634 * Theory Library/Multiset: Improved code generation of multisets.
2636 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2637 are expressed via type classes again. The special syntax
2638 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2639 setsum_set, which is now subsumed by Big_Operators.setsum.
2642 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2643 use theory HOL/Library/Nat_Bijection instead.
2645 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2646 trees is now inside a type class context. Names of affected
2647 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2648 theories working directly with raw red-black trees, adapt the names as
2652 bulkload -> rbt_bulkload
2653 del_from_left -> rbt_del_from_left
2654 del_from_right -> rbt_del_from_right
2656 delete -> rbt_delete
2658 insert -> rbt_insert
2659 insertw -> rbt_insert_with
2660 insert_with_key -> rbt_insert_with_key
2661 map_entry -> rbt_map_entry
2662 lookup -> rbt_lookup
2663 sorted -> rbt_sorted
2664 tree_greater -> rbt_greater
2665 tree_less -> rbt_less
2666 tree_less_symbol -> rbt_less_symbol
2668 union_with -> rbt_union_with
2669 union_with_key -> rbt_union_with_key
2672 balance_left_sorted -> balance_left_rbt_sorted
2673 balance_left_tree_greater -> balance_left_rbt_greater
2674 balance_left_tree_less -> balance_left_rbt_less
2675 balance_right_sorted -> balance_right_rbt_sorted
2676 balance_right_tree_greater -> balance_right_rbt_greater
2677 balance_right_tree_less -> balance_right_rbt_less
2678 balance_sorted -> balance_rbt_sorted
2679 balance_tree_greater -> balance_rbt_greater
2680 balance_tree_less -> balance_rbt_less
2681 bulkload_is_rbt -> rbt_bulkload_is_rbt
2682 combine_sorted -> combine_rbt_sorted
2683 combine_tree_greater -> combine_rbt_greater
2684 combine_tree_less -> combine_rbt_less
2685 delete_in_tree -> rbt_delete_in_tree
2686 delete_is_rbt -> rbt_delete_is_rbt
2687 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2688 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2689 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2690 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2691 del_in_tree -> rbt_del_in_tree
2692 del_inv1_inv2 -> rbt_del_inv1_inv2
2693 del_sorted -> rbt_del_rbt_sorted
2694 del_tree_greater -> rbt_del_rbt_greater
2695 del_tree_less -> rbt_del_rbt_less
2696 dom_lookup_Branch -> dom_rbt_lookup_Branch
2697 entries_lookup -> entries_rbt_lookup
2698 finite_dom_lookup -> finite_dom_rbt_lookup
2699 insert_sorted -> rbt_insert_rbt_sorted
2700 insertw_is_rbt -> rbt_insertw_is_rbt
2701 insertwk_is_rbt -> rbt_insertwk_is_rbt
2702 insertwk_sorted -> rbt_insertwk_rbt_sorted
2703 insertw_sorted -> rbt_insertw_rbt_sorted
2704 ins_sorted -> ins_rbt_sorted
2705 ins_tree_greater -> ins_rbt_greater
2706 ins_tree_less -> ins_rbt_less
2707 is_rbt_sorted -> is_rbt_rbt_sorted
2708 lookup_balance -> rbt_lookup_balance
2709 lookup_bulkload -> rbt_lookup_rbt_bulkload
2710 lookup_delete -> rbt_lookup_rbt_delete
2711 lookup_Empty -> rbt_lookup_Empty
2712 lookup_from_in_tree -> rbt_lookup_from_in_tree
2713 lookup_in_tree -> rbt_lookup_in_tree
2714 lookup_ins -> rbt_lookup_ins
2715 lookup_insert -> rbt_lookup_rbt_insert
2716 lookup_insertw -> rbt_lookup_rbt_insertw
2717 lookup_insertwk -> rbt_lookup_rbt_insertwk
2718 lookup_keys -> rbt_lookup_keys
2719 lookup_map -> rbt_lookup_map
2720 lookup_map_entry -> rbt_lookup_rbt_map_entry
2721 lookup_tree_greater -> rbt_lookup_rbt_greater
2722 lookup_tree_less -> rbt_lookup_rbt_less
2723 lookup_union -> rbt_lookup_rbt_union
2724 map_entry_color_of -> rbt_map_entry_color_of
2725 map_entry_inv1 -> rbt_map_entry_inv1
2726 map_entry_inv2 -> rbt_map_entry_inv2
2727 map_entry_is_rbt -> rbt_map_entry_is_rbt
2728 map_entry_sorted -> rbt_map_entry_rbt_sorted
2729 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2730 map_entry_tree_less -> rbt_map_entry_rbt_less
2731 map_tree_greater -> map_rbt_greater
2732 map_tree_less -> map_rbt_less
2733 map_sorted -> map_rbt_sorted
2734 paint_sorted -> paint_rbt_sorted
2735 paint_lookup -> paint_rbt_lookup
2736 paint_tree_greater -> paint_rbt_greater
2737 paint_tree_less -> paint_rbt_less
2738 sorted_entries -> rbt_sorted_entries
2739 tree_greater_eq_trans -> rbt_greater_eq_trans
2740 tree_greater_nit -> rbt_greater_nit
2741 tree_greater_prop -> rbt_greater_prop
2742 tree_greater_simps -> rbt_greater_simps
2743 tree_greater_trans -> rbt_greater_trans
2744 tree_less_eq_trans -> rbt_less_eq_trans
2745 tree_less_nit -> rbt_less_nit
2746 tree_less_prop -> rbt_less_prop
2747 tree_less_simps -> rbt_less_simps
2748 tree_less_trans -> rbt_less_trans
2749 tree_ord_props -> rbt_ord_props
2750 union_Branch -> rbt_union_Branch
2751 union_is_rbt -> rbt_union_is_rbt
2752 unionw_is_rbt -> rbt_unionw_is_rbt
2753 unionwk_is_rbt -> rbt_unionwk_is_rbt
2754 unionwk_sorted -> rbt_unionwk_rbt_sorted
2756 * Theory HOL/Library/Float: Floating point numbers are now defined as
2757 a subset of the real numbers. All operations are defined using the
2758 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2765 round_down -> float_round_down
2766 round_up -> float_round_up
2770 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2773 abs_float_def -> Float.compute_float_abs
2774 bitlen_ge0 -> bitlen_nonneg
2775 bitlen.simps -> Float.compute_bitlen
2776 float_components -> Float_mantissa_exponent
2777 float_divl.simps -> Float.compute_float_divl
2778 float_divr.simps -> Float.compute_float_divr
2779 float_eq_odd -> mult_powr_eq_mult_powr_iff
2780 float_power -> real_of_float_power
2781 lapprox_posrat_def -> Float.compute_lapprox_posrat
2782 lapprox_rat.simps -> Float.compute_lapprox_rat
2783 le_float_def' -> Float.compute_float_le
2784 le_float_def -> less_eq_float.rep_eq
2785 less_float_def' -> Float.compute_float_less
2786 less_float_def -> less_float.rep_eq
2787 normfloat_def -> Float.compute_normfloat
2788 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2789 normfloat -> normfloat_def
2790 normfloat_unique -> use normfloat_def
2791 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2792 one_float_def -> Float.compute_float_one
2793 plus_float_def -> Float.compute_float_plus
2794 rapprox_posrat_def -> Float.compute_rapprox_posrat
2795 rapprox_rat.simps -> Float.compute_rapprox_rat
2796 real_of_float_0 -> zero_float.rep_eq
2797 real_of_float_1 -> one_float.rep_eq
2798 real_of_float_abs -> abs_float.rep_eq
2799 real_of_float_add -> plus_float.rep_eq
2800 real_of_float_minus -> uminus_float.rep_eq
2801 real_of_float_mult -> times_float.rep_eq
2802 real_of_float_simp -> Float.rep_eq
2803 real_of_float_sub -> minus_float.rep_eq
2804 round_down.simps -> Float.compute_float_round_down
2805 round_up.simps -> Float.compute_float_round_up
2806 times_float_def -> Float.compute_float_times
2807 uminus_float_def -> Float.compute_float_uminus
2808 zero_float_def -> Float.compute_float_zero
2810 Lemmas not necessary anymore, use the transfer method:
2811 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2812 float_divr, float_le_simp, float_less1_mantissa_bound,
2813 float_less_simp, float_less_zero, float_le_zero,
2814 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2815 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2816 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2817 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2818 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2819 round_up, zero_le_float, zero_less_float
2821 * New theory HOL/Library/DAList provides an abstract type for
2822 association lists with distinct keys.
2824 * Session HOL/IMP: Added new theory of abstract interpretation of
2827 * Session HOL-Import: Re-implementation from scratch is faster,
2828 simpler, and more scalable. Requires a proof bundle, which is
2829 available as an external component. Discontinued old (and mostly
2830 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2832 * Session HOL-Word: Discontinued many redundant theorems specific to
2833 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2836 word_sub_alt ~> word_sub_wi
2837 word_add_alt ~> word_add_def
2838 word_mult_alt ~> word_mult_def
2839 word_minus_alt ~> word_minus_def
2840 word_0_alt ~> word_0_wi
2841 word_1_alt ~> word_1_wi
2842 word_add_0 ~> add_0_left
2843 word_add_0_right ~> add_0_right
2844 word_mult_1 ~> mult_1_left
2845 word_mult_1_right ~> mult_1_right
2846 word_add_commute ~> add_commute
2847 word_add_assoc ~> add_assoc
2848 word_add_left_commute ~> add_left_commute
2849 word_mult_commute ~> mult_commute
2850 word_mult_assoc ~> mult_assoc
2851 word_mult_left_commute ~> mult_left_commute
2852 word_left_distrib ~> left_distrib
2853 word_right_distrib ~> right_distrib
2854 word_left_minus ~> left_minus
2855 word_diff_0_right ~> diff_0_right
2856 word_diff_self ~> diff_self
2857 word_sub_def ~> diff_minus
2858 word_diff_minus ~> diff_minus
2859 word_add_ac ~> add_ac
2860 word_mult_ac ~> mult_ac
2861 word_plus_ac0 ~> add_0_left add_0_right add_ac
2862 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2863 word_order_trans ~> order_trans
2864 word_order_refl ~> order_refl
2865 word_order_antisym ~> order_antisym
2866 word_order_linear ~> linorder_linear
2867 lenw1_zero_neq_one ~> zero_neq_one
2868 word_number_of_eq ~> number_of_eq
2869 word_of_int_add_hom ~> wi_hom_add
2870 word_of_int_sub_hom ~> wi_hom_sub
2871 word_of_int_mult_hom ~> wi_hom_mult
2872 word_of_int_minus_hom ~> wi_hom_neg
2873 word_of_int_succ_hom ~> wi_hom_succ
2874 word_of_int_pred_hom ~> wi_hom_pred
2875 word_of_int_0_hom ~> word_0_wi
2876 word_of_int_1_hom ~> word_1_wi
2878 * Session HOL-Word: New proof method "word_bitwise" for splitting
2879 machine word equalities and inequalities into logical circuits,
2880 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2881 multiplication, shifting by constants, bitwise operators and numeric
2882 constants. Requires fixed-length word types, not 'a word. Solves
2883 many standard word identities outright and converts more into first
2884 order problems amenable to blast or similar. See also examples in
2885 HOL/Word/Examples/WordExamples.thy.
2887 * Session HOL-Probability: Introduced the type "'a measure" to
2888 represent measures, this replaces the records 'a algebra and 'a
2889 measure_space. The locales based on subset_class now have two
2890 locale-parameters the space \<Omega> and the set of measurable sets M.
2891 The product of probability spaces uses now the same constant as the
2892 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2893 measure". Most constants are defined now outside of locales and gain
2894 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2895 Measure space constructions for distributions and densities now got
2896 their own constants distr and density. Instead of using locales to
2897 describe measure spaces with a finite space, the measure count_space
2898 and point_measure is introduced. INCOMPATIBILITY.
2902 finite_measure.\<mu>' -> measure
2903 product_algebra_generator -> prod_algebra
2904 product_prob_space.emb -> prod_emb
2905 product_prob_space.infprod_algebra -> PiM
2908 completeable_measure_space
2909 finite_measure_space
2911 finite_product_finite_prob_space
2912 finite_product_sigma_algebra
2913 finite_sigma_algebra
2915 pair_finite_prob_space
2916 pair_finite_sigma_algebra
2919 product_sigma_algebra
2923 distribution -> use distr measure, or distributed predicate
2925 joint_distribution -> use distr measure, or distributed predicate
2926 pair_measure_generator
2927 product_prob_space.infprod_algebra -> use PiM
2930 Replacement theorems:
2931 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2932 finite_measure.empty_measure -> measure_empty
2933 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2934 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2935 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2936 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2937 finite_measure.finite_measure -> finite_measure.emeasure_finite
2938 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2939 finite_measure.positive_measure' -> measure_nonneg
2940 finite_measure.real_measure -> finite_measure.emeasure_real
2941 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2942 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2943 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2944 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2945 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2946 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2947 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2948 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2949 information_space.entropy_commute -> information_space.entropy_commute_simple
2950 information_space.entropy_eq -> information_space.entropy_simple_distributed
2951 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2952 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2953 information_space.entropy_uniform_max -> information_space.entropy_uniform
2954 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2955 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2956 information_space.KL_ge_0 -> information_space.KL_nonneg
2957 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2958 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2959 Int_stable_cuboids -> Int_stable_atLeastAtMost
2960 Int_stable_product_algebra_generator -> positive_integral
2961 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2962 measure_space.additive -> emeasure_additive
2963 measure_space.AE_iff_null_set -> AE_iff_null
2964 measure_space.almost_everywhere_def -> eventually_ae_filter
2965 measure_space.almost_everywhere_vimage -> AE_distrD
2966 measure_space.continuity_from_above -> INF_emeasure_decseq
2967 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2968 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2969 measure_space.continuity_from_below -> SUP_emeasure_incseq
2970 measure_space_density -> emeasure_density
2971 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2972 measure_space.integrable_vimage -> integrable_distr
2973 measure_space.integral_translated_density -> integral_density
2974 measure_space.integral_vimage -> integral_distr
2975 measure_space.measure_additive -> plus_emeasure
2976 measure_space.measure_compl -> emeasure_compl
2977 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2978 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2979 measure_space.measure_decseq -> decseq_emeasure
2980 measure_space.measure_Diff -> emeasure_Diff
2981 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2982 measure_space.measure_eq_0 -> emeasure_eq_0
2983 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2984 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2985 measure_space.measure_incseq -> incseq_emeasure
2986 measure_space.measure_insert -> emeasure_insert
2987 measure_space.measure_mono -> emeasure_mono
2988 measure_space.measure_not_negative -> emeasure_not_MInf
2989 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2990 measure_space.measure_setsum -> setsum_emeasure
2991 measure_space.measure_setsum_split -> setsum_emeasure_cover
2992 measure_space.measure_space_vimage -> emeasure_distr
2993 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2994 measure_space.measure_subadditive -> subadditive
2995 measure_space.measure_top -> emeasure_space
2996 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2997 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2998 measure_space.positive_integral_translated_density -> positive_integral_density
2999 measure_space.positive_integral_vimage -> positive_integral_distr
3000 measure_space.real_continuity_from_above -> Lim_measure_decseq
3001 measure_space.real_continuity_from_below -> Lim_measure_incseq
3002 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
3003 measure_space.real_measure_Diff -> measure_Diff
3004 measure_space.real_measure_finite_Union -> measure_finite_Union
3005 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
3006 measure_space.real_measure_subadditive -> measure_subadditive
3007 measure_space.real_measure_Union -> measure_Union
3008 measure_space.real_measure_UNION -> measure_UNION
3009 measure_space.simple_function_vimage -> simple_function_comp
3010 measure_space.simple_integral_vimage -> simple_integral_distr
3011 measure_space.simple_integral_vimage -> simple_integral_distr
3012 measure_unique_Int_stable -> measure_eqI_generator_eq
3013 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
3014 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
3015 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
3016 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
3017 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
3018 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
3019 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
3020 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
3021 pair_sigma_algebra.sets_swap -> sets_pair_swap
3022 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
3023 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
3024 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
3025 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
3026 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
3027 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
3028 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
3029 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
3030 prob_space.measure_space_1 -> prob_space.emeasure_space_1
3031 prob_space.prob_space_vimage -> prob_space_distr
3032 prob_space.random_variable_restrict -> measurable_restrict
3033 prob_space_unique_Int_stable -> measure_eqI_prob_space
3034 product_algebraE -> prod_algebraE_all
3035 product_algebra_generator_der -> prod_algebra_eq_finite
3036 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3037 product_algebraI -> sets_PiM_I_finite
3038 product_measure_exists -> product_sigma_finite.sigma_finite
3039 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3040 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3041 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3042 product_prob_space.measurable_component -> measurable_component_singleton
3043 product_prob_space.measurable_emb -> measurable_prod_emb
3044 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3045 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3046 product_prob_space.measure_emb -> emeasure_prod_emb
3047 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3048 product_sigma_algebra.product_algebra_into_space -> space_closed
3049 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3050 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3051 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3052 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3053 sets_product_algebra -> sets_PiM
3054 sigma_algebra.measurable_sigma -> measurable_measure_of
3055 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3056 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3057 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3058 space_product_algebra -> space_PiM
3060 * Session HOL-TPTP: support to parse and import TPTP problems (all
3061 languages) into Isabelle/HOL.
3066 * New "case_product" attribute (see HOL).
3071 * Greater support for structured proofs involving induction or case
3074 * Much greater use of mathematical symbols.
3076 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3081 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3082 from a minor keyword introduced via theory header declaration.
3084 * Antiquotation @{command_spec "name"} produces the
3085 Outer_Syntax.command_spec from a major keyword introduced via theory
3086 header declaration; it can be passed to Outer_Syntax.command etc.
3088 * Local_Theory.define no longer hard-wires default theorem name
3089 "foo_def", but retains the binding as given. If that is Binding.empty
3090 / Attrib.empty_binding, the result is not registered as user-level
3091 fact. The Local_Theory.define_internal variant allows to specify a
3092 non-empty name (used for the foundation in the background theory),
3093 while omitting the fact binding in the user-context. Potential
3094 INCOMPATIBILITY for derived definitional packages: need to specify
3095 naming policy for primitive definitions more explicitly.
3097 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3098 conformance with similar operations in structure Term and Logic.
3100 * Antiquotation @{attributes [...]} embeds attribute source
3101 representation into the ML text, which is particularly useful with
3102 declarations like Local_Theory.note.
3104 * Structure Proof_Context follows standard naming scheme. Old
3105 ProofContext has been discontinued. INCOMPATIBILITY.
3107 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3108 change of semantics: update is applied to auxiliary local theory
3111 * Modernized some old-style infix operations:
3113 addeqcongs ~> Simplifier.add_eqcong
3114 deleqcongs ~> Simplifier.del_eqcong
3115 addcongs ~> Simplifier.add_cong
3116 delcongs ~> Simplifier.del_cong
3117 setmksimps ~> Simplifier.set_mksimps
3118 setmkcong ~> Simplifier.set_mkcong
3119 setmksym ~> Simplifier.set_mksym
3120 setmkeqTrue ~> Simplifier.set_mkeqTrue
3121 settermless ~> Simplifier.set_termless
3122 setsubgoaler ~> Simplifier.set_subgoaler
3123 addsplits ~> Splitter.add_split
3124 delsplits ~> Splitter.del_split
3129 * USER_HOME settings variable points to cross-platform user home
3130 directory, which coincides with HOME on POSIX systems only. Likewise,
3131 the Isabelle path specification "~" now expands to $USER_HOME, instead
3132 of former $HOME. A different default for USER_HOME may be set
3133 explicitly in shell environment, before Isabelle settings are
3134 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3135 the generic user home was intended.
3137 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3138 notation, which is useful for the jEdit file browser, for example.
3140 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3145 New in Isabelle2011-1 (October 2011)
3146 ------------------------------------
3150 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3151 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3153 - Management of multiple theory files directly from the editor
3154 buffer store -- bypassing the file-system (no requirement to save
3155 files for checking).
3157 - Markup of formal entities within the text buffer, with semantic
3158 highlighting, tooltips and hyperlinks to jump to defining source
3161 - Improved text rendering, with sub/superscripts in the source
3162 buffer (including support for copy/paste wrt. output panel, HTML
3163 theory output and other non-Isabelle text boxes).
3165 - Refined scheduling of proof checking and printing of results,
3166 based on interactive editor view. (Note: jEdit folding and
3167 narrowing allows to restrict buffer perspectives explicitly.)
3169 - Reduced CPU performance requirements, usable on machines with few
3172 - Reduced memory requirements due to pruning of unused document
3173 versions (garbage collection).
3175 See also ~~/src/Tools/jEdit/README.html for further information,
3176 including some remaining limitations.
3178 * Theory loader: source files are exclusively located via the master
3179 directory of each theory node (where the .thy file itself resides).
3180 The global load path (such as src/HOL/Library) has been discontinued.
3181 Note that the path element ~~ may be used to reference theories in the
3182 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3185 * Theory loader: source files are identified by content via SHA1
3186 digests. Discontinued former path/modtime identification and optional
3187 ISABELLE_FILE_IDENT plugin scripts.
3189 * Parallelization of nested Isar proofs is subject to
3190 Goal.parallel_proofs_threshold (default 100). See also isabelle
3193 * Name space: former unsynchronized references are now proper
3194 configuration options, with more conventional names:
3196 long_names ~> names_long
3197 short_names ~> names_short
3198 unique_names ~> names_unique
3200 Minor INCOMPATIBILITY, need to declare options in context like this:
3202 declare [[names_unique = false]]
3204 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3205 that the result needs to be unique, which means fact specifications
3206 may have to be refined after enriching a proof context.
3208 * Attribute "case_names" has been refined: the assumptions in each case
3209 can be named now by following the case name with [name1 name2 ...].
3211 * Isabelle/Isar reference manual has been updated and extended:
3212 - "Synopsis" provides a catalog of main Isar language concepts.
3213 - Formal references in syntax diagrams, via @{rail} antiquotation.
3214 - Updated material from classic "ref" manual, notably about
3215 "Classical Reasoner".
3220 * Class bot and top require underlying partial order rather than
3221 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3223 * Class complete_lattice: generalized a couple of lemmas from sets;
3224 generalized theorems INF_cong and SUP_cong. New type classes for
3225 complete boolean algebras and complete linear orders. Lemmas
3226 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3227 class complete_linorder.
3229 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3230 Sup_fun_def, Inf_apply, Sup_apply.
3232 Removed redundant lemmas (the right hand side gives hints how to
3233 replace them for (metis ...), or (simp only: ...) proofs):
3235 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3236 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3237 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3238 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3239 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3240 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3241 Inter_def ~> INF_def, image_def
3242 Union_def ~> SUP_def, image_def
3243 INT_eq ~> INF_def, and image_def
3244 UN_eq ~> SUP_def, and image_def
3245 INF_subset ~> INF_superset_mono [OF _ order_refl]
3247 More consistent and comprehensive names:
3249 INTER_eq_Inter_image ~> INF_def
3250 UNION_eq_Union_image ~> SUP_def
3253 INF_leI ~> INF_lower
3254 INF_leI2 ~> INF_lower2
3255 le_INFI ~> INF_greatest
3256 le_SUPI ~> SUP_upper
3257 le_SUPI2 ~> SUP_upper2
3258 SUP_leI ~> SUP_least
3259 INFI_bool_eq ~> INF_bool_eq
3260 SUPR_bool_eq ~> SUP_bool_eq
3261 INFI_apply ~> INF_apply
3262 SUPR_apply ~> SUP_apply
3263 INTER_def ~> INTER_eq
3264 UNION_def ~> UNION_eq
3268 * Renamed theory Complete_Lattice to Complete_Lattices.
3271 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3272 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3273 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3274 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3276 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3277 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3278 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3281 * Added syntactic classes "inf" and "sup" for the respective
3282 constants. INCOMPATIBILITY: Changes in the argument order of the
3283 (mostly internal) locale predicates for some derived classes.
3285 * Theorem collections ball_simps and bex_simps do not contain theorems
3286 referring to UNION any longer; these have been moved to collection
3287 UN_ball_bex_simps. INCOMPATIBILITY.
3289 * Theory Archimedean_Field: floor now is defined as parameter of a
3290 separate type class floor_ceiling.
3292 * Theory Finite_Set: more coherent development of fold_set locales:
3294 locale fun_left_comm ~> locale comp_fun_commute
3295 locale fun_left_comm_idem ~> locale comp_fun_idem
3297 Both use point-free characterization; interpretation proofs may need
3298 adjustment. INCOMPATIBILITY.
3300 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3301 accordance with standard mathematical terminology. INCOMPATIBILITY.
3303 * Theory Complex_Main: The locale interpretations for the
3304 bounded_linear and bounded_bilinear locales have been removed, in
3305 order to reduce the number of duplicate lemmas. Users must use the
3306 original names for distributivity theorems, potential INCOMPATIBILITY.
3308 divide.add ~> add_divide_distrib
3309 divide.diff ~> diff_divide_distrib
3310 divide.setsum ~> setsum_divide_distrib
3311 mult.add_right ~> right_distrib
3312 mult.diff_right ~> right_diff_distrib
3313 mult_right.setsum ~> setsum_right_distrib
3314 mult_left.diff ~> left_diff_distrib
3316 * Theory Complex_Main: Several redundant theorems have been removed or
3317 replaced by more general versions. INCOMPATIBILITY.
3319 real_diff_def ~> minus_real_def
3320 real_divide_def ~> divide_real_def
3321 real_less_def ~> less_le
3322 real_abs_def ~> abs_real_def
3323 real_sgn_def ~> sgn_real_def
3324 real_mult_commute ~> mult_commute
3325 real_mult_assoc ~> mult_assoc
3326 real_mult_1 ~> mult_1_left
3327 real_add_mult_distrib ~> left_distrib
3328 real_zero_not_eq_one ~> zero_neq_one
3329 real_mult_inverse_left ~> left_inverse
3330 INVERSE_ZERO ~> inverse_zero
3331 real_le_refl ~> order_refl
3332 real_le_antisym ~> order_antisym
3333 real_le_trans ~> order_trans
3334 real_le_linear ~> linear
3335 real_le_eq_diff ~> le_iff_diff_le_0
3336 real_add_left_mono ~> add_left_mono
3337 real_mult_order ~> mult_pos_pos
3338 real_mult_less_mono2 ~> mult_strict_left_mono
3339 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3340 real_0_le_divide_iff ~> zero_le_divide_iff
3341 realpow_two_disj ~> power2_eq_iff
3342 real_squared_diff_one_factored ~> square_diff_one_factored
3343 realpow_two_diff ~> square_diff_square_factored
3344 reals_complete2 ~> complete_real
3345 real_sum_squared_expand ~> power2_sum
3346 exp_ln_eq ~> ln_unique
3348 expi_zero ~> exp_zero
3349 lemma_DERIV_subst ~> DERIV_cong
3350 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3351 LIMSEQ_const ~> tendsto_const
3352 LIMSEQ_norm ~> tendsto_norm
3353 LIMSEQ_add ~> tendsto_add
3354 LIMSEQ_minus ~> tendsto_minus
3355 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3356 LIMSEQ_diff ~> tendsto_diff
3357 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3358 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3359 LIMSEQ_mult ~> tendsto_mult
3360 LIMSEQ_inverse ~> tendsto_inverse
3361 LIMSEQ_divide ~> tendsto_divide
3362 LIMSEQ_pow ~> tendsto_power
3363 LIMSEQ_setsum ~> tendsto_setsum
3364 LIMSEQ_setprod ~> tendsto_setprod
3365 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3366 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3367 LIMSEQ_imp_rabs ~> tendsto_rabs
3368 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3369 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3370 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3371 LIMSEQ_Complex ~> tendsto_Complex
3372 LIM_ident ~> tendsto_ident_at
3373 LIM_const ~> tendsto_const
3374 LIM_add ~> tendsto_add
3375 LIM_add_zero ~> tendsto_add_zero
3376 LIM_minus ~> tendsto_minus
3377 LIM_diff ~> tendsto_diff
3378 LIM_norm ~> tendsto_norm
3379 LIM_norm_zero ~> tendsto_norm_zero
3380 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3381 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3382 LIM_rabs ~> tendsto_rabs
3383 LIM_rabs_zero ~> tendsto_rabs_zero
3384 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3385 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3386 LIM_compose ~> tendsto_compose
3387 LIM_mult ~> tendsto_mult
3388 LIM_scaleR ~> tendsto_scaleR
3389 LIM_of_real ~> tendsto_of_real
3390 LIM_power ~> tendsto_power
3391 LIM_inverse ~> tendsto_inverse
3392 LIM_sgn ~> tendsto_sgn
3393 isCont_LIM_compose ~> isCont_tendsto_compose
3394 bounded_linear.LIM ~> bounded_linear.tendsto
3395 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3396 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3397 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3398 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3399 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3400 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3402 * Theory Complex_Main: The definition of infinite series was
3403 generalized. Now it is defined on the type class {topological_space,
3404 comm_monoid_add}. Hence it is useable also for extended real numbers.
3406 * Theory Complex_Main: The complex exponential function "expi" is now
3407 a type-constrained abbreviation for "exp :: complex => complex"; thus
3408 several polymorphic lemmas about "exp" are now applicable to "expi".
3412 - Theory Library/Code_Char_ord provides native ordering of
3413 characters in the target language.
3415 - Commands code_module and code_library are legacy, use export_code
3418 - Method "evaluation" is legacy, use method "eval" instead.
3420 - Legacy evaluator "SML" is deactivated by default. May be
3421 reactivated by the following theory command:
3423 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3425 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3427 * New proof method "induction" that gives induction hypotheses the
3428 name "IH", thus distinguishing them from further hypotheses that come
3429 from rule induction. The latter are still called "hyps". Method
3430 "induction" is a thin wrapper around "induct" and follows the same
3433 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3434 still available as a legacy feature for some time.
3437 - Added "need" and "total_consts" options.
3438 - Reintroduced "show_skolems" option by popular demand.
3439 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3443 - Use quasi-sound (and efficient) translations by default.
3444 - Added support for the following provers: E-ToFoF, LEO-II,
3445 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3446 - Automatically preplay and minimize proofs before showing them if
3447 this can be done within reasonable time.
3448 - sledgehammer available_provers ~> sledgehammer supported_provers.
3450 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3451 "max_mono_iters", and "max_new_mono_instances" options.
3452 - Removed "explicit_apply" and "full_types" options as well as "Full
3453 Types" Proof General menu item. INCOMPATIBILITY.
3456 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3457 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3461 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3462 "elim:" options. INCOMPATIBILITY.
3463 - Introduced 'try' that not only runs 'try_methods' but also
3464 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3467 - Added "eval" option to evaluate terms for the found counterexample
3468 (currently only supported by the default (exhaustive) tester).
3469 - Added post-processing of terms to obtain readable counterexamples
3470 (currently only supported by the default (exhaustive) tester).
3471 - New counterexample generator quickcheck[narrowing] enables
3472 narrowing-based testing. Requires the Glasgow Haskell compiler
3473 with its installation location defined in the Isabelle settings
3474 environment as ISABELLE_GHC.
3475 - Removed quickcheck tester "SML" based on the SML code generator
3476 (formly in HOL/Library).
3478 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3479 use 'partial_function' instead.
3481 * Theory Library/Extended_Reals replaces now the positive extended
3482 reals found in probability theory. This file is extended by
3483 Multivariate_Analysis/Extended_Real_Limits.
3485 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3486 from where it must be imported explicitly if it is really required.
3489 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3490 been moved here. INCOMPATIBILITY.
3492 * Theory Library/Saturated provides type of numbers with saturated
3495 * Theory Library/Product_Lattice defines a pointwise ordering for the
3496 product type 'a * 'b, and provides instance proofs for various order
3497 and lattice type classes.
3499 * Theory Library/Countable now provides the "countable_datatype" proof
3500 method for proving "countable" class instances for datatypes.
3502 * Theory Library/Cset_Monad allows do notation for computable sets
3503 (cset) via the generic monad ad-hoc overloading facility.
3505 * Library: Theories of common data structures are split into theories
3506 for implementation, an invariant-ensuring type, and connection to an
3507 abstract type. INCOMPATIBILITY.
3509 - RBT is split into RBT and RBT_Mapping.
3510 - AssocList is split and renamed into AList and AList_Mapping.
3511 - DList is split into DList_Impl, DList, and DList_Cset.
3512 - Cset is split into Cset and List_Cset.
3514 * Theory Library/Nat_Infinity has been renamed to
3515 Library/Extended_Nat, with name changes of the following types and
3518 type inat ~> type enat
3520 Infty ~> infinity (overloaded)
3524 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3525 been renamed accordingly. INCOMPATIBILITY.
3527 * Session Multivariate_Analysis: The euclidean_space type class now
3528 fixes a constant "Basis :: 'a set" consisting of the standard
3529 orthonormal basis for the type. Users now have the option of
3530 quantifying over this set instead of using the "basis" function, e.g.
3531 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3533 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3534 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3535 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3536 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3537 changed to match. Definition theorems for overloaded constants now use
3538 the standard "foo_vec_def" naming scheme. A few other theorems have
3539 been renamed as follows (INCOMPATIBILITY):
3541 Cart_eq ~> vec_eq_iff
3542 dist_nth_le_cart ~> dist_vec_nth_le
3543 tendsto_vector ~> vec_tendstoI
3544 Cauchy_vector ~> vec_CauchyI
3546 * Session Multivariate_Analysis: Several duplicate theorems have been
3547 removed, and other theorems have been renamed or replaced with more
3548 general versions. INCOMPATIBILITY.
3550 finite_choice ~> finite_set_choice
3551 eventually_conjI ~> eventually_conj
3552 eventually_and ~> eventually_conj_iff
3553 eventually_false ~> eventually_False
3554 setsum_norm ~> norm_setsum
3555 Lim_sequentially ~> LIMSEQ_def
3556 Lim_ident_at ~> LIM_ident
3557 Lim_const ~> tendsto_const
3558 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3559 Lim_neg ~> tendsto_minus
3560 Lim_add ~> tendsto_add
3561 Lim_sub ~> tendsto_diff
3562 Lim_mul ~> tendsto_scaleR
3563 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3564 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3565 Lim_linear ~> bounded_linear.tendsto
3566 Lim_component ~> tendsto_euclidean_component
3567 Lim_component_cart ~> tendsto_vec_nth
3568 Lim_inner ~> tendsto_inner [OF tendsto_const]
3569 dot_lsum ~> inner_setsum_left
3570 dot_rsum ~> inner_setsum_right
3571 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3572 continuous_neg ~> continuous_minus
3573 continuous_sub ~> continuous_diff
3574 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3575 continuous_mul ~> continuous_scaleR
3576 continuous_inv ~> continuous_inverse
3577 continuous_at_within_inv ~> continuous_at_within_inverse
3578 continuous_at_inv ~> continuous_at_inverse
3579 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3580 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3581 continuous_at_component ~> continuous_component [OF continuous_at_id]
3582 continuous_on_neg ~> continuous_on_minus
3583 continuous_on_sub ~> continuous_on_diff
3584 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3585 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3586 continuous_on_mul ~> continuous_on_scaleR
3587 continuous_on_mul_real ~> continuous_on_mult
3588 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3589 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3590 continuous_on_inverse ~> continuous_on_inv
3591 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3592 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3593 subset_interior ~> interior_mono
3594 subset_closure ~> closure_mono
3595 closure_univ ~> closure_UNIV
3596 real_arch_lt ~> reals_Archimedean2
3597 real_arch ~> reals_Archimedean3
3598 real_abs_norm ~> abs_norm_cancel
3599 real_abs_sub_norm ~> norm_triangle_ineq3
3600 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3602 * Session HOL-Probability:
3603 - Caratheodory's extension lemma is now proved for ring_of_sets.
3604 - Infinite products of probability measures are now available.
3605 - Sigma closure is independent, if the generator is independent
3606 - Use extended reals instead of positive extended
3607 reals. INCOMPATIBILITY.
3609 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3611 expand_fun_below ~> fun_below_iff
3612 below_fun_ext ~> fun_belowI
3613 expand_cfun_eq ~> cfun_eq_iff
3614 ext_cfun ~> cfun_eqI
3615 expand_cfun_below ~> cfun_below_iff
3616 below_cfun_ext ~> cfun_belowI
3617 monofun_fun_fun ~> fun_belowD
3618 monofun_fun_arg ~> monofunE
3619 monofun_lub_fun ~> adm_monofun [THEN admD]
3620 cont_lub_fun ~> adm_cont [THEN admD]
3621 cont2cont_Rep_CFun ~> cont2cont_APP
3622 cont_Rep_CFun_app ~> cont_APP_app
3623 cont_Rep_CFun_app_app ~> cont_APP_app_app
3624 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3625 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3626 contlub_cfun ~> lub_APP [symmetric]
3627 contlub_LAM ~> lub_LAM [symmetric]
3630 lift_distinct1 ~> lift.distinct(1)
3631 lift_distinct2 ~> lift.distinct(2)
3632 Def_not_UU ~> lift.distinct(2)
3633 Def_inject ~> lift.inject
3634 below_UU_iff ~> below_bottom_iff
3635 eq_UU_iff ~> eq_bottom_iff
3638 *** Document preparation ***
3640 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3641 isar-ref manual, both for description and actual application of the
3644 * Antiquotation @{value} evaluates the given term and presents its
3647 * Antiquotations: term style "isub" provides ad-hoc conversion of
3648 variables x1, y23 into subscripted form x\<^isub>1,
3649 y\<^isub>2\<^isub>3.
3651 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3652 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3654 * Localized \isabellestyle switch can be used within blocks or groups
3657 \isabellestyle{it} %preferred default
3658 {\isabellestylett @{text "typewriter stuff"}}
3660 * Discontinued special treatment of hard tabulators. Implicit
3661 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3667 * The inner syntax of sort/type/term/prop supports inlined YXML
3668 representations within quoted string tokens. By encoding logical
3669 entities via Term_XML (in ML or Scala) concrete syntax can be
3670 bypassed, which is particularly useful for producing bits of text
3671 under external program control.
3673 * Antiquotations for ML and document preparation are managed as theory
3674 data, which requires explicit setup.
3676 * Isabelle_Process.is_active allows tools to check if the official
3677 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3678 (better known as Proof General).
3680 * Structure Proof_Context follows standard naming scheme. Old
3681 ProofContext is still available for some time as legacy alias.
3683 * Structure Timing provides various operations for timing; supersedes
3684 former start_timing/end_timing etc.
3686 * Path.print is the official way to show file-system paths to users
3687 (including quotes etc.).
3689 * Inner syntax: identifiers in parse trees of generic categories
3690 "logic", "aprop", "idt" etc. carry position information (disguised as
3691 type constraints). Occasional INCOMPATIBILITY with non-compliant
3692 translations that choke on unexpected type constraints. Positions can
3693 be stripped in ML translations via Syntax.strip_positions /
3694 Syntax.strip_positions_ast, or via the syntax constant
3695 "_strip_positions" within parse trees. As last resort, positions can
3696 be disabled via the configuration option Syntax.positions, which is
3697 called "syntax_positions" in Isar attribute syntax.
3699 * Discontinued special status of various ML structures that contribute
3700 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3701 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3702 refer directly to Ast.Constant, Lexicon.is_identifier,
3703 Syntax_Trans.mk_binder_tr etc.
3705 * Typed print translation: discontinued show_sorts argument, which is
3706 already available via context of "advanced" translation.
3708 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3709 goal states; body tactic needs to address all subgoals uniformly.
3711 * Slightly more special eq_list/eq_set, with shortcut involving
3712 pointer equality (assumes that eq relation is reflexive).
3714 * Classical tactics use proper Proof.context instead of historic types
3715 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3716 operate directly on Proof.context. Raw type claset retains its use as
3717 snapshot of the classical context, which can be recovered via
3718 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3719 INCOMPATIBILITY, classical tactics and derived proof methods require
3720 proper Proof.context.
3725 * Discontinued support for Poly/ML 5.2, which was the last version
3726 without proper multithreading and TimeLimit implementation.
3728 * Discontinued old lib/scripts/polyml-platform, which has been
3729 obsolete since Isabelle2009-2.
3731 * Various optional external tools are referenced more robustly and
3732 uniformly by explicit Isabelle settings as follows:
3734 ISABELLE_CSDP (formerly CSDP_EXE)
3735 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3736 ISABELLE_OCAML (formerly EXEC_OCAML)
3737 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3738 ISABELLE_YAP (formerly EXEC_YAP)
3740 Note that automated detection from the file-system or search path has
3741 been discontinued. INCOMPATIBILITY.
3743 * Scala layer provides JVM method invocation service for static
3744 methods of type (String)String, see Invoke_Scala.method in ML. For
3747 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3749 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3750 this allows to pass structured values between ML and Scala.
3752 * The IsabelleText fonts includes some further glyphs to support the
3753 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3754 installed a local copy (which is normally *not* required) need to
3755 delete or update it from ~~/lib/fonts/.
3759 New in Isabelle2011 (January 2011)
3760 ----------------------------------
3764 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3765 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3766 useful tooltips and hyperlinks produced from its static analysis. The
3767 bundled component provides an executable Isabelle tool that can be run
3770 Isabelle2011/bin/isabelle jedit
3772 * Significantly improved Isabelle/Isar implementation manual.
3774 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3775 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3776 while the default heap location within that directory lacks that extra
3777 suffix. This isolates multiple Isabelle installations from each
3778 other, avoiding problems with old settings in new versions.
3779 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3781 * Source files are always encoded as UTF-8, instead of old-fashioned
3782 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3783 the following package declarations:
3785 \usepackage[utf8]{inputenc}
3786 \usepackage{textcomp}
3788 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3789 a Unicode character is treated as a single symbol, not a sequence of
3790 non-ASCII bytes as before. Since Isabelle/ML string literals may
3791 contain symbols without further backslash escapes, Unicode can now be
3792 used here as well. Recall that Symbol.explode in ML provides a
3793 consistent view on symbols, while raw explode (or String.explode)
3794 merely give a byte-oriented representation.
3796 * Theory loader: source files are primarily located via the master
3797 directory of each theory node (where the .thy file itself resides).
3798 The global load path is still partially available as legacy feature.
3799 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3800 explicit paths, relatively to the theory.
3802 * Special treatment of ML file names has been discontinued.
3803 Historically, optional extensions .ML or .sml were added on demand --
3804 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3805 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3807 * Various options that affect pretty printing etc. are now properly
3808 handled within the context via configuration options, instead of
3809 unsynchronized references or print modes. There are both ML Config.T
3810 entities and Isar declaration attributes to access these.
3812 ML (Config.T) Isar (attribute)
3814 eta_contract eta_contract
3815 show_brackets show_brackets
3816 show_sorts show_sorts
3817 show_types show_types
3818 show_question_marks show_question_marks
3819 show_consts show_consts
3820 show_abbrevs show_abbrevs
3822 Syntax.ast_trace syntax_ast_trace
3823 Syntax.ast_stat syntax_ast_stat
3824 Syntax.ambiguity_level syntax_ambiguity_level
3826 Goal_Display.goals_limit goals_limit
3827 Goal_Display.show_main_goal show_main_goal
3829 Method.rule_trace rule_trace
3831 Thy_Output.display thy_output_display
3832 Thy_Output.quotes thy_output_quotes
3833 Thy_Output.indent thy_output_indent
3834 Thy_Output.source thy_output_source
3835 Thy_Output.break thy_output_break
3837 Note that corresponding "..._default" references in ML may only be
3838 changed globally at the ROOT session setup, but *not* within a theory.
3839 The option "show_abbrevs" supersedes the former print mode
3840 "no_abbrevs" with inverted meaning.
3842 * More systematic naming of some configuration options.
3845 trace_simp ~> simp_trace
3846 debug_simp ~> simp_debug
3848 * Support for real valued configuration options, using simplistic
3849 floating-point notation that coincides with the inner syntax for
3852 * Support for real valued preferences (with approximative PGIP type):
3853 front-ends need to accept "pgint" values in float notation.
3856 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3859 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3864 * Command 'type_synonym' (with single argument) replaces somewhat
3865 outdated 'types', which is still available as legacy feature for some
3868 * Command 'nonterminal' (with 'and' separated list of arguments)
3869 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3871 * Command 'notepad' replaces former 'example_proof' for
3872 experimentation in Isar without any result. INCOMPATIBILITY.
3874 * Locale interpretation commands 'interpret' and 'sublocale' accept
3875 lists of equations to map definitions in a locale to appropriate
3876 entities in the context of the interpretation. The 'interpretation'
3877 command already provided this functionality.
3879 * Diagnostic command 'print_dependencies' prints the locale instances
3880 that would be activated if the specified expression was interpreted in
3881 the current context. Variant "print_dependencies!" assumes a context
3882 without interpretations.
3884 * Diagnostic command 'print_interps' prints interpretations in proofs
3885 in addition to interpretations in theories.
3887 * Discontinued obsolete 'global' and 'local' commands to manipulate
3888 the theory name space. Rare INCOMPATIBILITY. The ML functions
3889 Sign.root_path and Sign.local_path may be applied directly where this
3890 feature is still required for historical reasons.
3892 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3893 'definition' instead.
3895 * The "prems" fact, which refers to the accidental collection of
3896 foundational premises in the context, is now explicitly marked as
3897 legacy feature and will be discontinued soon. Consider using "assms"
3898 of the head statement or reference facts by explicit names.
3900 * Document antiquotations @{class} and @{type} print classes and type
3903 * Document antiquotation @{file} checks file/directory entries within
3904 the local file system.
3909 * Coercive subtyping: functions can be declared as coercions and type
3910 inference will add them as necessary upon input of a term. Theory
3911 Complex_Main declares real :: nat => real and real :: int => real as
3912 coercions. A coercion function f is declared like this:
3914 declare [[coercion f]]
3916 To lift coercions through type constructors (e.g. from nat => real to
3917 nat list => real list), map functions can be declared, e.g.
3919 declare [[coercion_map map]]
3921 Currently coercion inference is activated only in theories including
3922 real numbers, i.e. descendants of Complex_Main. This is controlled by
3923 the configuration option "coercion_enabled", e.g. it can be enabled in
3924 other theories like this:
3926 declare [[coercion_enabled]]
3928 * Command 'partial_function' provides basic support for recursive
3929 function definitions over complete partial orders. Concrete instances
3930 are provided for i) the option type, ii) tail recursion on arbitrary
3931 types, and iii) the heap monad of Imperative_HOL. See
3932 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3935 * Function package: f.psimps rules are no longer implicitly declared
3936 as [simp]. INCOMPATIBILITY.
3938 * Datatype package: theorems generated for executable equality (class
3939 "eq") carry proper names and are treated as default code equations.
3941 * Inductive package: now offers command 'inductive_simps' to
3942 automatically derive instantiated and simplified equations for
3943 inductive predicates, similar to 'inductive_cases'.
3945 * Command 'enriched_type' allows to register properties of the
3946 functorial structure of types.
3948 * Improved infrastructure for term evaluation using code generator
3949 techniques, in particular static evaluation conversions.
3951 * Code generator: Scala (2.8 or higher) has been added to the target
3954 * Code generator: globbing constant expressions "*" and "Theory.*"
3955 have been replaced by the more idiomatic "_" and "Theory._".
3958 * Code generator: export_code without explicit file declaration prints
3959 to standard output. INCOMPATIBILITY.
3961 * Code generator: do not print function definitions for case
3962 combinators any longer.
3964 * Code generator: simplification with rules determined with
3965 src/Tools/Code/code_simp.ML and method "code_simp".
3967 * Code generator for records: more idiomatic representation of record
3968 types. Warning: records are not covered by ancient SML code
3969 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3970 rep_datatype declaration helps to succeed then:
3974 rep_datatype foo_ext ...
3976 * Records: logical foundation type for records does not carry a
3977 '_type' suffix any longer (obsolete due to authentic syntax).
3980 * Quickcheck now by default uses exhaustive testing instead of random
3981 testing. Random testing can be invoked by "quickcheck [random]",
3982 exhaustive testing by "quickcheck [exhaustive]".
3984 * Quickcheck instantiates polymorphic types with small finite
3985 datatypes by default. This enables a simple execution mechanism to
3986 handle quantifiers and function equality over the finite datatypes.
3988 * Quickcheck random generator has been renamed from "code" to
3989 "random". INCOMPATIBILITY.
3991 * Quickcheck now has a configurable time limit which is set to 30
3992 seconds by default. This can be changed by adding [timeout = n] to the
3993 quickcheck command. The time limit for Auto Quickcheck is still set
3996 * Quickcheck in locales considers interpretations of that locale for
3997 counter example search.
4000 - Added "smt" and "remote_smt" provers based on the "smt" proof
4001 method. See the Sledgehammer manual for details ("isabelle doc
4004 sledgehammer atp_info ~> sledgehammer running_provers
4005 sledgehammer atp_kill ~> sledgehammer kill_provers
4006 sledgehammer available_atps ~> sledgehammer available_provers
4009 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
4010 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
4011 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
4012 (and "ms" and "min" are no longer supported)
4017 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
4018 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
4020 - Added support for partial quotient types.
4021 - Added local versions of the "Nitpick.register_xxx" functions.
4022 - Added "whack" option.
4023 - Allow registration of quotient types as codatatypes.
4024 - Improved "merge_type_vars" option to merge more types.
4025 - Removed unsound "fast_descrs" option.
4026 - Added custom symmetry breaking for datatypes, making it possible to reach
4027 higher cardinalities.
4028 - Prevent the expansion of too large definitions.
4030 * Proof methods "metis" and "meson" now have configuration options
4031 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
4032 to diagnose these tools. E.g.
4034 using [[metis_trace = true]]
4036 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4037 manually as command 'solve_direct'.
4039 * The default SMT solver Z3 must be enabled explicitly (due to
4040 licensing issues) by setting the environment variable
4041 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4042 commercial applications, the SMT solver CVC3 is provided as fall-back;
4043 changing the SMT solver is done via the configuration option
4046 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4047 i.e. "remote_cvc3" and "remote_z3".
4049 * Added basic SMT support for datatypes, records, and typedefs using
4050 the oracle mode (no proofs). Direct support of pairs has been dropped
4051 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4052 support for a similar behavior). Minor INCOMPATIBILITY.
4054 * Changed SMT configuration options:
4056 z3_proofs ~> smt_oracle (with inverted meaning)
4057 z3_trace_assms ~> smt_trace_used_facts
4070 * Boogie output files (.b2i files) need to be declared in the theory
4073 * Simplification procedure "list_to_set_comprehension" rewrites list
4074 comprehensions applied to List.set to set comprehensions. Occasional
4075 INCOMPATIBILITY, may be deactivated like this:
4077 declare [[simproc del: list_to_set_comprehension]]
4079 * Removed old version of primrec package. INCOMPATIBILITY.
4081 * Removed simplifier congruence rule of "prod_case", as has for long
4082 been the case with "split". INCOMPATIBILITY.
4084 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4086 * Removed [split_format ... and ... and ...] version of
4087 [split_format]. Potential INCOMPATIBILITY.
4089 * Predicate "sorted" now defined inductively, with nice induction
4090 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4092 * Constant "contents" renamed to "the_elem", to free the generic name
4093 contents for other uses. INCOMPATIBILITY.
4095 * Renamed class eq and constant eq (for code generation) to class
4096 equal and constant equal, plus renaming of related facts and various
4097 tuning. INCOMPATIBILITY.
4099 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4101 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4104 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4105 avoid confusion with finite sets. INCOMPATIBILITY.
4107 * Abandoned locales equiv, congruent and congruent2 for equivalence
4108 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4111 * Some previously unqualified names have been qualified:
4118 Trueprop ~> HOL.Trueprop
4123 op --> ~> HOL.implies
4135 Pair ~> Product_Type.Pair
4136 fst ~> Product_Type.fst
4137 snd ~> Product_Type.snd
4138 curry ~> Product_Type.curry
4140 Collect ~> Set.Collect
4144 * More canonical naming convention for some fundamental definitions:
4146 bot_bool_eq ~> bot_bool_def
4147 top_bool_eq ~> top_bool_def
4148 inf_bool_eq ~> inf_bool_def
4149 sup_bool_eq ~> sup_bool_def
4150 bot_fun_eq ~> bot_fun_def
4151 top_fun_eq ~> top_fun_def
4152 inf_fun_eq ~> inf_fun_def
4153 sup_fun_eq ~> sup_fun_def
4157 * More stylized fact names:
4159 expand_fun_eq ~> fun_eq_iff
4160 expand_set_eq ~> set_eq_iff
4162 nat_number ~> eval_nat_numeral
4166 * Refactoring of code-generation specific operations in theory List:
4172 mem_iff ~> member_def
4173 null_empty ~> null_def
4175 INCOMPATIBILITY. Note that these were not supposed to be used
4176 regularly unless for striking reasons; their main purpose was code
4179 Various operations from the Haskell prelude are used for generating
4182 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4183 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4184 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4186 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4187 "*" and "+" respectively. INCOMPATIBILITY.
4189 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4190 "Sum_Type.Plus" instead.
4192 * Constant "split" has been merged with constant "prod_case"; names of
4193 ML functions, facts etc. involving split have been retained so far,
4194 though. INCOMPATIBILITY.
4196 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4197 instead. INCOMPATIBILITY.
4199 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4202 * Former theory Library/Enum is now part of the HOL-Main image.
4203 INCOMPATIBILITY: all constants of the Enum theory now have to be
4204 referred to by its qualified name.
4207 nlists ~> Enum.nlists
4208 product ~> Enum.product
4210 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4211 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4214 * Theory Library/SetsAndFunctions has been split into
4215 Library/Function_Algebras and Library/Set_Algebras; canonical names
4216 for instance definitions for functions; various improvements.
4219 * Theory Library/Multiset provides stable quicksort implementation of
4222 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4225 * Session Multivariate_Analysis: introduced a type class for euclidean
4226 space. Most theorems are now stated in terms of euclidean spaces
4227 instead of finite cartesian products.
4230 real ^ 'n ~> 'a::real_vector
4231 ~> 'a::euclidean_space
4232 ~> 'a::ordered_euclidean_space
4233 (depends on your needs)
4237 \<chi> x. _ ~> \<chi>\<chi> x. _
4240 Also note that the indices are now natural numbers and not from some
4241 finite type. Finite cartesian products of euclidean spaces, products
4242 of euclidean spaces the real and complex numbers are instantiated to
4243 be euclidean_spaces. INCOMPATIBILITY.
4245 * Session Probability: introduced pextreal as positive extended real
4246 numbers. Use pextreal as value for measures. Introduce the
4247 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4248 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4249 the integral in Multivariate Analysis. INCOMPATIBILITY.
4251 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4254 * Session SPARK (with image HOL-SPARK) provides commands to load and
4255 prove verification conditions generated by the SPARK Ada program
4256 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4261 * Theorems for additive ring operations (locale abelian_monoid and
4262 descendants) are generated by interpretation from their multiplicative
4263 counterparts. Names (in particular theorem names) have the mandatory
4264 qualifier 'add'. Previous theorem names are redeclared for
4267 * Structure "int_ring" is now an abbreviation (previously a
4268 definition). This fits more natural with advanced interpretations.
4273 * The domain package now runs in definitional mode by default: The
4274 former command 'new_domain' is now called 'domain'. To use the domain
4275 package in its original axiomatic mode, use 'domain (unsafe)'.
4278 * The new class "domain" is now the default sort. Class "predomain"
4279 is an unpointed version of "domain". Theories can be updated by
4280 replacing sort annotations as shown below. INCOMPATIBILITY.
4282 'a::type ~> 'a::countable
4283 'a::cpo ~> 'a::predomain
4284 'a::pcpo ~> 'a::domain
4286 * The old type class "rep" has been superseded by class "domain".
4287 Accordingly, users of the definitional package must remove any
4288 "default_sort rep" declarations. INCOMPATIBILITY.
4290 * The domain package (definitional mode) now supports unpointed
4291 predomain argument types, as long as they are marked 'lazy'. (Strict
4292 arguments must be in class "domain".) For example, the following
4293 domain definition now works:
4295 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4297 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4298 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4299 'a option, and 'a list. Additionally, it configures fixrec and the
4300 domain package to work with these types. For example:
4302 fixrec isInl :: "('a + 'b) u -> tr"
4303 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4305 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4307 * The "(permissive)" option of fixrec has been replaced with a
4308 per-equation "(unchecked)" option. See
4309 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4311 * The "bifinite" class no longer fixes a constant "approx"; the class
4312 now just asserts that such a function exists. INCOMPATIBILITY.
4314 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4315 defines an embedding of type 'a defl into udom by default; instances
4316 of "bifinite" and "domain" classes are available in
4317 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4319 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4321 * The predicate "directed" has been removed. INCOMPATIBILITY.
4323 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4325 * The function "cprod_map" has been renamed to "prod_map".
4328 * The monadic bind operator on each powerdomain has new binder syntax
4329 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4330 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4332 * The infix syntax for binary union on each powerdomain has changed
4333 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4334 syntax. INCOMPATIBILITY.
4336 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4337 still supported as an input translation.
4339 * Renamed some theorems (the original names are also still available).
4341 expand_fun_below ~> fun_below_iff
4342 below_fun_ext ~> fun_belowI
4343 expand_cfun_eq ~> cfun_eq_iff
4344 ext_cfun ~> cfun_eqI
4345 expand_cfun_below ~> cfun_below_iff
4346 below_cfun_ext ~> cfun_belowI
4347 cont2cont_Rep_CFun ~> cont2cont_APP
4349 * The Abs and Rep functions for various types have changed names.
4350 Related theorem names have also changed to match. INCOMPATIBILITY.
4352 Rep_CFun ~> Rep_cfun
4353 Abs_CFun ~> Abs_cfun
4354 Rep_Sprod ~> Rep_sprod
4355 Abs_Sprod ~> Abs_sprod
4356 Rep_Ssum ~> Rep_ssum
4357 Abs_Ssum ~> Abs_ssum
4359 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4360 been renamed to *_bottom_iff. INCOMPATIBILITY.
4362 * Various changes to bisimulation/coinduction with domain package:
4364 - Definitions of "bisim" constants no longer mention definedness.
4365 - With mutual recursion, "bisim" predicate is now curried.
4366 - With mutual recursion, each type gets a separate coind theorem.
4367 - Variable names in bisim_def and coinduct rules have changed.
4371 * Case combinators generated by the domain package for type "foo" are
4372 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4374 * Several theorems have been renamed to more accurately reflect the
4375 names of constants and types involved. INCOMPATIBILITY.
4377 thelub_const ~> lub_const
4378 lub_const ~> is_lub_const
4380 is_lub_lub ~> is_lubD2
4382 unique_lub ~> is_lub_unique
4383 is_ub_lub ~> is_lub_rangeD1
4384 lub_bin_chain ~> is_lub_bin_chain
4385 lub_fun ~> is_lub_fun
4386 thelub_fun ~> lub_fun
4387 thelub_cfun ~> lub_cfun
4388 thelub_Pair ~> lub_Pair
4389 lub_cprod ~> is_lub_prod
4390 thelub_cprod ~> lub_prod
4391 minimal_cprod ~> minimal_prod
4392 inst_cprod_pcpo ~> inst_prod_pcpo
4394 compact_UU ~> compact_bottom
4395 deflation_UU ~> deflation_bottom
4396 finite_deflation_UU ~> finite_deflation_bottom
4398 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4400 sq_ord_less_eq_trans ~> below_eq_trans
4401 sq_ord_eq_less_trans ~> eq_below_trans
4402 refl_less ~> below_refl
4403 trans_less ~> below_trans
4404 antisym_less ~> below_antisym
4405 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4406 box_less ~> box_below
4407 rev_trans_less ~> rev_below_trans
4408 not_less2not_eq ~> not_below2not_eq
4409 less_UU_iff ~> below_UU_iff
4410 flat_less_iff ~> flat_below_iff
4411 adm_less ~> adm_below
4412 adm_not_less ~> adm_not_below
4413 adm_compact_not_less ~> adm_compact_not_below
4414 less_fun_def ~> below_fun_def
4415 expand_fun_less ~> fun_below_iff
4416 less_fun_ext ~> fun_belowI
4417 less_discr_def ~> below_discr_def
4418 discr_less_eq ~> discr_below_eq
4419 less_unit_def ~> below_unit_def
4420 less_cprod_def ~> below_prod_def
4421 prod_lessI ~> prod_belowI
4422 Pair_less_iff ~> Pair_below_iff
4423 fst_less_iff ~> fst_below_iff
4424 snd_less_iff ~> snd_below_iff
4425 expand_cfun_less ~> cfun_below_iff
4426 less_cfun_ext ~> cfun_belowI
4427 injection_less ~> injection_below
4428 less_up_def ~> below_up_def
4429 not_Iup_less ~> not_Iup_below
4430 Iup_less ~> Iup_below
4432 Def_inject_less_eq ~> Def_below_Def
4433 Def_less_is_eq ~> Def_below_iff
4434 spair_less_iff ~> spair_below_iff
4435 less_sprod ~> below_sprod
4436 spair_less ~> spair_below
4437 sfst_less_iff ~> sfst_below_iff
4438 ssnd_less_iff ~> ssnd_below_iff
4439 fix_least_less ~> fix_least_below
4440 dist_less_one ~> dist_below_one
4441 less_ONE ~> below_ONE
4442 ONE_less_iff ~> ONE_below_iff
4443 less_sinlD ~> below_sinlD
4444 less_sinrD ~> below_sinrD
4449 * All constant names are now qualified internally and use proper
4450 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4455 * Antiquotation @{assert} inlines a function bool -> unit that raises
4456 Fail if the argument is false. Due to inlining the source position of
4457 failed assertions is included in the error output.
4459 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4460 text is in practice always evaluated with a stable theory checkpoint.
4461 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4463 * Antiquotation @{theory A} refers to theory A from the ancestry of
4464 the current context, not any accidental theory loader state as before.
4465 Potential INCOMPATIBILITY, subtle change in semantics.
4467 * Syntax.pretty_priority (default 0) configures the required priority
4468 of pretty-printed output and thus affects insertion of parentheses.
4470 * Syntax.default_root (default "any") configures the inner syntax
4471 category (nonterminal symbol) for parsing of terms.
4473 * Former exception Library.UnequalLengths now coincides with
4474 ListPair.UnequalLengths.
4476 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4477 main functionality is provided by structure Simplifier.
4479 * Renamed raw "explode" function to "raw_explode" to emphasize its
4480 meaning. Note that internally to Isabelle, Symbol.explode is used in
4481 almost all situations.
4483 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4484 See implementation manual for further details on exceptions in
4487 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4490 * Renamed structure PureThy to Pure_Thy and moved most of its
4491 operations to structure Global_Theory, to emphasize that this is
4492 rarely-used global-only stuff.
4494 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4495 instead (or tracing for high-volume output).
4497 * Configuration option show_question_marks only affects regular pretty
4498 printing of types and terms, not raw Term.string_of_vname.
4500 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4501 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4502 @{thms} for most purposes.
4504 * ML structure Unsynchronized is never opened, not even in Isar
4505 interaction mode as before. Old Unsynchronized.set etc. have been
4506 discontinued -- use plain := instead. This should be *rare* anyway,
4507 since modern tools always work via official context data, notably
4508 configuration options.
4510 * Parallel and asynchronous execution requires special care concerning
4511 interrupts. Structure Exn provides some convenience functions that
4512 avoid working directly with raw Interrupt. User code must not absorb
4513 interrupts -- intermediate handling (for cleanup etc.) needs to be
4514 followed by re-raising of the original exception. Another common
4515 source of mistakes are "handle _" patterns, which make the meaning of
4516 the program subject to physical effects of the environment.
4520 New in Isabelle2009-2 (June 2010)
4521 ---------------------------------
4525 * Authentic syntax for *all* logical entities (type classes, type
4526 constructors, term constants): provides simple and robust
4527 correspondence between formal entities and concrete syntax. Within
4528 the parse tree / AST representations, "constants" are decorated by
4529 their category (class, type, const) and spelled out explicitly with
4530 their full internal name.
4532 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4533 and translations (translation rules and translation functions in ML).
4534 Some hints on upgrading:
4536 - Many existing uses of 'syntax' and 'translations' can be replaced
4537 by more modern 'type_notation', 'notation' and 'abbreviation',
4538 which are independent of this issue.
4540 - 'translations' require markup within the AST; the term syntax
4541 provides the following special forms:
4543 CONST c -- produces syntax version of constant c from context
4544 XCONST c -- literally c, checked as constant from context
4545 c -- literally c, if declared by 'syntax'
4547 Plain identifiers are treated as AST variables -- occasionally the
4548 system indicates accidental variables via the error "rhs contains
4551 Type classes and type constructors are marked according to their
4552 concrete syntax. Some old translations rules need to be written
4553 for the "type" category, using type constructor application
4554 instead of pseudo-term application of the default category
4557 - 'parse_translation' etc. in ML may use the following
4560 @{class_syntax c} -- type class c within parse tree / AST
4561 @{term_syntax c} -- type constructor c within parse tree / AST
4562 @{const_syntax c} -- ML version of "CONST c" above
4563 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4565 - Literal types within 'typed_print_translations', i.e. those *not*
4566 represented as pseudo-terms are represented verbatim. Use @{class
4567 c} or @{type_name c} here instead of the above syntax
4570 Note that old non-authentic syntax was based on unqualified base
4571 names, so all of the above "constant" names would coincide. Recall
4572 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4573 diagnose syntax problems.
4575 * Type constructors admit general mixfix syntax, not just infix.
4577 * Concrete syntax may be attached to local entities without a proof
4578 body, too. This works via regular mixfix annotations for 'fix',
4579 'def', 'obtain' etc. or via the explicit 'write' command, which is
4580 similar to the 'notation' command in theory specifications.
4582 * Discontinued unnamed infix syntax (legacy feature for many years) --
4583 need to specify constant name and syntax separately. Internal ML
4584 datatype constructors have been renamed from InfixName to Infix etc.
4585 Minor INCOMPATIBILITY.
4587 * Schematic theorem statements need to be explicitly markup as such,
4588 via commands 'schematic_lemma', 'schematic_theorem',
4589 'schematic_corollary'. Thus the relevance of the proof is made
4590 syntactically clear, which impacts performance in a parallel or
4591 asynchronous interactive environment. Minor INCOMPATIBILITY.
4593 * Use of cumulative prems via "!" in some proof methods has been
4594 discontinued (old legacy feature).
4596 * References 'trace_simp' and 'debug_simp' have been replaced by
4597 configuration options stored in the context. Enabling tracing (the
4598 case of debugging is similar) in proofs works via
4600 using [[trace_simp = true]]
4602 Tracing is then active for all invocations of the simplifier in
4603 subsequent goal refinement steps. Tracing may also still be enabled or
4604 disabled via the ProofGeneral settings menu.
4606 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4607 'hide_fact' replace the former 'hide' KIND command. Minor
4610 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4611 more efficient than combinations with -q1 or -q2.
4616 * Proofterms record type-class reasoning explicitly, using the
4617 "unconstrain" operation internally. This eliminates all sort
4618 constraints from a theorem and proof, introducing explicit
4619 OFCLASS-premises. On the proof term level, this operation is
4620 automatically applied at theorem boundaries, such that closed proofs
4621 are always free of sort constraints. INCOMPATIBILITY for tools that
4622 inspect proof terms.
4624 * Local theory specifications may depend on extra type variables that
4625 are not present in the result type -- arguments TYPE('a) :: 'a itself
4626 are added internally. For example:
4628 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4630 * Predicates of locales introduced by classes carry a mandatory
4631 "class" prefix. INCOMPATIBILITY.
4633 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4635 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4638 * Command 'code_reflect' allows to incorporate generated ML code into
4639 runtime environment; replaces immature code_datatype antiquotation.
4642 * Code generator: simple concept for abstract datatypes obeying
4645 * Code generator: details of internal data cache have no impact on the
4646 user space functionality any longer.
4648 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4649 subgoals. This is more appropriate for interpretations with 'where'.
4652 * Command 'example_proof' opens an empty proof body. This allows to
4653 experiment with Isar, without producing any persistent result.
4655 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4656 within a local theory context, with explicit checking of the
4657 constructors involved (in contrast to the raw 'syntax' versions).
4659 * Commands 'types' and 'typedecl' now work within a local theory
4660 context -- without introducing dependencies on parameters or
4661 assumptions, which is not possible in Isabelle/Pure.
4663 * Command 'defaultsort' has been renamed to 'default_sort', it works
4664 within a local theory context. Minor INCOMPATIBILITY.
4669 * Command 'typedef' now works within a local theory context -- without
4670 introducing dependencies on parameters or assumptions, which is not
4671 possible in Isabelle/Pure/HOL. Note that the logical environment may
4672 contain multiple interpretations of local typedefs (with different
4673 non-emptiness proofs), even in a global theory context.
4675 * New package for quotient types. Commands 'quotient_type' and
4676 'quotient_definition' may be used for defining types and constants by
4677 quotient constructions. An example is the type of integers created by
4678 quotienting pairs of natural numbers:
4681 intrel :: "(nat * nat) => (nat * nat) => bool"
4683 "intrel (x, y) (u, v) = (x + v = u + y)"
4685 quotient_type int = "nat * nat" / intrel
4686 by (auto simp add: equivp_def expand_fun_eq)
4689 "0::int" is "(0::nat, 0::nat)"
4691 The method "lifting" can be used to lift of theorems from the
4692 underlying "raw" type to the quotient type. The example
4693 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4694 construction and provides a reasoning infrastructure for finite sets.
4696 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4697 clash with new theory Quotient in Main HOL.
4699 * Moved the SMT binding into the main HOL session, eliminating
4700 separate HOL-SMT session.
4702 * List membership infix mem operation is only an input abbreviation.
4705 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4706 for future developements; former Library/Word.thy is still present in
4707 the AFP entry RSAPPS.
4709 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4710 longer shadowed. INCOMPATIBILITY.
4712 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4715 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4718 * Dropped normalizing_semiring etc; use the facts in semiring classes
4719 instead. INCOMPATIBILITY.
4721 * Dropped several real-specific versions of lemmas about floor and
4722 ceiling; use the generic lemmas from theory "Archimedean_Field"
4723 instead. INCOMPATIBILITY.
4725 floor_number_of_eq ~> floor_number_of
4726 le_floor_eq_number_of ~> number_of_le_floor
4727 le_floor_eq_zero ~> zero_le_floor
4728 le_floor_eq_one ~> one_le_floor
4729 floor_less_eq_number_of ~> floor_less_number_of
4730 floor_less_eq_zero ~> floor_less_zero
4731 floor_less_eq_one ~> floor_less_one
4732 less_floor_eq_number_of ~> number_of_less_floor
4733 less_floor_eq_zero ~> zero_less_floor
4734 less_floor_eq_one ~> one_less_floor
4735 floor_le_eq_number_of ~> floor_le_number_of
4736 floor_le_eq_zero ~> floor_le_zero
4737 floor_le_eq_one ~> floor_le_one
4738 floor_subtract_number_of ~> floor_diff_number_of
4739 floor_subtract_one ~> floor_diff_one
4740 ceiling_number_of_eq ~> ceiling_number_of
4741 ceiling_le_eq_number_of ~> ceiling_le_number_of
4742 ceiling_le_zero_eq ~> ceiling_le_zero
4743 ceiling_le_eq_one ~> ceiling_le_one
4744 less_ceiling_eq_number_of ~> number_of_less_ceiling
4745 less_ceiling_eq_zero ~> zero_less_ceiling
4746 less_ceiling_eq_one ~> one_less_ceiling
4747 ceiling_less_eq_number_of ~> ceiling_less_number_of
4748 ceiling_less_eq_zero ~> ceiling_less_zero
4749 ceiling_less_eq_one ~> ceiling_less_one
4750 le_ceiling_eq_number_of ~> number_of_le_ceiling
4751 le_ceiling_eq_zero ~> zero_le_ceiling
4752 le_ceiling_eq_one ~> one_le_ceiling
4753 ceiling_subtract_number_of ~> ceiling_diff_number_of
4754 ceiling_subtract_one ~> ceiling_diff_one
4756 * Theory "Finite_Set": various folding_XXX locales facilitate the
4757 application of the various fold combinators on finite sets.
4759 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4760 provides abstract red-black tree type which is backed by "RBT_Impl" as
4761 implementation. INCOMPATIBILTY.
4763 * Theory Library/Coinductive_List has been removed -- superseded by
4764 AFP/thys/Coinductive.
4766 * Theory PReal, including the type "preal" and related operations, has
4767 been removed. INCOMPATIBILITY.
4769 * Real: new development using Cauchy Sequences.
4771 * Split off theory "Big_Operators" containing setsum, setprod,
4772 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4774 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4775 "Int" etc. INCOMPATIBILITY.
4777 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4779 * New set of rules "ac_simps" provides combined assoc / commute
4780 rewrites for all interpretations of the appropriate generic locales.
4782 * Renamed theory "OrderedGroup" to "Groups" and split theory
4783 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4784 appropriate and more consistent names suitable for name prefixes
4785 within the HOL theories. INCOMPATIBILITY.
4787 * Some generic constants have been put to appropriate theories:
4788 - less_eq, less: Orderings
4789 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4790 - inverse, divide: Rings
4793 * More consistent naming of type classes involving orderings (and
4796 lower_semilattice ~> semilattice_inf
4797 upper_semilattice ~> semilattice_sup
4799 dense_linear_order ~> dense_linorder
4801 pordered_ab_group_add ~> ordered_ab_group_add
4802 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4803 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4804 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4805 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4806 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4807 pordered_cancel_semiring ~> ordered_cancel_semiring
4808 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4809 pordered_comm_ring ~> ordered_comm_ring
4810 pordered_comm_semiring ~> ordered_comm_semiring
4811 pordered_ring ~> ordered_ring
4812 pordered_ring_abs ~> ordered_ring_abs
4813 pordered_semiring ~> ordered_semiring
4815 ordered_ab_group_add ~> linordered_ab_group_add
4816 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4817 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4818 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4819 ordered_field ~> linordered_field
4820 ordered_field_no_lb ~> linordered_field_no_lb
4821 ordered_field_no_ub ~> linordered_field_no_ub
4822 ordered_field_dense_linear_order ~> dense_linordered_field
4823 ordered_idom ~> linordered_idom
4824 ordered_ring ~> linordered_ring
4825 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4826 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4827 ordered_ring_strict ~> linordered_ring_strict
4828 ordered_semidom ~> linordered_semidom
4829 ordered_semiring ~> linordered_semiring
4830 ordered_semiring_1 ~> linordered_semiring_1
4831 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4832 ordered_semiring_strict ~> linordered_semiring_strict
4834 The following slightly odd type classes have been moved to a
4835 separate theory Library/Lattice_Algebras:
4837 lordered_ab_group_add ~> lattice_ab_group_add
4838 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4839 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4840 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4841 lordered_ring ~> lattice_ring
4845 * Refined field classes:
4846 - classes division_ring_inverse_zero, field_inverse_zero,
4847 linordered_field_inverse_zero include rule inverse 0 = 0 --
4848 subsumes former division_by_zero class;
4849 - numerous lemmas have been ported from field to division_ring.
4852 * Refined algebra theorem collections:
4853 - dropped theorem group group_simps, use algebra_simps instead;
4854 - dropped theorem group ring_simps, use field_simps instead;
4855 - proper theorem collection field_simps subsumes former theorem
4856 groups field_eq_simps and field_simps;
4857 - dropped lemma eq_minus_self_iff which is a duplicate for
4861 * Theory Finite_Set and List: some lemmas have been generalized from
4864 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4865 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4866 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4867 union_Union_fold_union ~> sup_Sup_fold_sup
4868 Inter_fold_inter ~> Inf_fold_inf
4869 Union_fold_union ~> Sup_fold_sup
4870 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4871 union_UNION_fold_union ~> sup_SUPR_fold_sup
4872 INTER_fold_inter ~> INFI_fold_inf
4873 UNION_fold_union ~> SUPR_fold_sup
4875 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4876 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4877 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4878 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4879 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4880 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4882 * Reorganized theory Multiset: swapped notation of pointwise and
4885 - pointwise ordering is instance of class order with standard syntax
4887 - multiset ordering has syntax <=# and <#; partial order properties
4888 are provided by means of interpretation with prefix
4890 - less duplication, less historical organization of sections,
4891 conversion from associations lists to multisets, rudimentary code
4893 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4898 multiset_eq_conv_count_eq ~> multiset_ext_iff
4899 multi_count_ext ~> multiset_ext
4900 diff_union_inverse2 ~> diff_union_cancelR
4904 * Theory Permutation: replaced local "remove" by List.remove1.
4906 * Code generation: ML and OCaml code is decorated with signatures.
4908 * Theory List: added transpose.
4910 * Library/Nat_Bijection.thy is a collection of bijective functions
4911 between nat and other types, which supersedes the older libraries
4912 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4915 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4916 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4917 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4918 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4919 Countable.pair_encode ~> prod_encode
4920 NatIso.prod2nat ~> prod_encode
4921 NatIso.nat2prod ~> prod_decode
4922 NatIso.sum2nat ~> sum_encode
4923 NatIso.nat2sum ~> sum_decode
4924 NatIso.list2nat ~> list_encode
4925 NatIso.nat2list ~> list_decode
4926 NatIso.set2nat ~> set_encode
4927 NatIso.nat2set ~> set_decode
4930 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4931 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4932 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4933 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4934 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4935 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4936 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4937 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4938 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4939 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4940 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4941 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4942 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4945 - Renamed ATP commands:
4946 atp_info ~> sledgehammer running_atps
4947 atp_kill ~> sledgehammer kill_atps
4948 atp_messages ~> sledgehammer messages
4949 atp_minimize ~> sledgehammer minimize
4950 print_atps ~> sledgehammer available_atps
4952 - Added user's manual ("isabelle doc sledgehammer").
4953 - Added option syntax and "sledgehammer_params" to customize
4954 Sledgehammer's behavior. See the manual for details.
4955 - Modified the Isar proof reconstruction code so that it produces
4956 direct proofs rather than proofs by contradiction. (This feature
4957 is still experimental.)
4958 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4960 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4963 - Added and implemented "binary_ints" and "bits" options.
4964 - Added "std" option and implemented support for nonstandard models.
4965 - Added and implemented "finitize" option to improve the precision
4966 of infinite datatypes based on a monotonicity analysis.
4967 - Added support for quotient types.
4968 - Added support for "specification" and "ax_specification"
4970 - Added support for local definitions (for "function" and
4971 "termination" proofs).
4972 - Added support for term postprocessors.
4973 - Optimized "Multiset.multiset" and "FinFun.finfun".
4974 - Improved efficiency of "destroy_constrs" optimization.
4975 - Fixed soundness bugs related to "destroy_constrs" optimization and
4977 - Fixed soundness bug related to higher-order constructors.
4978 - Fixed soundness bug when "full_descrs" is enabled.
4979 - Improved precision of set constructs.
4980 - Added "atoms" option.
4981 - Added cache to speed up repeated Kodkod invocations on the same
4983 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4984 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4985 "SAT4J_Light". INCOMPATIBILITY.
4986 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4987 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4988 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4990 * Method "induct" now takes instantiations of the form t, where t is not
4991 a variable, as a shorthand for "x == t", where x is a fresh variable.
4992 If this is not intended, t has to be enclosed in parentheses.
4993 By default, the equalities generated by definitional instantiations
4994 are pre-simplified, which may cause parameters of inductive cases
4995 to disappear, or may even delete some of the inductive cases.
4996 Use "induct (no_simp)" instead of "induct" to restore the old
4997 behaviour. The (no_simp) option is also understood by the "cases"
4998 and "nominal_induct" methods, which now perform pre-simplification, too.
5004 * Variable names in lemmas generated by the domain package have
5005 changed; the naming scheme is now consistent with the HOL datatype
5006 package. Some proof scripts may be affected, INCOMPATIBILITY.
5008 * The domain package no longer defines the function "foo_copy" for
5009 recursive domain "foo". The reach lemma is now stated directly in
5010 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
5011 be reformulated in terms of "foo_take", INCOMPATIBILITY.
5013 * Most definedness lemmas generated by the domain package (previously
5014 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
5015 like "foo$x = UU <-> x = UU", which works better as a simp rule.
5016 Proofs that used definedness lemmas as intro rules may break,
5017 potential INCOMPATIBILITY.
5019 * Induction and casedist rules generated by the domain package now
5020 declare proper case_names (one called "bottom", and one named for each
5021 constructor). INCOMPATIBILITY.
5023 * For mutually-recursive domains, separate "reach" and "take_lemma"
5024 rules are generated for each domain, INCOMPATIBILITY.
5026 foo_bar.reach ~> foo.reach bar.reach
5027 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
5029 * Some lemmas generated by the domain package have been renamed for
5030 consistency with the datatype package, INCOMPATIBILITY.
5032 foo.ind ~> foo.induct
5033 foo.finite_ind ~> foo.finite_induct
5034 foo.coind ~> foo.coinduct
5035 foo.casedist ~> foo.exhaust
5036 foo.exhaust ~> foo.nchotomy
5038 * For consistency with other definition packages, the fixrec package
5039 now generates qualified theorem names, INCOMPATIBILITY.
5041 foo_simps ~> foo.simps
5042 foo_unfold ~> foo.unfold
5043 foo_induct ~> foo.induct
5045 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5046 method and internal fixrec proofs now use the default simpset instead.
5049 * The "contlub" predicate has been removed. Proof scripts should use
5050 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5052 * The "admw" predicate has been removed, INCOMPATIBILITY.
5054 * The constants cpair, cfst, and csnd have been removed in favor of
5055 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5060 * Antiquotations for basic formal entities:
5062 @{class NAME} -- type class
5063 @{class_syntax NAME} -- syntax representation of the above
5065 @{type_name NAME} -- logical type
5066 @{type_abbrev NAME} -- type abbreviation
5067 @{nonterminal NAME} -- type of concrete syntactic category
5068 @{type_syntax NAME} -- syntax representation of any of the above
5070 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5071 @{const_abbrev NAME} -- abbreviated constant
5072 @{const_syntax NAME} -- syntax representation of any of the above
5074 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5075 syntax constant (cf. 'syntax' command).
5077 * Antiquotation @{make_string} inlines a function to print arbitrary
5078 values similar to the ML toplevel. The result is compiler dependent
5079 and may fall back on "?" in certain situations.
5081 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5082 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5083 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5084 not work with the asynchronous Isar document model.
5086 * Configuration options now admit dynamic default values, depending on
5087 the context or even global references.
5089 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5090 uses an efficient external library if available (for Poly/ML).
5092 * Renamed some important ML structures, while keeping the old names
5093 for some time as aliases within the structure Legacy:
5095 OuterKeyword ~> Keyword
5098 OuterSyntax ~> Outer_Syntax
5099 PrintMode ~> Print_Mode
5100 SpecParse ~> Parse_Spec
5103 ThyOutput ~> Thy_Output
5104 TypeInfer ~> Type_Infer
5106 Note that "open Legacy" simplifies porting of sources, but forgetting
5107 to remove it again will complicate porting again in the future.
5109 * Most operations that refer to a global context are named
5110 accordingly, e.g. Simplifier.global_context or
5111 ProofContext.init_global. There are some situations where a global
5112 context actually works, but under normal circumstances one needs to
5113 pass the proper local context through the code!
5115 * Discontinued old TheoryDataFun with its copy/init operation -- data
5116 needs to be pure. Functor Theory_Data_PP retains the traditional
5117 Pretty.pp argument to merge, which is absent in the standard
5118 Theory_Data version.
5120 * Sorts.certify_sort and derived "cert" operations for types and terms
5121 no longer minimize sorts. Thus certification at the boundary of the
5122 inference kernel becomes invariant under addition of class relations,
5123 which is an important monotonicity principle. Sorts are now minimized
5124 in the syntax layer only, at the boundary between the end-user and the
5125 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5126 explicitly in rare situations.
5128 * Renamed old-style Drule.standard to Drule.export_without_context, to
5129 emphasize that this is in no way a standard operation.
5132 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5133 usual for resolution. Rare INCOMPATIBILITY.
5135 * Renamed varify/unvarify operations to varify_global/unvarify_global
5136 to emphasize that these only work in a global situation (which is
5139 * Curried take and drop in library.ML; negative length is interpreted
5140 as infinity (as in chop). Subtle INCOMPATIBILITY.
5142 * Proof terms: type substitutions on proof constants now use canonical
5143 order of type variables. INCOMPATIBILITY for tools working with proof
5146 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5147 may no longer carry premises. User-level specifications are
5148 transformed accordingly by Thm.add_axiom/add_def.
5153 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5154 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5155 proof terms are enabled unconditionally in the new HOL-Proofs image.
5157 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5158 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5161 * Old lib/scripts/polyml-platform is superseded by the
5162 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5163 variant, even on a 64 bit machine. The following example setting
5164 prefers 64 bit if available:
5166 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5168 * The preliminary Isabelle/jEdit application demonstrates the emerging
5169 Isabelle/Scala layer for advanced prover interaction and integration.
5170 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5173 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5174 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5175 similar to the default assignment of the document preparation system
5176 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5177 provides some operations for direct access to the font without asking
5178 the user for manual installation.
5182 New in Isabelle2009-1 (December 2009)
5183 -------------------------------------
5187 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5188 one backslash should be used, even in ML sources.
5193 * Locale interpretation propagates mixins along the locale hierarchy.
5194 The currently only available mixins are the equations used to map
5195 local definitions to terms of the target domain of an interpretation.
5197 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5198 loc" to print all interpretations of locale "loc" in the theory.
5199 Interpretations in proofs are not shown.
5201 * Thoroughly revised locales tutorial. New section on conditional
5204 * On instantiation of classes, remaining undefined class parameters
5205 are formally declared. INCOMPATIBILITY.
5208 *** Document preparation ***
5210 * New generalized style concept for printing terms: @{foo (style) ...}
5211 instead of @{foo_style style ...} (old form is still retained for
5212 backward compatibility). Styles can be also applied for
5213 antiquotations prop, term_type and typeof.
5218 * New proof method "smt" for a combination of first-order logic with
5219 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5220 fixed-size bitvectors; there is also basic support for higher-order
5221 features (esp. lambda abstractions). It is an incomplete decision
5222 procedure based on external SMT solvers using the oracle mechanism;
5223 for the SMT solver Z3, this method is proof-producing. Certificates
5224 are provided to avoid calling the external solvers solely for
5225 re-checking proofs. Due to a remote SMT service there is no need for
5226 installing SMT solvers locally. See src/HOL/SMT.
5228 * New commands to load and prove verification conditions generated by
5229 the Boogie program verifier or derived systems (e.g. the Verifying C
5230 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5232 * New counterexample generator tool 'nitpick' based on the Kodkod
5233 relational model finder. See src/HOL/Tools/Nitpick and
5234 src/HOL/Nitpick_Examples.
5236 * New commands 'code_pred' and 'values' to invoke the predicate
5237 compiler and to enumerate values of inductive predicates.
5239 * A tabled implementation of the reflexive transitive closure.
5241 * New implementation of quickcheck uses generic code generator;
5242 default generators are provided for all suitable HOL types, records
5243 and datatypes. Old quickcheck can be re-activated importing theory
5244 Library/SML_Quickcheck.
5246 * New testing tool Mirabelle for automated proof tools. Applies
5247 several tools and tactics like sledgehammer, metis, or quickcheck, to
5248 every proof step in a theory. To be used in batch mode via the
5249 "mirabelle" utility.
5251 * New proof method "sos" (sum of squares) for nonlinear real
5252 arithmetic (originally due to John Harison). It requires theory
5253 Library/Sum_Of_Squares. It is not a complete decision procedure but
5254 works well in practice on quantifier-free real arithmetic with +, -,
5255 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5256 inequalities between polynomials. It makes use of external
5257 semidefinite programming solvers. Method "sos" generates a
5258 certificate that can be pasted into the proof thus avoiding the need
5259 to call an external tool every time the proof is checked. See
5260 src/HOL/Library/Sum_Of_Squares.
5262 * New method "linarith" invokes existing linear arithmetic decision
5265 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5267 * New Sledgehammer option "Full Types" in Proof General settings menu.
5268 Causes full type information to be output to the ATPs. This slows
5269 ATPs down considerably but eliminates a source of unsound "proofs"
5272 * New method "metisFT": A version of metis that uses full type
5273 information in order to avoid failures of proof reconstruction.
5275 * New evaluator "approximate" approximates an real valued term using
5276 the same method as the approximation method.
5278 * Method "approximate" now supports arithmetic expressions as
5279 boundaries of intervals and implements interval splitting and Taylor
5282 * ML antiquotation @{code_datatype} inserts definition of a datatype
5283 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5285 * New theory SupInf of the supremum and infimum operators for sets of
5288 * New theory Probability, which contains a development of measure
5289 theory, eventually leading to Lebesgue integration and probability.
5291 * Extended Multivariate Analysis to include derivation and Brouwer's
5294 * Reorganization of number theory, INCOMPATIBILITY:
5295 - new number theory development for nat and int, in theories Divides
5296 and GCD as well as in new session Number_Theory
5297 - some constants and facts now suffixed with _nat and _int
5299 - former session NumberTheory now named Old_Number_Theory, including
5300 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5301 - moved theory Pocklington from src/HOL/Library to
5302 src/HOL/Old_Number_Theory
5304 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5305 lcm of finite and infinite sets. It is shown that they form a complete
5308 * Class semiring_div requires superclass no_zero_divisors and proof of
5309 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5310 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5311 generalized to class semiring_div, subsuming former theorems
5312 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5313 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5316 * Refinements to lattice classes and sets:
5317 - less default intro/elim rules in locale variant, more default
5318 intro/elim rules in class variant: more uniformity
5319 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5321 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5323 - renamed ACI to inf_sup_aci
5324 - new class "boolean_algebra"
5325 - class "complete_lattice" moved to separate theory
5326 "Complete_Lattice"; corresponding constants (and abbreviations)
5327 renamed and with authentic syntax:
5328 Set.Inf ~> Complete_Lattice.Inf
5329 Set.Sup ~> Complete_Lattice.Sup
5330 Set.INFI ~> Complete_Lattice.INFI
5331 Set.SUPR ~> Complete_Lattice.SUPR
5332 Set.Inter ~> Complete_Lattice.Inter
5333 Set.Union ~> Complete_Lattice.Union
5334 Set.INTER ~> Complete_Lattice.INTER
5335 Set.UNION ~> Complete_Lattice.UNION
5336 - authentic syntax for
5339 - mere abbreviations:
5342 Set.inter (for inf, formerly Set.Int)
5343 Set.union (for sup, formerly Set.Un)
5344 Complete_Lattice.Inter (for Inf)
5345 Complete_Lattice.Union (for Sup)
5346 Complete_Lattice.INTER (for INFI)
5347 Complete_Lattice.UNION (for SUPR)
5348 - object-logic definitions as far as appropriate
5350 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5351 Un_subset_iff are explicitly deleted as default simp rules; then also
5352 their lattice counterparts le_inf_iff and le_sup_iff have to be
5353 deleted to achieve the desired effect.
5355 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5356 rules by default any longer; the same applies to min_max.inf_absorb1
5357 etc. INCOMPATIBILITY.
5359 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5360 pred_set_conv by default. INCOMPATIBILITY.
5362 * Power operations on relations and functions are now one dedicated
5363 constant "compow" with infix syntax "^^". Power operation on
5364 multiplicative monoids retains syntax "^" and is now defined generic
5365 in class power. INCOMPATIBILITY.
5367 * Relation composition "R O S" now has a more standard argument order:
5368 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5369 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5370 break, since the O_assoc rule was not rewritten like this. Fix using
5371 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5373 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5374 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5377 * Most rules produced by inductive and datatype package have mandatory
5378 prefixes. INCOMPATIBILITY.
5380 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5381 the attribute of the same name. Each of the theorems in the list
5382 DERIV_intros assumes composition with an additional function and
5383 matches a variable to the derivative, which has to be solved by the
5384 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5385 of most elementary terms. Former Maclauren.DERIV_tac and
5386 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5389 * Code generator attributes follow the usual underscore convention:
5390 code_unfold replaces code unfold
5391 code_post replaces code post
5396 sizechange -> size_change
5397 induct_scheme -> induction_schema
5400 * Discontinued abbreviation "arbitrary" of constant "undefined".
5401 INCOMPATIBILITY, use "undefined" directly.
5404 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5405 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5406 Suc_plus1 -> Suc_eq_plus1
5407 *anti_sym -> *antisym*
5408 vector_less_eq_def -> vector_le_def
5411 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5414 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5420 * Theory Representable defines a class "rep" of domains that are
5421 representable (via an ep-pair) in the universal domain type "udom".
5422 Instances are provided for all type constructors defined in HOLCF.
5424 * The 'new_domain' command is a purely definitional version of the
5425 domain package, for representable domains. Syntax is identical to the
5426 old domain package. The 'new_domain' package also supports indirect
5427 recursion using previously-defined type constructors. See
5428 src/HOLCF/ex/New_Domain.thy for examples.
5430 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5431 on the left-hand side of an equation, and then performs
5432 simplification. Rewriting is done using rules declared with the
5433 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5434 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5436 * The pattern-match compiler in 'fixrec' can now handle constructors
5437 with HOL function types. Pattern-match combinators for the Pair
5438 constructor are pre-configured.
5440 * The 'fixrec' package now produces better fixed-point induction rules
5441 for mutually-recursive definitions: Induction rules have conclusions
5442 of the form "P foo bar" instead of "P <foo, bar>".
5444 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5445 been renamed to "below". The name "below" now replaces "less" in many
5446 theorem names. (Legacy theorem names using "less" are still supported
5449 * The 'fixrec' package now supports "bottom patterns". Bottom
5450 patterns can be used to generate strictness rules, or to make
5451 functions more strict (much like the bang-patterns supported by the
5452 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5458 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5459 errors and run-time exceptions, including detailed source positions.
5461 * Structure Name_Space (formerly NameSpace) now manages uniquely
5462 identified entries, with some additional information such as source
5463 position, logical grouping etc.
5465 * Theory and context data is now introduced by the simplified and
5466 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5467 to be pure, but the old TheoryDataFun for mutable data (with explicit
5468 copy operation) is still available for some time.
5470 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5471 provides a high-level programming interface to synchronized state
5472 variables with atomic update. This works via pure function
5473 application within a critical section -- its runtime should be as
5474 short as possible; beware of deadlocks if critical code is nested,
5475 either directly or indirectly via other synchronized variables!
5477 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5478 wraps raw ML references, explicitly indicating their non-thread-safe
5479 behaviour. The Isar toplevel keeps this structure open, to
5480 accommodate Proof General as well as quick and dirty interactive
5481 experiments with references.
5483 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5484 parallel tactical reasoning.
5486 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5487 are similar to SUBPROOF, but are slightly more flexible: only the
5488 specified parts of the subgoal are imported into the context, and the
5489 body tactic may introduce new subgoals and schematic variables.
5491 * Old tactical METAHYPS, which does not observe the proof context, has
5492 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5493 or Subgoal.FOCUS etc.
5495 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5496 functors have their own ML name space there is no point to mark them
5497 separately.) Minor INCOMPATIBILITY.
5499 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5501 * Renamed several structures FooBar to Foo_Bar. Occasional,
5504 * Operations of structure Skip_Proof no longer require quick_and_dirty
5505 mode, which avoids critical setmp.
5507 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5508 combinators for "args". INCOMPATIBILITY, need to use simplified
5509 Attrib/Method.setup introduced in Isabelle2009.
5511 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5512 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5513 last resort. INCOMPATIBILITY.
5515 * Display.pretty_thm now requires a proper context (cf. former
5516 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5517 or even Display.pretty_thm_without_context as last resort.
5520 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5521 Syntax.pretty_typ/term directly, preferably with proper context
5522 instead of global theory.
5527 * Further fine tuning of parallel proof checking, scales up to 8 cores
5528 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5531 * Support for additional "Isabelle components" via etc/components, see
5532 also the system manual.
5534 * The isabelle makeall tool now operates on all components with
5535 IsaMakefile, not just hardwired "logics".
5537 * Removed "compress" option from isabelle-process and isabelle usedir;
5538 this is always enabled.
5540 * Discontinued support for Poly/ML 4.x versions.
5542 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5543 on a given logic image. This requires the lighttpd webserver and is
5544 currently supported on Linux only.
5548 New in Isabelle2009 (April 2009)
5549 --------------------------------
5553 * Simplified main Isabelle executables, with less surprises on
5554 case-insensitive file-systems (such as Mac OS).
5556 - The main Isabelle tool wrapper is now called "isabelle" instead of
5559 - The former "isabelle" alias for "isabelle-process" has been
5560 removed (should rarely occur to regular users).
5562 - The former "isabelle-interface" and its alias "Isabelle" have been
5563 removed (interfaces are now regular Isabelle tools).
5565 Within scripts and make files, the Isabelle environment variables
5566 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5567 respectively. (The latter are still available as legacy feature.)
5569 The old isabelle-interface wrapper could react in confusing ways if
5570 the interface was uninstalled or changed otherwise. Individual
5571 interface tool configuration is now more explicit, see also the
5572 Isabelle system manual. In particular, Proof General is now available
5573 via "isabelle emacs".
5575 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5576 purge installed copies of Isabelle executables and re-run "isabelle
5577 install -p ...", or use symlinks.
5579 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5580 old ~/isabelle, which was slightly non-standard and apt to cause
5581 surprises on case-insensitive file-systems (such as Mac OS).
5583 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5584 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5585 care is required when using older releases of Isabelle. Note that
5586 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5587 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5589 * Proofs of fully specified statements are run in parallel on
5590 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5591 a regular 4-core machine, if the initial heap space is made reasonably
5592 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5594 * The main reference manuals ("isar-ref", "implementation", and
5595 "system") have been updated and extended. Formally checked references
5596 as hyperlinks are now available uniformly.
5601 * Complete re-implementation of locales. INCOMPATIBILITY in several
5602 respects. The most important changes are listed below. See the
5603 Tutorial on Locales ("locales" manual) for details.
5605 - In locale expressions, instantiation replaces renaming. Parameters
5606 must be declared in a for clause. To aid compatibility with previous
5607 parameter inheritance, in locale declarations, parameters that are not
5608 'touched' (instantiation position "_" or omitted) are implicitly added
5609 with their syntax at the beginning of the for clause.
5611 - Syntax from abbreviations and definitions in locales is available in
5612 locale expressions and context elements. The latter is particularly
5613 useful in locale declarations.
5615 - More flexible mechanisms to qualify names generated by locale
5616 expressions. Qualifiers (prefixes) may be specified in locale
5617 expressions, and can be marked as mandatory (syntax: "name!:") or
5618 optional (syntax "name?:"). The default depends for plain "name:"
5619 depends on the situation where a locale expression is used: in
5620 commands 'locale' and 'sublocale' prefixes are optional, in
5621 'interpretation' and 'interpret' prefixes are mandatory. The old
5622 implicit qualifiers derived from the parameter names of a locale are
5623 no longer generated.
5625 - Command "sublocale l < e" replaces "interpretation l < e". The
5626 instantiation clause in "interpretation" and "interpret" (square
5627 brackets) is no longer available. Use locale expressions.
5629 - When converting proof scripts, mandatory qualifiers in
5630 'interpretation' and 'interpret' should be retained by default, even
5631 if this is an INCOMPATIBILITY compared to former behavior. In the
5632 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5633 in locale expressions range over a single locale instance only.
5635 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5636 In existing theorem specifications replace the includes element by the
5637 respective context elements of the included locale, omitting those
5638 that are already present in the theorem specification. Multiple
5639 assume elements of a locale should be replaced by a single one
5640 involving the locale predicate. In the proof body, declarations (most
5641 notably theorems) may be regained by interpreting the respective
5642 locales in the proof context as required (command "interpret").
5644 If using "includes" in replacement of a target solely because the
5645 parameter types in the theorem are not as general as in the target,
5646 consider declaring a new locale with additional type constraints on
5647 the parameters (context element "constrains").
5649 - Discontinued "locale (open)". INCOMPATIBILITY.
5651 - Locale interpretation commands no longer attempt to simplify goal.
5652 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5653 methods intro_locales and unfold_locales to clarify.
5655 - Locale interpretation commands no longer accept interpretation
5656 attributes. INCOMPATIBILITY.
5658 * Class declaration: so-called "base sort" must not be given in import
5659 list any longer, but is inferred from the specification. Particularly
5666 class foo = type + ...
5668 * Class target: global versions of theorems stemming do not carry a
5669 parameter prefix any longer. INCOMPATIBILITY.
5671 * Class 'instance' command no longer accepts attached definitions.
5672 INCOMPATIBILITY, use proper 'instantiation' target instead.
5674 * Recovered hiding of consts, which was accidentally broken in
5675 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5676 makes c inaccessible; consider using ``hide (open) const c'' instead.
5678 * Slightly more coherent Pure syntax, with updated documentation in
5679 isar-ref manual. Removed locales meta_term_syntax and
5680 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5681 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5682 directly in regular applications.
5684 * There is a new syntactic category "float_const" for signed decimal
5685 fractions (e.g. 123.45 or -123.45).
5687 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5688 interface with 'setup' command instead.
5690 * Command 'local_setup' is similar to 'setup', but operates on a local
5693 * The 'axiomatization' command now only works within a global theory
5694 context. INCOMPATIBILITY.
5696 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5697 hypotheses. Sorts required in the course of reasoning need to be
5698 covered by the constraints in the initial statement, completed by the
5699 type instance information of the background theory. Non-trivial sort
5700 hypotheses, which rarely occur in practice, may be specified via
5701 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5703 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5705 The result contains an implicit sort hypotheses as before --
5706 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5709 * Generalized Isar history, with support for linear undo, direct state
5712 * Changed defaults for unify configuration options:
5714 unify_trace_bound = 50 (formerly 25)
5715 unify_search_bound = 60 (formerly 30)
5717 * Different bookkeeping for code equations (INCOMPATIBILITY):
5719 a) On theory merge, the last set of code equations for a particular
5720 constant is taken (in accordance with the policy applied by other
5721 parts of the code generator framework).
5723 b) Code equations stemming from explicit declarations (e.g. code
5724 attribute) gain priority over default code equations stemming
5725 from definition, primrec, fun etc.
5727 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5729 * Unified theorem tables for both code generators. Thus [code
5730 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5732 * Command 'find_consts' searches for constants based on type and name
5735 find_consts "_ => bool"
5737 By default, matching is against subtypes, but it may be restricted to
5738 the whole type. Searching by name is possible. Multiple queries are
5739 conjunctive and queries may be negated by prefixing them with a
5742 find_consts strict: "_ => bool" name: "Int" -"int => int"
5744 * New 'find_theorems' criterion "solves" matches theorems that
5745 directly solve the current goal (modulo higher-order unification).
5747 * Auto solve feature for main theorem statements: whenever a new goal
5748 is stated, "find_theorems solves" is called; any theorems that could
5749 solve the lemma directly are listed as part of the goal state.
5750 Cf. associated options in Proof General Isabelle settings menu,
5751 enabled by default, with reasonable timeout for pathological cases of
5752 higher-order unification.
5755 *** Document preparation ***
5757 * Antiquotation @{lemma} now imitates a regular terminal proof,
5758 demanding keyword 'by' and supporting the full method expression
5759 syntax just like the Isar command 'by'.
5764 * Integrated main parts of former image HOL-Complex with HOL. Entry
5765 points Main and Complex_Main remain as before.
5767 * Logic image HOL-Plain provides a minimal HOL with the most important
5768 tools available (inductive, datatype, primrec, ...). This facilitates
5769 experimentation and tool development. Note that user applications
5770 (and library theories) should never refer to anything below theory
5773 * Logic image HOL-Main stops at theory Main, and thus facilitates
5774 experimentation due to shorter build times.
5776 * Logic image HOL-NSA contains theories of nonstandard analysis which
5777 were previously part of former HOL-Complex. Entry point Hyperreal
5778 remains valid, but theories formerly using Complex_Main should now use
5779 new entry point Hypercomplex.
5781 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5782 Posix processes. Avoids potentially expensive forking of the ML
5783 process. New thread-based implementation also works on non-Unix
5784 platforms (Cygwin). Provers are no longer hardwired, but defined
5785 within the theory via plain ML wrapper functions. Basic Sledgehammer
5786 commands are covered in the isar-ref manual.
5788 * Wrapper scripts for remote SystemOnTPTP service allows to use
5789 sledgehammer without local ATP installation (Vampire etc.). Other
5790 provers may be included via suitable ML wrappers, see also
5791 src/HOL/ATP_Linkup.thy.
5793 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5796 * The metis method no longer fails because the theorem is too trivial
5797 (contains the empty clause).
5799 * The metis method now fails in the usual manner, rather than raising
5800 an exception, if it determines that it cannot prove the theorem.
5802 * Method "coherent" implements a prover for coherent logic (see also
5803 src/Tools/coherent.ML).
5805 * Constants "undefined" and "default" replace "arbitrary". Usually
5806 "undefined" is the right choice to replace "arbitrary", though
5807 logically there is no difference. INCOMPATIBILITY.
5809 * Command "value" now integrates different evaluation mechanisms. The
5810 result of the first successful evaluation mechanism is printed. In
5811 square brackets a particular named evaluation mechanisms may be
5812 specified (currently, [SML], [code] or [nbe]). See further
5813 src/HOL/ex/Eval_Examples.thy.
5815 * Normalization by evaluation now allows non-leftlinear equations.
5816 Declare with attribute [code nbe].
5818 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5819 as the structured Isar versions "cases" and "induct", cf. the
5820 corresponding "cases" and "induct" attributes. Mutual induction rules
5821 are now presented as a list of individual projections
5822 (e.g. foo_bar.inducts for types foo and bar); the old format with
5823 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5824 rare situations a different rule is selected --- notably nested tuple
5825 elimination instead of former prod.exhaust: use explicit (case_tac t
5826 rule: prod.exhaust) here.
5828 * Attributes "cases", "induct", "coinduct" support "del" option.
5830 * Removed fact "case_split_thm", which duplicates "case_split".
5832 * The option datatype has been moved to a new theory Option. Renamed
5833 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5835 * New predicate "strict_mono" classifies strict functions on partial
5836 orders. With strict functions on linear orders, reasoning about
5837 (in)equalities is facilitated by theorems "strict_mono_eq",
5838 "strict_mono_less_eq" and "strict_mono_less".
5840 * Some set operations are now proper qualified constants with
5841 authentic syntax. INCOMPATIBILITY:
5852 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5855 * Auxiliary class "itself" has disappeared -- classes without any
5856 parameter are treated as expected by the 'class' command.
5858 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5860 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5861 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5863 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5864 method "approximation". It proves formulas on real values by using
5865 interval arithmetic. In the formulas are also the transcendental
5866 functions sin, cos, tan, atan, ln, exp and the constant pi are
5867 allowed. For examples see
5868 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5870 * Theory "Reflection" now resides in HOL/Library.
5872 * Entry point to Word library now simply named "Word".
5875 * Made source layout more coherent with logical distribution
5878 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5879 src/HOL/Library/Code_Message.thy ~> src/HOL/
5880 src/HOL/Library/GCD.thy ~> src/HOL/
5881 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5882 src/HOL/Library/Parity.thy ~> src/HOL/
5883 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5884 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5885 src/HOL/Real/Lubs.thy ~> src/HOL/
5886 src/HOL/Real/PReal.thy ~> src/HOL/
5887 src/HOL/Real/Rational.thy ~> src/HOL/
5888 src/HOL/Real/RComplete.thy ~> src/HOL/
5889 src/HOL/Real/RealDef.thy ~> src/HOL/
5890 src/HOL/Real/RealPow.thy ~> src/HOL/
5891 src/HOL/Real/Real.thy ~> src/HOL/
5892 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5893 src/HOL/Complex/Complex.thy ~> src/HOL/
5894 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5895 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5896 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5897 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5898 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5899 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5900 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5901 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5902 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5903 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5904 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5905 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5906 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5907 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5908 src/HOL/Real/Float ~> src/HOL/Library/
5909 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5910 src/HOL/Real/RealVector.thy ~> src/HOL/
5912 src/HOL/arith_data.ML ~> src/HOL/Tools
5913 src/HOL/hologic.ML ~> src/HOL/Tools
5914 src/HOL/simpdata.ML ~> src/HOL/Tools
5915 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5916 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5917 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5918 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5919 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5920 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5921 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5923 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5924 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5925 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5926 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5927 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5928 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5930 * If methods "eval" and "evaluation" encounter a structured proof
5931 state with !!/==>, only the conclusion is evaluated to True (if
5932 possible), avoiding strange error messages.
5934 * Method "sizechange" automates termination proofs using (a
5935 modification of) the size-change principle. Requires SAT solver. See
5936 src/HOL/ex/Termination.thy for examples.
5938 * Simplifier: simproc for let expressions now unfolds if bound
5939 variable occurs at most once in let expression body. INCOMPATIBILITY.
5941 * Method "arith": Linear arithmetic now ignores all inequalities when
5942 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5944 * New attribute "arith" for facts that should always be used
5945 automatically by arithmetic. It is intended to be used locally in
5948 assumes [arith]: "x > 0"
5950 Global usage is discouraged because of possible performance impact.
5952 * New classes "top" and "bot" with corresponding operations "top" and
5953 "bot" in theory Orderings; instantiation of class "complete_lattice"
5954 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5956 * Changed definition lemma "less_fun_def" in order to provide an
5957 instance for preorders on functions; use lemma "less_le" instead.
5960 * Theory Orderings: class "wellorder" moved here, with explicit
5961 induction rule "less_induct" as assumption. For instantiation of
5962 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5965 * Theory Orderings: added class "preorder" as superclass of "order".
5966 INCOMPATIBILITY: Instantiation proofs for order, linorder
5967 etc. slightly changed. Some theorems named order_class.* now named
5970 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5973 * Theory Finite_Set: added a new fold combinator of type
5975 ('a => 'b => 'b) => 'b => 'a set => 'b
5977 Occasionally this is more convenient than the old fold combinator
5978 which is now defined in terms of the new one and renamed to
5981 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5982 and "ring_simps" have been replaced by "algebra_simps" (which can be
5983 extended with further lemmas!). At the moment both still exist but
5984 the former will disappear at some point.
5986 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5987 class recpower. Type-specific simp rules for various recpower types
5988 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5990 rat_power_0 -> power_0
5991 rat_power_Suc -> power_Suc
5992 realpow_0 -> power_0
5993 realpow_Suc -> power_Suc
5994 complexpow_0 -> power_0
5995 complexpow_Suc -> power_Suc
5996 power_poly_0 -> power_0
5997 power_poly_Suc -> power_Suc
5999 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
6000 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
6001 dvd has been generalized to class comm_semiring_1. Likewise a bunch
6002 of lemmas from Divides has been generalized from nat to class
6003 semiring_div. INCOMPATIBILITY. This involves the following theorem
6004 renames resulting from duplicate elimination:
6006 dvd_def_mod ~> dvd_eq_mod_eq_0
6007 zero_dvd_iff ~> dvd_0_left_iff
6008 dvd_0 ~> dvd_0_right
6009 DIVISION_BY_ZERO_DIV ~> div_by_0
6010 DIVISION_BY_ZERO_MOD ~> mod_by_0
6011 mult_div ~> div_mult_self2_is_id
6012 mult_mod ~> mod_mult_self2_is_0
6014 * Theory IntDiv: removed many lemmas that are instances of class-based
6015 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
6016 rename old lemmas as follows:
6018 dvd_diff -> nat_dvd_diff
6019 dvd_zminus_iff -> dvd_minus_iff
6020 mod_add1_eq -> mod_add_eq
6021 mod_mult1_eq -> mod_mult_right_eq
6022 mod_mult1_eq' -> mod_mult_left_eq
6023 mod_mult_distrib_mod -> mod_mult_eq
6024 nat_mod_add_left_eq -> mod_add_left_eq
6025 nat_mod_add_right_eq -> mod_add_right_eq
6026 nat_mod_div_trivial -> mod_div_trivial
6027 nat_mod_mod_trivial -> mod_mod_trivial
6028 zdiv_zadd_self1 -> div_add_self1
6029 zdiv_zadd_self2 -> div_add_self2
6030 zdiv_zmult_self1 -> div_mult_self2_is_id
6031 zdiv_zmult_self2 -> div_mult_self1_is_id
6032 zdvd_triv_left -> dvd_triv_left
6033 zdvd_triv_right -> dvd_triv_right
6034 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
6035 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6036 zmod_zadd_left_eq -> mod_add_left_eq
6037 zmod_zadd_right_eq -> mod_add_right_eq
6038 zmod_zadd_self1 -> mod_add_self1
6039 zmod_zadd_self2 -> mod_add_self2
6040 zmod_zadd1_eq -> mod_add_eq
6041 zmod_zdiff1_eq -> mod_diff_eq
6042 zmod_zdvd_zmod -> mod_mod_cancel
6043 zmod_zmod_cancel -> mod_mod_cancel
6044 zmod_zmult_self1 -> mod_mult_self2_is_0
6045 zmod_zmult_self2 -> mod_mult_self1_is_0
6048 zdvd_abs1 -> abs_dvd_iff
6049 zdvd_abs2 -> dvd_abs_iff
6050 zdvd_refl -> dvd_refl
6051 zdvd_trans -> dvd_trans
6052 zdvd_zadd -> dvd_add
6053 zdvd_zdiff -> dvd_diff
6054 zdvd_zminus_iff -> dvd_minus_iff
6055 zdvd_zminus2_iff -> minus_dvd_iff
6056 zdvd_zmultD -> dvd_mult_right
6057 zdvd_zmultD2 -> dvd_mult_left
6058 zdvd_zmult_mono -> mult_dvd_mono
6059 zdvd_0_right -> dvd_0_right
6060 zdvd_0_left -> dvd_0_left_iff
6061 zdvd_1_left -> one_dvd
6062 zminus_dvd_iff -> minus_dvd_iff
6064 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6066 * The real numbers offer decimal input syntax: 12.34 is translated
6067 into 1234/10^2. This translation is not reversed upon output.
6069 * Theory Library/Polynomial defines an abstract type 'a poly of
6070 univariate polynomials with coefficients of type 'a. In addition to
6071 the standard ring operations, it also supports div and mod. Code
6072 generation is also supported, using list-style constructors.
6074 * Theory Library/Inner_Product defines a class of real_inner for real
6075 inner product spaces, with an overloaded operation inner :: 'a => 'a
6076 => real. Class real_inner is a subclass of real_normed_vector from
6079 * Theory Library/Product_Vector provides instances for the product
6080 type 'a * 'b of several classes from RealVector and Inner_Product.
6081 Definitions of addition, subtraction, scalar multiplication, norms,
6082 and inner products are included.
6084 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6085 addition to the field operations, numerals and case syntax are also
6088 * Theory Library/Diagonalize provides constructive version of Cantor's
6089 first diagonalization argument.
6091 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6092 zlcm (for int); carried together from various gcd/lcm developements in
6093 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6094 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6095 may recover tupled syntax as follows:
6097 hide (open) const gcd
6098 abbreviation gcd where
6099 "gcd == (%(a, b). GCD.gcd a b)"
6101 GCD.gcd ("gcd '(_, _')")
6103 The same works for lcm, zgcd, zlcm.
6105 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6106 instantiations for algebraic structures. Removed some duplicate
6107 theorems. Changes in simp rules. INCOMPATIBILITY.
6109 * ML antiquotation @{code} takes a constant as argument and generates
6110 corresponding code in background and inserts name of the corresponding
6111 resulting ML value/function/datatype constructor binding in place.
6112 All occurrences of @{code} with a single ML block are generated
6113 simultaneously. Provides a generic and safe interface for
6114 instrumentalizing code generation. See
6115 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6116 In future you ought to refrain from ad-hoc compiling generated SML
6117 code on the ML toplevel. Note that (for technical reasons) @{code}
6118 cannot refer to constants for which user-defined serializations are
6119 set. Refer to the corresponding ML counterpart directly in that
6122 * Command 'rep_datatype': instead of theorem names the command now
6123 takes a list of terms denoting the constructors of the type to be
6124 represented as datatype. The characteristic theorems have to be
6125 proven. INCOMPATIBILITY. Also observe that the following theorems
6126 have disappeared in favour of existing ones:
6128 unit_induct ~> unit.induct
6129 prod_induct ~> prod.induct
6130 sum_induct ~> sum.induct
6131 Suc_Suc_eq ~> nat.inject
6132 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6137 * New locales for orders and lattices where the equivalence relation
6138 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6139 locales use a record structure with field eq for the equivalence.
6141 * New theory of factorial domains.
6143 * Units_l_inv and Units_r_inv are now simp rules by default.
6144 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6145 and/or r_inv will now also require deletion of these lemmas.
6147 * Renamed the following theorems, INCOMPATIBILITY:
6149 UpperD ~> Upper_memD
6150 LowerD ~> Lower_memD
6151 least_carrier ~> least_closed
6152 greatest_carrier ~> greatest_closed
6153 greatest_Lower_above ~> greatest_Lower_below
6154 one_zero ~> carrier_one_zero
6155 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6160 * Nominal datatypes can now contain type-variables.
6162 * Commands 'nominal_inductive' and 'equivariance' work with local
6165 * Nominal primrec can now works with local theory targets and its
6166 specification syntax now conforms to the general format as seen in
6169 * Method "perm_simp" honours the standard simplifier attributes
6170 (no_asm), (no_asm_use) etc.
6172 * The new predicate #* is defined like freshness, except that on the
6173 left hand side can be a set or list of atoms.
6175 * Experimental command 'nominal_inductive2' derives strong induction
6176 principles for inductive definitions. In contrast to
6177 'nominal_inductive', which can only deal with a fixed number of
6178 binders, it can deal with arbitrary expressions standing for sets of
6179 atoms to be avoided. The only inductive definition we have at the
6180 moment that needs this generalisation is the typing rule for Lets in
6183 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6184 -----------------------------------------------------------------
6185 Gamma |- Let x be t1 in t2 : T2
6187 In this rule one wants to avoid all the binders that are introduced by
6188 "close Gamma T1". We are looking for other examples where this
6189 feature might be useful. Please let us know.
6194 * Reimplemented the simplification procedure for proving continuity
6195 subgoals. The new simproc is extensible; users can declare additional
6196 continuity introduction rules with the attribute [cont2cont].
6198 * The continuity simproc now uses a different introduction rule for
6199 solving continuity subgoals on terms with lambda abstractions. In
6200 some rare cases the new simproc may fail to solve subgoals that the
6201 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6202 Potential INCOMPATIBILITY.
6204 * Command 'fixrec': specification syntax now conforms to the general
6205 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6206 examples. INCOMPATIBILITY.
6211 * Proof of Zorn's Lemma for partial orders.
6216 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6217 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6218 depends on multithreading, so timouts will not work before Poly/ML
6221 * High-level support for concurrent ML programming, see
6222 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6223 particularly convenient to organize independent functional
6224 computations. The concept of "synchronized variables" provides a
6225 higher-order interface for components with shared state, avoiding the
6226 delicate details of mutexes and condition variables. (Requires
6227 Poly/ML 5.2.1 or later.)
6229 * ML bindings produced via Isar commands are stored within the Isar
6230 context (theory or proof). Consequently, commands like 'use' and 'ML'
6231 become thread-safe and work with undo as expected (concerning
6232 top-level bindings, not side-effects on global references).
6233 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6234 compiler at runtime; really global bindings need to be given outside a
6235 theory. (Requires Poly/ML 5.2 or later.)
6237 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6238 context. Top-level ML bindings are stored within the proof context in
6239 a purely sequential fashion, disregarding the nested proof structure.
6240 ML bindings introduced by 'ML_prf' are discarded at the end of the
6241 proof. (Requires Poly/ML 5.2 or later.)
6243 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6244 and Method.setup, as well as Isar commands 'attribute_setup' and
6245 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6246 existing code accordingly, or use plain 'setup' together with old
6249 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6250 to 'a -> thm, while results are always tagged with an authentic oracle
6251 name. The Isar command 'oracle' is now polymorphic, no argument type
6252 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6253 accordingly. Note that extra performance may be gained by producing
6254 the cterm carefully, avoiding slow Thm.cterm_of.
6256 * Simplified interface for defining document antiquotations via
6257 ThyOutput.antiquotation, ThyOutput.output, and optionally
6258 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6259 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6262 * More systematic treatment of long names, abstract name bindings, and
6263 name space operations. Basic operations on qualified names have been
6264 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6265 Long_Name.append. Old type bstring has been mostly replaced by
6266 abstract type binding (see structure Binding), which supports precise
6267 qualification by packages and local theory targets, as well as proper
6268 tracking of source positions. INCOMPATIBILITY, need to wrap old
6269 bstring values into Binding.name, or better pass through abstract
6270 bindings everywhere. See further src/Pure/General/long_name.ML,
6271 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6273 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6274 LocalTheory.note etc.) now refer to the *full* internal name, not the
6275 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6277 * Disposed old type and term read functions (Sign.read_def_typ,
6278 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6279 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6280 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6281 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6282 resort for legacy applications.
6284 * Disposed old declarations, tactics, tactic combinators that refer to
6285 the simpset or claset of an implicit theory (such as Addsimps,
6286 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6287 embedded ML text, or local_simpset_of with a proper context passed as
6288 explicit runtime argument.
6290 * Rules and tactics that read instantiations (read_instantiate,
6291 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6292 context, which is required for parsing and type-checking. Moreover,
6293 the variables are specified as plain indexnames, not string encodings
6294 thereof. INCOMPATIBILITY.
6296 * Generic Toplevel.add_hook interface allows to analyze the result of
6297 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6298 for theorem dependency output of transactions resulting in a new
6301 * ML antiquotations: block-structured compilation context indicated by
6302 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6304 @{binding name} - basic name binding
6305 @{let ?pat = term} - term abbreviation (HO matching)
6306 @{note name = fact} - fact abbreviation
6307 @{thm fact} - singleton fact (with attributes)
6308 @{thms fact} - general fact (with attributes)
6309 @{lemma prop by method} - singleton goal
6310 @{lemma prop by meth1 meth2} - singleton goal
6311 @{lemma prop1 ... propN by method} - general goal
6312 @{lemma prop1 ... propN by meth1 meth2} - general goal
6313 @{lemma (open) ...} - open derivation
6318 * The Isabelle "emacs" tool provides a specific interface to invoke
6319 Proof General / Emacs, with more explicit failure if that is not
6320 installed (the old isabelle-interface script silently falls back on
6321 isabelle-process). The PROOFGENERAL_HOME setting determines the
6322 installation location of the Proof General distribution.
6324 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6325 the Isabelle process into a JVM/Scala application. See
6326 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6327 process wrapper has been discontinued.)
6329 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6331 * Various status messages (with exact source position information) are
6332 emitted, if proper markup print mode is enabled. This allows
6333 user-interface components to provide detailed feedback on internal
6338 New in Isabelle2008 (June 2008)
6339 -------------------------------
6343 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6344 and updated, with formally checked references as hyperlinks.
6346 * Theory loader: use_thy (and similar operations) no longer set the
6347 implicit ML context, which was occasionally hard to predict and in
6348 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6349 provides a proper context already.
6351 * Theory loader: old-style ML proof scripts being *attached* to a thy
6352 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6353 'use' within a theory file will do the job.
6355 * Name space merge now observes canonical order, i.e. the second space
6356 is inserted into the first one, while existing entries in the first
6357 space take precedence. INCOMPATIBILITY in rare situations, may try to
6358 swap theory imports.
6360 * Syntax: symbol \<chi> is now considered a letter. Potential
6361 INCOMPATIBILITY in identifier syntax etc.
6363 * Outer syntax: string tokens no longer admit escaped white space,
6364 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6365 white space without escapes.
6367 * Outer syntax: string tokens may contain arbitrary character codes
6368 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6374 * Context-dependent token translations. Default setup reverts locally
6375 fixed variables, and adds hilite markup for undeclared frees.
6377 * Unused theorems can be found using the new command 'unused_thms'.
6378 There are three ways of invoking it:
6381 Only finds unused theorems in the current theory.
6383 (2) unused_thms thy_1 ... thy_n -
6384 Finds unused theorems in the current theory and all of its ancestors,
6385 excluding the theories thy_1 ... thy_n and all of their ancestors.
6387 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6388 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6389 their ancestors, excluding the theories thy_1 ... thy_n and all of
6392 In order to increase the readability of the list produced by
6393 unused_thms, theorems that have been created by a particular instance
6394 of a theory command such as 'inductive' or 'function' are considered
6395 to belong to the same "group", meaning that if at least one theorem in
6396 this group is used, the other theorems in the same group are no longer
6397 reported as unused. Moreover, if all theorems in the group are
6398 unused, only one theorem in the group is displayed.
6400 Note that proof objects have to be switched on in order for
6401 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6402 usually the case when using Proof General with the default settings).
6404 * Authentic naming of facts disallows ad-hoc overwriting of previous
6405 theorems within the same name space. INCOMPATIBILITY, need to remove
6406 duplicate fact bindings, or even accidental fact duplications. Note
6407 that tools may maintain dynamically scoped facts systematically, using
6408 PureThy.add_thms_dynamic.
6410 * Command 'hide' now allows to hide from "fact" name space as well.
6412 * Eliminated destructive theorem database, simpset, claset, and
6413 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6414 update of theories within ML code.
6416 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6417 INCOMPATIBILITY, object-logics depending on former Pure require
6418 additional setup PureThy.old_appl_syntax_setup; object-logics
6419 depending on former CPure need to refer to Pure.
6421 * Commands 'use' and 'ML' are now purely functional, operating on
6422 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6423 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6426 * Command 'setup': discontinued implicit version with ML reference.
6428 * Instantiation target allows for simultaneous specification of class
6429 instance operations together with an instantiation proof.
6430 Type-checking phase allows to refer to class operations uniformly.
6431 See src/HOL/Complex/Complex.thy for an Isar example and
6432 src/HOL/Library/Eval.thy for an ML example.
6434 * Indexing of literal facts: be more serious about including only
6435 facts from the visible specification/proof context, but not the
6436 background context (locale etc.). Affects `prop` notation and method
6437 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6440 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6441 "(open)" option, which used to expose internal bound variables to the
6444 * Isar statements: removed obsolete case "rule_context".
6445 INCOMPATIBILITY, better use explicit fixes/assumes.
6447 * Locale proofs: default proof step now includes 'unfold_locales';
6448 hence 'proof' without argument may be used to unfold locale
6452 *** Document preparation ***
6454 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6455 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6456 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6457 spot); renamed link color from "darkblue" to "linkcolor" (default
6458 value unchanged, can be redefined via \definecolor); no longer sets
6459 "a4paper" option (unnecessary or even intrusive).
6461 * Antiquotation @{lemma A method} proves proposition A by the given
6462 method (either a method name or a method name plus (optional) method
6463 arguments in parentheses) and prints A just like @{prop A}.
6468 * New primrec package. Specification syntax conforms in style to
6469 definition/function/.... No separate induction rule is provided. The
6470 "primrec" command distinguishes old-style and new-style specifications
6471 by syntax. The former primrec package is now named OldPrimrecPackage.
6472 When adjusting theories, beware: constants stemming from new-style
6473 primrec specifications have authentic syntax.
6475 * Metis prover is now an order of magnitude faster, and also works
6476 with multithreading.
6478 * Metis: the maximum number of clauses that can be produced from a
6479 theorem is now given by the attribute max_clauses. Theorems that
6480 exceed this number are ignored, with a warning printed.
6482 * Sledgehammer no longer produces structured proofs by default. To
6483 enable, declare [[sledgehammer_full = true]]. Attributes
6484 reconstruction_modulus, reconstruction_sorts renamed
6485 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6487 * Method "induct_scheme" derives user-specified induction rules
6488 from well-founded induction and completeness of patterns. This factors
6489 out some operations that are done internally by the function package
6490 and makes them available separately. See
6491 src/HOL/ex/Induction_Scheme.thy for examples.
6493 * More flexible generation of measure functions for termination
6494 proofs: Measure functions can be declared by proving a rule of the
6495 form "is_measure f" and giving it the [measure_function] attribute.
6496 The "is_measure" predicate is logically meaningless (always true), and
6497 just guides the heuristic. To find suitable measure functions, the
6498 termination prover sets up the goal "is_measure ?f" of the appropriate
6499 type and generates all solutions by Prolog-style backward proof using
6502 This setup also deals with rules like
6504 "is_measure f ==> is_measure (list_size f)"
6506 which accommodates nested datatypes that recurse through lists.
6507 Similar rules are predeclared for products and option types.
6509 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6513 - Definitions of overloaded constants on sets have to be replaced by
6514 definitions on => and bool.
6516 - Some definitions of overloaded operators on sets can now be proved
6517 using the definitions of the operators on => and bool. Therefore,
6518 the following theorems have been renamed:
6520 subset_def -> subset_eq
6521 psubset_def -> psubset_eq
6522 set_diff_def -> set_diff_eq
6523 Compl_def -> Compl_eq
6524 Sup_set_def -> Sup_set_eq
6525 Inf_set_def -> Inf_set_eq
6526 sup_set_def -> sup_set_eq
6527 inf_set_def -> inf_set_eq
6529 - Due to the incompleteness of the HO unification algorithm, some
6530 rules such as subst may require manual instantiation, if some of
6531 the unknowns in the rule is a set.
6533 - Higher order unification and forward proofs:
6536 have "P (S::'a set)" <...>
6537 then have "EX S. P S" ..
6539 no longer works (due to the incompleteness of the HO unification
6540 algorithm) and must be replaced by the pattern
6547 - Calculational reasoning with subst (or similar rules):
6550 have "P (S::'a set)" <...>
6551 also have "S = T" <...>
6552 finally have "P T" .
6554 no longer works (for similar reasons as the previous example) and
6555 must be replaced by something like
6557 have "P (S::'a set)" <...>
6558 moreover have "S = T" <...>
6559 ultimately have "P T" by simp
6561 - Tactics or packages written in ML code:
6562 Code performing pattern matching on types via
6564 Type ("set", [T]) => ...
6566 must be rewritten. Moreover, functions like strip_type or
6567 binder_types no longer return the right value when applied to a
6570 T1 => ... => Tn => U => bool
6574 T1 => ... => Tn => U set
6576 * Merged theories Wellfounded_Recursion, Accessible_Part and
6577 Wellfounded_Relations to theory Wellfounded.
6579 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6581 * Class finite no longer treats UNIV as class parameter. Use class
6582 enum from theory Library/Enum instead to achieve a similar effect.
6585 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6586 and "Cons". INCOMPATIBILITY.
6588 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6589 Potential INCOMPATIBILITY.
6591 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6592 injective_fst_snd removed, use split_eta and prod_eqI instead.
6593 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6595 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6596 the same name in theory Orderings:
6606 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6607 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6608 and different variable names.
6610 * Library/Option_ord.thy: Canonical order on option type.
6612 * Library/RBT.thy: Red-black trees, an efficient implementation of
6615 * Library/Countable.thy: Type class for countable types.
6617 * Theory Int: The representation of numerals has changed. The infix
6618 operator BIT and the bit datatype with constructors B0 and B1 have
6619 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6620 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6621 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6624 * Theory Nat: definition of <= and < on natural numbers no longer
6625 depend on well-founded relations. INCOMPATIBILITY. Definitions
6626 le_def and less_def have disappeared. Consider lemmas not_less
6627 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6629 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6630 (whose purpose mainly is for various fold_set functionals) have been
6631 abandoned in favor of the existing algebraic classes
6632 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6633 lower_semilattice (resp. upper_semilattice) and linorder.
6636 * Theory Transitive_Closure: induct and cases rules now declare proper
6637 case_names ("base" and "step"). INCOMPATIBILITY.
6639 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6640 lattices. The form set-specific version is available as
6641 Inductive.lfp_ordinal_induct_set.
6643 * Renamed theorems "power.simps" to "power_int.simps".
6646 * Class semiring_div provides basic abstract properties of semirings
6647 with division and modulo operations. Subsumes former class dvd_mod.
6649 * Merged theories IntDef, Numeral and IntArith into unified theory
6650 Int. INCOMPATIBILITY.
6652 * Theory Library/Code_Index: type "index" now represents natural
6653 numbers rather than integers. INCOMPATIBILITY.
6655 * New class "uminus" with operation "uminus" (split of from class
6656 "minus" which now only has operation "minus", binary).
6659 * Constants "card", "internal_split", "option_map" now with authentic
6660 syntax. INCOMPATIBILITY.
6662 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6663 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6664 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6665 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6666 Sup_set_def, le_def, less_def, option_map_def now with object
6667 equality. INCOMPATIBILITY.
6669 * Records. Removed K_record, and replaced it by pure lambda term
6670 %x. c. The simplifier setup is now more robust against eta expansion.
6671 INCOMPATIBILITY: in cases explicitly referring to K_record.
6673 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6675 * Library/ListVector: new theory of arithmetic vector operations.
6677 * Library/Order_Relation: new theory of various orderings as sets of
6678 pairs. Defines preorders, partial orders, linear orders and
6679 well-orders on sets and on types.
6684 * Renamed some theories to allow to loading both ZF and HOL in the
6687 Datatype -> Datatype_ZF
6688 Inductive -> Inductive_ZF
6695 INCOMPATIBILITY: ZF theories that import individual theories below
6696 Main might need to be adapted. Regular theory Main is still
6697 available, as trivial extension of Main_ZF.
6702 * ML within Isar: antiquotation @{const name} or @{const
6703 name(typargs)} produces statically-checked Const term.
6705 * Functor NamedThmsFun: data is available to the user as dynamic fact
6706 (of the same name). Removed obsolete print command.
6708 * Removed obsolete "use_legacy_bindings" function.
6710 * The ``print mode'' is now a thread-local value derived from a global
6711 template (the former print_mode reference), thus access becomes
6712 non-critical. The global print_mode reference is for session
6713 management only; user-code should use print_mode_value,
6714 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6716 * Functions system/system_out provide a robust way to invoke external
6717 shell commands, with propagation of interrupts (requires Poly/ML
6718 5.2.1). Do not use OS.Process.system etc. from the basis library!
6723 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6724 in accordance with Proof General 3.7, which prefers GNU emacs.
6726 * isatool tty runs Isabelle process with plain tty interaction;
6727 optional line editor may be specified via ISABELLE_LINE_EDITOR
6728 setting, the default settings attempt to locate "ledit" and "rlwrap".
6730 * isatool browser now works with Cygwin as well, using general
6731 "javapath" function defined in Isabelle process environment.
6733 * YXML notation provides a simple and efficient alternative to
6734 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6735 isatool yxml as described in the Isabelle system manual.
6737 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6738 provides general wrapper for managing an Isabelle process in a robust
6739 fashion, with ``cooked'' output from stdin/stderr.
6741 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6742 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6744 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6745 way of changing the user's settings is via
6746 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6749 * Multithreading.max_threads := 0 refers to the number of actual CPU
6750 cores of the underlying machine, which is a good starting point for
6751 optimal performance tuning. The corresponding usedir option -M allows
6752 "max" as an alias for "0". WARNING: does not work on certain versions
6753 of Mac OS (with Poly/ML 5.1).
6755 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6756 adverse effect of Isabelle flooding interactive front-ends (notably
6757 ProofGeneral / XEmacs).
6761 New in Isabelle2007 (November 2007)
6762 -----------------------------------
6766 * More uniform information about legacy features, notably a
6767 warning/error of "Legacy feature: ...", depending on the state of the
6768 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6769 legacy features will disappear eventually.
6771 * Theory syntax: the header format ``theory A = B + C:'' has been
6772 discontinued in favour of ``theory A imports B C begin''. Use isatool
6773 fixheaders to convert existing theory files. INCOMPATIBILITY.
6775 * Theory syntax: the old non-Isar theory file format has been
6776 discontinued altogether. Note that ML proof scripts may still be used
6777 with Isar theories; migration is usually quite simple with the ML
6778 function use_legacy_bindings. INCOMPATIBILITY.
6780 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6781 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6784 * Theory loader: be more serious about observing the static theory
6785 header specifications (including optional directories), but not the
6786 accidental file locations of previously successful loads. The strict
6787 update policy of former update_thy is now already performed by
6788 use_thy, so the former has been removed; use_thys updates several
6789 theories simultaneously, just as 'imports' within a theory header
6790 specification, but without merging the results. Potential
6791 INCOMPATIBILITY: may need to refine theory headers and commands
6792 ROOT.ML which depend on load order.
6794 * Theory loader: optional support for content-based file
6795 identification, instead of the traditional scheme of full physical
6796 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6797 (cf. the system manual). The new scheme allows to work with
6798 non-finished theories in persistent session images, such that source
6799 files may be moved later on without requiring reloads.
6801 * Theory loader: old-style ML proof scripts being *attached* to a thy
6802 file (with the same base name as the theory) are considered a legacy
6803 feature, which will disappear eventually. Even now, the theory loader
6804 no longer maintains dependencies on such files.
6806 * Syntax: the scope for resolving ambiguities via type-inference is
6807 now limited to individual terms, instead of whole simultaneous
6808 specifications as before. This greatly reduces the complexity of the
6809 syntax module and improves flexibility by separating parsing and
6810 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6811 'fixes' etc.) are required in rare situations.
6813 * Syntax: constants introduced by new-style packages ('definition',
6814 'abbreviation' etc.) are passed through the syntax module in
6815 ``authentic mode''. This means that associated mixfix annotations
6816 really stick to such constants, independently of potential name space
6817 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6818 trees are represented slightly differently, may need to adapt syntax
6819 translations accordingly. Use CONST marker in 'translations' and
6820 @{const_syntax} antiquotation in 'parse_translation' etc.
6822 * Legacy goal package: reduced interface to the bare minimum required
6823 to keep existing proof scripts running. Most other user-level
6824 functions are now part of the OldGoals structure, which is *not* open
6825 by default (consider isatool expandshort before open OldGoals).
6826 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6827 these tend to cause confusion about the actual goal (!) context being
6828 used here, which is not necessarily the same as the_context().
6830 * Command 'find_theorems': supports "*" wild-card in "name:"
6831 criterion; "with_dups" option. Certain ProofGeneral versions might
6832 support a specific search form (see ProofGeneral/CHANGES).
6834 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6835 by default, which means that "prems" (and also "fixed variables") are
6836 suppressed from proof state output. Note that the ProofGeneral
6837 settings mechanism allows to change and save options persistently, but
6838 older versions of Isabelle will fail to start up if a negative prems
6841 * Local theory targets may be specified by non-nested blocks of
6842 ``context/locale/class ... begin'' followed by ``end''. The body may
6843 contain definitions, theorems etc., including any derived mechanism
6844 that has been implemented on top of these primitives. This concept
6845 generalizes the existing ``theorem (in ...)'' towards more versatility
6848 * Proof General interface: proper undo of final 'end' command;
6849 discontinued Isabelle/classic mode (ML proof scripts).
6852 *** Document preparation ***
6854 * Added antiquotation @{theory name} which prints the given name,
6855 after checking that it refers to a valid ancestor theory in the
6858 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6859 check the given source text as ML type/structure, printing verbatim.
6861 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6862 "c args == rhs" given in the current context. (Any number of
6863 arguments may be given on the LHS.)
6868 * The 'class' package offers a combination of axclass and locale to
6869 achieve Haskell-like type classes in Isabelle. Definitions and
6870 theorems within a class context produce both relative results (with
6871 implicit parameters according to the locale context), and polymorphic
6872 constants with qualified polymorphism (according to the class
6873 context). Within the body context of a 'class' target, a separate
6874 syntax layer ("user space type system") takes care of converting
6875 between global polymorphic consts and internal locale representation.
6876 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6877 "isatool doc classes" provides a tutorial.
6879 * Generic code generator framework allows to generate executable
6880 code for ML and Haskell (including Isabelle classes). A short usage
6883 internal compilation:
6884 export_code <list of constants (term syntax)> in SML
6885 writing SML code to a file:
6886 export_code <list of constants (term syntax)> in SML <filename>
6887 writing OCaml code to a file:
6888 export_code <list of constants (term syntax)> in OCaml <filename>
6889 writing Haskell code to a bunch of files:
6890 export_code <list of constants (term syntax)> in Haskell <filename>
6892 evaluating closed propositions to True/False using code generation:
6895 Reasonable default setup of framework in HOL.
6897 Theorem attributs for selecting and transforming function equations theorems:
6899 [code fun]: select a theorem as function equation for a specific constant
6900 [code fun del]: deselect a theorem as function equation for a specific constant
6901 [code inline]: select an equation theorem for unfolding (inlining) in place
6902 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6904 User-defined serializations (target in {SML, OCaml, Haskell}):
6906 code_const <and-list of constants (term syntax)>
6907 {(target) <and-list of const target syntax>}+
6909 code_type <and-list of type constructors>
6910 {(target) <and-list of type target syntax>}+
6912 code_instance <and-list of instances>
6914 where instance ::= <type constructor> :: <class>
6916 code_class <and_list of classes>
6917 {(target) <and-list of class target syntax>}+
6918 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6920 code_instance and code_class only are effective to target Haskell.
6922 For example usage see src/HOL/ex/Codegenerator.thy and
6923 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6924 generation from Isabelle/HOL theories is available via "isatool doc
6927 * Code generator: consts in 'consts_code' Isar commands are now
6928 referred to by usual term syntax (including optional type
6931 * Command 'no_translations' removes translation rules from theory
6934 * Overloaded definitions are now actually checked for acyclic
6935 dependencies. The overloading scheme is slightly more general than
6936 that of Haskell98, although Isabelle does not demand an exact
6937 correspondence to type class and instance declarations.
6938 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6939 exotic versions of overloading -- at the discretion of the user!
6941 Polymorphic constants are represented via type arguments, i.e. the
6942 instantiation that matches an instance against the most general
6943 declaration given in the signature. For example, with the declaration
6944 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6945 as c(nat). Overloading is essentially simultaneous structural
6946 recursion over such type arguments. Incomplete specification patterns
6947 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6948 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6949 Command 'print_theory' outputs the normalized system of recursive
6950 equations, see section "definitions".
6952 * Configuration options are maintained within the theory or proof
6953 context (with name and type bool/int/string), providing a very simple
6954 interface to a poor-man's version of general context data. Tools may
6955 declare options in ML (e.g. using Attrib.config_int) and then refer to
6956 these values using Config.get etc. Users may change options via an
6957 associated attribute of the same name. This form of context
6958 declaration works particularly well with commands 'declare' or
6959 'using', for example ``declare [[foo = 42]]''. Thus it has become
6960 very easy to avoid global references, which would not observe Isar
6961 toplevel undo/redo and fail to work with multithreading.
6963 Various global ML references of Pure and HOL have been turned into
6964 configuration options:
6966 Unify.search_bound unify_search_bound
6967 Unify.trace_bound unify_trace_bound
6968 Unify.trace_simp unify_trace_simp
6969 Unify.trace_types unify_trace_types
6970 Simplifier.simp_depth_limit simp_depth_limit
6971 Blast.depth_limit blast_depth_limit
6972 DatatypeProp.dtK datatype_distinctness_limit
6973 fast_arith_neq_limit fast_arith_neq_limit
6974 fast_arith_split_limit fast_arith_split_limit
6976 * Named collections of theorems may be easily installed as context
6977 data using the functor NamedThmsFun (see also
6978 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6979 attributes; there is also a toplevel print command. This facility is
6980 just a common case of general context data, which is the preferred way
6981 for anything more complex than just a list of facts in canonical
6984 * Isar: command 'declaration' augments a local theory by generic
6985 declaration functions written in ML. This enables arbitrary content
6986 being added to the context, depending on a morphism that tells the
6987 difference of the original declaration context wrt. the application
6988 context encountered later on.
6990 * Isar: proper interfaces for simplification procedures. Command
6991 'simproc_setup' declares named simprocs (with match patterns, and body
6992 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6993 context. ML antiquotation @{simproc name} retrieves named simprocs.
6995 * Isar: an extra pair of brackets around attribute declarations
6996 abbreviates a theorem reference involving an internal dummy fact,
6997 which will be ignored later --- only the effect of the attribute on
6998 the background context will persist. This form of in-place
6999 declarations is particularly useful with commands like 'declare' and
7000 'using', for example ``have A using [[simproc a]] by simp''.
7002 * Isar: method "assumption" (and implicit closing of subproofs) now
7003 takes simple non-atomic goal assumptions into account: after applying
7004 an assumption as a rule the resulting subgoals are solved by atomic
7005 assumption steps. This is particularly useful to finish 'obtain'
7006 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
7007 without referring to the original premise "!!x. P x ==> thesis" in the
7008 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
7011 * Isar: implicit use of prems from the Isar proof context is
7012 considered a legacy feature. Common applications like ``have A .''
7013 may be replaced by ``have A by fact'' or ``note `A`''. In general,
7014 referencing facts explicitly here improves readability and
7015 maintainability of proof texts.
7017 * Isar: improper proof element 'guess' is like 'obtain', but derives
7018 the obtained context from the course of reasoning! For example:
7020 assume "EX x y. A x & B y" -- "any previous fact"
7021 then guess x and y by clarify
7023 This technique is potentially adventurous, depending on the facts and
7024 proof tools being involved here.
7026 * Isar: known facts from the proof context may be specified as literal
7027 propositions, using ASCII back-quote syntax. This works wherever
7028 named facts used to be allowed so far, in proof commands, proof
7029 methods, attributes etc. Literal facts are retrieved from the context
7030 according to unification of type and term parameters. For example,
7031 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
7032 theorems in the current context, then these are valid literal facts:
7033 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
7035 There is also a proof method "fact" which does the same composition
7036 for explicit goal states, e.g. the following proof texts coincide with
7037 certain special cases of literal facts:
7039 have "A" by fact == note `A`
7040 have "A ==> B" by fact == note `A ==> B`
7041 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7042 have "P a ==> Q a" by fact == note `P a ==> Q a`
7044 * Isar: ":" (colon) is no longer a symbolic identifier character in
7045 outer syntax. Thus symbolic identifiers may be used without
7046 additional white space in declarations like this: ``assume *: A''.
7048 * Isar: 'print_facts' prints all local facts of the current context,
7049 both named and unnamed ones.
7051 * Isar: 'def' now admits simultaneous definitions, e.g.:
7053 def x == "t" and y == "u"
7055 * Isar: added command 'unfolding', which is structurally similar to
7056 'using', but affects both the goal state and facts by unfolding given
7057 rewrite rules. Thus many occurrences of the 'unfold' method or
7058 'unfolded' attribute may be replaced by first-class proof text.
7060 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7061 and command 'unfolding' now all support object-level equalities
7062 (potentially conditional). The underlying notion of rewrite rule is
7063 analogous to the 'rule_format' attribute, but *not* that of the
7064 Simplifier (which is usually more generous).
7066 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7067 premises of a theorem by n. Useful in conjunction with drule.
7069 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7070 method expression within a sandbox consisting of the first N
7071 sub-goals, which need to exist. For example, ``simp_all [3]''
7072 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7073 simplifies all new goals that emerge from applying rule foo to the
7074 originally first one.
7076 * Isar: schematic goals are no longer restricted to higher-order
7077 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7080 * Isar: the conclusion of a long theorem statement is now either
7081 'shows' (a simultaneous conjunction, as before), or 'obtains'
7082 (essentially a disjunction of cases with local parameters and
7083 assumptions). The latter allows to express general elimination rules
7084 adequately; in this notation common elimination rules look like this:
7086 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7088 obtains x where "P x"
7090 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7094 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7100 The subsequent classical rules even refer to the formal "thesis"
7103 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7106 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7107 obtains "thesis ==> something"
7109 The actual proof of an 'obtains' statement is analogous to that of the
7110 Isar proof element 'obtain', only that there may be several cases.
7111 Optional case names may be specified in parentheses; these will be
7112 available both in the present proof and as annotations in the
7113 resulting rule, for later use with the 'cases' method (cf. attribute
7116 * Isar: the assumptions of a long theorem statement are available as
7117 "assms" fact in the proof context. This is more appropriate than the
7118 (historical) "prems", which refers to all assumptions of the current
7119 context, including those from the target locale, proof body etc.
7121 * Isar: 'print_statement' prints theorems from the current theory or
7122 proof context in long statement form, according to the syntax of a
7125 * Isar: 'obtain' takes an optional case name for the local context
7126 introduction rule (default "that").
7128 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7129 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7132 * Pure: syntax "CONST name" produces a fully internalized constant
7133 according to the current context. This is particularly useful for
7134 syntax translations that should refer to internal constant
7135 representations independently of name spaces.
7137 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7138 instead of "FOO ". This allows multiple binder declarations to coexist
7139 in the same context. INCOMPATIBILITY.
7141 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7142 primitive that also works in a locale context (both for constants and
7143 fixed variables). Type declaration and internal syntactic representation
7144 of given constants retrieved from the context. Likewise, the
7145 'no_notation' command allows to remove given syntax annotations from the
7148 * Isar/locales: new derived specification elements 'axiomatization',
7149 'definition', 'abbreviation', which support type-inference, admit
7150 object-level specifications (equality, equivalence). See also the
7151 isar-ref manual. Examples:
7154 eq (infix "===" 50) where
7155 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7157 definition "f x y = x + y + 1"
7158 definition g where "g x = f x x"
7161 neq (infix "=!=" 50) where
7162 "x =!= y == ~ (x === y)"
7164 These specifications may be also used in a locale context. Then the
7165 constants being introduced depend on certain fixed parameters, and the
7166 constant name is qualified by the locale base name. An internal
7167 abbreviation takes care for convenient input and output, making the
7168 parameters implicit and using the original short name. See also
7169 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7170 entities from a monomorphic theory.
7172 Presently, abbreviations are only available 'in' a target locale, but
7173 not inherited by general import expressions. Also note that
7174 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7175 'translations' in common applications. The "no_abbrevs" print mode
7176 prevents folding of abbreviations in term output.
7178 Concrete syntax is attached to specified constants in internal form,
7179 independently of name spaces. The parse tree representation is
7180 slightly different -- use 'notation' instead of raw 'syntax', and
7181 'translations' with explicit "CONST" markup to accommodate this.
7183 * Pure/Isar: unified syntax for new-style specification mechanisms
7184 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7185 full type inference and dummy patterns ("_"). For example:
7187 definition "K x _ = x"
7189 inductive conj for A B
7190 where "A ==> B ==> conj A B"
7192 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7193 the current context. Print mode "no_abbrevs" prevents inversion of
7194 abbreviations on output.
7196 * Isar/locales: improved parameter handling: use of locales "var" and
7197 "struct" no longer necessary; - parameter renamings are no longer
7198 required to be injective. For example, this allows to define
7199 endomorphisms as locale endom = homom mult mult h.
7201 * Isar/locales: changed the way locales with predicates are defined.
7202 Instead of accumulating the specification, the imported expression is
7203 now an interpretation. INCOMPATIBILITY: different normal form of
7204 locale expressions. In particular, in interpretations of locales with
7205 predicates, goals repesenting already interpreted fragments are not
7206 removed automatically. Use methods `intro_locales' and
7207 `unfold_locales'; see below.
7209 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7210 provide backward reasoning on locales predicates. The methods are
7211 aware of interpretations and discharge corresponding goals.
7212 `intro_locales' is less aggressive then `unfold_locales' and does not
7213 unfold predicates to assumptions.
7215 * Isar/locales: the order in which locale fragments are accumulated
7216 has changed. This enables to override declarations from fragments due
7217 to interpretations -- for example, unwanted simp rules.
7219 * Isar/locales: interpretation in theories and proof contexts has been
7220 extended. One may now specify (and prove) equations, which are
7221 unfolded in interpreted theorems. This is useful for replacing
7222 defined concepts (constants depending on locale parameters) by
7223 concepts already existing in the target context. Example:
7225 interpretation partial_order ["op <= :: [int, int] => bool"]
7226 where "partial_order.less (op <=) (x::int) y = (x < y)"
7228 Typically, the constant `partial_order.less' is created by a
7229 definition specification element in the context of locale
7232 * Method "induct": improved internal context management to support
7233 local fixes and defines on-the-fly. Thus explicit meta-level
7234 connectives !! and ==> are rarely required anymore in inductive goals
7235 (using object-logic connectives for this purpose has been long
7236 obsolete anyway). Common proof patterns are explained in
7237 src/HOL/Induct/Common_Patterns.thy, see also
7238 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7241 * Method "induct": improved handling of simultaneous goals. Instead of
7242 introducing object-level conjunction, the statement is now split into
7243 several conclusions, while the corresponding symbolic cases are nested
7244 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7245 see src/HOL/Induct/Common_Patterns.thy, for example.
7247 * Method "induct": mutual induction rules are now specified as a list
7248 of rule sharing the same induction cases. HOL packages usually provide
7249 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7250 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7251 mutual induction rules differently, i.e. like this:
7253 (induct rule: foo_bar.inducts)
7254 (induct set: foo bar)
7255 (induct pred: foo bar)
7256 (induct type: foo bar)
7258 The ML function ProjectRule.projections turns old-style rules into the
7261 * Method "coinduct": dual of induction, see
7262 src/HOL/Library/Coinductive_List.thy for various examples.
7264 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7265 considered a legacy feature.
7267 * Attribute "symmetric" produces result with standardized schematic
7268 variables (index 0). Potential INCOMPATIBILITY.
7270 * Simplifier: by default the simplifier trace only shows top level
7271 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7272 default. Thus there is less danger of being flooded by the trace. The
7273 trace indicates where parts have been suppressed.
7275 * Provers/classical: removed obsolete classical version of elim_format
7276 attribute; classical elim/dest rules are now treated uniformly when
7277 manipulating the claset.
7279 * Provers/classical: stricter checks to ensure that supplied intro,
7280 dest and elim rules are well-formed; dest and elim rules must have at
7283 * Provers/classical: attributes dest/elim/intro take an optional
7284 weight argument for the rule (just as the Pure versions). Weights are
7285 ignored by automated tools, but determine the search order of single
7288 * Syntax: input syntax now supports dummy variable binding "%_. b",
7289 where the body does not mention the bound variable. Note that dummy
7290 patterns implicitly depend on their context of bounds, which makes
7291 "{_. _}" match any set comprehension as expected. Potential
7292 INCOMPATIBILITY -- parse translations need to cope with syntactic
7293 constant "_idtdummy" in the binding position.
7295 * Syntax: removed obsolete syntactic constant "_K" and its associated
7296 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7297 for example "A -> B" => "Pi A (%_. B)".
7299 * Pure: 'class_deps' command visualizes the subclass relation, using
7300 the graph browser tool.
7302 * Pure: 'print_theory' now suppresses certain internal declarations by
7303 default; use '!' option for full details.
7308 * Method "metis" proves goals by applying the Metis general-purpose
7309 resolution prover (see also http://gilith.com/software/metis/).
7310 Examples are in the directory MetisExamples. WARNING: the
7311 Isabelle/HOL-Metis integration does not yet work properly with
7314 * Command 'sledgehammer' invokes external automatic theorem provers as
7315 background processes. It generates calls to the "metis" method if
7316 successful. These can be pasted into the proof. Users do not have to
7317 wait for the automatic provers to return. WARNING: does not really
7318 work with multi-threading.
7320 * New "auto_quickcheck" feature tests outermost goal statements for
7321 potential counter-examples. Controlled by ML references
7322 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7323 5000 milliseconds). Fails silently if statements is outside of
7324 executable fragment, or any other codgenerator problem occurs.
7326 * New constant "undefined" with axiom "undefined x = undefined".
7328 * Added class "HOL.eq", allowing for code generation with polymorphic
7331 * Some renaming of class constants due to canonical name prefixing in
7332 the new 'class' package:
7334 HOL.abs ~> HOL.abs_class.abs
7335 HOL.divide ~> HOL.divide_class.divide
7336 0 ~> HOL.zero_class.zero
7337 1 ~> HOL.one_class.one
7338 op + ~> HOL.plus_class.plus
7339 op - ~> HOL.minus_class.minus
7340 uminus ~> HOL.minus_class.uminus
7341 op * ~> HOL.times_class.times
7342 op < ~> HOL.ord_class.less
7343 op <= > HOL.ord_class.less_eq
7344 Nat.power ~> Power.power_class.power
7345 Nat.size ~> Nat.size_class.size
7346 Numeral.number_of ~> Numeral.number_class.number_of
7347 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7348 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7349 Orderings.min ~> Orderings.ord_class.min
7350 Orderings.max ~> Orderings.ord_class.max
7351 Divides.op div ~> Divides.div_class.div
7352 Divides.op mod ~> Divides.div_class.mod
7353 Divides.op dvd ~> Divides.div_class.dvd
7355 INCOMPATIBILITY. Adaptions may be required in the following cases:
7357 a) User-defined constants using any of the names "plus", "minus",
7358 "times", "less" or "less_eq". The standard syntax translations for
7359 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7362 b) Variables named "plus", "minus", "times", "less", "less_eq"
7363 INCOMPATIBILITY: use more specific names.
7365 c) Permutative equations (e.g. "a + b = b + a")
7366 Since the change of names also changes the order of terms, permutative
7367 rewrite rules may get applied in a different order. Experience shows
7368 that this is rarely the case (only two adaptions in the whole Isabelle
7369 distribution). INCOMPATIBILITY: rewrite proofs
7371 d) ML code directly refering to constant names
7372 This in general only affects hand-written proof tactics, simprocs and
7373 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7374 Consider using @{const_name} antiquotation.
7376 * New class "default" with associated constant "default".
7378 * Function "sgn" is now overloaded and available on int, real, complex
7379 (and other numeric types), using class "sgn". Two possible defs of
7380 sgn are given as equational assumptions in the classes sgn_if and
7381 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7384 * Locale "partial_order" now unified with class "order" (cf. theory
7385 Orderings), added parameter "less". INCOMPATIBILITY.
7387 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7388 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7389 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7391 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7392 changed order of proof goals in instance proofs.
7394 * The transitivity reasoner for partial and linear orders is set up
7395 for classes "order" and "linorder". Instances of the reasoner are available
7396 in all contexts importing or interpreting the corresponding locales.
7397 Method "order" invokes the reasoner separately; the reasoner
7398 is also integrated with the Simplifier as a solver. Diagnostic
7399 command 'print_orders' shows the available instances of the reasoner
7400 in the current context.
7402 * Localized monotonicity predicate in theory "Orderings"; integrated
7403 lemmas max_of_mono and min_of_mono with this predicate.
7406 * Formulation of theorem "dense" changed slightly due to integration
7407 with new class dense_linear_order.
7409 * Uniform lattice theory development in HOL.
7411 constants "meet" and "join" now named "inf" and "sup"
7412 constant "Meet" now named "Inf"
7414 classes "meet_semilorder" and "join_semilorder" now named
7415 "lower_semilattice" and "upper_semilattice"
7416 class "lorder" now named "lattice"
7417 class "comp_lat" now named "complete_lattice"
7419 Instantiation of lattice classes allows explicit definitions
7420 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7422 INCOMPATIBILITY. Theorem renames:
7424 meet_left_le ~> inf_le1
7425 meet_right_le ~> inf_le2
7426 join_left_le ~> sup_ge1
7427 join_right_le ~> sup_ge2
7428 meet_join_le ~> inf_sup_ord
7431 le_meet ~> le_inf_iff
7432 le_join ~> ge_sup_conv
7433 meet_idempotent ~> inf_idem
7434 join_idempotent ~> sup_idem
7435 meet_comm ~> inf_commute
7436 join_comm ~> sup_commute
7437 meet_leI1 ~> le_infI1
7438 meet_leI2 ~> le_infI2
7439 le_joinI1 ~> le_supI1
7440 le_joinI2 ~> le_supI2
7441 meet_assoc ~> inf_assoc
7442 join_assoc ~> sup_assoc
7443 meet_left_comm ~> inf_left_commute
7444 meet_left_idempotent ~> inf_left_idem
7445 join_left_comm ~> sup_left_commute
7446 join_left_idempotent ~> sup_left_idem
7449 le_def_meet ~> le_iff_inf
7450 le_def_join ~> le_iff_sup
7451 join_absorp2 ~> sup_absorb2
7452 join_absorp1 ~> sup_absorb1
7453 meet_absorp1 ~> inf_absorb1
7454 meet_absorp2 ~> inf_absorb2
7455 meet_join_absorp ~> inf_sup_absorb
7456 join_meet_absorp ~> sup_inf_absorb
7457 distrib_join_le ~> distrib_sup_le
7458 distrib_meet_le ~> distrib_inf_le
7460 add_meet_distrib_left ~> add_inf_distrib_left
7461 add_join_distrib_left ~> add_sup_distrib_left
7462 is_join_neg_meet ~> is_join_neg_inf
7463 is_meet_neg_join ~> is_meet_neg_sup
7464 add_meet_distrib_right ~> add_inf_distrib_right
7465 add_join_distrib_right ~> add_sup_distrib_right
7466 add_meet_join_distribs ~> add_sup_inf_distribs
7467 join_eq_neg_meet ~> sup_eq_neg_inf
7468 meet_eq_neg_join ~> inf_eq_neg_sup
7469 add_eq_meet_join ~> add_eq_inf_sup
7470 meet_0_imp_0 ~> inf_0_imp_0
7471 join_0_imp_0 ~> sup_0_imp_0
7472 meet_0_eq_0 ~> inf_0_eq_0
7473 join_0_eq_0 ~> sup_0_eq_0
7474 neg_meet_eq_join ~> neg_inf_eq_sup
7475 neg_join_eq_meet ~> neg_sup_eq_inf
7476 join_eq_if ~> sup_eq_if
7478 mono_meet ~> mono_inf
7479 mono_join ~> mono_sup
7480 meet_bool_eq ~> inf_bool_eq
7481 join_bool_eq ~> sup_bool_eq
7482 meet_fun_eq ~> inf_fun_eq
7483 join_fun_eq ~> sup_fun_eq
7484 meet_set_eq ~> inf_set_eq
7485 join_set_eq ~> sup_set_eq
7486 meet1_iff ~> inf1_iff
7487 meet2_iff ~> inf2_iff
7496 join1_iff ~> sup1_iff
7497 join2_iff ~> sup2_iff
7507 is_meet_Meet ~> is_meet_Inf
7508 Meet_bool_def ~> Inf_bool_def
7509 Meet_fun_def ~> Inf_fun_def
7510 Meet_greatest ~> Inf_greatest
7511 Meet_lower ~> Inf_lower
7512 Meet_set_def ~> Inf_set_def
7515 Sup_bool_eq ~> Sup_bool_def
7516 Sup_fun_eq ~> Sup_fun_def
7517 Sup_set_eq ~> Sup_set_def
7519 listsp_meetI ~> listsp_infI
7520 listsp_meet_eq ~> listsp_inf_eq
7525 * Added syntactic class "size"; overloaded constant "size" now has
7526 type "'a::size ==> bool"
7528 * Internal reorganisation of `size' of datatypes: size theorems
7529 "foo.size" are no longer subsumed by "foo.simps" (but are still
7530 simplification rules by default!); theorems "prod.size" now named
7533 * Class "div" now inherits from class "times" rather than "type".
7536 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7537 Linorder etc. have disappeared; operations defined in terms of
7538 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7540 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7542 * HOL-Word: New extensive library and type for generic, fixed size
7543 machine words, with arithmetic, bit-wise, shifting and rotating
7544 operations, reflection into int, nat, and bool lists, automation for
7545 linear arithmetic (by automatic reflection into nat or int), including
7546 lemmas on overflow and monotonicity. Instantiated to all appropriate
7547 arithmetic type classes, supporting automatic simplification of
7548 numerals on all operations.
7550 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7552 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7554 * Code generator library theories:
7555 - Code_Integer represents HOL integers by big integer literals in target
7557 - Code_Char represents HOL characters by character literals in target
7559 - Code_Char_chr like Code_Char, but also offers treatment of character
7560 codes; includes Code_Integer.
7561 - Executable_Set allows to generate code for finite sets using lists.
7562 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7564 - Executable_Real implements a subset of real numbers, namly those
7565 representable by rational numbers.
7566 - Efficient_Nat implements natural numbers by integers, which in general will
7567 result in higher efficency; pattern matching with 0/Suc is eliminated;
7568 includes Code_Integer.
7569 - Code_Index provides an additional datatype index which is mapped to
7570 target-language built-in integers.
7571 - Code_Message provides an additional datatype message_string which is isomorphic to
7572 strings; messages are mapped to target-language strings.
7574 * New package for inductive predicates
7576 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7579 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7580 for z_1 :: U_1 and ... and z_n :: U_m
7582 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7585 with full support for type-inference, rather than
7587 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7589 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7590 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7592 inductive "s z_1 ... z_m"
7594 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7597 For backward compatibility, there is a wrapper allowing inductive
7598 sets to be defined with the new package via
7601 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7602 for z_1 :: U_1 and ... and z_n :: U_m
7604 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7610 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7611 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7612 for z_1 :: U_1 and ... and z_n :: U_m
7614 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7615 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7618 if the additional syntax "p ..." is required.
7620 Numerous examples can be found in the subdirectories src/HOL/Auth,
7621 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7625 - Since declaration and definition of inductive sets or predicates
7626 is no longer separated, abbreviations involving the newly
7627 introduced sets or predicates must be specified together with the
7628 introduction rules after the 'where' keyword (see above), rather
7629 than before the actual inductive definition.
7631 - The variables in induction and elimination rules are now
7632 quantified in the order of their occurrence in the introduction
7633 rules, rather than in alphabetical order. Since this may break
7634 some proofs, these proofs either have to be repaired, e.g. by
7635 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7636 statements of the form
7638 case (rule_i a_i_1 ... a_i_{k_i})
7640 or the old order of quantification has to be restored by explicitly adding
7641 meta-level quantifiers in the introduction rules, i.e.
7643 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7645 - The format of the elimination rules is now
7647 p z_1 ... z_m x_1 ... x_n ==>
7648 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7653 (x_1, ..., x_n) : s z_1 ... z_m ==>
7654 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7657 for sets rather than
7659 x : s z_1 ... z_m ==>
7660 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7663 This may require terms in goals to be expanded to n-tuples
7664 (e.g. using case_tac or simplification with the split_paired_all
7665 rule) before the above elimination rule is applicable.
7667 - The elimination or case analysis rules for (mutually) inductive
7668 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7669 list of rules "p_1_..._p_k.elims" is no longer available.
7671 * New package "function"/"fun" for general recursive functions,
7672 supporting mutual and nested recursion, definitions in local contexts,
7673 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7674 for small examples, and the separate tutorial on the function
7675 package. The old recdef "package" is still available as before, but
7676 users are encouraged to use the new package.
7678 * Method "lexicographic_order" automatically synthesizes termination
7679 relations as lexicographic combinations of size measures.
7681 * Case-expressions allow arbitrary constructor-patterns (including
7682 "_") and take their order into account, like in functional
7683 programming. Internally, this is translated into nested
7684 case-expressions; missing cases are added and mapped to the predefined
7685 constant "undefined". In complicated cases printing may no longer show
7686 the original input but the internal form. Lambda-abstractions allow
7687 the same form of pattern matching: "% pat1 => e1 | ..." is an
7688 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7691 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7692 is an abbreviation for "of_nat :: nat => int". The simplification
7693 rules for "of_nat" have been changed to work like "int" did
7694 previously. Potential INCOMPATIBILITY:
7695 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7696 - of_nat_diff and of_nat_mult are no longer default simp rules
7698 * Method "algebra" solves polynomial equations over (semi)rings using
7699 Groebner bases. The (semi)ring structure is defined by locales and the
7700 tool setup depends on that generic context. Installing the method for
7701 a specific type involves instantiating the locale and possibly adding
7702 declarations for computation on the coefficients. The method is
7703 already instantiated for natural numbers and for the axiomatic class
7704 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7705 CALCULEMUS 2007 for the general principles underlying this
7706 architecture of context-aware proof-tools.
7708 * Method "ferrack" implements quantifier elimination over
7709 special-purpose dense linear orders using locales (analogous to
7710 "algebra"). The method is already installed for class
7711 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7714 * Former constant "List.op @" now named "List.append". Use ML
7715 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7716 circumvent possible incompatibilities when working on ML level.
7718 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7720 * New function listsum :: 'a list => 'a for arbitrary monoids.
7721 Special syntax: "SUM x <- xs. f x" (and latex variants)
7723 * New syntax for Haskell-like list comprehension (input only), eg.
7724 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7726 * The special syntax for function "filter" has changed from [x :
7727 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7728 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7730 * [a..b] is now defined for arbitrary linear orders. It used to be
7731 defined on nat only, as an abbreviation for [a..<Suc b]
7734 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7736 * New functions "sorted" and "sort" in src/HOL/List.thy.
7738 * New lemma collection field_simps (an extension of ring_simps) for
7739 manipulating (in)equations involving division. Multiplies with all
7740 denominators that can be proved to be non-zero (in equations) or
7741 positive/negative (in inequations).
7743 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7744 have been improved and renamed to ring_simps, group_simps and
7745 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7746 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7748 * Theory Library/Commutative_Ring: switched from recdef to function
7749 package; constants add, mul, pow now curried. Infix syntax for
7750 algebraic operations.
7752 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7755 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7758 * HOL/records: generalised field-update to take a function on the
7759 field rather than the new value: r(|A := x|) is translated to A_update
7760 (K x) r The K-combinator that is internally used is called K_record.
7761 INCOMPATIBILITY: Usage of the plain update functions has to be
7764 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7765 * x = 0, which are required for a semiring. Richer structures do not
7766 inherit from semiring_0 anymore, because this property is a theorem
7767 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7768 there is more to prove, but this is mostly trivial.
7770 * Class "recpower" is generalized to arbitrary monoids, not just
7771 commutative semirings. INCOMPATIBILITY: may need to incorporate
7772 commutativity or semiring properties additionally.
7774 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7775 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7776 better use 'abbreviation'.
7778 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7780 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7781 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7782 significant changes for setting up numeral syntax for types:
7783 - New constants Numeral.pred and Numeral.succ instead
7784 of former Numeral.bin_pred and Numeral.bin_succ.
7785 - Use integer operations instead of bin_add, bin_mult and so on.
7786 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7787 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7789 See src/HOL/Integ/IntArith.thy for an example setup.
7791 * Command 'normal_form' computes the normal form of a term that may
7792 contain free variables. For example ``normal_form "rev [a, b, c]"''
7793 produces ``[b, c, a]'' (without proof). This command is suitable for
7794 heavy-duty computations because the functions are compiled to ML
7795 first. Correspondingly, a method "normalization" is provided. See
7796 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7798 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7799 25 like -->); output depends on the "iff" print_mode, the default is
7800 "A = B" (with priority 50).
7802 * Relations less (<) and less_eq (<=) are also available on type bool.
7803 Modified syntax to disallow nesting without explicit parentheses,
7804 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7807 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7809 * Relation composition operator "op O" now has precedence 75 and binds
7810 stronger than union and intersection. INCOMPATIBILITY.
7812 * The old set interval syntax "{m..n(}" (and relatives) has been
7813 removed. Use "{m..<n}" (and relatives) instead.
7815 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7816 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7817 ``declare [[simproc del: neq]]''.
7819 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7822 * Theorem Cons_eq_map_conv no longer declared as "simp".
7824 * Theorem setsum_mult renamed to setsum_right_distrib.
7826 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7829 * Reimplemented methods "sat" and "satx", with several improvements:
7830 goals no longer need to be stated as "<prems> ==> False", equivalences
7831 (i.e. "=" on type bool) are handled, variable names of the form
7832 "lit_<n>" are no longer reserved, significant speedup.
7834 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7835 zChaff is still supported as well.
7837 * 'inductive' and 'datatype': provide projections of mutual rules,
7838 bundled as foo_bar.inducts;
7840 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7843 * Library: moved theory Accessible_Part to main HOL.
7845 * Library: added theory Coinductive_List of potentially infinite lists
7846 as greatest fixed-point.
7848 * Library: added theory AssocList which implements (finite) maps as
7851 * Method "evaluation" solves goals (i.e. a boolean expression)
7852 efficiently by compiling it to ML. The goal is "proved" (via an
7853 oracle) if it evaluates to True.
7855 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7856 also when invoked by the simplifier. This results in the Simplifier
7857 being more powerful on arithmetic goals. INCOMPATIBILITY.
7858 Configuration option fast_arith_split_limit=0 recovers the old
7861 * Support for hex (0x20) and binary (0b1001) numerals.
7863 * New method: reify eqs (t), where eqs are equations for an
7864 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7865 parameter, computes a term s::'b and a list xs::'a list and proves the
7866 theorem I xs s = t. This is also known as reification or quoting. The
7867 resulting theorem is applied to the subgoal to substitute t with I xs
7868 s. If t is omitted, the subgoal itself is reified.
7870 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7871 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7872 where f is supposed to be a computable function (in the sense of code
7873 generattion). The method uses reify to compute s and xs as above then
7874 applies corr_thm and uses normalization by evaluation to "prove" f s =
7875 r and finally gets the theorem t = r, which is again applied to the
7876 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7878 * Reflection: Automatic reification now handels binding, an example is
7879 available in src/HOL/ex/ReflectionEx.thy
7881 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7882 command 'statespace' that is similar to 'record', but introduces an
7883 abstract specification based on the locale infrastructure instead of
7884 HOL types. This leads to extra flexibility in composing state spaces,
7885 in particular multiple inheritance and renaming of components.
7890 * Hyperreal: Functions root and sqrt are now defined on negative real
7891 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7892 Nonnegativity side conditions have been removed from many lemmas, so
7893 that more subgoals may now be solved by simplification; potential
7896 * Real: new type classes formalize real normed vector spaces and
7897 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7898 and norm :: 'a => real.
7900 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7901 reals into other types. The overloaded constant Reals :: 'a set is now
7902 defined as range of_real; potential INCOMPATIBILITY.
7904 * Real: proper support for ML code generation, including 'quickcheck'.
7905 Reals are implemented as arbitrary precision rationals.
7907 * Hyperreal: Several constants that previously worked only for the
7908 reals have been generalized, so they now work over arbitrary vector
7909 spaces. Type annotations may need to be added in some cases; potential
7912 Infinitesimal :: ('a::real_normed_vector) star set
7913 HFinite :: ('a::real_normed_vector) star set
7914 HInfinite :: ('a::real_normed_vector) star set
7915 approx :: ('a::real_normed_vector) star => 'a star => bool
7916 monad :: ('a::real_normed_vector) star => 'a star set
7917 galaxy :: ('a::real_normed_vector) star => 'a star set
7918 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7919 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7920 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7921 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7922 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7923 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7924 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7925 sgn :: 'a::real_normed_vector => 'a
7926 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7928 * Complex: Some complex-specific constants are now abbreviations for
7929 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7930 hnorm. Other constants have been entirely removed in favor of the
7931 polymorphic versions (INCOMPATIBILITY):
7935 HInfinite <-- CInfinite
7936 Infinitesimal <-- CInfinitesimal
7939 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7940 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7941 (ns)deriv <-- (ns)cderiv
7946 * Formalisation of ideals and the quotient construction over rings.
7948 * Order and lattice theory no longer based on records.
7951 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7952 greatest_closed. INCOMPATIBILITY.
7954 * Method algebra is now set up via an attribute. For examples see
7955 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7956 of algebraic structures.
7958 * Renamed theory CRing to Ring.
7963 * Substantial, yet incomplete support for nominal datatypes (binding
7964 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7965 src/HOL/Nominal/Examples. Prospective users should consult
7966 http://isabelle.in.tum.de/nominal/
7971 * ML basics: just one true type int, which coincides with IntInf.int
7974 * ML within Isar: antiquotations allow to embed statically-checked
7975 formal entities in the source, referring to the context available at
7976 compile-time. For example:
7978 ML {* @{sort "{zero,one}"} *}
7979 ML {* @{typ "'a => 'b"} *}
7980 ML {* @{term "%x. x"} *}
7981 ML {* @{prop "x == y"} *}
7982 ML {* @{ctyp "'a => 'b"} *}
7983 ML {* @{cterm "%x. x"} *}
7984 ML {* @{cprop "x == y"} *}
7985 ML {* @{thm asm_rl} *}
7986 ML {* @{thms asm_rl} *}
7987 ML {* @{type_name c} *}
7988 ML {* @{type_syntax c} *}
7989 ML {* @{const_name c} *}
7990 ML {* @{const_syntax c} *}
7993 ML {* @{theory Pure} *}
7994 ML {* @{theory_ref} *}
7995 ML {* @{theory_ref Pure} *}
7998 ML {* @{clasimpset} *}
8000 The same works for sources being ``used'' within an Isar context.
8002 * ML in Isar: improved error reporting; extra verbosity with
8003 ML_Context.trace enabled.
8005 * Pure/General/table.ML: the join operations now works via exceptions
8006 DUP/SAME instead of type option. This is simpler in simple cases, and
8007 admits slightly more efficient complex applications.
8009 * Pure: 'advanced' translation functions (parse_translation etc.) now
8010 use Context.generic instead of just theory.
8012 * Pure: datatype Context.generic joins theory/Proof.context and
8013 provides some facilities for code that works in either kind of
8014 context, notably GenericDataFun for uniform theory and proof data.
8016 * Pure: simplified internal attribute type, which is now always
8017 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
8018 local (Proof.context) attributes have been discontinued, while
8019 minimizing code duplication. Thm.rule_attribute and
8020 Thm.declaration_attribute build canonical attributes; see also structure
8021 Context for further operations on Context.generic, notably
8022 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
8023 declarations and definitions.
8025 * Context data interfaces (Theory/Proof/GenericDataFun): removed
8026 name/print, uninitialized data defaults to ad-hoc copy of empty value,
8027 init only required for impure data. INCOMPATIBILITY: empty really need
8028 to be empty (no dependencies on theory content!)
8030 * Pure/kernel: consts certification ignores sort constraints given in
8031 signature declarations. (This information is not relevant to the
8032 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
8033 potential INCOMPATIBILITY.
8035 * Pure: axiomatic type classes are now purely definitional, with
8036 explicit proofs of class axioms and super class relations performed
8037 internally. See Pure/axclass.ML for the main internal interfaces --
8038 notably AxClass.define_class supercedes AxClass.add_axclass, and
8039 AxClass.axiomatize_class/classrel/arity supersede
8040 Sign.add_classes/classrel/arities.
8042 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8043 global/local versions on theory vs. Proof.context have been
8044 discontinued; Attrib.syntax and Method.syntax have been adapted
8045 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8046 attributes, methods, etc.
8048 * Pure: several functions of signature "... -> theory -> theory * ..."
8049 have been reoriented to "... -> theory -> ... * theory" in order to
8050 allow natural usage in combination with the ||>, ||>>, |-> and
8051 fold_map combinators.
8053 * Pure: official theorem names (closed derivations) and additional
8054 comments (tags) are now strictly separate. Name hints -- which are
8055 maintained as tags -- may be attached any time without affecting the
8058 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8059 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8060 achieve the old behaviour.
8062 * Pure: the "Goal" constant is now called "prop", supporting a
8063 slightly more general idea of ``protecting'' meta-level rule
8066 * Pure: Logic.(un)varify only works in a global context, which is now
8067 enforced instead of silently assumed. INCOMPATIBILITY, may use
8068 Logic.legacy_(un)varify as temporary workaround.
8070 * Pure: structure Name provides scalable operations for generating
8071 internal variable names, notably Name.variants etc. This replaces
8072 some popular functions from term.ML:
8074 Term.variant -> Name.variant
8075 Term.variantlist -> Name.variant_list
8076 Term.invent_names -> Name.invent_list
8078 Note that low-level renaming rarely occurs in new code -- operations
8079 from structure Variable are used instead (see below).
8081 * Pure: structure Variable provides fundamental operations for proper
8082 treatment of fixed/schematic variables in a context. For example,
8083 Variable.import introduces fixes for schematics of given facts and
8084 Variable.export reverses the effect (up to renaming) -- this replaces
8085 various freeze_thaw operations.
8087 * Pure: structure Goal provides simple interfaces for
8088 init/conclude/finish and tactical prove operations (replacing former
8089 Tactic.prove). Goal.prove is the canonical way to prove results
8090 within a given context; Goal.prove_global is a degraded version for
8091 theory level goals, including a global Drule.standard. Note that
8092 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8093 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8094 in a locale context).
8096 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8097 and type checking (Syntax.check_term etc.), with common combinations
8098 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8099 which are considered legacy and await removal.
8101 * Pure/Syntax: generic interfaces for type unchecking
8102 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8103 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8104 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8105 available for convenience, but refer to the very same operations using
8106 a mere theory instead of a full context.
8108 * Isar: simplified treatment of user-level errors, using exception
8109 ERROR of string uniformly. Function error now merely raises ERROR,
8110 without any side effect on output channels. The Isar toplevel takes
8111 care of proper display of ERROR exceptions. ML code may use plain
8112 handle/can/try; cat_error may be used to concatenate errors like this:
8114 ... handle ERROR msg => cat_error msg "..."
8116 Toplevel ML code (run directly or through the Isar toplevel) may be
8117 embedded into the Isar toplevel with exception display/debug like
8120 Isar.toplevel (fn () => ...)
8122 INCOMPATIBILITY, removed special transform_error facilities, removed
8123 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8124 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8125 -- use plain ERROR instead.
8127 * Isar: theory setup now has type (theory -> theory), instead of a
8128 list. INCOMPATIBILITY, may use #> to compose setup functions.
8130 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8131 ProofContext.debug/verbose flags.
8133 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8134 theory before entering a proof state. Transactions now always see a
8135 quasi-functional intermediate checkpoint, both in interactive and
8138 * Isar: simplified interfaces for outer syntax. Renamed
8139 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8140 OuterSyntax.add_parsers -- this functionality is now included in
8141 OuterSyntax.command etc. INCOMPATIBILITY.
8143 * Simplifier: the simpset of a running simplification process now
8144 contains a proof context (cf. Simplifier.the_context), which is the
8145 very context that the initial simpset has been retrieved from (by
8146 simpset_of/local_simpset_of). Consequently, all plug-in components
8147 (solver, looper etc.) may depend on arbitrary proof data.
8149 * Simplifier.inherit_context inherits the proof context (plus the
8150 local bounds) of the current simplification process; any simproc
8151 etc. that calls the Simplifier recursively should do this! Removed
8152 former Simplifier.inherit_bounds, which is already included here --
8153 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8154 specify an explicit context using Simplifier.context/theory_context.
8156 * Simplifier/Classical Reasoner: more abstract interfaces
8157 change_simpset/claset for modifying the simpset/claset reference of a
8158 theory; raw versions simpset/claset_ref etc. have been discontinued --
8161 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8167 * settings: the default heap location within ISABELLE_HOME_USER now
8168 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8169 Isabelle installations.
8171 * isabelle-process: option -S (secure mode) disables some critical
8172 operations, notably runtime compilation and evaluation of ML source
8175 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8177 * Support for parallel execution, using native multicore support of
8178 Poly/ML 5.1. The theory loader exploits parallelism when processing
8179 independent theories, according to the given theory header
8180 specifications. The maximum number of worker threads is specified via
8181 usedir option -M or the "max-threads" setting in Proof General. A
8182 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8183 to 6 on a 8-core machine. User-code needs to observe certain
8184 guidelines for thread-safe programming, see appendix A in the Isar
8185 Implementation manual.
8189 New in Isabelle2005 (October 2005)
8190 ----------------------------------
8194 * Theory headers: the new header syntax for Isar theories is
8197 imports <theory1> ... <theoryN>
8198 uses <file1> ... <fileM>
8201 where the 'uses' part is optional. The previous syntax
8203 theory <name> = <theory1> + ... + <theoryN>:
8205 will disappear in the next release. Use isatool fixheaders to convert
8206 existing theory files. Note that there is no change in ancient
8207 non-Isar theories now, but these will disappear soon.
8209 * Theory loader: parent theories can now also be referred to via
8210 relative and absolute paths.
8212 * Command 'find_theorems' searches for a list of criteria instead of a
8213 list of constants. Known criteria are: intro, elim, dest, name:string,
8214 simp:term, and any term. Criteria can be preceded by '-' to select
8215 theorems that do not match. Intro, elim, dest select theorems that
8216 match the current goal, name:s selects theorems whose fully qualified
8217 name contain s, and simp:term selects all simplification rules whose
8218 lhs match term. Any other term is interpreted as pattern and selects
8219 all theorems matching the pattern. Available in ProofGeneral under
8220 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8222 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8224 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8225 matching the current goal as introduction rule and not having "HOL."
8226 in their name (i.e. not being defined in theory HOL).
8228 * Command 'thms_containing' has been discontinued in favour of
8229 'find_theorems'; INCOMPATIBILITY.
8231 * Communication with Proof General is now 8bit clean, which means that
8232 Unicode text in UTF-8 encoding may be used within theory texts (both
8233 formal and informal parts). Cf. option -U of the Isabelle Proof
8234 General interface. Here are some simple examples (cf. src/HOL/ex):
8236 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8237 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8239 * Improved efficiency of the Simplifier and, to a lesser degree, the
8240 Classical Reasoner. Typical big applications run around 2 times
8244 *** Document preparation ***
8246 * Commands 'display_drafts' and 'print_drafts' perform simple output
8247 of raw sources. Only those symbols that do not require additional
8248 LaTeX packages (depending on comments in isabellesym.sty) are
8249 displayed properly, everything else is left verbatim. isatool display
8250 and isatool print are used as front ends (these are subject to the
8251 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8253 * Command tags control specific markup of certain regions of text,
8254 notably folding and hiding. Predefined tags include "theory" (for
8255 theory begin and end), "proof" for proof commands, and "ML" for
8256 commands involving ML code; the additional tags "visible" and
8257 "invisible" are unused by default. Users may give explicit tag
8258 specifications in the text, e.g. ''by %invisible (auto)''. The
8259 interpretation of tags is determined by the LaTeX job during document
8260 preparation: see option -V of isatool usedir, or options -n and -t of
8261 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8264 Several document versions may be produced at the same time via isatool
8265 usedir (the generated index.html will link all of them). Typical
8266 specifications include ''-V document=theory,proof,ML'' to present
8267 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8268 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8269 these parts without any formal replacement text. The Isabelle site
8270 default settings produce ''document'' and ''outline'' versions as
8273 * Several new antiquotations:
8275 @{term_type term} prints a term with its type annotated;
8277 @{typeof term} prints the type of a term;
8279 @{const const} is the same as @{term const}, but checks that the
8280 argument is a known logical constant;
8282 @{term_style style term} and @{thm_style style thm} print a term or
8283 theorem applying a "style" to it
8287 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8288 definitions, equations, inequations etc., 'concl' printing only the
8289 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8290 to print the specified premise. TermStyle.add_style provides an ML
8291 interface for introducing further styles. See also the "LaTeX Sugar"
8292 document practical applications. The ML antiquotation prints
8293 type-checked ML expressions verbatim.
8295 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8296 and 'text' support optional locale specification '(in loc)', which
8297 specifies the default context for interpreting antiquotations. For
8298 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8300 * Option 'locale=NAME' of antiquotations specifies an alternative
8301 context interpreting the subsequent argument. For example: @{thm
8302 [locale=lattice] inf_assoc}.
8304 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8307 * Proper output of antiquotations for theory commands involving a
8308 proof context (such as 'locale' or 'theorem (in loc) ...').
8310 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8311 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8313 * isatool usedir: new option -C (default true) controls whether option
8314 -D should include a copy of the original document directory; -C false
8315 prevents unwanted effects such as copying of administrative CVS data.
8320 * Considerably improved version of 'constdefs' command. Now performs
8321 automatic type-inference of declared constants; additional support for
8322 local structure declarations (cf. locales and HOL records), see also
8323 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8324 sequential dependencies of definitions within a single 'constdefs'
8325 section; moreover, the declared name needs to be an identifier. If
8326 all fails, consider to fall back on 'consts' and 'defs' separately.
8328 * Improved indexed syntax and implicit structures. First of all,
8329 indexed syntax provides a notational device for subscripted
8330 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8331 expressions. Secondly, in a local context with structure
8332 declarations, number indexes \<^sub>n or the empty index (default
8333 number 1) refer to a certain fixed variable implicitly; option
8334 show_structs controls printing of implicit structures. Typical
8335 applications of these concepts involve record types and locales.
8337 * New command 'no_syntax' removes grammar declarations (and
8338 translations) resulting from the given syntax specification, which is
8339 interpreted in the same manner as for the 'syntax' command.
8341 * 'Advanced' translation functions (parse_translation etc.) may depend
8342 on the signature of the theory context being presently used for
8343 parsing/printing, see also isar-ref manual.
8345 * Improved 'oracle' command provides a type-safe interface to turn an
8346 ML expression of type theory -> T -> term into a primitive rule of
8347 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8348 is already included here); see also FOL/ex/IffExample.thy;
8351 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8352 before); "cI" is no longer bound, use "c.intro" instead.
8353 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8354 axclasses vs. locales.
8356 * Improved internal renaming of symbolic identifiers -- attach primes
8357 instead of base 26 numbers.
8359 * New flag show_question_marks controls printing of leading question
8360 marks in schematic variable names.
8362 * In schematic variable names, *any* symbol following \<^isub> or
8363 \<^isup> is now treated as part of the base name. For example, the
8364 following works without printing of awkward ".0" indexes:
8366 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8369 * Inner syntax includes (*(*nested*) comments*).
8371 * Pretty printer now supports unbreakable blocks, specified in mixfix
8372 annotations as "(00...)".
8374 * Clear separation of logical types and nonterminals, where the latter
8375 may only occur in 'syntax' specifications or type abbreviations.
8376 Before that distinction was only partially implemented via type class
8377 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8378 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8379 exotic syntax specifications may require further adaption
8380 (e.g. Cube/Cube.thy).
8382 * Removed obsolete type class "logic", use the top sort {} instead.
8383 Note that non-logical types should be declared as 'nonterminals'
8384 rather than 'types'. INCOMPATIBILITY for new object-logic
8387 * Attributes 'induct' and 'cases': type or set names may now be
8388 locally fixed variables as well.
8390 * Simplifier: can now control the depth to which conditional rewriting
8391 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8394 * Simplifier: simplification procedures may now take the current
8395 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8396 interface), which is very useful for calling the Simplifier
8397 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8398 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8399 low-level mk_simproc no longer applies Logic.varify internally, to
8400 allow for use in a context of fixed variables.
8402 * thin_tac now works even if the assumption being deleted contains !!
8403 or ==>. More generally, erule now works even if the major premise of
8404 the elimination rule contains !! or ==>.
8406 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8408 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8409 from Pure, which contains all common declarations already. Both
8410 theories are defined via plain Isabelle/Isar .thy files.
8411 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8412 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8413 use isatool fixcpure to adapt your theory and ML sources.
8415 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8416 selections of theorems in named facts via index ranges.
8418 * 'print_theorems': in theory mode, really print the difference
8419 wrt. the last state (works for interactive theory development only),
8420 in proof mode print all local facts (cf. 'print_facts');
8422 * 'hide': option '(open)' hides only base names.
8424 * More efficient treatment of intermediate checkpoints in interactive
8427 * Code generator is now invoked via code_module (incremental code
8428 generation) and code_library (modular code generation, ML structures
8429 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8430 must be quoted when used as identifiers.
8432 * New 'value' command for reading, evaluating and printing terms using
8433 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8434 quoted when used as identifier.
8439 * New commands for the interpretation of locale expressions in
8440 theories (1), locales (2) and proof contexts (3). These generate
8441 proof obligations from the expression specification. After the
8442 obligations have been discharged, theorems of the expression are added
8443 to the theory, target locale or proof context. The synopsis of the
8444 commands is a follows:
8446 (1) interpretation expr inst
8447 (2) interpretation target < expr
8448 (3) interpret expr inst
8450 Interpretation in theories and proof contexts require a parameter
8451 instantiation of terms from the current context. This is applied to
8452 specifications and theorems of the interpreted expression.
8453 Interpretation in locales only permits parameter renaming through the
8454 locale expression. Interpretation is smart in that interpretations
8455 that are active already do not occur in proof obligations, neither are
8456 instantiated theorems stored in duplicate. Use 'print_interps' to
8457 inspect active interpretations of a particular locale. For details,
8458 see the Isar Reference manual. Examples can be found in
8459 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8461 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8462 'interpret' instead.
8464 * New context element 'constrains' for adding type constraints to
8467 * Context expressions: renaming of parameters with syntax
8470 * Locale declaration: 'includes' disallowed.
8472 * Proper static binding of attribute syntax -- i.e. types / terms /
8473 facts mentioned as arguments are always those of the locale definition
8474 context, independently of the context of later invocations. Moreover,
8475 locale operations (renaming and type / term instantiation) are applied
8476 to attribute arguments as expected.
8478 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8479 actual attributes; rare situations may require Attrib.attribute to
8480 embed those attributes into Attrib.src that lack concrete syntax.
8481 Attribute implementations need to cooperate properly with the static
8482 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8483 Attrib.XXX_thm etc. already do the right thing without further
8484 intervention. Only unusual applications -- such as "where" or "of"
8485 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8486 on the context and the facts involved -- may have to assign parsed
8487 values to argument tokens explicitly.
8489 * Changed parameter management in theorem generation for long goal
8490 statements with 'includes'. INCOMPATIBILITY: produces a different
8491 theorem statement in rare situations.
8493 * Locale inspection command 'print_locale' omits notes elements. Use
8494 'print_locale!' to have them included in the output.
8499 * Provers/hypsubst.ML: improved version of the subst method, for
8500 single-step rewriting: it now works in bound variable contexts. New is
8501 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8502 rewrite a different subterm than the original subst method, which is
8503 still available as 'simplesubst'.
8505 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8508 * Provers/trancl.ML: new transitivity reasoner for transitive and
8509 reflexive-transitive closure of relations.
8511 * Provers/blast.ML: new reference depth_limit to make blast's depth
8512 limit (previously hard-coded with a value of 20) user-definable.
8514 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8515 is peformed already. Object-logics merely need to finish their
8516 initial simpset configuration as before. INCOMPATIBILITY.
8521 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8524 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8526 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8527 and x-symbol; use option '-m epsilon' to get it actually printed.
8528 Moreover, the mathematically important symbolic identifier \<epsilon>
8529 becomes available as variable, constant etc. INCOMPATIBILITY,
8531 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8532 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8533 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8534 support corresponding Isar calculations.
8536 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8539 * theory SetInterval: changed the syntax for open intervals:
8548 The old syntax is still supported but will disappear in the next
8549 release. For conversion use the following Emacs search and replace
8550 patterns (these are not perfect but work quite well):
8552 {)\([^\.]*\)\.\. -> {\1<\.\.}
8553 \.\.\([^(}]*\)(} -> \.\.<\1}
8555 * Theory Commutative_Ring (in Library): method comm_ring for proving
8556 equalities in commutative rings; method 'algebra' provides a generic
8559 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8560 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8561 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8564 Some new syntax forms are available:
8566 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8567 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8568 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8569 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8571 The latter form "\<Sum>x < k. e" used to be based on a separate
8572 function "Summation", which has been discontinued.
8574 * theory Finite_Set: in structured induction proofs, the insert case
8575 is now 'case (insert x F)' instead of the old counterintuitive 'case
8578 * The 'refute' command has been extended to support a much larger
8579 fragment of HOL, including axiomatic type classes, constdefs and
8580 typedefs, inductive datatypes and recursion.
8582 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8583 Requires zChaff with proof generation to be installed. See
8584 HOL/ex/SAT_Examples.thy for examples.
8586 * Datatype induction via method 'induct' now preserves the name of the
8587 induction variable. For example, when proving P(xs::'a list) by
8588 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8589 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8590 in unstructured proof scripts.
8592 * Reworked implementation of records. Improved scalability for
8593 records with many fields, avoiding performance problems for type
8594 inference. Records are no longer composed of nested field types, but
8595 of nested extension types. Therefore the record type only grows linear
8596 in the number of extensions and not in the number of fields. The
8597 top-level (users) view on records is preserved. Potential
8598 INCOMPATIBILITY only in strange cases, where the theory depends on the
8599 old record representation. The type generated for a record is called
8600 <record_name>_ext_type.
8602 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8603 proofs triggered by a record definition or a simproc (if
8604 quick_and_dirty is enabled). Definitions of large records can take
8607 New simproc record_upd_simproc for simplification of multiple record
8608 updates enabled by default. Moreover, trivial updates are also
8609 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8610 occasionally, since simplification is more powerful by default.
8612 * typedef: proper support for polymorphic sets, which contain extra
8613 type-variables in the term.
8615 * Simplifier: automatically reasons about transitivity chains
8616 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8617 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8618 old proofs break occasionally as simplification may now solve more
8619 goals than previously.
8621 * Simplifier: converts x <= y into x = y if assumption y <= x is
8622 present. Works for all partial orders (class "order"), in particular
8623 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8626 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8627 bound variable or a constant then the let is unfolded. Otherwise
8628 first a is simplified to b, and then f b is simplified to g. If
8629 possible we abstract b from g arriving at "let x = b in h x",
8630 otherwise we unfold the let and arrive at g. The simproc can be
8631 enabled/disabled by the reference use_let_simproc. Potential
8632 INCOMPATIBILITY since simplification is more powerful by default.
8634 * Classical reasoning: the meson method now accepts theorems as arguments.
8636 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8637 jobs to provide advice on the provability of subgoals.
8639 * Theory OrderedGroup and Ring_and_Field: various additions and
8640 improvements to faciliate calculations involving equalities and
8643 The following theorems have been eliminated or modified
8646 abs_eq now named abs_of_nonneg
8647 abs_of_ge_0 now named abs_of_nonneg
8648 abs_minus_eq now named abs_of_nonpos
8649 imp_abs_id now named abs_of_nonneg
8650 imp_abs_neg_id now named abs_of_nonpos
8651 mult_pos now named mult_pos_pos
8652 mult_pos_le now named mult_nonneg_nonneg
8653 mult_pos_neg_le now named mult_nonneg_nonpos
8654 mult_pos_neg2_le now named mult_nonneg_nonpos2
8655 mult_neg now named mult_neg_neg
8656 mult_neg_le now named mult_nonpos_nonpos
8658 * The following lemmas in Ring_and_Field have been added to the simplifier:
8661 not_square_less_zero
8663 The following lemmas have been deleted from Real/RealPow:
8673 * Theory Parity: added rules for simplifying exponents.
8677 The following theorems have been eliminated or modified
8680 list_all_Nil now named list_all.simps(1)
8681 list_all_Cons now named list_all.simps(2)
8682 list_all_conv now named list_all_iff
8683 set_mem_eq now named mem_iff
8685 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8686 asymptotic "big O" calculations. See the notes in BigO.thy.
8691 * Theory RealDef: better support for embedding natural numbers and
8692 integers in the reals.
8694 The following theorems have been eliminated or modified
8697 exp_ge_add_one_self now requires no hypotheses
8698 real_of_int_add reversed direction of equality (use [symmetric])
8699 real_of_int_minus reversed direction of equality (use [symmetric])
8700 real_of_int_diff reversed direction of equality (use [symmetric])
8701 real_of_int_mult reversed direction of equality (use [symmetric])
8703 * Theory RComplete: expanded support for floor and ceiling functions.
8705 * Theory Ln is new, with properties of the natural logarithm
8707 * Hyperreal: There is a new type constructor "star" for making
8708 nonstandard types. The old type names are now type synonyms:
8712 hcomplex = complex star
8714 * Hyperreal: Many groups of similarly-defined constants have been
8715 replaced by polymorphic versions (INCOMPATIBILITY):
8717 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8719 starset <-- starsetNat, starsetC
8720 *s* <-- *sNat*, *sc*
8721 starset_n <-- starsetNat_n, starsetC_n
8722 *sn* <-- *sNatn*, *scn*
8723 InternalSets <-- InternalNatSets, InternalCSets
8725 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8726 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8727 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8728 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8729 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8731 * Hyperreal: Many type-specific theorems have been removed in favor of
8732 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8734 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8735 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8736 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8737 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8738 right_minus <-- hypreal_add_minus
8739 left_minus <-- {hypreal,hcomplex}_add_minus_left
8740 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8741 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8742 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8743 mult_1_right <-- hcomplex_mult_one_right
8744 mult_zero_left <-- hcomplex_mult_zero_left
8745 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8746 right_distrib <-- hypnat_add_mult_distrib2
8747 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8748 right_inverse <-- hypreal_mult_inverse
8749 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8750 order_refl <-- {hypreal,hypnat}_le_refl
8751 order_trans <-- {hypreal,hypnat}_le_trans
8752 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8753 order_less_le <-- {hypreal,hypnat}_less_le
8754 linorder_linear <-- {hypreal,hypnat}_le_linear
8755 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8756 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8757 add_nonneg_nonneg <-- hypreal_le_add_order
8759 * Hyperreal: Separate theorems having to do with type-specific
8760 versions of constants have been merged into theorems that apply to the
8761 new polymorphic constants (INCOMPATIBILITY):
8763 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8764 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8765 STAR_Un <-- {STAR,NatStar,STARC}_Un
8766 STAR_Int <-- {STAR,NatStar,STARC}_Int
8767 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8768 STAR_subset <-- {STAR,NatStar,STARC}_subset
8769 STAR_mem <-- {STAR,NatStar,STARC}_mem
8770 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8771 STAR_diff <-- {STAR,STARC}_diff
8772 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8773 STARC_hcomplex_of_complex}_image_subset
8774 starset_n_Un <-- starset{Nat,C}_n_Un
8775 starset_n_Int <-- starset{Nat,C}_n_Int
8776 starset_n_Compl <-- starset{Nat,C}_n_Compl
8777 starset_n_diff <-- starset{Nat,C}_n_diff
8778 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8779 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8780 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8781 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8782 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8783 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8784 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8785 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8786 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8787 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8788 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8789 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8790 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8791 starfun_diff <-- starfun{C,RC,CR}_diff
8792 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8793 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8794 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8795 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8796 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8797 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8798 starfun_Id <-- starfunC_Id
8799 starfun_approx <-- starfun{Nat,CR}_approx
8800 starfun_capprox <-- starfun{C,RC}_capprox
8801 starfun_abs <-- starfunNat_rabs
8802 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8803 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8804 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8805 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8806 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8807 starfun_add_approx <-- starfunCR_add_approx
8808 starfun_inverse_inverse <-- starfunC_inverse_inverse
8809 starfun_divide <-- starfun{C,CR,RC}_divide
8810 starfun_n <-- starfun{Nat,C}_n
8811 starfun_n_mult <-- starfun{Nat,C}_n_mult
8812 starfun_n_add <-- starfun{Nat,C}_n_add
8813 starfun_n_add_minus <-- starfunNat_n_add_minus
8814 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8815 starfun_n_minus <-- starfun{Nat,C}_n_minus
8816 starfun_n_eq <-- starfun{Nat,C}_n_eq
8818 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8819 star_n_minus <-- {hypreal,hcomplex}_minus
8820 star_n_diff <-- {hypreal,hcomplex}_diff
8821 star_n_mult <-- {hypreal,hcomplex}_mult
8822 star_n_inverse <-- {hypreal,hcomplex}_inverse
8823 star_n_le <-- {hypreal,hypnat}_le
8824 star_n_less <-- {hypreal,hypnat}_less
8825 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8826 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8827 star_n_abs <-- hypreal_hrabs
8828 star_n_divide <-- hcomplex_divide
8830 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8831 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8832 star_of_diff <-- hypreal_of_real_diff
8833 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8834 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8835 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8836 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8837 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8838 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8839 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8840 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8841 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8842 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8843 star_of_number_of <-- {hypreal,hcomplex}_number_of
8844 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8845 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8846 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8847 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8848 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8849 star_of_power <-- hypreal_of_real_power
8850 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8852 * Hyperreal: new method "transfer" that implements the transfer
8853 principle of nonstandard analysis. With a subgoal that mentions
8854 nonstandard types like "'a star", the command "apply transfer"
8855 replaces it with an equivalent one that mentions only standard types.
8856 To be successful, all free variables must have standard types; non-
8857 standard variables must have explicit universal quantifiers.
8859 * Hyperreal: A theory of Taylor series.
8864 * Discontinued special version of 'constdefs' (which used to support
8865 continuous functions) in favor of the general Pure one with full
8868 * New simplification procedure for solving continuity conditions; it
8869 is much faster on terms with many nested lambda abstractions (cubic
8870 instead of exponential time).
8872 * New syntax for domain package: selector names are now optional.
8873 Parentheses should be omitted unless argument is lazy, for example:
8875 domain 'a stream = cons "'a" (lazy "'a stream")
8877 * New command 'fixrec' for defining recursive functions with pattern
8878 matching; defining multiple functions with mutual recursion is also
8879 supported. Patterns may include the constants cpair, spair, up, sinl,
8880 sinr, or any data constructor defined by the domain package. The given
8881 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8882 syntax and examples.
8884 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8885 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8886 but the proof obligation additionally includes an admissibility
8887 requirement. The packages generate instances of class cpo or pcpo,
8888 with continuity and strictness theorems for Rep and Abs.
8890 * HOLCF: Many theorems have been renamed according to a more standard naming
8891 scheme (INCOMPATIBILITY):
8893 foo_inject: "foo$x = foo$y ==> x = y"
8894 foo_eq: "(foo$x = foo$y) = (x = y)"
8895 foo_less: "(foo$x << foo$y) = (x << y)"
8896 foo_strict: "foo$UU = UU"
8897 foo_defined: "... ==> foo$x ~= UU"
8898 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8903 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8904 including the First Isomorphism Theorem (on quotienting by the kernel
8907 * ZF/Simplifier: install second copy of type solver that actually
8908 makes use of TC rules declared to Isar proof contexts (or locales);
8909 the old version is still required for ML proof scripts.
8914 * Converted to Isar theory format; use locales instead of axiomatic
8920 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8923 * Pure/library.ML no longer defines its own option datatype, but uses
8924 that of the SML basis, which has constructors NONE and SOME instead of
8925 None and Some, as well as exception Option.Option instead of OPTION.
8926 The functions the, if_none, is_some, is_none have been adapted
8927 accordingly, while Option.map replaces apsome.
8929 * Pure/library.ML: the exception LIST has been given up in favour of
8930 the standard exceptions Empty and Subscript, as well as
8931 Library.UnequalLengths. Function like Library.hd and Library.tl are
8932 superceded by the standard hd and tl functions etc.
8934 A number of basic list functions are no longer exported to the ML
8935 toplevel, as they are variants of predefined functions. The following
8936 suggests how one can translate existing code:
8938 rev_append xs ys = List.revAppend (xs, ys)
8939 nth_elem (i, xs) = List.nth (xs, i)
8940 last_elem xs = List.last xs
8941 flat xss = List.concat xss
8942 seq fs = List.app fs
8943 partition P xs = List.partition P xs
8944 mapfilter f xs = List.mapPartial f xs
8946 * Pure/library.ML: several combinators for linear functional
8947 transformations, notably reverse application and composition:
8950 (x, y) |-> f f #-> g
8952 * Pure/library.ML: introduced/changed precedence of infix operators:
8954 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8956 infix 3 o oo ooo oooo;
8957 infix 4 ~~ upto downto;
8959 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8962 * Pure/library.ML: natural list combinators fold, fold_rev, and
8963 fold_map support linear functional transformations and nesting. For
8966 fold f [x1, ..., xN] y =
8967 y |> f x1 |> ... |> f xN
8969 (fold o fold) f [xs1, ..., xsN] y =
8970 y |> fold f xs1 |> ... |> fold f xsN
8972 fold f [x1, ..., xN] =
8975 (fold o fold) f [xs1, ..., xsN] =
8976 fold f xs1 #> ... #> fold f xsN
8978 * Pure/library.ML: the following selectors on type 'a option are
8981 the: 'a option -> 'a (*partial*)
8982 these: 'a option -> 'a where 'a = 'b list
8983 the_default: 'a -> 'a option -> 'a
8984 the_list: 'a option -> 'a list
8986 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8987 basic operations for association lists, following natural argument
8988 order; moreover the explicit equality predicate passed here avoids
8989 potentially expensive polymorphic runtime equality checks.
8990 The old functions may be expressed as follows:
8992 assoc = uncurry (AList.lookup (op =))
8993 assocs = these oo AList.lookup (op =)
8994 overwrite = uncurry (AList.update (op =)) o swap
8996 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8998 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8999 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
9001 replacing make_keylist and keyfilter (occassionally used)
9004 make_keylist = AList.make
9005 keyfilter = AList.find (op =)
9007 * eq_fst and eq_snd now take explicit equality parameter, thus
9008 avoiding eqtypes. Naive rewrites:
9010 eq_fst = eq_fst (op =)
9011 eq_snd = eq_snd (op =)
9013 * Removed deprecated apl and apr (rarely used).
9016 apl (n, op) =>>= curry op n
9017 apr (op, m) =>>= fn n => op (n, m)
9019 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
9020 provides a reasonably efficient light-weight implementation of sets as
9023 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
9024 few new operations; existing lookup and update are now curried to
9025 follow natural argument order (for use with fold etc.);
9026 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
9028 * Pure/General: output via the Isabelle channels of
9029 writeln/warning/error etc. is now passed through Output.output, with a
9030 hook for arbitrary transformations depending on the print_mode
9031 (cf. Output.add_mode -- the first active mode that provides a output
9032 function wins). Already formatted output may be embedded into further
9033 text via Output.raw; the result of Pretty.string_of/str_of and derived
9034 functions (string_of_term/cterm/thm etc.) is already marked raw to
9035 accommodate easy composition of diagnostic messages etc. Programmers
9036 rarely need to care about Output.output or Output.raw at all, with
9037 some notable exceptions: Output.output is required when bypassing the
9038 standard channels (writeln etc.), or in token translations to produce
9039 properly formatted results; Output.raw is required when capturing
9040 already output material that will eventually be presented to the user
9041 a second time. For the default print mode, both Output.output and
9042 Output.raw have no effect.
9044 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9045 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9046 cumulative results are displayed at the end of a batch session.
9048 * Pure/General: File.sysify_path and File.quote_sysify path have been
9049 replaced by File.platform_path and File.shell_path (with appropriate
9050 hooks). This provides a clean interface for unusual systems where the
9051 internal and external process view of file names are different.
9053 * Pure: more efficient orders for basic syntactic entities: added
9054 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9055 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9056 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9057 orders now -- potential INCOMPATIBILITY for code that depends on a
9058 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9059 Library.sort_strings on result).
9061 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9062 fold_types traverse types/terms from left to right, observing natural
9063 argument order. Supercedes previous foldl_XXX versions, add_frees,
9064 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9066 * Pure: name spaces have been refined, with significant changes of the
9067 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9068 to extern(_table). The plain name entry path is superceded by a
9069 general 'naming' context, which also includes the 'policy' to produce
9070 a fully qualified name and external accesses of a fully qualified
9071 name; NameSpace.extend is superceded by context dependent
9072 Sign.declare_name. Several theory and proof context operations modify
9073 the naming context. Especially note Theory.restore_naming and
9074 ProofContext.restore_naming to get back to a sane state; note that
9075 Theory.add_path is no longer sufficient to recover from
9076 Theory.absolute_path in particular.
9078 * Pure: new flags short_names (default false) and unique_names
9079 (default true) for controlling output of qualified names. If
9080 short_names is set, names are printed unqualified. If unique_names is
9081 reset, the name prefix is reduced to the minimum required to achieve
9082 the original result when interning again, even if there is an overlap
9083 with earlier declarations.
9085 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9086 now 'extend', and 'merge' gets an additional Pretty.pp argument
9087 (useful for printing error messages). INCOMPATIBILITY.
9089 * Pure: major reorganization of the theory context. Type Sign.sg and
9090 Theory.theory are now identified, referring to the universal
9091 Context.theory (see Pure/context.ML). Actual signature and theory
9092 content is managed as theory data. The old code and interfaces were
9093 spread over many files and structures; the new arrangement introduces
9094 considerable INCOMPATIBILITY to gain more clarity:
9096 Context -- theory management operations (name, identity, inclusion,
9097 parents, ancestors, merge, etc.), plus generic theory data;
9099 Sign -- logical signature and syntax operations (declaring consts,
9100 types, etc.), plus certify/read for common entities;
9102 Theory -- logical theory operations (stating axioms, definitions,
9103 oracles), plus a copy of logical signature operations (consts,
9104 types, etc.); also a few basic management operations (Theory.copy,
9107 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9108 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9109 for convenience -- they merely return the theory.
9111 * Pure: type Type.tsig is superceded by theory in most interfaces.
9113 * Pure: the Isar proof context type is already defined early in Pure
9114 as Context.proof (note that ProofContext.context and Proof.context are
9115 aliases, where the latter is the preferred name). This enables other
9116 Isabelle components to refer to that type even before Isar is present.
9118 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9119 typeK, constK, axiomK, oracleK), but provide explicit operations for
9120 any of these kinds. For example, Sign.intern typeK is now
9121 Sign.intern_type, Theory.hide_space Sign.typeK is now
9122 Theory.hide_types. Also note that former
9123 Theory.hide_classes/types/consts are now
9124 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9125 internalize their arguments! INCOMPATIBILITY.
9127 * Pure: get_thm interface (of PureThy and ProofContext) expects
9128 datatype thmref (with constructors Name and NameSelection) instead of
9129 plain string -- INCOMPATIBILITY;
9131 * Pure: cases produced by proof methods specify options, where NONE
9132 means to remove case bindings -- INCOMPATIBILITY in
9135 * Pure: the following operations retrieve axioms or theorems from a
9136 theory node or theory hierarchy, respectively:
9138 Theory.axioms_of: theory -> (string * term) list
9139 Theory.all_axioms_of: theory -> (string * term) list
9140 PureThy.thms_of: theory -> (string * thm) list
9141 PureThy.all_thms_of: theory -> (string * thm) list
9143 * Pure: print_tac now outputs the goal through the trace channel.
9145 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9146 Reference Toplevel.debug (default false) controls detailed printing
9147 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9148 controls execution profiling -- set to 1 for time and 2 for space
9149 (both increase the runtime).
9151 * Isar session: The initial use of ROOT.ML is now always timed,
9152 i.e. the log will show the actual process times, in contrast to the
9153 elapsed wall-clock time that the outer shell wrapper produces.
9155 * Simplifier: improved handling of bound variables (nameless
9156 representation, avoid allocating new strings). Simprocs that invoke
9157 the Simplifier recursively should use Simplifier.inherit_bounds to
9158 avoid local name clashes. Failure to do so produces warnings
9159 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9160 for further details.
9162 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9163 bindings for all theorems stored within a given theory; this may help
9164 in porting non-Isar theories to Isar ones, while keeping ML proof
9165 scripts for the time being.
9167 * ML operator HTML.with_charset specifies the charset begin used for
9168 generated HTML files. For example:
9170 HTML.with_charset "utf-8" use_thy "Hebrew";
9171 HTML.with_charset "utf-8" use_thy "Chinese";
9176 * Allow symlinks to all proper Isabelle executables (Isabelle,
9177 isabelle, isatool etc.).
9179 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9180 isatool doc, isatool mkdir, display_drafts etc.).
9182 * isatool usedir: option -f allows specification of the ML file to be
9183 used by Isabelle; default is ROOT.ML.
9185 * New isatool version outputs the version identifier of the Isabelle
9186 distribution being used.
9188 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9189 (containing Boolean satisfiability problems) into Isabelle/HOL
9194 New in Isabelle2004 (April 2004)
9195 --------------------------------
9199 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9200 Replaces linorder.ML.
9202 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9203 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9204 (\<a>...\<z>), are now considered normal letters, and can therefore
9205 be used anywhere where an ASCII letter (a...zA...Z) has until
9206 now. COMPATIBILITY: This obviously changes the parsing of some
9207 terms, especially where a symbol has been used as a binder, say
9208 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9209 as an identifier. Fix it by inserting a space around former
9210 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9211 existing theory and ML files.
9213 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9215 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9216 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9217 a normal (but invisible) letter. For multiple letter subscripts repeat
9218 \<^isub> like this: x\<^isub>1\<^isub>2.
9220 * Pure: There are now sub-/superscripts that can span more than one
9221 character. Text between \<^bsub> and \<^esub> is set in subscript in
9222 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9223 superscript. The new control characters are not identifier parts.
9225 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9226 content of "..." to the latex file instead of \isacntrl... . The "..."
9227 may consist of any printable characters excluding the end bracket >.
9229 * Pure: Using new Isar command "finalconsts" (or the ML functions
9230 Theory.add_finals or Theory.add_finals_i) it is now possible to
9231 declare constants "final", which prevents their being given a definition
9232 later. It is useful for constants whose behaviour is fixed axiomatically
9233 rather than definitionally, such as the meta-logic connectives.
9235 * Pure: 'instance' now handles general arities with general sorts
9236 (i.e. intersections of classes),
9238 * Presentation: generated HTML now uses a CSS style sheet to make layout
9239 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9240 It can be changed to alter the colors/layout of generated pages.
9245 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9246 cut_tac, subgoal_tac and thin_tac:
9247 - Now understand static (Isar) contexts. As a consequence, users of Isar
9248 locales are no longer forced to write Isar proof scripts.
9249 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9251 - INCOMPATIBILITY: names of variables to be instantiated may no
9252 longer be enclosed in quotes. Instead, precede variable name with `?'.
9253 This is consistent with the instantiation attribute "where".
9255 * Attributes "where" and "of":
9256 - Now take type variables of instantiated theorem into account when reading
9257 the instantiation string. This fixes a bug that caused instantiated
9258 theorems to have too special types in some circumstances.
9259 - "where" permits explicit instantiations of type variables.
9261 * Calculation commands "moreover" and "also" no longer interfere with
9262 current facts ("this"), admitting arbitrary combinations with "then"
9266 - Goal statements involving the context element "includes" no longer
9267 generate theorems with internal delta predicates (those ending on
9268 "_axioms") in the premise.
9269 Resolve particular premise with <locale>.intro to obtain old form.
9270 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9271 specification and "includes" elements in goal statement.
9272 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9273 [intro?] and [elim?] (respectively) by default.
9274 - Experimental command for instantiation of locales in proof contexts:
9275 instantiate <label>[<attrs>]: <loc>
9276 Instantiates locale <loc> and adds all its theorems to the current context
9277 taking into account their attributes. Label and attrs are optional
9278 modifiers, like in theorem declarations. If present, names of
9279 instantiated theorems are qualified with <label>, and the attributes
9280 <attrs> are applied after any attributes these theorems might have already.
9281 If the locale has assumptions, a chained fact of the form
9282 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9283 are derived. The command does not support old-style locales declared
9284 with "locale (open)".
9285 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9287 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9293 * Proof import: new image HOL4 contains the imported library from
9294 the HOL4 system with about 2500 theorems. It is imported by
9295 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9296 can be used like any other Isabelle image. See
9297 HOL/Import/HOL/README for more information.
9300 - Much improved handling of linear and partial orders.
9301 Reasoners for linear and partial orders are set up for type classes
9302 "linorder" and "order" respectively, and are added to the default simpset
9303 as solvers. This means that the simplifier can build transitivity chains
9304 to solve goals from the assumptions.
9305 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9306 of blast or auto after simplification become unnecessary because the goal
9307 is solved by simplification already.
9309 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9310 all proved in axiomatic type classes for semirings, rings and fields.
9313 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9314 now formalized using the Ring_and_Field theory mentioned above.
9315 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9316 than before, because now they are set up once in a generic manner.
9317 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9318 Look for the general versions in Ring_and_Field (and Power if they concern
9321 * Type "rat" of the rational numbers is now available in HOL-Complex.
9324 - Record types are now by default printed with their type abbreviation
9325 instead of the list of all field types. This can be configured via
9326 the reference "print_record_type_abbr".
9327 - Simproc "record_upd_simproc" for simplification of multiple updates added
9328 (not enabled by default).
9329 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9330 EX x. x = sel r to True (not enabled by default).
9331 - Tactic "record_split_simp_tac" to split and simplify records added.
9333 * 'specification' command added, allowing for definition by
9334 specification. There is also an 'ax_specification' command that
9335 introduces the new constants axiomatically.
9337 * arith(_tac) is now able to generate counterexamples for reals as well.
9339 * HOL-Algebra: new locale "ring" for non-commutative rings.
9341 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9342 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9344 * HOL-Matrix: a first theory for matrices in HOL with an application of
9345 matrix theory to linear programming.
9347 * Unions and Intersections:
9348 The latex output syntax of UN and INT has been changed
9349 from "\Union x \in A. B" to "\Union_{x \in A} B"
9350 i.e. the index formulae has become a subscript.
9351 Similarly for "\Union x. B", and for \Inter instead of \Union.
9353 * Unions and Intersections over Intervals:
9354 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9355 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9356 like in normal math, and corresponding versions for < and for intersection.
9358 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9359 lexicographic dictonary ordering has been added as "lexord".
9361 * ML: the legacy theory structures Int and List have been removed. They had
9362 conflicted with ML Basis Library structures having the same names.
9364 * 'refute' command added to search for (finite) countermodels. Only works
9365 for a fragment of HOL. The installation of an external SAT solver is
9366 highly recommended. See "HOL/Refute.thy" for details.
9368 * 'quickcheck' command: Allows to find counterexamples by evaluating
9369 formulae under an assignment of free variables to random values.
9370 In contrast to 'refute', it can deal with inductive datatypes,
9371 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9377 * Streams now come with concatenation and are part of the HOLCF image
9381 New in Isabelle2003 (May 2003)
9382 ------------------------------
9386 * Provers/simplifier:
9388 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9389 Assumptions are now subject to complete mutual simplification,
9390 not just from left to right. The simplifier now preserves
9391 the order of assumptions.
9393 Potential INCOMPATIBILITY:
9395 -- simp sometimes diverges where the old version did
9396 not, e.g. invoking simp on the goal
9398 [| P (f x); y = x; f x = f y |] ==> Q
9400 now gives rise to the infinite reduction sequence
9402 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9404 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9407 -- Tactics combining classical reasoner and simplification (such as auto)
9408 are also affected by this change, because many of them rely on
9409 simp. They may sometimes diverge as well or yield a different numbers
9410 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9411 in case of problems. Sometimes subsequent calls to the classical
9412 reasoner will fail because a preceeding call to the simplifier too
9413 eagerly simplified the goal, e.g. deleted redundant premises.
9415 - The simplifier trace now shows the names of the applied rewrite rules
9417 - You can limit the number of recursive invocations of the simplifier
9418 during conditional rewriting (where the simplifie tries to solve the
9419 conditions before applying the rewrite rule):
9420 ML "simp_depth_limit := n"
9421 where n is an integer. Thus you can force termination where previously
9422 the simplifier would diverge.
9424 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9426 - No longer aborts on failed congruence proof. Instead, the
9427 congruence is ignored.
9429 * Pure: New generic framework for extracting programs from constructive
9430 proofs. See HOL/Extraction.thy for an example instantiation, as well
9431 as HOL/Extraction for some case studies.
9433 * Pure: The main goal of the proof state is no longer shown by default, only
9434 the subgoals. This behaviour is controlled by a new flag.
9435 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9436 (ML: Proof.show_main_goal).
9438 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9439 rules whose conclusion matches subgoal 1:
9440 PG menu: Isabelle/Isar -> Show me -> matching rules
9441 The rules are ordered by how closely they match the subgoal.
9442 In particular, rules that solve a subgoal outright are displayed first
9443 (or rather last, the way they are printed).
9444 (ML: ProofGeneral.print_intros())
9446 * Pure: New flag trace_unify_fail causes unification to print
9447 diagnostic information (PG: in trace buffer) when it fails. This is
9448 useful for figuring out why single step proofs like rule, erule or
9451 * Pure: Locale specifications now produce predicate definitions
9452 according to the body of text (covering assumptions modulo local
9453 definitions); predicate "loc_axioms" covers newly introduced text,
9454 while "loc" is cumulative wrt. all included locale expressions; the
9455 latter view is presented only on export into the global theory
9456 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9457 on the old view without predicates;
9459 * Pure: predefined locales "var" and "struct" are useful for sharing
9460 parameters (as in CASL, for example); just specify something like
9461 ``var x + var y + struct M'' as import;
9463 * Pure: improved thms_containing: proper indexing of facts instead of
9464 raw theorems; check validity of results wrt. current name space;
9465 include local facts of proof configuration (also covers active
9466 locales), cover fixed variables in index; may use "_" in term
9467 specification; an optional limit for the number of printed facts may
9468 be given (the default is 40);
9470 * Pure: disallow duplicate fact bindings within new-style theory files
9473 * Provers: improved induct method: assumptions introduced by case
9474 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9475 the goal statement); "foo" still refers to all facts collectively;
9477 * Provers: the function blast.overloaded has been removed: all constants
9478 are regarded as potentially overloaded, which improves robustness in exchange
9479 for slight decrease in efficiency;
9481 * Provers/linorder: New generic prover for transitivity reasoning over
9482 linear orders. Note: this prover is not efficient!
9484 * Isar: preview of problems to finish 'show' now produce an error
9485 rather than just a warning (in interactive mode);
9492 - Produces a counter example if it cannot prove a goal.
9493 Note that the counter example may be spurious if the goal is not a formula
9494 of quantifier-free linear arithmetic.
9495 In ProofGeneral the counter example appears in the trace buffer.
9497 - Knows about div k and mod k where k is a numeral of type nat or int.
9499 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9500 linear arithmetic fails. This takes account of quantifiers and divisibility.
9501 Presburger arithmetic can also be called explicitly via presburger(_tac).
9503 * simp's arithmetic capabilities have been enhanced a bit: it now
9504 takes ~= in premises into account (by performing a case split);
9506 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9507 are distributed over a sum of terms;
9509 * New tactic "trans_tac" and method "trans" instantiate
9510 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9513 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9514 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9516 * 'typedef' command has new option "open" to suppress the set
9519 * functions Min and Max on finite sets have been introduced (theory
9522 * attribute [symmetric] now works for relations as well; it turns
9523 (x,y) : R^-1 into (y,x) : R, and vice versa;
9525 * induct over a !!-quantified statement (say !!x1..xn):
9526 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9528 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9529 %x. None. Warning: empty_def now refers to the previously hidden definition
9532 * Algebra: formalization of classical algebra. Intended as base for
9533 any algebraic development in Isabelle. Currently covers group theory
9534 (up to Sylow's theorem) and ring theory (Universal Property of
9535 Univariate Polynomials). Contributions welcome;
9537 * GroupTheory: deleted, since its material has been moved to Algebra;
9539 * Complex: new directory of the complex numbers with numeric constants,
9540 nonstandard complex numbers, and some complex analysis, standard and
9541 nonstandard (Jacques Fleuriot);
9543 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9545 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9548 * Real/HahnBanach: updated and adapted to locales;
9550 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9553 * UNITY: added the Meier-Sanders theory of progress sets;
9555 * MicroJava: bytecode verifier and lightweight bytecode verifier
9556 as abstract algorithms, instantiated to the JVM;
9558 * Bali: Java source language formalization. Type system, operational
9559 semantics, axiomatic semantics. Supported language features:
9560 classes, interfaces, objects,virtual methods, static methods,
9561 static/instance fields, arrays, access modifiers, definite
9562 assignment, exceptions.
9567 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9570 * Main ZF: virtually all theories converted to new-style format;
9575 * Pure: Tactic.prove provides sane interface for internal proofs;
9576 omits the infamous "standard" operation, so this is more appropriate
9577 than prove_goalw_cterm in many situations (e.g. in simprocs);
9579 * Pure: improved error reporting of simprocs;
9581 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9585 *** Document preparation ***
9587 * uses \par instead of \\ for line breaks in theory text. This may
9588 shift some page breaks in large documents. To get the old behaviour
9589 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9591 * minimized dependencies of isabelle.sty and isabellesym.sty on
9594 * \<euro> now needs package babel/greek instead of marvosym (which
9597 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9602 New in Isabelle2002 (March 2002)
9603 --------------------------------
9605 *** Document preparation ***
9607 * greatly simplified document preparation setup, including more
9608 graceful interpretation of isatool usedir -i/-d/-D options, and more
9609 instructive isatool mkdir; users should basically be able to get
9610 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9611 users may run a separate document processing stage manually like this:
9612 "isatool usedir -D output HOL Test && isatool document Test/output";
9614 * theory dependency graph may now be incorporated into documents;
9615 isatool usedir -g true will produce session_graph.eps/.pdf for use
9616 with \includegraphics of LaTeX;
9618 * proper spacing of consecutive markup elements, especially text
9619 blocks after section headings;
9621 * support bold style (for single symbols only), input syntax is like
9622 this: "\<^bold>\<alpha>" or "\<^bold>A";
9624 * \<bullet> is now output as bold \cdot by default, which looks much
9625 better in printed text;
9627 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9628 note that these symbols are currently unavailable in Proof General /
9629 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9631 * isatool latex no longer depends on changed TEXINPUTS, instead
9632 isatool document copies the Isabelle style files to the target
9638 * Pure/Provers: improved proof by cases and induction;
9639 - 'case' command admits impromptu naming of parameters (such as
9641 - 'induct' method divinates rule instantiation from the inductive
9642 claim; no longer requires excessive ?P bindings for proper
9643 instantiation of cases;
9644 - 'induct' method properly enumerates all possibilities of set/type
9645 rules; as a consequence facts may be also passed through *type*
9646 rules without further ado;
9647 - 'induct' method now derives symbolic cases from the *rulified*
9648 rule (before it used to rulify cases stemming from the internal
9649 atomized version); this means that the context of a non-atomic
9650 statement becomes is included in the hypothesis, avoiding the
9651 slightly cumbersome show "PROP ?case" form;
9652 - 'induct' may now use elim-style induction rules without chaining
9653 facts, using ``missing'' premises from the goal state; this allows
9654 rules stemming from inductive sets to be applied in unstructured
9655 scripts, while still benefitting from proper handling of non-atomic
9656 statements; NB: major inductive premises need to be put first, all
9657 the rest of the goal is passed through the induction;
9658 - 'induct' proper support for mutual induction involving non-atomic
9659 rule statements (uses the new concept of simultaneous goals, see
9661 - append all possible rule selections, but only use the first
9662 success (no backtracking);
9663 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9664 - undeclared rule case names default to numbers 1, 2, 3, ...;
9665 - added 'print_induct_rules' (covered by help item in recent Proof
9667 - moved induct/cases attributes to Pure, methods to Provers;
9668 - generic method setup instantiated for FOL and HOL;
9670 * Pure: support multiple simultaneous goal statements, for example
9671 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9672 meta-level mechanism, this acts as if several individual goals had
9673 been stated separately; in particular common proof methods need to be
9674 repeated in order to cover all claims; note that a single elimination
9675 step is *not* sufficient to establish the two conjunctions, so this
9678 assume "A & B" then have A and B .. (*".." fails*)
9680 better use "obtain" in situations as above; alternative refer to
9681 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9683 * Pure: proper integration with ``locales''; unlike the original
9684 version by Florian Kammller, Isar locales package high-level proof
9685 contexts rather than raw logical ones (e.g. we admit to include
9686 attributes everywhere); operations on locales include merge and
9687 rename; support for implicit arguments (``structures''); simultaneous
9688 type-inference over imports and text; see also HOL/ex/Locales.thy for
9691 * Pure: the following commands have been ``localized'', supporting a
9692 target locale specification "(in name)": 'lemma', 'theorem',
9693 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9694 stored both within the locale and at the theory level (exported and
9695 qualified by the locale name);
9697 * Pure: theory goals may now be specified in ``long'' form, with
9698 ad-hoc contexts consisting of arbitrary locale elements. for example
9699 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9700 definitions may be given, too); the result is a meta-level rule with
9701 the context elements being discharged in the obvious way;
9703 * Pure: new proof command 'using' allows to augment currently used
9704 facts after a goal statement ('using' is syntactically analogous to
9705 'apply', but acts on the goal's facts only); this allows chained facts
9706 to be separated into parts given before and after a claim, as in
9707 ``from a and b have C using d and e <proof>'';
9709 * Pure: renamed "antecedent" case to "rule_context";
9711 * Pure: new 'judgment' command records explicit information about the
9712 object-logic embedding (used by several tools internally); no longer
9713 use hard-wired "Trueprop";
9715 * Pure: added 'corollary' command;
9717 * Pure: fixed 'token_translation' command;
9719 * Pure: removed obsolete 'exported' attribute;
9721 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9722 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9723 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9725 * Pure: method 'atomize' presents local goal premises as object-level
9726 statements (atomic meta-level propositions); setup controlled via
9727 rewrite rules declarations of 'atomize' attribute; example
9728 application: 'induct' method with proper rule statements in improper
9731 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9732 now consider the syntactic context of assumptions, giving a better
9733 chance to get type-inference of the arguments right (this is
9734 especially important for locales);
9736 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9739 * Pure/obtain: the formal conclusion "thesis", being marked as
9740 ``internal'', may no longer be reference directly in the text;
9741 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9744 * Pure: generic 'sym' attribute which declares a rule both as pure
9745 'elim?' and for the 'symmetric' operation;
9747 * Pure: marginal comments ``--'' may now occur just anywhere in the
9748 text; the fixed correlation with particular command syntax has been
9751 * Pure: new method 'rules' is particularly well-suited for proof
9752 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9753 but often produces more compact proof terms with less detours;
9755 * Pure/Provers/classical: simplified integration with pure rule
9756 attributes and methods; the classical "intro?/elim?/dest?"
9757 declarations coincide with the pure ones; the "rule" method no longer
9758 includes classically swapped intros; "intro" and "elim" methods no
9759 longer pick rules from the context; also got rid of ML declarations
9760 AddXIs/AddXEs/AddXDs; all of this has some potential for
9763 * Provers/classical: attribute 'swapped' produces classical inversions
9764 of introduction rules;
9766 * Provers/simplifier: 'simplified' attribute may refer to explicit
9767 rules instead of full simplifier context; 'iff' attribute handles
9770 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9772 * HOL: 'recdef' now fails on unfinished automated proofs, use
9773 "(permissive)" option to recover old behavior;
9775 * HOL: 'inductive' no longer features separate (collective) attributes
9776 for 'intros' (was found too confusing);
9778 * HOL: properly declared induction rules less_induct and
9784 * HOL: moved over to sane numeral syntax; the new policy is as
9787 - 0 and 1 are polymorphic constants, which are defined on any
9788 numeric type (nat, int, real etc.);
9790 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9791 binary representation internally;
9793 - type nat has special constructor Suc, and generally prefers Suc 0
9794 over 1::nat and Suc (Suc 0) over 2::nat;
9796 This change may cause significant problems of INCOMPATIBILITY; here
9797 are some hints on converting existing sources:
9799 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9800 entities, so expressions involving "-" (unary or binary minus) need
9801 to be spaced properly;
9803 - existing occurrences of "1" may need to be constraint "1::nat" or
9804 even replaced by Suc 0; similar for old "2";
9806 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9808 - remove all special provisions on numerals in proofs;
9810 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9811 representation (depends on bin_arith_simps in the default context);
9813 * HOL: symbolic syntax for x^2 (numeral 2);
9815 * HOL: the class of all HOL types is now called "type" rather than
9816 "term"; INCOMPATIBILITY, need to adapt references to this type class
9817 in axclass/classes, instance/arities, and (usually rare) occurrences
9818 in typings (of consts etc.); internally the class is called
9819 "HOL.type", ML programs should refer to HOLogic.typeS;
9821 * HOL/record package improvements:
9822 - new derived operations "fields" to build a partial record section,
9823 "extend" to promote a fixed record to a record scheme, and
9824 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9825 declared as simp by default;
9826 - shared operations ("more", "fields", etc.) now need to be always
9827 qualified) --- potential INCOMPATIBILITY;
9828 - removed "make_scheme" operations (use "make" with "extend") --
9830 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9831 - provides cases/induct rules for use with corresponding Isar
9832 methods (for concrete records, record schemes, concrete more
9833 parts, and schematic more parts -- in that order);
9834 - internal definitions directly based on a light-weight abstract
9835 theory of product types over typedef rather than datatype;
9837 * HOL: generic code generator for generating executable ML code from
9838 specifications; specific support for HOL constructs such as inductive
9839 datatypes and sets, as well as recursive functions; can be invoked
9840 via 'generate_code' theory section;
9842 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9844 * HOL: consolidated and renamed several theories. In particular:
9845 Ord.thy has been absorbed into HOL.thy
9846 String.thy has been absorbed into List.thy
9848 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9849 (beware of argument permutation!);
9851 * HOL: linorder_less_split superseded by linorder_cases;
9853 * HOL/List: "nodups" renamed to "distinct";
9855 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9856 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9857 - Ex_def has changed, now need to use some_eq_ex
9859 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9860 in this (rare) case use:
9862 delSWrapper "split_all_tac"
9863 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9865 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9868 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9869 Isabelle's type classes, ^ on functions and relations has too general
9870 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9871 necessary to attach explicit type constraints;
9873 * HOL/Relation: the prefix name of the infix "O" has been changed from
9874 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9875 renamed accordingly (eg "compI" -> "rel_compI").
9877 * HOL: syntax translations now work properly with numerals and records
9880 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9881 of "lam" -- INCOMPATIBILITY;
9883 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9884 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9885 renamed "Product_Type.unit";
9887 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9889 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9890 the "cases" method);
9892 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9895 * HOL/IMP: updated and converted to new-style theory format; several
9896 parts turned into readable document, with proper Isar proof texts and
9897 some explanations (by Gerwin Klein);
9899 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9901 * HOL-Hyperreal is now a logic image;
9906 * Isar: consts/constdefs supports mixfix syntax for continuous
9909 * Isar: domain package adapted to new-style theory format, e.g. see
9912 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9913 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9914 lift.induct_tac, always use UU instead of Undef;
9916 * HOLCF/IMP: updated and converted to new-style theory;
9921 * Isar: proper integration of logic-specific tools and packages,
9922 including theory commands '(co)inductive', '(co)datatype',
9923 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9924 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9926 * theory Main no longer includes AC; for the Axiom of Choice, base
9927 your theory on Main_ZFC;
9929 * the integer library now covers quotients and remainders, with many
9930 laws relating division to addition, multiplication, etc.;
9932 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9933 typeless version of the formalism;
9935 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9938 * ZF/Induct: new directory for examples of inductive definitions,
9939 including theory Multiset for multiset orderings; converted to
9940 new-style theory format;
9942 * ZF: many new theorems about lists, ordinals, etc.;
9947 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9948 variable proof controls level of detail: 0 = no proofs (only oracle
9949 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9950 also ref manual for further ML interfaces;
9952 * Pure/axclass: removed obsolete ML interface
9953 goal_subclass/goal_arity;
9955 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9956 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9957 separate tokens, so expressions involving minus need to be spaced
9960 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9961 rather than "infixl" or "infixr";
9963 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9964 sort constraint specifications in type inference; e.g. "x::_::foo"
9965 ensures that the type of "x" is of sort "foo" (but not necessarily a
9968 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9969 control output of nested => (types); the default behavior is
9972 * Pure/syntax: builtin parse translation for "_constify" turns valued
9973 tokens into AST constants;
9975 * Pure/syntax: prefer later declarations of translations and print
9976 translation functions; potential INCOMPATIBILITY: need to reverse
9977 multiple declarations for same syntax element constant;
9979 * Pure/show_hyps reset by default (in accordance to existing Isar
9982 * Provers/classical: renamed addaltern to addafter, addSaltern to
9985 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9988 * system: tested support for MacOS X; should be able to get Isabelle +
9989 Proof General to work in a plain Terminal after installing Poly/ML
9990 (e.g. from the Isabelle distribution area) and GNU bash alone
9991 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9992 support requires further installations, e.g. from
9993 http://fink.sourceforge.net/);
9995 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9997 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9998 of 40 MB), cf. ML_OPTIONS;
10000 * system: Proof General keywords specification is now part of the
10001 Isabelle distribution (see etc/isar-keywords.el);
10003 * system: support for persistent Proof General sessions (refrain from
10004 outdating all loaded theories on startup); user may create writable
10005 logic images like this: ``isabelle -q HOL Test'';
10007 * system: smart selection of Isabelle process versus Isabelle
10008 interface, accommodates case-insensitive file systems (e.g. HFS+); may
10009 run both "isabelle" and "Isabelle" even if file names are badly
10010 damaged (executable inspects the case of the first letter of its own
10011 name); added separate "isabelle-process" and "isabelle-interface";
10013 * system: refrain from any attempt at filtering input streams; no
10014 longer support ``8bit'' encoding of old isabelle font, instead proper
10015 iso-latin characters may now be used; the related isatools
10016 "symbolinput" and "nonascii" have disappeared as well;
10018 * system: removed old "xterm" interface (the print modes "xterm" and
10019 "xterm_color" are still available for direct use in a suitable
10024 New in Isabelle99-2 (February 2001)
10025 -----------------------------------
10027 *** Overview of INCOMPATIBILITIES ***
10029 * HOL: please note that theories in the Library and elsewhere often use the
10030 new-style (Isar) format; to refer to their theorems in an ML script you must
10031 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
10033 * HOL: inductive package no longer splits induction rule aggressively,
10034 but only as far as specified by the introductions given; the old
10035 format may be recovered via ML function complete_split_rule or attribute
10036 'split_rule (complete)';
10038 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10039 gfp_Tarski to gfp_unfold;
10041 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10043 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10044 relation); infix "^^" has been renamed "``"; infix "``" has been
10045 renamed "`"; "univalent" has been renamed "single_valued";
10047 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10050 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10052 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10054 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10055 consequence, it is no longer monotonic wrt. the local goal context
10056 (which is now passed through the inductive cases);
10058 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10059 \<gg> to \<ggreater>;
10062 *** Document preparation ***
10064 * \isabellestyle{NAME} selects version of Isabelle output (currently
10065 available: are "it" for near math-mode best-style output, "sl" for
10066 slanted text style, and "tt" for plain type-writer; if no
10067 \isabellestyle command is given, output is according to slanted
10070 * support sub/super scripts (for single symbols only), input syntax is
10071 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10073 * some more standard symbols; see Appendix A of the system manual for
10074 the complete list of symbols defined in isabellesym.sty;
10076 * improved isabelle style files; more abstract symbol implementation
10077 (should now use \isamath{...} and \isatext{...} in custom symbol
10080 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10081 state; Note that presentation of goal states does not conform to
10082 actual human-readable proof documents. Please do not include goal
10083 states into document output unless you really know what you are doing!
10085 * proper indentation of antiquoted output with proportional LaTeX
10088 * no_document ML operator temporarily disables LaTeX document
10091 * isatool unsymbolize tunes sources for plain ASCII communication;
10096 * Pure: Isar now suffers initial goal statements to contain unbound
10097 schematic variables (this does not conform to actual readable proof
10098 documents, due to unpredictable outcome and non-compositional proof
10099 checking); users who know what they are doing may use schematic goals
10100 for Prolog-style synthesis of proven results;
10102 * Pure: assumption method (an implicit finishing) now handles actual
10105 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10106 initial goal, declare "that" only as Pure intro (only for single
10107 steps); the "that" rule assumption may now be involved in implicit
10108 finishing, thus ".." becomes a feasible for trivial obtains;
10110 * Pure: default proof step now includes 'intro_classes'; thus trivial
10111 instance proofs may be performed by "..";
10113 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10114 statements as well;
10116 * Pure: more robust selection of calculational rules;
10118 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10119 rule (as well as the assumption rule);
10121 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10122 lemmas, using the graph browser tool;
10124 * Pure: predict failure of "show" in interactive mode;
10126 * Pure: 'thms_containing' now takes actual terms as arguments;
10128 * HOL: improved method 'induct' --- now handles non-atomic goals
10129 (potential INCOMPATIBILITY); tuned error handling;
10131 * HOL: cases and induct rules now provide explicit hints about the
10132 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10133 any remaining facts are inserted into the goal verbatim;
10135 * HOL: local contexts (aka cases) may now contain term bindings as
10136 well; the 'cases' and 'induct' methods new provide a ?case binding for
10137 the result to be shown in each case;
10139 * HOL: added 'recdef_tc' command;
10141 * isatool convert assists in eliminating legacy ML scripts;
10146 * HOL/Library: a collection of generic theories to be used together
10147 with main HOL; the theory loader path already includes this directory
10148 by default; the following existing theories have been moved here:
10149 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10150 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10152 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10153 modelling and verification task performed in Isabelle/HOL +
10154 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10156 * HOL/Algebra: special summation operator SUM no longer exists, it has
10157 been replaced by setsum; infix 'assoc' now has priority 50 (like
10158 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10159 'domain', this makes the theory consistent with mathematical
10162 * HOL basics: added overloaded operations "inverse" and "divide"
10163 (infix "/"), syntax for generic "abs" operation, generic summation
10166 * HOL/typedef: simplified package, provide more useful rules (see also
10169 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10170 now expressed as a proper nested rule (old-style tactic scripts may
10171 require atomize_strip_tac to cope with non-atomic premises);
10173 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10174 to "split_conv" (old name still available for compatibility);
10176 * HOL: improved concrete syntax for strings (e.g. allows translation
10177 rules with string literals);
10179 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10180 and Fleuriot's mechanization of analysis, including the transcendental
10181 functions for the reals;
10183 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10188 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10189 "lam" is displayed as TWO lambda-symbols
10191 * CTT: theory Main now available, containing everything (that is, Bool
10197 * Pure: the Simplifier has been implemented properly as a derived rule
10198 outside of the actual kernel (at last!); the overall performance
10199 penalty in practical applications is about 50%, while reliability of
10200 the Isabelle inference kernel has been greatly improved;
10202 * print modes "brackets" and "no_brackets" control output of nested =>
10203 (types) and ==> (props); the default behaviour is "brackets";
10205 * Provers: fast_tac (and friends) now handle actual object-logic rules
10206 as assumptions as well;
10208 * system: support Poly/ML 4.0;
10210 * system: isatool install handles KDE version 1 or 2;
10214 New in Isabelle99-1 (October 2000)
10215 ----------------------------------
10217 *** Overview of INCOMPATIBILITIES ***
10219 * HOL: simplification of natural numbers is much changed; to partly
10220 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10221 issue the following ML commands:
10223 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10224 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10226 * HOL: simplification no longer dives into case-expressions; this is
10227 controlled by "t.weak_case_cong" for each datatype t;
10229 * HOL: nat_less_induct renamed to less_induct;
10231 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10232 fixsome to patch .thy and .ML sources automatically;
10234 select_equality -> some_equality
10235 select_eq_Ex -> some_eq_ex
10236 selectI2EX -> someI2_ex
10239 select1_equality -> some1_equality
10240 Eps_sym_eq -> some_sym_eq_trivial
10241 Eps_eq -> some_eq_trivial
10243 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10245 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10248 * HOL: the recursion equations generated by 'recdef' are now called
10249 f.simps instead of f.rules;
10251 * HOL: qed_spec_mp now also handles bounded ALL as well;
10253 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10254 sometimes be needed;
10256 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10258 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10260 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10261 product is now "<*>" instead of "Times"; the lexicographic product is
10262 now "<*lex*>" instead of "**";
10264 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10265 of main HOL, but was unused); better use HOL's datatype package;
10267 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10268 the old syntax may be recovered as follows:
10271 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10272 (infixl "\\<oplus>" 100)
10274 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10276 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10277 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10280 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10281 changed from A/r to A//r;
10283 * ZF: new treatment of arithmetic (nat & int) may break some old
10286 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10287 rulify -> rule_format, elimify -> elim_format, ...);
10289 * Isar/Provers: intro/elim/dest attributes changed; renamed
10290 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10291 should have to change intro!! to intro? only); replaced "delrule" by
10294 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10296 * Provers: strengthened force_tac by using new first_best_tac;
10298 * LaTeX document preparation: several changes of isabelle.sty (see
10302 *** Document preparation ***
10304 * formal comments (text blocks etc.) in new-style theories may now
10305 contain antiquotations of thm/prop/term/typ/text to be presented
10306 according to latex print mode; concrete syntax is like this:
10307 @{term[show_types] "f(x) = a + x"};
10309 * isatool mkdir provides easy setup of Isabelle session directories,
10310 including proper document sources;
10312 * generated LaTeX sources are now deleted after successful run
10313 (isatool document -c); may retain a copy somewhere else via -D option
10316 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10317 style files, achieving self-contained LaTeX sources and simplifying
10320 * old-style theories now produce (crude) LaTeX output as well;
10322 * browser info session directories are now self-contained (may be put
10323 on WWW server seperately); improved graphs of nested sessions; removed
10324 graph for 'all sessions';
10326 * several improvements in isabelle style files; \isabellestyle{it}
10327 produces fake math mode output; \isamarkupheader is now \section by
10328 default; see lib/texinputs/isabelle.sty etc.;
10333 * Isar/Pure: local results and corresponding term bindings are now
10334 subject to Hindley-Milner polymorphism (similar to ML); this
10335 accommodates incremental type-inference very nicely;
10337 * Isar/Pure: new derived language element 'obtain' supports
10338 generalized existence reasoning;
10340 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10341 support accumulation of results, without applying any rules yet;
10342 useful to collect intermediate results without explicit name
10343 references, and for use with transitivity rules with more than 2
10346 * Isar/Pure: scalable support for case-analysis type proofs: new
10347 'case' language element refers to local contexts symbolically, as
10348 produced by certain proof methods; internally, case names are attached
10349 to theorems as "tags";
10351 * Isar/Pure: theory command 'hide' removes declarations from
10352 class/type/const name spaces;
10354 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10355 indicate potential overloading;
10357 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10359 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10360 "{a,b,c}" instead of {a,b,c};
10362 * Isar/Pure now provides its own version of intro/elim/dest
10363 attributes; useful for building new logics, but beware of confusion
10364 with the version in Provers/classical;
10366 * Isar/Pure: the local context of (non-atomic) goals is provided via
10367 case name 'antecedent';
10369 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10370 to the current context is now done automatically);
10372 * Isar/Pure: theory command 'method_setup' provides a simple interface
10373 for definining proof methods in ML;
10375 * Isar/Provers: intro/elim/dest attributes changed; renamed
10376 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10377 most cases, one should have to change intro!! to intro? only);
10378 replaced "delrule" by "rule del";
10380 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10381 'symmetric' attribute (the latter supercedes [RS sym]);
10383 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10384 method modifier); 'simp' method: 'only:' modifier removes loopers as
10385 well (including splits);
10387 * Isar/Provers: Simplifier and Classical methods now support all kind
10388 of modifiers used in the past, including 'cong', 'iff', etc.
10390 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10391 of Simplifier and Classical reasoner);
10393 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10394 now support named cases; major packages (inductive, datatype, primrec,
10395 recdef) support case names and properly name parameters;
10397 * Isar/HOL: new transitivity rules for substitution in inequalities --
10398 monotonicity conditions are extracted to be proven at end of
10401 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10404 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10405 split_if split_if_asm; datatype package provides theorems foo.splits =
10406 foo.split foo.split_asm for each datatype;
10408 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10409 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10410 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10411 use "(cases (simplified))" method in proper proof texts);
10413 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10415 * Isar: names of theorems etc. may be natural numbers as well;
10417 * Isar: 'pr' command: optional arguments for goals_limit and
10418 ProofContext.prems_limit; no longer prints theory contexts, but only
10421 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10422 additional print modes to be specified; e.g. "pr(latex)" will print
10423 proof state according to the Isabelle LaTeX style;
10425 * Isar: improved support for emulating tactic scripts, including proof
10426 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10427 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10428 (for HOL datatypes);
10430 * Isar: simplified (more robust) goal selection of proof methods: 1st
10431 goal, all goals, or explicit goal specifier (tactic emulation); thus
10432 'proof method scripts' have to be in depth-first order;
10434 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10436 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10437 should instead use individual commands for printing items
10438 (print_commands, print_methods etc.);
10440 * Isar: added 'nothing' --- the empty list of theorems;
10445 * HOL/MicroJava: formalization of a fragment of Java, together with a
10446 corresponding virtual machine and a specification of its bytecode
10447 verifier and a lightweight bytecode verifier, including proofs of
10448 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10449 Cornelia Pusch (see also the homepage of project Bali at
10450 http://isabelle.in.tum.de/Bali/);
10452 * HOL/Algebra: new theory of rings and univariate polynomials, by
10455 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10456 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10459 * HOL/Lattice: fundamental concepts of lattice theory and order
10460 structures, including duals, properties of bounds versus algebraic
10461 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10462 Theorem for complete lattices etc.; may also serve as a demonstration
10463 for abstract algebraic reasoning using axiomatic type classes, and
10464 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10466 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10469 * HOL/IMPP: extension of IMP with local variables and mutually
10470 recursive procedures, by David von Oheimb;
10472 * HOL/Lambda: converted into new-style theory and document;
10474 * HOL/ex/Multiquote: example of multiple nested quotations and
10475 anti-quotations -- basically a generalized version of de-Bruijn
10476 representation; very useful in avoiding lifting of operations;
10478 * HOL/record: added general record equality rule to simpset; fixed
10479 select-update simplification procedure to handle extended records as
10480 well; admit "r" as field name;
10482 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10483 other numeric types and also as the identity of groups, rings, etc.;
10485 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10486 Types nat and int belong to this axclass;
10488 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10489 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10490 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10491 two terms #m*u and #n*u are replaced by #(m+n)*u
10492 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10493 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10494 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10496 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10497 powerful prover for predicate logic but knows nothing of clasets; see
10498 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10500 * HOL: new version of "case_tac" subsumes both boolean case split and
10501 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10502 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10504 * HOL: simplification no longer dives into case-expressions: only the
10505 selector expression is simplified, but not the remaining arms; to
10506 enable full simplification of case-expressions for datatype t, you may
10507 remove t.weak_case_cong from the simpset, either globally (Delcongs
10508 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10510 * HOL/recdef: the recursion equations generated by 'recdef' for
10511 function 'f' are now called f.simps instead of f.rules; if all
10512 termination conditions are proved automatically, these simplification
10513 rules are added to the simpset, as in primrec; rules may be named
10514 individually as well, resulting in a separate list of theorems for
10517 * HOL/While is a new theory that provides a while-combinator. It
10518 permits the definition of tail-recursive functions without the
10519 provision of a termination measure. The latter is necessary once the
10520 invariant proof rule for while is applied.
10522 * HOL: new (overloaded) notation for the set of elements below/above
10523 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10525 * HOL: theorems impI, allI, ballI bound as "strip";
10527 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10528 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10529 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10531 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10533 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10534 main HOL, but was unused);
10536 * HOL: fewer consts declared as global (e.g. have to refer to
10537 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10539 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10540 in case of overlap with user translations (e.g. judgements over
10541 tuples); (note that the underlying logical represenation is still
10547 * ZF: simplification automatically cancels common terms in arithmetic
10548 expressions over nat and int;
10550 * ZF: new treatment of nat to minimize type-checking: all operators
10551 coerce their operands to a natural number using the function natify,
10552 making the algebraic laws unconditional;
10554 * ZF: as above, for int: operators coerce their operands to an integer
10555 using the function intify;
10557 * ZF: the integer library now contains many of the usual laws for the
10558 orderings, including $<=, and monotonicity laws for $+ and $*;
10560 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10563 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10564 to the simplifier and classical reasoner simultaneously;
10569 * Provers: blast_tac now handles actual object-logic rules as
10570 assumptions; note that auto_tac uses blast_tac internally as well;
10572 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10573 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10575 * Provers: delrules now handles destruct rules as well (no longer need
10576 explicit make_elim);
10578 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10579 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10580 use instead the strong form,
10581 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10582 in HOL, FOL and ZF the function cla_make_elim will create such rules
10583 from destruct-rules;
10585 * Provers: Simplifier.easy_setup provides a fast path to basic
10586 Simplifier setup for new object-logics;
10588 * Pure: AST translation rules no longer require constant head on LHS;
10590 * Pure: improved name spaces: ambiguous output is qualified; support
10591 for hiding of names;
10593 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10594 XSYMBOL_HOME; no longer need to do manual configuration in most
10597 * system: compression of ML heaps images may now be controlled via -c
10598 option of isabelle and isatool usedir (currently only observed by
10601 * system: isatool installfonts may handle X-Symbol fonts as well (very
10602 useful for remote X11);
10604 * system: provide TAGS file for Isabelle sources;
10606 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10609 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10610 timing flag supersedes proof_timing and Toplevel.trace;
10612 * ML: new combinators |>> and |>>> for incremental transformations
10613 with secondary results (e.g. certain theory extensions):
10615 * ML: PureThy.add_defs gets additional argument to indicate potential
10616 overloading (usually false);
10618 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10623 New in Isabelle99 (October 1999)
10624 --------------------------------
10626 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10628 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10629 are no longer simplified. (This allows the simplifier to unfold recursive
10630 functional programs.) To restore the old behaviour, declare
10632 Delcongs [if_weak_cong];
10634 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10637 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10639 * HOL/datatype: mutual_induct_tac no longer exists --
10640 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10642 * HOL/typedef: fixed type inference for representing set; type
10643 arguments now have to occur explicitly on the rhs as type constraints;
10645 * ZF: The con_defs part of an inductive definition may no longer refer
10646 to constants declared in the same theory;
10648 * HOL, ZF: the function mk_cases, generated by the inductive
10649 definition package, has lost an argument. To simplify its result, it
10650 uses the default simpset instead of a supplied list of theorems.
10652 * HOL/List: the constructors of type list are now Nil and Cons;
10654 * Simplifier: the type of the infix ML functions
10655 setSSolver addSSolver setSolver addSolver
10656 is now simpset * solver -> simpset where `solver' is a new abstract type
10657 for packaging solvers. A solver is created via
10658 mk_solver: string -> (thm list -> int -> tactic) -> solver
10659 where the string argument is only a comment.
10662 *** Proof tools ***
10664 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10665 decision procedure for linear arithmetic. Currently it is used for
10666 types `nat', `int', and `real' in HOL (see below); it can, should and
10667 will be instantiated for other types and logics as well.
10669 * The simplifier now accepts rewrite rules with flexible heads, eg
10670 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10671 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10677 * New Isabelle/Isar subsystem provides an alternative to traditional
10678 tactical theorem proving; together with the ProofGeneral/isar user
10679 interface it offers an interactive environment for developing human
10680 readable proof documents (Isar == Intelligible semi-automated
10681 reasoning); for further information see isatool doc isar-ref,
10682 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10684 * improved and simplified presentation of theories: better HTML markup
10685 (including colors), graph views in several sizes; isatool usedir now
10686 provides a proper interface for user theories (via -P option); actual
10687 document preparation based on (PDF)LaTeX is available as well (for
10688 new-style theories only); see isatool doc system for more information;
10690 * native support for Proof General, both for classic Isabelle and
10693 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10694 using the graph browser tool;
10696 * Isabelle manuals now also available as PDF;
10698 * theory loader rewritten from scratch (may not be fully
10699 bug-compatible); old loadpath variable has been replaced by show_path,
10700 add_path, del_path, reset_path functions; new operations such as
10701 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10704 * improved isatool install: option -k creates KDE application icon,
10705 option -p DIR installs standalone binaries;
10707 * added ML_PLATFORM setting (useful for cross-platform installations);
10708 more robust handling of platform specific ML images for SML/NJ;
10710 * the settings environment is now statically scoped, i.e. it is never
10711 created again in sub-processes invoked from isabelle, isatool, or
10714 * path element specification '~~' refers to '$ISABELLE_HOME';
10716 * in locales, the "assumes" and "defines" parts may be omitted if
10719 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10722 * new print_mode "HTML";
10724 * new flag show_tags controls display of tags of theorems (which are
10725 basically just comments that may be attached by some tools);
10727 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10728 mode and goal output format:
10730 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10732 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10734 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10735 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10737 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10739 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10741 * function bind_thms stores lists of theorems (cf. bind_thm);
10743 * new shorthand tactics ftac, eatac, datac, fatac;
10745 * qed (and friends) now accept "" as result name; in that case the
10746 theorem is not stored, but proper checks and presentation of the
10747 result still apply;
10749 * theorem database now also indexes constants "Trueprop", "all",
10750 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10755 ** HOL arithmetic **
10757 * There are now decision procedures for linear arithmetic over nat and
10760 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10761 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10762 are treated as atomic; subformulae not involving type `nat' or `int'
10763 are ignored; quantified subformulae are ignored unless they are
10764 positive universal or negative existential. The tactic has to be
10765 invoked by hand and can be a little bit slow. In particular, the
10766 running time is exponential in the number of occurrences of `min' and
10767 `max', and `-' on `nat'.
10769 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10770 (negated) (in)equalities among the premises and the conclusion into
10771 account (i.e. no compound formulae) and does not know about `min' and
10772 `max', and `-' on `nat'. It is fast and is used automatically by the
10775 NB: At the moment, these decision procedures do not cope with mixed
10776 nat/int formulae where the two parts interact, such as `m < n ==>
10779 * HOL/Numeral provides a generic theory of numerals (encoded
10780 efficiently as bit strings); setup for types nat/int/real is in place;
10781 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10782 int, existing theories and proof scripts may require a few additional
10785 * integer division and remainder can now be performed on constant
10788 * many properties of integer multiplication, division and remainder
10791 * An interface to the Stanford Validity Checker (SVC) is available through the
10792 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10793 are proved automatically. SVC must be installed separately, and its results
10794 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10795 invocation of the underlying oracle). For SVC see
10796 http://verify.stanford.edu/SVC
10798 * IsaMakefile: the HOL-Real target now builds an actual image;
10803 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10804 (in Isabelle/Isar) -- by Gertrud Bauer;
10806 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10807 analysis for assembly languages with subtypes;
10809 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10810 -- avoids syntactic ambiguities and treats state, transition, and
10811 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10812 changed syntax and (many) tactics;
10814 * HOL/inductive: Now also handles more general introduction rules such
10815 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10816 theorems are now maintained within the theory (maintained via the
10819 * HOL/datatype: Now also handles arbitrarily branching datatypes
10820 (using function types) such as
10822 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10824 * HOL/record: record_simproc (part of the default simpset) takes care
10825 of selectors applied to updated records; record_split_tac is no longer
10826 part of the default claset; update_defs may now be removed from the
10827 simpset in many cases; COMPATIBILITY: old behavior achieved by
10829 claset_ref () := claset() addSWrapper record_split_wrapper;
10830 Delsimprocs [record_simproc]
10832 * HOL/typedef: fixed type inference for representing set; type
10833 arguments now have to occur explicitly on the rhs as type constraints;
10835 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10836 names rather than an ML expression;
10838 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10839 supplied later. Program schemes can be defined, such as
10840 "While B C s = (if B s then While B C (C s) else s)"
10841 where the well-founded relation can be chosen after B and C have been given.
10843 * HOL/List: the constructors of type list are now Nil and Cons;
10844 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10845 course, ML tools referring to List.list.op # etc. have to be adapted;
10847 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10848 disabled by default; run isabelle with option -m HOL to get back to
10849 the original Gordon/HOL-style output;
10851 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10852 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10854 * HOL basic syntax simplified (more orthogonal): all variants of
10855 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10856 Eps operator is provided as well: "SOME x. P[x]";
10858 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10860 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10861 thus available for user theories;
10863 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10864 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10867 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10868 several times and then mp;
10873 * the notation <<...>> is now available as a notation for sequences of
10876 * the simplifier is now installed
10878 * the axiom system has been generalized (thanks to Soren Heilmann)
10880 * the classical reasoner now has a default rule database
10885 * new primrec section allows primitive recursive functions to be given
10886 directly (as in HOL) over datatypes and the natural numbers;
10888 * new tactics induct_tac and exhaust_tac for induction (or case
10889 analysis) over datatypes and the natural numbers;
10891 * the datatype declaration of type T now defines the recursor T_rec;
10893 * simplification automatically does freeness reasoning for datatype
10896 * automatic type-inference, with AddTCs command to insert new
10897 type-checking rules;
10899 * datatype introduction rules are now added as Safe Introduction rules
10902 * the syntax "if P then x else y" is now available in addition to
10906 *** Internal programming interfaces ***
10908 * tuned simplifier trace output; new flag debug_simp;
10910 * structures Vartab / Termtab (instances of TableFun) offer efficient
10911 tables indexed by indexname_ord / term_ord (compatible with aconv);
10913 * AxClass.axclass_tac lost the theory argument;
10915 * tuned current_goals_markers semantics: begin / end goal avoids
10916 printing empty lines;
10918 * removed prs and prs_fn hook, which was broken because it did not
10919 include \n in its semantics, forcing writeln to add one
10920 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10921 string -> unit if you really want to output text without newline;
10923 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10924 plain output, interface builders may have to enable 'isabelle_font'
10925 mode to get Isabelle font glyphs as before;
10927 * refined token_translation interface; INCOMPATIBILITY: output length
10928 now of type real instead of int;
10930 * theory loader actions may be traced via new ThyInfo.add_hook
10931 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10932 your own database of information attached to *whole* theories -- as
10933 opposed to intra-theory data slots offered via TheoryDataFun;
10935 * proper handling of dangling sort hypotheses (at last!);
10936 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10937 extra sort hypotheses that can be witnessed from the type signature;
10938 the force_strip_shyps flag is gone, any remaining shyps are simply
10939 left in the theorem (with a warning issued by strip_shyps_warning);
10943 New in Isabelle98-1 (October 1998)
10944 ----------------------------------
10946 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10948 * several changes of automated proof tools;
10950 * HOL: major changes to the inductive and datatype packages, including
10951 some minor incompatibilities of theory syntax;
10953 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10956 * HOL: removed duplicate thms in Arith:
10957 less_imp_add_less should be replaced by trans_less_add1
10958 le_imp_add_le should be replaced by trans_le_add1
10960 * HOL: unary minus is now overloaded (new type constraints may be
10963 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10964 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10965 now taken as an integer constant.
10967 * Pure: ML function 'theory_of' renamed to 'theory';
10970 *** Proof tools ***
10973 1. Asm_full_simp_tac is now more aggressive.
10974 1. It will sometimes reorient premises if that increases their power to
10976 2. It does no longer proceed strictly from left to right but may also
10977 rotate premises to achieve further simplification.
10978 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10979 old Asm_full_simp_tac in that it does not rotate premises.
10980 2. The simplifier now knows a little bit about nat-arithmetic.
10982 * Classical reasoner: wrapper mechanism for the classical reasoner now
10983 allows for selected deletion of wrappers, by introduction of names for
10984 wrapper functionals. This implies that addbefore, addSbefore,
10985 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10986 and that adding two tactics with the same name overwrites the first
10987 one (emitting a warning).
10988 type wrapper = (int -> tactic) -> (int -> tactic)
10989 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10990 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10991 delWrapper, delSWrapper: claset * string -> claset
10992 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10994 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10995 semantics; addbefore now affects only the unsafe part of step_tac
10996 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10997 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
11000 * Classical reasoner: setwrapper to setWrapper and compwrapper to
11001 compWrapper; added safe wrapper (and access functions for it);
11003 * HOL/split_all_tac is now much faster and fails if there is nothing
11004 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
11005 and the names of the automatically generated variables have changed.
11006 split_all_tac has moved within claset() from unsafe wrappers to safe
11007 wrappers, which means that !!-bound variables are split much more
11008 aggressively, and safe_tac and clarify_tac now split such variables.
11009 If this splitting is not appropriate, use delSWrapper "split_all_tac".
11010 Note: the same holds for record_split_tac, which does the job of
11011 split_all_tac for record fields.
11013 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
11014 permanently to the default simpset using Addsplits just like
11015 Addsimps. They can be removed via Delsplits just like
11016 Delsimps. Lower-case versions are also available.
11018 * HOL/Simplifier: The rule split_if is now part of the default
11019 simpset. This means that the simplifier will eliminate all occurrences
11020 of if-then-else in the conclusion of a goal. To prevent this, you can
11021 either remove split_if completely from the default simpset by
11022 `Delsplits [split_if]' or remove it in a specific call of the
11023 simplifier using `... delsplits [split_if]'. You can also add/delete
11024 other case splitting rules to/from the default simpset: every datatype
11025 generates suitable rules `split_t_case' and `split_t_case_asm' (where
11026 t is the name of the datatype).
11028 * Classical reasoner / Simplifier combination: new force_tac (and
11029 derivatives Force_tac, force) combines rewriting and classical
11030 reasoning (and whatever other tools) similarly to auto_tac, but is
11031 aimed to solve the given subgoal completely.
11036 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11037 and `goalw': the theory is no longer needed as an explicit argument -
11038 the current theory context is used; assumptions are no longer returned
11039 at the ML-level unless one of them starts with ==> or !!; it is
11040 recommended to convert to these new commands using isatool fixgoal
11041 (backup your sources first!);
11043 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11044 the current theory context, and 'theory' to lookup stored theories;
11046 * new theory section 'locale' for declaring constants, assumptions and
11047 definitions that have local scope;
11049 * new theory section 'nonterminals' for purely syntactic types;
11051 * new theory section 'setup' for generic ML setup functions
11052 (e.g. package initialization);
11054 * the distribution now includes Isabelle icons: see
11055 lib/logo/isabelle-{small,tiny}.xpm;
11057 * isatool install - install binaries with absolute references to
11060 * isatool logo -- create instances of the Isabelle logo (as EPS);
11062 * print mode 'emacs' reserved for Isamode;
11064 * support multiple print (ast) translations per constant name;
11066 * theorems involving oracles are now printed with a suffixed [!];
11071 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11073 * HOL/inductive package reorganized and improved: now supports mutual
11074 definitions such as
11079 oddI "n : EVEN ==> Suc n : ODD"
11080 evenI "n : ODD ==> Suc n : EVEN"
11082 new theorem list "elims" contains an elimination rule for each of the
11083 recursive sets; inductive definitions now handle disjunctive premises
11084 correctly (also ZF);
11086 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11087 "mutual_induct" no longer exists - the induction rule is always
11088 contained in "induct";
11091 * HOL/datatype package re-implemented and greatly improved: now
11092 supports mutually recursive datatypes such as
11095 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11096 | SUM ('a aexp) ('a aexp)
11097 | DIFF ('a aexp) ('a aexp)
11100 'a bexp = LESS ('a aexp) ('a aexp)
11101 | AND ('a bexp) ('a bexp)
11102 | OR ('a bexp) ('a bexp)
11104 as well as indirectly recursive datatypes such as
11107 ('a, 'b) term = Var 'a
11108 | App 'b ((('a, 'b) term) list)
11110 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11111 induction on mutually / indirectly recursive datatypes.
11113 Primrec equations are now stored in theory and can be accessed via
11114 <function_name>.simps.
11118 - Theories using datatypes must now have theory Datatype as an
11120 - The specific <typename>.induct_tac no longer exists - use the
11121 generic induct_tac instead.
11122 - natE has been renamed to nat.exhaust - use exhaust_tac
11123 instead of res_inst_tac ... natE. Note that the variable
11124 names in nat.exhaust differ from the names in natE, this
11125 may cause some "fragile" proofs to fail.
11126 - The theorems split_<typename>_case and split_<typename>_case_asm
11127 have been renamed to <typename>.split and <typename>.split_asm.
11128 - Since default sorts of type variables are now handled correctly,
11129 some datatype definitions may have to be annotated with explicit
11131 - Primrec definitions no longer require function name and type
11132 of recursive argument.
11134 Consider using isatool fixdatatype to adapt your theories and proof
11135 scripts to the new package (backup your sources first!).
11138 * HOL/record package: considerably improved implementation; now
11139 includes concrete syntax for record types, terms, updates; theorems
11140 for surjective pairing and splitting !!-bound record variables; proof
11141 support is as follows:
11143 1) standard conversions (selectors or updates applied to record
11144 constructor terms) are part of the standard simpset;
11146 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11147 made part of standard simpset and claset via addIffs;
11149 3) a tactic for record field splitting (record_split_tac) is part of
11150 the standard claset (addSWrapper);
11152 To get a better idea about these rules you may retrieve them via
11153 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11154 the name of your record type.
11156 The split tactic 3) conceptually simplifies by the following rule:
11158 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11160 Thus any record variable that is bound by meta-all will automatically
11161 blow up into some record constructor term, consequently the
11162 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11163 solve record problems automatically.
11166 * reorganized the main HOL image: HOL/Integ and String loaded by
11167 default; theory Main includes everything;
11169 * automatic simplification of integer sums and comparisons, using cancellation;
11171 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11173 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11175 * many new identities for unions, intersections, set difference, etc.;
11177 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11178 called split_if, split_split, split_sum_case and split_nat_case (to go
11179 with add/delsplits);
11181 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11182 (?x::unit) = (); this is made part of the default simpset, which COULD
11183 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11184 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11185 unit_abs_eta_conv is added in order to counter the effect of
11186 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11189 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11192 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11193 It and 'sym RS equals0D' are now in the default claset, giving automatic
11194 disjointness reasoning but breaking a few old proofs.
11196 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11197 to 'converse' from 'inverse' (for compatibility with ZF and some
11200 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11201 the well-founded relation;
11203 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11204 Compl A. The "Compl" syntax remains available as input syntax for this
11207 * HOL/Update: new theory of function updates:
11208 f(a:=b) == %x. if x=a then b else f x
11209 may also be iterated as in f(a:=b,c:=d,...);
11211 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11214 - new function list_update written xs[i:=v] that updates the i-th
11215 list position. May also be iterated as in xs[i:=a,j:=b,...].
11216 - new function `upt' written [i..j(] which generates the list
11217 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11218 bound write [i..j], which is a shorthand for [i..j+1(].
11219 - new lexicographic orderings and corresponding wellfoundedness theorems.
11222 - removed 'pred' (predecessor) function;
11223 - generalized some theorems about n-1;
11224 - many new laws about "div" and "mod";
11225 - new laws about greatest common divisors (see theory ex/Primes);
11227 * HOL/Relation: renamed the relational operator r^-1 "converse"
11228 instead of "inverse";
11230 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11231 of the multiset ordering;
11233 * directory HOL/Real: a construction of the reals using Dedekind cuts
11234 (not included by default);
11236 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11238 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11239 programs, i.e. different program variables may have different types.
11241 * calling (stac rew i) now fails if "rew" has no effect on the goal
11242 [previously, this check worked only if the rewrite rule was unconditional]
11243 Now rew can involve either definitions or equalities (either == or =).
11248 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11249 only the theorems proved on ZF.ML;
11251 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11252 It and 'sym RS equals0D' are now in the default claset, giving automatic
11253 disjointness reasoning but breaking a few old proofs.
11255 * ZF/Update: new theory of function updates
11256 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11257 may also be iterated as in f(a:=b,c:=d,...);
11259 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11261 * calling (stac rew i) now fails if "rew" has no effect on the goal
11262 [previously, this check worked only if the rewrite rule was unconditional]
11263 Now rew can involve either definitions or equalities (either == or =).
11265 * case_tac provided for compatibility with HOL
11266 (like the old excluded_middle_tac, but with subgoals swapped)
11269 *** Internal programming interfaces ***
11271 * Pure: several new basic modules made available for general use, see
11272 also src/Pure/README;
11274 * improved the theory data mechanism to support encapsulation (data
11275 kind name replaced by private Object.kind, acting as authorization
11276 key); new type-safe user interface via functor TheoryDataFun; generic
11277 print_data function becomes basically useless;
11279 * removed global_names compatibility flag -- all theory declarations
11280 are qualified by default;
11282 * module Pure/Syntax now offers quote / antiquote translation
11283 functions (useful for Hoare logic etc. with implicit dependencies);
11284 see HOL/ex/Antiquote for an example use;
11286 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11289 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11292 * Display.print_goals function moved to Locale.print_goals;
11294 * standard print function for goals supports current_goals_markers
11295 variable for marking begin of proof, end of proof, start of goal; the
11296 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11297 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11302 New in Isabelle98 (January 1998)
11303 --------------------------------
11305 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11307 * changed lexical syntax of terms / types: dots made part of long
11308 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11310 * simpset (and claset) reference variable replaced by functions
11311 simpset / simpset_ref;
11313 * no longer supports theory aliases (via merge) and non-trivial
11314 implicit merge of thms' signatures;
11316 * most internal names of constants changed due to qualified names;
11318 * changed Pure/Sequence interface (see Pure/seq.ML);
11321 *** General Changes ***
11323 * hierachically structured name spaces (for consts, types, axms, thms
11324 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11325 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11326 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11327 long_names for fully qualified output names; NOTE: ML programs
11328 (special tactics, packages etc.) referring to internal names may have
11329 to be adapted to cope with fully qualified names; in case of severe
11330 backward campatibility problems try setting 'global_names' at compile
11331 time to have enrything declared within a flat name space; one may also
11332 fine tune name declarations in theories via the 'global' and 'local'
11335 * reimplemented the implicit simpset and claset using the new anytype
11336 data filed in signatures; references simpset:simpset ref etc. are
11337 replaced by functions simpset:unit->simpset and
11338 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11339 to patch your ML files accordingly;
11341 * HTML output now includes theory graph data for display with Java
11342 applet or isatool browser; data generated automatically via isatool
11343 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11345 * defs may now be conditional; improved rewrite_goals_tac to handle
11346 conditional equations;
11348 * defs now admits additional type arguments, using TYPE('a) syntax;
11350 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11351 creates a new theory node; implicit merge of thms' signatures is
11352 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11353 transfer:theory->thm->thm in (rare) cases;
11355 * improved handling of draft signatures / theories; draft thms (and
11356 ctyps, cterms) are automatically promoted to real ones;
11358 * slightly changed interfaces for oracles: admit many per theory, named
11359 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11361 * print_goals: optional output of const types (set show_consts and
11364 * improved output of warnings (###) and errors (***);
11366 * subgoal_tac displays a warning if the new subgoal has type variables;
11368 * removed old README and Makefiles;
11370 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11372 * removed obsolete init_pps and init_database;
11374 * deleted the obsolete tactical STATE, which was declared by
11375 fun STATE tacfun st = tacfun st st;
11377 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11378 (which abbreviates $HOME);
11380 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11381 use isatool fixseq to adapt your ML programs (this works for fully
11382 qualified references to the Sequence structure only!);
11384 * use_thy no longer requires writable current directory; it always
11385 reloads .ML *and* .thy file, if either one is out of date;
11388 *** Classical Reasoner ***
11390 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11391 tactics that use classical reasoning to simplify a subgoal without
11392 splitting it into several subgoals;
11394 * Safe_tac: like safe_tac but uses the default claset;
11399 * added simplification meta rules:
11400 (asm_)(full_)simplify: simpset -> thm -> thm;
11402 * simplifier.ML no longer part of Pure -- has to be loaded by object
11405 * added prems argument to simplification procedures;
11407 * HOL, FOL, ZF: added infix function `addsplits':
11408 instead of `<simpset> setloop (split_tac <thms>)'
11409 you can simply write `<simpset> addsplits <thms>'
11414 * TYPE('a) syntax for type reflection terms;
11416 * no longer handles consts with name "" -- declare as 'syntax' instead;
11418 * pretty printer: changed order of mixfix annotation preference (again!);
11420 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11425 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11426 with `addloop' of the simplifier to faciliate case splitting in premises.
11428 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11430 * HOL/Auth: new protocol proofs including some for the Internet
11433 * HOL/Map: new theory of `maps' a la VDM;
11435 * HOL/simplifier: simplification procedures nat_cancel_sums for
11436 cancelling out common nat summands from =, <, <= (in)equalities, or
11437 differences; simplification procedures nat_cancel_factor for
11438 cancelling common factor from =, <, <= (in)equalities over natural
11439 sums; nat_cancel contains both kinds of procedures, it is installed by
11440 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11442 * HOL/simplifier: terms of the form
11443 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11445 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11446 and those of the form
11447 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11449 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11452 Each datatype `t' now comes with a theorem `split_t_case' of the form
11454 P(t_case f1 ... fn x) =
11455 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11457 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11460 and a theorem `split_t_case_asm' of the form
11462 P(t_case f1 ... fn x) =
11463 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11465 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11467 which can be added to a simpset via `addsplits'. The existing theorems
11468 expand_list_case and expand_option_case have been renamed to
11469 split_list_case and split_option_case.
11472 - `pred n' is automatically converted to `n-1'.
11473 Users are strongly encouraged not to use `pred' any longer,
11474 because it will disappear altogether at some point.
11475 - Users are strongly encouraged to write "0 < n" rather than
11476 "n ~= 0". Theorems and proof tools have been modified towards this
11480 the function "set_of_list" has been renamed "set" (and its theorems too);
11481 the function "nth" now takes its arguments in the reverse order and
11482 has acquired the infix notation "!" as in "xs!n".
11484 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11486 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11487 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11489 * HOL/record: extensible records with schematic structural subtyping
11490 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11491 still lacks various theorems and concrete record syntax;
11496 * removed "axioms" and "generated by" sections;
11498 * replaced "ops" section by extended "consts" section, which is capable of
11499 handling the continuous function space "->" directly;
11502 . proves theorems immediately and stores them in the theory,
11503 . creates hierachical name space,
11504 . now uses normal mixfix annotations (instead of cinfix...),
11505 . minor changes to some names and values (for consistency),
11506 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11507 . separator between mutual domain defs: changed "," to "and",
11508 . improved handling of sort constraints; now they have to
11509 appear on the left-hand side of the equations only;
11511 * fixed LAM <x,y,zs>.b syntax;
11513 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11514 adm (%x. P (t x)), where P is chainfinite and t continuous;
11519 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11520 with `addloop' of the simplifier to faciliate case splitting in premises.
11522 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11523 in HOL, they strip ALL and --> from proved theorems;
11527 New in Isabelle94-8 (May 1997)
11528 ------------------------------
11530 *** General Changes ***
11532 * new utilities to build / run / maintain Isabelle etc. (in parts
11533 still somewhat experimental); old Makefiles etc. still functional;
11535 * new 'Isabelle System Manual';
11537 * INSTALL text, together with ./configure and ./build scripts;
11539 * reimplemented type inference for greater efficiency, better error
11540 messages and clean internal interface;
11542 * prlim command for dealing with lots of subgoals (an easier way of
11543 setting goals_limit);
11548 * supports alternative (named) syntax tables (parser and pretty
11549 printer); internal interface is provided by add_modesyntax(_i);
11551 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11552 be used in conjunction with the Isabelle symbol font; uses the
11553 "symbols" syntax table;
11555 * added token_translation interface (may translate name tokens in
11556 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11557 the current print_mode); IMPORTANT: user print translation functions
11558 are responsible for marking newly introduced bounds
11559 (Syntax.mark_boundT);
11561 * token translations for modes "xterm" and "xterm_color" that display
11562 names in bold, underline etc. or colors (which requires a color
11565 * infixes may now be declared with names independent of their syntax;
11567 * added typed_print_translation (like print_translation, but may
11568 access type of constant);
11571 *** Classical Reasoner ***
11573 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11574 some limitations. Blast_tac...
11575 + ignores addss, addbefore, addafter; this restriction is intrinsic
11576 + ignores elimination rules that don't have the correct format
11577 (the conclusion MUST be a formula variable)
11578 + ignores types, which can make HOL proofs fail
11579 + rules must not require higher-order unification, e.g. apply_type in ZF
11580 [message "Function Var's argument not a bound variable" relates to this]
11581 + its proof strategy is more general but can actually be slower
11583 * substitution with equality assumptions no longer permutes other
11586 * minor changes in semantics of addafter (now called addaltern); renamed
11587 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11588 (and access functions for it);
11590 * improved combination of classical reasoner and simplifier:
11591 + functions for handling clasimpsets
11592 + improvement of addss: now the simplifier is called _after_ the
11594 + safe variant of addss called addSss: uses safe simplifications
11595 _during_ the safe steps. It is more complete as it allows multiple
11596 instantiations of unknowns (e.g. with slow_tac).
11600 * added interface for simplification procedures (functions that
11601 produce *proven* rewrite rules on the fly, depending on current
11604 * ordering on terms as parameter (used for ordered rewriting);
11606 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11608 * the solver is now split into a safe and an unsafe part.
11609 This should be invisible for the normal user, except that the
11610 functions setsolver and addsolver have been renamed to setSolver and
11611 addSolver; added safe_asm_full_simp_tac;
11616 * a generic induction tactic `induct_tac' which works for all datatypes and
11617 also for type `nat';
11619 * a generic case distinction tactic `exhaust_tac' which works for all
11620 datatypes and also for type `nat';
11622 * each datatype comes with a function `size';
11624 * patterns in case expressions allow tuple patterns as arguments to
11625 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11627 * primrec now also works with type nat;
11629 * recdef: a new declaration form, allows general recursive functions to be
11630 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11632 * the constant for negation has been renamed from "not" to "Not" to
11633 harmonize with FOL, ZF, LK, etc.;
11635 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11638 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11640 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11641 problems in commutative rings, using axiomatic type classes for + and *;
11643 * more examples in HOL/MiniML and HOL/Auth;
11645 * more default rewrite rules for quantifiers, union/intersection;
11647 * a new constant `arbitrary == @x.False';
11649 * HOLCF/IOA replaces old HOL/IOA;
11651 * HOLCF changes: derived all rules and arities
11652 + axiomatic type classes instead of classes
11653 + typedef instead of faking type definitions
11654 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11655 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11656 + eliminated the types void, one, tr
11657 + use unit lift and bool lift (with translations) instead of one and tr
11658 + eliminated blift from Lift3.thy (use Def instead of blift)
11659 all eliminated rules are derived as theorems --> no visible changes ;
11664 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11665 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11666 as ZF_cs addSIs [equalityI];
11670 New in Isabelle94-7 (November 96)
11671 ---------------------------------
11673 * allowing negative levels (as offsets) in prlev and choplev;
11675 * super-linear speedup for large simplifications;
11677 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11678 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11679 FAIL); can suppress it using the command Delsimps (ex_simps @
11680 all_simps); De Morgan laws are also now included, by default;
11682 * improved printing of ==> : ~:
11684 * new object-logic "Sequents" adds linear logic, while replacing LK
11685 and Modal (thanks to Sara Kalvala);
11687 * HOL/Auth: correctness proofs for authentication protocols;
11689 * HOL: new auto_tac combines rewriting and classical reasoning (many
11690 examples on HOL/Auth);
11692 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11693 the rewriter and classical reasoner simultaneously;
11695 * function uresult no longer returns theorems in "standard" format;
11696 regain previous version by: val uresult = standard o uresult;
11700 New in Isabelle94-6
11701 -------------------
11703 * oracles -- these establish an interface between Isabelle and trusted
11704 external reasoners, which may deliver results as theorems;
11706 * proof objects (in particular record all uses of oracles);
11708 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11710 * "constdefs" section in theory files;
11712 * "primrec" section (HOL) no longer requires names;
11714 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11718 New in Isabelle94-5
11719 -------------------
11721 * reduced space requirements;
11723 * automatic HTML generation from theories;
11725 * theory files no longer require "..." (quotes) around most types;
11727 * new examples, including two proofs of the Church-Rosser theorem;
11729 * non-curried (1994) version of HOL is no longer distributed;
11733 New in Isabelle94-4
11734 -------------------
11736 * greatly reduced space requirements;
11738 * theory files (.thy) no longer require \...\ escapes at line breaks;
11740 * searchable theorem database (see the section "Retrieving theorems" on
11741 page 8 of the Reference Manual);
11743 * new examples, including Grabczewski's monumental case study of the
11746 * The previous version of HOL renamed to Old_HOL;
11748 * The new version of HOL (previously called CHOL) uses a curried syntax
11749 for functions. Application looks like f a b instead of f(a,b);
11751 * Mutually recursive inductive definitions finally work in HOL;
11753 * In ZF, pattern-matching on tuples is now available in all abstractions and
11754 translates to the operator "split";
11758 New in Isabelle94-3
11759 -------------------
11761 * new infix operator, addss, allowing the classical reasoner to
11762 perform simplification at each step of its search. Example:
11763 fast_tac (cs addss ss)
11765 * a new logic, CHOL, the same as HOL, but with a curried syntax
11766 for functions. Application looks like f a b instead of f(a,b). Also pairs
11767 look like (a,b) instead of <a,b>;
11769 * PLEASE NOTE: CHOL will eventually replace HOL!
11771 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11772 It translates to the operator "split". A new theory of integers is available;
11774 * In ZF, integer numerals now denote two's-complement binary integers.
11775 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11777 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11778 of the Axiom of Choice;
11782 New in Isabelle94-2
11783 -------------------
11785 * Significantly faster resolution;
11787 * the different sections in a .thy file can now be mixed and repeated
11790 * Database of theorems for FOL, HOL and ZF. New
11791 commands including qed, qed_goal and bind_thm store theorems in the database.
11793 * Simple database queries: return a named theorem (get_thm) or all theorems of
11794 a given theory (thms_of), or find out what theory a theorem was proved in
11797 * Bugs fixed in the inductive definition and datatype packages;
11799 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11800 and HOL_dup_cs obsolete;
11802 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11805 * Simpler definition of function space in ZF;
11807 * new results about cardinal and ordinal arithmetic in ZF;
11809 * 'subtype' facility in HOL for introducing new types as subsets of existing
11812 :mode=isabelle-news:wrap=hard:maxLineLen=72: