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 * Completion popup supports both ENTER and TAB (default) to select an
89 item, depending on Isabelle options.
91 * Refined insertion of completion items wrt. jEdit text: multiple
92 selections, rectangular selections, rectangular selection as "tall
95 * Integrated spell-checker for document text, comments etc. with
96 completion popup and context-menu.
98 * More general "Query" panel supersedes "Find" panel, with GUI access
99 to commands 'find_theorems' and 'find_consts', as well as print
100 operations for the context. Minor incompatibility in keyboard
101 shortcuts etc.: replace action isabelle-find by isabelle-query.
103 * Search field for all output panels ("Output", "Query", "Info" etc.)
104 to highlight text via regular expression.
106 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
107 General") allows to specify additional print modes for the prover
108 process, without requiring old-fashioned command-line invocation of
109 "isabelle jedit -m MODE".
111 * More support for remote files (e.g. http) using standard Java
112 networking operations instead of jEdit virtual file-systems.
114 * Empty editors buffers that are no longer required (e.g.\ via theory
115 imports) are automatically removed from the document model.
117 * Improved monitor panel.
119 * Improved Console/Scala plugin: more uniform scala.Console output,
120 more robust treatment of threads and interrupts.
122 * Improved management of dockable windows: clarified keyboard focus
123 and window placement wrt. main editor view; optional menu item to
124 "Detach" a copy where this makes sense.
126 * New Simplifier Trace panel provides an interactive view of the
127 simplification process, enabled by the "simp_trace_new" attribute
133 * Low-level type-class commands 'classes', 'classrel', 'arities' have
134 been discontinued to avoid the danger of non-trivial axiomatization
135 that is not immediately visible. INCOMPATIBILITY, use regular
136 'instance' command with proof. The required OFCLASS(...) theorem
137 might be postulated via 'axiomatization' beforehand, or the proof
138 finished trivially if the underlying class definition is made vacuous
139 (without any assumptions). See also Isabelle/ML operations
140 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
141 Axclass.arity_axiomatization.
143 * Basic constants of Pure use more conventional names and are always
144 qualified. Rare INCOMPATIBILITY, but with potentially serious
145 consequences, notably for tools in Isabelle/ML. The following
146 renaming needs to be applied:
152 dummy_pattern ~> Pure.dummy_pattern
154 Systematic porting works by using the following theory setup on a
155 *previous* Isabelle version to introduce the new name accesses for the
161 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
162 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
163 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
164 |> Sign.restore_naming thy
167 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
168 Later the application is moved to the current Isabelle version, and
169 the auxiliary aliases are deleted.
171 * Attributes "where" and "of" allow an optional context of local
172 variables ('for' declaration): these variables become schematic in the
173 instantiated theorem.
175 * Obsolete attribute "standard" has been discontinued (legacy since
176 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
177 where instantiations with schematic variables are intended (for
178 declaration commands like 'lemmas' or attributes like "of"). The
179 following temporary definition may help to port old applications:
181 attribute_setup standard =
182 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
184 * More thorough check of proof context for goal statements and
185 attributed fact expressions (concerning background theory, declared
186 hyps). Potential INCOMPATIBILITY, tools need to observe standard
187 context discipline. See also Assumption.add_assumes and the more
188 primitive Thm.assume_hyps.
190 * Inner syntax token language allows regular quoted strings "..."
191 (only makes sense in practice, if outer syntax is delimited
192 differently, e.g. via cartouches).
194 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
195 but the latter is retained some time as Proof General legacy.
197 * Code generator preprocessor: explicit control of simp tracing on a
198 per-constant basis. See attribute "code_preproc".
203 * Code generator: enforce case of identifiers only for strict target
204 language requirements. INCOMPATIBILITY.
206 * Code generator: explicit proof contexts in many ML interfaces.
209 * Code generator: minimize exported identifiers by default. Minor
212 * Code generation for SML and OCaml: dropped arcane "no_signatures"
213 option. Minor INCOMPATIBILITY.
215 * "declare [[code abort: ...]]" replaces "code_abort ...".
218 * "declare [[code drop: ...]]" drops all code equations associated
219 with the given constants.
221 * Code generations are provided for make, fields, extend and truncate
222 operations on records.
224 * Command and antiquotation "value" are now hardcoded against nbe and
225 ML. Minor INCOMPATIBILITY.
227 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
229 * The symbol "\<newline>" may be used within char or string literals
230 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
232 * Qualified String.implode and String.explode. INCOMPATIBILITY.
234 * Simplifier: Enhanced solver of preconditions of rewrite rules can
235 now deal with conjunctions. For help with converting proofs, the old
236 behaviour of the simplifier can be restored like this: declare/using
237 [[simp_legacy_precond]]. This configuration option will disappear
238 again in the future. INCOMPATIBILITY.
240 * Simproc "finite_Collect" is no longer enabled by default, due to
241 spurious crashes and other surprises. Potential INCOMPATIBILITY.
243 * Moved new (co)datatype package and its dependencies from session
244 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
245 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
246 part of theory "Main".
249 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
250 Library/Wfrec.thy ~> Wfrec.thy
251 Library/Zorn.thy ~> Zorn.thy
252 Cardinals/Order_Relation.thy ~> Order_Relation.thy
253 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
254 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
255 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
256 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
257 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
258 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
259 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
260 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
261 BNF/BNF_Comp.thy ~> BNF_Comp.thy
262 BNF/BNF_Def.thy ~> BNF_Def.thy
263 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
264 BNF/BNF_GFP.thy ~> BNF_GFP.thy
265 BNF/BNF_LFP.thy ~> BNF_LFP.thy
266 BNF/BNF_Util.thy ~> BNF_Util.thy
267 BNF/Coinduction.thy ~> Coinduction.thy
268 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
269 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
270 BNF/Examples/* ~> BNF_Examples/*
273 Wellorder_Extension.thy (split from Zorn.thy)
274 Library/Cardinal_Notations.thy
275 Library/BNF_Axomatization.thy
276 BNF_Examples/Misc_Primcorec.thy
277 BNF_Examples/Stream_Processor.thy
279 Discontinued theories:
281 BNF/Equiv_Relations_More.thy
285 * New (co)datatype package:
286 - Command 'primcorec' is fully implemented.
287 - Command 'datatype_new' generates size functions ("size_xxx" and
288 "size") as required by 'fun'.
289 - BNFs are integrated with the Lifting tool and new-style
290 (co)datatypes with Transfer.
292 datatype_new_compat ~> datatype_compat
293 primrec_new ~> primrec
294 wrap_free_constructors ~> free_constructors
296 - The generated constants "xxx_case" and "xxx_rec" have been renamed
297 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
299 - The constant "xxx_(un)fold" and related theorems are no longer
300 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
303 - No discriminators are generated for nullary constructors by
304 default, eliminating the need for the odd "=:" syntax.
306 - No discriminators or selectors are generated by default by
307 "datatype_new", unless custom names are specified or the new
308 "discs_sels" option is passed.
311 * Old datatype package:
312 - The generated theorems "xxx.cases" and "xxx.recs" have been
313 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
314 "sum.case"). INCOMPATIBILITY.
315 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
316 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
317 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
319 * The types "'a list" and "'a option", their set and map functions,
320 their relators, and their selectors are now produced using the new
321 BNF-based datatype package.
324 Option.set ~> set_option
325 Option.map ~> map_option
326 option_rel ~> rel_option
329 set_def ~> set_rec[abs_def]
330 map_def ~> map_rec[abs_def]
331 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
332 option.recs ~> option.rec
333 list_all2_def ~> list_all2_iff
334 set.simps ~> set_simps (or the slightly different "list.set")
335 map.simps ~> list.map
336 hd.simps ~> list.sel(1)
337 tl.simps ~> list.sel(2-3)
338 the.simps ~> option.sel
342 * The following map functions and relators have been renamed:
349 filter_rel ~> rel_filter
350 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
351 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
352 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
356 * Lifting and Transfer:
357 - a type variable as a raw type is supported
358 - stronger reflexivity prover
359 - rep_eq is always generated by lift_definition
360 - setup for Lifting/Transfer is now automated for BNFs
361 + holds for BNFs that do not contain a dead variable
362 + relator_eq, relator_mono, relator_distr, relator_domain,
363 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
364 right_unique, right_total, left_unique, left_total are proved
366 + definition of a predicator is generated automatically
367 + simplification rules for a predicator definition are proved
368 automatically for datatypes
369 - consolidation of the setup of Lifting/Transfer
370 + property that a relator preservers reflexivity is not needed any
372 Minor INCOMPATIBILITY.
373 + left_total and left_unique rules are now transfer rules
374 (reflexivity_rule attribute not needed anymore)
376 + Domainp does not have to be a separate assumption in
377 relator_domain theorems (=> more natural statement)
379 - registration of code equations is more robust
380 Potential INCOMPATIBILITY.
381 - respectfulness proof obligation is preprocessed to a more readable
383 Potential INCOMPATIBILITY.
384 - eq_onp is always unfolded in respectfulness proof obligation
385 Potential INCOMPATIBILITY.
386 - unregister lifting setup for Code_Numeral.integer and
388 Potential INCOMPATIBILITY.
389 - Lifting.invariant -> eq_onp
392 * New internal SAT solver "cdclite" that produces models and proof
393 traces. This solver replaces the internal SAT solvers "enumerate" and
394 "dpll". Applications that explicitly used one of these two SAT
395 solvers should use "cdclite" instead. In addition, "cdclite" is now
396 the default SAT solver for the "sat" and "satx" proof methods and
397 corresponding tactics; the old default can be restored using "declare
398 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
400 * SMT module: A new version of the SMT module, temporarily called
401 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
402 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
403 supported as oracles. Yices is no longer supported, because no version
404 of the solver can handle both SMT-LIB 2 and quantifiers.
406 * Activation of Z3 now works via "z3_non_commercial" system option
407 (without requiring restart), instead of former settings variable
408 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
409 Plugin Options / Isabelle / General.
412 - Z3 can now produce Isar proofs.
414 . New SML-based learning algorithms eliminate the dependency on
415 Python and increase performance and reliability.
416 . MaSh and MeSh are now used by default together with the
417 traditional MePo (Meng-Paulson) relevance filter. To disable
418 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
419 Options / Isabelle / General to "none".
423 isar_compress ~> compress
428 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
431 - Fixed soundness bug whereby mutually recursive datatypes could
432 take infinite values.
433 - Fixed soundness bug with low-level number functions such as
434 "Abs_Integ" and "Rep_Integ".
435 - Removed "std" option.
436 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
439 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
440 (full_types)' instead. INCOMPATIBILITY.
442 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
444 * Adjustion of INF and SUP operations:
445 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
446 - Consolidated theorem names containing INFI and SUPR: have INF and
447 SUP instead uniformly.
448 - More aggressive normalization of expressions involving INF and Inf
450 - INF_image and SUP_image do not unfold composition.
451 - Dropped facts INF_comp, SUP_comp.
452 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
453 simplifier implication in premises. Generalize and replace former
458 * SUP and INF generalized to conditionally_complete_lattice.
460 * Swapped orientation of facts image_comp and vimage_comp:
462 image_compose ~> image_comp [symmetric]
463 image_comp ~> image_comp [symmetric]
464 vimage_compose ~> vimage_comp [symmetric]
465 vimage_comp ~> vimage_comp [symmetric]
469 * Theory reorganization: split of Big_Operators.thy into
470 Groups_Big.thy and Lattices_Big.thy.
472 * Consolidated some facts about big group operators:
474 setsum_0' ~> setsum.neutral
475 setsum_0 ~> setsum.neutral_const
476 setsum_addf ~> setsum.distrib
477 setsum_cartesian_product ~> setsum.cartesian_product
478 setsum_cases ~> setsum.If_cases
479 setsum_commute ~> setsum.commute
480 setsum_cong ~> setsum.cong
481 setsum_delta ~> setsum.delta
482 setsum_delta' ~> setsum.delta'
483 setsum_diff1' ~> setsum.remove
484 setsum_empty ~> setsum.empty
485 setsum_infinite ~> setsum.infinite
486 setsum_insert ~> setsum.insert
487 setsum_inter_restrict'' ~> setsum.inter_filter
488 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
489 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
490 setsum_mono_zero_left ~> setsum.mono_neutral_left
491 setsum_mono_zero_right ~> setsum.mono_neutral_right
492 setsum_reindex ~> setsum.reindex
493 setsum_reindex_cong ~> setsum.reindex_cong
494 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
495 setsum_restrict_set ~> setsum.inter_restrict
496 setsum_Plus ~> setsum.Plus
497 setsum_setsum_restrict ~> setsum.commute_restrict
498 setsum_Sigma ~> setsum.Sigma
499 setsum_subset_diff ~> setsum.subset_diff
500 setsum_Un_disjoint ~> setsum.union_disjoint
501 setsum_UN_disjoint ~> setsum.UNION_disjoint
502 setsum_Un_Int ~> setsum.union_inter
503 setsum_Union_disjoint ~> setsum.Union_disjoint
504 setsum_UNION_zero ~> setsum.Union_comp
505 setsum_Un_zero ~> setsum.union_inter_neutral
506 strong_setprod_cong ~> setprod.strong_cong
507 strong_setsum_cong ~> setsum.strong_cong
508 setprod_1' ~> setprod.neutral
509 setprod_1 ~> setprod.neutral_const
510 setprod_cartesian_product ~> setprod.cartesian_product
511 setprod_cong ~> setprod.cong
512 setprod_delta ~> setprod.delta
513 setprod_delta' ~> setprod.delta'
514 setprod_empty ~> setprod.empty
515 setprod_infinite ~> setprod.infinite
516 setprod_insert ~> setprod.insert
517 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
518 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
519 setprod_mono_one_left ~> setprod.mono_neutral_left
520 setprod_mono_one_right ~> setprod.mono_neutral_right
521 setprod_reindex ~> setprod.reindex
522 setprod_reindex_cong ~> setprod.reindex_cong
523 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
524 setprod_Sigma ~> setprod.Sigma
525 setprod_subset_diff ~> setprod.subset_diff
526 setprod_timesf ~> setprod.distrib
527 setprod_Un2 ~> setprod.union_diff2
528 setprod_Un_disjoint ~> setprod.union_disjoint
529 setprod_UN_disjoint ~> setprod.UNION_disjoint
530 setprod_Un_Int ~> setprod.union_inter
531 setprod_Union_disjoint ~> setprod.Union_disjoint
532 setprod_Un_one ~> setprod.union_inter_neutral
534 Dropped setsum_cong2 (simple variant of setsum.cong).
535 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
536 Dropped setsum_reindex_id, setprod_reindex_id
537 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
541 * Abolished slightly odd global lattice interpretation for min/max.
544 min_max.inf_assoc ~> min.assoc
545 min_max.inf_commute ~> min.commute
546 min_max.inf_left_commute ~> min.left_commute
547 min_max.inf_idem ~> min.idem
548 min_max.inf_left_idem ~> min.left_idem
549 min_max.inf_right_idem ~> min.right_idem
550 min_max.sup_assoc ~> max.assoc
551 min_max.sup_commute ~> max.commute
552 min_max.sup_left_commute ~> max.left_commute
553 min_max.sup_idem ~> max.idem
554 min_max.sup_left_idem ~> max.left_idem
555 min_max.sup_inf_distrib1 ~> max_min_distrib2
556 min_max.sup_inf_distrib2 ~> max_min_distrib1
557 min_max.inf_sup_distrib1 ~> min_max_distrib2
558 min_max.inf_sup_distrib2 ~> min_max_distrib1
559 min_max.distrib ~> min_max_distribs
560 min_max.inf_absorb1 ~> min.absorb1
561 min_max.inf_absorb2 ~> min.absorb2
562 min_max.sup_absorb1 ~> max.absorb1
563 min_max.sup_absorb2 ~> max.absorb2
564 min_max.le_iff_inf ~> min.absorb_iff1
565 min_max.le_iff_sup ~> max.absorb_iff2
566 min_max.inf_le1 ~> min.cobounded1
567 min_max.inf_le2 ~> min.cobounded2
568 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
569 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
570 min_max.le_infI1 ~> min.coboundedI1
571 min_max.le_infI2 ~> min.coboundedI2
572 min_max.le_supI1 ~> max.coboundedI1
573 min_max.le_supI2 ~> max.coboundedI2
574 min_max.less_infI1 ~> min.strict_coboundedI1
575 min_max.less_infI2 ~> min.strict_coboundedI2
576 min_max.less_supI1 ~> max.strict_coboundedI1
577 min_max.less_supI2 ~> max.strict_coboundedI2
578 min_max.inf_mono ~> min.mono
579 min_max.sup_mono ~> max.mono
580 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
581 min_max.le_supI, min_max.sup_least ~> max.boundedI
582 min_max.le_inf_iff ~> min.bounded_iff
583 min_max.le_sup_iff ~> max.bounded_iff
585 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
586 min.left_commute, min.left_idem, max.commute, max.assoc,
587 max.left_commute, max.left_idem directly.
589 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
590 min.cobounded2, max.cobounded1m max.cobounded2 directly.
592 For min_ac or max_ac, prefer more general collection ac_simps.
596 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
597 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
599 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
602 * Fact generalization and consolidation:
603 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
607 * Purely algebraic definition of even. Fact generalization and
609 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
610 even_zero_(nat|int) ~> even_zero
614 * Abolished neg_numeral.
615 - Canonical representation for minus one is "- 1".
616 - Canonical representation for other negative numbers is "- (numeral _)".
617 - When devising rule sets for number calculation, consider the
618 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
619 - HOLogic.dest_number also recognizes numerals in non-canonical forms
620 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
621 - Syntax for negative numerals is mere input syntax.
625 * Reduced name variants for rules on associativity and commutativity:
627 add_assoc ~> add.assoc
628 add_commute ~> add.commute
629 add_left_commute ~> add.left_commute
630 mult_assoc ~> mult.assoc
631 mult_commute ~> mult.commute
632 mult_left_commute ~> mult.left_commute
633 nat_add_assoc ~> add.assoc
634 nat_add_commute ~> add.commute
635 nat_add_left_commute ~> add.left_commute
636 nat_mult_assoc ~> mult.assoc
637 nat_mult_commute ~> mult.commute
638 eq_assoc ~> iff_assoc
639 eq_left_commute ~> iff_left_commute
643 * Fact collections add_ac and mult_ac are considered old-fashioned.
644 Prefer ac_simps instead, or specify rules
645 (add|mult).(assoc|commute|left_commute) individually.
647 * Elimination of fact duplicates:
648 equals_zero_I ~> minus_unique
649 diff_eq_0_iff_eq ~> right_minus_eq
650 nat_infinite ~> infinite_UNIV_nat
651 int_infinite ~> infinite_UNIV_int
655 * Fact name consolidation:
656 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
657 minus_le_self_iff ~> neg_less_eq_nonneg
658 le_minus_self_iff ~> less_eq_neg_nonpos
659 neg_less_nonneg ~> neg_less_pos
660 less_minus_self_iff ~> less_neg_neg [simp]
664 * More simplification rules on unary and binary minus:
665 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
666 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
667 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
668 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
669 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
670 been taken away from fact collections algebra_simps and field_simps.
673 To restore proofs, the following patterns are helpful:
675 a) Arbitrary failing proof not involving "diff_def":
676 Consider simplification with algebra_simps or field_simps.
678 b) Lifting rules from addition to subtraction:
679 Try with "using <rule for addition> of [... "- _" ...]" by simp".
681 c) Simplification with "diff_def": just drop "diff_def".
682 Consider simplification with algebra_simps or field_simps;
683 or the brute way with
684 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
686 * Introduce bdd_above and bdd_below in theory
687 Conditionally_Complete_Lattices, use them instead of explicitly
688 stating boundedness of sets.
690 * ccpo.admissible quantifies only over non-empty chains to allow more
691 syntax-directed proof rules; the case of the empty chain shows up as
692 additional case in fixpoint induction proofs. INCOMPATIBILITY.
694 * Removed and renamed theorems in Series:
695 summable_le ~> suminf_le
696 suminf_le ~> suminf_le_const
697 series_pos_le ~> setsum_le_suminf
698 series_pos_less ~> setsum_less_suminf
699 suminf_ge_zero ~> suminf_nonneg
700 suminf_gt_zero ~> suminf_pos
701 suminf_gt_zero_iff ~> suminf_pos_iff
702 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
703 suminf_0_le ~> suminf_nonneg [rotate]
704 pos_summable ~> summableI_nonneg_bounded
705 ratio_test ~> summable_ratio_test
707 removed series_zero, replaced by sums_finite
709 removed auxiliary lemmas:
711 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
712 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
713 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
714 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
715 summable_convergent_sumr_iff, sumr_diff_mult_const
719 * Replace (F)DERIV syntax by has_derivative:
720 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
722 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
724 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
726 - removed constant isDiff
728 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
731 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
733 - Renamed FDERIV_... lemmas to has_derivative_...
735 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
737 - removed DERIV_intros, has_derivative_eq_intros
739 - introduced derivative_intros and deriative_eq_intros which
740 includes now rules for DERIV, has_derivative and
741 has_vector_derivative.
744 differentiable_def ~> real_differentiable_def
745 differentiableE ~> real_differentiableE
746 fderiv_def ~> has_derivative_at
747 field_fderiv_def ~> field_has_derivative_at
748 isDiff_der ~> differentiable_def
749 deriv_fderiv ~> has_field_derivative_def
750 deriv_def ~> DERIV_def
754 * Include more theorems in continuous_intros. Remove the
755 continuous_on_intros, isCont_intros collections, these facts are now
756 in continuous_intros.
758 * Theorems about complex numbers are now stated only using Re and Im,
759 the Complex constructor is not used anymore. It is possible to use
760 primcorec to defined the behaviour of a complex-valued function.
762 Removed theorems about the Complex constructor from the simpset, they
763 are available as the lemma collection legacy_Complex_simps. This
766 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
768 Instead the reverse direction is supported with
769 Complex_eq: "Complex a b = a + \<i> * b"
771 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
775 complex_Re/Im_zero ~> zero_complex.sel
776 complex_Re/Im_add ~> plus_complex.sel
777 complex_Re/Im_minus ~> uminus_complex.sel
778 complex_Re/Im_diff ~> minus_complex.sel
779 complex_Re/Im_one ~> one_complex.sel
780 complex_Re/Im_mult ~> times_complex.sel
781 complex_Re/Im_inverse ~> inverse_complex.sel
782 complex_Re/Im_scaleR ~> scaleR_complex.sel
783 complex_Re/Im_i ~> ii.sel
784 complex_Re/Im_cnj ~> cnj.sel
787 complex_divide_def ~> divide_complex_def
788 complex_norm_def ~> norm_complex_def
789 cmod_def ~> norm_complex_de
803 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
804 Conditionally_Complete_Lattices. INCOMPATIBILITY.
806 * HOL-Library: new theory src/HOL/Library/Tree.thy.
808 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
809 is subsumed by session Kleene_Algebra in AFP.
811 * HOL-Library / theory RBT: various constants and facts are hidden;
812 lifting setup is unregistered. INCOMPATIBILITY.
814 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
816 * HOL-Word: bit representations prefer type bool over type bit.
820 - Abandoned fact collection "word_arith_alts", which is a duplicate
822 - Dropped first (duplicated) element in fact collections
823 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
824 "uint_word_arith_bintrs".
827 - consolidated the proofs of the binomial theorem
828 - the function fib is again of type nat => nat and not overloaded
829 - no more references to Old_Number_Theory in the HOL libraries
834 * HOL-Multivariate_Analysis:
835 - Type class ordered_real_vector for ordered vector spaces.
836 - New theory Complex_Basic_Analysis defining complex derivatives,
837 holomorphic functions, etc., ported from HOL Light's canal.ml.
838 - Changed order of ordered_euclidean_space to be compatible with
839 pointwise ordering on products. Therefore instance of
840 conditionally_complete_lattice and ordered_real_vector.
841 INCOMPATIBILITY: use box instead of greaterThanLessThan or
842 explicit set-comprehensions with eucl_less for other (half-)open
844 - removed dependencies on type class ordered_euclidean_space with
845 introduction of "cbox" on euclidean_space
848 mem_interval ~> mem_box
849 interval_eq_empty ~> box_eq_empty
850 interval_ne_empty ~> box_ne_empty
851 interval_sing(1) ~> cbox_sing
852 interval_sing(2) ~> box_sing
853 subset_interval_imp ~> subset_box_imp
854 subset_interval ~> subset_box
855 open_interval ~> open_box
856 closed_interval ~> closed_cbox
857 interior_closed_interval ~> interior_cbox
858 bounded_closed_interval ~> bounded_cbox
859 compact_interval ~> compact_cbox
860 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
861 bounded_subset_closed_interval ~> bounded_subset_cbox
862 mem_interval_componentwiseI ~> mem_box_componentwiseI
863 convex_box ~> convex_prod
864 rel_interior_real_interval ~> rel_interior_real_box
865 convex_interval ~> convex_box
866 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
867 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
868 content_closed_interval' ~> content_cbox'
869 elementary_subset_interval ~> elementary_subset_box
870 diameter_closed_interval ~> diameter_cbox
871 frontier_closed_interval ~> frontier_cbox
872 frontier_open_interval ~> frontier_box
873 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
874 closure_open_interval ~> closure_box
875 open_closed_interval_convex ~> open_cbox_convex
876 open_interval_midpoint ~> box_midpoint
877 content_image_affinity_interval ~> content_image_affinity_cbox
878 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
879 bounded_interval ~> bounded_closed_interval + bounded_boxes
881 - respective theorems for intervals over the reals:
882 content_closed_interval + content_cbox
883 has_integral + has_integral_real
884 fine_division_exists + fine_division_exists_real
885 has_integral_null + has_integral_null_real
886 tagged_division_union_interval + tagged_division_union_interval_real
887 has_integral_const + has_integral_const_real
888 integral_const + integral_const_real
889 has_integral_bound + has_integral_bound_real
890 integrable_continuous + integrable_continuous_real
891 integrable_subinterval + integrable_subinterval_real
892 has_integral_reflect_lemma + has_integral_reflect_lemma_real
893 integrable_reflect + integrable_reflect_real
894 integral_reflect + integral_reflect_real
895 image_affinity_interval + image_affinity_cbox
896 image_smult_interval + image_smult_cbox
897 integrable_const + integrable_const_ivl
898 integrable_on_subinterval + integrable_on_subcbox
901 derivative_linear ~> has_derivative_bounded_linear
902 derivative_is_linear ~> has_derivative_linear
903 bounded_linear_imp_linear ~> bounded_linear.linear
906 - Renamed positive_integral to nn_integral:
908 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
909 positive_integral_positive ~> nn_integral_nonneg
911 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
913 - replaced the Lebesgue integral on real numbers by the more general
914 Bochner integral for functions into a real-normed vector space.
916 integral_zero ~> integral_zero / integrable_zero
917 integral_minus ~> integral_minus / integrable_minus
918 integral_add ~> integral_add / integrable_add
919 integral_diff ~> integral_diff / integrable_diff
920 integral_setsum ~> integral_setsum / integrable_setsum
921 integral_multc ~> integral_mult_left / integrable_mult_left
922 integral_cmult ~> integral_mult_right / integrable_mult_right
923 integral_triangle_inequality~> integral_norm_bound
924 integrable_nonneg ~> integrableI_nonneg
925 integral_positive ~> integral_nonneg_AE
926 integrable_abs_iff ~> integrable_abs_cancel
927 positive_integral_lim_INF ~> nn_integral_liminf
928 lebesgue_real_affine ~> lborel_real_affine
929 borel_integral_has_integral ~> has_integral_lebesgue_integral
930 integral_indicator ~>
931 integral_real_indicator / integrable_real_indicator
932 positive_integral_fst ~> nn_integral_fst'
933 positive_integral_fst_measurable ~> nn_integral_fst
934 positive_integral_snd_measurable ~> nn_integral_snd
936 integrable_fst_measurable ~>
937 integral_fst / integrable_fst / AE_integrable_fst
939 integrable_snd_measurable ~>
940 integral_snd / integrable_snd / AE_integrable_snd
942 integral_monotone_convergence ~>
943 integral_monotone_convergence / integrable_monotone_convergence
945 integral_monotone_convergence_at_top ~>
946 integral_monotone_convergence_at_top /
947 integrable_monotone_convergence_at_top
949 has_integral_iff_positive_integral_lebesgue ~>
950 has_integral_iff_has_bochner_integral_lebesgue_nonneg
952 lebesgue_integral_has_integral ~>
953 has_integral_integrable_lebesgue_nonneg
955 positive_integral_lebesgue_has_integral ~>
956 integral_has_integral_lebesgue_nonneg /
957 integrable_has_integral_lebesgue_nonneg
959 lebesgue_integral_real_affine ~>
960 nn_integral_real_affine
962 has_integral_iff_positive_integral_lborel ~>
963 integral_has_integral_nonneg / integrable_has_integral_nonneg
965 The following theorems where removed:
967 lebesgue_integral_nonneg
968 lebesgue_integral_uminus
969 lebesgue_integral_cmult
970 lebesgue_integral_multc
971 lebesgue_integral_cmult_nonneg
972 integral_cmul_indicator
975 - Formalized properties about exponentially, Erlang, and normal
976 distributed random variables.
978 * HOL-Decision_Procs: Separate command 'approximate' for approximative
979 computation in src/HOL/Decision_Procs/Approximation. Minor
985 * The signature and semantics of Document.Snapshot.cumulate_markup /
986 select_markup have been clarified. Markup is now traversed in the
987 order of reports given by the prover: later markup is usually more
988 specific and may override results accumulated so far. The elements
989 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
991 * Substantial reworking of internal PIDE protocol communication
992 channels. INCOMPATIBILITY.
997 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
998 compared (according to Thm.thm_ord), but assumed to be covered by the
999 current background theory. Thus equivalent data produced in different
1000 branches of the theory graph usually coincides (e.g. relevant for
1001 theory merge). Note that the softer Thm.eq_thm_prop is often more
1002 appropriate than Thm.eq_thm.
1004 * Proper context for basic Simplifier operations: rewrite_rule,
1005 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
1006 pass runtime Proof.context (and ensure that the simplified entity
1007 actually belongs to it).
1009 * Proper context discipline for read_instantiate and instantiate_tac:
1010 variables that are meant to become schematic need to be given as
1011 fixed, and are generalized by the explicit context of local variables.
1012 This corresponds to Isar attributes "where" and "of" with 'for'
1013 declaration. INCOMPATIBILITY, also due to potential change of indices
1014 of schematic variables.
1016 * Moved ML_Compiler.exn_trace and other operations on exceptions to
1017 structure Runtime. Minor INCOMPATIBILITY.
1019 * Discontinued old Toplevel.debug in favour of system option
1020 "ML_exception_trace", which may be also declared within the context
1021 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
1023 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
1026 * Configuration option "ML_print_depth" controls the pretty-printing
1027 depth of the ML compiler within the context. The old print_depth in
1028 ML is still available as default_print_depth, but rarely used. Minor
1031 * Toplevel function "use" refers to raw ML bootstrap environment,
1032 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
1033 Note that 'ML_file' is the canonical command to load ML files into the
1036 * Simplified programming interface to define ML antiquotations, see
1037 structure ML_Antiquotation. Minor INCOMPATIBILITY.
1039 * ML antiquotation @{here} refers to its source position, which is
1040 occasionally useful for experimentation and diagnostic purposes.
1042 * ML antiquotation @{path} produces a Path.T value, similarly to
1043 Path.explode, but with compile-time check against the file-system and
1044 some PIDE markup. Note that unlike theory source, ML does not have a
1045 well-defined master directory, so an absolute symbolic path
1046 specification is usually required, e.g. "~~/src/HOL".
1048 * ML antiquotation @{print} inlines a function to print an arbitrary
1049 ML value, which is occasionally useful for diagnostic or demonstration
1055 * Proof General with its traditional helper scripts is now an optional
1056 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
1057 component repository http://isabelle.in.tum.de/components/. Note that
1058 the "system" manual provides general explanations about add-on
1059 components, especially those that are not bundled with the release.
1061 * The raw Isabelle process executable has been renamed from
1062 "isabelle-process" to "isabelle_process", which conforms to common
1063 shell naming conventions, and allows to define a shell function within
1064 the Isabelle environment to avoid dynamic path lookup. Rare
1065 incompatibility for old tools that do not use the ISABELLE_PROCESS
1068 * Former "isabelle tty" has been superseded by "isabelle console",
1069 with implicit build like "isabelle jedit", and without the mostly
1070 obsolete Isar TTY loop.
1072 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
1073 and PDF_VIEWER now refer to the actual programs, not shell
1074 command-lines. Discontinued option -c: invocation may be asynchronous
1075 via desktop environment, without any special precautions. Potential
1076 INCOMPATIBILITY with ambitious private settings.
1078 * Removed obsolete "isabelle unsymbolize". Note that the usual format
1079 for email communication is the Unicode rendering of Isabelle symbols,
1080 as produced by Isabelle/jEdit, for example.
1082 * Removed obsolete tool "wwwfind". Similar functionality may be
1083 integrated into Isabelle/jEdit eventually.
1085 * Improved 'display_drafts' concerning desktop integration and
1086 repeated invocation in PIDE front-end: re-use single file
1087 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1089 * Session ROOT specifications require explicit 'document_files' for
1090 robust dependencies on LaTeX sources. Only these explicitly given
1091 files are copied to the document output directory, before document
1092 processing is started.
1094 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1095 of TeX Live from Cygwin.
1099 New in Isabelle2013-2 (December 2013)
1100 -------------------------------------
1102 *** Prover IDE -- Isabelle/Scala/jEdit ***
1104 * More robust editing of running commands with internal forks,
1105 e.g. non-terminating 'by' steps.
1107 * More relaxed Sledgehammer panel: avoid repeated application of query
1108 after edits surrounding the command location.
1110 * More status information about commands that are interrupted
1111 accidentally (via physical event or Poly/ML runtime system signal,
1112 e.g. out-of-memory).
1117 * More robust termination of external processes managed by
1118 Isabelle/ML: support cancellation of tasks within the range of
1119 milliseconds, as required for PIDE document editing with automatically
1120 tried tools (e.g. Sledgehammer).
1122 * Reactivated Isabelle/Scala kill command for external processes on
1123 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1124 workaround for some Debian/Ubuntu Linux versions from 2013.
1128 New in Isabelle2013-1 (November 2013)
1129 -------------------------------------
1133 * Discontinued obsolete 'uses' within theory header. Note that
1134 commands like 'ML_file' work without separate declaration of file
1135 dependencies. Minor INCOMPATIBILITY.
1137 * Discontinued redundant 'use' command, which was superseded by
1138 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1140 * Simplified subscripts within identifiers, using plain \<^sub>
1141 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1142 only for literal tokens within notation; explicit mixfix annotations
1143 for consts or fixed variables may be used as fall-back for unusual
1144 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1145 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1146 standardize symbols as a starting point for further manual cleanup.
1147 The ML reference variable "legacy_isub_isup" may be set as temporary
1148 workaround, to make the prover accept a subset of the old identifier
1151 * Document antiquotations: term style "isub" has been renamed to
1152 "sub". Minor INCOMPATIBILITY.
1154 * Uniform management of "quick_and_dirty" as system option (see also
1155 "isabelle options"), configuration option within the context (see also
1156 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1157 INCOMPATIBILITY, need to use more official Isabelle means to access
1158 quick_and_dirty, instead of historical poking into mutable reference.
1160 * Renamed command 'print_configs' to 'print_options'. Minor
1163 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1164 implicit change of some global references) is retained for now as
1165 control command, e.g. for ProofGeneral 3.7.x.
1167 * Discontinued 'print_drafts' command with its old-fashioned PS output
1168 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1169 'display_drafts' instead and print via the regular document viewer.
1171 * Updated and extended "isar-ref" and "implementation" manual,
1172 eliminated old "ref" manual.
1175 *** Prover IDE -- Isabelle/Scala/jEdit ***
1177 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1178 Documentation panel.
1180 * Dockable window "Documentation" provides access to Isabelle
1183 * Dockable window "Find" provides query operations for formal entities
1184 (GUI front-end to 'find_theorems' command).
1186 * Dockable window "Sledgehammer" manages asynchronous / parallel
1187 sledgehammer runs over existing document sources, independently of
1188 normal editing and checking process.
1190 * Dockable window "Timing" provides an overview of relevant command
1191 timing information, depending on option jedit_timing_threshold. The
1192 same timing information is shown in the extended tooltip of the
1193 command keyword, when hovering the mouse over it while the CONTROL or
1194 COMMAND modifier is pressed.
1196 * Improved dockable window "Theories": Continuous checking of proof
1197 document (visible and required parts) may be controlled explicitly,
1198 using check box or shortcut "C+e ENTER". Individual theory nodes may
1199 be marked explicitly as required and checked in full, using check box
1200 or shortcut "C+e SPACE".
1202 * Improved completion mechanism, which is now managed by the
1203 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1204 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1206 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1207 isabelle.complete for explicit completion in Isabelle sources.
1208 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1209 to resolve conflict.
1211 * Improved support of various "minor modes" for Isabelle NEWS,
1212 options, session ROOT etc., with completion and SideKick tree view.
1214 * Strictly monotonic document update, without premature cancellation of
1215 running transactions that are still needed: avoid reset/restart of
1216 such command executions while editing.
1218 * Support for asynchronous print functions, as overlay to existing
1221 * Support for automatic tools in HOL, which try to prove or disprove
1222 toplevel theorem statements.
1224 * Action isabelle.reset-font-size resets main text area font size
1225 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1226 also "Plugin Options / Isabelle / General"). It can be bound to some
1227 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1229 * File specifications in jEdit (e.g. file browser) may refer to
1230 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1231 obsolete $ISABELLE_HOME_WINDOWS variable.
1233 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1234 / Global Options / Appearance".
1236 * Improved support of native Mac OS X functionality via "MacOSX"
1237 plugin, which is now enabled by default.
1242 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1243 In particular, 'interpretation' allows for non-persistent
1244 interpretation within "context ... begin ... end" blocks offering a
1245 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1248 * Improved locales diagnostic command 'print_dependencies'.
1250 * Discontinued obsolete 'axioms' command, which has been marked as
1251 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1252 instead, while observing its uniform scope for polymorphism.
1254 * Discontinued empty name bindings in 'axiomatization'.
1257 * System option "proofs" has been discontinued. Instead the global
1258 state of Proofterm.proofs is persistently compiled into logic images
1259 as required, notably HOL-Proofs. Users no longer need to change
1260 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1262 * Syntax translation functions (print_translation etc.) always depend
1263 on Proof.context. Discontinued former "(advanced)" option -- this is
1264 now the default. Minor INCOMPATIBILITY.
1266 * Former global reference trace_unify_fail is now available as
1267 configuration option "unify_trace_failure" (global context only).
1269 * SELECT_GOAL now retains the syntactic context of the overall goal
1270 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1276 * Stronger precedence of syntax for big intersection and union on
1277 sets, in accordance with corresponding lattice operations.
1280 * Notation "{p:A. P}" now allows tuple patterns as well.
1282 * Nested case expressions are now translated in a separate check phase
1283 rather than during parsing. The data for case combinators is separated
1284 from the datatype package. The declaration attribute
1285 "case_translation" can be used to register new case combinators:
1287 declare [[case_translation case_combinator constructor1 ... constructorN]]
1290 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1292 - 'code_identifier' declares name hints for arbitrary identifiers in
1293 generated code, subsuming 'code_modulename'.
1295 See the isar-ref manual for syntax diagrams, and the HOL theories for
1298 * Attibute 'code': 'code' now declares concrete and abstract code
1299 equations uniformly. Use explicit 'code equation' and 'code abstract'
1300 to distinguish both when desired.
1302 * Discontinued theories Code_Integer and Efficient_Nat by a more
1303 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1304 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1305 generation for details. INCOMPATIBILITY.
1307 * Numeric types are mapped by default to target language numerals:
1308 natural (replaces former code_numeral) and integer (replaces former
1309 code_int). Conversions are available as integer_of_natural /
1310 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1311 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1312 ML). INCOMPATIBILITY.
1314 * Function package: For mutually recursive functions f and g, separate
1315 cases rules f.cases and g.cases are generated instead of unusable
1316 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1317 in the case that the unusable rule was used nevertheless.
1319 * Function package: For each function f, new rules f.elims are
1320 generated, which eliminate equalities of the form "f x = t".
1322 * New command 'fun_cases' derives ad-hoc elimination rules for
1323 function equations as simplified instances of f.elims, analogous to
1324 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1327 - parametrized correspondence relations are now supported:
1328 + parametricity theorems for the raw term can be specified in
1329 the command lift_definition, which allow us to generate stronger
1331 + setup_lifting generates stronger transfer rules if parametric
1332 correspondence relation can be generated
1333 + various new properties of the relator must be specified to support
1335 + parametricity theorem for the Quotient relation can be specified
1336 - setup_lifting generates domain rules for the Transfer package
1337 - stronger reflexivity prover of respectfulness theorems for type
1339 - ===> and --> are now local. The symbols can be introduced
1340 by interpreting the locale lifting_syntax (typically in an
1342 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1343 Main. Potential INCOMPATIBILITY
1344 - new commands for restoring and deleting Lifting/Transfer context:
1345 lifting_forget, lifting_update
1346 - the command print_quotmaps was renamed to print_quot_maps.
1350 - better support for domains in Transfer: replace Domainp T
1351 by the actual invariant in a transferred goal
1352 - transfer rules can have as assumptions other transfer rules
1353 - Experimental support for transferring from the raw level to the
1354 abstract level: Transfer.transferred attribute
1355 - Attribute version of the transfer method: untransferred attribute
1357 * Reification and reflection:
1358 - Reification is now directly available in HOL-Main in structure
1360 - Reflection now handles multiple lists with variables also.
1361 - The whole reflection stack has been decomposed into conversions.
1364 * Revised devices for recursive definitions over finite sets:
1365 - Only one fundamental fold combinator on finite set remains:
1366 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1367 This is now identity on infinite sets.
1368 - Locales ("mini packages") for fundamental definitions with
1369 Finite_Set.fold: folding, folding_idem.
1370 - Locales comm_monoid_set, semilattice_order_set and
1371 semilattice_neutr_order_set for big operators on sets.
1372 See theory Big_Operators for canonical examples.
1373 Note that foundational constants comm_monoid_set.F and
1374 semilattice_set.F correspond to former combinators fold_image
1375 and fold1 respectively. These are now gone. You may use
1376 those foundational constants as substitutes, but it is
1377 preferable to interpret the above locales accordingly.
1378 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1379 no longer needed in connection with Finite_Set.fold etc.)
1381 card.union_inter ~> card_Un_Int [symmetric]
1382 card.union_disjoint ~> card_Un_disjoint
1385 * Locale hierarchy for abstract orderings and (semi)lattices.
1387 * Complete_Partial_Order.admissible is defined outside the type class
1388 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1389 class predicate assumption or sort constraint when possible.
1392 * Introduce type class "conditionally_complete_lattice": Like a
1393 complete lattice but does not assume the existence of the top and
1394 bottom elements. Allows to generalize some lemmas about reals and
1395 extended reals. Removed SupInf and replaced it by the instantiation
1396 of conditionally_complete_lattice for real. Renamed lemmas about
1397 conditionally-complete lattice from Sup_... to cSup_... and from
1398 Inf_... to cInf_... to avoid hidding of similar complete lattice
1401 * Introduce type class linear_continuum as combination of
1402 conditionally-complete lattices and inner dense linorders which have
1403 more than one element. INCOMPATIBILITY.
1405 * Introduced type classes order_top and order_bot. The old classes top
1406 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1407 Rename bot -> order_bot, top -> order_top
1409 * Introduce type classes "no_top" and "no_bot" for orderings without
1410 top and bottom elements.
1412 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1414 * Complex_Main: Unify and move various concepts from
1415 HOL-Multivariate_Analysis to HOL-Complex_Main.
1417 - Introduce type class (lin)order_topology and
1418 linear_continuum_topology. Allows to generalize theorems about
1419 limits and order. Instances are reals and extended reals.
1421 - continuous and continuos_on from Multivariate_Analysis:
1422 "continuous" is the continuity of a function at a filter. "isCont"
1423 is now an abbrevitation: "isCont x f == continuous (at _) f".
1425 Generalized continuity lemmas from isCont to continuous on an
1428 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1429 compactness of closed intervals on reals. Continuous functions
1430 attain infimum and supremum on compact sets. The inverse of a
1431 continuous function is continuous, when the function is continuous
1434 - connected from Multivariate_Analysis. Use it to prove the
1435 intermediate value theorem. Show connectedness of intervals on
1436 linear_continuum_topology).
1438 - first_countable_topology from Multivariate_Analysis. Is used to
1439 show equivalence of properties on the neighbourhood filter of x and
1440 on all sequences converging to x.
1442 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1443 theorems from Library/FDERIV.thy to Deriv.thy and base the
1444 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1445 which are restricted to sets, i.e. to represent derivatives from
1448 - Removed the within-filter. It is replaced by the principal filter:
1450 F within X = inf F (principal X)
1452 - Introduce "at x within U" as a single constant, "at x" is now an
1453 abbreviation for "at x within UNIV"
1455 - Introduce named theorem collections tendsto_intros,
1456 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1457 in tendsto_intros (or FDERIV_intros) are also available as
1458 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1459 is replaced by a congruence rule. This allows to apply them as
1460 intro rules and then proving equivalence by the simplifier.
1462 - Restructured theories in HOL-Complex_Main:
1464 + Moved RealDef and RComplete into Real
1466 + Introduced Topological_Spaces and moved theorems about
1467 topological spaces, filters, limits and continuity to it
1469 + Renamed RealVector to Real_Vector_Spaces
1471 + Split Lim, SEQ, Series into Topological_Spaces,
1472 Real_Vector_Spaces, and Limits
1474 + Moved Ln and Log to Transcendental
1476 + Moved theorems about continuity from Deriv to Topological_Spaces
1478 - Remove various auxiliary lemmas.
1483 - Added option "spy".
1484 - Reduce incidence of "too high arity" errors.
1488 isar_shrink ~> isar_compress
1490 - Added options "isar_try0", "spy".
1491 - Better support for "isar_proofs".
1492 - MaSh has been fined-tuned and now runs as a local server.
1494 * Improved support for ad hoc overloading of constants (see also
1495 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1497 * Library/Polynomial.thy:
1498 - Use lifting for primitive definitions.
1499 - Explicit conversions from and to lists of coefficients, used for
1501 - Replaced recursion operator poly_rec by fold_coeffs.
1502 - Prefer pre-existing gcd operation for gcd.
1504 poly_eq_iff ~> poly_eq_poly_eq_iff
1505 poly_ext ~> poly_eqI
1506 expand_poly_eq ~> poly_eq_iff
1509 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1510 case_of_simps to convert function definitions between a list of
1511 equations with patterns on the lhs and a single equation with case
1512 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1514 * New Library/FSet.thy: type of finite sets defined as a subtype of
1515 sets defined by Lifting/Transfer.
1517 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1519 * Consolidation of library theories on product orders:
1521 Product_Lattice ~> Product_Order -- pointwise order on products
1522 Product_ord ~> Product_Lexorder -- lexicographic order on products
1526 * Imperative-HOL: The MREC combinator is considered legacy and no
1527 longer included by default. INCOMPATIBILITY, use partial_function
1528 instead, or import theory Legacy_Mrec as a fallback.
1530 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1531 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1532 ~~/src/HOL/Library/Polynomial instead. The latter provides
1533 integration with HOL's type classes for rings. INCOMPATIBILITY.
1536 - Various improvements to BNF-based (co)datatype package, including
1537 new commands "primrec_new", "primcorec", and
1538 "datatype_new_compat", as well as documentation. See
1539 "datatypes.pdf" for details.
1540 - New "coinduction" method to avoid some boilerplate (compared to
1543 data ~> datatype_new
1544 codata ~> codatatype
1546 - Renamed many generated theorems, including
1548 map_comp' ~> map_comp
1558 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1559 "check_property" allows to check specifications of the form "ALL x y
1560 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1561 Examples.thy in particular.
1563 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1564 tracing output in the command transaction context instead of physical
1565 stdout. See also Toplevel.debug, Toplevel.debugging and
1566 ML_Compiler.exn_trace.
1568 * ML type "theory" is now immutable, without any special treatment of
1569 drafts or linear updates (which could lead to "stale theory" errors in
1570 the past). Discontinued obsolete operations like Theory.copy,
1571 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1574 * More uniform naming of goal functions for skipped proofs:
1576 Skip_Proof.prove ~> Goal.prove_sorry
1577 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1579 Minor INCOMPATIBILITY.
1581 * Simplifier tactics and tools use proper Proof.context instead of
1582 historic type simpset. Old-style declarations like addsimps,
1583 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1584 retains its use as snapshot of the main Simplifier context, using
1585 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1586 old tools by making them depend on (ctxt : Proof.context) instead of
1587 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1589 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1590 operate on Proof.context instead of claset, for uniformity with addIs,
1591 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1592 clasets separately from the context.
1594 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1595 INCOMPATIBILITY, use @{context} instead.
1597 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1598 presents the result as initial Proof.context.
1603 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1604 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1606 * Discontinued obsolete isabelle-process options -f and -u (former
1607 administrative aliases of option -e). Minor INCOMPATIBILITY.
1609 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1612 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1613 document formats: dvi.gz, ps, ps.gz -- the default document format is
1616 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1617 specify global resources of the JVM process run by isabelle build.
1619 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1620 to run Isabelle/Scala source files as standalone programs.
1622 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1623 keyword tables): use Isabelle/Scala operations, which inspect outer
1624 syntax without requiring to build sessions first.
1626 * Sessions may be organized via 'chapter' specifications in the ROOT
1627 file, which determines a two-level hierarchy of browser info. The old
1628 tree-like organization via implicit sub-session relation (with its
1629 tendency towards erratic fluctuation of URLs) has been discontinued.
1630 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1631 for HTML presentation of theories.
1635 New in Isabelle2013 (February 2013)
1636 -----------------------------------
1640 * Theorem status about oracles and unfinished/failed future proofs is
1641 no longer printed by default, since it is incompatible with
1642 incremental / parallel checking of the persistent document model. ML
1643 function Thm.peek_status may be used to inspect a snapshot of the
1644 ongoing evaluation process. Note that in batch mode --- notably
1645 isabelle build --- the system ensures that future proofs of all
1646 accessible theorems in the theory context are finished (as before).
1648 * Configuration option show_markup controls direct inlining of markup
1649 into the printed representation of formal entities --- notably type
1650 and sort constraints. This enables Prover IDE users to retrieve that
1651 information via tooltips in the output window, for example.
1653 * Command 'ML_file' evaluates ML text from a file directly within the
1654 theory, without any predeclaration via 'uses' in the theory header.
1656 * Old command 'use' command and corresponding keyword 'uses' in the
1657 theory header are legacy features and will be discontinued soon.
1658 Tools that load their additional source files may imitate the
1659 'ML_file' implementation, such that the system can take care of
1660 dependencies properly.
1662 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1663 is called fastforce / fast_force_tac already since Isabelle2011-1.
1665 * Updated and extended "isar-ref" and "implementation" manual, reduced
1666 remaining material in old "ref" manual.
1668 * Improved support for auxiliary contexts that indicate block structure
1669 for specifications. Nesting of "context fixes ... context assumes ..."
1670 and "class ... context ...".
1672 * Attribute "consumes" allows a negative value as well, which is
1673 interpreted relatively to the total number of premises of the rule in
1674 the target context. This form of declaration is stable when exported
1675 from a nested 'context' with additional assumptions. It is the
1676 preferred form for definitional packages, notably cases/rules produced
1677 in HOL/inductive and HOL/function.
1679 * More informative error messages for Isar proof commands involving
1680 lazy enumerations (method applications etc.).
1682 * Refined 'help' command to retrieve outer syntax commands according
1683 to name patterns (with clickable results).
1686 *** Prover IDE -- Isabelle/Scala/jEdit ***
1688 * Parallel terminal proofs ('by') are enabled by default, likewise
1689 proofs that are built into packages like 'datatype', 'function'. This
1690 allows to "run ahead" checking the theory specifications on the
1691 surface, while the prover is still crunching on internal
1692 justifications. Unfinished / cancelled proofs are restarted as
1693 required to complete full proof checking eventually.
1695 * Improved output panel with tooltips, hyperlinks etc. based on the
1696 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1697 tooltips leads to some window that supports the same recursively,
1698 which can lead to stacks of tooltips as the semantic document content
1699 is explored. ESCAPE closes the whole stack, individual windows may be
1700 closed separately, or detached to become independent jEdit dockables.
1702 * Improved support for commands that produce graph output: the text
1703 message contains a clickable area to open a new instance of the graph
1706 * More robust incremental parsing of outer syntax (partial comments,
1707 malformed symbols). Changing the balance of open/close quotes and
1708 comment delimiters works more conveniently with unfinished situations
1709 that frequently occur in user interaction.
1711 * More efficient painting and improved reactivity when editing large
1712 files. More scalable management of formal document content.
1714 * Smarter handling of tracing messages: prover process pauses after
1715 certain number of messages per command transaction, with some user
1716 dialog to stop or continue. This avoids swamping the front-end with
1717 potentially infinite message streams.
1719 * More plugin options and preferences, based on Isabelle/Scala. The
1720 jEdit plugin option panel provides access to some Isabelle/Scala
1721 options, including tuning parameters for editor reactivity and color
1724 * Dockable window "Symbols" provides some editing support for Isabelle
1727 * Dockable window "Monitor" shows ML runtime statistics. Note that
1728 continuous display of the chart slows down the system.
1730 * Improved editing support for control styles: subscript, superscript,
1731 bold, reset of style -- operating on single symbols or text
1732 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1734 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1735 adjust the main text area font size, and its derivatives for output,
1736 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1737 need to be adapted to local keyboard layouts.
1739 * More reactive completion popup by default: use \t (TAB) instead of
1740 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1741 also "Plugin Options / SideKick / General / Code Completion Options".
1743 * Implicit check and build dialog of the specified logic session
1744 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1745 demand, without bundling big platform-dependent heap images in the
1746 Isabelle distribution.
1748 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1749 from Oracle provide better multi-platform experience. This version is
1750 now bundled exclusively with Isabelle.
1755 * Code generation for Haskell: restrict unqualified imports from
1756 Haskell Prelude to a small set of fundamental operations.
1758 * Command 'export_code': relative file names are interpreted
1759 relatively to master directory of current theory rather than the
1760 rather arbitrary current working directory. INCOMPATIBILITY.
1762 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1763 use regular rule composition via "OF" / "THEN", or explicit proof
1764 structure instead. Note that Isabelle/ML provides a variety of
1765 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1766 with some care where this is really required.
1768 * Command 'typ' supports an additional variant with explicit sort
1769 constraint, to infer and check the most general type conforming to a
1770 given sort. Example (in HOL):
1772 typ "_ * _ * bool * unit" :: finite
1774 * Command 'locale_deps' visualizes all locales and their relations as
1782 - Added MaSh relevance filter based on machine-learning; see the
1783 Sledgehammer manual for details.
1784 - Polished Isar proofs generated with "isar_proofs" option.
1785 - Rationalized type encodings ("type_enc" option).
1786 - Renamed "kill_provers" subcommand to "kill_all".
1788 isar_proof ~> isar_proofs
1789 isar_shrink_factor ~> isar_shrink
1790 max_relevant ~> max_facts
1791 relevance_thresholds ~> fact_thresholds
1793 * Quickcheck: added an optimisation for equality premises. It is
1794 switched on by default, and can be switched off by setting the
1795 configuration quickcheck_optimise_equality to false.
1797 * Quotient: only one quotient can be defined by quotient_type
1801 - generation of an abstraction function equation in lift_definition
1802 - quot_del attribute
1803 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1805 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1808 * Preprocessing of the code generator rewrites set comprehensions into
1809 pointfree expressions.
1811 * The SMT solver Z3 has now by default a restricted set of directly
1812 supported features. For the full set of features (div/mod, nonlinear
1813 arithmetic, datatypes/records) with potential proof reconstruction
1814 failures, enable the configuration option "z3_with_extensions". Minor
1817 * Simplified 'typedef' specifications: historical options for implicit
1818 set definition and alternative name have been discontinued. The
1819 former behavior of "typedef (open) t = A" is now the default, but
1820 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1823 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1824 directly. INCOMPATIBILITY.
1826 * Moved operation product, sublists and n_lists from theory Enum to
1827 List. INCOMPATIBILITY.
1829 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1831 * Class "comm_monoid_diff" formalises properties of bounded
1832 subtraction, with natural numbers and multisets as typical instances.
1834 * Added combinator "Option.these" with type "'a option set => 'a set".
1836 * Theory "Transitive_Closure": renamed lemmas
1838 reflcl_tranclp -> reflclp_tranclp
1839 rtranclp_reflcl -> rtranclp_reflclp
1843 * Theory "Rings": renamed lemmas (in class semiring)
1845 left_distrib ~> distrib_right
1846 right_distrib ~> distrib_left
1850 * Generalized the definition of limits:
1852 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1853 expresses that when the input values x converge to F then the
1854 output f x converges to G.
1856 - Added filters for convergence to positive (at_top) and negative
1859 - Moved infinity in the norm (at_infinity) from
1860 Multivariate_Analysis to Complex_Main.
1862 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1867 * Theory "Library/Option_ord" provides instantiation of option type to
1868 lattice type classes.
1870 * Theory "Library/Multiset": renamed
1872 constant fold_mset ~> Multiset.fold
1873 fact fold_mset_commute ~> fold_mset_comm
1877 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1880 - Renamed constants (and related lemmas)
1883 strict_prefix ~> prefix
1885 - Replaced constant "postfix" by "suffixeq" with swapped argument
1886 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1887 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1888 Renamed lemmas accordingly.
1890 - Added constant "list_hembeq" for homeomorphic embedding on
1891 lists. Added abbreviation "sublisteq" for special case
1892 "list_hembeq (op =)".
1894 - Theory Library/Sublist no longer provides "order" and "bot" type
1895 class instances for the prefix order (merely corresponding locale
1896 interpretations). The type class instances are now in theory
1897 Library/Prefix_Order.
1899 - The sublist relation of theory Library/Sublist_Order is now based
1900 on "Sublist.sublisteq". Renamed lemmas accordingly:
1902 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1903 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1904 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1905 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1906 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1907 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1908 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1909 le_list_drop_many ~> Sublist.sublisteq_drop_many
1910 le_list_filter_left ~> Sublist.sublisteq_filter_left
1911 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1912 le_list_rev_take_iff ~> Sublist.sublisteq_append
1913 le_list_same_length ~> Sublist.sublisteq_same_length
1914 le_list_take_many_iff ~> Sublist.sublisteq_append'
1915 less_eq_list.drop ~> less_eq_list_drop
1916 less_eq_list.induct ~> less_eq_list_induct
1917 not_le_list_length ~> Sublist.not_sublisteq_length
1921 * New theory Library/Countable_Set.
1923 * Theory Library/Debug and Library/Parallel provide debugging and
1924 parallel execution for code generated towards Isabelle/ML.
1926 * Theory Library/FuncSet: Extended support for Pi and extensional and
1927 introduce the extensional dependent function space "PiE". Replaced
1928 extensional_funcset by an abbreviation, and renamed lemmas from
1929 extensional_funcset to PiE as follows:
1931 extensional_empty ~> PiE_empty
1932 extensional_funcset_empty_domain ~> PiE_empty_domain
1933 extensional_funcset_empty_range ~> PiE_empty_range
1934 extensional_funcset_arb ~> PiE_arb
1935 extensional_funcset_mem ~> PiE_mem
1936 extensional_funcset_extend_domainI ~> PiE_fun_upd
1937 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1938 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1939 card_extensional_funcset ~> card_PiE
1940 finite_extensional_funcset ~> finite_PiE
1944 * Theory Library/FinFun: theory of almost everywhere constant
1945 functions (supersedes the AFP entry "Code Generation for Functions as
1948 * Theory Library/Phantom: generic phantom type to make a type
1949 parameter appear in a constant's type. This alternative to adding
1950 TYPE('a) as another parameter avoids unnecessary closures in generated
1953 * Theory Library/RBT_Impl: efficient construction of red-black trees
1954 from sorted associative lists. Merging two trees with rbt_union may
1955 return a structurally different tree than before. Potential
1958 * Theory Library/IArray: immutable arrays with code generation.
1960 * Theory Library/Finite_Lattice: theory of finite lattices.
1962 * HOL/Multivariate_Analysis: replaced
1964 "basis :: 'a::euclidean_space => nat => real"
1965 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1967 on euclidean spaces by using the inner product "_ \<bullet> _" with
1968 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1969 "SUM i : Basis. f i * r i".
1971 With this change the following constants are also changed or removed:
1973 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1974 a $$ i ~> inner a i (where i : Basis)
1976 \<pi>, \<pi>' removed
1978 Theorems about these constants where removed.
1982 component_le_norm ~> Basis_le_norm
1983 euclidean_eq ~> euclidean_eq_iff
1984 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1985 euclidean_simps ~> inner_simps
1986 independent_basis ~> independent_Basis
1987 span_basis ~> span_Basis
1988 in_span_basis ~> in_span_Basis
1989 norm_bound_component_le ~> norm_boound_Basis_le
1990 norm_bound_component_lt ~> norm_boound_Basis_lt
1991 component_le_infnorm ~> Basis_le_infnorm
1997 - Added simproc "measurable" to automatically prove measurability.
1999 - Added induction rules for sigma sets with disjoint union
2000 (sigma_sets_induct_disjoint) and for Borel-measurable functions
2001 (borel_measurable_induct).
2003 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
2006 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
2007 AFP entry "Ordinals_and_Cardinals").
2009 * HOL/BNF: New (co)datatype package based on bounded natural functors
2010 with support for mixed, nested recursion and interesting non-free
2013 * HOL/Finite_Set and Relation: added new set and relation operations
2014 expressed by Finite_Set.fold.
2016 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
2017 trees for the code generator.
2019 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
2021 possible INCOMPATIBILITY.
2023 * HOL/Set: renamed Set.project -> Set.filter
2027 *** Document preparation ***
2029 * Dropped legacy antiquotations "term_style" and "thm_style", since
2030 styles may be given as arguments to "term" and "thm" already.
2031 Discontinued legacy styles "prem1" .. "prem19".
2033 * Default LaTeX rendering for \<euro> is now based on eurosym package,
2034 instead of slightly exotic babel/greek.
2036 * Document variant NAME may use different LaTeX entry point
2037 document/root_NAME.tex if that file exists, instead of the common
2040 * Simplified custom document/build script, instead of old-style
2041 document/IsaMakefile. Minor INCOMPATIBILITY.
2046 * The default limit for maximum number of worker threads is now 8,
2047 instead of 4, in correspondence to capabilities of contemporary
2048 hardware and Poly/ML runtime system.
2050 * Type Seq.results and related operations support embedded error
2051 messages within lazy enumerations, and thus allow to provide
2052 informative errors in the absence of any usable results.
2054 * Renamed Position.str_of to Position.here to emphasize that this is a
2055 formal device to inline positions into message text, but not
2056 necessarily printing visible text.
2061 * Advanced support for Isabelle sessions and build management, see
2062 "system" manual for the chapter of that name, especially the "isabelle
2063 build" tool and its examples. The "isabelle mkroot" tool prepares
2064 session root directories for use with "isabelle build", similar to
2065 former "isabelle mkdir" for "isabelle usedir". Note that this affects
2066 document preparation as well. INCOMPATIBILITY, isabelle usedir /
2067 mkdir / make are rendered obsolete.
2069 * Discontinued obsolete Isabelle/build script, it is superseded by the
2070 regular isabelle build tool. For example:
2072 isabelle build -s -b HOL
2074 * Discontinued obsolete "isabelle makeall".
2076 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
2077 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
2078 provides some traditional targets that invoke "isabelle build". Note
2079 that this is inefficient! Applications of Isabelle/HOL involving
2080 "isabelle make" should be upgraded to use "isabelle build" directly.
2082 * The "isabelle options" tool prints Isabelle system options, as
2083 required for "isabelle build", for example.
2085 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2086 Minor INCOMPATIBILITY in command-line options.
2088 * The "isabelle install" tool has now a simpler command-line. Minor
2091 * The "isabelle components" tool helps to resolve add-on components
2092 that are not bundled, or referenced from a bare-bones repository
2093 version of Isabelle.
2095 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2096 platform family: "linux", "macos", "windows".
2098 * The ML system is configured as regular component, and no longer
2099 picked up from some surrounding directory. Potential INCOMPATIBILITY
2100 for home-made settings.
2102 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2104 * Discontinued support for Poly/ML 5.2.1, which was the last version
2105 without exception positions and advanced ML compiler/toplevel
2108 * Discontinued special treatment of Proof General -- no longer guess
2109 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2110 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2111 settings manually, or use a Proof General version that has been
2112 bundled as Isabelle component.
2116 New in Isabelle2012 (May 2012)
2117 ------------------------------
2121 * Prover IDE (PIDE) improvements:
2123 - more robust Sledgehammer integration (as before the sledgehammer
2124 command-line needs to be typed into the source buffer)
2125 - markup for bound variables
2126 - markup for types of term variables (displayed as tooltips)
2127 - support for user-defined Isar commands within the running session
2128 - improved support for Unicode outside original 16bit range
2129 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2131 * Forward declaration of outer syntax keywords within the theory
2132 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2133 commands to be used in the same theory where defined.
2135 * Auxiliary contexts indicate block structure for specifications with
2136 additional parameters and assumptions. Such unnamed contexts may be
2137 nested within other targets, like 'theory', 'locale', 'class',
2138 'instantiation' etc. Results from the local context are generalized
2139 accordingly and applied to the enclosing target context. Example:
2143 assumes xy: "x = y" and yz: "y = z"
2146 lemma my_trans: "x = z" using xy yz by simp
2152 The most basic application is to factor-out context elements of
2153 several fixes/assumes/shows theorem statements, e.g. see
2154 ~~/src/HOL/Isar_Examples/Group_Context.thy
2156 Any other local theory specification element works within the "context
2157 ... begin ... end" block as well.
2159 * Bundled declarations associate attributed fact expressions with a
2160 given name in the context. These may be later included in other
2161 contexts. This allows to manage context extensions casually, without
2162 the logical dependencies of locales and locale interpretation. See
2163 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2165 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2166 declaration, and results are standardized before being stored. Thus
2167 old-style "standard" after instantiation or composition of facts
2168 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2169 indices of schematic variables.
2171 * Rule attributes in local theory declarations (e.g. locale or class)
2172 are now statically evaluated: the resulting theorem is stored instead
2173 of the original expression. INCOMPATIBILITY in rare situations, where
2174 the historic accident of dynamic re-evaluation in interpretations
2177 * New tutorial "Programming and Proving in Isabelle/HOL"
2178 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2179 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2180 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2181 Logic" as the recommended beginners tutorial, but does not cover all
2182 of the material of that old tutorial.
2184 * Updated and extended reference manuals: "isar-ref",
2185 "implementation", "system"; reduced remaining material in old "ref"
2191 * Command 'definition' no longer exports the foundational "raw_def"
2192 into the user context. Minor INCOMPATIBILITY, may use the regular
2193 "def" result with attribute "abs_def" to imitate the old version.
2195 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2196 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2197 expand it. This also works for object-logic equality. (Formerly
2198 undocumented feature.)
2200 * Sort constraints are now propagated in simultaneous statements, just
2201 like type constraints. INCOMPATIBILITY in rare situations, where
2202 distinct sorts used to be assigned accidentally. For example:
2204 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2206 lemma "P (x::'a)" and "Q (y::'a::bar)"
2207 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2209 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2210 tolerant against multiple unifiers, as long as the final result is
2211 unique. (As before, rules are composed in canonical right-to-left
2212 order to accommodate newly introduced premises.)
2214 * Renamed some inner syntax categories:
2220 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2221 "num_position" etc. are mainly used instead (which also include
2222 position information via constraints).
2224 * Simplified configuration options for syntax ambiguity: see
2225 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2226 manual. Minor INCOMPATIBILITY.
2228 * Discontinued configuration option "syntax_positions": atomic terms
2229 in parse trees are always annotated by position constraints.
2231 * Old code generator for SML and its commands 'code_module',
2232 'code_library', 'consts_code', 'types_code' have been discontinued.
2233 Use commands of the generic code generator instead. INCOMPATIBILITY.
2235 * Redundant attribute "code_inline" has been discontinued. Use
2236 "code_unfold" instead. INCOMPATIBILITY.
2238 * Dropped attribute "code_unfold_post" in favor of the its dual
2239 "code_abbrev", which yields a common pattern in definitions like
2241 definition [code_abbrev]: "f = t"
2245 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2246 instead. INCOMPATIBILITY.
2248 * Discontinued old "prems" fact, which used to refer to the accidental
2249 collection of foundational premises in the context (already marked as
2250 legacy since Isabelle2011).
2255 * Type 'a set is now a proper type constructor (just as before
2256 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2257 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2258 sets separate, it is often sufficient to rephrase some set S that has
2259 been accidentally used as predicates by "%x. x : S", and some
2260 predicate P that has been accidentally used as set by "{x. P x}".
2261 Corresponding proofs in a first step should be pruned from any
2262 tinkering with former theorems mem_def and Collect_def as far as
2265 For developments which deliberately mix predicates and sets, a
2266 planning step is necessary to determine what should become a predicate
2267 and what a set. It can be helpful to carry out that step in
2268 Isabelle2011-1 before jumping right into the current release.
2270 * Code generation by default implements sets as container type rather
2271 than predicates. INCOMPATIBILITY.
2273 * New type synonym 'a rel = ('a * 'a) set
2275 * The representation of numerals has changed. Datatype "num"
2276 represents strictly positive binary numerals, along with functions
2277 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2278 positive and negated numeric literals, respectively. See also
2279 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2280 user theories may require adaptations as follows:
2282 - Theorems with number_ring or number_semiring constraints: These
2283 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2285 - Theories defining numeric types: Remove number, number_semiring,
2286 and number_ring instances. Defer all theorems about numerals until
2287 after classes one and semigroup_add have been instantiated.
2289 - Numeral-only simp rules: Replace each rule having a "number_of v"
2290 pattern with two copies, one for numeral and one for neg_numeral.
2292 - Theorems about subclasses of semiring_1 or ring_1: These classes
2293 automatically support numerals now, so more simp rules and
2294 simprocs may now apply within the proof.
2296 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2297 Redefine using other integer operations.
2299 * Transfer: New package intended to generalize the existing
2300 "descending" method and related theorem attributes from the Quotient
2301 package. (Not all functionality is implemented yet, but future
2302 development will focus on Transfer as an eventual replacement for the
2303 corresponding parts of the Quotient package.)
2305 - transfer_rule attribute: Maintains a collection of transfer rules,
2306 which relate constants at two different types. Transfer rules may
2307 relate different type instances of the same polymorphic constant,
2308 or they may relate an operation on a raw type to a corresponding
2309 operation on an abstract type (quotient or subtype). For example:
2311 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2312 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2314 - transfer method: Replaces a subgoal on abstract types with an
2315 equivalent subgoal on the corresponding raw types. Constants are
2316 replaced with corresponding ones according to the transfer rules.
2317 Goals are generalized over all free variables by default; this is
2318 necessary for variables whose types change, but can be overridden
2319 for specific variables with e.g. "transfer fixing: x y z". The
2320 variant transfer' method allows replacing a subgoal with one that
2321 is logically stronger (rather than equivalent).
2323 - relator_eq attribute: Collects identity laws for relators of
2324 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2325 transfer method uses these lemmas to infer transfer rules for
2326 non-polymorphic constants on the fly.
2328 - transfer_prover method: Assists with proving a transfer rule for a
2329 new constant, provided the constant is defined in terms of other
2330 constants that already have transfer rules. It should be applied
2331 after unfolding the constant definitions.
2333 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2334 from type nat to type int.
2336 * Lifting: New package intended to generalize the quotient_definition
2337 facility of the Quotient package; designed to work with Transfer.
2339 - lift_definition command: Defines operations on an abstract type in
2340 terms of a corresponding operation on a representation
2341 type. Example syntax:
2343 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2346 Users must discharge a respectfulness proof obligation when each
2347 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2348 the proof is discharged automatically.) The obligation is
2349 presented in a user-friendly, readable form; a respectfulness
2350 theorem in the standard format and a transfer rule are generated
2353 - Integration with code_abstype: For typedefs (e.g. subtypes
2354 corresponding to a datatype invariant, such as dlist),
2355 lift_definition generates a code certificate theorem and sets up
2356 code generation for each constant.
2358 - setup_lifting command: Sets up the Lifting package to work with a
2359 user-defined type. The user must provide either a quotient theorem
2360 or a type_definition theorem. The package configures transfer
2361 rules for equality and quantifiers on the type, and sets up the
2362 lift_definition command to work with the type.
2364 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2365 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2366 Word/Word.thy and Library/Float.thy.
2370 - The 'quotient_type' command now supports a 'morphisms' option with
2371 rep and abs functions, similar to typedef.
2373 - 'quotient_type' sets up new types to work with the Lifting and
2374 Transfer packages, as with 'setup_lifting'.
2376 - The 'quotient_definition' command now requires the user to prove a
2377 respectfulness property at the point where the constant is
2378 defined, similar to lift_definition; INCOMPATIBILITY.
2380 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2381 accordingly, INCOMPATIBILITY.
2383 * New diagnostic command 'find_unused_assms' to find potentially
2384 superfluous assumptions in theorems using Quickcheck.
2388 - Quickcheck returns variable assignments as counterexamples, which
2389 allows to reveal the underspecification of functions under test.
2390 For example, refuting "hd xs = x", it presents the variable
2391 assignment xs = [] and x = a1 as a counterexample, assuming that
2392 any property is false whenever "hd []" occurs in it.
2394 These counterexample are marked as potentially spurious, as
2395 Quickcheck also returns "xs = []" as a counterexample to the
2396 obvious theorem "hd xs = hd xs".
2398 After finding a potentially spurious counterexample, Quickcheck
2399 continues searching for genuine ones.
2401 By default, Quickcheck shows potentially spurious and genuine
2402 counterexamples. The option "genuine_only" sets quickcheck to only
2403 show genuine counterexamples.
2405 - The command 'quickcheck_generator' creates random and exhaustive
2406 value generators for a given type and operations.
2408 It generates values by using the operations as if they were
2409 constructors of that type.
2411 - Support for multisets.
2413 - Added "use_subtype" options.
2415 - Added "quickcheck_locale" configuration to specify how to process
2416 conjectures in a locale context.
2418 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2419 and affecting 'rat' and 'real'.
2422 - Integrated more tightly with SPASS, as described in the ITP 2012
2423 paper "More SPASS with Isabelle".
2424 - Made it try "smt" as a fallback if "metis" fails or times out.
2425 - Added support for the following provers: Alt-Ergo (via Why3 and
2426 TFF1), iProver, iProver-Eq.
2427 - Sped up the minimizer.
2428 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2429 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2430 - Renamed "sound" option to "strict".
2432 * Metis: Added possibility to specify lambda translations scheme as a
2433 parenthesized argument (e.g., "by (metis (lifting) ...)").
2435 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2437 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2439 * New "case_product" attribute to generate a case rule doing multiple
2440 case distinctions at the same time. E.g.
2442 list.exhaust [case_product nat.exhaust]
2444 produces a rule which can be used to perform case distinction on both
2447 * New "eventually_elim" method as a generalized variant of the
2448 eventually_elim* rules. Supports structured proofs.
2450 * Typedef with implicit set definition is considered legacy. Use
2451 "typedef (open)" form instead, which will eventually become the
2454 * Record: code generation can be switched off manually with
2456 declare [[record_coden = false]] -- "default true"
2458 * Datatype: type parameters allow explicit sort constraints.
2460 * Concrete syntax for case expressions includes constraints for source
2461 positions, and thus produces Prover IDE markup for its bindings.
2462 INCOMPATIBILITY for old-style syntax translations that augment the
2463 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2466 * Clarified attribute "mono_set": pure declaration without modifying
2467 the result of the fact expression.
2469 * More default pred/set conversions on a couple of relation operations
2470 and predicates. Added powers of predicate relations. Consolidation
2471 of some relation theorems:
2473 converse_def ~> converse_unfold
2474 rel_comp_def ~> relcomp_unfold
2475 symp_def ~> (modified, use symp_def and sym_def instead)
2476 transp_def ~> transp_trans
2477 Domain_def ~> Domain_unfold
2478 Range_def ~> Domain_converse [symmetric]
2480 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2482 See theory "Relation" for examples for making use of pred/set
2483 conversions by means of attributes "to_set" and "to_pred".
2487 * Renamed facts about the power operation on relations, i.e., relpow
2488 to match the constant's name:
2490 rel_pow_1 ~> relpow_1
2491 rel_pow_0_I ~> relpow_0_I
2492 rel_pow_Suc_I ~> relpow_Suc_I
2493 rel_pow_Suc_I2 ~> relpow_Suc_I2
2494 rel_pow_0_E ~> relpow_0_E
2495 rel_pow_Suc_E ~> relpow_Suc_E
2496 rel_pow_E ~> relpow_E
2497 rel_pow_Suc_D2 ~> relpow_Suc_D2
2498 rel_pow_Suc_E2 ~> relpow_Suc_E2
2499 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2500 rel_pow_E2 ~> relpow_E2
2501 rel_pow_add ~> relpow_add
2502 rel_pow_commute ~> relpow
2503 rel_pow_empty ~> relpow_empty:
2504 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2505 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2506 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2507 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2508 rel_pow_fun_conv ~> relpow_fun_conv
2509 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2510 rel_pow_finite_bounded ~> relpow_finite_bounded
2511 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2512 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2513 single_valued_rel_pow ~> single_valued_relpow
2517 * Theory Relation: Consolidated constant name for relation composition
2518 and corresponding theorem names:
2520 - Renamed constant rel_comp to relcomp.
2522 - Dropped abbreviation pred_comp. Use relcompp instead.
2526 rel_compI ~> relcompI
2527 rel_compEpair ~> relcompEpair
2528 rel_compE ~> relcompE
2529 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2530 rel_comp_empty1 ~> relcomp_empty1
2531 rel_comp_mono ~> relcomp_mono
2532 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2533 rel_comp_distrib ~> relcomp_distrib
2534 rel_comp_distrib2 ~> relcomp_distrib2
2535 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2536 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2537 single_valued_rel_comp ~> single_valued_relcomp
2538 rel_comp_def ~> relcomp_unfold
2539 converse_rel_comp ~> converse_relcomp
2540 pred_compI ~> relcomppI
2541 pred_compE ~> relcomppE
2542 pred_comp_bot1 ~> relcompp_bot1
2543 pred_comp_bot2 ~> relcompp_bot2
2544 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2545 pred_comp_mono ~> relcompp_mono
2546 pred_comp_distrib ~> relcompp_distrib
2547 pred_comp_distrib2 ~> relcompp_distrib2
2548 converse_pred_comp ~> converse_relcompp
2550 finite_rel_comp ~> finite_relcomp
2552 set_rel_comp ~> set_relcomp
2556 * Theory Divides: Discontinued redundant theorems about div and mod.
2557 INCOMPATIBILITY, use the corresponding generic theorems instead.
2559 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2560 zdiv_self ~> div_self
2561 zmod_self ~> mod_self
2564 zdiv_zmod_equality ~> div_mod_equality2
2565 zdiv_zmod_equality2 ~> div_mod_equality
2566 zmod_zdiv_trivial ~> mod_div_trivial
2567 zdiv_zminus_zminus ~> div_minus_minus
2568 zmod_zminus_zminus ~> mod_minus_minus
2569 zdiv_zminus2 ~> div_minus_right
2570 zmod_zminus2 ~> mod_minus_right
2571 zdiv_minus1_right ~> div_minus1_right
2572 zmod_minus1_right ~> mod_minus1_right
2573 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2574 zmod_zmult1_eq ~> mod_mult_right_eq
2575 zpower_zmod ~> power_mod
2576 zdvd_zmod ~> dvd_mod
2577 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2578 mod_mult_distrib ~> mult_mod_left
2579 mod_mult_distrib2 ~> mult_mod_right
2581 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2582 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2584 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2586 * Consolidated theorem names concerning fold combinators:
2588 inf_INFI_fold_inf ~> inf_INF_fold_inf
2589 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2590 INFI_fold_inf ~> INF_fold_inf
2591 SUPR_fold_sup ~> SUP_fold_sup
2592 union_set ~> union_set_fold
2593 minus_set ~> minus_set_fold
2594 INFI_set_fold ~> INF_set_fold
2595 SUPR_set_fold ~> SUP_set_fold
2596 INF_code ~> INF_set_foldr
2597 SUP_code ~> SUP_set_foldr
2598 foldr.simps ~> foldr.simps (in point-free formulation)
2599 foldr_fold_rev ~> foldr_conv_fold
2600 foldl_fold ~> foldl_conv_fold
2601 foldr_foldr ~> foldr_conv_foldl
2602 foldl_foldr ~> foldl_conv_foldr
2603 fold_set_remdups ~> fold_set_fold_remdups
2604 fold_set ~> fold_set_fold
2605 fold1_set ~> fold1_set_fold
2609 * Dropped rarely useful theorems concerning fold combinators:
2610 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2611 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2612 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2613 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2614 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2615 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2616 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2617 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2618 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2619 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2621 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2622 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2623 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2624 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2625 lemmas over fold rather than foldr, or make use of lemmas
2626 fold_conv_foldr and fold_rev.
2628 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2629 through option types.
2631 * "Transitive_Closure.ntrancl": bounded transitive closure on
2634 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2636 * Theory Int: Discontinued many legacy theorems specific to type int.
2637 INCOMPATIBILITY, use the corresponding generic theorems instead.
2639 zminus_zminus ~> minus_minus
2640 zminus_0 ~> minus_zero
2641 zminus_zadd_distrib ~> minus_add_distrib
2642 zadd_commute ~> add_commute
2643 zadd_assoc ~> add_assoc
2644 zadd_left_commute ~> add_left_commute
2647 zadd_0 ~> add_0_left
2648 zadd_0_right ~> add_0_right
2649 zadd_zminus_inverse2 ~> left_minus
2650 zmult_zminus ~> mult_minus_left
2651 zmult_commute ~> mult_commute
2652 zmult_assoc ~> mult_assoc
2653 zadd_zmult_distrib ~> left_distrib
2654 zadd_zmult_distrib2 ~> right_distrib
2655 zdiff_zmult_distrib ~> left_diff_distrib
2656 zdiff_zmult_distrib2 ~> right_diff_distrib
2657 zmult_1 ~> mult_1_left
2658 zmult_1_right ~> mult_1_right
2659 zle_refl ~> order_refl
2660 zle_trans ~> order_trans
2661 zle_antisym ~> order_antisym
2662 zle_linear ~> linorder_linear
2663 zless_linear ~> linorder_less_linear
2664 zadd_left_mono ~> add_left_mono
2665 zadd_strict_right_mono ~> add_strict_right_mono
2666 zadd_zless_mono ~> add_less_le_mono
2667 int_0_less_1 ~> zero_less_one
2668 int_0_neq_1 ~> zero_neq_one
2670 zpower_zadd_distrib ~> power_add
2671 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2672 zero_le_zpower_abs ~> zero_le_power_abs
2674 * Theory Deriv: Renamed
2676 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2678 * Theory Library/Multiset: Improved code generation of multisets.
2680 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2681 are expressed via type classes again. The special syntax
2682 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2683 setsum_set, which is now subsumed by Big_Operators.setsum.
2686 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2687 use theory HOL/Library/Nat_Bijection instead.
2689 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2690 trees is now inside a type class context. Names of affected
2691 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2692 theories working directly with raw red-black trees, adapt the names as
2696 bulkload -> rbt_bulkload
2697 del_from_left -> rbt_del_from_left
2698 del_from_right -> rbt_del_from_right
2700 delete -> rbt_delete
2702 insert -> rbt_insert
2703 insertw -> rbt_insert_with
2704 insert_with_key -> rbt_insert_with_key
2705 map_entry -> rbt_map_entry
2706 lookup -> rbt_lookup
2707 sorted -> rbt_sorted
2708 tree_greater -> rbt_greater
2709 tree_less -> rbt_less
2710 tree_less_symbol -> rbt_less_symbol
2712 union_with -> rbt_union_with
2713 union_with_key -> rbt_union_with_key
2716 balance_left_sorted -> balance_left_rbt_sorted
2717 balance_left_tree_greater -> balance_left_rbt_greater
2718 balance_left_tree_less -> balance_left_rbt_less
2719 balance_right_sorted -> balance_right_rbt_sorted
2720 balance_right_tree_greater -> balance_right_rbt_greater
2721 balance_right_tree_less -> balance_right_rbt_less
2722 balance_sorted -> balance_rbt_sorted
2723 balance_tree_greater -> balance_rbt_greater
2724 balance_tree_less -> balance_rbt_less
2725 bulkload_is_rbt -> rbt_bulkload_is_rbt
2726 combine_sorted -> combine_rbt_sorted
2727 combine_tree_greater -> combine_rbt_greater
2728 combine_tree_less -> combine_rbt_less
2729 delete_in_tree -> rbt_delete_in_tree
2730 delete_is_rbt -> rbt_delete_is_rbt
2731 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2732 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2733 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2734 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2735 del_in_tree -> rbt_del_in_tree
2736 del_inv1_inv2 -> rbt_del_inv1_inv2
2737 del_sorted -> rbt_del_rbt_sorted
2738 del_tree_greater -> rbt_del_rbt_greater
2739 del_tree_less -> rbt_del_rbt_less
2740 dom_lookup_Branch -> dom_rbt_lookup_Branch
2741 entries_lookup -> entries_rbt_lookup
2742 finite_dom_lookup -> finite_dom_rbt_lookup
2743 insert_sorted -> rbt_insert_rbt_sorted
2744 insertw_is_rbt -> rbt_insertw_is_rbt
2745 insertwk_is_rbt -> rbt_insertwk_is_rbt
2746 insertwk_sorted -> rbt_insertwk_rbt_sorted
2747 insertw_sorted -> rbt_insertw_rbt_sorted
2748 ins_sorted -> ins_rbt_sorted
2749 ins_tree_greater -> ins_rbt_greater
2750 ins_tree_less -> ins_rbt_less
2751 is_rbt_sorted -> is_rbt_rbt_sorted
2752 lookup_balance -> rbt_lookup_balance
2753 lookup_bulkload -> rbt_lookup_rbt_bulkload
2754 lookup_delete -> rbt_lookup_rbt_delete
2755 lookup_Empty -> rbt_lookup_Empty
2756 lookup_from_in_tree -> rbt_lookup_from_in_tree
2757 lookup_in_tree -> rbt_lookup_in_tree
2758 lookup_ins -> rbt_lookup_ins
2759 lookup_insert -> rbt_lookup_rbt_insert
2760 lookup_insertw -> rbt_lookup_rbt_insertw
2761 lookup_insertwk -> rbt_lookup_rbt_insertwk
2762 lookup_keys -> rbt_lookup_keys
2763 lookup_map -> rbt_lookup_map
2764 lookup_map_entry -> rbt_lookup_rbt_map_entry
2765 lookup_tree_greater -> rbt_lookup_rbt_greater
2766 lookup_tree_less -> rbt_lookup_rbt_less
2767 lookup_union -> rbt_lookup_rbt_union
2768 map_entry_color_of -> rbt_map_entry_color_of
2769 map_entry_inv1 -> rbt_map_entry_inv1
2770 map_entry_inv2 -> rbt_map_entry_inv2
2771 map_entry_is_rbt -> rbt_map_entry_is_rbt
2772 map_entry_sorted -> rbt_map_entry_rbt_sorted
2773 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2774 map_entry_tree_less -> rbt_map_entry_rbt_less
2775 map_tree_greater -> map_rbt_greater
2776 map_tree_less -> map_rbt_less
2777 map_sorted -> map_rbt_sorted
2778 paint_sorted -> paint_rbt_sorted
2779 paint_lookup -> paint_rbt_lookup
2780 paint_tree_greater -> paint_rbt_greater
2781 paint_tree_less -> paint_rbt_less
2782 sorted_entries -> rbt_sorted_entries
2783 tree_greater_eq_trans -> rbt_greater_eq_trans
2784 tree_greater_nit -> rbt_greater_nit
2785 tree_greater_prop -> rbt_greater_prop
2786 tree_greater_simps -> rbt_greater_simps
2787 tree_greater_trans -> rbt_greater_trans
2788 tree_less_eq_trans -> rbt_less_eq_trans
2789 tree_less_nit -> rbt_less_nit
2790 tree_less_prop -> rbt_less_prop
2791 tree_less_simps -> rbt_less_simps
2792 tree_less_trans -> rbt_less_trans
2793 tree_ord_props -> rbt_ord_props
2794 union_Branch -> rbt_union_Branch
2795 union_is_rbt -> rbt_union_is_rbt
2796 unionw_is_rbt -> rbt_unionw_is_rbt
2797 unionwk_is_rbt -> rbt_unionwk_is_rbt
2798 unionwk_sorted -> rbt_unionwk_rbt_sorted
2800 * Theory HOL/Library/Float: Floating point numbers are now defined as
2801 a subset of the real numbers. All operations are defined using the
2802 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2809 round_down -> float_round_down
2810 round_up -> float_round_up
2814 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2817 abs_float_def -> Float.compute_float_abs
2818 bitlen_ge0 -> bitlen_nonneg
2819 bitlen.simps -> Float.compute_bitlen
2820 float_components -> Float_mantissa_exponent
2821 float_divl.simps -> Float.compute_float_divl
2822 float_divr.simps -> Float.compute_float_divr
2823 float_eq_odd -> mult_powr_eq_mult_powr_iff
2824 float_power -> real_of_float_power
2825 lapprox_posrat_def -> Float.compute_lapprox_posrat
2826 lapprox_rat.simps -> Float.compute_lapprox_rat
2827 le_float_def' -> Float.compute_float_le
2828 le_float_def -> less_eq_float.rep_eq
2829 less_float_def' -> Float.compute_float_less
2830 less_float_def -> less_float.rep_eq
2831 normfloat_def -> Float.compute_normfloat
2832 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2833 normfloat -> normfloat_def
2834 normfloat_unique -> use normfloat_def
2835 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2836 one_float_def -> Float.compute_float_one
2837 plus_float_def -> Float.compute_float_plus
2838 rapprox_posrat_def -> Float.compute_rapprox_posrat
2839 rapprox_rat.simps -> Float.compute_rapprox_rat
2840 real_of_float_0 -> zero_float.rep_eq
2841 real_of_float_1 -> one_float.rep_eq
2842 real_of_float_abs -> abs_float.rep_eq
2843 real_of_float_add -> plus_float.rep_eq
2844 real_of_float_minus -> uminus_float.rep_eq
2845 real_of_float_mult -> times_float.rep_eq
2846 real_of_float_simp -> Float.rep_eq
2847 real_of_float_sub -> minus_float.rep_eq
2848 round_down.simps -> Float.compute_float_round_down
2849 round_up.simps -> Float.compute_float_round_up
2850 times_float_def -> Float.compute_float_times
2851 uminus_float_def -> Float.compute_float_uminus
2852 zero_float_def -> Float.compute_float_zero
2854 Lemmas not necessary anymore, use the transfer method:
2855 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2856 float_divr, float_le_simp, float_less1_mantissa_bound,
2857 float_less_simp, float_less_zero, float_le_zero,
2858 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2859 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2860 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2861 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2862 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2863 round_up, zero_le_float, zero_less_float
2865 * New theory HOL/Library/DAList provides an abstract type for
2866 association lists with distinct keys.
2868 * Session HOL/IMP: Added new theory of abstract interpretation of
2871 * Session HOL-Import: Re-implementation from scratch is faster,
2872 simpler, and more scalable. Requires a proof bundle, which is
2873 available as an external component. Discontinued old (and mostly
2874 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2876 * Session HOL-Word: Discontinued many redundant theorems specific to
2877 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2880 word_sub_alt ~> word_sub_wi
2881 word_add_alt ~> word_add_def
2882 word_mult_alt ~> word_mult_def
2883 word_minus_alt ~> word_minus_def
2884 word_0_alt ~> word_0_wi
2885 word_1_alt ~> word_1_wi
2886 word_add_0 ~> add_0_left
2887 word_add_0_right ~> add_0_right
2888 word_mult_1 ~> mult_1_left
2889 word_mult_1_right ~> mult_1_right
2890 word_add_commute ~> add_commute
2891 word_add_assoc ~> add_assoc
2892 word_add_left_commute ~> add_left_commute
2893 word_mult_commute ~> mult_commute
2894 word_mult_assoc ~> mult_assoc
2895 word_mult_left_commute ~> mult_left_commute
2896 word_left_distrib ~> left_distrib
2897 word_right_distrib ~> right_distrib
2898 word_left_minus ~> left_minus
2899 word_diff_0_right ~> diff_0_right
2900 word_diff_self ~> diff_self
2901 word_sub_def ~> diff_minus
2902 word_diff_minus ~> diff_minus
2903 word_add_ac ~> add_ac
2904 word_mult_ac ~> mult_ac
2905 word_plus_ac0 ~> add_0_left add_0_right add_ac
2906 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2907 word_order_trans ~> order_trans
2908 word_order_refl ~> order_refl
2909 word_order_antisym ~> order_antisym
2910 word_order_linear ~> linorder_linear
2911 lenw1_zero_neq_one ~> zero_neq_one
2912 word_number_of_eq ~> number_of_eq
2913 word_of_int_add_hom ~> wi_hom_add
2914 word_of_int_sub_hom ~> wi_hom_sub
2915 word_of_int_mult_hom ~> wi_hom_mult
2916 word_of_int_minus_hom ~> wi_hom_neg
2917 word_of_int_succ_hom ~> wi_hom_succ
2918 word_of_int_pred_hom ~> wi_hom_pred
2919 word_of_int_0_hom ~> word_0_wi
2920 word_of_int_1_hom ~> word_1_wi
2922 * Session HOL-Word: New proof method "word_bitwise" for splitting
2923 machine word equalities and inequalities into logical circuits,
2924 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2925 multiplication, shifting by constants, bitwise operators and numeric
2926 constants. Requires fixed-length word types, not 'a word. Solves
2927 many standard word identities outright and converts more into first
2928 order problems amenable to blast or similar. See also examples in
2929 HOL/Word/Examples/WordExamples.thy.
2931 * Session HOL-Probability: Introduced the type "'a measure" to
2932 represent measures, this replaces the records 'a algebra and 'a
2933 measure_space. The locales based on subset_class now have two
2934 locale-parameters the space \<Omega> and the set of measurable sets M.
2935 The product of probability spaces uses now the same constant as the
2936 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2937 measure". Most constants are defined now outside of locales and gain
2938 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2939 Measure space constructions for distributions and densities now got
2940 their own constants distr and density. Instead of using locales to
2941 describe measure spaces with a finite space, the measure count_space
2942 and point_measure is introduced. INCOMPATIBILITY.
2946 finite_measure.\<mu>' -> measure
2947 product_algebra_generator -> prod_algebra
2948 product_prob_space.emb -> prod_emb
2949 product_prob_space.infprod_algebra -> PiM
2952 completeable_measure_space
2953 finite_measure_space
2955 finite_product_finite_prob_space
2956 finite_product_sigma_algebra
2957 finite_sigma_algebra
2959 pair_finite_prob_space
2960 pair_finite_sigma_algebra
2963 product_sigma_algebra
2967 distribution -> use distr measure, or distributed predicate
2969 joint_distribution -> use distr measure, or distributed predicate
2970 pair_measure_generator
2971 product_prob_space.infprod_algebra -> use PiM
2974 Replacement theorems:
2975 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2976 finite_measure.empty_measure -> measure_empty
2977 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2978 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2979 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2980 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2981 finite_measure.finite_measure -> finite_measure.emeasure_finite
2982 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2983 finite_measure.positive_measure' -> measure_nonneg
2984 finite_measure.real_measure -> finite_measure.emeasure_real
2985 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2986 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2987 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2988 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2989 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2990 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2991 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2992 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2993 information_space.entropy_commute -> information_space.entropy_commute_simple
2994 information_space.entropy_eq -> information_space.entropy_simple_distributed
2995 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2996 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2997 information_space.entropy_uniform_max -> information_space.entropy_uniform
2998 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2999 information_space.KL_eq_0 -> information_space.KL_same_eq_0
3000 information_space.KL_ge_0 -> information_space.KL_nonneg
3001 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
3002 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
3003 Int_stable_cuboids -> Int_stable_atLeastAtMost
3004 Int_stable_product_algebra_generator -> positive_integral
3005 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
3006 measure_space.additive -> emeasure_additive
3007 measure_space.AE_iff_null_set -> AE_iff_null
3008 measure_space.almost_everywhere_def -> eventually_ae_filter
3009 measure_space.almost_everywhere_vimage -> AE_distrD
3010 measure_space.continuity_from_above -> INF_emeasure_decseq
3011 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
3012 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
3013 measure_space.continuity_from_below -> SUP_emeasure_incseq
3014 measure_space_density -> emeasure_density
3015 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
3016 measure_space.integrable_vimage -> integrable_distr
3017 measure_space.integral_translated_density -> integral_density
3018 measure_space.integral_vimage -> integral_distr
3019 measure_space.measure_additive -> plus_emeasure
3020 measure_space.measure_compl -> emeasure_compl
3021 measure_space.measure_countable_increasing -> emeasure_countable_increasing
3022 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
3023 measure_space.measure_decseq -> decseq_emeasure
3024 measure_space.measure_Diff -> emeasure_Diff
3025 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
3026 measure_space.measure_eq_0 -> emeasure_eq_0
3027 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
3028 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
3029 measure_space.measure_incseq -> incseq_emeasure
3030 measure_space.measure_insert -> emeasure_insert
3031 measure_space.measure_mono -> emeasure_mono
3032 measure_space.measure_not_negative -> emeasure_not_MInf
3033 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
3034 measure_space.measure_setsum -> setsum_emeasure
3035 measure_space.measure_setsum_split -> setsum_emeasure_cover
3036 measure_space.measure_space_vimage -> emeasure_distr
3037 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
3038 measure_space.measure_subadditive -> subadditive
3039 measure_space.measure_top -> emeasure_space
3040 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
3041 measure_space.measure_Un_null_set -> emeasure_Un_null_set
3042 measure_space.positive_integral_translated_density -> positive_integral_density
3043 measure_space.positive_integral_vimage -> positive_integral_distr
3044 measure_space.real_continuity_from_above -> Lim_measure_decseq
3045 measure_space.real_continuity_from_below -> Lim_measure_incseq
3046 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
3047 measure_space.real_measure_Diff -> measure_Diff
3048 measure_space.real_measure_finite_Union -> measure_finite_Union
3049 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
3050 measure_space.real_measure_subadditive -> measure_subadditive
3051 measure_space.real_measure_Union -> measure_Union
3052 measure_space.real_measure_UNION -> measure_UNION
3053 measure_space.simple_function_vimage -> simple_function_comp
3054 measure_space.simple_integral_vimage -> simple_integral_distr
3055 measure_space.simple_integral_vimage -> simple_integral_distr
3056 measure_unique_Int_stable -> measure_eqI_generator_eq
3057 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
3058 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
3059 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
3060 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
3061 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
3062 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
3063 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
3064 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
3065 pair_sigma_algebra.sets_swap -> sets_pair_swap
3066 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
3067 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
3068 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
3069 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
3070 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
3071 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
3072 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
3073 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
3074 prob_space.measure_space_1 -> prob_space.emeasure_space_1
3075 prob_space.prob_space_vimage -> prob_space_distr
3076 prob_space.random_variable_restrict -> measurable_restrict
3077 prob_space_unique_Int_stable -> measure_eqI_prob_space
3078 product_algebraE -> prod_algebraE_all
3079 product_algebra_generator_der -> prod_algebra_eq_finite
3080 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3081 product_algebraI -> sets_PiM_I_finite
3082 product_measure_exists -> product_sigma_finite.sigma_finite
3083 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3084 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3085 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3086 product_prob_space.measurable_component -> measurable_component_singleton
3087 product_prob_space.measurable_emb -> measurable_prod_emb
3088 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3089 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3090 product_prob_space.measure_emb -> emeasure_prod_emb
3091 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3092 product_sigma_algebra.product_algebra_into_space -> space_closed
3093 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3094 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3095 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3096 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3097 sets_product_algebra -> sets_PiM
3098 sigma_algebra.measurable_sigma -> measurable_measure_of
3099 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3100 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3101 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3102 space_product_algebra -> space_PiM
3104 * Session HOL-TPTP: support to parse and import TPTP problems (all
3105 languages) into Isabelle/HOL.
3110 * New "case_product" attribute (see HOL).
3115 * Greater support for structured proofs involving induction or case
3118 * Much greater use of mathematical symbols.
3120 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3125 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3126 from a minor keyword introduced via theory header declaration.
3128 * Antiquotation @{command_spec "name"} produces the
3129 Outer_Syntax.command_spec from a major keyword introduced via theory
3130 header declaration; it can be passed to Outer_Syntax.command etc.
3132 * Local_Theory.define no longer hard-wires default theorem name
3133 "foo_def", but retains the binding as given. If that is Binding.empty
3134 / Attrib.empty_binding, the result is not registered as user-level
3135 fact. The Local_Theory.define_internal variant allows to specify a
3136 non-empty name (used for the foundation in the background theory),
3137 while omitting the fact binding in the user-context. Potential
3138 INCOMPATIBILITY for derived definitional packages: need to specify
3139 naming policy for primitive definitions more explicitly.
3141 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3142 conformance with similar operations in structure Term and Logic.
3144 * Antiquotation @{attributes [...]} embeds attribute source
3145 representation into the ML text, which is particularly useful with
3146 declarations like Local_Theory.note.
3148 * Structure Proof_Context follows standard naming scheme. Old
3149 ProofContext has been discontinued. INCOMPATIBILITY.
3151 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3152 change of semantics: update is applied to auxiliary local theory
3155 * Modernized some old-style infix operations:
3157 addeqcongs ~> Simplifier.add_eqcong
3158 deleqcongs ~> Simplifier.del_eqcong
3159 addcongs ~> Simplifier.add_cong
3160 delcongs ~> Simplifier.del_cong
3161 setmksimps ~> Simplifier.set_mksimps
3162 setmkcong ~> Simplifier.set_mkcong
3163 setmksym ~> Simplifier.set_mksym
3164 setmkeqTrue ~> Simplifier.set_mkeqTrue
3165 settermless ~> Simplifier.set_termless
3166 setsubgoaler ~> Simplifier.set_subgoaler
3167 addsplits ~> Splitter.add_split
3168 delsplits ~> Splitter.del_split
3173 * USER_HOME settings variable points to cross-platform user home
3174 directory, which coincides with HOME on POSIX systems only. Likewise,
3175 the Isabelle path specification "~" now expands to $USER_HOME, instead
3176 of former $HOME. A different default for USER_HOME may be set
3177 explicitly in shell environment, before Isabelle settings are
3178 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3179 the generic user home was intended.
3181 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3182 notation, which is useful for the jEdit file browser, for example.
3184 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3189 New in Isabelle2011-1 (October 2011)
3190 ------------------------------------
3194 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3195 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3197 - Management of multiple theory files directly from the editor
3198 buffer store -- bypassing the file-system (no requirement to save
3199 files for checking).
3201 - Markup of formal entities within the text buffer, with semantic
3202 highlighting, tooltips and hyperlinks to jump to defining source
3205 - Improved text rendering, with sub/superscripts in the source
3206 buffer (including support for copy/paste wrt. output panel, HTML
3207 theory output and other non-Isabelle text boxes).
3209 - Refined scheduling of proof checking and printing of results,
3210 based on interactive editor view. (Note: jEdit folding and
3211 narrowing allows to restrict buffer perspectives explicitly.)
3213 - Reduced CPU performance requirements, usable on machines with few
3216 - Reduced memory requirements due to pruning of unused document
3217 versions (garbage collection).
3219 See also ~~/src/Tools/jEdit/README.html for further information,
3220 including some remaining limitations.
3222 * Theory loader: source files are exclusively located via the master
3223 directory of each theory node (where the .thy file itself resides).
3224 The global load path (such as src/HOL/Library) has been discontinued.
3225 Note that the path element ~~ may be used to reference theories in the
3226 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3229 * Theory loader: source files are identified by content via SHA1
3230 digests. Discontinued former path/modtime identification and optional
3231 ISABELLE_FILE_IDENT plugin scripts.
3233 * Parallelization of nested Isar proofs is subject to
3234 Goal.parallel_proofs_threshold (default 100). See also isabelle
3237 * Name space: former unsynchronized references are now proper
3238 configuration options, with more conventional names:
3240 long_names ~> names_long
3241 short_names ~> names_short
3242 unique_names ~> names_unique
3244 Minor INCOMPATIBILITY, need to declare options in context like this:
3246 declare [[names_unique = false]]
3248 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3249 that the result needs to be unique, which means fact specifications
3250 may have to be refined after enriching a proof context.
3252 * Attribute "case_names" has been refined: the assumptions in each case
3253 can be named now by following the case name with [name1 name2 ...].
3255 * Isabelle/Isar reference manual has been updated and extended:
3256 - "Synopsis" provides a catalog of main Isar language concepts.
3257 - Formal references in syntax diagrams, via @{rail} antiquotation.
3258 - Updated material from classic "ref" manual, notably about
3259 "Classical Reasoner".
3264 * Class bot and top require underlying partial order rather than
3265 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3267 * Class complete_lattice: generalized a couple of lemmas from sets;
3268 generalized theorems INF_cong and SUP_cong. New type classes for
3269 complete boolean algebras and complete linear orders. Lemmas
3270 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3271 class complete_linorder.
3273 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3274 Sup_fun_def, Inf_apply, Sup_apply.
3276 Removed redundant lemmas (the right hand side gives hints how to
3277 replace them for (metis ...), or (simp only: ...) proofs):
3279 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3280 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3281 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3282 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3283 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3284 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3285 Inter_def ~> INF_def, image_def
3286 Union_def ~> SUP_def, image_def
3287 INT_eq ~> INF_def, and image_def
3288 UN_eq ~> SUP_def, and image_def
3289 INF_subset ~> INF_superset_mono [OF _ order_refl]
3291 More consistent and comprehensive names:
3293 INTER_eq_Inter_image ~> INF_def
3294 UNION_eq_Union_image ~> SUP_def
3297 INF_leI ~> INF_lower
3298 INF_leI2 ~> INF_lower2
3299 le_INFI ~> INF_greatest
3300 le_SUPI ~> SUP_upper
3301 le_SUPI2 ~> SUP_upper2
3302 SUP_leI ~> SUP_least
3303 INFI_bool_eq ~> INF_bool_eq
3304 SUPR_bool_eq ~> SUP_bool_eq
3305 INFI_apply ~> INF_apply
3306 SUPR_apply ~> SUP_apply
3307 INTER_def ~> INTER_eq
3308 UNION_def ~> UNION_eq
3312 * Renamed theory Complete_Lattice to Complete_Lattices.
3315 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3316 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3317 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3318 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3320 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3321 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3322 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3325 * Added syntactic classes "inf" and "sup" for the respective
3326 constants. INCOMPATIBILITY: Changes in the argument order of the
3327 (mostly internal) locale predicates for some derived classes.
3329 * Theorem collections ball_simps and bex_simps do not contain theorems
3330 referring to UNION any longer; these have been moved to collection
3331 UN_ball_bex_simps. INCOMPATIBILITY.
3333 * Theory Archimedean_Field: floor now is defined as parameter of a
3334 separate type class floor_ceiling.
3336 * Theory Finite_Set: more coherent development of fold_set locales:
3338 locale fun_left_comm ~> locale comp_fun_commute
3339 locale fun_left_comm_idem ~> locale comp_fun_idem
3341 Both use point-free characterization; interpretation proofs may need
3342 adjustment. INCOMPATIBILITY.
3344 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3345 accordance with standard mathematical terminology. INCOMPATIBILITY.
3347 * Theory Complex_Main: The locale interpretations for the
3348 bounded_linear and bounded_bilinear locales have been removed, in
3349 order to reduce the number of duplicate lemmas. Users must use the
3350 original names for distributivity theorems, potential INCOMPATIBILITY.
3352 divide.add ~> add_divide_distrib
3353 divide.diff ~> diff_divide_distrib
3354 divide.setsum ~> setsum_divide_distrib
3355 mult.add_right ~> right_distrib
3356 mult.diff_right ~> right_diff_distrib
3357 mult_right.setsum ~> setsum_right_distrib
3358 mult_left.diff ~> left_diff_distrib
3360 * Theory Complex_Main: Several redundant theorems have been removed or
3361 replaced by more general versions. INCOMPATIBILITY.
3363 real_diff_def ~> minus_real_def
3364 real_divide_def ~> divide_real_def
3365 real_less_def ~> less_le
3366 real_abs_def ~> abs_real_def
3367 real_sgn_def ~> sgn_real_def
3368 real_mult_commute ~> mult_commute
3369 real_mult_assoc ~> mult_assoc
3370 real_mult_1 ~> mult_1_left
3371 real_add_mult_distrib ~> left_distrib
3372 real_zero_not_eq_one ~> zero_neq_one
3373 real_mult_inverse_left ~> left_inverse
3374 INVERSE_ZERO ~> inverse_zero
3375 real_le_refl ~> order_refl
3376 real_le_antisym ~> order_antisym
3377 real_le_trans ~> order_trans
3378 real_le_linear ~> linear
3379 real_le_eq_diff ~> le_iff_diff_le_0
3380 real_add_left_mono ~> add_left_mono
3381 real_mult_order ~> mult_pos_pos
3382 real_mult_less_mono2 ~> mult_strict_left_mono
3383 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3384 real_0_le_divide_iff ~> zero_le_divide_iff
3385 realpow_two_disj ~> power2_eq_iff
3386 real_squared_diff_one_factored ~> square_diff_one_factored
3387 realpow_two_diff ~> square_diff_square_factored
3388 reals_complete2 ~> complete_real
3389 real_sum_squared_expand ~> power2_sum
3390 exp_ln_eq ~> ln_unique
3392 expi_zero ~> exp_zero
3393 lemma_DERIV_subst ~> DERIV_cong
3394 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3395 LIMSEQ_const ~> tendsto_const
3396 LIMSEQ_norm ~> tendsto_norm
3397 LIMSEQ_add ~> tendsto_add
3398 LIMSEQ_minus ~> tendsto_minus
3399 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3400 LIMSEQ_diff ~> tendsto_diff
3401 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3402 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3403 LIMSEQ_mult ~> tendsto_mult
3404 LIMSEQ_inverse ~> tendsto_inverse
3405 LIMSEQ_divide ~> tendsto_divide
3406 LIMSEQ_pow ~> tendsto_power
3407 LIMSEQ_setsum ~> tendsto_setsum
3408 LIMSEQ_setprod ~> tendsto_setprod
3409 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3410 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3411 LIMSEQ_imp_rabs ~> tendsto_rabs
3412 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3413 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3414 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3415 LIMSEQ_Complex ~> tendsto_Complex
3416 LIM_ident ~> tendsto_ident_at
3417 LIM_const ~> tendsto_const
3418 LIM_add ~> tendsto_add
3419 LIM_add_zero ~> tendsto_add_zero
3420 LIM_minus ~> tendsto_minus
3421 LIM_diff ~> tendsto_diff
3422 LIM_norm ~> tendsto_norm
3423 LIM_norm_zero ~> tendsto_norm_zero
3424 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3425 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3426 LIM_rabs ~> tendsto_rabs
3427 LIM_rabs_zero ~> tendsto_rabs_zero
3428 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3429 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3430 LIM_compose ~> tendsto_compose
3431 LIM_mult ~> tendsto_mult
3432 LIM_scaleR ~> tendsto_scaleR
3433 LIM_of_real ~> tendsto_of_real
3434 LIM_power ~> tendsto_power
3435 LIM_inverse ~> tendsto_inverse
3436 LIM_sgn ~> tendsto_sgn
3437 isCont_LIM_compose ~> isCont_tendsto_compose
3438 bounded_linear.LIM ~> bounded_linear.tendsto
3439 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3440 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3441 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3442 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3443 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3444 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3446 * Theory Complex_Main: The definition of infinite series was
3447 generalized. Now it is defined on the type class {topological_space,
3448 comm_monoid_add}. Hence it is useable also for extended real numbers.
3450 * Theory Complex_Main: The complex exponential function "expi" is now
3451 a type-constrained abbreviation for "exp :: complex => complex"; thus
3452 several polymorphic lemmas about "exp" are now applicable to "expi".
3456 - Theory Library/Code_Char_ord provides native ordering of
3457 characters in the target language.
3459 - Commands code_module and code_library are legacy, use export_code
3462 - Method "evaluation" is legacy, use method "eval" instead.
3464 - Legacy evaluator "SML" is deactivated by default. May be
3465 reactivated by the following theory command:
3467 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3469 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3471 * New proof method "induction" that gives induction hypotheses the
3472 name "IH", thus distinguishing them from further hypotheses that come
3473 from rule induction. The latter are still called "hyps". Method
3474 "induction" is a thin wrapper around "induct" and follows the same
3477 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3478 still available as a legacy feature for some time.
3481 - Added "need" and "total_consts" options.
3482 - Reintroduced "show_skolems" option by popular demand.
3483 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3487 - Use quasi-sound (and efficient) translations by default.
3488 - Added support for the following provers: E-ToFoF, LEO-II,
3489 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3490 - Automatically preplay and minimize proofs before showing them if
3491 this can be done within reasonable time.
3492 - sledgehammer available_provers ~> sledgehammer supported_provers.
3494 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3495 "max_mono_iters", and "max_new_mono_instances" options.
3496 - Removed "explicit_apply" and "full_types" options as well as "Full
3497 Types" Proof General menu item. INCOMPATIBILITY.
3500 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3501 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3505 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3506 "elim:" options. INCOMPATIBILITY.
3507 - Introduced 'try' that not only runs 'try_methods' but also
3508 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3511 - Added "eval" option to evaluate terms for the found counterexample
3512 (currently only supported by the default (exhaustive) tester).
3513 - Added post-processing of terms to obtain readable counterexamples
3514 (currently only supported by the default (exhaustive) tester).
3515 - New counterexample generator quickcheck[narrowing] enables
3516 narrowing-based testing. Requires the Glasgow Haskell compiler
3517 with its installation location defined in the Isabelle settings
3518 environment as ISABELLE_GHC.
3519 - Removed quickcheck tester "SML" based on the SML code generator
3520 (formly in HOL/Library).
3522 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3523 use 'partial_function' instead.
3525 * Theory Library/Extended_Reals replaces now the positive extended
3526 reals found in probability theory. This file is extended by
3527 Multivariate_Analysis/Extended_Real_Limits.
3529 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3530 from where it must be imported explicitly if it is really required.
3533 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3534 been moved here. INCOMPATIBILITY.
3536 * Theory Library/Saturated provides type of numbers with saturated
3539 * Theory Library/Product_Lattice defines a pointwise ordering for the
3540 product type 'a * 'b, and provides instance proofs for various order
3541 and lattice type classes.
3543 * Theory Library/Countable now provides the "countable_datatype" proof
3544 method for proving "countable" class instances for datatypes.
3546 * Theory Library/Cset_Monad allows do notation for computable sets
3547 (cset) via the generic monad ad-hoc overloading facility.
3549 * Library: Theories of common data structures are split into theories
3550 for implementation, an invariant-ensuring type, and connection to an
3551 abstract type. INCOMPATIBILITY.
3553 - RBT is split into RBT and RBT_Mapping.
3554 - AssocList is split and renamed into AList and AList_Mapping.
3555 - DList is split into DList_Impl, DList, and DList_Cset.
3556 - Cset is split into Cset and List_Cset.
3558 * Theory Library/Nat_Infinity has been renamed to
3559 Library/Extended_Nat, with name changes of the following types and
3562 type inat ~> type enat
3564 Infty ~> infinity (overloaded)
3568 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3569 been renamed accordingly. INCOMPATIBILITY.
3571 * Session Multivariate_Analysis: The euclidean_space type class now
3572 fixes a constant "Basis :: 'a set" consisting of the standard
3573 orthonormal basis for the type. Users now have the option of
3574 quantifying over this set instead of using the "basis" function, e.g.
3575 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3577 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3578 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3579 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3580 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3581 changed to match. Definition theorems for overloaded constants now use
3582 the standard "foo_vec_def" naming scheme. A few other theorems have
3583 been renamed as follows (INCOMPATIBILITY):
3585 Cart_eq ~> vec_eq_iff
3586 dist_nth_le_cart ~> dist_vec_nth_le
3587 tendsto_vector ~> vec_tendstoI
3588 Cauchy_vector ~> vec_CauchyI
3590 * Session Multivariate_Analysis: Several duplicate theorems have been
3591 removed, and other theorems have been renamed or replaced with more
3592 general versions. INCOMPATIBILITY.
3594 finite_choice ~> finite_set_choice
3595 eventually_conjI ~> eventually_conj
3596 eventually_and ~> eventually_conj_iff
3597 eventually_false ~> eventually_False
3598 setsum_norm ~> norm_setsum
3599 Lim_sequentially ~> LIMSEQ_def
3600 Lim_ident_at ~> LIM_ident
3601 Lim_const ~> tendsto_const
3602 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3603 Lim_neg ~> tendsto_minus
3604 Lim_add ~> tendsto_add
3605 Lim_sub ~> tendsto_diff
3606 Lim_mul ~> tendsto_scaleR
3607 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3608 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3609 Lim_linear ~> bounded_linear.tendsto
3610 Lim_component ~> tendsto_euclidean_component
3611 Lim_component_cart ~> tendsto_vec_nth
3612 Lim_inner ~> tendsto_inner [OF tendsto_const]
3613 dot_lsum ~> inner_setsum_left
3614 dot_rsum ~> inner_setsum_right
3615 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3616 continuous_neg ~> continuous_minus
3617 continuous_sub ~> continuous_diff
3618 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3619 continuous_mul ~> continuous_scaleR
3620 continuous_inv ~> continuous_inverse
3621 continuous_at_within_inv ~> continuous_at_within_inverse
3622 continuous_at_inv ~> continuous_at_inverse
3623 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3624 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3625 continuous_at_component ~> continuous_component [OF continuous_at_id]
3626 continuous_on_neg ~> continuous_on_minus
3627 continuous_on_sub ~> continuous_on_diff
3628 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3629 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3630 continuous_on_mul ~> continuous_on_scaleR
3631 continuous_on_mul_real ~> continuous_on_mult
3632 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3633 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3634 continuous_on_inverse ~> continuous_on_inv
3635 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3636 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3637 subset_interior ~> interior_mono
3638 subset_closure ~> closure_mono
3639 closure_univ ~> closure_UNIV
3640 real_arch_lt ~> reals_Archimedean2
3641 real_arch ~> reals_Archimedean3
3642 real_abs_norm ~> abs_norm_cancel
3643 real_abs_sub_norm ~> norm_triangle_ineq3
3644 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3646 * Session HOL-Probability:
3647 - Caratheodory's extension lemma is now proved for ring_of_sets.
3648 - Infinite products of probability measures are now available.
3649 - Sigma closure is independent, if the generator is independent
3650 - Use extended reals instead of positive extended
3651 reals. INCOMPATIBILITY.
3653 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3655 expand_fun_below ~> fun_below_iff
3656 below_fun_ext ~> fun_belowI
3657 expand_cfun_eq ~> cfun_eq_iff
3658 ext_cfun ~> cfun_eqI
3659 expand_cfun_below ~> cfun_below_iff
3660 below_cfun_ext ~> cfun_belowI
3661 monofun_fun_fun ~> fun_belowD
3662 monofun_fun_arg ~> monofunE
3663 monofun_lub_fun ~> adm_monofun [THEN admD]
3664 cont_lub_fun ~> adm_cont [THEN admD]
3665 cont2cont_Rep_CFun ~> cont2cont_APP
3666 cont_Rep_CFun_app ~> cont_APP_app
3667 cont_Rep_CFun_app_app ~> cont_APP_app_app
3668 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3669 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3670 contlub_cfun ~> lub_APP [symmetric]
3671 contlub_LAM ~> lub_LAM [symmetric]
3674 lift_distinct1 ~> lift.distinct(1)
3675 lift_distinct2 ~> lift.distinct(2)
3676 Def_not_UU ~> lift.distinct(2)
3677 Def_inject ~> lift.inject
3678 below_UU_iff ~> below_bottom_iff
3679 eq_UU_iff ~> eq_bottom_iff
3682 *** Document preparation ***
3684 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3685 isar-ref manual, both for description and actual application of the
3688 * Antiquotation @{value} evaluates the given term and presents its
3691 * Antiquotations: term style "isub" provides ad-hoc conversion of
3692 variables x1, y23 into subscripted form x\<^isub>1,
3693 y\<^isub>2\<^isub>3.
3695 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3696 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3698 * Localized \isabellestyle switch can be used within blocks or groups
3701 \isabellestyle{it} %preferred default
3702 {\isabellestylett @{text "typewriter stuff"}}
3704 * Discontinued special treatment of hard tabulators. Implicit
3705 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3711 * The inner syntax of sort/type/term/prop supports inlined YXML
3712 representations within quoted string tokens. By encoding logical
3713 entities via Term_XML (in ML or Scala) concrete syntax can be
3714 bypassed, which is particularly useful for producing bits of text
3715 under external program control.
3717 * Antiquotations for ML and document preparation are managed as theory
3718 data, which requires explicit setup.
3720 * Isabelle_Process.is_active allows tools to check if the official
3721 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3722 (better known as Proof General).
3724 * Structure Proof_Context follows standard naming scheme. Old
3725 ProofContext is still available for some time as legacy alias.
3727 * Structure Timing provides various operations for timing; supersedes
3728 former start_timing/end_timing etc.
3730 * Path.print is the official way to show file-system paths to users
3731 (including quotes etc.).
3733 * Inner syntax: identifiers in parse trees of generic categories
3734 "logic", "aprop", "idt" etc. carry position information (disguised as
3735 type constraints). Occasional INCOMPATIBILITY with non-compliant
3736 translations that choke on unexpected type constraints. Positions can
3737 be stripped in ML translations via Syntax.strip_positions /
3738 Syntax.strip_positions_ast, or via the syntax constant
3739 "_strip_positions" within parse trees. As last resort, positions can
3740 be disabled via the configuration option Syntax.positions, which is
3741 called "syntax_positions" in Isar attribute syntax.
3743 * Discontinued special status of various ML structures that contribute
3744 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3745 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3746 refer directly to Ast.Constant, Lexicon.is_identifier,
3747 Syntax_Trans.mk_binder_tr etc.
3749 * Typed print translation: discontinued show_sorts argument, which is
3750 already available via context of "advanced" translation.
3752 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3753 goal states; body tactic needs to address all subgoals uniformly.
3755 * Slightly more special eq_list/eq_set, with shortcut involving
3756 pointer equality (assumes that eq relation is reflexive).
3758 * Classical tactics use proper Proof.context instead of historic types
3759 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3760 operate directly on Proof.context. Raw type claset retains its use as
3761 snapshot of the classical context, which can be recovered via
3762 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3763 INCOMPATIBILITY, classical tactics and derived proof methods require
3764 proper Proof.context.
3769 * Discontinued support for Poly/ML 5.2, which was the last version
3770 without proper multithreading and TimeLimit implementation.
3772 * Discontinued old lib/scripts/polyml-platform, which has been
3773 obsolete since Isabelle2009-2.
3775 * Various optional external tools are referenced more robustly and
3776 uniformly by explicit Isabelle settings as follows:
3778 ISABELLE_CSDP (formerly CSDP_EXE)
3779 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3780 ISABELLE_OCAML (formerly EXEC_OCAML)
3781 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3782 ISABELLE_YAP (formerly EXEC_YAP)
3784 Note that automated detection from the file-system or search path has
3785 been discontinued. INCOMPATIBILITY.
3787 * Scala layer provides JVM method invocation service for static
3788 methods of type (String)String, see Invoke_Scala.method in ML. For
3791 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3793 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3794 this allows to pass structured values between ML and Scala.
3796 * The IsabelleText fonts includes some further glyphs to support the
3797 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3798 installed a local copy (which is normally *not* required) need to
3799 delete or update it from ~~/lib/fonts/.
3803 New in Isabelle2011 (January 2011)
3804 ----------------------------------
3808 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3809 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3810 useful tooltips and hyperlinks produced from its static analysis. The
3811 bundled component provides an executable Isabelle tool that can be run
3814 Isabelle2011/bin/isabelle jedit
3816 * Significantly improved Isabelle/Isar implementation manual.
3818 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3819 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3820 while the default heap location within that directory lacks that extra
3821 suffix. This isolates multiple Isabelle installations from each
3822 other, avoiding problems with old settings in new versions.
3823 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3825 * Source files are always encoded as UTF-8, instead of old-fashioned
3826 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3827 the following package declarations:
3829 \usepackage[utf8]{inputenc}
3830 \usepackage{textcomp}
3832 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3833 a Unicode character is treated as a single symbol, not a sequence of
3834 non-ASCII bytes as before. Since Isabelle/ML string literals may
3835 contain symbols without further backslash escapes, Unicode can now be
3836 used here as well. Recall that Symbol.explode in ML provides a
3837 consistent view on symbols, while raw explode (or String.explode)
3838 merely give a byte-oriented representation.
3840 * Theory loader: source files are primarily located via the master
3841 directory of each theory node (where the .thy file itself resides).
3842 The global load path is still partially available as legacy feature.
3843 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3844 explicit paths, relatively to the theory.
3846 * Special treatment of ML file names has been discontinued.
3847 Historically, optional extensions .ML or .sml were added on demand --
3848 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3849 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3851 * Various options that affect pretty printing etc. are now properly
3852 handled within the context via configuration options, instead of
3853 unsynchronized references or print modes. There are both ML Config.T
3854 entities and Isar declaration attributes to access these.
3856 ML (Config.T) Isar (attribute)
3858 eta_contract eta_contract
3859 show_brackets show_brackets
3860 show_sorts show_sorts
3861 show_types show_types
3862 show_question_marks show_question_marks
3863 show_consts show_consts
3864 show_abbrevs show_abbrevs
3866 Syntax.ast_trace syntax_ast_trace
3867 Syntax.ast_stat syntax_ast_stat
3868 Syntax.ambiguity_level syntax_ambiguity_level
3870 Goal_Display.goals_limit goals_limit
3871 Goal_Display.show_main_goal show_main_goal
3873 Method.rule_trace rule_trace
3875 Thy_Output.display thy_output_display
3876 Thy_Output.quotes thy_output_quotes
3877 Thy_Output.indent thy_output_indent
3878 Thy_Output.source thy_output_source
3879 Thy_Output.break thy_output_break
3881 Note that corresponding "..._default" references in ML may only be
3882 changed globally at the ROOT session setup, but *not* within a theory.
3883 The option "show_abbrevs" supersedes the former print mode
3884 "no_abbrevs" with inverted meaning.
3886 * More systematic naming of some configuration options.
3889 trace_simp ~> simp_trace
3890 debug_simp ~> simp_debug
3892 * Support for real valued configuration options, using simplistic
3893 floating-point notation that coincides with the inner syntax for
3896 * Support for real valued preferences (with approximative PGIP type):
3897 front-ends need to accept "pgint" values in float notation.
3900 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3903 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3908 * Command 'type_synonym' (with single argument) replaces somewhat
3909 outdated 'types', which is still available as legacy feature for some
3912 * Command 'nonterminal' (with 'and' separated list of arguments)
3913 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3915 * Command 'notepad' replaces former 'example_proof' for
3916 experimentation in Isar without any result. INCOMPATIBILITY.
3918 * Locale interpretation commands 'interpret' and 'sublocale' accept
3919 lists of equations to map definitions in a locale to appropriate
3920 entities in the context of the interpretation. The 'interpretation'
3921 command already provided this functionality.
3923 * Diagnostic command 'print_dependencies' prints the locale instances
3924 that would be activated if the specified expression was interpreted in
3925 the current context. Variant "print_dependencies!" assumes a context
3926 without interpretations.
3928 * Diagnostic command 'print_interps' prints interpretations in proofs
3929 in addition to interpretations in theories.
3931 * Discontinued obsolete 'global' and 'local' commands to manipulate
3932 the theory name space. Rare INCOMPATIBILITY. The ML functions
3933 Sign.root_path and Sign.local_path may be applied directly where this
3934 feature is still required for historical reasons.
3936 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3937 'definition' instead.
3939 * The "prems" fact, which refers to the accidental collection of
3940 foundational premises in the context, is now explicitly marked as
3941 legacy feature and will be discontinued soon. Consider using "assms"
3942 of the head statement or reference facts by explicit names.
3944 * Document antiquotations @{class} and @{type} print classes and type
3947 * Document antiquotation @{file} checks file/directory entries within
3948 the local file system.
3953 * Coercive subtyping: functions can be declared as coercions and type
3954 inference will add them as necessary upon input of a term. Theory
3955 Complex_Main declares real :: nat => real and real :: int => real as
3956 coercions. A coercion function f is declared like this:
3958 declare [[coercion f]]
3960 To lift coercions through type constructors (e.g. from nat => real to
3961 nat list => real list), map functions can be declared, e.g.
3963 declare [[coercion_map map]]
3965 Currently coercion inference is activated only in theories including
3966 real numbers, i.e. descendants of Complex_Main. This is controlled by
3967 the configuration option "coercion_enabled", e.g. it can be enabled in
3968 other theories like this:
3970 declare [[coercion_enabled]]
3972 * Command 'partial_function' provides basic support for recursive
3973 function definitions over complete partial orders. Concrete instances
3974 are provided for i) the option type, ii) tail recursion on arbitrary
3975 types, and iii) the heap monad of Imperative_HOL. See
3976 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3979 * Function package: f.psimps rules are no longer implicitly declared
3980 as [simp]. INCOMPATIBILITY.
3982 * Datatype package: theorems generated for executable equality (class
3983 "eq") carry proper names and are treated as default code equations.
3985 * Inductive package: now offers command 'inductive_simps' to
3986 automatically derive instantiated and simplified equations for
3987 inductive predicates, similar to 'inductive_cases'.
3989 * Command 'enriched_type' allows to register properties of the
3990 functorial structure of types.
3992 * Improved infrastructure for term evaluation using code generator
3993 techniques, in particular static evaluation conversions.
3995 * Code generator: Scala (2.8 or higher) has been added to the target
3998 * Code generator: globbing constant expressions "*" and "Theory.*"
3999 have been replaced by the more idiomatic "_" and "Theory._".
4002 * Code generator: export_code without explicit file declaration prints
4003 to standard output. INCOMPATIBILITY.
4005 * Code generator: do not print function definitions for case
4006 combinators any longer.
4008 * Code generator: simplification with rules determined with
4009 src/Tools/Code/code_simp.ML and method "code_simp".
4011 * Code generator for records: more idiomatic representation of record
4012 types. Warning: records are not covered by ancient SML code
4013 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
4014 rep_datatype declaration helps to succeed then:
4018 rep_datatype foo_ext ...
4020 * Records: logical foundation type for records does not carry a
4021 '_type' suffix any longer (obsolete due to authentic syntax).
4024 * Quickcheck now by default uses exhaustive testing instead of random
4025 testing. Random testing can be invoked by "quickcheck [random]",
4026 exhaustive testing by "quickcheck [exhaustive]".
4028 * Quickcheck instantiates polymorphic types with small finite
4029 datatypes by default. This enables a simple execution mechanism to
4030 handle quantifiers and function equality over the finite datatypes.
4032 * Quickcheck random generator has been renamed from "code" to
4033 "random". INCOMPATIBILITY.
4035 * Quickcheck now has a configurable time limit which is set to 30
4036 seconds by default. This can be changed by adding [timeout = n] to the
4037 quickcheck command. The time limit for Auto Quickcheck is still set
4040 * Quickcheck in locales considers interpretations of that locale for
4041 counter example search.
4044 - Added "smt" and "remote_smt" provers based on the "smt" proof
4045 method. See the Sledgehammer manual for details ("isabelle doc
4048 sledgehammer atp_info ~> sledgehammer running_provers
4049 sledgehammer atp_kill ~> sledgehammer kill_provers
4050 sledgehammer available_atps ~> sledgehammer available_provers
4053 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
4054 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
4055 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
4056 (and "ms" and "min" are no longer supported)
4061 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
4062 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
4064 - Added support for partial quotient types.
4065 - Added local versions of the "Nitpick.register_xxx" functions.
4066 - Added "whack" option.
4067 - Allow registration of quotient types as codatatypes.
4068 - Improved "merge_type_vars" option to merge more types.
4069 - Removed unsound "fast_descrs" option.
4070 - Added custom symmetry breaking for datatypes, making it possible to reach
4071 higher cardinalities.
4072 - Prevent the expansion of too large definitions.
4074 * Proof methods "metis" and "meson" now have configuration options
4075 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
4076 to diagnose these tools. E.g.
4078 using [[metis_trace = true]]
4080 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4081 manually as command 'solve_direct'.
4083 * The default SMT solver Z3 must be enabled explicitly (due to
4084 licensing issues) by setting the environment variable
4085 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4086 commercial applications, the SMT solver CVC3 is provided as fall-back;
4087 changing the SMT solver is done via the configuration option
4090 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4091 i.e. "remote_cvc3" and "remote_z3".
4093 * Added basic SMT support for datatypes, records, and typedefs using
4094 the oracle mode (no proofs). Direct support of pairs has been dropped
4095 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4096 support for a similar behavior). Minor INCOMPATIBILITY.
4098 * Changed SMT configuration options:
4100 z3_proofs ~> smt_oracle (with inverted meaning)
4101 z3_trace_assms ~> smt_trace_used_facts
4114 * Boogie output files (.b2i files) need to be declared in the theory
4117 * Simplification procedure "list_to_set_comprehension" rewrites list
4118 comprehensions applied to List.set to set comprehensions. Occasional
4119 INCOMPATIBILITY, may be deactivated like this:
4121 declare [[simproc del: list_to_set_comprehension]]
4123 * Removed old version of primrec package. INCOMPATIBILITY.
4125 * Removed simplifier congruence rule of "prod_case", as has for long
4126 been the case with "split". INCOMPATIBILITY.
4128 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4130 * Removed [split_format ... and ... and ...] version of
4131 [split_format]. Potential INCOMPATIBILITY.
4133 * Predicate "sorted" now defined inductively, with nice induction
4134 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4136 * Constant "contents" renamed to "the_elem", to free the generic name
4137 contents for other uses. INCOMPATIBILITY.
4139 * Renamed class eq and constant eq (for code generation) to class
4140 equal and constant equal, plus renaming of related facts and various
4141 tuning. INCOMPATIBILITY.
4143 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4145 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4148 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4149 avoid confusion with finite sets. INCOMPATIBILITY.
4151 * Abandoned locales equiv, congruent and congruent2 for equivalence
4152 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4155 * Some previously unqualified names have been qualified:
4162 Trueprop ~> HOL.Trueprop
4167 op --> ~> HOL.implies
4179 Pair ~> Product_Type.Pair
4180 fst ~> Product_Type.fst
4181 snd ~> Product_Type.snd
4182 curry ~> Product_Type.curry
4184 Collect ~> Set.Collect
4188 * More canonical naming convention for some fundamental definitions:
4190 bot_bool_eq ~> bot_bool_def
4191 top_bool_eq ~> top_bool_def
4192 inf_bool_eq ~> inf_bool_def
4193 sup_bool_eq ~> sup_bool_def
4194 bot_fun_eq ~> bot_fun_def
4195 top_fun_eq ~> top_fun_def
4196 inf_fun_eq ~> inf_fun_def
4197 sup_fun_eq ~> sup_fun_def
4201 * More stylized fact names:
4203 expand_fun_eq ~> fun_eq_iff
4204 expand_set_eq ~> set_eq_iff
4206 nat_number ~> eval_nat_numeral
4210 * Refactoring of code-generation specific operations in theory List:
4216 mem_iff ~> member_def
4217 null_empty ~> null_def
4219 INCOMPATIBILITY. Note that these were not supposed to be used
4220 regularly unless for striking reasons; their main purpose was code
4223 Various operations from the Haskell prelude are used for generating
4226 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4227 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4228 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4230 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4231 "*" and "+" respectively. INCOMPATIBILITY.
4233 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4234 "Sum_Type.Plus" instead.
4236 * Constant "split" has been merged with constant "prod_case"; names of
4237 ML functions, facts etc. involving split have been retained so far,
4238 though. INCOMPATIBILITY.
4240 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4241 instead. INCOMPATIBILITY.
4243 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4246 * Former theory Library/Enum is now part of the HOL-Main image.
4247 INCOMPATIBILITY: all constants of the Enum theory now have to be
4248 referred to by its qualified name.
4251 nlists ~> Enum.nlists
4252 product ~> Enum.product
4254 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4255 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4258 * Theory Library/SetsAndFunctions has been split into
4259 Library/Function_Algebras and Library/Set_Algebras; canonical names
4260 for instance definitions for functions; various improvements.
4263 * Theory Library/Multiset provides stable quicksort implementation of
4266 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4269 * Session Multivariate_Analysis: introduced a type class for euclidean
4270 space. Most theorems are now stated in terms of euclidean spaces
4271 instead of finite cartesian products.
4274 real ^ 'n ~> 'a::real_vector
4275 ~> 'a::euclidean_space
4276 ~> 'a::ordered_euclidean_space
4277 (depends on your needs)
4281 \<chi> x. _ ~> \<chi>\<chi> x. _
4284 Also note that the indices are now natural numbers and not from some
4285 finite type. Finite cartesian products of euclidean spaces, products
4286 of euclidean spaces the real and complex numbers are instantiated to
4287 be euclidean_spaces. INCOMPATIBILITY.
4289 * Session Probability: introduced pextreal as positive extended real
4290 numbers. Use pextreal as value for measures. Introduce the
4291 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4292 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4293 the integral in Multivariate Analysis. INCOMPATIBILITY.
4295 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4298 * Session SPARK (with image HOL-SPARK) provides commands to load and
4299 prove verification conditions generated by the SPARK Ada program
4300 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4305 * Theorems for additive ring operations (locale abelian_monoid and
4306 descendants) are generated by interpretation from their multiplicative
4307 counterparts. Names (in particular theorem names) have the mandatory
4308 qualifier 'add'. Previous theorem names are redeclared for
4311 * Structure "int_ring" is now an abbreviation (previously a
4312 definition). This fits more natural with advanced interpretations.
4317 * The domain package now runs in definitional mode by default: The
4318 former command 'new_domain' is now called 'domain'. To use the domain
4319 package in its original axiomatic mode, use 'domain (unsafe)'.
4322 * The new class "domain" is now the default sort. Class "predomain"
4323 is an unpointed version of "domain". Theories can be updated by
4324 replacing sort annotations as shown below. INCOMPATIBILITY.
4326 'a::type ~> 'a::countable
4327 'a::cpo ~> 'a::predomain
4328 'a::pcpo ~> 'a::domain
4330 * The old type class "rep" has been superseded by class "domain".
4331 Accordingly, users of the definitional package must remove any
4332 "default_sort rep" declarations. INCOMPATIBILITY.
4334 * The domain package (definitional mode) now supports unpointed
4335 predomain argument types, as long as they are marked 'lazy'. (Strict
4336 arguments must be in class "domain".) For example, the following
4337 domain definition now works:
4339 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4341 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4342 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4343 'a option, and 'a list. Additionally, it configures fixrec and the
4344 domain package to work with these types. For example:
4346 fixrec isInl :: "('a + 'b) u -> tr"
4347 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4349 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4351 * The "(permissive)" option of fixrec has been replaced with a
4352 per-equation "(unchecked)" option. See
4353 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4355 * The "bifinite" class no longer fixes a constant "approx"; the class
4356 now just asserts that such a function exists. INCOMPATIBILITY.
4358 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4359 defines an embedding of type 'a defl into udom by default; instances
4360 of "bifinite" and "domain" classes are available in
4361 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4363 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4365 * The predicate "directed" has been removed. INCOMPATIBILITY.
4367 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4369 * The function "cprod_map" has been renamed to "prod_map".
4372 * The monadic bind operator on each powerdomain has new binder syntax
4373 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4374 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4376 * The infix syntax for binary union on each powerdomain has changed
4377 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4378 syntax. INCOMPATIBILITY.
4380 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4381 still supported as an input translation.
4383 * Renamed some theorems (the original names are also still available).
4385 expand_fun_below ~> fun_below_iff
4386 below_fun_ext ~> fun_belowI
4387 expand_cfun_eq ~> cfun_eq_iff
4388 ext_cfun ~> cfun_eqI
4389 expand_cfun_below ~> cfun_below_iff
4390 below_cfun_ext ~> cfun_belowI
4391 cont2cont_Rep_CFun ~> cont2cont_APP
4393 * The Abs and Rep functions for various types have changed names.
4394 Related theorem names have also changed to match. INCOMPATIBILITY.
4396 Rep_CFun ~> Rep_cfun
4397 Abs_CFun ~> Abs_cfun
4398 Rep_Sprod ~> Rep_sprod
4399 Abs_Sprod ~> Abs_sprod
4400 Rep_Ssum ~> Rep_ssum
4401 Abs_Ssum ~> Abs_ssum
4403 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4404 been renamed to *_bottom_iff. INCOMPATIBILITY.
4406 * Various changes to bisimulation/coinduction with domain package:
4408 - Definitions of "bisim" constants no longer mention definedness.
4409 - With mutual recursion, "bisim" predicate is now curried.
4410 - With mutual recursion, each type gets a separate coind theorem.
4411 - Variable names in bisim_def and coinduct rules have changed.
4415 * Case combinators generated by the domain package for type "foo" are
4416 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4418 * Several theorems have been renamed to more accurately reflect the
4419 names of constants and types involved. INCOMPATIBILITY.
4421 thelub_const ~> lub_const
4422 lub_const ~> is_lub_const
4424 is_lub_lub ~> is_lubD2
4426 unique_lub ~> is_lub_unique
4427 is_ub_lub ~> is_lub_rangeD1
4428 lub_bin_chain ~> is_lub_bin_chain
4429 lub_fun ~> is_lub_fun
4430 thelub_fun ~> lub_fun
4431 thelub_cfun ~> lub_cfun
4432 thelub_Pair ~> lub_Pair
4433 lub_cprod ~> is_lub_prod
4434 thelub_cprod ~> lub_prod
4435 minimal_cprod ~> minimal_prod
4436 inst_cprod_pcpo ~> inst_prod_pcpo
4438 compact_UU ~> compact_bottom
4439 deflation_UU ~> deflation_bottom
4440 finite_deflation_UU ~> finite_deflation_bottom
4442 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4444 sq_ord_less_eq_trans ~> below_eq_trans
4445 sq_ord_eq_less_trans ~> eq_below_trans
4446 refl_less ~> below_refl
4447 trans_less ~> below_trans
4448 antisym_less ~> below_antisym
4449 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4450 box_less ~> box_below
4451 rev_trans_less ~> rev_below_trans
4452 not_less2not_eq ~> not_below2not_eq
4453 less_UU_iff ~> below_UU_iff
4454 flat_less_iff ~> flat_below_iff
4455 adm_less ~> adm_below
4456 adm_not_less ~> adm_not_below
4457 adm_compact_not_less ~> adm_compact_not_below
4458 less_fun_def ~> below_fun_def
4459 expand_fun_less ~> fun_below_iff
4460 less_fun_ext ~> fun_belowI
4461 less_discr_def ~> below_discr_def
4462 discr_less_eq ~> discr_below_eq
4463 less_unit_def ~> below_unit_def
4464 less_cprod_def ~> below_prod_def
4465 prod_lessI ~> prod_belowI
4466 Pair_less_iff ~> Pair_below_iff
4467 fst_less_iff ~> fst_below_iff
4468 snd_less_iff ~> snd_below_iff
4469 expand_cfun_less ~> cfun_below_iff
4470 less_cfun_ext ~> cfun_belowI
4471 injection_less ~> injection_below
4472 less_up_def ~> below_up_def
4473 not_Iup_less ~> not_Iup_below
4474 Iup_less ~> Iup_below
4476 Def_inject_less_eq ~> Def_below_Def
4477 Def_less_is_eq ~> Def_below_iff
4478 spair_less_iff ~> spair_below_iff
4479 less_sprod ~> below_sprod
4480 spair_less ~> spair_below
4481 sfst_less_iff ~> sfst_below_iff
4482 ssnd_less_iff ~> ssnd_below_iff
4483 fix_least_less ~> fix_least_below
4484 dist_less_one ~> dist_below_one
4485 less_ONE ~> below_ONE
4486 ONE_less_iff ~> ONE_below_iff
4487 less_sinlD ~> below_sinlD
4488 less_sinrD ~> below_sinrD
4493 * All constant names are now qualified internally and use proper
4494 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4499 * Antiquotation @{assert} inlines a function bool -> unit that raises
4500 Fail if the argument is false. Due to inlining the source position of
4501 failed assertions is included in the error output.
4503 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4504 text is in practice always evaluated with a stable theory checkpoint.
4505 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4507 * Antiquotation @{theory A} refers to theory A from the ancestry of
4508 the current context, not any accidental theory loader state as before.
4509 Potential INCOMPATIBILITY, subtle change in semantics.
4511 * Syntax.pretty_priority (default 0) configures the required priority
4512 of pretty-printed output and thus affects insertion of parentheses.
4514 * Syntax.default_root (default "any") configures the inner syntax
4515 category (nonterminal symbol) for parsing of terms.
4517 * Former exception Library.UnequalLengths now coincides with
4518 ListPair.UnequalLengths.
4520 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4521 main functionality is provided by structure Simplifier.
4523 * Renamed raw "explode" function to "raw_explode" to emphasize its
4524 meaning. Note that internally to Isabelle, Symbol.explode is used in
4525 almost all situations.
4527 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4528 See implementation manual for further details on exceptions in
4531 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4534 * Renamed structure PureThy to Pure_Thy and moved most of its
4535 operations to structure Global_Theory, to emphasize that this is
4536 rarely-used global-only stuff.
4538 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4539 instead (or tracing for high-volume output).
4541 * Configuration option show_question_marks only affects regular pretty
4542 printing of types and terms, not raw Term.string_of_vname.
4544 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4545 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4546 @{thms} for most purposes.
4548 * ML structure Unsynchronized is never opened, not even in Isar
4549 interaction mode as before. Old Unsynchronized.set etc. have been
4550 discontinued -- use plain := instead. This should be *rare* anyway,
4551 since modern tools always work via official context data, notably
4552 configuration options.
4554 * Parallel and asynchronous execution requires special care concerning
4555 interrupts. Structure Exn provides some convenience functions that
4556 avoid working directly with raw Interrupt. User code must not absorb
4557 interrupts -- intermediate handling (for cleanup etc.) needs to be
4558 followed by re-raising of the original exception. Another common
4559 source of mistakes are "handle _" patterns, which make the meaning of
4560 the program subject to physical effects of the environment.
4564 New in Isabelle2009-2 (June 2010)
4565 ---------------------------------
4569 * Authentic syntax for *all* logical entities (type classes, type
4570 constructors, term constants): provides simple and robust
4571 correspondence between formal entities and concrete syntax. Within
4572 the parse tree / AST representations, "constants" are decorated by
4573 their category (class, type, const) and spelled out explicitly with
4574 their full internal name.
4576 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4577 and translations (translation rules and translation functions in ML).
4578 Some hints on upgrading:
4580 - Many existing uses of 'syntax' and 'translations' can be replaced
4581 by more modern 'type_notation', 'notation' and 'abbreviation',
4582 which are independent of this issue.
4584 - 'translations' require markup within the AST; the term syntax
4585 provides the following special forms:
4587 CONST c -- produces syntax version of constant c from context
4588 XCONST c -- literally c, checked as constant from context
4589 c -- literally c, if declared by 'syntax'
4591 Plain identifiers are treated as AST variables -- occasionally the
4592 system indicates accidental variables via the error "rhs contains
4595 Type classes and type constructors are marked according to their
4596 concrete syntax. Some old translations rules need to be written
4597 for the "type" category, using type constructor application
4598 instead of pseudo-term application of the default category
4601 - 'parse_translation' etc. in ML may use the following
4604 @{class_syntax c} -- type class c within parse tree / AST
4605 @{term_syntax c} -- type constructor c within parse tree / AST
4606 @{const_syntax c} -- ML version of "CONST c" above
4607 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4609 - Literal types within 'typed_print_translations', i.e. those *not*
4610 represented as pseudo-terms are represented verbatim. Use @{class
4611 c} or @{type_name c} here instead of the above syntax
4614 Note that old non-authentic syntax was based on unqualified base
4615 names, so all of the above "constant" names would coincide. Recall
4616 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4617 diagnose syntax problems.
4619 * Type constructors admit general mixfix syntax, not just infix.
4621 * Concrete syntax may be attached to local entities without a proof
4622 body, too. This works via regular mixfix annotations for 'fix',
4623 'def', 'obtain' etc. or via the explicit 'write' command, which is
4624 similar to the 'notation' command in theory specifications.
4626 * Discontinued unnamed infix syntax (legacy feature for many years) --
4627 need to specify constant name and syntax separately. Internal ML
4628 datatype constructors have been renamed from InfixName to Infix etc.
4629 Minor INCOMPATIBILITY.
4631 * Schematic theorem statements need to be explicitly markup as such,
4632 via commands 'schematic_lemma', 'schematic_theorem',
4633 'schematic_corollary'. Thus the relevance of the proof is made
4634 syntactically clear, which impacts performance in a parallel or
4635 asynchronous interactive environment. Minor INCOMPATIBILITY.
4637 * Use of cumulative prems via "!" in some proof methods has been
4638 discontinued (old legacy feature).
4640 * References 'trace_simp' and 'debug_simp' have been replaced by
4641 configuration options stored in the context. Enabling tracing (the
4642 case of debugging is similar) in proofs works via
4644 using [[trace_simp = true]]
4646 Tracing is then active for all invocations of the simplifier in
4647 subsequent goal refinement steps. Tracing may also still be enabled or
4648 disabled via the ProofGeneral settings menu.
4650 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4651 'hide_fact' replace the former 'hide' KIND command. Minor
4654 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4655 more efficient than combinations with -q1 or -q2.
4660 * Proofterms record type-class reasoning explicitly, using the
4661 "unconstrain" operation internally. This eliminates all sort
4662 constraints from a theorem and proof, introducing explicit
4663 OFCLASS-premises. On the proof term level, this operation is
4664 automatically applied at theorem boundaries, such that closed proofs
4665 are always free of sort constraints. INCOMPATIBILITY for tools that
4666 inspect proof terms.
4668 * Local theory specifications may depend on extra type variables that
4669 are not present in the result type -- arguments TYPE('a) :: 'a itself
4670 are added internally. For example:
4672 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4674 * Predicates of locales introduced by classes carry a mandatory
4675 "class" prefix. INCOMPATIBILITY.
4677 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4679 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4682 * Command 'code_reflect' allows to incorporate generated ML code into
4683 runtime environment; replaces immature code_datatype antiquotation.
4686 * Code generator: simple concept for abstract datatypes obeying
4689 * Code generator: details of internal data cache have no impact on the
4690 user space functionality any longer.
4692 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4693 subgoals. This is more appropriate for interpretations with 'where'.
4696 * Command 'example_proof' opens an empty proof body. This allows to
4697 experiment with Isar, without producing any persistent result.
4699 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4700 within a local theory context, with explicit checking of the
4701 constructors involved (in contrast to the raw 'syntax' versions).
4703 * Commands 'types' and 'typedecl' now work within a local theory
4704 context -- without introducing dependencies on parameters or
4705 assumptions, which is not possible in Isabelle/Pure.
4707 * Command 'defaultsort' has been renamed to 'default_sort', it works
4708 within a local theory context. Minor INCOMPATIBILITY.
4713 * Command 'typedef' now works within a local theory context -- without
4714 introducing dependencies on parameters or assumptions, which is not
4715 possible in Isabelle/Pure/HOL. Note that the logical environment may
4716 contain multiple interpretations of local typedefs (with different
4717 non-emptiness proofs), even in a global theory context.
4719 * New package for quotient types. Commands 'quotient_type' and
4720 'quotient_definition' may be used for defining types and constants by
4721 quotient constructions. An example is the type of integers created by
4722 quotienting pairs of natural numbers:
4725 intrel :: "(nat * nat) => (nat * nat) => bool"
4727 "intrel (x, y) (u, v) = (x + v = u + y)"
4729 quotient_type int = "nat * nat" / intrel
4730 by (auto simp add: equivp_def expand_fun_eq)
4733 "0::int" is "(0::nat, 0::nat)"
4735 The method "lifting" can be used to lift of theorems from the
4736 underlying "raw" type to the quotient type. The example
4737 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4738 construction and provides a reasoning infrastructure for finite sets.
4740 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4741 clash with new theory Quotient in Main HOL.
4743 * Moved the SMT binding into the main HOL session, eliminating
4744 separate HOL-SMT session.
4746 * List membership infix mem operation is only an input abbreviation.
4749 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4750 for future developements; former Library/Word.thy is still present in
4751 the AFP entry RSAPPS.
4753 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4754 longer shadowed. INCOMPATIBILITY.
4756 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4759 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4762 * Dropped normalizing_semiring etc; use the facts in semiring classes
4763 instead. INCOMPATIBILITY.
4765 * Dropped several real-specific versions of lemmas about floor and
4766 ceiling; use the generic lemmas from theory "Archimedean_Field"
4767 instead. INCOMPATIBILITY.
4769 floor_number_of_eq ~> floor_number_of
4770 le_floor_eq_number_of ~> number_of_le_floor
4771 le_floor_eq_zero ~> zero_le_floor
4772 le_floor_eq_one ~> one_le_floor
4773 floor_less_eq_number_of ~> floor_less_number_of
4774 floor_less_eq_zero ~> floor_less_zero
4775 floor_less_eq_one ~> floor_less_one
4776 less_floor_eq_number_of ~> number_of_less_floor
4777 less_floor_eq_zero ~> zero_less_floor
4778 less_floor_eq_one ~> one_less_floor
4779 floor_le_eq_number_of ~> floor_le_number_of
4780 floor_le_eq_zero ~> floor_le_zero
4781 floor_le_eq_one ~> floor_le_one
4782 floor_subtract_number_of ~> floor_diff_number_of
4783 floor_subtract_one ~> floor_diff_one
4784 ceiling_number_of_eq ~> ceiling_number_of
4785 ceiling_le_eq_number_of ~> ceiling_le_number_of
4786 ceiling_le_zero_eq ~> ceiling_le_zero
4787 ceiling_le_eq_one ~> ceiling_le_one
4788 less_ceiling_eq_number_of ~> number_of_less_ceiling
4789 less_ceiling_eq_zero ~> zero_less_ceiling
4790 less_ceiling_eq_one ~> one_less_ceiling
4791 ceiling_less_eq_number_of ~> ceiling_less_number_of
4792 ceiling_less_eq_zero ~> ceiling_less_zero
4793 ceiling_less_eq_one ~> ceiling_less_one
4794 le_ceiling_eq_number_of ~> number_of_le_ceiling
4795 le_ceiling_eq_zero ~> zero_le_ceiling
4796 le_ceiling_eq_one ~> one_le_ceiling
4797 ceiling_subtract_number_of ~> ceiling_diff_number_of
4798 ceiling_subtract_one ~> ceiling_diff_one
4800 * Theory "Finite_Set": various folding_XXX locales facilitate the
4801 application of the various fold combinators on finite sets.
4803 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4804 provides abstract red-black tree type which is backed by "RBT_Impl" as
4805 implementation. INCOMPATIBILTY.
4807 * Theory Library/Coinductive_List has been removed -- superseded by
4808 AFP/thys/Coinductive.
4810 * Theory PReal, including the type "preal" and related operations, has
4811 been removed. INCOMPATIBILITY.
4813 * Real: new development using Cauchy Sequences.
4815 * Split off theory "Big_Operators" containing setsum, setprod,
4816 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4818 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4819 "Int" etc. INCOMPATIBILITY.
4821 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4823 * New set of rules "ac_simps" provides combined assoc / commute
4824 rewrites for all interpretations of the appropriate generic locales.
4826 * Renamed theory "OrderedGroup" to "Groups" and split theory
4827 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4828 appropriate and more consistent names suitable for name prefixes
4829 within the HOL theories. INCOMPATIBILITY.
4831 * Some generic constants have been put to appropriate theories:
4832 - less_eq, less: Orderings
4833 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4834 - inverse, divide: Rings
4837 * More consistent naming of type classes involving orderings (and
4840 lower_semilattice ~> semilattice_inf
4841 upper_semilattice ~> semilattice_sup
4843 dense_linear_order ~> dense_linorder
4845 pordered_ab_group_add ~> ordered_ab_group_add
4846 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4847 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4848 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4849 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4850 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4851 pordered_cancel_semiring ~> ordered_cancel_semiring
4852 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4853 pordered_comm_ring ~> ordered_comm_ring
4854 pordered_comm_semiring ~> ordered_comm_semiring
4855 pordered_ring ~> ordered_ring
4856 pordered_ring_abs ~> ordered_ring_abs
4857 pordered_semiring ~> ordered_semiring
4859 ordered_ab_group_add ~> linordered_ab_group_add
4860 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4861 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4862 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4863 ordered_field ~> linordered_field
4864 ordered_field_no_lb ~> linordered_field_no_lb
4865 ordered_field_no_ub ~> linordered_field_no_ub
4866 ordered_field_dense_linear_order ~> dense_linordered_field
4867 ordered_idom ~> linordered_idom
4868 ordered_ring ~> linordered_ring
4869 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4870 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4871 ordered_ring_strict ~> linordered_ring_strict
4872 ordered_semidom ~> linordered_semidom
4873 ordered_semiring ~> linordered_semiring
4874 ordered_semiring_1 ~> linordered_semiring_1
4875 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4876 ordered_semiring_strict ~> linordered_semiring_strict
4878 The following slightly odd type classes have been moved to a
4879 separate theory Library/Lattice_Algebras:
4881 lordered_ab_group_add ~> lattice_ab_group_add
4882 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4883 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4884 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4885 lordered_ring ~> lattice_ring
4889 * Refined field classes:
4890 - classes division_ring_inverse_zero, field_inverse_zero,
4891 linordered_field_inverse_zero include rule inverse 0 = 0 --
4892 subsumes former division_by_zero class;
4893 - numerous lemmas have been ported from field to division_ring.
4896 * Refined algebra theorem collections:
4897 - dropped theorem group group_simps, use algebra_simps instead;
4898 - dropped theorem group ring_simps, use field_simps instead;
4899 - proper theorem collection field_simps subsumes former theorem
4900 groups field_eq_simps and field_simps;
4901 - dropped lemma eq_minus_self_iff which is a duplicate for
4905 * Theory Finite_Set and List: some lemmas have been generalized from
4908 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4909 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4910 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4911 union_Union_fold_union ~> sup_Sup_fold_sup
4912 Inter_fold_inter ~> Inf_fold_inf
4913 Union_fold_union ~> Sup_fold_sup
4914 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4915 union_UNION_fold_union ~> sup_SUPR_fold_sup
4916 INTER_fold_inter ~> INFI_fold_inf
4917 UNION_fold_union ~> SUPR_fold_sup
4919 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4920 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4921 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4922 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4923 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4924 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4926 * Reorganized theory Multiset: swapped notation of pointwise and
4929 - pointwise ordering is instance of class order with standard syntax
4931 - multiset ordering has syntax <=# and <#; partial order properties
4932 are provided by means of interpretation with prefix
4934 - less duplication, less historical organization of sections,
4935 conversion from associations lists to multisets, rudimentary code
4937 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4942 multiset_eq_conv_count_eq ~> multiset_ext_iff
4943 multi_count_ext ~> multiset_ext
4944 diff_union_inverse2 ~> diff_union_cancelR
4948 * Theory Permutation: replaced local "remove" by List.remove1.
4950 * Code generation: ML and OCaml code is decorated with signatures.
4952 * Theory List: added transpose.
4954 * Library/Nat_Bijection.thy is a collection of bijective functions
4955 between nat and other types, which supersedes the older libraries
4956 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4959 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4960 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4961 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4962 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4963 Countable.pair_encode ~> prod_encode
4964 NatIso.prod2nat ~> prod_encode
4965 NatIso.nat2prod ~> prod_decode
4966 NatIso.sum2nat ~> sum_encode
4967 NatIso.nat2sum ~> sum_decode
4968 NatIso.list2nat ~> list_encode
4969 NatIso.nat2list ~> list_decode
4970 NatIso.set2nat ~> set_encode
4971 NatIso.nat2set ~> set_decode
4974 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4975 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4976 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4977 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4978 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4979 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4980 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4981 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4982 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4983 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4984 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4985 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4986 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4989 - Renamed ATP commands:
4990 atp_info ~> sledgehammer running_atps
4991 atp_kill ~> sledgehammer kill_atps
4992 atp_messages ~> sledgehammer messages
4993 atp_minimize ~> sledgehammer minimize
4994 print_atps ~> sledgehammer available_atps
4996 - Added user's manual ("isabelle doc sledgehammer").
4997 - Added option syntax and "sledgehammer_params" to customize
4998 Sledgehammer's behavior. See the manual for details.
4999 - Modified the Isar proof reconstruction code so that it produces
5000 direct proofs rather than proofs by contradiction. (This feature
5001 is still experimental.)
5002 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
5004 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
5007 - Added and implemented "binary_ints" and "bits" options.
5008 - Added "std" option and implemented support for nonstandard models.
5009 - Added and implemented "finitize" option to improve the precision
5010 of infinite datatypes based on a monotonicity analysis.
5011 - Added support for quotient types.
5012 - Added support for "specification" and "ax_specification"
5014 - Added support for local definitions (for "function" and
5015 "termination" proofs).
5016 - Added support for term postprocessors.
5017 - Optimized "Multiset.multiset" and "FinFun.finfun".
5018 - Improved efficiency of "destroy_constrs" optimization.
5019 - Fixed soundness bugs related to "destroy_constrs" optimization and
5021 - Fixed soundness bug related to higher-order constructors.
5022 - Fixed soundness bug when "full_descrs" is enabled.
5023 - Improved precision of set constructs.
5024 - Added "atoms" option.
5025 - Added cache to speed up repeated Kodkod invocations on the same
5027 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
5028 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
5029 "SAT4J_Light". INCOMPATIBILITY.
5030 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
5031 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
5032 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
5034 * Method "induct" now takes instantiations of the form t, where t is not
5035 a variable, as a shorthand for "x == t", where x is a fresh variable.
5036 If this is not intended, t has to be enclosed in parentheses.
5037 By default, the equalities generated by definitional instantiations
5038 are pre-simplified, which may cause parameters of inductive cases
5039 to disappear, or may even delete some of the inductive cases.
5040 Use "induct (no_simp)" instead of "induct" to restore the old
5041 behaviour. The (no_simp) option is also understood by the "cases"
5042 and "nominal_induct" methods, which now perform pre-simplification, too.
5048 * Variable names in lemmas generated by the domain package have
5049 changed; the naming scheme is now consistent with the HOL datatype
5050 package. Some proof scripts may be affected, INCOMPATIBILITY.
5052 * The domain package no longer defines the function "foo_copy" for
5053 recursive domain "foo". The reach lemma is now stated directly in
5054 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
5055 be reformulated in terms of "foo_take", INCOMPATIBILITY.
5057 * Most definedness lemmas generated by the domain package (previously
5058 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
5059 like "foo$x = UU <-> x = UU", which works better as a simp rule.
5060 Proofs that used definedness lemmas as intro rules may break,
5061 potential INCOMPATIBILITY.
5063 * Induction and casedist rules generated by the domain package now
5064 declare proper case_names (one called "bottom", and one named for each
5065 constructor). INCOMPATIBILITY.
5067 * For mutually-recursive domains, separate "reach" and "take_lemma"
5068 rules are generated for each domain, INCOMPATIBILITY.
5070 foo_bar.reach ~> foo.reach bar.reach
5071 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
5073 * Some lemmas generated by the domain package have been renamed for
5074 consistency with the datatype package, INCOMPATIBILITY.
5076 foo.ind ~> foo.induct
5077 foo.finite_ind ~> foo.finite_induct
5078 foo.coind ~> foo.coinduct
5079 foo.casedist ~> foo.exhaust
5080 foo.exhaust ~> foo.nchotomy
5082 * For consistency with other definition packages, the fixrec package
5083 now generates qualified theorem names, INCOMPATIBILITY.
5085 foo_simps ~> foo.simps
5086 foo_unfold ~> foo.unfold
5087 foo_induct ~> foo.induct
5089 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5090 method and internal fixrec proofs now use the default simpset instead.
5093 * The "contlub" predicate has been removed. Proof scripts should use
5094 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5096 * The "admw" predicate has been removed, INCOMPATIBILITY.
5098 * The constants cpair, cfst, and csnd have been removed in favor of
5099 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5104 * Antiquotations for basic formal entities:
5106 @{class NAME} -- type class
5107 @{class_syntax NAME} -- syntax representation of the above
5109 @{type_name NAME} -- logical type
5110 @{type_abbrev NAME} -- type abbreviation
5111 @{nonterminal NAME} -- type of concrete syntactic category
5112 @{type_syntax NAME} -- syntax representation of any of the above
5114 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5115 @{const_abbrev NAME} -- abbreviated constant
5116 @{const_syntax NAME} -- syntax representation of any of the above
5118 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5119 syntax constant (cf. 'syntax' command).
5121 * Antiquotation @{make_string} inlines a function to print arbitrary
5122 values similar to the ML toplevel. The result is compiler dependent
5123 and may fall back on "?" in certain situations.
5125 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5126 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5127 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5128 not work with the asynchronous Isar document model.
5130 * Configuration options now admit dynamic default values, depending on
5131 the context or even global references.
5133 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5134 uses an efficient external library if available (for Poly/ML).
5136 * Renamed some important ML structures, while keeping the old names
5137 for some time as aliases within the structure Legacy:
5139 OuterKeyword ~> Keyword
5142 OuterSyntax ~> Outer_Syntax
5143 PrintMode ~> Print_Mode
5144 SpecParse ~> Parse_Spec
5147 ThyOutput ~> Thy_Output
5148 TypeInfer ~> Type_Infer
5150 Note that "open Legacy" simplifies porting of sources, but forgetting
5151 to remove it again will complicate porting again in the future.
5153 * Most operations that refer to a global context are named
5154 accordingly, e.g. Simplifier.global_context or
5155 ProofContext.init_global. There are some situations where a global
5156 context actually works, but under normal circumstances one needs to
5157 pass the proper local context through the code!
5159 * Discontinued old TheoryDataFun with its copy/init operation -- data
5160 needs to be pure. Functor Theory_Data_PP retains the traditional
5161 Pretty.pp argument to merge, which is absent in the standard
5162 Theory_Data version.
5164 * Sorts.certify_sort and derived "cert" operations for types and terms
5165 no longer minimize sorts. Thus certification at the boundary of the
5166 inference kernel becomes invariant under addition of class relations,
5167 which is an important monotonicity principle. Sorts are now minimized
5168 in the syntax layer only, at the boundary between the end-user and the
5169 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5170 explicitly in rare situations.
5172 * Renamed old-style Drule.standard to Drule.export_without_context, to
5173 emphasize that this is in no way a standard operation.
5176 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5177 usual for resolution. Rare INCOMPATIBILITY.
5179 * Renamed varify/unvarify operations to varify_global/unvarify_global
5180 to emphasize that these only work in a global situation (which is
5183 * Curried take and drop in library.ML; negative length is interpreted
5184 as infinity (as in chop). Subtle INCOMPATIBILITY.
5186 * Proof terms: type substitutions on proof constants now use canonical
5187 order of type variables. INCOMPATIBILITY for tools working with proof
5190 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5191 may no longer carry premises. User-level specifications are
5192 transformed accordingly by Thm.add_axiom/add_def.
5197 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5198 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5199 proof terms are enabled unconditionally in the new HOL-Proofs image.
5201 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5202 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5205 * Old lib/scripts/polyml-platform is superseded by the
5206 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5207 variant, even on a 64 bit machine. The following example setting
5208 prefers 64 bit if available:
5210 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5212 * The preliminary Isabelle/jEdit application demonstrates the emerging
5213 Isabelle/Scala layer for advanced prover interaction and integration.
5214 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5217 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5218 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5219 similar to the default assignment of the document preparation system
5220 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5221 provides some operations for direct access to the font without asking
5222 the user for manual installation.
5226 New in Isabelle2009-1 (December 2009)
5227 -------------------------------------
5231 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5232 one backslash should be used, even in ML sources.
5237 * Locale interpretation propagates mixins along the locale hierarchy.
5238 The currently only available mixins are the equations used to map
5239 local definitions to terms of the target domain of an interpretation.
5241 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5242 loc" to print all interpretations of locale "loc" in the theory.
5243 Interpretations in proofs are not shown.
5245 * Thoroughly revised locales tutorial. New section on conditional
5248 * On instantiation of classes, remaining undefined class parameters
5249 are formally declared. INCOMPATIBILITY.
5252 *** Document preparation ***
5254 * New generalized style concept for printing terms: @{foo (style) ...}
5255 instead of @{foo_style style ...} (old form is still retained for
5256 backward compatibility). Styles can be also applied for
5257 antiquotations prop, term_type and typeof.
5262 * New proof method "smt" for a combination of first-order logic with
5263 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5264 fixed-size bitvectors; there is also basic support for higher-order
5265 features (esp. lambda abstractions). It is an incomplete decision
5266 procedure based on external SMT solvers using the oracle mechanism;
5267 for the SMT solver Z3, this method is proof-producing. Certificates
5268 are provided to avoid calling the external solvers solely for
5269 re-checking proofs. Due to a remote SMT service there is no need for
5270 installing SMT solvers locally. See src/HOL/SMT.
5272 * New commands to load and prove verification conditions generated by
5273 the Boogie program verifier or derived systems (e.g. the Verifying C
5274 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5276 * New counterexample generator tool 'nitpick' based on the Kodkod
5277 relational model finder. See src/HOL/Tools/Nitpick and
5278 src/HOL/Nitpick_Examples.
5280 * New commands 'code_pred' and 'values' to invoke the predicate
5281 compiler and to enumerate values of inductive predicates.
5283 * A tabled implementation of the reflexive transitive closure.
5285 * New implementation of quickcheck uses generic code generator;
5286 default generators are provided for all suitable HOL types, records
5287 and datatypes. Old quickcheck can be re-activated importing theory
5288 Library/SML_Quickcheck.
5290 * New testing tool Mirabelle for automated proof tools. Applies
5291 several tools and tactics like sledgehammer, metis, or quickcheck, to
5292 every proof step in a theory. To be used in batch mode via the
5293 "mirabelle" utility.
5295 * New proof method "sos" (sum of squares) for nonlinear real
5296 arithmetic (originally due to John Harison). It requires theory
5297 Library/Sum_Of_Squares. It is not a complete decision procedure but
5298 works well in practice on quantifier-free real arithmetic with +, -,
5299 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5300 inequalities between polynomials. It makes use of external
5301 semidefinite programming solvers. Method "sos" generates a
5302 certificate that can be pasted into the proof thus avoiding the need
5303 to call an external tool every time the proof is checked. See
5304 src/HOL/Library/Sum_Of_Squares.
5306 * New method "linarith" invokes existing linear arithmetic decision
5309 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5311 * New Sledgehammer option "Full Types" in Proof General settings menu.
5312 Causes full type information to be output to the ATPs. This slows
5313 ATPs down considerably but eliminates a source of unsound "proofs"
5316 * New method "metisFT": A version of metis that uses full type
5317 information in order to avoid failures of proof reconstruction.
5319 * New evaluator "approximate" approximates an real valued term using
5320 the same method as the approximation method.
5322 * Method "approximate" now supports arithmetic expressions as
5323 boundaries of intervals and implements interval splitting and Taylor
5326 * ML antiquotation @{code_datatype} inserts definition of a datatype
5327 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5329 * New theory SupInf of the supremum and infimum operators for sets of
5332 * New theory Probability, which contains a development of measure
5333 theory, eventually leading to Lebesgue integration and probability.
5335 * Extended Multivariate Analysis to include derivation and Brouwer's
5338 * Reorganization of number theory, INCOMPATIBILITY:
5339 - new number theory development for nat and int, in theories Divides
5340 and GCD as well as in new session Number_Theory
5341 - some constants and facts now suffixed with _nat and _int
5343 - former session NumberTheory now named Old_Number_Theory, including
5344 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5345 - moved theory Pocklington from src/HOL/Library to
5346 src/HOL/Old_Number_Theory
5348 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5349 lcm of finite and infinite sets. It is shown that they form a complete
5352 * Class semiring_div requires superclass no_zero_divisors and proof of
5353 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5354 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5355 generalized to class semiring_div, subsuming former theorems
5356 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5357 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5360 * Refinements to lattice classes and sets:
5361 - less default intro/elim rules in locale variant, more default
5362 intro/elim rules in class variant: more uniformity
5363 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5365 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5367 - renamed ACI to inf_sup_aci
5368 - new class "boolean_algebra"
5369 - class "complete_lattice" moved to separate theory
5370 "Complete_Lattice"; corresponding constants (and abbreviations)
5371 renamed and with authentic syntax:
5372 Set.Inf ~> Complete_Lattice.Inf
5373 Set.Sup ~> Complete_Lattice.Sup
5374 Set.INFI ~> Complete_Lattice.INFI
5375 Set.SUPR ~> Complete_Lattice.SUPR
5376 Set.Inter ~> Complete_Lattice.Inter
5377 Set.Union ~> Complete_Lattice.Union
5378 Set.INTER ~> Complete_Lattice.INTER
5379 Set.UNION ~> Complete_Lattice.UNION
5380 - authentic syntax for
5383 - mere abbreviations:
5386 Set.inter (for inf, formerly Set.Int)
5387 Set.union (for sup, formerly Set.Un)
5388 Complete_Lattice.Inter (for Inf)
5389 Complete_Lattice.Union (for Sup)
5390 Complete_Lattice.INTER (for INFI)
5391 Complete_Lattice.UNION (for SUPR)
5392 - object-logic definitions as far as appropriate
5394 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5395 Un_subset_iff are explicitly deleted as default simp rules; then also
5396 their lattice counterparts le_inf_iff and le_sup_iff have to be
5397 deleted to achieve the desired effect.
5399 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5400 rules by default any longer; the same applies to min_max.inf_absorb1
5401 etc. INCOMPATIBILITY.
5403 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5404 pred_set_conv by default. INCOMPATIBILITY.
5406 * Power operations on relations and functions are now one dedicated
5407 constant "compow" with infix syntax "^^". Power operation on
5408 multiplicative monoids retains syntax "^" and is now defined generic
5409 in class power. INCOMPATIBILITY.
5411 * Relation composition "R O S" now has a more standard argument order:
5412 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5413 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5414 break, since the O_assoc rule was not rewritten like this. Fix using
5415 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5417 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5418 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5421 * Most rules produced by inductive and datatype package have mandatory
5422 prefixes. INCOMPATIBILITY.
5424 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5425 the attribute of the same name. Each of the theorems in the list
5426 DERIV_intros assumes composition with an additional function and
5427 matches a variable to the derivative, which has to be solved by the
5428 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5429 of most elementary terms. Former Maclauren.DERIV_tac and
5430 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5433 * Code generator attributes follow the usual underscore convention:
5434 code_unfold replaces code unfold
5435 code_post replaces code post
5440 sizechange -> size_change
5441 induct_scheme -> induction_schema
5444 * Discontinued abbreviation "arbitrary" of constant "undefined".
5445 INCOMPATIBILITY, use "undefined" directly.
5448 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5449 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5450 Suc_plus1 -> Suc_eq_plus1
5451 *anti_sym -> *antisym*
5452 vector_less_eq_def -> vector_le_def
5455 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5458 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5464 * Theory Representable defines a class "rep" of domains that are
5465 representable (via an ep-pair) in the universal domain type "udom".
5466 Instances are provided for all type constructors defined in HOLCF.
5468 * The 'new_domain' command is a purely definitional version of the
5469 domain package, for representable domains. Syntax is identical to the
5470 old domain package. The 'new_domain' package also supports indirect
5471 recursion using previously-defined type constructors. See
5472 src/HOLCF/ex/New_Domain.thy for examples.
5474 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5475 on the left-hand side of an equation, and then performs
5476 simplification. Rewriting is done using rules declared with the
5477 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5478 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5480 * The pattern-match compiler in 'fixrec' can now handle constructors
5481 with HOL function types. Pattern-match combinators for the Pair
5482 constructor are pre-configured.
5484 * The 'fixrec' package now produces better fixed-point induction rules
5485 for mutually-recursive definitions: Induction rules have conclusions
5486 of the form "P foo bar" instead of "P <foo, bar>".
5488 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5489 been renamed to "below". The name "below" now replaces "less" in many
5490 theorem names. (Legacy theorem names using "less" are still supported
5493 * The 'fixrec' package now supports "bottom patterns". Bottom
5494 patterns can be used to generate strictness rules, or to make
5495 functions more strict (much like the bang-patterns supported by the
5496 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5502 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5503 errors and run-time exceptions, including detailed source positions.
5505 * Structure Name_Space (formerly NameSpace) now manages uniquely
5506 identified entries, with some additional information such as source
5507 position, logical grouping etc.
5509 * Theory and context data is now introduced by the simplified and
5510 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5511 to be pure, but the old TheoryDataFun for mutable data (with explicit
5512 copy operation) is still available for some time.
5514 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5515 provides a high-level programming interface to synchronized state
5516 variables with atomic update. This works via pure function
5517 application within a critical section -- its runtime should be as
5518 short as possible; beware of deadlocks if critical code is nested,
5519 either directly or indirectly via other synchronized variables!
5521 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5522 wraps raw ML references, explicitly indicating their non-thread-safe
5523 behaviour. The Isar toplevel keeps this structure open, to
5524 accommodate Proof General as well as quick and dirty interactive
5525 experiments with references.
5527 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5528 parallel tactical reasoning.
5530 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5531 are similar to SUBPROOF, but are slightly more flexible: only the
5532 specified parts of the subgoal are imported into the context, and the
5533 body tactic may introduce new subgoals and schematic variables.
5535 * Old tactical METAHYPS, which does not observe the proof context, has
5536 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5537 or Subgoal.FOCUS etc.
5539 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5540 functors have their own ML name space there is no point to mark them
5541 separately.) Minor INCOMPATIBILITY.
5543 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5545 * Renamed several structures FooBar to Foo_Bar. Occasional,
5548 * Operations of structure Skip_Proof no longer require quick_and_dirty
5549 mode, which avoids critical setmp.
5551 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5552 combinators for "args". INCOMPATIBILITY, need to use simplified
5553 Attrib/Method.setup introduced in Isabelle2009.
5555 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5556 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5557 last resort. INCOMPATIBILITY.
5559 * Display.pretty_thm now requires a proper context (cf. former
5560 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5561 or even Display.pretty_thm_without_context as last resort.
5564 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5565 Syntax.pretty_typ/term directly, preferably with proper context
5566 instead of global theory.
5571 * Further fine tuning of parallel proof checking, scales up to 8 cores
5572 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5575 * Support for additional "Isabelle components" via etc/components, see
5576 also the system manual.
5578 * The isabelle makeall tool now operates on all components with
5579 IsaMakefile, not just hardwired "logics".
5581 * Removed "compress" option from isabelle-process and isabelle usedir;
5582 this is always enabled.
5584 * Discontinued support for Poly/ML 4.x versions.
5586 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5587 on a given logic image. This requires the lighttpd webserver and is
5588 currently supported on Linux only.
5592 New in Isabelle2009 (April 2009)
5593 --------------------------------
5597 * Simplified main Isabelle executables, with less surprises on
5598 case-insensitive file-systems (such as Mac OS).
5600 - The main Isabelle tool wrapper is now called "isabelle" instead of
5603 - The former "isabelle" alias for "isabelle-process" has been
5604 removed (should rarely occur to regular users).
5606 - The former "isabelle-interface" and its alias "Isabelle" have been
5607 removed (interfaces are now regular Isabelle tools).
5609 Within scripts and make files, the Isabelle environment variables
5610 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5611 respectively. (The latter are still available as legacy feature.)
5613 The old isabelle-interface wrapper could react in confusing ways if
5614 the interface was uninstalled or changed otherwise. Individual
5615 interface tool configuration is now more explicit, see also the
5616 Isabelle system manual. In particular, Proof General is now available
5617 via "isabelle emacs".
5619 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5620 purge installed copies of Isabelle executables and re-run "isabelle
5621 install -p ...", or use symlinks.
5623 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5624 old ~/isabelle, which was slightly non-standard and apt to cause
5625 surprises on case-insensitive file-systems (such as Mac OS).
5627 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5628 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5629 care is required when using older releases of Isabelle. Note that
5630 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5631 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5633 * Proofs of fully specified statements are run in parallel on
5634 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5635 a regular 4-core machine, if the initial heap space is made reasonably
5636 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5638 * The main reference manuals ("isar-ref", "implementation", and
5639 "system") have been updated and extended. Formally checked references
5640 as hyperlinks are now available uniformly.
5645 * Complete re-implementation of locales. INCOMPATIBILITY in several
5646 respects. The most important changes are listed below. See the
5647 Tutorial on Locales ("locales" manual) for details.
5649 - In locale expressions, instantiation replaces renaming. Parameters
5650 must be declared in a for clause. To aid compatibility with previous
5651 parameter inheritance, in locale declarations, parameters that are not
5652 'touched' (instantiation position "_" or omitted) are implicitly added
5653 with their syntax at the beginning of the for clause.
5655 - Syntax from abbreviations and definitions in locales is available in
5656 locale expressions and context elements. The latter is particularly
5657 useful in locale declarations.
5659 - More flexible mechanisms to qualify names generated by locale
5660 expressions. Qualifiers (prefixes) may be specified in locale
5661 expressions, and can be marked as mandatory (syntax: "name!:") or
5662 optional (syntax "name?:"). The default depends for plain "name:"
5663 depends on the situation where a locale expression is used: in
5664 commands 'locale' and 'sublocale' prefixes are optional, in
5665 'interpretation' and 'interpret' prefixes are mandatory. The old
5666 implicit qualifiers derived from the parameter names of a locale are
5667 no longer generated.
5669 - Command "sublocale l < e" replaces "interpretation l < e". The
5670 instantiation clause in "interpretation" and "interpret" (square
5671 brackets) is no longer available. Use locale expressions.
5673 - When converting proof scripts, mandatory qualifiers in
5674 'interpretation' and 'interpret' should be retained by default, even
5675 if this is an INCOMPATIBILITY compared to former behavior. In the
5676 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5677 in locale expressions range over a single locale instance only.
5679 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5680 In existing theorem specifications replace the includes element by the
5681 respective context elements of the included locale, omitting those
5682 that are already present in the theorem specification. Multiple
5683 assume elements of a locale should be replaced by a single one
5684 involving the locale predicate. In the proof body, declarations (most
5685 notably theorems) may be regained by interpreting the respective
5686 locales in the proof context as required (command "interpret").
5688 If using "includes" in replacement of a target solely because the
5689 parameter types in the theorem are not as general as in the target,
5690 consider declaring a new locale with additional type constraints on
5691 the parameters (context element "constrains").
5693 - Discontinued "locale (open)". INCOMPATIBILITY.
5695 - Locale interpretation commands no longer attempt to simplify goal.
5696 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5697 methods intro_locales and unfold_locales to clarify.
5699 - Locale interpretation commands no longer accept interpretation
5700 attributes. INCOMPATIBILITY.
5702 * Class declaration: so-called "base sort" must not be given in import
5703 list any longer, but is inferred from the specification. Particularly
5710 class foo = type + ...
5712 * Class target: global versions of theorems stemming do not carry a
5713 parameter prefix any longer. INCOMPATIBILITY.
5715 * Class 'instance' command no longer accepts attached definitions.
5716 INCOMPATIBILITY, use proper 'instantiation' target instead.
5718 * Recovered hiding of consts, which was accidentally broken in
5719 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5720 makes c inaccessible; consider using ``hide (open) const c'' instead.
5722 * Slightly more coherent Pure syntax, with updated documentation in
5723 isar-ref manual. Removed locales meta_term_syntax and
5724 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5725 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5726 directly in regular applications.
5728 * There is a new syntactic category "float_const" for signed decimal
5729 fractions (e.g. 123.45 or -123.45).
5731 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5732 interface with 'setup' command instead.
5734 * Command 'local_setup' is similar to 'setup', but operates on a local
5737 * The 'axiomatization' command now only works within a global theory
5738 context. INCOMPATIBILITY.
5740 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5741 hypotheses. Sorts required in the course of reasoning need to be
5742 covered by the constraints in the initial statement, completed by the
5743 type instance information of the background theory. Non-trivial sort
5744 hypotheses, which rarely occur in practice, may be specified via
5745 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5747 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5749 The result contains an implicit sort hypotheses as before --
5750 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5753 * Generalized Isar history, with support for linear undo, direct state
5756 * Changed defaults for unify configuration options:
5758 unify_trace_bound = 50 (formerly 25)
5759 unify_search_bound = 60 (formerly 30)
5761 * Different bookkeeping for code equations (INCOMPATIBILITY):
5763 a) On theory merge, the last set of code equations for a particular
5764 constant is taken (in accordance with the policy applied by other
5765 parts of the code generator framework).
5767 b) Code equations stemming from explicit declarations (e.g. code
5768 attribute) gain priority over default code equations stemming
5769 from definition, primrec, fun etc.
5771 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5773 * Unified theorem tables for both code generators. Thus [code
5774 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5776 * Command 'find_consts' searches for constants based on type and name
5779 find_consts "_ => bool"
5781 By default, matching is against subtypes, but it may be restricted to
5782 the whole type. Searching by name is possible. Multiple queries are
5783 conjunctive and queries may be negated by prefixing them with a
5786 find_consts strict: "_ => bool" name: "Int" -"int => int"
5788 * New 'find_theorems' criterion "solves" matches theorems that
5789 directly solve the current goal (modulo higher-order unification).
5791 * Auto solve feature for main theorem statements: whenever a new goal
5792 is stated, "find_theorems solves" is called; any theorems that could
5793 solve the lemma directly are listed as part of the goal state.
5794 Cf. associated options in Proof General Isabelle settings menu,
5795 enabled by default, with reasonable timeout for pathological cases of
5796 higher-order unification.
5799 *** Document preparation ***
5801 * Antiquotation @{lemma} now imitates a regular terminal proof,
5802 demanding keyword 'by' and supporting the full method expression
5803 syntax just like the Isar command 'by'.
5808 * Integrated main parts of former image HOL-Complex with HOL. Entry
5809 points Main and Complex_Main remain as before.
5811 * Logic image HOL-Plain provides a minimal HOL with the most important
5812 tools available (inductive, datatype, primrec, ...). This facilitates
5813 experimentation and tool development. Note that user applications
5814 (and library theories) should never refer to anything below theory
5817 * Logic image HOL-Main stops at theory Main, and thus facilitates
5818 experimentation due to shorter build times.
5820 * Logic image HOL-NSA contains theories of nonstandard analysis which
5821 were previously part of former HOL-Complex. Entry point Hyperreal
5822 remains valid, but theories formerly using Complex_Main should now use
5823 new entry point Hypercomplex.
5825 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5826 Posix processes. Avoids potentially expensive forking of the ML
5827 process. New thread-based implementation also works on non-Unix
5828 platforms (Cygwin). Provers are no longer hardwired, but defined
5829 within the theory via plain ML wrapper functions. Basic Sledgehammer
5830 commands are covered in the isar-ref manual.
5832 * Wrapper scripts for remote SystemOnTPTP service allows to use
5833 sledgehammer without local ATP installation (Vampire etc.). Other
5834 provers may be included via suitable ML wrappers, see also
5835 src/HOL/ATP_Linkup.thy.
5837 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5840 * The metis method no longer fails because the theorem is too trivial
5841 (contains the empty clause).
5843 * The metis method now fails in the usual manner, rather than raising
5844 an exception, if it determines that it cannot prove the theorem.
5846 * Method "coherent" implements a prover for coherent logic (see also
5847 src/Tools/coherent.ML).
5849 * Constants "undefined" and "default" replace "arbitrary". Usually
5850 "undefined" is the right choice to replace "arbitrary", though
5851 logically there is no difference. INCOMPATIBILITY.
5853 * Command "value" now integrates different evaluation mechanisms. The
5854 result of the first successful evaluation mechanism is printed. In
5855 square brackets a particular named evaluation mechanisms may be
5856 specified (currently, [SML], [code] or [nbe]). See further
5857 src/HOL/ex/Eval_Examples.thy.
5859 * Normalization by evaluation now allows non-leftlinear equations.
5860 Declare with attribute [code nbe].
5862 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5863 as the structured Isar versions "cases" and "induct", cf. the
5864 corresponding "cases" and "induct" attributes. Mutual induction rules
5865 are now presented as a list of individual projections
5866 (e.g. foo_bar.inducts for types foo and bar); the old format with
5867 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5868 rare situations a different rule is selected --- notably nested tuple
5869 elimination instead of former prod.exhaust: use explicit (case_tac t
5870 rule: prod.exhaust) here.
5872 * Attributes "cases", "induct", "coinduct" support "del" option.
5874 * Removed fact "case_split_thm", which duplicates "case_split".
5876 * The option datatype has been moved to a new theory Option. Renamed
5877 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5879 * New predicate "strict_mono" classifies strict functions on partial
5880 orders. With strict functions on linear orders, reasoning about
5881 (in)equalities is facilitated by theorems "strict_mono_eq",
5882 "strict_mono_less_eq" and "strict_mono_less".
5884 * Some set operations are now proper qualified constants with
5885 authentic syntax. INCOMPATIBILITY:
5896 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5899 * Auxiliary class "itself" has disappeared -- classes without any
5900 parameter are treated as expected by the 'class' command.
5902 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5904 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5905 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5907 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5908 method "approximation". It proves formulas on real values by using
5909 interval arithmetic. In the formulas are also the transcendental
5910 functions sin, cos, tan, atan, ln, exp and the constant pi are
5911 allowed. For examples see
5912 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5914 * Theory "Reflection" now resides in HOL/Library.
5916 * Entry point to Word library now simply named "Word".
5919 * Made source layout more coherent with logical distribution
5922 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5923 src/HOL/Library/Code_Message.thy ~> src/HOL/
5924 src/HOL/Library/GCD.thy ~> src/HOL/
5925 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5926 src/HOL/Library/Parity.thy ~> src/HOL/
5927 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5928 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5929 src/HOL/Real/Lubs.thy ~> src/HOL/
5930 src/HOL/Real/PReal.thy ~> src/HOL/
5931 src/HOL/Real/Rational.thy ~> src/HOL/
5932 src/HOL/Real/RComplete.thy ~> src/HOL/
5933 src/HOL/Real/RealDef.thy ~> src/HOL/
5934 src/HOL/Real/RealPow.thy ~> src/HOL/
5935 src/HOL/Real/Real.thy ~> src/HOL/
5936 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5937 src/HOL/Complex/Complex.thy ~> src/HOL/
5938 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5939 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5940 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5941 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5942 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5943 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5944 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5945 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5946 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5947 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5948 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5949 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5950 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5951 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5952 src/HOL/Real/Float ~> src/HOL/Library/
5953 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5954 src/HOL/Real/RealVector.thy ~> src/HOL/
5956 src/HOL/arith_data.ML ~> src/HOL/Tools
5957 src/HOL/hologic.ML ~> src/HOL/Tools
5958 src/HOL/simpdata.ML ~> src/HOL/Tools
5959 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5960 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5961 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5962 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5963 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5964 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5965 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5967 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5968 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5969 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5970 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5971 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5972 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5974 * If methods "eval" and "evaluation" encounter a structured proof
5975 state with !!/==>, only the conclusion is evaluated to True (if
5976 possible), avoiding strange error messages.
5978 * Method "sizechange" automates termination proofs using (a
5979 modification of) the size-change principle. Requires SAT solver. See
5980 src/HOL/ex/Termination.thy for examples.
5982 * Simplifier: simproc for let expressions now unfolds if bound
5983 variable occurs at most once in let expression body. INCOMPATIBILITY.
5985 * Method "arith": Linear arithmetic now ignores all inequalities when
5986 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5988 * New attribute "arith" for facts that should always be used
5989 automatically by arithmetic. It is intended to be used locally in
5992 assumes [arith]: "x > 0"
5994 Global usage is discouraged because of possible performance impact.
5996 * New classes "top" and "bot" with corresponding operations "top" and
5997 "bot" in theory Orderings; instantiation of class "complete_lattice"
5998 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
6000 * Changed definition lemma "less_fun_def" in order to provide an
6001 instance for preorders on functions; use lemma "less_le" instead.
6004 * Theory Orderings: class "wellorder" moved here, with explicit
6005 induction rule "less_induct" as assumption. For instantiation of
6006 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
6009 * Theory Orderings: added class "preorder" as superclass of "order".
6010 INCOMPATIBILITY: Instantiation proofs for order, linorder
6011 etc. slightly changed. Some theorems named order_class.* now named
6014 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
6017 * Theory Finite_Set: added a new fold combinator of type
6019 ('a => 'b => 'b) => 'b => 'a set => 'b
6021 Occasionally this is more convenient than the old fold combinator
6022 which is now defined in terms of the new one and renamed to
6025 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
6026 and "ring_simps" have been replaced by "algebra_simps" (which can be
6027 extended with further lemmas!). At the moment both still exist but
6028 the former will disappear at some point.
6030 * Theory Power: Lemma power_Suc is now declared as a simp rule in
6031 class recpower. Type-specific simp rules for various recpower types
6032 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
6034 rat_power_0 -> power_0
6035 rat_power_Suc -> power_Suc
6036 realpow_0 -> power_0
6037 realpow_Suc -> power_Suc
6038 complexpow_0 -> power_0
6039 complexpow_Suc -> power_Suc
6040 power_poly_0 -> power_0
6041 power_poly_Suc -> power_Suc
6043 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
6044 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
6045 dvd has been generalized to class comm_semiring_1. Likewise a bunch
6046 of lemmas from Divides has been generalized from nat to class
6047 semiring_div. INCOMPATIBILITY. This involves the following theorem
6048 renames resulting from duplicate elimination:
6050 dvd_def_mod ~> dvd_eq_mod_eq_0
6051 zero_dvd_iff ~> dvd_0_left_iff
6052 dvd_0 ~> dvd_0_right
6053 DIVISION_BY_ZERO_DIV ~> div_by_0
6054 DIVISION_BY_ZERO_MOD ~> mod_by_0
6055 mult_div ~> div_mult_self2_is_id
6056 mult_mod ~> mod_mult_self2_is_0
6058 * Theory IntDiv: removed many lemmas that are instances of class-based
6059 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
6060 rename old lemmas as follows:
6062 dvd_diff -> nat_dvd_diff
6063 dvd_zminus_iff -> dvd_minus_iff
6064 mod_add1_eq -> mod_add_eq
6065 mod_mult1_eq -> mod_mult_right_eq
6066 mod_mult1_eq' -> mod_mult_left_eq
6067 mod_mult_distrib_mod -> mod_mult_eq
6068 nat_mod_add_left_eq -> mod_add_left_eq
6069 nat_mod_add_right_eq -> mod_add_right_eq
6070 nat_mod_div_trivial -> mod_div_trivial
6071 nat_mod_mod_trivial -> mod_mod_trivial
6072 zdiv_zadd_self1 -> div_add_self1
6073 zdiv_zadd_self2 -> div_add_self2
6074 zdiv_zmult_self1 -> div_mult_self2_is_id
6075 zdiv_zmult_self2 -> div_mult_self1_is_id
6076 zdvd_triv_left -> dvd_triv_left
6077 zdvd_triv_right -> dvd_triv_right
6078 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
6079 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6080 zmod_zadd_left_eq -> mod_add_left_eq
6081 zmod_zadd_right_eq -> mod_add_right_eq
6082 zmod_zadd_self1 -> mod_add_self1
6083 zmod_zadd_self2 -> mod_add_self2
6084 zmod_zadd1_eq -> mod_add_eq
6085 zmod_zdiff1_eq -> mod_diff_eq
6086 zmod_zdvd_zmod -> mod_mod_cancel
6087 zmod_zmod_cancel -> mod_mod_cancel
6088 zmod_zmult_self1 -> mod_mult_self2_is_0
6089 zmod_zmult_self2 -> mod_mult_self1_is_0
6092 zdvd_abs1 -> abs_dvd_iff
6093 zdvd_abs2 -> dvd_abs_iff
6094 zdvd_refl -> dvd_refl
6095 zdvd_trans -> dvd_trans
6096 zdvd_zadd -> dvd_add
6097 zdvd_zdiff -> dvd_diff
6098 zdvd_zminus_iff -> dvd_minus_iff
6099 zdvd_zminus2_iff -> minus_dvd_iff
6100 zdvd_zmultD -> dvd_mult_right
6101 zdvd_zmultD2 -> dvd_mult_left
6102 zdvd_zmult_mono -> mult_dvd_mono
6103 zdvd_0_right -> dvd_0_right
6104 zdvd_0_left -> dvd_0_left_iff
6105 zdvd_1_left -> one_dvd
6106 zminus_dvd_iff -> minus_dvd_iff
6108 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6110 * The real numbers offer decimal input syntax: 12.34 is translated
6111 into 1234/10^2. This translation is not reversed upon output.
6113 * Theory Library/Polynomial defines an abstract type 'a poly of
6114 univariate polynomials with coefficients of type 'a. In addition to
6115 the standard ring operations, it also supports div and mod. Code
6116 generation is also supported, using list-style constructors.
6118 * Theory Library/Inner_Product defines a class of real_inner for real
6119 inner product spaces, with an overloaded operation inner :: 'a => 'a
6120 => real. Class real_inner is a subclass of real_normed_vector from
6123 * Theory Library/Product_Vector provides instances for the product
6124 type 'a * 'b of several classes from RealVector and Inner_Product.
6125 Definitions of addition, subtraction, scalar multiplication, norms,
6126 and inner products are included.
6128 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6129 addition to the field operations, numerals and case syntax are also
6132 * Theory Library/Diagonalize provides constructive version of Cantor's
6133 first diagonalization argument.
6135 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6136 zlcm (for int); carried together from various gcd/lcm developements in
6137 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6138 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6139 may recover tupled syntax as follows:
6141 hide (open) const gcd
6142 abbreviation gcd where
6143 "gcd == (%(a, b). GCD.gcd a b)"
6145 GCD.gcd ("gcd '(_, _')")
6147 The same works for lcm, zgcd, zlcm.
6149 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6150 instantiations for algebraic structures. Removed some duplicate
6151 theorems. Changes in simp rules. INCOMPATIBILITY.
6153 * ML antiquotation @{code} takes a constant as argument and generates
6154 corresponding code in background and inserts name of the corresponding
6155 resulting ML value/function/datatype constructor binding in place.
6156 All occurrences of @{code} with a single ML block are generated
6157 simultaneously. Provides a generic and safe interface for
6158 instrumentalizing code generation. See
6159 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6160 In future you ought to refrain from ad-hoc compiling generated SML
6161 code on the ML toplevel. Note that (for technical reasons) @{code}
6162 cannot refer to constants for which user-defined serializations are
6163 set. Refer to the corresponding ML counterpart directly in that
6166 * Command 'rep_datatype': instead of theorem names the command now
6167 takes a list of terms denoting the constructors of the type to be
6168 represented as datatype. The characteristic theorems have to be
6169 proven. INCOMPATIBILITY. Also observe that the following theorems
6170 have disappeared in favour of existing ones:
6172 unit_induct ~> unit.induct
6173 prod_induct ~> prod.induct
6174 sum_induct ~> sum.induct
6175 Suc_Suc_eq ~> nat.inject
6176 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6181 * New locales for orders and lattices where the equivalence relation
6182 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6183 locales use a record structure with field eq for the equivalence.
6185 * New theory of factorial domains.
6187 * Units_l_inv and Units_r_inv are now simp rules by default.
6188 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6189 and/or r_inv will now also require deletion of these lemmas.
6191 * Renamed the following theorems, INCOMPATIBILITY:
6193 UpperD ~> Upper_memD
6194 LowerD ~> Lower_memD
6195 least_carrier ~> least_closed
6196 greatest_carrier ~> greatest_closed
6197 greatest_Lower_above ~> greatest_Lower_below
6198 one_zero ~> carrier_one_zero
6199 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6204 * Nominal datatypes can now contain type-variables.
6206 * Commands 'nominal_inductive' and 'equivariance' work with local
6209 * Nominal primrec can now works with local theory targets and its
6210 specification syntax now conforms to the general format as seen in
6213 * Method "perm_simp" honours the standard simplifier attributes
6214 (no_asm), (no_asm_use) etc.
6216 * The new predicate #* is defined like freshness, except that on the
6217 left hand side can be a set or list of atoms.
6219 * Experimental command 'nominal_inductive2' derives strong induction
6220 principles for inductive definitions. In contrast to
6221 'nominal_inductive', which can only deal with a fixed number of
6222 binders, it can deal with arbitrary expressions standing for sets of
6223 atoms to be avoided. The only inductive definition we have at the
6224 moment that needs this generalisation is the typing rule for Lets in
6227 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6228 -----------------------------------------------------------------
6229 Gamma |- Let x be t1 in t2 : T2
6231 In this rule one wants to avoid all the binders that are introduced by
6232 "close Gamma T1". We are looking for other examples where this
6233 feature might be useful. Please let us know.
6238 * Reimplemented the simplification procedure for proving continuity
6239 subgoals. The new simproc is extensible; users can declare additional
6240 continuity introduction rules with the attribute [cont2cont].
6242 * The continuity simproc now uses a different introduction rule for
6243 solving continuity subgoals on terms with lambda abstractions. In
6244 some rare cases the new simproc may fail to solve subgoals that the
6245 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6246 Potential INCOMPATIBILITY.
6248 * Command 'fixrec': specification syntax now conforms to the general
6249 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6250 examples. INCOMPATIBILITY.
6255 * Proof of Zorn's Lemma for partial orders.
6260 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6261 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6262 depends on multithreading, so timouts will not work before Poly/ML
6265 * High-level support for concurrent ML programming, see
6266 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6267 particularly convenient to organize independent functional
6268 computations. The concept of "synchronized variables" provides a
6269 higher-order interface for components with shared state, avoiding the
6270 delicate details of mutexes and condition variables. (Requires
6271 Poly/ML 5.2.1 or later.)
6273 * ML bindings produced via Isar commands are stored within the Isar
6274 context (theory or proof). Consequently, commands like 'use' and 'ML'
6275 become thread-safe and work with undo as expected (concerning
6276 top-level bindings, not side-effects on global references).
6277 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6278 compiler at runtime; really global bindings need to be given outside a
6279 theory. (Requires Poly/ML 5.2 or later.)
6281 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6282 context. Top-level ML bindings are stored within the proof context in
6283 a purely sequential fashion, disregarding the nested proof structure.
6284 ML bindings introduced by 'ML_prf' are discarded at the end of the
6285 proof. (Requires Poly/ML 5.2 or later.)
6287 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6288 and Method.setup, as well as Isar commands 'attribute_setup' and
6289 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6290 existing code accordingly, or use plain 'setup' together with old
6293 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6294 to 'a -> thm, while results are always tagged with an authentic oracle
6295 name. The Isar command 'oracle' is now polymorphic, no argument type
6296 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6297 accordingly. Note that extra performance may be gained by producing
6298 the cterm carefully, avoiding slow Thm.cterm_of.
6300 * Simplified interface for defining document antiquotations via
6301 ThyOutput.antiquotation, ThyOutput.output, and optionally
6302 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6303 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6306 * More systematic treatment of long names, abstract name bindings, and
6307 name space operations. Basic operations on qualified names have been
6308 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6309 Long_Name.append. Old type bstring has been mostly replaced by
6310 abstract type binding (see structure Binding), which supports precise
6311 qualification by packages and local theory targets, as well as proper
6312 tracking of source positions. INCOMPATIBILITY, need to wrap old
6313 bstring values into Binding.name, or better pass through abstract
6314 bindings everywhere. See further src/Pure/General/long_name.ML,
6315 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6317 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6318 LocalTheory.note etc.) now refer to the *full* internal name, not the
6319 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6321 * Disposed old type and term read functions (Sign.read_def_typ,
6322 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6323 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6324 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6325 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6326 resort for legacy applications.
6328 * Disposed old declarations, tactics, tactic combinators that refer to
6329 the simpset or claset of an implicit theory (such as Addsimps,
6330 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6331 embedded ML text, or local_simpset_of with a proper context passed as
6332 explicit runtime argument.
6334 * Rules and tactics that read instantiations (read_instantiate,
6335 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6336 context, which is required for parsing and type-checking. Moreover,
6337 the variables are specified as plain indexnames, not string encodings
6338 thereof. INCOMPATIBILITY.
6340 * Generic Toplevel.add_hook interface allows to analyze the result of
6341 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6342 for theorem dependency output of transactions resulting in a new
6345 * ML antiquotations: block-structured compilation context indicated by
6346 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6348 @{binding name} - basic name binding
6349 @{let ?pat = term} - term abbreviation (HO matching)
6350 @{note name = fact} - fact abbreviation
6351 @{thm fact} - singleton fact (with attributes)
6352 @{thms fact} - general fact (with attributes)
6353 @{lemma prop by method} - singleton goal
6354 @{lemma prop by meth1 meth2} - singleton goal
6355 @{lemma prop1 ... propN by method} - general goal
6356 @{lemma prop1 ... propN by meth1 meth2} - general goal
6357 @{lemma (open) ...} - open derivation
6362 * The Isabelle "emacs" tool provides a specific interface to invoke
6363 Proof General / Emacs, with more explicit failure if that is not
6364 installed (the old isabelle-interface script silently falls back on
6365 isabelle-process). The PROOFGENERAL_HOME setting determines the
6366 installation location of the Proof General distribution.
6368 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6369 the Isabelle process into a JVM/Scala application. See
6370 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6371 process wrapper has been discontinued.)
6373 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6375 * Various status messages (with exact source position information) are
6376 emitted, if proper markup print mode is enabled. This allows
6377 user-interface components to provide detailed feedback on internal
6382 New in Isabelle2008 (June 2008)
6383 -------------------------------
6387 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6388 and updated, with formally checked references as hyperlinks.
6390 * Theory loader: use_thy (and similar operations) no longer set the
6391 implicit ML context, which was occasionally hard to predict and in
6392 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6393 provides a proper context already.
6395 * Theory loader: old-style ML proof scripts being *attached* to a thy
6396 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6397 'use' within a theory file will do the job.
6399 * Name space merge now observes canonical order, i.e. the second space
6400 is inserted into the first one, while existing entries in the first
6401 space take precedence. INCOMPATIBILITY in rare situations, may try to
6402 swap theory imports.
6404 * Syntax: symbol \<chi> is now considered a letter. Potential
6405 INCOMPATIBILITY in identifier syntax etc.
6407 * Outer syntax: string tokens no longer admit escaped white space,
6408 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6409 white space without escapes.
6411 * Outer syntax: string tokens may contain arbitrary character codes
6412 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6418 * Context-dependent token translations. Default setup reverts locally
6419 fixed variables, and adds hilite markup for undeclared frees.
6421 * Unused theorems can be found using the new command 'unused_thms'.
6422 There are three ways of invoking it:
6425 Only finds unused theorems in the current theory.
6427 (2) unused_thms thy_1 ... thy_n -
6428 Finds unused theorems in the current theory and all of its ancestors,
6429 excluding the theories thy_1 ... thy_n and all of their ancestors.
6431 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6432 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6433 their ancestors, excluding the theories thy_1 ... thy_n and all of
6436 In order to increase the readability of the list produced by
6437 unused_thms, theorems that have been created by a particular instance
6438 of a theory command such as 'inductive' or 'function' are considered
6439 to belong to the same "group", meaning that if at least one theorem in
6440 this group is used, the other theorems in the same group are no longer
6441 reported as unused. Moreover, if all theorems in the group are
6442 unused, only one theorem in the group is displayed.
6444 Note that proof objects have to be switched on in order for
6445 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6446 usually the case when using Proof General with the default settings).
6448 * Authentic naming of facts disallows ad-hoc overwriting of previous
6449 theorems within the same name space. INCOMPATIBILITY, need to remove
6450 duplicate fact bindings, or even accidental fact duplications. Note
6451 that tools may maintain dynamically scoped facts systematically, using
6452 PureThy.add_thms_dynamic.
6454 * Command 'hide' now allows to hide from "fact" name space as well.
6456 * Eliminated destructive theorem database, simpset, claset, and
6457 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6458 update of theories within ML code.
6460 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6461 INCOMPATIBILITY, object-logics depending on former Pure require
6462 additional setup PureThy.old_appl_syntax_setup; object-logics
6463 depending on former CPure need to refer to Pure.
6465 * Commands 'use' and 'ML' are now purely functional, operating on
6466 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6467 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6470 * Command 'setup': discontinued implicit version with ML reference.
6472 * Instantiation target allows for simultaneous specification of class
6473 instance operations together with an instantiation proof.
6474 Type-checking phase allows to refer to class operations uniformly.
6475 See src/HOL/Complex/Complex.thy for an Isar example and
6476 src/HOL/Library/Eval.thy for an ML example.
6478 * Indexing of literal facts: be more serious about including only
6479 facts from the visible specification/proof context, but not the
6480 background context (locale etc.). Affects `prop` notation and method
6481 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6484 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6485 "(open)" option, which used to expose internal bound variables to the
6488 * Isar statements: removed obsolete case "rule_context".
6489 INCOMPATIBILITY, better use explicit fixes/assumes.
6491 * Locale proofs: default proof step now includes 'unfold_locales';
6492 hence 'proof' without argument may be used to unfold locale
6496 *** Document preparation ***
6498 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6499 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6500 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6501 spot); renamed link color from "darkblue" to "linkcolor" (default
6502 value unchanged, can be redefined via \definecolor); no longer sets
6503 "a4paper" option (unnecessary or even intrusive).
6505 * Antiquotation @{lemma A method} proves proposition A by the given
6506 method (either a method name or a method name plus (optional) method
6507 arguments in parentheses) and prints A just like @{prop A}.
6512 * New primrec package. Specification syntax conforms in style to
6513 definition/function/.... No separate induction rule is provided. The
6514 "primrec" command distinguishes old-style and new-style specifications
6515 by syntax. The former primrec package is now named OldPrimrecPackage.
6516 When adjusting theories, beware: constants stemming from new-style
6517 primrec specifications have authentic syntax.
6519 * Metis prover is now an order of magnitude faster, and also works
6520 with multithreading.
6522 * Metis: the maximum number of clauses that can be produced from a
6523 theorem is now given by the attribute max_clauses. Theorems that
6524 exceed this number are ignored, with a warning printed.
6526 * Sledgehammer no longer produces structured proofs by default. To
6527 enable, declare [[sledgehammer_full = true]]. Attributes
6528 reconstruction_modulus, reconstruction_sorts renamed
6529 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6531 * Method "induct_scheme" derives user-specified induction rules
6532 from well-founded induction and completeness of patterns. This factors
6533 out some operations that are done internally by the function package
6534 and makes them available separately. See
6535 src/HOL/ex/Induction_Scheme.thy for examples.
6537 * More flexible generation of measure functions for termination
6538 proofs: Measure functions can be declared by proving a rule of the
6539 form "is_measure f" and giving it the [measure_function] attribute.
6540 The "is_measure" predicate is logically meaningless (always true), and
6541 just guides the heuristic. To find suitable measure functions, the
6542 termination prover sets up the goal "is_measure ?f" of the appropriate
6543 type and generates all solutions by Prolog-style backward proof using
6546 This setup also deals with rules like
6548 "is_measure f ==> is_measure (list_size f)"
6550 which accommodates nested datatypes that recurse through lists.
6551 Similar rules are predeclared for products and option types.
6553 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6557 - Definitions of overloaded constants on sets have to be replaced by
6558 definitions on => and bool.
6560 - Some definitions of overloaded operators on sets can now be proved
6561 using the definitions of the operators on => and bool. Therefore,
6562 the following theorems have been renamed:
6564 subset_def -> subset_eq
6565 psubset_def -> psubset_eq
6566 set_diff_def -> set_diff_eq
6567 Compl_def -> Compl_eq
6568 Sup_set_def -> Sup_set_eq
6569 Inf_set_def -> Inf_set_eq
6570 sup_set_def -> sup_set_eq
6571 inf_set_def -> inf_set_eq
6573 - Due to the incompleteness of the HO unification algorithm, some
6574 rules such as subst may require manual instantiation, if some of
6575 the unknowns in the rule is a set.
6577 - Higher order unification and forward proofs:
6580 have "P (S::'a set)" <...>
6581 then have "EX S. P S" ..
6583 no longer works (due to the incompleteness of the HO unification
6584 algorithm) and must be replaced by the pattern
6591 - Calculational reasoning with subst (or similar rules):
6594 have "P (S::'a set)" <...>
6595 also have "S = T" <...>
6596 finally have "P T" .
6598 no longer works (for similar reasons as the previous example) and
6599 must be replaced by something like
6601 have "P (S::'a set)" <...>
6602 moreover have "S = T" <...>
6603 ultimately have "P T" by simp
6605 - Tactics or packages written in ML code:
6606 Code performing pattern matching on types via
6608 Type ("set", [T]) => ...
6610 must be rewritten. Moreover, functions like strip_type or
6611 binder_types no longer return the right value when applied to a
6614 T1 => ... => Tn => U => bool
6618 T1 => ... => Tn => U set
6620 * Merged theories Wellfounded_Recursion, Accessible_Part and
6621 Wellfounded_Relations to theory Wellfounded.
6623 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6625 * Class finite no longer treats UNIV as class parameter. Use class
6626 enum from theory Library/Enum instead to achieve a similar effect.
6629 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6630 and "Cons". INCOMPATIBILITY.
6632 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6633 Potential INCOMPATIBILITY.
6635 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6636 injective_fst_snd removed, use split_eta and prod_eqI instead.
6637 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6639 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6640 the same name in theory Orderings:
6650 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6651 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6652 and different variable names.
6654 * Library/Option_ord.thy: Canonical order on option type.
6656 * Library/RBT.thy: Red-black trees, an efficient implementation of
6659 * Library/Countable.thy: Type class for countable types.
6661 * Theory Int: The representation of numerals has changed. The infix
6662 operator BIT and the bit datatype with constructors B0 and B1 have
6663 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6664 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6665 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6668 * Theory Nat: definition of <= and < on natural numbers no longer
6669 depend on well-founded relations. INCOMPATIBILITY. Definitions
6670 le_def and less_def have disappeared. Consider lemmas not_less
6671 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6673 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6674 (whose purpose mainly is for various fold_set functionals) have been
6675 abandoned in favor of the existing algebraic classes
6676 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6677 lower_semilattice (resp. upper_semilattice) and linorder.
6680 * Theory Transitive_Closure: induct and cases rules now declare proper
6681 case_names ("base" and "step"). INCOMPATIBILITY.
6683 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6684 lattices. The form set-specific version is available as
6685 Inductive.lfp_ordinal_induct_set.
6687 * Renamed theorems "power.simps" to "power_int.simps".
6690 * Class semiring_div provides basic abstract properties of semirings
6691 with division and modulo operations. Subsumes former class dvd_mod.
6693 * Merged theories IntDef, Numeral and IntArith into unified theory
6694 Int. INCOMPATIBILITY.
6696 * Theory Library/Code_Index: type "index" now represents natural
6697 numbers rather than integers. INCOMPATIBILITY.
6699 * New class "uminus" with operation "uminus" (split of from class
6700 "minus" which now only has operation "minus", binary).
6703 * Constants "card", "internal_split", "option_map" now with authentic
6704 syntax. INCOMPATIBILITY.
6706 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6707 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6708 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6709 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6710 Sup_set_def, le_def, less_def, option_map_def now with object
6711 equality. INCOMPATIBILITY.
6713 * Records. Removed K_record, and replaced it by pure lambda term
6714 %x. c. The simplifier setup is now more robust against eta expansion.
6715 INCOMPATIBILITY: in cases explicitly referring to K_record.
6717 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6719 * Library/ListVector: new theory of arithmetic vector operations.
6721 * Library/Order_Relation: new theory of various orderings as sets of
6722 pairs. Defines preorders, partial orders, linear orders and
6723 well-orders on sets and on types.
6728 * Renamed some theories to allow to loading both ZF and HOL in the
6731 Datatype -> Datatype_ZF
6732 Inductive -> Inductive_ZF
6739 INCOMPATIBILITY: ZF theories that import individual theories below
6740 Main might need to be adapted. Regular theory Main is still
6741 available, as trivial extension of Main_ZF.
6746 * ML within Isar: antiquotation @{const name} or @{const
6747 name(typargs)} produces statically-checked Const term.
6749 * Functor NamedThmsFun: data is available to the user as dynamic fact
6750 (of the same name). Removed obsolete print command.
6752 * Removed obsolete "use_legacy_bindings" function.
6754 * The ``print mode'' is now a thread-local value derived from a global
6755 template (the former print_mode reference), thus access becomes
6756 non-critical. The global print_mode reference is for session
6757 management only; user-code should use print_mode_value,
6758 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6760 * Functions system/system_out provide a robust way to invoke external
6761 shell commands, with propagation of interrupts (requires Poly/ML
6762 5.2.1). Do not use OS.Process.system etc. from the basis library!
6767 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6768 in accordance with Proof General 3.7, which prefers GNU emacs.
6770 * isatool tty runs Isabelle process with plain tty interaction;
6771 optional line editor may be specified via ISABELLE_LINE_EDITOR
6772 setting, the default settings attempt to locate "ledit" and "rlwrap".
6774 * isatool browser now works with Cygwin as well, using general
6775 "javapath" function defined in Isabelle process environment.
6777 * YXML notation provides a simple and efficient alternative to
6778 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6779 isatool yxml as described in the Isabelle system manual.
6781 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6782 provides general wrapper for managing an Isabelle process in a robust
6783 fashion, with ``cooked'' output from stdin/stderr.
6785 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6786 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6788 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6789 way of changing the user's settings is via
6790 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6793 * Multithreading.max_threads := 0 refers to the number of actual CPU
6794 cores of the underlying machine, which is a good starting point for
6795 optimal performance tuning. The corresponding usedir option -M allows
6796 "max" as an alias for "0". WARNING: does not work on certain versions
6797 of Mac OS (with Poly/ML 5.1).
6799 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6800 adverse effect of Isabelle flooding interactive front-ends (notably
6801 ProofGeneral / XEmacs).
6805 New in Isabelle2007 (November 2007)
6806 -----------------------------------
6810 * More uniform information about legacy features, notably a
6811 warning/error of "Legacy feature: ...", depending on the state of the
6812 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6813 legacy features will disappear eventually.
6815 * Theory syntax: the header format ``theory A = B + C:'' has been
6816 discontinued in favour of ``theory A imports B C begin''. Use isatool
6817 fixheaders to convert existing theory files. INCOMPATIBILITY.
6819 * Theory syntax: the old non-Isar theory file format has been
6820 discontinued altogether. Note that ML proof scripts may still be used
6821 with Isar theories; migration is usually quite simple with the ML
6822 function use_legacy_bindings. INCOMPATIBILITY.
6824 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6825 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6828 * Theory loader: be more serious about observing the static theory
6829 header specifications (including optional directories), but not the
6830 accidental file locations of previously successful loads. The strict
6831 update policy of former update_thy is now already performed by
6832 use_thy, so the former has been removed; use_thys updates several
6833 theories simultaneously, just as 'imports' within a theory header
6834 specification, but without merging the results. Potential
6835 INCOMPATIBILITY: may need to refine theory headers and commands
6836 ROOT.ML which depend on load order.
6838 * Theory loader: optional support for content-based file
6839 identification, instead of the traditional scheme of full physical
6840 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6841 (cf. the system manual). The new scheme allows to work with
6842 non-finished theories in persistent session images, such that source
6843 files may be moved later on without requiring reloads.
6845 * Theory loader: old-style ML proof scripts being *attached* to a thy
6846 file (with the same base name as the theory) are considered a legacy
6847 feature, which will disappear eventually. Even now, the theory loader
6848 no longer maintains dependencies on such files.
6850 * Syntax: the scope for resolving ambiguities via type-inference is
6851 now limited to individual terms, instead of whole simultaneous
6852 specifications as before. This greatly reduces the complexity of the
6853 syntax module and improves flexibility by separating parsing and
6854 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6855 'fixes' etc.) are required in rare situations.
6857 * Syntax: constants introduced by new-style packages ('definition',
6858 'abbreviation' etc.) are passed through the syntax module in
6859 ``authentic mode''. This means that associated mixfix annotations
6860 really stick to such constants, independently of potential name space
6861 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6862 trees are represented slightly differently, may need to adapt syntax
6863 translations accordingly. Use CONST marker in 'translations' and
6864 @{const_syntax} antiquotation in 'parse_translation' etc.
6866 * Legacy goal package: reduced interface to the bare minimum required
6867 to keep existing proof scripts running. Most other user-level
6868 functions are now part of the OldGoals structure, which is *not* open
6869 by default (consider isatool expandshort before open OldGoals).
6870 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6871 these tend to cause confusion about the actual goal (!) context being
6872 used here, which is not necessarily the same as the_context().
6874 * Command 'find_theorems': supports "*" wild-card in "name:"
6875 criterion; "with_dups" option. Certain ProofGeneral versions might
6876 support a specific search form (see ProofGeneral/CHANGES).
6878 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6879 by default, which means that "prems" (and also "fixed variables") are
6880 suppressed from proof state output. Note that the ProofGeneral
6881 settings mechanism allows to change and save options persistently, but
6882 older versions of Isabelle will fail to start up if a negative prems
6885 * Local theory targets may be specified by non-nested blocks of
6886 ``context/locale/class ... begin'' followed by ``end''. The body may
6887 contain definitions, theorems etc., including any derived mechanism
6888 that has been implemented on top of these primitives. This concept
6889 generalizes the existing ``theorem (in ...)'' towards more versatility
6892 * Proof General interface: proper undo of final 'end' command;
6893 discontinued Isabelle/classic mode (ML proof scripts).
6896 *** Document preparation ***
6898 * Added antiquotation @{theory name} which prints the given name,
6899 after checking that it refers to a valid ancestor theory in the
6902 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6903 check the given source text as ML type/structure, printing verbatim.
6905 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6906 "c args == rhs" given in the current context. (Any number of
6907 arguments may be given on the LHS.)
6912 * The 'class' package offers a combination of axclass and locale to
6913 achieve Haskell-like type classes in Isabelle. Definitions and
6914 theorems within a class context produce both relative results (with
6915 implicit parameters according to the locale context), and polymorphic
6916 constants with qualified polymorphism (according to the class
6917 context). Within the body context of a 'class' target, a separate
6918 syntax layer ("user space type system") takes care of converting
6919 between global polymorphic consts and internal locale representation.
6920 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6921 "isatool doc classes" provides a tutorial.
6923 * Generic code generator framework allows to generate executable
6924 code for ML and Haskell (including Isabelle classes). A short usage
6927 internal compilation:
6928 export_code <list of constants (term syntax)> in SML
6929 writing SML code to a file:
6930 export_code <list of constants (term syntax)> in SML <filename>
6931 writing OCaml code to a file:
6932 export_code <list of constants (term syntax)> in OCaml <filename>
6933 writing Haskell code to a bunch of files:
6934 export_code <list of constants (term syntax)> in Haskell <filename>
6936 evaluating closed propositions to True/False using code generation:
6939 Reasonable default setup of framework in HOL.
6941 Theorem attributs for selecting and transforming function equations theorems:
6943 [code fun]: select a theorem as function equation for a specific constant
6944 [code fun del]: deselect a theorem as function equation for a specific constant
6945 [code inline]: select an equation theorem for unfolding (inlining) in place
6946 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6948 User-defined serializations (target in {SML, OCaml, Haskell}):
6950 code_const <and-list of constants (term syntax)>
6951 {(target) <and-list of const target syntax>}+
6953 code_type <and-list of type constructors>
6954 {(target) <and-list of type target syntax>}+
6956 code_instance <and-list of instances>
6958 where instance ::= <type constructor> :: <class>
6960 code_class <and_list of classes>
6961 {(target) <and-list of class target syntax>}+
6962 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6964 code_instance and code_class only are effective to target Haskell.
6966 For example usage see src/HOL/ex/Codegenerator.thy and
6967 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6968 generation from Isabelle/HOL theories is available via "isatool doc
6971 * Code generator: consts in 'consts_code' Isar commands are now
6972 referred to by usual term syntax (including optional type
6975 * Command 'no_translations' removes translation rules from theory
6978 * Overloaded definitions are now actually checked for acyclic
6979 dependencies. The overloading scheme is slightly more general than
6980 that of Haskell98, although Isabelle does not demand an exact
6981 correspondence to type class and instance declarations.
6982 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6983 exotic versions of overloading -- at the discretion of the user!
6985 Polymorphic constants are represented via type arguments, i.e. the
6986 instantiation that matches an instance against the most general
6987 declaration given in the signature. For example, with the declaration
6988 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6989 as c(nat). Overloading is essentially simultaneous structural
6990 recursion over such type arguments. Incomplete specification patterns
6991 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6992 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6993 Command 'print_theory' outputs the normalized system of recursive
6994 equations, see section "definitions".
6996 * Configuration options are maintained within the theory or proof
6997 context (with name and type bool/int/string), providing a very simple
6998 interface to a poor-man's version of general context data. Tools may
6999 declare options in ML (e.g. using Attrib.config_int) and then refer to
7000 these values using Config.get etc. Users may change options via an
7001 associated attribute of the same name. This form of context
7002 declaration works particularly well with commands 'declare' or
7003 'using', for example ``declare [[foo = 42]]''. Thus it has become
7004 very easy to avoid global references, which would not observe Isar
7005 toplevel undo/redo and fail to work with multithreading.
7007 Various global ML references of Pure and HOL have been turned into
7008 configuration options:
7010 Unify.search_bound unify_search_bound
7011 Unify.trace_bound unify_trace_bound
7012 Unify.trace_simp unify_trace_simp
7013 Unify.trace_types unify_trace_types
7014 Simplifier.simp_depth_limit simp_depth_limit
7015 Blast.depth_limit blast_depth_limit
7016 DatatypeProp.dtK datatype_distinctness_limit
7017 fast_arith_neq_limit fast_arith_neq_limit
7018 fast_arith_split_limit fast_arith_split_limit
7020 * Named collections of theorems may be easily installed as context
7021 data using the functor NamedThmsFun (see also
7022 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
7023 attributes; there is also a toplevel print command. This facility is
7024 just a common case of general context data, which is the preferred way
7025 for anything more complex than just a list of facts in canonical
7028 * Isar: command 'declaration' augments a local theory by generic
7029 declaration functions written in ML. This enables arbitrary content
7030 being added to the context, depending on a morphism that tells the
7031 difference of the original declaration context wrt. the application
7032 context encountered later on.
7034 * Isar: proper interfaces for simplification procedures. Command
7035 'simproc_setup' declares named simprocs (with match patterns, and body
7036 text in ML). Attribute "simproc" adds/deletes simprocs in the current
7037 context. ML antiquotation @{simproc name} retrieves named simprocs.
7039 * Isar: an extra pair of brackets around attribute declarations
7040 abbreviates a theorem reference involving an internal dummy fact,
7041 which will be ignored later --- only the effect of the attribute on
7042 the background context will persist. This form of in-place
7043 declarations is particularly useful with commands like 'declare' and
7044 'using', for example ``have A using [[simproc a]] by simp''.
7046 * Isar: method "assumption" (and implicit closing of subproofs) now
7047 takes simple non-atomic goal assumptions into account: after applying
7048 an assumption as a rule the resulting subgoals are solved by atomic
7049 assumption steps. This is particularly useful to finish 'obtain'
7050 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
7051 without referring to the original premise "!!x. P x ==> thesis" in the
7052 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
7055 * Isar: implicit use of prems from the Isar proof context is
7056 considered a legacy feature. Common applications like ``have A .''
7057 may be replaced by ``have A by fact'' or ``note `A`''. In general,
7058 referencing facts explicitly here improves readability and
7059 maintainability of proof texts.
7061 * Isar: improper proof element 'guess' is like 'obtain', but derives
7062 the obtained context from the course of reasoning! For example:
7064 assume "EX x y. A x & B y" -- "any previous fact"
7065 then guess x and y by clarify
7067 This technique is potentially adventurous, depending on the facts and
7068 proof tools being involved here.
7070 * Isar: known facts from the proof context may be specified as literal
7071 propositions, using ASCII back-quote syntax. This works wherever
7072 named facts used to be allowed so far, in proof commands, proof
7073 methods, attributes etc. Literal facts are retrieved from the context
7074 according to unification of type and term parameters. For example,
7075 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
7076 theorems in the current context, then these are valid literal facts:
7077 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
7079 There is also a proof method "fact" which does the same composition
7080 for explicit goal states, e.g. the following proof texts coincide with
7081 certain special cases of literal facts:
7083 have "A" by fact == note `A`
7084 have "A ==> B" by fact == note `A ==> B`
7085 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7086 have "P a ==> Q a" by fact == note `P a ==> Q a`
7088 * Isar: ":" (colon) is no longer a symbolic identifier character in
7089 outer syntax. Thus symbolic identifiers may be used without
7090 additional white space in declarations like this: ``assume *: A''.
7092 * Isar: 'print_facts' prints all local facts of the current context,
7093 both named and unnamed ones.
7095 * Isar: 'def' now admits simultaneous definitions, e.g.:
7097 def x == "t" and y == "u"
7099 * Isar: added command 'unfolding', which is structurally similar to
7100 'using', but affects both the goal state and facts by unfolding given
7101 rewrite rules. Thus many occurrences of the 'unfold' method or
7102 'unfolded' attribute may be replaced by first-class proof text.
7104 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7105 and command 'unfolding' now all support object-level equalities
7106 (potentially conditional). The underlying notion of rewrite rule is
7107 analogous to the 'rule_format' attribute, but *not* that of the
7108 Simplifier (which is usually more generous).
7110 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7111 premises of a theorem by n. Useful in conjunction with drule.
7113 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7114 method expression within a sandbox consisting of the first N
7115 sub-goals, which need to exist. For example, ``simp_all [3]''
7116 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7117 simplifies all new goals that emerge from applying rule foo to the
7118 originally first one.
7120 * Isar: schematic goals are no longer restricted to higher-order
7121 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7124 * Isar: the conclusion of a long theorem statement is now either
7125 'shows' (a simultaneous conjunction, as before), or 'obtains'
7126 (essentially a disjunction of cases with local parameters and
7127 assumptions). The latter allows to express general elimination rules
7128 adequately; in this notation common elimination rules look like this:
7130 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7132 obtains x where "P x"
7134 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7138 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7144 The subsequent classical rules even refer to the formal "thesis"
7147 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7150 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7151 obtains "thesis ==> something"
7153 The actual proof of an 'obtains' statement is analogous to that of the
7154 Isar proof element 'obtain', only that there may be several cases.
7155 Optional case names may be specified in parentheses; these will be
7156 available both in the present proof and as annotations in the
7157 resulting rule, for later use with the 'cases' method (cf. attribute
7160 * Isar: the assumptions of a long theorem statement are available as
7161 "assms" fact in the proof context. This is more appropriate than the
7162 (historical) "prems", which refers to all assumptions of the current
7163 context, including those from the target locale, proof body etc.
7165 * Isar: 'print_statement' prints theorems from the current theory or
7166 proof context in long statement form, according to the syntax of a
7169 * Isar: 'obtain' takes an optional case name for the local context
7170 introduction rule (default "that").
7172 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7173 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7176 * Pure: syntax "CONST name" produces a fully internalized constant
7177 according to the current context. This is particularly useful for
7178 syntax translations that should refer to internal constant
7179 representations independently of name spaces.
7181 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7182 instead of "FOO ". This allows multiple binder declarations to coexist
7183 in the same context. INCOMPATIBILITY.
7185 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7186 primitive that also works in a locale context (both for constants and
7187 fixed variables). Type declaration and internal syntactic representation
7188 of given constants retrieved from the context. Likewise, the
7189 'no_notation' command allows to remove given syntax annotations from the
7192 * Isar/locales: new derived specification elements 'axiomatization',
7193 'definition', 'abbreviation', which support type-inference, admit
7194 object-level specifications (equality, equivalence). See also the
7195 isar-ref manual. Examples:
7198 eq (infix "===" 50) where
7199 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7201 definition "f x y = x + y + 1"
7202 definition g where "g x = f x x"
7205 neq (infix "=!=" 50) where
7206 "x =!= y == ~ (x === y)"
7208 These specifications may be also used in a locale context. Then the
7209 constants being introduced depend on certain fixed parameters, and the
7210 constant name is qualified by the locale base name. An internal
7211 abbreviation takes care for convenient input and output, making the
7212 parameters implicit and using the original short name. See also
7213 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7214 entities from a monomorphic theory.
7216 Presently, abbreviations are only available 'in' a target locale, but
7217 not inherited by general import expressions. Also note that
7218 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7219 'translations' in common applications. The "no_abbrevs" print mode
7220 prevents folding of abbreviations in term output.
7222 Concrete syntax is attached to specified constants in internal form,
7223 independently of name spaces. The parse tree representation is
7224 slightly different -- use 'notation' instead of raw 'syntax', and
7225 'translations' with explicit "CONST" markup to accommodate this.
7227 * Pure/Isar: unified syntax for new-style specification mechanisms
7228 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7229 full type inference and dummy patterns ("_"). For example:
7231 definition "K x _ = x"
7233 inductive conj for A B
7234 where "A ==> B ==> conj A B"
7236 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7237 the current context. Print mode "no_abbrevs" prevents inversion of
7238 abbreviations on output.
7240 * Isar/locales: improved parameter handling: use of locales "var" and
7241 "struct" no longer necessary; - parameter renamings are no longer
7242 required to be injective. For example, this allows to define
7243 endomorphisms as locale endom = homom mult mult h.
7245 * Isar/locales: changed the way locales with predicates are defined.
7246 Instead of accumulating the specification, the imported expression is
7247 now an interpretation. INCOMPATIBILITY: different normal form of
7248 locale expressions. In particular, in interpretations of locales with
7249 predicates, goals repesenting already interpreted fragments are not
7250 removed automatically. Use methods `intro_locales' and
7251 `unfold_locales'; see below.
7253 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7254 provide backward reasoning on locales predicates. The methods are
7255 aware of interpretations and discharge corresponding goals.
7256 `intro_locales' is less aggressive then `unfold_locales' and does not
7257 unfold predicates to assumptions.
7259 * Isar/locales: the order in which locale fragments are accumulated
7260 has changed. This enables to override declarations from fragments due
7261 to interpretations -- for example, unwanted simp rules.
7263 * Isar/locales: interpretation in theories and proof contexts has been
7264 extended. One may now specify (and prove) equations, which are
7265 unfolded in interpreted theorems. This is useful for replacing
7266 defined concepts (constants depending on locale parameters) by
7267 concepts already existing in the target context. Example:
7269 interpretation partial_order ["op <= :: [int, int] => bool"]
7270 where "partial_order.less (op <=) (x::int) y = (x < y)"
7272 Typically, the constant `partial_order.less' is created by a
7273 definition specification element in the context of locale
7276 * Method "induct": improved internal context management to support
7277 local fixes and defines on-the-fly. Thus explicit meta-level
7278 connectives !! and ==> are rarely required anymore in inductive goals
7279 (using object-logic connectives for this purpose has been long
7280 obsolete anyway). Common proof patterns are explained in
7281 src/HOL/Induct/Common_Patterns.thy, see also
7282 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7285 * Method "induct": improved handling of simultaneous goals. Instead of
7286 introducing object-level conjunction, the statement is now split into
7287 several conclusions, while the corresponding symbolic cases are nested
7288 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7289 see src/HOL/Induct/Common_Patterns.thy, for example.
7291 * Method "induct": mutual induction rules are now specified as a list
7292 of rule sharing the same induction cases. HOL packages usually provide
7293 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7294 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7295 mutual induction rules differently, i.e. like this:
7297 (induct rule: foo_bar.inducts)
7298 (induct set: foo bar)
7299 (induct pred: foo bar)
7300 (induct type: foo bar)
7302 The ML function ProjectRule.projections turns old-style rules into the
7305 * Method "coinduct": dual of induction, see
7306 src/HOL/Library/Coinductive_List.thy for various examples.
7308 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7309 considered a legacy feature.
7311 * Attribute "symmetric" produces result with standardized schematic
7312 variables (index 0). Potential INCOMPATIBILITY.
7314 * Simplifier: by default the simplifier trace only shows top level
7315 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7316 default. Thus there is less danger of being flooded by the trace. The
7317 trace indicates where parts have been suppressed.
7319 * Provers/classical: removed obsolete classical version of elim_format
7320 attribute; classical elim/dest rules are now treated uniformly when
7321 manipulating the claset.
7323 * Provers/classical: stricter checks to ensure that supplied intro,
7324 dest and elim rules are well-formed; dest and elim rules must have at
7327 * Provers/classical: attributes dest/elim/intro take an optional
7328 weight argument for the rule (just as the Pure versions). Weights are
7329 ignored by automated tools, but determine the search order of single
7332 * Syntax: input syntax now supports dummy variable binding "%_. b",
7333 where the body does not mention the bound variable. Note that dummy
7334 patterns implicitly depend on their context of bounds, which makes
7335 "{_. _}" match any set comprehension as expected. Potential
7336 INCOMPATIBILITY -- parse translations need to cope with syntactic
7337 constant "_idtdummy" in the binding position.
7339 * Syntax: removed obsolete syntactic constant "_K" and its associated
7340 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7341 for example "A -> B" => "Pi A (%_. B)".
7343 * Pure: 'class_deps' command visualizes the subclass relation, using
7344 the graph browser tool.
7346 * Pure: 'print_theory' now suppresses certain internal declarations by
7347 default; use '!' option for full details.
7352 * Method "metis" proves goals by applying the Metis general-purpose
7353 resolution prover (see also http://gilith.com/software/metis/).
7354 Examples are in the directory MetisExamples. WARNING: the
7355 Isabelle/HOL-Metis integration does not yet work properly with
7358 * Command 'sledgehammer' invokes external automatic theorem provers as
7359 background processes. It generates calls to the "metis" method if
7360 successful. These can be pasted into the proof. Users do not have to
7361 wait for the automatic provers to return. WARNING: does not really
7362 work with multi-threading.
7364 * New "auto_quickcheck" feature tests outermost goal statements for
7365 potential counter-examples. Controlled by ML references
7366 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7367 5000 milliseconds). Fails silently if statements is outside of
7368 executable fragment, or any other codgenerator problem occurs.
7370 * New constant "undefined" with axiom "undefined x = undefined".
7372 * Added class "HOL.eq", allowing for code generation with polymorphic
7375 * Some renaming of class constants due to canonical name prefixing in
7376 the new 'class' package:
7378 HOL.abs ~> HOL.abs_class.abs
7379 HOL.divide ~> HOL.divide_class.divide
7380 0 ~> HOL.zero_class.zero
7381 1 ~> HOL.one_class.one
7382 op + ~> HOL.plus_class.plus
7383 op - ~> HOL.minus_class.minus
7384 uminus ~> HOL.minus_class.uminus
7385 op * ~> HOL.times_class.times
7386 op < ~> HOL.ord_class.less
7387 op <= > HOL.ord_class.less_eq
7388 Nat.power ~> Power.power_class.power
7389 Nat.size ~> Nat.size_class.size
7390 Numeral.number_of ~> Numeral.number_class.number_of
7391 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7392 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7393 Orderings.min ~> Orderings.ord_class.min
7394 Orderings.max ~> Orderings.ord_class.max
7395 Divides.op div ~> Divides.div_class.div
7396 Divides.op mod ~> Divides.div_class.mod
7397 Divides.op dvd ~> Divides.div_class.dvd
7399 INCOMPATIBILITY. Adaptions may be required in the following cases:
7401 a) User-defined constants using any of the names "plus", "minus",
7402 "times", "less" or "less_eq". The standard syntax translations for
7403 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7406 b) Variables named "plus", "minus", "times", "less", "less_eq"
7407 INCOMPATIBILITY: use more specific names.
7409 c) Permutative equations (e.g. "a + b = b + a")
7410 Since the change of names also changes the order of terms, permutative
7411 rewrite rules may get applied in a different order. Experience shows
7412 that this is rarely the case (only two adaptions in the whole Isabelle
7413 distribution). INCOMPATIBILITY: rewrite proofs
7415 d) ML code directly refering to constant names
7416 This in general only affects hand-written proof tactics, simprocs and
7417 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7418 Consider using @{const_name} antiquotation.
7420 * New class "default" with associated constant "default".
7422 * Function "sgn" is now overloaded and available on int, real, complex
7423 (and other numeric types), using class "sgn". Two possible defs of
7424 sgn are given as equational assumptions in the classes sgn_if and
7425 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7428 * Locale "partial_order" now unified with class "order" (cf. theory
7429 Orderings), added parameter "less". INCOMPATIBILITY.
7431 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7432 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7433 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7435 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7436 changed order of proof goals in instance proofs.
7438 * The transitivity reasoner for partial and linear orders is set up
7439 for classes "order" and "linorder". Instances of the reasoner are available
7440 in all contexts importing or interpreting the corresponding locales.
7441 Method "order" invokes the reasoner separately; the reasoner
7442 is also integrated with the Simplifier as a solver. Diagnostic
7443 command 'print_orders' shows the available instances of the reasoner
7444 in the current context.
7446 * Localized monotonicity predicate in theory "Orderings"; integrated
7447 lemmas max_of_mono and min_of_mono with this predicate.
7450 * Formulation of theorem "dense" changed slightly due to integration
7451 with new class dense_linear_order.
7453 * Uniform lattice theory development in HOL.
7455 constants "meet" and "join" now named "inf" and "sup"
7456 constant "Meet" now named "Inf"
7458 classes "meet_semilorder" and "join_semilorder" now named
7459 "lower_semilattice" and "upper_semilattice"
7460 class "lorder" now named "lattice"
7461 class "comp_lat" now named "complete_lattice"
7463 Instantiation of lattice classes allows explicit definitions
7464 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7466 INCOMPATIBILITY. Theorem renames:
7468 meet_left_le ~> inf_le1
7469 meet_right_le ~> inf_le2
7470 join_left_le ~> sup_ge1
7471 join_right_le ~> sup_ge2
7472 meet_join_le ~> inf_sup_ord
7475 le_meet ~> le_inf_iff
7476 le_join ~> ge_sup_conv
7477 meet_idempotent ~> inf_idem
7478 join_idempotent ~> sup_idem
7479 meet_comm ~> inf_commute
7480 join_comm ~> sup_commute
7481 meet_leI1 ~> le_infI1
7482 meet_leI2 ~> le_infI2
7483 le_joinI1 ~> le_supI1
7484 le_joinI2 ~> le_supI2
7485 meet_assoc ~> inf_assoc
7486 join_assoc ~> sup_assoc
7487 meet_left_comm ~> inf_left_commute
7488 meet_left_idempotent ~> inf_left_idem
7489 join_left_comm ~> sup_left_commute
7490 join_left_idempotent ~> sup_left_idem
7493 le_def_meet ~> le_iff_inf
7494 le_def_join ~> le_iff_sup
7495 join_absorp2 ~> sup_absorb2
7496 join_absorp1 ~> sup_absorb1
7497 meet_absorp1 ~> inf_absorb1
7498 meet_absorp2 ~> inf_absorb2
7499 meet_join_absorp ~> inf_sup_absorb
7500 join_meet_absorp ~> sup_inf_absorb
7501 distrib_join_le ~> distrib_sup_le
7502 distrib_meet_le ~> distrib_inf_le
7504 add_meet_distrib_left ~> add_inf_distrib_left
7505 add_join_distrib_left ~> add_sup_distrib_left
7506 is_join_neg_meet ~> is_join_neg_inf
7507 is_meet_neg_join ~> is_meet_neg_sup
7508 add_meet_distrib_right ~> add_inf_distrib_right
7509 add_join_distrib_right ~> add_sup_distrib_right
7510 add_meet_join_distribs ~> add_sup_inf_distribs
7511 join_eq_neg_meet ~> sup_eq_neg_inf
7512 meet_eq_neg_join ~> inf_eq_neg_sup
7513 add_eq_meet_join ~> add_eq_inf_sup
7514 meet_0_imp_0 ~> inf_0_imp_0
7515 join_0_imp_0 ~> sup_0_imp_0
7516 meet_0_eq_0 ~> inf_0_eq_0
7517 join_0_eq_0 ~> sup_0_eq_0
7518 neg_meet_eq_join ~> neg_inf_eq_sup
7519 neg_join_eq_meet ~> neg_sup_eq_inf
7520 join_eq_if ~> sup_eq_if
7522 mono_meet ~> mono_inf
7523 mono_join ~> mono_sup
7524 meet_bool_eq ~> inf_bool_eq
7525 join_bool_eq ~> sup_bool_eq
7526 meet_fun_eq ~> inf_fun_eq
7527 join_fun_eq ~> sup_fun_eq
7528 meet_set_eq ~> inf_set_eq
7529 join_set_eq ~> sup_set_eq
7530 meet1_iff ~> inf1_iff
7531 meet2_iff ~> inf2_iff
7540 join1_iff ~> sup1_iff
7541 join2_iff ~> sup2_iff
7551 is_meet_Meet ~> is_meet_Inf
7552 Meet_bool_def ~> Inf_bool_def
7553 Meet_fun_def ~> Inf_fun_def
7554 Meet_greatest ~> Inf_greatest
7555 Meet_lower ~> Inf_lower
7556 Meet_set_def ~> Inf_set_def
7559 Sup_bool_eq ~> Sup_bool_def
7560 Sup_fun_eq ~> Sup_fun_def
7561 Sup_set_eq ~> Sup_set_def
7563 listsp_meetI ~> listsp_infI
7564 listsp_meet_eq ~> listsp_inf_eq
7569 * Added syntactic class "size"; overloaded constant "size" now has
7570 type "'a::size ==> bool"
7572 * Internal reorganisation of `size' of datatypes: size theorems
7573 "foo.size" are no longer subsumed by "foo.simps" (but are still
7574 simplification rules by default!); theorems "prod.size" now named
7577 * Class "div" now inherits from class "times" rather than "type".
7580 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7581 Linorder etc. have disappeared; operations defined in terms of
7582 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7584 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7586 * HOL-Word: New extensive library and type for generic, fixed size
7587 machine words, with arithmetic, bit-wise, shifting and rotating
7588 operations, reflection into int, nat, and bool lists, automation for
7589 linear arithmetic (by automatic reflection into nat or int), including
7590 lemmas on overflow and monotonicity. Instantiated to all appropriate
7591 arithmetic type classes, supporting automatic simplification of
7592 numerals on all operations.
7594 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7596 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7598 * Code generator library theories:
7599 - Code_Integer represents HOL integers by big integer literals in target
7601 - Code_Char represents HOL characters by character literals in target
7603 - Code_Char_chr like Code_Char, but also offers treatment of character
7604 codes; includes Code_Integer.
7605 - Executable_Set allows to generate code for finite sets using lists.
7606 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7608 - Executable_Real implements a subset of real numbers, namly those
7609 representable by rational numbers.
7610 - Efficient_Nat implements natural numbers by integers, which in general will
7611 result in higher efficency; pattern matching with 0/Suc is eliminated;
7612 includes Code_Integer.
7613 - Code_Index provides an additional datatype index which is mapped to
7614 target-language built-in integers.
7615 - Code_Message provides an additional datatype message_string which is isomorphic to
7616 strings; messages are mapped to target-language strings.
7618 * New package for inductive predicates
7620 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7623 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7624 for z_1 :: U_1 and ... and z_n :: U_m
7626 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7629 with full support for type-inference, rather than
7631 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7633 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7634 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7636 inductive "s z_1 ... z_m"
7638 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7641 For backward compatibility, there is a wrapper allowing inductive
7642 sets to be defined with the new package via
7645 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7646 for z_1 :: U_1 and ... and z_n :: U_m
7648 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7654 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7655 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7656 for z_1 :: U_1 and ... and z_n :: U_m
7658 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7659 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7662 if the additional syntax "p ..." is required.
7664 Numerous examples can be found in the subdirectories src/HOL/Auth,
7665 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7669 - Since declaration and definition of inductive sets or predicates
7670 is no longer separated, abbreviations involving the newly
7671 introduced sets or predicates must be specified together with the
7672 introduction rules after the 'where' keyword (see above), rather
7673 than before the actual inductive definition.
7675 - The variables in induction and elimination rules are now
7676 quantified in the order of their occurrence in the introduction
7677 rules, rather than in alphabetical order. Since this may break
7678 some proofs, these proofs either have to be repaired, e.g. by
7679 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7680 statements of the form
7682 case (rule_i a_i_1 ... a_i_{k_i})
7684 or the old order of quantification has to be restored by explicitly adding
7685 meta-level quantifiers in the introduction rules, i.e.
7687 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7689 - The format of the elimination rules is now
7691 p z_1 ... z_m x_1 ... x_n ==>
7692 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7697 (x_1, ..., x_n) : s z_1 ... z_m ==>
7698 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7701 for sets rather than
7703 x : s z_1 ... z_m ==>
7704 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7707 This may require terms in goals to be expanded to n-tuples
7708 (e.g. using case_tac or simplification with the split_paired_all
7709 rule) before the above elimination rule is applicable.
7711 - The elimination or case analysis rules for (mutually) inductive
7712 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7713 list of rules "p_1_..._p_k.elims" is no longer available.
7715 * New package "function"/"fun" for general recursive functions,
7716 supporting mutual and nested recursion, definitions in local contexts,
7717 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7718 for small examples, and the separate tutorial on the function
7719 package. The old recdef "package" is still available as before, but
7720 users are encouraged to use the new package.
7722 * Method "lexicographic_order" automatically synthesizes termination
7723 relations as lexicographic combinations of size measures.
7725 * Case-expressions allow arbitrary constructor-patterns (including
7726 "_") and take their order into account, like in functional
7727 programming. Internally, this is translated into nested
7728 case-expressions; missing cases are added and mapped to the predefined
7729 constant "undefined". In complicated cases printing may no longer show
7730 the original input but the internal form. Lambda-abstractions allow
7731 the same form of pattern matching: "% pat1 => e1 | ..." is an
7732 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7735 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7736 is an abbreviation for "of_nat :: nat => int". The simplification
7737 rules for "of_nat" have been changed to work like "int" did
7738 previously. Potential INCOMPATIBILITY:
7739 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7740 - of_nat_diff and of_nat_mult are no longer default simp rules
7742 * Method "algebra" solves polynomial equations over (semi)rings using
7743 Groebner bases. The (semi)ring structure is defined by locales and the
7744 tool setup depends on that generic context. Installing the method for
7745 a specific type involves instantiating the locale and possibly adding
7746 declarations for computation on the coefficients. The method is
7747 already instantiated for natural numbers and for the axiomatic class
7748 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7749 CALCULEMUS 2007 for the general principles underlying this
7750 architecture of context-aware proof-tools.
7752 * Method "ferrack" implements quantifier elimination over
7753 special-purpose dense linear orders using locales (analogous to
7754 "algebra"). The method is already installed for class
7755 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7758 * Former constant "List.op @" now named "List.append". Use ML
7759 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7760 circumvent possible incompatibilities when working on ML level.
7762 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7764 * New function listsum :: 'a list => 'a for arbitrary monoids.
7765 Special syntax: "SUM x <- xs. f x" (and latex variants)
7767 * New syntax for Haskell-like list comprehension (input only), eg.
7768 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7770 * The special syntax for function "filter" has changed from [x :
7771 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7772 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7774 * [a..b] is now defined for arbitrary linear orders. It used to be
7775 defined on nat only, as an abbreviation for [a..<Suc b]
7778 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7780 * New functions "sorted" and "sort" in src/HOL/List.thy.
7782 * New lemma collection field_simps (an extension of ring_simps) for
7783 manipulating (in)equations involving division. Multiplies with all
7784 denominators that can be proved to be non-zero (in equations) or
7785 positive/negative (in inequations).
7787 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7788 have been improved and renamed to ring_simps, group_simps and
7789 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7790 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7792 * Theory Library/Commutative_Ring: switched from recdef to function
7793 package; constants add, mul, pow now curried. Infix syntax for
7794 algebraic operations.
7796 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7799 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7802 * HOL/records: generalised field-update to take a function on the
7803 field rather than the new value: r(|A := x|) is translated to A_update
7804 (K x) r The K-combinator that is internally used is called K_record.
7805 INCOMPATIBILITY: Usage of the plain update functions has to be
7808 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7809 * x = 0, which are required for a semiring. Richer structures do not
7810 inherit from semiring_0 anymore, because this property is a theorem
7811 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7812 there is more to prove, but this is mostly trivial.
7814 * Class "recpower" is generalized to arbitrary monoids, not just
7815 commutative semirings. INCOMPATIBILITY: may need to incorporate
7816 commutativity or semiring properties additionally.
7818 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7819 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7820 better use 'abbreviation'.
7822 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7824 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7825 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7826 significant changes for setting up numeral syntax for types:
7827 - New constants Numeral.pred and Numeral.succ instead
7828 of former Numeral.bin_pred and Numeral.bin_succ.
7829 - Use integer operations instead of bin_add, bin_mult and so on.
7830 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7831 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7833 See src/HOL/Integ/IntArith.thy for an example setup.
7835 * Command 'normal_form' computes the normal form of a term that may
7836 contain free variables. For example ``normal_form "rev [a, b, c]"''
7837 produces ``[b, c, a]'' (without proof). This command is suitable for
7838 heavy-duty computations because the functions are compiled to ML
7839 first. Correspondingly, a method "normalization" is provided. See
7840 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7842 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7843 25 like -->); output depends on the "iff" print_mode, the default is
7844 "A = B" (with priority 50).
7846 * Relations less (<) and less_eq (<=) are also available on type bool.
7847 Modified syntax to disallow nesting without explicit parentheses,
7848 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7851 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7853 * Relation composition operator "op O" now has precedence 75 and binds
7854 stronger than union and intersection. INCOMPATIBILITY.
7856 * The old set interval syntax "{m..n(}" (and relatives) has been
7857 removed. Use "{m..<n}" (and relatives) instead.
7859 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7860 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7861 ``declare [[simproc del: neq]]''.
7863 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7866 * Theorem Cons_eq_map_conv no longer declared as "simp".
7868 * Theorem setsum_mult renamed to setsum_right_distrib.
7870 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7873 * Reimplemented methods "sat" and "satx", with several improvements:
7874 goals no longer need to be stated as "<prems> ==> False", equivalences
7875 (i.e. "=" on type bool) are handled, variable names of the form
7876 "lit_<n>" are no longer reserved, significant speedup.
7878 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7879 zChaff is still supported as well.
7881 * 'inductive' and 'datatype': provide projections of mutual rules,
7882 bundled as foo_bar.inducts;
7884 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7887 * Library: moved theory Accessible_Part to main HOL.
7889 * Library: added theory Coinductive_List of potentially infinite lists
7890 as greatest fixed-point.
7892 * Library: added theory AssocList which implements (finite) maps as
7895 * Method "evaluation" solves goals (i.e. a boolean expression)
7896 efficiently by compiling it to ML. The goal is "proved" (via an
7897 oracle) if it evaluates to True.
7899 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7900 also when invoked by the simplifier. This results in the Simplifier
7901 being more powerful on arithmetic goals. INCOMPATIBILITY.
7902 Configuration option fast_arith_split_limit=0 recovers the old
7905 * Support for hex (0x20) and binary (0b1001) numerals.
7907 * New method: reify eqs (t), where eqs are equations for an
7908 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7909 parameter, computes a term s::'b and a list xs::'a list and proves the
7910 theorem I xs s = t. This is also known as reification or quoting. The
7911 resulting theorem is applied to the subgoal to substitute t with I xs
7912 s. If t is omitted, the subgoal itself is reified.
7914 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7915 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7916 where f is supposed to be a computable function (in the sense of code
7917 generattion). The method uses reify to compute s and xs as above then
7918 applies corr_thm and uses normalization by evaluation to "prove" f s =
7919 r and finally gets the theorem t = r, which is again applied to the
7920 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7922 * Reflection: Automatic reification now handels binding, an example is
7923 available in src/HOL/ex/ReflectionEx.thy
7925 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7926 command 'statespace' that is similar to 'record', but introduces an
7927 abstract specification based on the locale infrastructure instead of
7928 HOL types. This leads to extra flexibility in composing state spaces,
7929 in particular multiple inheritance and renaming of components.
7934 * Hyperreal: Functions root and sqrt are now defined on negative real
7935 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7936 Nonnegativity side conditions have been removed from many lemmas, so
7937 that more subgoals may now be solved by simplification; potential
7940 * Real: new type classes formalize real normed vector spaces and
7941 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7942 and norm :: 'a => real.
7944 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7945 reals into other types. The overloaded constant Reals :: 'a set is now
7946 defined as range of_real; potential INCOMPATIBILITY.
7948 * Real: proper support for ML code generation, including 'quickcheck'.
7949 Reals are implemented as arbitrary precision rationals.
7951 * Hyperreal: Several constants that previously worked only for the
7952 reals have been generalized, so they now work over arbitrary vector
7953 spaces. Type annotations may need to be added in some cases; potential
7956 Infinitesimal :: ('a::real_normed_vector) star set
7957 HFinite :: ('a::real_normed_vector) star set
7958 HInfinite :: ('a::real_normed_vector) star set
7959 approx :: ('a::real_normed_vector) star => 'a star => bool
7960 monad :: ('a::real_normed_vector) star => 'a star set
7961 galaxy :: ('a::real_normed_vector) star => 'a star set
7962 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7963 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7964 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7965 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7966 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7967 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7968 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7969 sgn :: 'a::real_normed_vector => 'a
7970 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7972 * Complex: Some complex-specific constants are now abbreviations for
7973 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7974 hnorm. Other constants have been entirely removed in favor of the
7975 polymorphic versions (INCOMPATIBILITY):
7979 HInfinite <-- CInfinite
7980 Infinitesimal <-- CInfinitesimal
7983 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7984 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7985 (ns)deriv <-- (ns)cderiv
7990 * Formalisation of ideals and the quotient construction over rings.
7992 * Order and lattice theory no longer based on records.
7995 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7996 greatest_closed. INCOMPATIBILITY.
7998 * Method algebra is now set up via an attribute. For examples see
7999 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
8000 of algebraic structures.
8002 * Renamed theory CRing to Ring.
8007 * Substantial, yet incomplete support for nominal datatypes (binding
8008 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
8009 src/HOL/Nominal/Examples. Prospective users should consult
8010 http://isabelle.in.tum.de/nominal/
8015 * ML basics: just one true type int, which coincides with IntInf.int
8018 * ML within Isar: antiquotations allow to embed statically-checked
8019 formal entities in the source, referring to the context available at
8020 compile-time. For example:
8022 ML {* @{sort "{zero,one}"} *}
8023 ML {* @{typ "'a => 'b"} *}
8024 ML {* @{term "%x. x"} *}
8025 ML {* @{prop "x == y"} *}
8026 ML {* @{ctyp "'a => 'b"} *}
8027 ML {* @{cterm "%x. x"} *}
8028 ML {* @{cprop "x == y"} *}
8029 ML {* @{thm asm_rl} *}
8030 ML {* @{thms asm_rl} *}
8031 ML {* @{type_name c} *}
8032 ML {* @{type_syntax c} *}
8033 ML {* @{const_name c} *}
8034 ML {* @{const_syntax c} *}
8037 ML {* @{theory Pure} *}
8038 ML {* @{theory_ref} *}
8039 ML {* @{theory_ref Pure} *}
8042 ML {* @{clasimpset} *}
8044 The same works for sources being ``used'' within an Isar context.
8046 * ML in Isar: improved error reporting; extra verbosity with
8047 ML_Context.trace enabled.
8049 * Pure/General/table.ML: the join operations now works via exceptions
8050 DUP/SAME instead of type option. This is simpler in simple cases, and
8051 admits slightly more efficient complex applications.
8053 * Pure: 'advanced' translation functions (parse_translation etc.) now
8054 use Context.generic instead of just theory.
8056 * Pure: datatype Context.generic joins theory/Proof.context and
8057 provides some facilities for code that works in either kind of
8058 context, notably GenericDataFun for uniform theory and proof data.
8060 * Pure: simplified internal attribute type, which is now always
8061 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
8062 local (Proof.context) attributes have been discontinued, while
8063 minimizing code duplication. Thm.rule_attribute and
8064 Thm.declaration_attribute build canonical attributes; see also structure
8065 Context for further operations on Context.generic, notably
8066 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
8067 declarations and definitions.
8069 * Context data interfaces (Theory/Proof/GenericDataFun): removed
8070 name/print, uninitialized data defaults to ad-hoc copy of empty value,
8071 init only required for impure data. INCOMPATIBILITY: empty really need
8072 to be empty (no dependencies on theory content!)
8074 * Pure/kernel: consts certification ignores sort constraints given in
8075 signature declarations. (This information is not relevant to the
8076 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
8077 potential INCOMPATIBILITY.
8079 * Pure: axiomatic type classes are now purely definitional, with
8080 explicit proofs of class axioms and super class relations performed
8081 internally. See Pure/axclass.ML for the main internal interfaces --
8082 notably AxClass.define_class supercedes AxClass.add_axclass, and
8083 AxClass.axiomatize_class/classrel/arity supersede
8084 Sign.add_classes/classrel/arities.
8086 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8087 global/local versions on theory vs. Proof.context have been
8088 discontinued; Attrib.syntax and Method.syntax have been adapted
8089 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8090 attributes, methods, etc.
8092 * Pure: several functions of signature "... -> theory -> theory * ..."
8093 have been reoriented to "... -> theory -> ... * theory" in order to
8094 allow natural usage in combination with the ||>, ||>>, |-> and
8095 fold_map combinators.
8097 * Pure: official theorem names (closed derivations) and additional
8098 comments (tags) are now strictly separate. Name hints -- which are
8099 maintained as tags -- may be attached any time without affecting the
8102 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8103 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8104 achieve the old behaviour.
8106 * Pure: the "Goal" constant is now called "prop", supporting a
8107 slightly more general idea of ``protecting'' meta-level rule
8110 * Pure: Logic.(un)varify only works in a global context, which is now
8111 enforced instead of silently assumed. INCOMPATIBILITY, may use
8112 Logic.legacy_(un)varify as temporary workaround.
8114 * Pure: structure Name provides scalable operations for generating
8115 internal variable names, notably Name.variants etc. This replaces
8116 some popular functions from term.ML:
8118 Term.variant -> Name.variant
8119 Term.variantlist -> Name.variant_list
8120 Term.invent_names -> Name.invent_list
8122 Note that low-level renaming rarely occurs in new code -- operations
8123 from structure Variable are used instead (see below).
8125 * Pure: structure Variable provides fundamental operations for proper
8126 treatment of fixed/schematic variables in a context. For example,
8127 Variable.import introduces fixes for schematics of given facts and
8128 Variable.export reverses the effect (up to renaming) -- this replaces
8129 various freeze_thaw operations.
8131 * Pure: structure Goal provides simple interfaces for
8132 init/conclude/finish and tactical prove operations (replacing former
8133 Tactic.prove). Goal.prove is the canonical way to prove results
8134 within a given context; Goal.prove_global is a degraded version for
8135 theory level goals, including a global Drule.standard. Note that
8136 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8137 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8138 in a locale context).
8140 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8141 and type checking (Syntax.check_term etc.), with common combinations
8142 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8143 which are considered legacy and await removal.
8145 * Pure/Syntax: generic interfaces for type unchecking
8146 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8147 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8148 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8149 available for convenience, but refer to the very same operations using
8150 a mere theory instead of a full context.
8152 * Isar: simplified treatment of user-level errors, using exception
8153 ERROR of string uniformly. Function error now merely raises ERROR,
8154 without any side effect on output channels. The Isar toplevel takes
8155 care of proper display of ERROR exceptions. ML code may use plain
8156 handle/can/try; cat_error may be used to concatenate errors like this:
8158 ... handle ERROR msg => cat_error msg "..."
8160 Toplevel ML code (run directly or through the Isar toplevel) may be
8161 embedded into the Isar toplevel with exception display/debug like
8164 Isar.toplevel (fn () => ...)
8166 INCOMPATIBILITY, removed special transform_error facilities, removed
8167 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8168 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8169 -- use plain ERROR instead.
8171 * Isar: theory setup now has type (theory -> theory), instead of a
8172 list. INCOMPATIBILITY, may use #> to compose setup functions.
8174 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8175 ProofContext.debug/verbose flags.
8177 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8178 theory before entering a proof state. Transactions now always see a
8179 quasi-functional intermediate checkpoint, both in interactive and
8182 * Isar: simplified interfaces for outer syntax. Renamed
8183 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8184 OuterSyntax.add_parsers -- this functionality is now included in
8185 OuterSyntax.command etc. INCOMPATIBILITY.
8187 * Simplifier: the simpset of a running simplification process now
8188 contains a proof context (cf. Simplifier.the_context), which is the
8189 very context that the initial simpset has been retrieved from (by
8190 simpset_of/local_simpset_of). Consequently, all plug-in components
8191 (solver, looper etc.) may depend on arbitrary proof data.
8193 * Simplifier.inherit_context inherits the proof context (plus the
8194 local bounds) of the current simplification process; any simproc
8195 etc. that calls the Simplifier recursively should do this! Removed
8196 former Simplifier.inherit_bounds, which is already included here --
8197 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8198 specify an explicit context using Simplifier.context/theory_context.
8200 * Simplifier/Classical Reasoner: more abstract interfaces
8201 change_simpset/claset for modifying the simpset/claset reference of a
8202 theory; raw versions simpset/claset_ref etc. have been discontinued --
8205 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8211 * settings: the default heap location within ISABELLE_HOME_USER now
8212 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8213 Isabelle installations.
8215 * isabelle-process: option -S (secure mode) disables some critical
8216 operations, notably runtime compilation and evaluation of ML source
8219 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8221 * Support for parallel execution, using native multicore support of
8222 Poly/ML 5.1. The theory loader exploits parallelism when processing
8223 independent theories, according to the given theory header
8224 specifications. The maximum number of worker threads is specified via
8225 usedir option -M or the "max-threads" setting in Proof General. A
8226 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8227 to 6 on a 8-core machine. User-code needs to observe certain
8228 guidelines for thread-safe programming, see appendix A in the Isar
8229 Implementation manual.
8233 New in Isabelle2005 (October 2005)
8234 ----------------------------------
8238 * Theory headers: the new header syntax for Isar theories is
8241 imports <theory1> ... <theoryN>
8242 uses <file1> ... <fileM>
8245 where the 'uses' part is optional. The previous syntax
8247 theory <name> = <theory1> + ... + <theoryN>:
8249 will disappear in the next release. Use isatool fixheaders to convert
8250 existing theory files. Note that there is no change in ancient
8251 non-Isar theories now, but these will disappear soon.
8253 * Theory loader: parent theories can now also be referred to via
8254 relative and absolute paths.
8256 * Command 'find_theorems' searches for a list of criteria instead of a
8257 list of constants. Known criteria are: intro, elim, dest, name:string,
8258 simp:term, and any term. Criteria can be preceded by '-' to select
8259 theorems that do not match. Intro, elim, dest select theorems that
8260 match the current goal, name:s selects theorems whose fully qualified
8261 name contain s, and simp:term selects all simplification rules whose
8262 lhs match term. Any other term is interpreted as pattern and selects
8263 all theorems matching the pattern. Available in ProofGeneral under
8264 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8266 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8268 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8269 matching the current goal as introduction rule and not having "HOL."
8270 in their name (i.e. not being defined in theory HOL).
8272 * Command 'thms_containing' has been discontinued in favour of
8273 'find_theorems'; INCOMPATIBILITY.
8275 * Communication with Proof General is now 8bit clean, which means that
8276 Unicode text in UTF-8 encoding may be used within theory texts (both
8277 formal and informal parts). Cf. option -U of the Isabelle Proof
8278 General interface. Here are some simple examples (cf. src/HOL/ex):
8280 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8281 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8283 * Improved efficiency of the Simplifier and, to a lesser degree, the
8284 Classical Reasoner. Typical big applications run around 2 times
8288 *** Document preparation ***
8290 * Commands 'display_drafts' and 'print_drafts' perform simple output
8291 of raw sources. Only those symbols that do not require additional
8292 LaTeX packages (depending on comments in isabellesym.sty) are
8293 displayed properly, everything else is left verbatim. isatool display
8294 and isatool print are used as front ends (these are subject to the
8295 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8297 * Command tags control specific markup of certain regions of text,
8298 notably folding and hiding. Predefined tags include "theory" (for
8299 theory begin and end), "proof" for proof commands, and "ML" for
8300 commands involving ML code; the additional tags "visible" and
8301 "invisible" are unused by default. Users may give explicit tag
8302 specifications in the text, e.g. ''by %invisible (auto)''. The
8303 interpretation of tags is determined by the LaTeX job during document
8304 preparation: see option -V of isatool usedir, or options -n and -t of
8305 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8308 Several document versions may be produced at the same time via isatool
8309 usedir (the generated index.html will link all of them). Typical
8310 specifications include ''-V document=theory,proof,ML'' to present
8311 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8312 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8313 these parts without any formal replacement text. The Isabelle site
8314 default settings produce ''document'' and ''outline'' versions as
8317 * Several new antiquotations:
8319 @{term_type term} prints a term with its type annotated;
8321 @{typeof term} prints the type of a term;
8323 @{const const} is the same as @{term const}, but checks that the
8324 argument is a known logical constant;
8326 @{term_style style term} and @{thm_style style thm} print a term or
8327 theorem applying a "style" to it
8331 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8332 definitions, equations, inequations etc., 'concl' printing only the
8333 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8334 to print the specified premise. TermStyle.add_style provides an ML
8335 interface for introducing further styles. See also the "LaTeX Sugar"
8336 document practical applications. The ML antiquotation prints
8337 type-checked ML expressions verbatim.
8339 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8340 and 'text' support optional locale specification '(in loc)', which
8341 specifies the default context for interpreting antiquotations. For
8342 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8344 * Option 'locale=NAME' of antiquotations specifies an alternative
8345 context interpreting the subsequent argument. For example: @{thm
8346 [locale=lattice] inf_assoc}.
8348 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8351 * Proper output of antiquotations for theory commands involving a
8352 proof context (such as 'locale' or 'theorem (in loc) ...').
8354 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8355 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8357 * isatool usedir: new option -C (default true) controls whether option
8358 -D should include a copy of the original document directory; -C false
8359 prevents unwanted effects such as copying of administrative CVS data.
8364 * Considerably improved version of 'constdefs' command. Now performs
8365 automatic type-inference of declared constants; additional support for
8366 local structure declarations (cf. locales and HOL records), see also
8367 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8368 sequential dependencies of definitions within a single 'constdefs'
8369 section; moreover, the declared name needs to be an identifier. If
8370 all fails, consider to fall back on 'consts' and 'defs' separately.
8372 * Improved indexed syntax and implicit structures. First of all,
8373 indexed syntax provides a notational device for subscripted
8374 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8375 expressions. Secondly, in a local context with structure
8376 declarations, number indexes \<^sub>n or the empty index (default
8377 number 1) refer to a certain fixed variable implicitly; option
8378 show_structs controls printing of implicit structures. Typical
8379 applications of these concepts involve record types and locales.
8381 * New command 'no_syntax' removes grammar declarations (and
8382 translations) resulting from the given syntax specification, which is
8383 interpreted in the same manner as for the 'syntax' command.
8385 * 'Advanced' translation functions (parse_translation etc.) may depend
8386 on the signature of the theory context being presently used for
8387 parsing/printing, see also isar-ref manual.
8389 * Improved 'oracle' command provides a type-safe interface to turn an
8390 ML expression of type theory -> T -> term into a primitive rule of
8391 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8392 is already included here); see also FOL/ex/IffExample.thy;
8395 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8396 before); "cI" is no longer bound, use "c.intro" instead.
8397 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8398 axclasses vs. locales.
8400 * Improved internal renaming of symbolic identifiers -- attach primes
8401 instead of base 26 numbers.
8403 * New flag show_question_marks controls printing of leading question
8404 marks in schematic variable names.
8406 * In schematic variable names, *any* symbol following \<^isub> or
8407 \<^isup> is now treated as part of the base name. For example, the
8408 following works without printing of awkward ".0" indexes:
8410 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8413 * Inner syntax includes (*(*nested*) comments*).
8415 * Pretty printer now supports unbreakable blocks, specified in mixfix
8416 annotations as "(00...)".
8418 * Clear separation of logical types and nonterminals, where the latter
8419 may only occur in 'syntax' specifications or type abbreviations.
8420 Before that distinction was only partially implemented via type class
8421 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8422 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8423 exotic syntax specifications may require further adaption
8424 (e.g. Cube/Cube.thy).
8426 * Removed obsolete type class "logic", use the top sort {} instead.
8427 Note that non-logical types should be declared as 'nonterminals'
8428 rather than 'types'. INCOMPATIBILITY for new object-logic
8431 * Attributes 'induct' and 'cases': type or set names may now be
8432 locally fixed variables as well.
8434 * Simplifier: can now control the depth to which conditional rewriting
8435 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8438 * Simplifier: simplification procedures may now take the current
8439 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8440 interface), which is very useful for calling the Simplifier
8441 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8442 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8443 low-level mk_simproc no longer applies Logic.varify internally, to
8444 allow for use in a context of fixed variables.
8446 * thin_tac now works even if the assumption being deleted contains !!
8447 or ==>. More generally, erule now works even if the major premise of
8448 the elimination rule contains !! or ==>.
8450 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8452 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8453 from Pure, which contains all common declarations already. Both
8454 theories are defined via plain Isabelle/Isar .thy files.
8455 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8456 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8457 use isatool fixcpure to adapt your theory and ML sources.
8459 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8460 selections of theorems in named facts via index ranges.
8462 * 'print_theorems': in theory mode, really print the difference
8463 wrt. the last state (works for interactive theory development only),
8464 in proof mode print all local facts (cf. 'print_facts');
8466 * 'hide': option '(open)' hides only base names.
8468 * More efficient treatment of intermediate checkpoints in interactive
8471 * Code generator is now invoked via code_module (incremental code
8472 generation) and code_library (modular code generation, ML structures
8473 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8474 must be quoted when used as identifiers.
8476 * New 'value' command for reading, evaluating and printing terms using
8477 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8478 quoted when used as identifier.
8483 * New commands for the interpretation of locale expressions in
8484 theories (1), locales (2) and proof contexts (3). These generate
8485 proof obligations from the expression specification. After the
8486 obligations have been discharged, theorems of the expression are added
8487 to the theory, target locale or proof context. The synopsis of the
8488 commands is a follows:
8490 (1) interpretation expr inst
8491 (2) interpretation target < expr
8492 (3) interpret expr inst
8494 Interpretation in theories and proof contexts require a parameter
8495 instantiation of terms from the current context. This is applied to
8496 specifications and theorems of the interpreted expression.
8497 Interpretation in locales only permits parameter renaming through the
8498 locale expression. Interpretation is smart in that interpretations
8499 that are active already do not occur in proof obligations, neither are
8500 instantiated theorems stored in duplicate. Use 'print_interps' to
8501 inspect active interpretations of a particular locale. For details,
8502 see the Isar Reference manual. Examples can be found in
8503 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8505 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8506 'interpret' instead.
8508 * New context element 'constrains' for adding type constraints to
8511 * Context expressions: renaming of parameters with syntax
8514 * Locale declaration: 'includes' disallowed.
8516 * Proper static binding of attribute syntax -- i.e. types / terms /
8517 facts mentioned as arguments are always those of the locale definition
8518 context, independently of the context of later invocations. Moreover,
8519 locale operations (renaming and type / term instantiation) are applied
8520 to attribute arguments as expected.
8522 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8523 actual attributes; rare situations may require Attrib.attribute to
8524 embed those attributes into Attrib.src that lack concrete syntax.
8525 Attribute implementations need to cooperate properly with the static
8526 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8527 Attrib.XXX_thm etc. already do the right thing without further
8528 intervention. Only unusual applications -- such as "where" or "of"
8529 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8530 on the context and the facts involved -- may have to assign parsed
8531 values to argument tokens explicitly.
8533 * Changed parameter management in theorem generation for long goal
8534 statements with 'includes'. INCOMPATIBILITY: produces a different
8535 theorem statement in rare situations.
8537 * Locale inspection command 'print_locale' omits notes elements. Use
8538 'print_locale!' to have them included in the output.
8543 * Provers/hypsubst.ML: improved version of the subst method, for
8544 single-step rewriting: it now works in bound variable contexts. New is
8545 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8546 rewrite a different subterm than the original subst method, which is
8547 still available as 'simplesubst'.
8549 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8552 * Provers/trancl.ML: new transitivity reasoner for transitive and
8553 reflexive-transitive closure of relations.
8555 * Provers/blast.ML: new reference depth_limit to make blast's depth
8556 limit (previously hard-coded with a value of 20) user-definable.
8558 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8559 is peformed already. Object-logics merely need to finish their
8560 initial simpset configuration as before. INCOMPATIBILITY.
8565 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8568 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8570 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8571 and x-symbol; use option '-m epsilon' to get it actually printed.
8572 Moreover, the mathematically important symbolic identifier \<epsilon>
8573 becomes available as variable, constant etc. INCOMPATIBILITY,
8575 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8576 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8577 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8578 support corresponding Isar calculations.
8580 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8583 * theory SetInterval: changed the syntax for open intervals:
8592 The old syntax is still supported but will disappear in the next
8593 release. For conversion use the following Emacs search and replace
8594 patterns (these are not perfect but work quite well):
8596 {)\([^\.]*\)\.\. -> {\1<\.\.}
8597 \.\.\([^(}]*\)(} -> \.\.<\1}
8599 * Theory Commutative_Ring (in Library): method comm_ring for proving
8600 equalities in commutative rings; method 'algebra' provides a generic
8603 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8604 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8605 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8608 Some new syntax forms are available:
8610 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8611 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8612 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8613 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8615 The latter form "\<Sum>x < k. e" used to be based on a separate
8616 function "Summation", which has been discontinued.
8618 * theory Finite_Set: in structured induction proofs, the insert case
8619 is now 'case (insert x F)' instead of the old counterintuitive 'case
8622 * The 'refute' command has been extended to support a much larger
8623 fragment of HOL, including axiomatic type classes, constdefs and
8624 typedefs, inductive datatypes and recursion.
8626 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8627 Requires zChaff with proof generation to be installed. See
8628 HOL/ex/SAT_Examples.thy for examples.
8630 * Datatype induction via method 'induct' now preserves the name of the
8631 induction variable. For example, when proving P(xs::'a list) by
8632 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8633 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8634 in unstructured proof scripts.
8636 * Reworked implementation of records. Improved scalability for
8637 records with many fields, avoiding performance problems for type
8638 inference. Records are no longer composed of nested field types, but
8639 of nested extension types. Therefore the record type only grows linear
8640 in the number of extensions and not in the number of fields. The
8641 top-level (users) view on records is preserved. Potential
8642 INCOMPATIBILITY only in strange cases, where the theory depends on the
8643 old record representation. The type generated for a record is called
8644 <record_name>_ext_type.
8646 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8647 proofs triggered by a record definition or a simproc (if
8648 quick_and_dirty is enabled). Definitions of large records can take
8651 New simproc record_upd_simproc for simplification of multiple record
8652 updates enabled by default. Moreover, trivial updates are also
8653 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8654 occasionally, since simplification is more powerful by default.
8656 * typedef: proper support for polymorphic sets, which contain extra
8657 type-variables in the term.
8659 * Simplifier: automatically reasons about transitivity chains
8660 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8661 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8662 old proofs break occasionally as simplification may now solve more
8663 goals than previously.
8665 * Simplifier: converts x <= y into x = y if assumption y <= x is
8666 present. Works for all partial orders (class "order"), in particular
8667 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8670 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8671 bound variable or a constant then the let is unfolded. Otherwise
8672 first a is simplified to b, and then f b is simplified to g. If
8673 possible we abstract b from g arriving at "let x = b in h x",
8674 otherwise we unfold the let and arrive at g. The simproc can be
8675 enabled/disabled by the reference use_let_simproc. Potential
8676 INCOMPATIBILITY since simplification is more powerful by default.
8678 * Classical reasoning: the meson method now accepts theorems as arguments.
8680 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8681 jobs to provide advice on the provability of subgoals.
8683 * Theory OrderedGroup and Ring_and_Field: various additions and
8684 improvements to faciliate calculations involving equalities and
8687 The following theorems have been eliminated or modified
8690 abs_eq now named abs_of_nonneg
8691 abs_of_ge_0 now named abs_of_nonneg
8692 abs_minus_eq now named abs_of_nonpos
8693 imp_abs_id now named abs_of_nonneg
8694 imp_abs_neg_id now named abs_of_nonpos
8695 mult_pos now named mult_pos_pos
8696 mult_pos_le now named mult_nonneg_nonneg
8697 mult_pos_neg_le now named mult_nonneg_nonpos
8698 mult_pos_neg2_le now named mult_nonneg_nonpos2
8699 mult_neg now named mult_neg_neg
8700 mult_neg_le now named mult_nonpos_nonpos
8702 * The following lemmas in Ring_and_Field have been added to the simplifier:
8705 not_square_less_zero
8707 The following lemmas have been deleted from Real/RealPow:
8717 * Theory Parity: added rules for simplifying exponents.
8721 The following theorems have been eliminated or modified
8724 list_all_Nil now named list_all.simps(1)
8725 list_all_Cons now named list_all.simps(2)
8726 list_all_conv now named list_all_iff
8727 set_mem_eq now named mem_iff
8729 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8730 asymptotic "big O" calculations. See the notes in BigO.thy.
8735 * Theory RealDef: better support for embedding natural numbers and
8736 integers in the reals.
8738 The following theorems have been eliminated or modified
8741 exp_ge_add_one_self now requires no hypotheses
8742 real_of_int_add reversed direction of equality (use [symmetric])
8743 real_of_int_minus reversed direction of equality (use [symmetric])
8744 real_of_int_diff reversed direction of equality (use [symmetric])
8745 real_of_int_mult reversed direction of equality (use [symmetric])
8747 * Theory RComplete: expanded support for floor and ceiling functions.
8749 * Theory Ln is new, with properties of the natural logarithm
8751 * Hyperreal: There is a new type constructor "star" for making
8752 nonstandard types. The old type names are now type synonyms:
8756 hcomplex = complex star
8758 * Hyperreal: Many groups of similarly-defined constants have been
8759 replaced by polymorphic versions (INCOMPATIBILITY):
8761 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8763 starset <-- starsetNat, starsetC
8764 *s* <-- *sNat*, *sc*
8765 starset_n <-- starsetNat_n, starsetC_n
8766 *sn* <-- *sNatn*, *scn*
8767 InternalSets <-- InternalNatSets, InternalCSets
8769 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8770 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8771 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8772 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8773 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8775 * Hyperreal: Many type-specific theorems have been removed in favor of
8776 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8778 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8779 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8780 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8781 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8782 right_minus <-- hypreal_add_minus
8783 left_minus <-- {hypreal,hcomplex}_add_minus_left
8784 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8785 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8786 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8787 mult_1_right <-- hcomplex_mult_one_right
8788 mult_zero_left <-- hcomplex_mult_zero_left
8789 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8790 right_distrib <-- hypnat_add_mult_distrib2
8791 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8792 right_inverse <-- hypreal_mult_inverse
8793 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8794 order_refl <-- {hypreal,hypnat}_le_refl
8795 order_trans <-- {hypreal,hypnat}_le_trans
8796 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8797 order_less_le <-- {hypreal,hypnat}_less_le
8798 linorder_linear <-- {hypreal,hypnat}_le_linear
8799 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8800 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8801 add_nonneg_nonneg <-- hypreal_le_add_order
8803 * Hyperreal: Separate theorems having to do with type-specific
8804 versions of constants have been merged into theorems that apply to the
8805 new polymorphic constants (INCOMPATIBILITY):
8807 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8808 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8809 STAR_Un <-- {STAR,NatStar,STARC}_Un
8810 STAR_Int <-- {STAR,NatStar,STARC}_Int
8811 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8812 STAR_subset <-- {STAR,NatStar,STARC}_subset
8813 STAR_mem <-- {STAR,NatStar,STARC}_mem
8814 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8815 STAR_diff <-- {STAR,STARC}_diff
8816 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8817 STARC_hcomplex_of_complex}_image_subset
8818 starset_n_Un <-- starset{Nat,C}_n_Un
8819 starset_n_Int <-- starset{Nat,C}_n_Int
8820 starset_n_Compl <-- starset{Nat,C}_n_Compl
8821 starset_n_diff <-- starset{Nat,C}_n_diff
8822 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8823 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8824 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8825 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8826 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8827 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8828 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8829 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8830 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8831 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8832 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8833 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8834 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8835 starfun_diff <-- starfun{C,RC,CR}_diff
8836 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8837 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8838 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8839 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8840 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8841 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8842 starfun_Id <-- starfunC_Id
8843 starfun_approx <-- starfun{Nat,CR}_approx
8844 starfun_capprox <-- starfun{C,RC}_capprox
8845 starfun_abs <-- starfunNat_rabs
8846 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8847 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8848 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8849 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8850 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8851 starfun_add_approx <-- starfunCR_add_approx
8852 starfun_inverse_inverse <-- starfunC_inverse_inverse
8853 starfun_divide <-- starfun{C,CR,RC}_divide
8854 starfun_n <-- starfun{Nat,C}_n
8855 starfun_n_mult <-- starfun{Nat,C}_n_mult
8856 starfun_n_add <-- starfun{Nat,C}_n_add
8857 starfun_n_add_minus <-- starfunNat_n_add_minus
8858 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8859 starfun_n_minus <-- starfun{Nat,C}_n_minus
8860 starfun_n_eq <-- starfun{Nat,C}_n_eq
8862 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8863 star_n_minus <-- {hypreal,hcomplex}_minus
8864 star_n_diff <-- {hypreal,hcomplex}_diff
8865 star_n_mult <-- {hypreal,hcomplex}_mult
8866 star_n_inverse <-- {hypreal,hcomplex}_inverse
8867 star_n_le <-- {hypreal,hypnat}_le
8868 star_n_less <-- {hypreal,hypnat}_less
8869 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8870 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8871 star_n_abs <-- hypreal_hrabs
8872 star_n_divide <-- hcomplex_divide
8874 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8875 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8876 star_of_diff <-- hypreal_of_real_diff
8877 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8878 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8879 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8880 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8881 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8882 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8883 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8884 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8885 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8886 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8887 star_of_number_of <-- {hypreal,hcomplex}_number_of
8888 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8889 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8890 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8891 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8892 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8893 star_of_power <-- hypreal_of_real_power
8894 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8896 * Hyperreal: new method "transfer" that implements the transfer
8897 principle of nonstandard analysis. With a subgoal that mentions
8898 nonstandard types like "'a star", the command "apply transfer"
8899 replaces it with an equivalent one that mentions only standard types.
8900 To be successful, all free variables must have standard types; non-
8901 standard variables must have explicit universal quantifiers.
8903 * Hyperreal: A theory of Taylor series.
8908 * Discontinued special version of 'constdefs' (which used to support
8909 continuous functions) in favor of the general Pure one with full
8912 * New simplification procedure for solving continuity conditions; it
8913 is much faster on terms with many nested lambda abstractions (cubic
8914 instead of exponential time).
8916 * New syntax for domain package: selector names are now optional.
8917 Parentheses should be omitted unless argument is lazy, for example:
8919 domain 'a stream = cons "'a" (lazy "'a stream")
8921 * New command 'fixrec' for defining recursive functions with pattern
8922 matching; defining multiple functions with mutual recursion is also
8923 supported. Patterns may include the constants cpair, spair, up, sinl,
8924 sinr, or any data constructor defined by the domain package. The given
8925 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8926 syntax and examples.
8928 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8929 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8930 but the proof obligation additionally includes an admissibility
8931 requirement. The packages generate instances of class cpo or pcpo,
8932 with continuity and strictness theorems for Rep and Abs.
8934 * HOLCF: Many theorems have been renamed according to a more standard naming
8935 scheme (INCOMPATIBILITY):
8937 foo_inject: "foo$x = foo$y ==> x = y"
8938 foo_eq: "(foo$x = foo$y) = (x = y)"
8939 foo_less: "(foo$x << foo$y) = (x << y)"
8940 foo_strict: "foo$UU = UU"
8941 foo_defined: "... ==> foo$x ~= UU"
8942 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8947 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8948 including the First Isomorphism Theorem (on quotienting by the kernel
8951 * ZF/Simplifier: install second copy of type solver that actually
8952 makes use of TC rules declared to Isar proof contexts (or locales);
8953 the old version is still required for ML proof scripts.
8958 * Converted to Isar theory format; use locales instead of axiomatic
8964 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8967 * Pure/library.ML no longer defines its own option datatype, but uses
8968 that of the SML basis, which has constructors NONE and SOME instead of
8969 None and Some, as well as exception Option.Option instead of OPTION.
8970 The functions the, if_none, is_some, is_none have been adapted
8971 accordingly, while Option.map replaces apsome.
8973 * Pure/library.ML: the exception LIST has been given up in favour of
8974 the standard exceptions Empty and Subscript, as well as
8975 Library.UnequalLengths. Function like Library.hd and Library.tl are
8976 superceded by the standard hd and tl functions etc.
8978 A number of basic list functions are no longer exported to the ML
8979 toplevel, as they are variants of predefined functions. The following
8980 suggests how one can translate existing code:
8982 rev_append xs ys = List.revAppend (xs, ys)
8983 nth_elem (i, xs) = List.nth (xs, i)
8984 last_elem xs = List.last xs
8985 flat xss = List.concat xss
8986 seq fs = List.app fs
8987 partition P xs = List.partition P xs
8988 mapfilter f xs = List.mapPartial f xs
8990 * Pure/library.ML: several combinators for linear functional
8991 transformations, notably reverse application and composition:
8994 (x, y) |-> f f #-> g
8996 * Pure/library.ML: introduced/changed precedence of infix operators:
8998 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
9000 infix 3 o oo ooo oooo;
9001 infix 4 ~~ upto downto;
9003 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
9006 * Pure/library.ML: natural list combinators fold, fold_rev, and
9007 fold_map support linear functional transformations and nesting. For
9010 fold f [x1, ..., xN] y =
9011 y |> f x1 |> ... |> f xN
9013 (fold o fold) f [xs1, ..., xsN] y =
9014 y |> fold f xs1 |> ... |> fold f xsN
9016 fold f [x1, ..., xN] =
9019 (fold o fold) f [xs1, ..., xsN] =
9020 fold f xs1 #> ... #> fold f xsN
9022 * Pure/library.ML: the following selectors on type 'a option are
9025 the: 'a option -> 'a (*partial*)
9026 these: 'a option -> 'a where 'a = 'b list
9027 the_default: 'a -> 'a option -> 'a
9028 the_list: 'a option -> 'a list
9030 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9031 basic operations for association lists, following natural argument
9032 order; moreover the explicit equality predicate passed here avoids
9033 potentially expensive polymorphic runtime equality checks.
9034 The old functions may be expressed as follows:
9036 assoc = uncurry (AList.lookup (op =))
9037 assocs = these oo AList.lookup (op =)
9038 overwrite = uncurry (AList.update (op =)) o swap
9040 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9042 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
9043 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
9045 replacing make_keylist and keyfilter (occassionally used)
9048 make_keylist = AList.make
9049 keyfilter = AList.find (op =)
9051 * eq_fst and eq_snd now take explicit equality parameter, thus
9052 avoiding eqtypes. Naive rewrites:
9054 eq_fst = eq_fst (op =)
9055 eq_snd = eq_snd (op =)
9057 * Removed deprecated apl and apr (rarely used).
9060 apl (n, op) =>>= curry op n
9061 apr (op, m) =>>= fn n => op (n, m)
9063 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
9064 provides a reasonably efficient light-weight implementation of sets as
9067 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
9068 few new operations; existing lookup and update are now curried to
9069 follow natural argument order (for use with fold etc.);
9070 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
9072 * Pure/General: output via the Isabelle channels of
9073 writeln/warning/error etc. is now passed through Output.output, with a
9074 hook for arbitrary transformations depending on the print_mode
9075 (cf. Output.add_mode -- the first active mode that provides a output
9076 function wins). Already formatted output may be embedded into further
9077 text via Output.raw; the result of Pretty.string_of/str_of and derived
9078 functions (string_of_term/cterm/thm etc.) is already marked raw to
9079 accommodate easy composition of diagnostic messages etc. Programmers
9080 rarely need to care about Output.output or Output.raw at all, with
9081 some notable exceptions: Output.output is required when bypassing the
9082 standard channels (writeln etc.), or in token translations to produce
9083 properly formatted results; Output.raw is required when capturing
9084 already output material that will eventually be presented to the user
9085 a second time. For the default print mode, both Output.output and
9086 Output.raw have no effect.
9088 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9089 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9090 cumulative results are displayed at the end of a batch session.
9092 * Pure/General: File.sysify_path and File.quote_sysify path have been
9093 replaced by File.platform_path and File.shell_path (with appropriate
9094 hooks). This provides a clean interface for unusual systems where the
9095 internal and external process view of file names are different.
9097 * Pure: more efficient orders for basic syntactic entities: added
9098 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9099 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9100 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9101 orders now -- potential INCOMPATIBILITY for code that depends on a
9102 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9103 Library.sort_strings on result).
9105 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9106 fold_types traverse types/terms from left to right, observing natural
9107 argument order. Supercedes previous foldl_XXX versions, add_frees,
9108 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9110 * Pure: name spaces have been refined, with significant changes of the
9111 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9112 to extern(_table). The plain name entry path is superceded by a
9113 general 'naming' context, which also includes the 'policy' to produce
9114 a fully qualified name and external accesses of a fully qualified
9115 name; NameSpace.extend is superceded by context dependent
9116 Sign.declare_name. Several theory and proof context operations modify
9117 the naming context. Especially note Theory.restore_naming and
9118 ProofContext.restore_naming to get back to a sane state; note that
9119 Theory.add_path is no longer sufficient to recover from
9120 Theory.absolute_path in particular.
9122 * Pure: new flags short_names (default false) and unique_names
9123 (default true) for controlling output of qualified names. If
9124 short_names is set, names are printed unqualified. If unique_names is
9125 reset, the name prefix is reduced to the minimum required to achieve
9126 the original result when interning again, even if there is an overlap
9127 with earlier declarations.
9129 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9130 now 'extend', and 'merge' gets an additional Pretty.pp argument
9131 (useful for printing error messages). INCOMPATIBILITY.
9133 * Pure: major reorganization of the theory context. Type Sign.sg and
9134 Theory.theory are now identified, referring to the universal
9135 Context.theory (see Pure/context.ML). Actual signature and theory
9136 content is managed as theory data. The old code and interfaces were
9137 spread over many files and structures; the new arrangement introduces
9138 considerable INCOMPATIBILITY to gain more clarity:
9140 Context -- theory management operations (name, identity, inclusion,
9141 parents, ancestors, merge, etc.), plus generic theory data;
9143 Sign -- logical signature and syntax operations (declaring consts,
9144 types, etc.), plus certify/read for common entities;
9146 Theory -- logical theory operations (stating axioms, definitions,
9147 oracles), plus a copy of logical signature operations (consts,
9148 types, etc.); also a few basic management operations (Theory.copy,
9151 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9152 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9153 for convenience -- they merely return the theory.
9155 * Pure: type Type.tsig is superceded by theory in most interfaces.
9157 * Pure: the Isar proof context type is already defined early in Pure
9158 as Context.proof (note that ProofContext.context and Proof.context are
9159 aliases, where the latter is the preferred name). This enables other
9160 Isabelle components to refer to that type even before Isar is present.
9162 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9163 typeK, constK, axiomK, oracleK), but provide explicit operations for
9164 any of these kinds. For example, Sign.intern typeK is now
9165 Sign.intern_type, Theory.hide_space Sign.typeK is now
9166 Theory.hide_types. Also note that former
9167 Theory.hide_classes/types/consts are now
9168 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9169 internalize their arguments! INCOMPATIBILITY.
9171 * Pure: get_thm interface (of PureThy and ProofContext) expects
9172 datatype thmref (with constructors Name and NameSelection) instead of
9173 plain string -- INCOMPATIBILITY;
9175 * Pure: cases produced by proof methods specify options, where NONE
9176 means to remove case bindings -- INCOMPATIBILITY in
9179 * Pure: the following operations retrieve axioms or theorems from a
9180 theory node or theory hierarchy, respectively:
9182 Theory.axioms_of: theory -> (string * term) list
9183 Theory.all_axioms_of: theory -> (string * term) list
9184 PureThy.thms_of: theory -> (string * thm) list
9185 PureThy.all_thms_of: theory -> (string * thm) list
9187 * Pure: print_tac now outputs the goal through the trace channel.
9189 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9190 Reference Toplevel.debug (default false) controls detailed printing
9191 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9192 controls execution profiling -- set to 1 for time and 2 for space
9193 (both increase the runtime).
9195 * Isar session: The initial use of ROOT.ML is now always timed,
9196 i.e. the log will show the actual process times, in contrast to the
9197 elapsed wall-clock time that the outer shell wrapper produces.
9199 * Simplifier: improved handling of bound variables (nameless
9200 representation, avoid allocating new strings). Simprocs that invoke
9201 the Simplifier recursively should use Simplifier.inherit_bounds to
9202 avoid local name clashes. Failure to do so produces warnings
9203 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9204 for further details.
9206 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9207 bindings for all theorems stored within a given theory; this may help
9208 in porting non-Isar theories to Isar ones, while keeping ML proof
9209 scripts for the time being.
9211 * ML operator HTML.with_charset specifies the charset begin used for
9212 generated HTML files. For example:
9214 HTML.with_charset "utf-8" use_thy "Hebrew";
9215 HTML.with_charset "utf-8" use_thy "Chinese";
9220 * Allow symlinks to all proper Isabelle executables (Isabelle,
9221 isabelle, isatool etc.).
9223 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9224 isatool doc, isatool mkdir, display_drafts etc.).
9226 * isatool usedir: option -f allows specification of the ML file to be
9227 used by Isabelle; default is ROOT.ML.
9229 * New isatool version outputs the version identifier of the Isabelle
9230 distribution being used.
9232 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9233 (containing Boolean satisfiability problems) into Isabelle/HOL
9238 New in Isabelle2004 (April 2004)
9239 --------------------------------
9243 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9244 Replaces linorder.ML.
9246 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9247 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9248 (\<a>...\<z>), are now considered normal letters, and can therefore
9249 be used anywhere where an ASCII letter (a...zA...Z) has until
9250 now. COMPATIBILITY: This obviously changes the parsing of some
9251 terms, especially where a symbol has been used as a binder, say
9252 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9253 as an identifier. Fix it by inserting a space around former
9254 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9255 existing theory and ML files.
9257 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9259 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9260 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9261 a normal (but invisible) letter. For multiple letter subscripts repeat
9262 \<^isub> like this: x\<^isub>1\<^isub>2.
9264 * Pure: There are now sub-/superscripts that can span more than one
9265 character. Text between \<^bsub> and \<^esub> is set in subscript in
9266 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9267 superscript. The new control characters are not identifier parts.
9269 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9270 content of "..." to the latex file instead of \isacntrl... . The "..."
9271 may consist of any printable characters excluding the end bracket >.
9273 * Pure: Using new Isar command "finalconsts" (or the ML functions
9274 Theory.add_finals or Theory.add_finals_i) it is now possible to
9275 declare constants "final", which prevents their being given a definition
9276 later. It is useful for constants whose behaviour is fixed axiomatically
9277 rather than definitionally, such as the meta-logic connectives.
9279 * Pure: 'instance' now handles general arities with general sorts
9280 (i.e. intersections of classes),
9282 * Presentation: generated HTML now uses a CSS style sheet to make layout
9283 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9284 It can be changed to alter the colors/layout of generated pages.
9289 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9290 cut_tac, subgoal_tac and thin_tac:
9291 - Now understand static (Isar) contexts. As a consequence, users of Isar
9292 locales are no longer forced to write Isar proof scripts.
9293 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9295 - INCOMPATIBILITY: names of variables to be instantiated may no
9296 longer be enclosed in quotes. Instead, precede variable name with `?'.
9297 This is consistent with the instantiation attribute "where".
9299 * Attributes "where" and "of":
9300 - Now take type variables of instantiated theorem into account when reading
9301 the instantiation string. This fixes a bug that caused instantiated
9302 theorems to have too special types in some circumstances.
9303 - "where" permits explicit instantiations of type variables.
9305 * Calculation commands "moreover" and "also" no longer interfere with
9306 current facts ("this"), admitting arbitrary combinations with "then"
9310 - Goal statements involving the context element "includes" no longer
9311 generate theorems with internal delta predicates (those ending on
9312 "_axioms") in the premise.
9313 Resolve particular premise with <locale>.intro to obtain old form.
9314 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9315 specification and "includes" elements in goal statement.
9316 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9317 [intro?] and [elim?] (respectively) by default.
9318 - Experimental command for instantiation of locales in proof contexts:
9319 instantiate <label>[<attrs>]: <loc>
9320 Instantiates locale <loc> and adds all its theorems to the current context
9321 taking into account their attributes. Label and attrs are optional
9322 modifiers, like in theorem declarations. If present, names of
9323 instantiated theorems are qualified with <label>, and the attributes
9324 <attrs> are applied after any attributes these theorems might have already.
9325 If the locale has assumptions, a chained fact of the form
9326 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9327 are derived. The command does not support old-style locales declared
9328 with "locale (open)".
9329 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9331 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9337 * Proof import: new image HOL4 contains the imported library from
9338 the HOL4 system with about 2500 theorems. It is imported by
9339 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9340 can be used like any other Isabelle image. See
9341 HOL/Import/HOL/README for more information.
9344 - Much improved handling of linear and partial orders.
9345 Reasoners for linear and partial orders are set up for type classes
9346 "linorder" and "order" respectively, and are added to the default simpset
9347 as solvers. This means that the simplifier can build transitivity chains
9348 to solve goals from the assumptions.
9349 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9350 of blast or auto after simplification become unnecessary because the goal
9351 is solved by simplification already.
9353 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9354 all proved in axiomatic type classes for semirings, rings and fields.
9357 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9358 now formalized using the Ring_and_Field theory mentioned above.
9359 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9360 than before, because now they are set up once in a generic manner.
9361 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9362 Look for the general versions in Ring_and_Field (and Power if they concern
9365 * Type "rat" of the rational numbers is now available in HOL-Complex.
9368 - Record types are now by default printed with their type abbreviation
9369 instead of the list of all field types. This can be configured via
9370 the reference "print_record_type_abbr".
9371 - Simproc "record_upd_simproc" for simplification of multiple updates added
9372 (not enabled by default).
9373 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9374 EX x. x = sel r to True (not enabled by default).
9375 - Tactic "record_split_simp_tac" to split and simplify records added.
9377 * 'specification' command added, allowing for definition by
9378 specification. There is also an 'ax_specification' command that
9379 introduces the new constants axiomatically.
9381 * arith(_tac) is now able to generate counterexamples for reals as well.
9383 * HOL-Algebra: new locale "ring" for non-commutative rings.
9385 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9386 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9388 * HOL-Matrix: a first theory for matrices in HOL with an application of
9389 matrix theory to linear programming.
9391 * Unions and Intersections:
9392 The latex output syntax of UN and INT has been changed
9393 from "\Union x \in A. B" to "\Union_{x \in A} B"
9394 i.e. the index formulae has become a subscript.
9395 Similarly for "\Union x. B", and for \Inter instead of \Union.
9397 * Unions and Intersections over Intervals:
9398 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9399 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9400 like in normal math, and corresponding versions for < and for intersection.
9402 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9403 lexicographic dictonary ordering has been added as "lexord".
9405 * ML: the legacy theory structures Int and List have been removed. They had
9406 conflicted with ML Basis Library structures having the same names.
9408 * 'refute' command added to search for (finite) countermodels. Only works
9409 for a fragment of HOL. The installation of an external SAT solver is
9410 highly recommended. See "HOL/Refute.thy" for details.
9412 * 'quickcheck' command: Allows to find counterexamples by evaluating
9413 formulae under an assignment of free variables to random values.
9414 In contrast to 'refute', it can deal with inductive datatypes,
9415 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9421 * Streams now come with concatenation and are part of the HOLCF image
9425 New in Isabelle2003 (May 2003)
9426 ------------------------------
9430 * Provers/simplifier:
9432 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9433 Assumptions are now subject to complete mutual simplification,
9434 not just from left to right. The simplifier now preserves
9435 the order of assumptions.
9437 Potential INCOMPATIBILITY:
9439 -- simp sometimes diverges where the old version did
9440 not, e.g. invoking simp on the goal
9442 [| P (f x); y = x; f x = f y |] ==> Q
9444 now gives rise to the infinite reduction sequence
9446 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9448 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9451 -- Tactics combining classical reasoner and simplification (such as auto)
9452 are also affected by this change, because many of them rely on
9453 simp. They may sometimes diverge as well or yield a different numbers
9454 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9455 in case of problems. Sometimes subsequent calls to the classical
9456 reasoner will fail because a preceeding call to the simplifier too
9457 eagerly simplified the goal, e.g. deleted redundant premises.
9459 - The simplifier trace now shows the names of the applied rewrite rules
9461 - You can limit the number of recursive invocations of the simplifier
9462 during conditional rewriting (where the simplifie tries to solve the
9463 conditions before applying the rewrite rule):
9464 ML "simp_depth_limit := n"
9465 where n is an integer. Thus you can force termination where previously
9466 the simplifier would diverge.
9468 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9470 - No longer aborts on failed congruence proof. Instead, the
9471 congruence is ignored.
9473 * Pure: New generic framework for extracting programs from constructive
9474 proofs. See HOL/Extraction.thy for an example instantiation, as well
9475 as HOL/Extraction for some case studies.
9477 * Pure: The main goal of the proof state is no longer shown by default, only
9478 the subgoals. This behaviour is controlled by a new flag.
9479 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9480 (ML: Proof.show_main_goal).
9482 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9483 rules whose conclusion matches subgoal 1:
9484 PG menu: Isabelle/Isar -> Show me -> matching rules
9485 The rules are ordered by how closely they match the subgoal.
9486 In particular, rules that solve a subgoal outright are displayed first
9487 (or rather last, the way they are printed).
9488 (ML: ProofGeneral.print_intros())
9490 * Pure: New flag trace_unify_fail causes unification to print
9491 diagnostic information (PG: in trace buffer) when it fails. This is
9492 useful for figuring out why single step proofs like rule, erule or
9495 * Pure: Locale specifications now produce predicate definitions
9496 according to the body of text (covering assumptions modulo local
9497 definitions); predicate "loc_axioms" covers newly introduced text,
9498 while "loc" is cumulative wrt. all included locale expressions; the
9499 latter view is presented only on export into the global theory
9500 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9501 on the old view without predicates;
9503 * Pure: predefined locales "var" and "struct" are useful for sharing
9504 parameters (as in CASL, for example); just specify something like
9505 ``var x + var y + struct M'' as import;
9507 * Pure: improved thms_containing: proper indexing of facts instead of
9508 raw theorems; check validity of results wrt. current name space;
9509 include local facts of proof configuration (also covers active
9510 locales), cover fixed variables in index; may use "_" in term
9511 specification; an optional limit for the number of printed facts may
9512 be given (the default is 40);
9514 * Pure: disallow duplicate fact bindings within new-style theory files
9517 * Provers: improved induct method: assumptions introduced by case
9518 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9519 the goal statement); "foo" still refers to all facts collectively;
9521 * Provers: the function blast.overloaded has been removed: all constants
9522 are regarded as potentially overloaded, which improves robustness in exchange
9523 for slight decrease in efficiency;
9525 * Provers/linorder: New generic prover for transitivity reasoning over
9526 linear orders. Note: this prover is not efficient!
9528 * Isar: preview of problems to finish 'show' now produce an error
9529 rather than just a warning (in interactive mode);
9536 - Produces a counter example if it cannot prove a goal.
9537 Note that the counter example may be spurious if the goal is not a formula
9538 of quantifier-free linear arithmetic.
9539 In ProofGeneral the counter example appears in the trace buffer.
9541 - Knows about div k and mod k where k is a numeral of type nat or int.
9543 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9544 linear arithmetic fails. This takes account of quantifiers and divisibility.
9545 Presburger arithmetic can also be called explicitly via presburger(_tac).
9547 * simp's arithmetic capabilities have been enhanced a bit: it now
9548 takes ~= in premises into account (by performing a case split);
9550 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9551 are distributed over a sum of terms;
9553 * New tactic "trans_tac" and method "trans" instantiate
9554 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9557 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9558 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9560 * 'typedef' command has new option "open" to suppress the set
9563 * functions Min and Max on finite sets have been introduced (theory
9566 * attribute [symmetric] now works for relations as well; it turns
9567 (x,y) : R^-1 into (y,x) : R, and vice versa;
9569 * induct over a !!-quantified statement (say !!x1..xn):
9570 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9572 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9573 %x. None. Warning: empty_def now refers to the previously hidden definition
9576 * Algebra: formalization of classical algebra. Intended as base for
9577 any algebraic development in Isabelle. Currently covers group theory
9578 (up to Sylow's theorem) and ring theory (Universal Property of
9579 Univariate Polynomials). Contributions welcome;
9581 * GroupTheory: deleted, since its material has been moved to Algebra;
9583 * Complex: new directory of the complex numbers with numeric constants,
9584 nonstandard complex numbers, and some complex analysis, standard and
9585 nonstandard (Jacques Fleuriot);
9587 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9589 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9592 * Real/HahnBanach: updated and adapted to locales;
9594 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9597 * UNITY: added the Meier-Sanders theory of progress sets;
9599 * MicroJava: bytecode verifier and lightweight bytecode verifier
9600 as abstract algorithms, instantiated to the JVM;
9602 * Bali: Java source language formalization. Type system, operational
9603 semantics, axiomatic semantics. Supported language features:
9604 classes, interfaces, objects,virtual methods, static methods,
9605 static/instance fields, arrays, access modifiers, definite
9606 assignment, exceptions.
9611 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9614 * Main ZF: virtually all theories converted to new-style format;
9619 * Pure: Tactic.prove provides sane interface for internal proofs;
9620 omits the infamous "standard" operation, so this is more appropriate
9621 than prove_goalw_cterm in many situations (e.g. in simprocs);
9623 * Pure: improved error reporting of simprocs;
9625 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9629 *** Document preparation ***
9631 * uses \par instead of \\ for line breaks in theory text. This may
9632 shift some page breaks in large documents. To get the old behaviour
9633 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9635 * minimized dependencies of isabelle.sty and isabellesym.sty on
9638 * \<euro> now needs package babel/greek instead of marvosym (which
9641 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9646 New in Isabelle2002 (March 2002)
9647 --------------------------------
9649 *** Document preparation ***
9651 * greatly simplified document preparation setup, including more
9652 graceful interpretation of isatool usedir -i/-d/-D options, and more
9653 instructive isatool mkdir; users should basically be able to get
9654 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9655 users may run a separate document processing stage manually like this:
9656 "isatool usedir -D output HOL Test && isatool document Test/output";
9658 * theory dependency graph may now be incorporated into documents;
9659 isatool usedir -g true will produce session_graph.eps/.pdf for use
9660 with \includegraphics of LaTeX;
9662 * proper spacing of consecutive markup elements, especially text
9663 blocks after section headings;
9665 * support bold style (for single symbols only), input syntax is like
9666 this: "\<^bold>\<alpha>" or "\<^bold>A";
9668 * \<bullet> is now output as bold \cdot by default, which looks much
9669 better in printed text;
9671 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9672 note that these symbols are currently unavailable in Proof General /
9673 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9675 * isatool latex no longer depends on changed TEXINPUTS, instead
9676 isatool document copies the Isabelle style files to the target
9682 * Pure/Provers: improved proof by cases and induction;
9683 - 'case' command admits impromptu naming of parameters (such as
9685 - 'induct' method divinates rule instantiation from the inductive
9686 claim; no longer requires excessive ?P bindings for proper
9687 instantiation of cases;
9688 - 'induct' method properly enumerates all possibilities of set/type
9689 rules; as a consequence facts may be also passed through *type*
9690 rules without further ado;
9691 - 'induct' method now derives symbolic cases from the *rulified*
9692 rule (before it used to rulify cases stemming from the internal
9693 atomized version); this means that the context of a non-atomic
9694 statement becomes is included in the hypothesis, avoiding the
9695 slightly cumbersome show "PROP ?case" form;
9696 - 'induct' may now use elim-style induction rules without chaining
9697 facts, using ``missing'' premises from the goal state; this allows
9698 rules stemming from inductive sets to be applied in unstructured
9699 scripts, while still benefitting from proper handling of non-atomic
9700 statements; NB: major inductive premises need to be put first, all
9701 the rest of the goal is passed through the induction;
9702 - 'induct' proper support for mutual induction involving non-atomic
9703 rule statements (uses the new concept of simultaneous goals, see
9705 - append all possible rule selections, but only use the first
9706 success (no backtracking);
9707 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9708 - undeclared rule case names default to numbers 1, 2, 3, ...;
9709 - added 'print_induct_rules' (covered by help item in recent Proof
9711 - moved induct/cases attributes to Pure, methods to Provers;
9712 - generic method setup instantiated for FOL and HOL;
9714 * Pure: support multiple simultaneous goal statements, for example
9715 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9716 meta-level mechanism, this acts as if several individual goals had
9717 been stated separately; in particular common proof methods need to be
9718 repeated in order to cover all claims; note that a single elimination
9719 step is *not* sufficient to establish the two conjunctions, so this
9722 assume "A & B" then have A and B .. (*".." fails*)
9724 better use "obtain" in situations as above; alternative refer to
9725 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9727 * Pure: proper integration with ``locales''; unlike the original
9728 version by Florian Kammller, Isar locales package high-level proof
9729 contexts rather than raw logical ones (e.g. we admit to include
9730 attributes everywhere); operations on locales include merge and
9731 rename; support for implicit arguments (``structures''); simultaneous
9732 type-inference over imports and text; see also HOL/ex/Locales.thy for
9735 * Pure: the following commands have been ``localized'', supporting a
9736 target locale specification "(in name)": 'lemma', 'theorem',
9737 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9738 stored both within the locale and at the theory level (exported and
9739 qualified by the locale name);
9741 * Pure: theory goals may now be specified in ``long'' form, with
9742 ad-hoc contexts consisting of arbitrary locale elements. for example
9743 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9744 definitions may be given, too); the result is a meta-level rule with
9745 the context elements being discharged in the obvious way;
9747 * Pure: new proof command 'using' allows to augment currently used
9748 facts after a goal statement ('using' is syntactically analogous to
9749 'apply', but acts on the goal's facts only); this allows chained facts
9750 to be separated into parts given before and after a claim, as in
9751 ``from a and b have C using d and e <proof>'';
9753 * Pure: renamed "antecedent" case to "rule_context";
9755 * Pure: new 'judgment' command records explicit information about the
9756 object-logic embedding (used by several tools internally); no longer
9757 use hard-wired "Trueprop";
9759 * Pure: added 'corollary' command;
9761 * Pure: fixed 'token_translation' command;
9763 * Pure: removed obsolete 'exported' attribute;
9765 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9766 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9767 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9769 * Pure: method 'atomize' presents local goal premises as object-level
9770 statements (atomic meta-level propositions); setup controlled via
9771 rewrite rules declarations of 'atomize' attribute; example
9772 application: 'induct' method with proper rule statements in improper
9775 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9776 now consider the syntactic context of assumptions, giving a better
9777 chance to get type-inference of the arguments right (this is
9778 especially important for locales);
9780 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9783 * Pure/obtain: the formal conclusion "thesis", being marked as
9784 ``internal'', may no longer be reference directly in the text;
9785 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9788 * Pure: generic 'sym' attribute which declares a rule both as pure
9789 'elim?' and for the 'symmetric' operation;
9791 * Pure: marginal comments ``--'' may now occur just anywhere in the
9792 text; the fixed correlation with particular command syntax has been
9795 * Pure: new method 'rules' is particularly well-suited for proof
9796 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9797 but often produces more compact proof terms with less detours;
9799 * Pure/Provers/classical: simplified integration with pure rule
9800 attributes and methods; the classical "intro?/elim?/dest?"
9801 declarations coincide with the pure ones; the "rule" method no longer
9802 includes classically swapped intros; "intro" and "elim" methods no
9803 longer pick rules from the context; also got rid of ML declarations
9804 AddXIs/AddXEs/AddXDs; all of this has some potential for
9807 * Provers/classical: attribute 'swapped' produces classical inversions
9808 of introduction rules;
9810 * Provers/simplifier: 'simplified' attribute may refer to explicit
9811 rules instead of full simplifier context; 'iff' attribute handles
9814 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9816 * HOL: 'recdef' now fails on unfinished automated proofs, use
9817 "(permissive)" option to recover old behavior;
9819 * HOL: 'inductive' no longer features separate (collective) attributes
9820 for 'intros' (was found too confusing);
9822 * HOL: properly declared induction rules less_induct and
9828 * HOL: moved over to sane numeral syntax; the new policy is as
9831 - 0 and 1 are polymorphic constants, which are defined on any
9832 numeric type (nat, int, real etc.);
9834 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9835 binary representation internally;
9837 - type nat has special constructor Suc, and generally prefers Suc 0
9838 over 1::nat and Suc (Suc 0) over 2::nat;
9840 This change may cause significant problems of INCOMPATIBILITY; here
9841 are some hints on converting existing sources:
9843 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9844 entities, so expressions involving "-" (unary or binary minus) need
9845 to be spaced properly;
9847 - existing occurrences of "1" may need to be constraint "1::nat" or
9848 even replaced by Suc 0; similar for old "2";
9850 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9852 - remove all special provisions on numerals in proofs;
9854 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9855 representation (depends on bin_arith_simps in the default context);
9857 * HOL: symbolic syntax for x^2 (numeral 2);
9859 * HOL: the class of all HOL types is now called "type" rather than
9860 "term"; INCOMPATIBILITY, need to adapt references to this type class
9861 in axclass/classes, instance/arities, and (usually rare) occurrences
9862 in typings (of consts etc.); internally the class is called
9863 "HOL.type", ML programs should refer to HOLogic.typeS;
9865 * HOL/record package improvements:
9866 - new derived operations "fields" to build a partial record section,
9867 "extend" to promote a fixed record to a record scheme, and
9868 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9869 declared as simp by default;
9870 - shared operations ("more", "fields", etc.) now need to be always
9871 qualified) --- potential INCOMPATIBILITY;
9872 - removed "make_scheme" operations (use "make" with "extend") --
9874 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9875 - provides cases/induct rules for use with corresponding Isar
9876 methods (for concrete records, record schemes, concrete more
9877 parts, and schematic more parts -- in that order);
9878 - internal definitions directly based on a light-weight abstract
9879 theory of product types over typedef rather than datatype;
9881 * HOL: generic code generator for generating executable ML code from
9882 specifications; specific support for HOL constructs such as inductive
9883 datatypes and sets, as well as recursive functions; can be invoked
9884 via 'generate_code' theory section;
9886 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9888 * HOL: consolidated and renamed several theories. In particular:
9889 Ord.thy has been absorbed into HOL.thy
9890 String.thy has been absorbed into List.thy
9892 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9893 (beware of argument permutation!);
9895 * HOL: linorder_less_split superseded by linorder_cases;
9897 * HOL/List: "nodups" renamed to "distinct";
9899 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9900 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9901 - Ex_def has changed, now need to use some_eq_ex
9903 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9904 in this (rare) case use:
9906 delSWrapper "split_all_tac"
9907 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9909 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9912 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9913 Isabelle's type classes, ^ on functions and relations has too general
9914 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9915 necessary to attach explicit type constraints;
9917 * HOL/Relation: the prefix name of the infix "O" has been changed from
9918 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9919 renamed accordingly (eg "compI" -> "rel_compI").
9921 * HOL: syntax translations now work properly with numerals and records
9924 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9925 of "lam" -- INCOMPATIBILITY;
9927 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9928 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9929 renamed "Product_Type.unit";
9931 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9933 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9934 the "cases" method);
9936 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9939 * HOL/IMP: updated and converted to new-style theory format; several
9940 parts turned into readable document, with proper Isar proof texts and
9941 some explanations (by Gerwin Klein);
9943 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9945 * HOL-Hyperreal is now a logic image;
9950 * Isar: consts/constdefs supports mixfix syntax for continuous
9953 * Isar: domain package adapted to new-style theory format, e.g. see
9956 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9957 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9958 lift.induct_tac, always use UU instead of Undef;
9960 * HOLCF/IMP: updated and converted to new-style theory;
9965 * Isar: proper integration of logic-specific tools and packages,
9966 including theory commands '(co)inductive', '(co)datatype',
9967 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9968 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9970 * theory Main no longer includes AC; for the Axiom of Choice, base
9971 your theory on Main_ZFC;
9973 * the integer library now covers quotients and remainders, with many
9974 laws relating division to addition, multiplication, etc.;
9976 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9977 typeless version of the formalism;
9979 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9982 * ZF/Induct: new directory for examples of inductive definitions,
9983 including theory Multiset for multiset orderings; converted to
9984 new-style theory format;
9986 * ZF: many new theorems about lists, ordinals, etc.;
9991 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9992 variable proof controls level of detail: 0 = no proofs (only oracle
9993 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9994 also ref manual for further ML interfaces;
9996 * Pure/axclass: removed obsolete ML interface
9997 goal_subclass/goal_arity;
9999 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
10000 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
10001 separate tokens, so expressions involving minus need to be spaced
10004 * Pure/syntax: support non-oriented infixes, using keyword "infix"
10005 rather than "infixl" or "infixr";
10007 * Pure/syntax: concrete syntax for dummy type variables admits genuine
10008 sort constraint specifications in type inference; e.g. "x::_::foo"
10009 ensures that the type of "x" is of sort "foo" (but not necessarily a
10012 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
10013 control output of nested => (types); the default behavior is
10016 * Pure/syntax: builtin parse translation for "_constify" turns valued
10017 tokens into AST constants;
10019 * Pure/syntax: prefer later declarations of translations and print
10020 translation functions; potential INCOMPATIBILITY: need to reverse
10021 multiple declarations for same syntax element constant;
10023 * Pure/show_hyps reset by default (in accordance to existing Isar
10026 * Provers/classical: renamed addaltern to addafter, addSaltern to
10029 * Provers/clasimp: ``iff'' declarations now handle conditional rules
10032 * system: tested support for MacOS X; should be able to get Isabelle +
10033 Proof General to work in a plain Terminal after installing Poly/ML
10034 (e.g. from the Isabelle distribution area) and GNU bash alone
10035 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
10036 support requires further installations, e.g. from
10037 http://fink.sourceforge.net/);
10039 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
10041 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
10042 of 40 MB), cf. ML_OPTIONS;
10044 * system: Proof General keywords specification is now part of the
10045 Isabelle distribution (see etc/isar-keywords.el);
10047 * system: support for persistent Proof General sessions (refrain from
10048 outdating all loaded theories on startup); user may create writable
10049 logic images like this: ``isabelle -q HOL Test'';
10051 * system: smart selection of Isabelle process versus Isabelle
10052 interface, accommodates case-insensitive file systems (e.g. HFS+); may
10053 run both "isabelle" and "Isabelle" even if file names are badly
10054 damaged (executable inspects the case of the first letter of its own
10055 name); added separate "isabelle-process" and "isabelle-interface";
10057 * system: refrain from any attempt at filtering input streams; no
10058 longer support ``8bit'' encoding of old isabelle font, instead proper
10059 iso-latin characters may now be used; the related isatools
10060 "symbolinput" and "nonascii" have disappeared as well;
10062 * system: removed old "xterm" interface (the print modes "xterm" and
10063 "xterm_color" are still available for direct use in a suitable
10068 New in Isabelle99-2 (February 2001)
10069 -----------------------------------
10071 *** Overview of INCOMPATIBILITIES ***
10073 * HOL: please note that theories in the Library and elsewhere often use the
10074 new-style (Isar) format; to refer to their theorems in an ML script you must
10075 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
10077 * HOL: inductive package no longer splits induction rule aggressively,
10078 but only as far as specified by the introductions given; the old
10079 format may be recovered via ML function complete_split_rule or attribute
10080 'split_rule (complete)';
10082 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10083 gfp_Tarski to gfp_unfold;
10085 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10087 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10088 relation); infix "^^" has been renamed "``"; infix "``" has been
10089 renamed "`"; "univalent" has been renamed "single_valued";
10091 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10094 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10096 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10098 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10099 consequence, it is no longer monotonic wrt. the local goal context
10100 (which is now passed through the inductive cases);
10102 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10103 \<gg> to \<ggreater>;
10106 *** Document preparation ***
10108 * \isabellestyle{NAME} selects version of Isabelle output (currently
10109 available: are "it" for near math-mode best-style output, "sl" for
10110 slanted text style, and "tt" for plain type-writer; if no
10111 \isabellestyle command is given, output is according to slanted
10114 * support sub/super scripts (for single symbols only), input syntax is
10115 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10117 * some more standard symbols; see Appendix A of the system manual for
10118 the complete list of symbols defined in isabellesym.sty;
10120 * improved isabelle style files; more abstract symbol implementation
10121 (should now use \isamath{...} and \isatext{...} in custom symbol
10124 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10125 state; Note that presentation of goal states does not conform to
10126 actual human-readable proof documents. Please do not include goal
10127 states into document output unless you really know what you are doing!
10129 * proper indentation of antiquoted output with proportional LaTeX
10132 * no_document ML operator temporarily disables LaTeX document
10135 * isatool unsymbolize tunes sources for plain ASCII communication;
10140 * Pure: Isar now suffers initial goal statements to contain unbound
10141 schematic variables (this does not conform to actual readable proof
10142 documents, due to unpredictable outcome and non-compositional proof
10143 checking); users who know what they are doing may use schematic goals
10144 for Prolog-style synthesis of proven results;
10146 * Pure: assumption method (an implicit finishing) now handles actual
10149 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10150 initial goal, declare "that" only as Pure intro (only for single
10151 steps); the "that" rule assumption may now be involved in implicit
10152 finishing, thus ".." becomes a feasible for trivial obtains;
10154 * Pure: default proof step now includes 'intro_classes'; thus trivial
10155 instance proofs may be performed by "..";
10157 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10158 statements as well;
10160 * Pure: more robust selection of calculational rules;
10162 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10163 rule (as well as the assumption rule);
10165 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10166 lemmas, using the graph browser tool;
10168 * Pure: predict failure of "show" in interactive mode;
10170 * Pure: 'thms_containing' now takes actual terms as arguments;
10172 * HOL: improved method 'induct' --- now handles non-atomic goals
10173 (potential INCOMPATIBILITY); tuned error handling;
10175 * HOL: cases and induct rules now provide explicit hints about the
10176 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10177 any remaining facts are inserted into the goal verbatim;
10179 * HOL: local contexts (aka cases) may now contain term bindings as
10180 well; the 'cases' and 'induct' methods new provide a ?case binding for
10181 the result to be shown in each case;
10183 * HOL: added 'recdef_tc' command;
10185 * isatool convert assists in eliminating legacy ML scripts;
10190 * HOL/Library: a collection of generic theories to be used together
10191 with main HOL; the theory loader path already includes this directory
10192 by default; the following existing theories have been moved here:
10193 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10194 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10196 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10197 modelling and verification task performed in Isabelle/HOL +
10198 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10200 * HOL/Algebra: special summation operator SUM no longer exists, it has
10201 been replaced by setsum; infix 'assoc' now has priority 50 (like
10202 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10203 'domain', this makes the theory consistent with mathematical
10206 * HOL basics: added overloaded operations "inverse" and "divide"
10207 (infix "/"), syntax for generic "abs" operation, generic summation
10210 * HOL/typedef: simplified package, provide more useful rules (see also
10213 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10214 now expressed as a proper nested rule (old-style tactic scripts may
10215 require atomize_strip_tac to cope with non-atomic premises);
10217 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10218 to "split_conv" (old name still available for compatibility);
10220 * HOL: improved concrete syntax for strings (e.g. allows translation
10221 rules with string literals);
10223 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10224 and Fleuriot's mechanization of analysis, including the transcendental
10225 functions for the reals;
10227 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10232 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10233 "lam" is displayed as TWO lambda-symbols
10235 * CTT: theory Main now available, containing everything (that is, Bool
10241 * Pure: the Simplifier has been implemented properly as a derived rule
10242 outside of the actual kernel (at last!); the overall performance
10243 penalty in practical applications is about 50%, while reliability of
10244 the Isabelle inference kernel has been greatly improved;
10246 * print modes "brackets" and "no_brackets" control output of nested =>
10247 (types) and ==> (props); the default behaviour is "brackets";
10249 * Provers: fast_tac (and friends) now handle actual object-logic rules
10250 as assumptions as well;
10252 * system: support Poly/ML 4.0;
10254 * system: isatool install handles KDE version 1 or 2;
10258 New in Isabelle99-1 (October 2000)
10259 ----------------------------------
10261 *** Overview of INCOMPATIBILITIES ***
10263 * HOL: simplification of natural numbers is much changed; to partly
10264 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10265 issue the following ML commands:
10267 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10268 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10270 * HOL: simplification no longer dives into case-expressions; this is
10271 controlled by "t.weak_case_cong" for each datatype t;
10273 * HOL: nat_less_induct renamed to less_induct;
10275 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10276 fixsome to patch .thy and .ML sources automatically;
10278 select_equality -> some_equality
10279 select_eq_Ex -> some_eq_ex
10280 selectI2EX -> someI2_ex
10283 select1_equality -> some1_equality
10284 Eps_sym_eq -> some_sym_eq_trivial
10285 Eps_eq -> some_eq_trivial
10287 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10289 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10292 * HOL: the recursion equations generated by 'recdef' are now called
10293 f.simps instead of f.rules;
10295 * HOL: qed_spec_mp now also handles bounded ALL as well;
10297 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10298 sometimes be needed;
10300 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10302 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10304 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10305 product is now "<*>" instead of "Times"; the lexicographic product is
10306 now "<*lex*>" instead of "**";
10308 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10309 of main HOL, but was unused); better use HOL's datatype package;
10311 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10312 the old syntax may be recovered as follows:
10315 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10316 (infixl "\\<oplus>" 100)
10318 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10320 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10321 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10324 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10325 changed from A/r to A//r;
10327 * ZF: new treatment of arithmetic (nat & int) may break some old
10330 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10331 rulify -> rule_format, elimify -> elim_format, ...);
10333 * Isar/Provers: intro/elim/dest attributes changed; renamed
10334 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10335 should have to change intro!! to intro? only); replaced "delrule" by
10338 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10340 * Provers: strengthened force_tac by using new first_best_tac;
10342 * LaTeX document preparation: several changes of isabelle.sty (see
10346 *** Document preparation ***
10348 * formal comments (text blocks etc.) in new-style theories may now
10349 contain antiquotations of thm/prop/term/typ/text to be presented
10350 according to latex print mode; concrete syntax is like this:
10351 @{term[show_types] "f(x) = a + x"};
10353 * isatool mkdir provides easy setup of Isabelle session directories,
10354 including proper document sources;
10356 * generated LaTeX sources are now deleted after successful run
10357 (isatool document -c); may retain a copy somewhere else via -D option
10360 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10361 style files, achieving self-contained LaTeX sources and simplifying
10364 * old-style theories now produce (crude) LaTeX output as well;
10366 * browser info session directories are now self-contained (may be put
10367 on WWW server seperately); improved graphs of nested sessions; removed
10368 graph for 'all sessions';
10370 * several improvements in isabelle style files; \isabellestyle{it}
10371 produces fake math mode output; \isamarkupheader is now \section by
10372 default; see lib/texinputs/isabelle.sty etc.;
10377 * Isar/Pure: local results and corresponding term bindings are now
10378 subject to Hindley-Milner polymorphism (similar to ML); this
10379 accommodates incremental type-inference very nicely;
10381 * Isar/Pure: new derived language element 'obtain' supports
10382 generalized existence reasoning;
10384 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10385 support accumulation of results, without applying any rules yet;
10386 useful to collect intermediate results without explicit name
10387 references, and for use with transitivity rules with more than 2
10390 * Isar/Pure: scalable support for case-analysis type proofs: new
10391 'case' language element refers to local contexts symbolically, as
10392 produced by certain proof methods; internally, case names are attached
10393 to theorems as "tags";
10395 * Isar/Pure: theory command 'hide' removes declarations from
10396 class/type/const name spaces;
10398 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10399 indicate potential overloading;
10401 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10403 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10404 "{a,b,c}" instead of {a,b,c};
10406 * Isar/Pure now provides its own version of intro/elim/dest
10407 attributes; useful for building new logics, but beware of confusion
10408 with the version in Provers/classical;
10410 * Isar/Pure: the local context of (non-atomic) goals is provided via
10411 case name 'antecedent';
10413 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10414 to the current context is now done automatically);
10416 * Isar/Pure: theory command 'method_setup' provides a simple interface
10417 for definining proof methods in ML;
10419 * Isar/Provers: intro/elim/dest attributes changed; renamed
10420 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10421 most cases, one should have to change intro!! to intro? only);
10422 replaced "delrule" by "rule del";
10424 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10425 'symmetric' attribute (the latter supercedes [RS sym]);
10427 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10428 method modifier); 'simp' method: 'only:' modifier removes loopers as
10429 well (including splits);
10431 * Isar/Provers: Simplifier and Classical methods now support all kind
10432 of modifiers used in the past, including 'cong', 'iff', etc.
10434 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10435 of Simplifier and Classical reasoner);
10437 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10438 now support named cases; major packages (inductive, datatype, primrec,
10439 recdef) support case names and properly name parameters;
10441 * Isar/HOL: new transitivity rules for substitution in inequalities --
10442 monotonicity conditions are extracted to be proven at end of
10445 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10448 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10449 split_if split_if_asm; datatype package provides theorems foo.splits =
10450 foo.split foo.split_asm for each datatype;
10452 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10453 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10454 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10455 use "(cases (simplified))" method in proper proof texts);
10457 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10459 * Isar: names of theorems etc. may be natural numbers as well;
10461 * Isar: 'pr' command: optional arguments for goals_limit and
10462 ProofContext.prems_limit; no longer prints theory contexts, but only
10465 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10466 additional print modes to be specified; e.g. "pr(latex)" will print
10467 proof state according to the Isabelle LaTeX style;
10469 * Isar: improved support for emulating tactic scripts, including proof
10470 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10471 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10472 (for HOL datatypes);
10474 * Isar: simplified (more robust) goal selection of proof methods: 1st
10475 goal, all goals, or explicit goal specifier (tactic emulation); thus
10476 'proof method scripts' have to be in depth-first order;
10478 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10480 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10481 should instead use individual commands for printing items
10482 (print_commands, print_methods etc.);
10484 * Isar: added 'nothing' --- the empty list of theorems;
10489 * HOL/MicroJava: formalization of a fragment of Java, together with a
10490 corresponding virtual machine and a specification of its bytecode
10491 verifier and a lightweight bytecode verifier, including proofs of
10492 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10493 Cornelia Pusch (see also the homepage of project Bali at
10494 http://isabelle.in.tum.de/Bali/);
10496 * HOL/Algebra: new theory of rings and univariate polynomials, by
10499 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10500 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10503 * HOL/Lattice: fundamental concepts of lattice theory and order
10504 structures, including duals, properties of bounds versus algebraic
10505 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10506 Theorem for complete lattices etc.; may also serve as a demonstration
10507 for abstract algebraic reasoning using axiomatic type classes, and
10508 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10510 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10513 * HOL/IMPP: extension of IMP with local variables and mutually
10514 recursive procedures, by David von Oheimb;
10516 * HOL/Lambda: converted into new-style theory and document;
10518 * HOL/ex/Multiquote: example of multiple nested quotations and
10519 anti-quotations -- basically a generalized version of de-Bruijn
10520 representation; very useful in avoiding lifting of operations;
10522 * HOL/record: added general record equality rule to simpset; fixed
10523 select-update simplification procedure to handle extended records as
10524 well; admit "r" as field name;
10526 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10527 other numeric types and also as the identity of groups, rings, etc.;
10529 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10530 Types nat and int belong to this axclass;
10532 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10533 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10534 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10535 two terms #m*u and #n*u are replaced by #(m+n)*u
10536 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10537 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10538 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10540 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10541 powerful prover for predicate logic but knows nothing of clasets; see
10542 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10544 * HOL: new version of "case_tac" subsumes both boolean case split and
10545 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10546 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10548 * HOL: simplification no longer dives into case-expressions: only the
10549 selector expression is simplified, but not the remaining arms; to
10550 enable full simplification of case-expressions for datatype t, you may
10551 remove t.weak_case_cong from the simpset, either globally (Delcongs
10552 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10554 * HOL/recdef: the recursion equations generated by 'recdef' for
10555 function 'f' are now called f.simps instead of f.rules; if all
10556 termination conditions are proved automatically, these simplification
10557 rules are added to the simpset, as in primrec; rules may be named
10558 individually as well, resulting in a separate list of theorems for
10561 * HOL/While is a new theory that provides a while-combinator. It
10562 permits the definition of tail-recursive functions without the
10563 provision of a termination measure. The latter is necessary once the
10564 invariant proof rule for while is applied.
10566 * HOL: new (overloaded) notation for the set of elements below/above
10567 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10569 * HOL: theorems impI, allI, ballI bound as "strip";
10571 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10572 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10573 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10575 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10577 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10578 main HOL, but was unused);
10580 * HOL: fewer consts declared as global (e.g. have to refer to
10581 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10583 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10584 in case of overlap with user translations (e.g. judgements over
10585 tuples); (note that the underlying logical represenation is still
10591 * ZF: simplification automatically cancels common terms in arithmetic
10592 expressions over nat and int;
10594 * ZF: new treatment of nat to minimize type-checking: all operators
10595 coerce their operands to a natural number using the function natify,
10596 making the algebraic laws unconditional;
10598 * ZF: as above, for int: operators coerce their operands to an integer
10599 using the function intify;
10601 * ZF: the integer library now contains many of the usual laws for the
10602 orderings, including $<=, and monotonicity laws for $+ and $*;
10604 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10607 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10608 to the simplifier and classical reasoner simultaneously;
10613 * Provers: blast_tac now handles actual object-logic rules as
10614 assumptions; note that auto_tac uses blast_tac internally as well;
10616 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10617 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10619 * Provers: delrules now handles destruct rules as well (no longer need
10620 explicit make_elim);
10622 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10623 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10624 use instead the strong form,
10625 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10626 in HOL, FOL and ZF the function cla_make_elim will create such rules
10627 from destruct-rules;
10629 * Provers: Simplifier.easy_setup provides a fast path to basic
10630 Simplifier setup for new object-logics;
10632 * Pure: AST translation rules no longer require constant head on LHS;
10634 * Pure: improved name spaces: ambiguous output is qualified; support
10635 for hiding of names;
10637 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10638 XSYMBOL_HOME; no longer need to do manual configuration in most
10641 * system: compression of ML heaps images may now be controlled via -c
10642 option of isabelle and isatool usedir (currently only observed by
10645 * system: isatool installfonts may handle X-Symbol fonts as well (very
10646 useful for remote X11);
10648 * system: provide TAGS file for Isabelle sources;
10650 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10653 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10654 timing flag supersedes proof_timing and Toplevel.trace;
10656 * ML: new combinators |>> and |>>> for incremental transformations
10657 with secondary results (e.g. certain theory extensions):
10659 * ML: PureThy.add_defs gets additional argument to indicate potential
10660 overloading (usually false);
10662 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10667 New in Isabelle99 (October 1999)
10668 --------------------------------
10670 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10672 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10673 are no longer simplified. (This allows the simplifier to unfold recursive
10674 functional programs.) To restore the old behaviour, declare
10676 Delcongs [if_weak_cong];
10678 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10681 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10683 * HOL/datatype: mutual_induct_tac no longer exists --
10684 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10686 * HOL/typedef: fixed type inference for representing set; type
10687 arguments now have to occur explicitly on the rhs as type constraints;
10689 * ZF: The con_defs part of an inductive definition may no longer refer
10690 to constants declared in the same theory;
10692 * HOL, ZF: the function mk_cases, generated by the inductive
10693 definition package, has lost an argument. To simplify its result, it
10694 uses the default simpset instead of a supplied list of theorems.
10696 * HOL/List: the constructors of type list are now Nil and Cons;
10698 * Simplifier: the type of the infix ML functions
10699 setSSolver addSSolver setSolver addSolver
10700 is now simpset * solver -> simpset where `solver' is a new abstract type
10701 for packaging solvers. A solver is created via
10702 mk_solver: string -> (thm list -> int -> tactic) -> solver
10703 where the string argument is only a comment.
10706 *** Proof tools ***
10708 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10709 decision procedure for linear arithmetic. Currently it is used for
10710 types `nat', `int', and `real' in HOL (see below); it can, should and
10711 will be instantiated for other types and logics as well.
10713 * The simplifier now accepts rewrite rules with flexible heads, eg
10714 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10715 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10721 * New Isabelle/Isar subsystem provides an alternative to traditional
10722 tactical theorem proving; together with the ProofGeneral/isar user
10723 interface it offers an interactive environment for developing human
10724 readable proof documents (Isar == Intelligible semi-automated
10725 reasoning); for further information see isatool doc isar-ref,
10726 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10728 * improved and simplified presentation of theories: better HTML markup
10729 (including colors), graph views in several sizes; isatool usedir now
10730 provides a proper interface for user theories (via -P option); actual
10731 document preparation based on (PDF)LaTeX is available as well (for
10732 new-style theories only); see isatool doc system for more information;
10734 * native support for Proof General, both for classic Isabelle and
10737 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10738 using the graph browser tool;
10740 * Isabelle manuals now also available as PDF;
10742 * theory loader rewritten from scratch (may not be fully
10743 bug-compatible); old loadpath variable has been replaced by show_path,
10744 add_path, del_path, reset_path functions; new operations such as
10745 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10748 * improved isatool install: option -k creates KDE application icon,
10749 option -p DIR installs standalone binaries;
10751 * added ML_PLATFORM setting (useful for cross-platform installations);
10752 more robust handling of platform specific ML images for SML/NJ;
10754 * the settings environment is now statically scoped, i.e. it is never
10755 created again in sub-processes invoked from isabelle, isatool, or
10758 * path element specification '~~' refers to '$ISABELLE_HOME';
10760 * in locales, the "assumes" and "defines" parts may be omitted if
10763 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10766 * new print_mode "HTML";
10768 * new flag show_tags controls display of tags of theorems (which are
10769 basically just comments that may be attached by some tools);
10771 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10772 mode and goal output format:
10774 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10776 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10778 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10779 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10781 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10783 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10785 * function bind_thms stores lists of theorems (cf. bind_thm);
10787 * new shorthand tactics ftac, eatac, datac, fatac;
10789 * qed (and friends) now accept "" as result name; in that case the
10790 theorem is not stored, but proper checks and presentation of the
10791 result still apply;
10793 * theorem database now also indexes constants "Trueprop", "all",
10794 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10799 ** HOL arithmetic **
10801 * There are now decision procedures for linear arithmetic over nat and
10804 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10805 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10806 are treated as atomic; subformulae not involving type `nat' or `int'
10807 are ignored; quantified subformulae are ignored unless they are
10808 positive universal or negative existential. The tactic has to be
10809 invoked by hand and can be a little bit slow. In particular, the
10810 running time is exponential in the number of occurrences of `min' and
10811 `max', and `-' on `nat'.
10813 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10814 (negated) (in)equalities among the premises and the conclusion into
10815 account (i.e. no compound formulae) and does not know about `min' and
10816 `max', and `-' on `nat'. It is fast and is used automatically by the
10819 NB: At the moment, these decision procedures do not cope with mixed
10820 nat/int formulae where the two parts interact, such as `m < n ==>
10823 * HOL/Numeral provides a generic theory of numerals (encoded
10824 efficiently as bit strings); setup for types nat/int/real is in place;
10825 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10826 int, existing theories and proof scripts may require a few additional
10829 * integer division and remainder can now be performed on constant
10832 * many properties of integer multiplication, division and remainder
10835 * An interface to the Stanford Validity Checker (SVC) is available through the
10836 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10837 are proved automatically. SVC must be installed separately, and its results
10838 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10839 invocation of the underlying oracle). For SVC see
10840 http://verify.stanford.edu/SVC
10842 * IsaMakefile: the HOL-Real target now builds an actual image;
10847 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10848 (in Isabelle/Isar) -- by Gertrud Bauer;
10850 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10851 analysis for assembly languages with subtypes;
10853 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10854 -- avoids syntactic ambiguities and treats state, transition, and
10855 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10856 changed syntax and (many) tactics;
10858 * HOL/inductive: Now also handles more general introduction rules such
10859 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10860 theorems are now maintained within the theory (maintained via the
10863 * HOL/datatype: Now also handles arbitrarily branching datatypes
10864 (using function types) such as
10866 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10868 * HOL/record: record_simproc (part of the default simpset) takes care
10869 of selectors applied to updated records; record_split_tac is no longer
10870 part of the default claset; update_defs may now be removed from the
10871 simpset in many cases; COMPATIBILITY: old behavior achieved by
10873 claset_ref () := claset() addSWrapper record_split_wrapper;
10874 Delsimprocs [record_simproc]
10876 * HOL/typedef: fixed type inference for representing set; type
10877 arguments now have to occur explicitly on the rhs as type constraints;
10879 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10880 names rather than an ML expression;
10882 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10883 supplied later. Program schemes can be defined, such as
10884 "While B C s = (if B s then While B C (C s) else s)"
10885 where the well-founded relation can be chosen after B and C have been given.
10887 * HOL/List: the constructors of type list are now Nil and Cons;
10888 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10889 course, ML tools referring to List.list.op # etc. have to be adapted;
10891 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10892 disabled by default; run isabelle with option -m HOL to get back to
10893 the original Gordon/HOL-style output;
10895 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10896 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10898 * HOL basic syntax simplified (more orthogonal): all variants of
10899 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10900 Eps operator is provided as well: "SOME x. P[x]";
10902 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10904 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10905 thus available for user theories;
10907 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10908 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10911 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10912 several times and then mp;
10917 * the notation <<...>> is now available as a notation for sequences of
10920 * the simplifier is now installed
10922 * the axiom system has been generalized (thanks to Soren Heilmann)
10924 * the classical reasoner now has a default rule database
10929 * new primrec section allows primitive recursive functions to be given
10930 directly (as in HOL) over datatypes and the natural numbers;
10932 * new tactics induct_tac and exhaust_tac for induction (or case
10933 analysis) over datatypes and the natural numbers;
10935 * the datatype declaration of type T now defines the recursor T_rec;
10937 * simplification automatically does freeness reasoning for datatype
10940 * automatic type-inference, with AddTCs command to insert new
10941 type-checking rules;
10943 * datatype introduction rules are now added as Safe Introduction rules
10946 * the syntax "if P then x else y" is now available in addition to
10950 *** Internal programming interfaces ***
10952 * tuned simplifier trace output; new flag debug_simp;
10954 * structures Vartab / Termtab (instances of TableFun) offer efficient
10955 tables indexed by indexname_ord / term_ord (compatible with aconv);
10957 * AxClass.axclass_tac lost the theory argument;
10959 * tuned current_goals_markers semantics: begin / end goal avoids
10960 printing empty lines;
10962 * removed prs and prs_fn hook, which was broken because it did not
10963 include \n in its semantics, forcing writeln to add one
10964 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10965 string -> unit if you really want to output text without newline;
10967 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10968 plain output, interface builders may have to enable 'isabelle_font'
10969 mode to get Isabelle font glyphs as before;
10971 * refined token_translation interface; INCOMPATIBILITY: output length
10972 now of type real instead of int;
10974 * theory loader actions may be traced via new ThyInfo.add_hook
10975 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10976 your own database of information attached to *whole* theories -- as
10977 opposed to intra-theory data slots offered via TheoryDataFun;
10979 * proper handling of dangling sort hypotheses (at last!);
10980 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10981 extra sort hypotheses that can be witnessed from the type signature;
10982 the force_strip_shyps flag is gone, any remaining shyps are simply
10983 left in the theorem (with a warning issued by strip_shyps_warning);
10987 New in Isabelle98-1 (October 1998)
10988 ----------------------------------
10990 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10992 * several changes of automated proof tools;
10994 * HOL: major changes to the inductive and datatype packages, including
10995 some minor incompatibilities of theory syntax;
10997 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
11000 * HOL: removed duplicate thms in Arith:
11001 less_imp_add_less should be replaced by trans_less_add1
11002 le_imp_add_le should be replaced by trans_le_add1
11004 * HOL: unary minus is now overloaded (new type constraints may be
11007 * HOL and ZF: unary minus for integers is now #- instead of #~. In
11008 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
11009 now taken as an integer constant.
11011 * Pure: ML function 'theory_of' renamed to 'theory';
11014 *** Proof tools ***
11017 1. Asm_full_simp_tac is now more aggressive.
11018 1. It will sometimes reorient premises if that increases their power to
11020 2. It does no longer proceed strictly from left to right but may also
11021 rotate premises to achieve further simplification.
11022 For compatibility reasons there is now Asm_lr_simp_tac which is like the
11023 old Asm_full_simp_tac in that it does not rotate premises.
11024 2. The simplifier now knows a little bit about nat-arithmetic.
11026 * Classical reasoner: wrapper mechanism for the classical reasoner now
11027 allows for selected deletion of wrappers, by introduction of names for
11028 wrapper functionals. This implies that addbefore, addSbefore,
11029 addaltern, and addSaltern now take a pair (name, tactic) as argument,
11030 and that adding two tactics with the same name overwrites the first
11031 one (emitting a warning).
11032 type wrapper = (int -> tactic) -> (int -> tactic)
11033 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
11034 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
11035 delWrapper, delSWrapper: claset * string -> claset
11036 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
11038 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
11039 semantics; addbefore now affects only the unsafe part of step_tac
11040 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
11041 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
11044 * Classical reasoner: setwrapper to setWrapper and compwrapper to
11045 compWrapper; added safe wrapper (and access functions for it);
11047 * HOL/split_all_tac is now much faster and fails if there is nothing
11048 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
11049 and the names of the automatically generated variables have changed.
11050 split_all_tac has moved within claset() from unsafe wrappers to safe
11051 wrappers, which means that !!-bound variables are split much more
11052 aggressively, and safe_tac and clarify_tac now split such variables.
11053 If this splitting is not appropriate, use delSWrapper "split_all_tac".
11054 Note: the same holds for record_split_tac, which does the job of
11055 split_all_tac for record fields.
11057 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
11058 permanently to the default simpset using Addsplits just like
11059 Addsimps. They can be removed via Delsplits just like
11060 Delsimps. Lower-case versions are also available.
11062 * HOL/Simplifier: The rule split_if is now part of the default
11063 simpset. This means that the simplifier will eliminate all occurrences
11064 of if-then-else in the conclusion of a goal. To prevent this, you can
11065 either remove split_if completely from the default simpset by
11066 `Delsplits [split_if]' or remove it in a specific call of the
11067 simplifier using `... delsplits [split_if]'. You can also add/delete
11068 other case splitting rules to/from the default simpset: every datatype
11069 generates suitable rules `split_t_case' and `split_t_case_asm' (where
11070 t is the name of the datatype).
11072 * Classical reasoner / Simplifier combination: new force_tac (and
11073 derivatives Force_tac, force) combines rewriting and classical
11074 reasoning (and whatever other tools) similarly to auto_tac, but is
11075 aimed to solve the given subgoal completely.
11080 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11081 and `goalw': the theory is no longer needed as an explicit argument -
11082 the current theory context is used; assumptions are no longer returned
11083 at the ML-level unless one of them starts with ==> or !!; it is
11084 recommended to convert to these new commands using isatool fixgoal
11085 (backup your sources first!);
11087 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11088 the current theory context, and 'theory' to lookup stored theories;
11090 * new theory section 'locale' for declaring constants, assumptions and
11091 definitions that have local scope;
11093 * new theory section 'nonterminals' for purely syntactic types;
11095 * new theory section 'setup' for generic ML setup functions
11096 (e.g. package initialization);
11098 * the distribution now includes Isabelle icons: see
11099 lib/logo/isabelle-{small,tiny}.xpm;
11101 * isatool install - install binaries with absolute references to
11104 * isatool logo -- create instances of the Isabelle logo (as EPS);
11106 * print mode 'emacs' reserved for Isamode;
11108 * support multiple print (ast) translations per constant name;
11110 * theorems involving oracles are now printed with a suffixed [!];
11115 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11117 * HOL/inductive package reorganized and improved: now supports mutual
11118 definitions such as
11123 oddI "n : EVEN ==> Suc n : ODD"
11124 evenI "n : ODD ==> Suc n : EVEN"
11126 new theorem list "elims" contains an elimination rule for each of the
11127 recursive sets; inductive definitions now handle disjunctive premises
11128 correctly (also ZF);
11130 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11131 "mutual_induct" no longer exists - the induction rule is always
11132 contained in "induct";
11135 * HOL/datatype package re-implemented and greatly improved: now
11136 supports mutually recursive datatypes such as
11139 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11140 | SUM ('a aexp) ('a aexp)
11141 | DIFF ('a aexp) ('a aexp)
11144 'a bexp = LESS ('a aexp) ('a aexp)
11145 | AND ('a bexp) ('a bexp)
11146 | OR ('a bexp) ('a bexp)
11148 as well as indirectly recursive datatypes such as
11151 ('a, 'b) term = Var 'a
11152 | App 'b ((('a, 'b) term) list)
11154 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11155 induction on mutually / indirectly recursive datatypes.
11157 Primrec equations are now stored in theory and can be accessed via
11158 <function_name>.simps.
11162 - Theories using datatypes must now have theory Datatype as an
11164 - The specific <typename>.induct_tac no longer exists - use the
11165 generic induct_tac instead.
11166 - natE has been renamed to nat.exhaust - use exhaust_tac
11167 instead of res_inst_tac ... natE. Note that the variable
11168 names in nat.exhaust differ from the names in natE, this
11169 may cause some "fragile" proofs to fail.
11170 - The theorems split_<typename>_case and split_<typename>_case_asm
11171 have been renamed to <typename>.split and <typename>.split_asm.
11172 - Since default sorts of type variables are now handled correctly,
11173 some datatype definitions may have to be annotated with explicit
11175 - Primrec definitions no longer require function name and type
11176 of recursive argument.
11178 Consider using isatool fixdatatype to adapt your theories and proof
11179 scripts to the new package (backup your sources first!).
11182 * HOL/record package: considerably improved implementation; now
11183 includes concrete syntax for record types, terms, updates; theorems
11184 for surjective pairing and splitting !!-bound record variables; proof
11185 support is as follows:
11187 1) standard conversions (selectors or updates applied to record
11188 constructor terms) are part of the standard simpset;
11190 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11191 made part of standard simpset and claset via addIffs;
11193 3) a tactic for record field splitting (record_split_tac) is part of
11194 the standard claset (addSWrapper);
11196 To get a better idea about these rules you may retrieve them via
11197 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11198 the name of your record type.
11200 The split tactic 3) conceptually simplifies by the following rule:
11202 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11204 Thus any record variable that is bound by meta-all will automatically
11205 blow up into some record constructor term, consequently the
11206 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11207 solve record problems automatically.
11210 * reorganized the main HOL image: HOL/Integ and String loaded by
11211 default; theory Main includes everything;
11213 * automatic simplification of integer sums and comparisons, using cancellation;
11215 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11217 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11219 * many new identities for unions, intersections, set difference, etc.;
11221 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11222 called split_if, split_split, split_sum_case and split_nat_case (to go
11223 with add/delsplits);
11225 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11226 (?x::unit) = (); this is made part of the default simpset, which COULD
11227 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11228 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11229 unit_abs_eta_conv is added in order to counter the effect of
11230 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11233 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11236 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11237 It and 'sym RS equals0D' are now in the default claset, giving automatic
11238 disjointness reasoning but breaking a few old proofs.
11240 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11241 to 'converse' from 'inverse' (for compatibility with ZF and some
11244 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11245 the well-founded relation;
11247 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11248 Compl A. The "Compl" syntax remains available as input syntax for this
11251 * HOL/Update: new theory of function updates:
11252 f(a:=b) == %x. if x=a then b else f x
11253 may also be iterated as in f(a:=b,c:=d,...);
11255 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11258 - new function list_update written xs[i:=v] that updates the i-th
11259 list position. May also be iterated as in xs[i:=a,j:=b,...].
11260 - new function `upt' written [i..j(] which generates the list
11261 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11262 bound write [i..j], which is a shorthand for [i..j+1(].
11263 - new lexicographic orderings and corresponding wellfoundedness theorems.
11266 - removed 'pred' (predecessor) function;
11267 - generalized some theorems about n-1;
11268 - many new laws about "div" and "mod";
11269 - new laws about greatest common divisors (see theory ex/Primes);
11271 * HOL/Relation: renamed the relational operator r^-1 "converse"
11272 instead of "inverse";
11274 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11275 of the multiset ordering;
11277 * directory HOL/Real: a construction of the reals using Dedekind cuts
11278 (not included by default);
11280 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11282 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11283 programs, i.e. different program variables may have different types.
11285 * calling (stac rew i) now fails if "rew" has no effect on the goal
11286 [previously, this check worked only if the rewrite rule was unconditional]
11287 Now rew can involve either definitions or equalities (either == or =).
11292 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11293 only the theorems proved on ZF.ML;
11295 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11296 It and 'sym RS equals0D' are now in the default claset, giving automatic
11297 disjointness reasoning but breaking a few old proofs.
11299 * ZF/Update: new theory of function updates
11300 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11301 may also be iterated as in f(a:=b,c:=d,...);
11303 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11305 * calling (stac rew i) now fails if "rew" has no effect on the goal
11306 [previously, this check worked only if the rewrite rule was unconditional]
11307 Now rew can involve either definitions or equalities (either == or =).
11309 * case_tac provided for compatibility with HOL
11310 (like the old excluded_middle_tac, but with subgoals swapped)
11313 *** Internal programming interfaces ***
11315 * Pure: several new basic modules made available for general use, see
11316 also src/Pure/README;
11318 * improved the theory data mechanism to support encapsulation (data
11319 kind name replaced by private Object.kind, acting as authorization
11320 key); new type-safe user interface via functor TheoryDataFun; generic
11321 print_data function becomes basically useless;
11323 * removed global_names compatibility flag -- all theory declarations
11324 are qualified by default;
11326 * module Pure/Syntax now offers quote / antiquote translation
11327 functions (useful for Hoare logic etc. with implicit dependencies);
11328 see HOL/ex/Antiquote for an example use;
11330 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11333 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11336 * Display.print_goals function moved to Locale.print_goals;
11338 * standard print function for goals supports current_goals_markers
11339 variable for marking begin of proof, end of proof, start of goal; the
11340 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11341 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11346 New in Isabelle98 (January 1998)
11347 --------------------------------
11349 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11351 * changed lexical syntax of terms / types: dots made part of long
11352 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11354 * simpset (and claset) reference variable replaced by functions
11355 simpset / simpset_ref;
11357 * no longer supports theory aliases (via merge) and non-trivial
11358 implicit merge of thms' signatures;
11360 * most internal names of constants changed due to qualified names;
11362 * changed Pure/Sequence interface (see Pure/seq.ML);
11365 *** General Changes ***
11367 * hierachically structured name spaces (for consts, types, axms, thms
11368 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11369 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11370 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11371 long_names for fully qualified output names; NOTE: ML programs
11372 (special tactics, packages etc.) referring to internal names may have
11373 to be adapted to cope with fully qualified names; in case of severe
11374 backward campatibility problems try setting 'global_names' at compile
11375 time to have enrything declared within a flat name space; one may also
11376 fine tune name declarations in theories via the 'global' and 'local'
11379 * reimplemented the implicit simpset and claset using the new anytype
11380 data filed in signatures; references simpset:simpset ref etc. are
11381 replaced by functions simpset:unit->simpset and
11382 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11383 to patch your ML files accordingly;
11385 * HTML output now includes theory graph data for display with Java
11386 applet or isatool browser; data generated automatically via isatool
11387 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11389 * defs may now be conditional; improved rewrite_goals_tac to handle
11390 conditional equations;
11392 * defs now admits additional type arguments, using TYPE('a) syntax;
11394 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11395 creates a new theory node; implicit merge of thms' signatures is
11396 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11397 transfer:theory->thm->thm in (rare) cases;
11399 * improved handling of draft signatures / theories; draft thms (and
11400 ctyps, cterms) are automatically promoted to real ones;
11402 * slightly changed interfaces for oracles: admit many per theory, named
11403 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11405 * print_goals: optional output of const types (set show_consts and
11408 * improved output of warnings (###) and errors (***);
11410 * subgoal_tac displays a warning if the new subgoal has type variables;
11412 * removed old README and Makefiles;
11414 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11416 * removed obsolete init_pps and init_database;
11418 * deleted the obsolete tactical STATE, which was declared by
11419 fun STATE tacfun st = tacfun st st;
11421 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11422 (which abbreviates $HOME);
11424 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11425 use isatool fixseq to adapt your ML programs (this works for fully
11426 qualified references to the Sequence structure only!);
11428 * use_thy no longer requires writable current directory; it always
11429 reloads .ML *and* .thy file, if either one is out of date;
11432 *** Classical Reasoner ***
11434 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11435 tactics that use classical reasoning to simplify a subgoal without
11436 splitting it into several subgoals;
11438 * Safe_tac: like safe_tac but uses the default claset;
11443 * added simplification meta rules:
11444 (asm_)(full_)simplify: simpset -> thm -> thm;
11446 * simplifier.ML no longer part of Pure -- has to be loaded by object
11449 * added prems argument to simplification procedures;
11451 * HOL, FOL, ZF: added infix function `addsplits':
11452 instead of `<simpset> setloop (split_tac <thms>)'
11453 you can simply write `<simpset> addsplits <thms>'
11458 * TYPE('a) syntax for type reflection terms;
11460 * no longer handles consts with name "" -- declare as 'syntax' instead;
11462 * pretty printer: changed order of mixfix annotation preference (again!);
11464 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11469 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11470 with `addloop' of the simplifier to faciliate case splitting in premises.
11472 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11474 * HOL/Auth: new protocol proofs including some for the Internet
11477 * HOL/Map: new theory of `maps' a la VDM;
11479 * HOL/simplifier: simplification procedures nat_cancel_sums for
11480 cancelling out common nat summands from =, <, <= (in)equalities, or
11481 differences; simplification procedures nat_cancel_factor for
11482 cancelling common factor from =, <, <= (in)equalities over natural
11483 sums; nat_cancel contains both kinds of procedures, it is installed by
11484 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11486 * HOL/simplifier: terms of the form
11487 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11489 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11490 and those of the form
11491 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11493 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11496 Each datatype `t' now comes with a theorem `split_t_case' of the form
11498 P(t_case f1 ... fn x) =
11499 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11501 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11504 and a theorem `split_t_case_asm' of the form
11506 P(t_case f1 ... fn x) =
11507 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11509 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11511 which can be added to a simpset via `addsplits'. The existing theorems
11512 expand_list_case and expand_option_case have been renamed to
11513 split_list_case and split_option_case.
11516 - `pred n' is automatically converted to `n-1'.
11517 Users are strongly encouraged not to use `pred' any longer,
11518 because it will disappear altogether at some point.
11519 - Users are strongly encouraged to write "0 < n" rather than
11520 "n ~= 0". Theorems and proof tools have been modified towards this
11524 the function "set_of_list" has been renamed "set" (and its theorems too);
11525 the function "nth" now takes its arguments in the reverse order and
11526 has acquired the infix notation "!" as in "xs!n".
11528 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11530 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11531 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11533 * HOL/record: extensible records with schematic structural subtyping
11534 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11535 still lacks various theorems and concrete record syntax;
11540 * removed "axioms" and "generated by" sections;
11542 * replaced "ops" section by extended "consts" section, which is capable of
11543 handling the continuous function space "->" directly;
11546 . proves theorems immediately and stores them in the theory,
11547 . creates hierachical name space,
11548 . now uses normal mixfix annotations (instead of cinfix...),
11549 . minor changes to some names and values (for consistency),
11550 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11551 . separator between mutual domain defs: changed "," to "and",
11552 . improved handling of sort constraints; now they have to
11553 appear on the left-hand side of the equations only;
11555 * fixed LAM <x,y,zs>.b syntax;
11557 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11558 adm (%x. P (t x)), where P is chainfinite and t continuous;
11563 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11564 with `addloop' of the simplifier to faciliate case splitting in premises.
11566 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11567 in HOL, they strip ALL and --> from proved theorems;
11571 New in Isabelle94-8 (May 1997)
11572 ------------------------------
11574 *** General Changes ***
11576 * new utilities to build / run / maintain Isabelle etc. (in parts
11577 still somewhat experimental); old Makefiles etc. still functional;
11579 * new 'Isabelle System Manual';
11581 * INSTALL text, together with ./configure and ./build scripts;
11583 * reimplemented type inference for greater efficiency, better error
11584 messages and clean internal interface;
11586 * prlim command for dealing with lots of subgoals (an easier way of
11587 setting goals_limit);
11592 * supports alternative (named) syntax tables (parser and pretty
11593 printer); internal interface is provided by add_modesyntax(_i);
11595 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11596 be used in conjunction with the Isabelle symbol font; uses the
11597 "symbols" syntax table;
11599 * added token_translation interface (may translate name tokens in
11600 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11601 the current print_mode); IMPORTANT: user print translation functions
11602 are responsible for marking newly introduced bounds
11603 (Syntax.mark_boundT);
11605 * token translations for modes "xterm" and "xterm_color" that display
11606 names in bold, underline etc. or colors (which requires a color
11609 * infixes may now be declared with names independent of their syntax;
11611 * added typed_print_translation (like print_translation, but may
11612 access type of constant);
11615 *** Classical Reasoner ***
11617 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11618 some limitations. Blast_tac...
11619 + ignores addss, addbefore, addafter; this restriction is intrinsic
11620 + ignores elimination rules that don't have the correct format
11621 (the conclusion MUST be a formula variable)
11622 + ignores types, which can make HOL proofs fail
11623 + rules must not require higher-order unification, e.g. apply_type in ZF
11624 [message "Function Var's argument not a bound variable" relates to this]
11625 + its proof strategy is more general but can actually be slower
11627 * substitution with equality assumptions no longer permutes other
11630 * minor changes in semantics of addafter (now called addaltern); renamed
11631 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11632 (and access functions for it);
11634 * improved combination of classical reasoner and simplifier:
11635 + functions for handling clasimpsets
11636 + improvement of addss: now the simplifier is called _after_ the
11638 + safe variant of addss called addSss: uses safe simplifications
11639 _during_ the safe steps. It is more complete as it allows multiple
11640 instantiations of unknowns (e.g. with slow_tac).
11644 * added interface for simplification procedures (functions that
11645 produce *proven* rewrite rules on the fly, depending on current
11648 * ordering on terms as parameter (used for ordered rewriting);
11650 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11652 * the solver is now split into a safe and an unsafe part.
11653 This should be invisible for the normal user, except that the
11654 functions setsolver and addsolver have been renamed to setSolver and
11655 addSolver; added safe_asm_full_simp_tac;
11660 * a generic induction tactic `induct_tac' which works for all datatypes and
11661 also for type `nat';
11663 * a generic case distinction tactic `exhaust_tac' which works for all
11664 datatypes and also for type `nat';
11666 * each datatype comes with a function `size';
11668 * patterns in case expressions allow tuple patterns as arguments to
11669 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11671 * primrec now also works with type nat;
11673 * recdef: a new declaration form, allows general recursive functions to be
11674 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11676 * the constant for negation has been renamed from "not" to "Not" to
11677 harmonize with FOL, ZF, LK, etc.;
11679 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11682 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11684 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11685 problems in commutative rings, using axiomatic type classes for + and *;
11687 * more examples in HOL/MiniML and HOL/Auth;
11689 * more default rewrite rules for quantifiers, union/intersection;
11691 * a new constant `arbitrary == @x.False';
11693 * HOLCF/IOA replaces old HOL/IOA;
11695 * HOLCF changes: derived all rules and arities
11696 + axiomatic type classes instead of classes
11697 + typedef instead of faking type definitions
11698 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11699 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11700 + eliminated the types void, one, tr
11701 + use unit lift and bool lift (with translations) instead of one and tr
11702 + eliminated blift from Lift3.thy (use Def instead of blift)
11703 all eliminated rules are derived as theorems --> no visible changes ;
11708 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11709 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11710 as ZF_cs addSIs [equalityI];
11714 New in Isabelle94-7 (November 96)
11715 ---------------------------------
11717 * allowing negative levels (as offsets) in prlev and choplev;
11719 * super-linear speedup for large simplifications;
11721 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11722 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11723 FAIL); can suppress it using the command Delsimps (ex_simps @
11724 all_simps); De Morgan laws are also now included, by default;
11726 * improved printing of ==> : ~:
11728 * new object-logic "Sequents" adds linear logic, while replacing LK
11729 and Modal (thanks to Sara Kalvala);
11731 * HOL/Auth: correctness proofs for authentication protocols;
11733 * HOL: new auto_tac combines rewriting and classical reasoning (many
11734 examples on HOL/Auth);
11736 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11737 the rewriter and classical reasoner simultaneously;
11739 * function uresult no longer returns theorems in "standard" format;
11740 regain previous version by: val uresult = standard o uresult;
11744 New in Isabelle94-6
11745 -------------------
11747 * oracles -- these establish an interface between Isabelle and trusted
11748 external reasoners, which may deliver results as theorems;
11750 * proof objects (in particular record all uses of oracles);
11752 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11754 * "constdefs" section in theory files;
11756 * "primrec" section (HOL) no longer requires names;
11758 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11762 New in Isabelle94-5
11763 -------------------
11765 * reduced space requirements;
11767 * automatic HTML generation from theories;
11769 * theory files no longer require "..." (quotes) around most types;
11771 * new examples, including two proofs of the Church-Rosser theorem;
11773 * non-curried (1994) version of HOL is no longer distributed;
11777 New in Isabelle94-4
11778 -------------------
11780 * greatly reduced space requirements;
11782 * theory files (.thy) no longer require \...\ escapes at line breaks;
11784 * searchable theorem database (see the section "Retrieving theorems" on
11785 page 8 of the Reference Manual);
11787 * new examples, including Grabczewski's monumental case study of the
11790 * The previous version of HOL renamed to Old_HOL;
11792 * The new version of HOL (previously called CHOL) uses a curried syntax
11793 for functions. Application looks like f a b instead of f(a,b);
11795 * Mutually recursive inductive definitions finally work in HOL;
11797 * In ZF, pattern-matching on tuples is now available in all abstractions and
11798 translates to the operator "split";
11802 New in Isabelle94-3
11803 -------------------
11805 * new infix operator, addss, allowing the classical reasoner to
11806 perform simplification at each step of its search. Example:
11807 fast_tac (cs addss ss)
11809 * a new logic, CHOL, the same as HOL, but with a curried syntax
11810 for functions. Application looks like f a b instead of f(a,b). Also pairs
11811 look like (a,b) instead of <a,b>;
11813 * PLEASE NOTE: CHOL will eventually replace HOL!
11815 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11816 It translates to the operator "split". A new theory of integers is available;
11818 * In ZF, integer numerals now denote two's-complement binary integers.
11819 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11821 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11822 of the Axiom of Choice;
11826 New in Isabelle94-2
11827 -------------------
11829 * Significantly faster resolution;
11831 * the different sections in a .thy file can now be mixed and repeated
11834 * Database of theorems for FOL, HOL and ZF. New
11835 commands including qed, qed_goal and bind_thm store theorems in the database.
11837 * Simple database queries: return a named theorem (get_thm) or all theorems of
11838 a given theory (thms_of), or find out what theory a theorem was proved in
11841 * Bugs fixed in the inductive definition and datatype packages;
11843 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11844 and HOL_dup_cs obsolete;
11846 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11849 * Simpler definition of function space in ZF;
11851 * new results about cardinal and ordinal arithmetic in ZF;
11853 * 'subtype' facility in HOL for introducing new types as subsets of existing
11856 :mode=isabelle-news:wrap=hard:maxLineLen=72: