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 Console/Scala plugin: more uniform scala.Console output,
118 more robust treatment of threads and interrupts.
120 * Improved management of dockable windows: clarified keyboard focus
121 and window placement wrt. main editor view; optional menu item to
122 "Detach" a copy where this makes sense.
124 * New Simplifier Trace panel provides an interactive view of the
125 simplification process, enabled by the "simp_trace_new" attribute
131 * Low-level type-class commands 'classes', 'classrel', 'arities' have
132 been discontinued to avoid the danger of non-trivial axiomatization
133 that is not immediately visible. INCOMPATIBILITY, use regular
134 'instance' command with proof. The required OFCLASS(...) theorem
135 might be postulated via 'axiomatization' beforehand, or the proof
136 finished trivially if the underlying class definition is made vacuous
137 (without any assumptions). See also Isabelle/ML operations
138 Axclass.class_axiomatization, Axclass.classrel_axiomatization,
139 Axclass.arity_axiomatization.
141 * Basic constants of Pure use more conventional names and are always
142 qualified. Rare INCOMPATIBILITY, but with potentially serious
143 consequences, notably for tools in Isabelle/ML. The following
144 renaming needs to be applied:
150 dummy_pattern ~> Pure.dummy_pattern
152 Systematic porting works by using the following theory setup on a
153 *previous* Isabelle version to introduce the new name accesses for the
159 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
160 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
161 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
162 |> Sign.restore_naming thy
165 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
166 Later the application is moved to the current Isabelle version, and
167 the auxiliary aliases are deleted.
169 * Attributes "where" and "of" allow an optional context of local
170 variables ('for' declaration): these variables become schematic in the
171 instantiated theorem.
173 * Obsolete attribute "standard" has been discontinued (legacy since
174 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
175 where instantiations with schematic variables are intended (for
176 declaration commands like 'lemmas' or attributes like "of"). The
177 following temporary definition may help to port old applications:
179 attribute_setup standard =
180 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
182 * More thorough check of proof context for goal statements and
183 attributed fact expressions (concerning background theory, declared
184 hyps). Potential INCOMPATIBILITY, tools need to observe standard
185 context discipline. See also Assumption.add_assumes and the more
186 primitive Thm.assume_hyps.
188 * Inner syntax token language allows regular quoted strings "..."
189 (only makes sense in practice, if outer syntax is delimited
190 differently, e.g. via cartouches).
192 * Command 'print_term_bindings' supersedes 'print_binds' for clarity,
193 but the latter is retained some time as Proof General legacy.
195 * Code generator preprocessor: explicit control of simp tracing on a
196 per-constant basis. See attribute "code_preproc".
201 * Code generator: enforce case of identifiers only for strict target
202 language requirements. INCOMPATIBILITY.
204 * Code generator: explicit proof contexts in many ML interfaces.
207 * Code generator: minimize exported identifiers by default. Minor
210 * Code generation for SML and OCaml: dropped arcane "no_signatures"
211 option. Minor INCOMPATIBILITY.
213 * "declare [[code abort: ...]]" replaces "code_abort ...".
216 * "declare [[code drop: ...]]" drops all code equations associated
217 with the given constants.
219 * Code generations are provided for make, fields, extend and truncate
220 operations on records.
222 * Command and antiquotation "value" are now hardcoded against nbe and
223 ML. Minor INCOMPATIBILITY.
225 * Renamed command 'enriched_type' to 'functor'. INCOMPATIBILITY.
227 * The symbol "\<newline>" may be used within char or string literals
228 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
230 * Qualified String.implode and String.explode. INCOMPATIBILITY.
232 * Simplifier: Enhanced solver of preconditions of rewrite rules can
233 now deal with conjunctions. For help with converting proofs, the old
234 behaviour of the simplifier can be restored like this: declare/using
235 [[simp_legacy_precond]]. This configuration option will disappear
236 again in the future. INCOMPATIBILITY.
238 * Simproc "finite_Collect" is no longer enabled by default, due to
239 spurious crashes and other surprises. Potential INCOMPATIBILITY.
241 * Moved new (co)datatype package and its dependencies from session
242 "HOL-BNF" to "HOL". The commands 'bnf', 'wrap_free_constructors',
243 'datatype_new', 'codatatype', 'primcorec', 'primcorecursive' are now
244 part of theory "Main".
247 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
248 Library/Wfrec.thy ~> Wfrec.thy
249 Library/Zorn.thy ~> Zorn.thy
250 Cardinals/Order_Relation.thy ~> Order_Relation.thy
251 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
252 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
253 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
254 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
255 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
256 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
257 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
258 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
259 BNF/BNF_Comp.thy ~> BNF_Comp.thy
260 BNF/BNF_Def.thy ~> BNF_Def.thy
261 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
262 BNF/BNF_GFP.thy ~> BNF_GFP.thy
263 BNF/BNF_LFP.thy ~> BNF_LFP.thy
264 BNF/BNF_Util.thy ~> BNF_Util.thy
265 BNF/Coinduction.thy ~> Coinduction.thy
266 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
267 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
268 BNF/Examples/* ~> BNF_Examples/*
271 Wellorder_Extension.thy (split from Zorn.thy)
272 Library/Cardinal_Notations.thy
273 Library/BNF_Axomatization.thy
274 BNF_Examples/Misc_Primcorec.thy
275 BNF_Examples/Stream_Processor.thy
277 Discontinued theories:
279 BNF/Equiv_Relations_More.thy
283 * New (co)datatype package:
284 - Command 'primcorec' is fully implemented.
285 - Command 'datatype_new' generates size functions ("size_xxx" and
286 "size") as required by 'fun'.
287 - BNFs are integrated with the Lifting tool and new-style
288 (co)datatypes with Transfer.
290 datatype_new_compat ~> datatype_compat
291 primrec_new ~> primrec
292 wrap_free_constructors ~> free_constructors
294 - The generated constants "xxx_case" and "xxx_rec" have been renamed
295 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
297 - The constant "xxx_(un)fold" and related theorems are no longer
298 generated. Use "xxx_(co)rec" or define "xxx_(un)fold" manually
301 - No discriminators are generated for nullary constructors by
302 default, eliminating the need for the odd "=:" syntax.
304 - No discriminators or selectors are generated by default by
305 "datatype_new", unless custom names are specified or the new
306 "discs_sels" option is passed.
309 * Old datatype package:
310 - The generated theorems "xxx.cases" and "xxx.recs" have been
311 renamed "xxx.case" and "xxx.rec" (e.g., "sum.cases" ->
312 "sum.case"). INCOMPATIBILITY.
313 - The generated constants "xxx_case", "xxx_rec", and "xxx_size" have
314 been renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g.,
315 "prod_case" ~> "case_prod"). INCOMPATIBILITY.
317 * The types "'a list" and "'a option", their set and map functions,
318 their relators, and their selectors are now produced using the new
319 BNF-based datatype package.
322 Option.set ~> set_option
323 Option.map ~> map_option
324 option_rel ~> rel_option
327 set_def ~> set_rec[abs_def]
328 map_def ~> map_rec[abs_def]
329 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
330 option.recs ~> option.rec
331 list_all2_def ~> list_all2_iff
332 set.simps ~> set_simps (or the slightly different "list.set")
333 map.simps ~> list.map
334 hd.simps ~> list.sel(1)
335 tl.simps ~> list.sel(2-3)
336 the.simps ~> option.sel
340 * The following map functions and relators have been renamed:
347 filter_rel ~> rel_filter
348 fset_rel ~> rel_fset (in "src/HOL/Library/FSet.thy")
349 cset_rel ~> rel_cset (in "src/HOL/Library/Countable_Set_Type.thy")
350 vset ~> rel_vset (in "src/HOL/Library/Quotient_Set.thy")
354 * Lifting and Transfer:
355 - a type variable as a raw type is supported
356 - stronger reflexivity prover
357 - rep_eq is always generated by lift_definition
358 - setup for Lifting/Transfer is now automated for BNFs
359 + holds for BNFs that do not contain a dead variable
360 + relator_eq, relator_mono, relator_distr, relator_domain,
361 relator_eq_onp, quot_map, transfer rules for bi_unique, bi_total,
362 right_unique, right_total, left_unique, left_total are proved
364 + definition of a predicator is generated automatically
365 + simplification rules for a predicator definition are proved
366 automatically for datatypes
367 - consolidation of the setup of Lifting/Transfer
368 + property that a relator preservers reflexivity is not needed any
370 Minor INCOMPATIBILITY.
371 + left_total and left_unique rules are now transfer rules
372 (reflexivity_rule attribute not needed anymore)
374 + Domainp does not have to be a separate assumption in
375 relator_domain theorems (=> more natural statement)
377 - registration of code equations is more robust
378 Potential INCOMPATIBILITY.
379 - respectfulness proof obligation is preprocessed to a more readable
381 Potential INCOMPATIBILITY.
382 - eq_onp is always unfolded in respectfulness proof obligation
383 Potential INCOMPATIBILITY.
384 - unregister lifting setup for Code_Numeral.integer and
386 Potential INCOMPATIBILITY.
387 - Lifting.invariant -> eq_onp
390 * New internal SAT solver "cdclite" that produces models and proof
391 traces. This solver replaces the internal SAT solvers "enumerate" and
392 "dpll". Applications that explicitly used one of these two SAT
393 solvers should use "cdclite" instead. In addition, "cdclite" is now
394 the default SAT solver for the "sat" and "satx" proof methods and
395 corresponding tactics; the old default can be restored using "declare
396 [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
398 * SMT module: A new version of the SMT module, temporarily called
399 "SMT2", uses SMT-LIB 2 and supports recent versions of Z3 (e.g.,
400 4.3). The new proof method is called "smt2". CVC3 and CVC4 are also
401 supported as oracles. Yices is no longer supported, because no version
402 of the solver can handle both SMT-LIB 2 and quantifiers.
404 * Activation of Z3 now works via "z3_non_commercial" system option
405 (without requiring restart), instead of former settings variable
406 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
407 Plugin Options / Isabelle / General.
410 - Z3 can now produce Isar proofs.
412 . New SML-based learning algorithms eliminate the dependency on
413 Python and increase performance and reliability.
414 . MaSh and MeSh are now used by default together with the
415 traditional MePo (Meng-Paulson) relevance filter. To disable
416 MaSh, set the "MaSh" system option in Isabelle/jEdit Plugin
417 Options / Isabelle / General to "none".
421 isar_compress ~> compress
426 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
429 - Fixed soundness bug whereby mutually recursive datatypes could
430 take infinite values.
431 - Fixed soundness bug with low-level number functions such as
432 "Abs_Integ" and "Rep_Integ".
433 - Removed "std" option.
434 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
437 * Metis: Removed legacy proof method 'metisFT'. Use 'metis
438 (full_types)' instead. INCOMPATIBILITY.
440 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
442 * Adjustion of INF and SUP operations:
443 - Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
444 - Consolidated theorem names containing INFI and SUPR: have INF and
445 SUP instead uniformly.
446 - More aggressive normalization of expressions involving INF and Inf
448 - INF_image and SUP_image do not unfold composition.
449 - Dropped facts INF_comp, SUP_comp.
450 - Default congruence rules strong_INF_cong and strong_SUP_cong, with
451 simplifier implication in premises. Generalize and replace former
456 * SUP and INF generalized to conditionally_complete_lattice.
458 * Swapped orientation of facts image_comp and vimage_comp:
460 image_compose ~> image_comp [symmetric]
461 image_comp ~> image_comp [symmetric]
462 vimage_compose ~> vimage_comp [symmetric]
463 vimage_comp ~> vimage_comp [symmetric]
467 * Theory reorganization: split of Big_Operators.thy into
468 Groups_Big.thy and Lattices_Big.thy.
470 * Consolidated some facts about big group operators:
472 setsum_0' ~> setsum.neutral
473 setsum_0 ~> setsum.neutral_const
474 setsum_addf ~> setsum.distrib
475 setsum_cartesian_product ~> setsum.cartesian_product
476 setsum_cases ~> setsum.If_cases
477 setsum_commute ~> setsum.commute
478 setsum_cong ~> setsum.cong
479 setsum_delta ~> setsum.delta
480 setsum_delta' ~> setsum.delta'
481 setsum_diff1' ~> setsum.remove
482 setsum_empty ~> setsum.empty
483 setsum_infinite ~> setsum.infinite
484 setsum_insert ~> setsum.insert
485 setsum_inter_restrict'' ~> setsum.inter_filter
486 setsum_mono_zero_cong_left ~> setsum.mono_neutral_cong_left
487 setsum_mono_zero_cong_right ~> setsum.mono_neutral_cong_right
488 setsum_mono_zero_left ~> setsum.mono_neutral_left
489 setsum_mono_zero_right ~> setsum.mono_neutral_right
490 setsum_reindex ~> setsum.reindex
491 setsum_reindex_cong ~> setsum.reindex_cong
492 setsum_reindex_nonzero ~> setsum.reindex_nontrivial
493 setsum_restrict_set ~> setsum.inter_restrict
494 setsum_Plus ~> setsum.Plus
495 setsum_setsum_restrict ~> setsum.commute_restrict
496 setsum_Sigma ~> setsum.Sigma
497 setsum_subset_diff ~> setsum.subset_diff
498 setsum_Un_disjoint ~> setsum.union_disjoint
499 setsum_UN_disjoint ~> setsum.UNION_disjoint
500 setsum_Un_Int ~> setsum.union_inter
501 setsum_Union_disjoint ~> setsum.Union_disjoint
502 setsum_UNION_zero ~> setsum.Union_comp
503 setsum_Un_zero ~> setsum.union_inter_neutral
504 strong_setprod_cong ~> setprod.strong_cong
505 strong_setsum_cong ~> setsum.strong_cong
506 setprod_1' ~> setprod.neutral
507 setprod_1 ~> setprod.neutral_const
508 setprod_cartesian_product ~> setprod.cartesian_product
509 setprod_cong ~> setprod.cong
510 setprod_delta ~> setprod.delta
511 setprod_delta' ~> setprod.delta'
512 setprod_empty ~> setprod.empty
513 setprod_infinite ~> setprod.infinite
514 setprod_insert ~> setprod.insert
515 setprod_mono_one_cong_left ~> setprod.mono_neutral_cong_left
516 setprod_mono_one_cong_right ~> setprod.mono_neutral_cong_right
517 setprod_mono_one_left ~> setprod.mono_neutral_left
518 setprod_mono_one_right ~> setprod.mono_neutral_right
519 setprod_reindex ~> setprod.reindex
520 setprod_reindex_cong ~> setprod.reindex_cong
521 setprod_reindex_nonzero ~> setprod.reindex_nontrivial
522 setprod_Sigma ~> setprod.Sigma
523 setprod_subset_diff ~> setprod.subset_diff
524 setprod_timesf ~> setprod.distrib
525 setprod_Un2 ~> setprod.union_diff2
526 setprod_Un_disjoint ~> setprod.union_disjoint
527 setprod_UN_disjoint ~> setprod.UNION_disjoint
528 setprod_Un_Int ~> setprod.union_inter
529 setprod_Union_disjoint ~> setprod.Union_disjoint
530 setprod_Un_one ~> setprod.union_inter_neutral
532 Dropped setsum_cong2 (simple variant of setsum.cong).
533 Dropped setsum_inter_restrict' (simple variant of setsum.inter_restrict)
534 Dropped setsum_reindex_id, setprod_reindex_id
535 (simple variants of setsum.reindex [symmetric], setprod.reindex [symmetric]).
539 * Abolished slightly odd global lattice interpretation for min/max.
542 min_max.inf_assoc ~> min.assoc
543 min_max.inf_commute ~> min.commute
544 min_max.inf_left_commute ~> min.left_commute
545 min_max.inf_idem ~> min.idem
546 min_max.inf_left_idem ~> min.left_idem
547 min_max.inf_right_idem ~> min.right_idem
548 min_max.sup_assoc ~> max.assoc
549 min_max.sup_commute ~> max.commute
550 min_max.sup_left_commute ~> max.left_commute
551 min_max.sup_idem ~> max.idem
552 min_max.sup_left_idem ~> max.left_idem
553 min_max.sup_inf_distrib1 ~> max_min_distrib2
554 min_max.sup_inf_distrib2 ~> max_min_distrib1
555 min_max.inf_sup_distrib1 ~> min_max_distrib2
556 min_max.inf_sup_distrib2 ~> min_max_distrib1
557 min_max.distrib ~> min_max_distribs
558 min_max.inf_absorb1 ~> min.absorb1
559 min_max.inf_absorb2 ~> min.absorb2
560 min_max.sup_absorb1 ~> max.absorb1
561 min_max.sup_absorb2 ~> max.absorb2
562 min_max.le_iff_inf ~> min.absorb_iff1
563 min_max.le_iff_sup ~> max.absorb_iff2
564 min_max.inf_le1 ~> min.cobounded1
565 min_max.inf_le2 ~> min.cobounded2
566 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
567 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
568 min_max.le_infI1 ~> min.coboundedI1
569 min_max.le_infI2 ~> min.coboundedI2
570 min_max.le_supI1 ~> max.coboundedI1
571 min_max.le_supI2 ~> max.coboundedI2
572 min_max.less_infI1 ~> min.strict_coboundedI1
573 min_max.less_infI2 ~> min.strict_coboundedI2
574 min_max.less_supI1 ~> max.strict_coboundedI1
575 min_max.less_supI2 ~> max.strict_coboundedI2
576 min_max.inf_mono ~> min.mono
577 min_max.sup_mono ~> max.mono
578 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
579 min_max.le_supI, min_max.sup_least ~> max.boundedI
580 min_max.le_inf_iff ~> min.bounded_iff
581 min_max.le_sup_iff ~> max.bounded_iff
583 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
584 min.left_commute, min.left_idem, max.commute, max.assoc,
585 max.left_commute, max.left_idem directly.
587 For min_max.inf_sup_ord, prefer (one of) min.cobounded1,
588 min.cobounded2, max.cobounded1m max.cobounded2 directly.
590 For min_ac or max_ac, prefer more general collection ac_simps.
594 * Theorem disambiguation Inf_le_Sup (on finite sets) ~>
595 Inf_fin_le_Sup_fin. INCOMPATIBILITY.
597 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
600 * Fact generalization and consolidation:
601 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
605 * Purely algebraic definition of even. Fact generalization and
607 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
608 even_zero_(nat|int) ~> even_zero
612 * Abolished neg_numeral.
613 - Canonical representation for minus one is "- 1".
614 - Canonical representation for other negative numbers is "- (numeral _)".
615 - When devising rule sets for number calculation, consider the
616 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
617 - HOLogic.dest_number also recognizes numerals in non-canonical forms
618 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
619 - Syntax for negative numerals is mere input syntax.
623 * Reduced name variants for rules on associativity and commutativity:
625 add_assoc ~> add.assoc
626 add_commute ~> add.commute
627 add_left_commute ~> add.left_commute
628 mult_assoc ~> mult.assoc
629 mult_commute ~> mult.commute
630 mult_left_commute ~> mult.left_commute
631 nat_add_assoc ~> add.assoc
632 nat_add_commute ~> add.commute
633 nat_add_left_commute ~> add.left_commute
634 nat_mult_assoc ~> mult.assoc
635 nat_mult_commute ~> mult.commute
636 eq_assoc ~> iff_assoc
637 eq_left_commute ~> iff_left_commute
641 * Fact collections add_ac and mult_ac are considered old-fashioned.
642 Prefer ac_simps instead, or specify rules
643 (add|mult).(assoc|commute|left_commute) individually.
645 * Elimination of fact duplicates:
646 equals_zero_I ~> minus_unique
647 diff_eq_0_iff_eq ~> right_minus_eq
648 nat_infinite ~> infinite_UNIV_nat
649 int_infinite ~> infinite_UNIV_int
653 * Fact name consolidation:
654 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
655 minus_le_self_iff ~> neg_less_eq_nonneg
656 le_minus_self_iff ~> less_eq_neg_nonpos
657 neg_less_nonneg ~> neg_less_pos
658 less_minus_self_iff ~> less_neg_neg [simp]
662 * More simplification rules on unary and binary minus:
663 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
664 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
665 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
666 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
667 minus_add_cancel, uminus_add_conv_diff. These correspondingly have
668 been taken away from fact collections algebra_simps and field_simps.
671 To restore proofs, the following patterns are helpful:
673 a) Arbitrary failing proof not involving "diff_def":
674 Consider simplification with algebra_simps or field_simps.
676 b) Lifting rules from addition to subtraction:
677 Try with "using <rule for addition> of [... "- _" ...]" by simp".
679 c) Simplification with "diff_def": just drop "diff_def".
680 Consider simplification with algebra_simps or field_simps;
681 or the brute way with
682 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
684 * Introduce bdd_above and bdd_below in theory
685 Conditionally_Complete_Lattices, use them instead of explicitly
686 stating boundedness of sets.
688 * ccpo.admissible quantifies only over non-empty chains to allow more
689 syntax-directed proof rules; the case of the empty chain shows up as
690 additional case in fixpoint induction proofs. INCOMPATIBILITY.
692 * Removed and renamed theorems in Series:
693 summable_le ~> suminf_le
694 suminf_le ~> suminf_le_const
695 series_pos_le ~> setsum_le_suminf
696 series_pos_less ~> setsum_less_suminf
697 suminf_ge_zero ~> suminf_nonneg
698 suminf_gt_zero ~> suminf_pos
699 suminf_gt_zero_iff ~> suminf_pos_iff
700 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
701 suminf_0_le ~> suminf_nonneg [rotate]
702 pos_summable ~> summableI_nonneg_bounded
703 ratio_test ~> summable_ratio_test
705 removed series_zero, replaced by sums_finite
707 removed auxiliary lemmas:
709 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
710 half, le_Suc_ex_iff, lemma_realpow_diff_sumr,
711 real_setsum_nat_ivl_bounded, summable_le2, ratio_test_lemma2,
712 sumr_minus_one_realpow_zerom, sumr_one_lb_realpow_zero,
713 summable_convergent_sumr_iff, sumr_diff_mult_const
717 * Replace (F)DERIV syntax by has_derivative:
718 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
720 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
722 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
724 - removed constant isDiff
726 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as
729 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed.
731 - Renamed FDERIV_... lemmas to has_derivative_...
733 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
735 - removed DERIV_intros, has_derivative_eq_intros
737 - introduced derivative_intros and deriative_eq_intros which
738 includes now rules for DERIV, has_derivative and
739 has_vector_derivative.
742 differentiable_def ~> real_differentiable_def
743 differentiableE ~> real_differentiableE
744 fderiv_def ~> has_derivative_at
745 field_fderiv_def ~> field_has_derivative_at
746 isDiff_der ~> differentiable_def
747 deriv_fderiv ~> has_field_derivative_def
748 deriv_def ~> DERIV_def
752 * Include more theorems in continuous_intros. Remove the
753 continuous_on_intros, isCont_intros collections, these facts are now
754 in continuous_intros.
756 * Theorems about complex numbers are now stated only using Re and Im,
757 the Complex constructor is not used anymore. It is possible to use
758 primcorec to defined the behaviour of a complex-valued function.
760 Removed theorems about the Complex constructor from the simpset, they
761 are available as the lemma collection legacy_Complex_simps. This
764 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
766 Instead the reverse direction is supported with
767 Complex_eq: "Complex a b = a + \<i> * b"
769 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
773 complex_Re/Im_zero ~> zero_complex.sel
774 complex_Re/Im_add ~> plus_complex.sel
775 complex_Re/Im_minus ~> uminus_complex.sel
776 complex_Re/Im_diff ~> minus_complex.sel
777 complex_Re/Im_one ~> one_complex.sel
778 complex_Re/Im_mult ~> times_complex.sel
779 complex_Re/Im_inverse ~> inverse_complex.sel
780 complex_Re/Im_scaleR ~> scaleR_complex.sel
781 complex_Re/Im_i ~> ii.sel
782 complex_Re/Im_cnj ~> cnj.sel
785 complex_divide_def ~> divide_complex_def
786 complex_norm_def ~> norm_complex_def
787 cmod_def ~> norm_complex_de
801 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
802 Conditionally_Complete_Lattices. INCOMPATIBILITY.
804 * HOL-Library: new theory src/HOL/Library/Tree.thy.
806 * HOL-Library: removed theory src/HOL/Library/Kleene_Algebra.thy; it
807 is subsumed by session Kleene_Algebra in AFP.
809 * HOL-Library / theory RBT: various constants and facts are hidden;
810 lifting setup is unregistered. INCOMPATIBILITY.
812 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
814 * HOL-Word: bit representations prefer type bool over type bit.
818 - Abandoned fact collection "word_arith_alts", which is a duplicate
820 - Dropped first (duplicated) element in fact collections
821 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
822 "uint_word_arith_bintrs".
825 - consolidated the proofs of the binomial theorem
826 - the function fib is again of type nat => nat and not overloaded
827 - no more references to Old_Number_Theory in the HOL libraries
832 * HOL-Multivariate_Analysis:
833 - Type class ordered_real_vector for ordered vector spaces.
834 - New theory Complex_Basic_Analysis defining complex derivatives,
835 holomorphic functions, etc., ported from HOL Light's canal.ml.
836 - Changed order of ordered_euclidean_space to be compatible with
837 pointwise ordering on products. Therefore instance of
838 conditionally_complete_lattice and ordered_real_vector.
839 INCOMPATIBILITY: use box instead of greaterThanLessThan or
840 explicit set-comprehensions with eucl_less for other (half-)open
842 - removed dependencies on type class ordered_euclidean_space with
843 introduction of "cbox" on euclidean_space
846 mem_interval ~> mem_box
847 interval_eq_empty ~> box_eq_empty
848 interval_ne_empty ~> box_ne_empty
849 interval_sing(1) ~> cbox_sing
850 interval_sing(2) ~> box_sing
851 subset_interval_imp ~> subset_box_imp
852 subset_interval ~> subset_box
853 open_interval ~> open_box
854 closed_interval ~> closed_cbox
855 interior_closed_interval ~> interior_cbox
856 bounded_closed_interval ~> bounded_cbox
857 compact_interval ~> compact_cbox
858 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
859 bounded_subset_closed_interval ~> bounded_subset_cbox
860 mem_interval_componentwiseI ~> mem_box_componentwiseI
861 convex_box ~> convex_prod
862 rel_interior_real_interval ~> rel_interior_real_box
863 convex_interval ~> convex_box
864 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
865 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
866 content_closed_interval' ~> content_cbox'
867 elementary_subset_interval ~> elementary_subset_box
868 diameter_closed_interval ~> diameter_cbox
869 frontier_closed_interval ~> frontier_cbox
870 frontier_open_interval ~> frontier_box
871 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
872 closure_open_interval ~> closure_box
873 open_closed_interval_convex ~> open_cbox_convex
874 open_interval_midpoint ~> box_midpoint
875 content_image_affinity_interval ~> content_image_affinity_cbox
876 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
877 bounded_interval ~> bounded_closed_interval + bounded_boxes
879 - respective theorems for intervals over the reals:
880 content_closed_interval + content_cbox
881 has_integral + has_integral_real
882 fine_division_exists + fine_division_exists_real
883 has_integral_null + has_integral_null_real
884 tagged_division_union_interval + tagged_division_union_interval_real
885 has_integral_const + has_integral_const_real
886 integral_const + integral_const_real
887 has_integral_bound + has_integral_bound_real
888 integrable_continuous + integrable_continuous_real
889 integrable_subinterval + integrable_subinterval_real
890 has_integral_reflect_lemma + has_integral_reflect_lemma_real
891 integrable_reflect + integrable_reflect_real
892 integral_reflect + integral_reflect_real
893 image_affinity_interval + image_affinity_cbox
894 image_smult_interval + image_smult_cbox
895 integrable_const + integrable_const_ivl
896 integrable_on_subinterval + integrable_on_subcbox
899 derivative_linear ~> has_derivative_bounded_linear
900 derivative_is_linear ~> has_derivative_linear
901 bounded_linear_imp_linear ~> bounded_linear.linear
904 - Renamed positive_integral to nn_integral:
906 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
907 positive_integral_positive ~> nn_integral_nonneg
909 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
911 - replaced the Lebesgue integral on real numbers by the more general
912 Bochner integral for functions into a real-normed vector space.
914 integral_zero ~> integral_zero / integrable_zero
915 integral_minus ~> integral_minus / integrable_minus
916 integral_add ~> integral_add / integrable_add
917 integral_diff ~> integral_diff / integrable_diff
918 integral_setsum ~> integral_setsum / integrable_setsum
919 integral_multc ~> integral_mult_left / integrable_mult_left
920 integral_cmult ~> integral_mult_right / integrable_mult_right
921 integral_triangle_inequality~> integral_norm_bound
922 integrable_nonneg ~> integrableI_nonneg
923 integral_positive ~> integral_nonneg_AE
924 integrable_abs_iff ~> integrable_abs_cancel
925 positive_integral_lim_INF ~> nn_integral_liminf
926 lebesgue_real_affine ~> lborel_real_affine
927 borel_integral_has_integral ~> has_integral_lebesgue_integral
928 integral_indicator ~>
929 integral_real_indicator / integrable_real_indicator
930 positive_integral_fst ~> nn_integral_fst'
931 positive_integral_fst_measurable ~> nn_integral_fst
932 positive_integral_snd_measurable ~> nn_integral_snd
934 integrable_fst_measurable ~>
935 integral_fst / integrable_fst / AE_integrable_fst
937 integrable_snd_measurable ~>
938 integral_snd / integrable_snd / AE_integrable_snd
940 integral_monotone_convergence ~>
941 integral_monotone_convergence / integrable_monotone_convergence
943 integral_monotone_convergence_at_top ~>
944 integral_monotone_convergence_at_top /
945 integrable_monotone_convergence_at_top
947 has_integral_iff_positive_integral_lebesgue ~>
948 has_integral_iff_has_bochner_integral_lebesgue_nonneg
950 lebesgue_integral_has_integral ~>
951 has_integral_integrable_lebesgue_nonneg
953 positive_integral_lebesgue_has_integral ~>
954 integral_has_integral_lebesgue_nonneg /
955 integrable_has_integral_lebesgue_nonneg
957 lebesgue_integral_real_affine ~>
958 nn_integral_real_affine
960 has_integral_iff_positive_integral_lborel ~>
961 integral_has_integral_nonneg / integrable_has_integral_nonneg
963 The following theorems where removed:
965 lebesgue_integral_nonneg
966 lebesgue_integral_uminus
967 lebesgue_integral_cmult
968 lebesgue_integral_multc
969 lebesgue_integral_cmult_nonneg
970 integral_cmul_indicator
973 - Formalized properties about exponentially, Erlang, and normal
974 distributed random variables.
976 * HOL-Decision_Procs: Separate command 'approximate' for approximative
977 computation in src/HOL/Decision_Procs/Approximation. Minor
983 * The signature and semantics of Document.Snapshot.cumulate_markup /
984 select_markup have been clarified. Markup is now traversed in the
985 order of reports given by the prover: later markup is usually more
986 specific and may override results accumulated so far. The elements
987 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
989 * Substantial reworking of internal PIDE protocol communication
990 channels. INCOMPATIBILITY.
995 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
996 compared (according to Thm.thm_ord), but assumed to be covered by the
997 current background theory. Thus equivalent data produced in different
998 branches of the theory graph usually coincides (e.g. relevant for
999 theory merge). Note that the softer Thm.eq_thm_prop is often more
1000 appropriate than Thm.eq_thm.
1002 * Proper context for basic Simplifier operations: rewrite_rule,
1003 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
1004 pass runtime Proof.context (and ensure that the simplified entity
1005 actually belongs to it).
1007 * Proper context discipline for read_instantiate and instantiate_tac:
1008 variables that are meant to become schematic need to be given as
1009 fixed, and are generalized by the explicit context of local variables.
1010 This corresponds to Isar attributes "where" and "of" with 'for'
1011 declaration. INCOMPATIBILITY, also due to potential change of indices
1012 of schematic variables.
1014 * Moved ML_Compiler.exn_trace and other operations on exceptions to
1015 structure Runtime. Minor INCOMPATIBILITY.
1017 * Discontinued old Toplevel.debug in favour of system option
1018 "ML_exception_trace", which may be also declared within the context
1019 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
1021 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
1024 * Configuration option "ML_print_depth" controls the pretty-printing
1025 depth of the ML compiler within the context. The old print_depth in
1026 ML is still available as default_print_depth, but rarely used. Minor
1029 * Toplevel function "use" refers to raw ML bootstrap environment,
1030 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
1031 Note that 'ML_file' is the canonical command to load ML files into the
1034 * Simplified programming interface to define ML antiquotations, see
1035 structure ML_Antiquotation. Minor INCOMPATIBILITY.
1037 * ML antiquotation @{here} refers to its source position, which is
1038 occasionally useful for experimentation and diagnostic purposes.
1040 * ML antiquotation @{path} produces a Path.T value, similarly to
1041 Path.explode, but with compile-time check against the file-system and
1042 some PIDE markup. Note that unlike theory source, ML does not have a
1043 well-defined master directory, so an absolute symbolic path
1044 specification is usually required, e.g. "~~/src/HOL".
1046 * ML antiquotation @{print} inlines a function to print an arbitrary
1047 ML value, which is occasionally useful for diagnostic or demonstration
1053 * Proof General with its traditional helper scripts is now an optional
1054 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
1055 component repository http://isabelle.in.tum.de/components/. Note that
1056 the "system" manual provides general explanations about add-on
1057 components, especially those that are not bundled with the release.
1059 * The raw Isabelle process executable has been renamed from
1060 "isabelle-process" to "isabelle_process", which conforms to common
1061 shell naming conventions, and allows to define a shell function within
1062 the Isabelle environment to avoid dynamic path lookup. Rare
1063 incompatibility for old tools that do not use the ISABELLE_PROCESS
1066 * Former "isabelle tty" has been superseded by "isabelle console",
1067 with implicit build like "isabelle jedit", and without the mostly
1068 obsolete Isar TTY loop.
1070 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
1071 and PDF_VIEWER now refer to the actual programs, not shell
1072 command-lines. Discontinued option -c: invocation may be asynchronous
1073 via desktop environment, without any special precautions. Potential
1074 INCOMPATIBILITY with ambitious private settings.
1076 * Removed obsolete "isabelle unsymbolize". Note that the usual format
1077 for email communication is the Unicode rendering of Isabelle symbols,
1078 as produced by Isabelle/jEdit, for example.
1080 * Removed obsolete tool "wwwfind". Similar functionality may be
1081 integrated into Isabelle/jEdit eventually.
1083 * Improved 'display_drafts' concerning desktop integration and
1084 repeated invocation in PIDE front-end: re-use single file
1085 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1087 * Session ROOT specifications require explicit 'document_files' for
1088 robust dependencies on LaTeX sources. Only these explicitly given
1089 files are copied to the document output directory, before document
1090 processing is started.
1092 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1093 of TeX Live from Cygwin.
1097 New in Isabelle2013-2 (December 2013)
1098 -------------------------------------
1100 *** Prover IDE -- Isabelle/Scala/jEdit ***
1102 * More robust editing of running commands with internal forks,
1103 e.g. non-terminating 'by' steps.
1105 * More relaxed Sledgehammer panel: avoid repeated application of query
1106 after edits surrounding the command location.
1108 * More status information about commands that are interrupted
1109 accidentally (via physical event or Poly/ML runtime system signal,
1110 e.g. out-of-memory).
1115 * More robust termination of external processes managed by
1116 Isabelle/ML: support cancellation of tasks within the range of
1117 milliseconds, as required for PIDE document editing with automatically
1118 tried tools (e.g. Sledgehammer).
1120 * Reactivated Isabelle/Scala kill command for external processes on
1121 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1122 workaround for some Debian/Ubuntu Linux versions from 2013.
1126 New in Isabelle2013-1 (November 2013)
1127 -------------------------------------
1131 * Discontinued obsolete 'uses' within theory header. Note that
1132 commands like 'ML_file' work without separate declaration of file
1133 dependencies. Minor INCOMPATIBILITY.
1135 * Discontinued redundant 'use' command, which was superseded by
1136 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1138 * Simplified subscripts within identifiers, using plain \<^sub>
1139 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1140 only for literal tokens within notation; explicit mixfix annotations
1141 for consts or fixed variables may be used as fall-back for unusual
1142 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1143 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1144 standardize symbols as a starting point for further manual cleanup.
1145 The ML reference variable "legacy_isub_isup" may be set as temporary
1146 workaround, to make the prover accept a subset of the old identifier
1149 * Document antiquotations: term style "isub" has been renamed to
1150 "sub". Minor INCOMPATIBILITY.
1152 * Uniform management of "quick_and_dirty" as system option (see also
1153 "isabelle options"), configuration option within the context (see also
1154 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1155 INCOMPATIBILITY, need to use more official Isabelle means to access
1156 quick_and_dirty, instead of historical poking into mutable reference.
1158 * Renamed command 'print_configs' to 'print_options'. Minor
1161 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1162 implicit change of some global references) is retained for now as
1163 control command, e.g. for ProofGeneral 3.7.x.
1165 * Discontinued 'print_drafts' command with its old-fashioned PS output
1166 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1167 'display_drafts' instead and print via the regular document viewer.
1169 * Updated and extended "isar-ref" and "implementation" manual,
1170 eliminated old "ref" manual.
1173 *** Prover IDE -- Isabelle/Scala/jEdit ***
1175 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1176 Documentation panel.
1178 * Dockable window "Documentation" provides access to Isabelle
1181 * Dockable window "Find" provides query operations for formal entities
1182 (GUI front-end to 'find_theorems' command).
1184 * Dockable window "Sledgehammer" manages asynchronous / parallel
1185 sledgehammer runs over existing document sources, independently of
1186 normal editing and checking process.
1188 * Dockable window "Timing" provides an overview of relevant command
1189 timing information, depending on option jedit_timing_threshold. The
1190 same timing information is shown in the extended tooltip of the
1191 command keyword, when hovering the mouse over it while the CONTROL or
1192 COMMAND modifier is pressed.
1194 * Improved dockable window "Theories": Continuous checking of proof
1195 document (visible and required parts) may be controlled explicitly,
1196 using check box or shortcut "C+e ENTER". Individual theory nodes may
1197 be marked explicitly as required and checked in full, using check box
1198 or shortcut "C+e SPACE".
1200 * Improved completion mechanism, which is now managed by the
1201 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1202 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1204 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1205 isabelle.complete for explicit completion in Isabelle sources.
1206 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1207 to resolve conflict.
1209 * Improved support of various "minor modes" for Isabelle NEWS,
1210 options, session ROOT etc., with completion and SideKick tree view.
1212 * Strictly monotonic document update, without premature cancellation of
1213 running transactions that are still needed: avoid reset/restart of
1214 such command executions while editing.
1216 * Support for asynchronous print functions, as overlay to existing
1219 * Support for automatic tools in HOL, which try to prove or disprove
1220 toplevel theorem statements.
1222 * Action isabelle.reset-font-size resets main text area font size
1223 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1224 also "Plugin Options / Isabelle / General"). It can be bound to some
1225 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1227 * File specifications in jEdit (e.g. file browser) may refer to
1228 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1229 obsolete $ISABELLE_HOME_WINDOWS variable.
1231 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1232 / Global Options / Appearance".
1234 * Improved support of native Mac OS X functionality via "MacOSX"
1235 plugin, which is now enabled by default.
1240 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1241 In particular, 'interpretation' allows for non-persistent
1242 interpretation within "context ... begin ... end" blocks offering a
1243 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1246 * Improved locales diagnostic command 'print_dependencies'.
1248 * Discontinued obsolete 'axioms' command, which has been marked as
1249 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1250 instead, while observing its uniform scope for polymorphism.
1252 * Discontinued empty name bindings in 'axiomatization'.
1255 * System option "proofs" has been discontinued. Instead the global
1256 state of Proofterm.proofs is persistently compiled into logic images
1257 as required, notably HOL-Proofs. Users no longer need to change
1258 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1260 * Syntax translation functions (print_translation etc.) always depend
1261 on Proof.context. Discontinued former "(advanced)" option -- this is
1262 now the default. Minor INCOMPATIBILITY.
1264 * Former global reference trace_unify_fail is now available as
1265 configuration option "unify_trace_failure" (global context only).
1267 * SELECT_GOAL now retains the syntactic context of the overall goal
1268 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1274 * Stronger precedence of syntax for big intersection and union on
1275 sets, in accordance with corresponding lattice operations.
1278 * Notation "{p:A. P}" now allows tuple patterns as well.
1280 * Nested case expressions are now translated in a separate check phase
1281 rather than during parsing. The data for case combinators is separated
1282 from the datatype package. The declaration attribute
1283 "case_translation" can be used to register new case combinators:
1285 declare [[case_translation case_combinator constructor1 ... constructorN]]
1288 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1290 - 'code_identifier' declares name hints for arbitrary identifiers in
1291 generated code, subsuming 'code_modulename'.
1293 See the isar-ref manual for syntax diagrams, and the HOL theories for
1296 * Attibute 'code': 'code' now declares concrete and abstract code
1297 equations uniformly. Use explicit 'code equation' and 'code abstract'
1298 to distinguish both when desired.
1300 * Discontinued theories Code_Integer and Efficient_Nat by a more
1301 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1302 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1303 generation for details. INCOMPATIBILITY.
1305 * Numeric types are mapped by default to target language numerals:
1306 natural (replaces former code_numeral) and integer (replaces former
1307 code_int). Conversions are available as integer_of_natural /
1308 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1309 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1310 ML). INCOMPATIBILITY.
1312 * Function package: For mutually recursive functions f and g, separate
1313 cases rules f.cases and g.cases are generated instead of unusable
1314 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1315 in the case that the unusable rule was used nevertheless.
1317 * Function package: For each function f, new rules f.elims are
1318 generated, which eliminate equalities of the form "f x = t".
1320 * New command 'fun_cases' derives ad-hoc elimination rules for
1321 function equations as simplified instances of f.elims, analogous to
1322 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1325 - parametrized correspondence relations are now supported:
1326 + parametricity theorems for the raw term can be specified in
1327 the command lift_definition, which allow us to generate stronger
1329 + setup_lifting generates stronger transfer rules if parametric
1330 correspondence relation can be generated
1331 + various new properties of the relator must be specified to support
1333 + parametricity theorem for the Quotient relation can be specified
1334 - setup_lifting generates domain rules for the Transfer package
1335 - stronger reflexivity prover of respectfulness theorems for type
1337 - ===> and --> are now local. The symbols can be introduced
1338 by interpreting the locale lifting_syntax (typically in an
1340 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1341 Main. Potential INCOMPATIBILITY
1342 - new commands for restoring and deleting Lifting/Transfer context:
1343 lifting_forget, lifting_update
1344 - the command print_quotmaps was renamed to print_quot_maps.
1348 - better support for domains in Transfer: replace Domainp T
1349 by the actual invariant in a transferred goal
1350 - transfer rules can have as assumptions other transfer rules
1351 - Experimental support for transferring from the raw level to the
1352 abstract level: Transfer.transferred attribute
1353 - Attribute version of the transfer method: untransferred attribute
1355 * Reification and reflection:
1356 - Reification is now directly available in HOL-Main in structure
1358 - Reflection now handles multiple lists with variables also.
1359 - The whole reflection stack has been decomposed into conversions.
1362 * Revised devices for recursive definitions over finite sets:
1363 - Only one fundamental fold combinator on finite set remains:
1364 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1365 This is now identity on infinite sets.
1366 - Locales ("mini packages") for fundamental definitions with
1367 Finite_Set.fold: folding, folding_idem.
1368 - Locales comm_monoid_set, semilattice_order_set and
1369 semilattice_neutr_order_set for big operators on sets.
1370 See theory Big_Operators for canonical examples.
1371 Note that foundational constants comm_monoid_set.F and
1372 semilattice_set.F correspond to former combinators fold_image
1373 and fold1 respectively. These are now gone. You may use
1374 those foundational constants as substitutes, but it is
1375 preferable to interpret the above locales accordingly.
1376 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1377 no longer needed in connection with Finite_Set.fold etc.)
1379 card.union_inter ~> card_Un_Int [symmetric]
1380 card.union_disjoint ~> card_Un_disjoint
1383 * Locale hierarchy for abstract orderings and (semi)lattices.
1385 * Complete_Partial_Order.admissible is defined outside the type class
1386 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1387 class predicate assumption or sort constraint when possible.
1390 * Introduce type class "conditionally_complete_lattice": Like a
1391 complete lattice but does not assume the existence of the top and
1392 bottom elements. Allows to generalize some lemmas about reals and
1393 extended reals. Removed SupInf and replaced it by the instantiation
1394 of conditionally_complete_lattice for real. Renamed lemmas about
1395 conditionally-complete lattice from Sup_... to cSup_... and from
1396 Inf_... to cInf_... to avoid hidding of similar complete lattice
1399 * Introduce type class linear_continuum as combination of
1400 conditionally-complete lattices and inner dense linorders which have
1401 more than one element. INCOMPATIBILITY.
1403 * Introduced type classes order_top and order_bot. The old classes top
1404 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1405 Rename bot -> order_bot, top -> order_top
1407 * Introduce type classes "no_top" and "no_bot" for orderings without
1408 top and bottom elements.
1410 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1412 * Complex_Main: Unify and move various concepts from
1413 HOL-Multivariate_Analysis to HOL-Complex_Main.
1415 - Introduce type class (lin)order_topology and
1416 linear_continuum_topology. Allows to generalize theorems about
1417 limits and order. Instances are reals and extended reals.
1419 - continuous and continuos_on from Multivariate_Analysis:
1420 "continuous" is the continuity of a function at a filter. "isCont"
1421 is now an abbrevitation: "isCont x f == continuous (at _) f".
1423 Generalized continuity lemmas from isCont to continuous on an
1426 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1427 compactness of closed intervals on reals. Continuous functions
1428 attain infimum and supremum on compact sets. The inverse of a
1429 continuous function is continuous, when the function is continuous
1432 - connected from Multivariate_Analysis. Use it to prove the
1433 intermediate value theorem. Show connectedness of intervals on
1434 linear_continuum_topology).
1436 - first_countable_topology from Multivariate_Analysis. Is used to
1437 show equivalence of properties on the neighbourhood filter of x and
1438 on all sequences converging to x.
1440 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1441 theorems from Library/FDERIV.thy to Deriv.thy and base the
1442 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1443 which are restricted to sets, i.e. to represent derivatives from
1446 - Removed the within-filter. It is replaced by the principal filter:
1448 F within X = inf F (principal X)
1450 - Introduce "at x within U" as a single constant, "at x" is now an
1451 abbreviation for "at x within UNIV"
1453 - Introduce named theorem collections tendsto_intros,
1454 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1455 in tendsto_intros (or FDERIV_intros) are also available as
1456 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1457 is replaced by a congruence rule. This allows to apply them as
1458 intro rules and then proving equivalence by the simplifier.
1460 - Restructured theories in HOL-Complex_Main:
1462 + Moved RealDef and RComplete into Real
1464 + Introduced Topological_Spaces and moved theorems about
1465 topological spaces, filters, limits and continuity to it
1467 + Renamed RealVector to Real_Vector_Spaces
1469 + Split Lim, SEQ, Series into Topological_Spaces,
1470 Real_Vector_Spaces, and Limits
1472 + Moved Ln and Log to Transcendental
1474 + Moved theorems about continuity from Deriv to Topological_Spaces
1476 - Remove various auxiliary lemmas.
1481 - Added option "spy".
1482 - Reduce incidence of "too high arity" errors.
1486 isar_shrink ~> isar_compress
1488 - Added options "isar_try0", "spy".
1489 - Better support for "isar_proofs".
1490 - MaSh has been fined-tuned and now runs as a local server.
1492 * Improved support for ad hoc overloading of constants (see also
1493 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1495 * Library/Polynomial.thy:
1496 - Use lifting for primitive definitions.
1497 - Explicit conversions from and to lists of coefficients, used for
1499 - Replaced recursion operator poly_rec by fold_coeffs.
1500 - Prefer pre-existing gcd operation for gcd.
1502 poly_eq_iff ~> poly_eq_poly_eq_iff
1503 poly_ext ~> poly_eqI
1504 expand_poly_eq ~> poly_eq_iff
1507 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1508 case_of_simps to convert function definitions between a list of
1509 equations with patterns on the lhs and a single equation with case
1510 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1512 * New Library/FSet.thy: type of finite sets defined as a subtype of
1513 sets defined by Lifting/Transfer.
1515 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1517 * Consolidation of library theories on product orders:
1519 Product_Lattice ~> Product_Order -- pointwise order on products
1520 Product_ord ~> Product_Lexorder -- lexicographic order on products
1524 * Imperative-HOL: The MREC combinator is considered legacy and no
1525 longer included by default. INCOMPATIBILITY, use partial_function
1526 instead, or import theory Legacy_Mrec as a fallback.
1528 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1529 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1530 ~~/src/HOL/Library/Polynomial instead. The latter provides
1531 integration with HOL's type classes for rings. INCOMPATIBILITY.
1534 - Various improvements to BNF-based (co)datatype package, including
1535 new commands "primrec_new", "primcorec", and
1536 "datatype_new_compat", as well as documentation. See
1537 "datatypes.pdf" for details.
1538 - New "coinduction" method to avoid some boilerplate (compared to
1541 data ~> datatype_new
1542 codata ~> codatatype
1544 - Renamed many generated theorems, including
1546 map_comp' ~> map_comp
1556 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1557 "check_property" allows to check specifications of the form "ALL x y
1558 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1559 Examples.thy in particular.
1561 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1562 tracing output in the command transaction context instead of physical
1563 stdout. See also Toplevel.debug, Toplevel.debugging and
1564 ML_Compiler.exn_trace.
1566 * ML type "theory" is now immutable, without any special treatment of
1567 drafts or linear updates (which could lead to "stale theory" errors in
1568 the past). Discontinued obsolete operations like Theory.copy,
1569 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1572 * More uniform naming of goal functions for skipped proofs:
1574 Skip_Proof.prove ~> Goal.prove_sorry
1575 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1577 Minor INCOMPATIBILITY.
1579 * Simplifier tactics and tools use proper Proof.context instead of
1580 historic type simpset. Old-style declarations like addsimps,
1581 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1582 retains its use as snapshot of the main Simplifier context, using
1583 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1584 old tools by making them depend on (ctxt : Proof.context) instead of
1585 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1587 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1588 operate on Proof.context instead of claset, for uniformity with addIs,
1589 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1590 clasets separately from the context.
1592 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1593 INCOMPATIBILITY, use @{context} instead.
1595 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1596 presents the result as initial Proof.context.
1601 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1602 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1604 * Discontinued obsolete isabelle-process options -f and -u (former
1605 administrative aliases of option -e). Minor INCOMPATIBILITY.
1607 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1610 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1611 document formats: dvi.gz, ps, ps.gz -- the default document format is
1614 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1615 specify global resources of the JVM process run by isabelle build.
1617 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1618 to run Isabelle/Scala source files as standalone programs.
1620 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1621 keyword tables): use Isabelle/Scala operations, which inspect outer
1622 syntax without requiring to build sessions first.
1624 * Sessions may be organized via 'chapter' specifications in the ROOT
1625 file, which determines a two-level hierarchy of browser info. The old
1626 tree-like organization via implicit sub-session relation (with its
1627 tendency towards erratic fluctuation of URLs) has been discontinued.
1628 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1629 for HTML presentation of theories.
1633 New in Isabelle2013 (February 2013)
1634 -----------------------------------
1638 * Theorem status about oracles and unfinished/failed future proofs is
1639 no longer printed by default, since it is incompatible with
1640 incremental / parallel checking of the persistent document model. ML
1641 function Thm.peek_status may be used to inspect a snapshot of the
1642 ongoing evaluation process. Note that in batch mode --- notably
1643 isabelle build --- the system ensures that future proofs of all
1644 accessible theorems in the theory context are finished (as before).
1646 * Configuration option show_markup controls direct inlining of markup
1647 into the printed representation of formal entities --- notably type
1648 and sort constraints. This enables Prover IDE users to retrieve that
1649 information via tooltips in the output window, for example.
1651 * Command 'ML_file' evaluates ML text from a file directly within the
1652 theory, without any predeclaration via 'uses' in the theory header.
1654 * Old command 'use' command and corresponding keyword 'uses' in the
1655 theory header are legacy features and will be discontinued soon.
1656 Tools that load their additional source files may imitate the
1657 'ML_file' implementation, such that the system can take care of
1658 dependencies properly.
1660 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1661 is called fastforce / fast_force_tac already since Isabelle2011-1.
1663 * Updated and extended "isar-ref" and "implementation" manual, reduced
1664 remaining material in old "ref" manual.
1666 * Improved support for auxiliary contexts that indicate block structure
1667 for specifications. Nesting of "context fixes ... context assumes ..."
1668 and "class ... context ...".
1670 * Attribute "consumes" allows a negative value as well, which is
1671 interpreted relatively to the total number of premises of the rule in
1672 the target context. This form of declaration is stable when exported
1673 from a nested 'context' with additional assumptions. It is the
1674 preferred form for definitional packages, notably cases/rules produced
1675 in HOL/inductive and HOL/function.
1677 * More informative error messages for Isar proof commands involving
1678 lazy enumerations (method applications etc.).
1680 * Refined 'help' command to retrieve outer syntax commands according
1681 to name patterns (with clickable results).
1684 *** Prover IDE -- Isabelle/Scala/jEdit ***
1686 * Parallel terminal proofs ('by') are enabled by default, likewise
1687 proofs that are built into packages like 'datatype', 'function'. This
1688 allows to "run ahead" checking the theory specifications on the
1689 surface, while the prover is still crunching on internal
1690 justifications. Unfinished / cancelled proofs are restarted as
1691 required to complete full proof checking eventually.
1693 * Improved output panel with tooltips, hyperlinks etc. based on the
1694 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1695 tooltips leads to some window that supports the same recursively,
1696 which can lead to stacks of tooltips as the semantic document content
1697 is explored. ESCAPE closes the whole stack, individual windows may be
1698 closed separately, or detached to become independent jEdit dockables.
1700 * Improved support for commands that produce graph output: the text
1701 message contains a clickable area to open a new instance of the graph
1704 * More robust incremental parsing of outer syntax (partial comments,
1705 malformed symbols). Changing the balance of open/close quotes and
1706 comment delimiters works more conveniently with unfinished situations
1707 that frequently occur in user interaction.
1709 * More efficient painting and improved reactivity when editing large
1710 files. More scalable management of formal document content.
1712 * Smarter handling of tracing messages: prover process pauses after
1713 certain number of messages per command transaction, with some user
1714 dialog to stop or continue. This avoids swamping the front-end with
1715 potentially infinite message streams.
1717 * More plugin options and preferences, based on Isabelle/Scala. The
1718 jEdit plugin option panel provides access to some Isabelle/Scala
1719 options, including tuning parameters for editor reactivity and color
1722 * Dockable window "Symbols" provides some editing support for Isabelle
1725 * Dockable window "Monitor" shows ML runtime statistics. Note that
1726 continuous display of the chart slows down the system.
1728 * Improved editing support for control styles: subscript, superscript,
1729 bold, reset of style -- operating on single symbols or text
1730 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1732 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1733 adjust the main text area font size, and its derivatives for output,
1734 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1735 need to be adapted to local keyboard layouts.
1737 * More reactive completion popup by default: use \t (TAB) instead of
1738 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1739 also "Plugin Options / SideKick / General / Code Completion Options".
1741 * Implicit check and build dialog of the specified logic session
1742 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1743 demand, without bundling big platform-dependent heap images in the
1744 Isabelle distribution.
1746 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1747 from Oracle provide better multi-platform experience. This version is
1748 now bundled exclusively with Isabelle.
1753 * Code generation for Haskell: restrict unqualified imports from
1754 Haskell Prelude to a small set of fundamental operations.
1756 * Command 'export_code': relative file names are interpreted
1757 relatively to master directory of current theory rather than the
1758 rather arbitrary current working directory. INCOMPATIBILITY.
1760 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1761 use regular rule composition via "OF" / "THEN", or explicit proof
1762 structure instead. Note that Isabelle/ML provides a variety of
1763 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1764 with some care where this is really required.
1766 * Command 'typ' supports an additional variant with explicit sort
1767 constraint, to infer and check the most general type conforming to a
1768 given sort. Example (in HOL):
1770 typ "_ * _ * bool * unit" :: finite
1772 * Command 'locale_deps' visualizes all locales and their relations as
1780 - Added MaSh relevance filter based on machine-learning; see the
1781 Sledgehammer manual for details.
1782 - Polished Isar proofs generated with "isar_proofs" option.
1783 - Rationalized type encodings ("type_enc" option).
1784 - Renamed "kill_provers" subcommand to "kill_all".
1786 isar_proof ~> isar_proofs
1787 isar_shrink_factor ~> isar_shrink
1788 max_relevant ~> max_facts
1789 relevance_thresholds ~> fact_thresholds
1791 * Quickcheck: added an optimisation for equality premises. It is
1792 switched on by default, and can be switched off by setting the
1793 configuration quickcheck_optimise_equality to false.
1795 * Quotient: only one quotient can be defined by quotient_type
1799 - generation of an abstraction function equation in lift_definition
1800 - quot_del attribute
1801 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1803 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1806 * Preprocessing of the code generator rewrites set comprehensions into
1807 pointfree expressions.
1809 * The SMT solver Z3 has now by default a restricted set of directly
1810 supported features. For the full set of features (div/mod, nonlinear
1811 arithmetic, datatypes/records) with potential proof reconstruction
1812 failures, enable the configuration option "z3_with_extensions". Minor
1815 * Simplified 'typedef' specifications: historical options for implicit
1816 set definition and alternative name have been discontinued. The
1817 former behavior of "typedef (open) t = A" is now the default, but
1818 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1821 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1822 directly. INCOMPATIBILITY.
1824 * Moved operation product, sublists and n_lists from theory Enum to
1825 List. INCOMPATIBILITY.
1827 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1829 * Class "comm_monoid_diff" formalises properties of bounded
1830 subtraction, with natural numbers and multisets as typical instances.
1832 * Added combinator "Option.these" with type "'a option set => 'a set".
1834 * Theory "Transitive_Closure": renamed lemmas
1836 reflcl_tranclp -> reflclp_tranclp
1837 rtranclp_reflcl -> rtranclp_reflclp
1841 * Theory "Rings": renamed lemmas (in class semiring)
1843 left_distrib ~> distrib_right
1844 right_distrib ~> distrib_left
1848 * Generalized the definition of limits:
1850 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1851 expresses that when the input values x converge to F then the
1852 output f x converges to G.
1854 - Added filters for convergence to positive (at_top) and negative
1857 - Moved infinity in the norm (at_infinity) from
1858 Multivariate_Analysis to Complex_Main.
1860 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1865 * Theory "Library/Option_ord" provides instantiation of option type to
1866 lattice type classes.
1868 * Theory "Library/Multiset": renamed
1870 constant fold_mset ~> Multiset.fold
1871 fact fold_mset_commute ~> fold_mset_comm
1875 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1878 - Renamed constants (and related lemmas)
1881 strict_prefix ~> prefix
1883 - Replaced constant "postfix" by "suffixeq" with swapped argument
1884 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1885 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1886 Renamed lemmas accordingly.
1888 - Added constant "list_hembeq" for homeomorphic embedding on
1889 lists. Added abbreviation "sublisteq" for special case
1890 "list_hembeq (op =)".
1892 - Theory Library/Sublist no longer provides "order" and "bot" type
1893 class instances for the prefix order (merely corresponding locale
1894 interpretations). The type class instances are now in theory
1895 Library/Prefix_Order.
1897 - The sublist relation of theory Library/Sublist_Order is now based
1898 on "Sublist.sublisteq". Renamed lemmas accordingly:
1900 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1901 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1902 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1903 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1904 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1905 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1906 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1907 le_list_drop_many ~> Sublist.sublisteq_drop_many
1908 le_list_filter_left ~> Sublist.sublisteq_filter_left
1909 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1910 le_list_rev_take_iff ~> Sublist.sublisteq_append
1911 le_list_same_length ~> Sublist.sublisteq_same_length
1912 le_list_take_many_iff ~> Sublist.sublisteq_append'
1913 less_eq_list.drop ~> less_eq_list_drop
1914 less_eq_list.induct ~> less_eq_list_induct
1915 not_le_list_length ~> Sublist.not_sublisteq_length
1919 * New theory Library/Countable_Set.
1921 * Theory Library/Debug and Library/Parallel provide debugging and
1922 parallel execution for code generated towards Isabelle/ML.
1924 * Theory Library/FuncSet: Extended support for Pi and extensional and
1925 introduce the extensional dependent function space "PiE". Replaced
1926 extensional_funcset by an abbreviation, and renamed lemmas from
1927 extensional_funcset to PiE as follows:
1929 extensional_empty ~> PiE_empty
1930 extensional_funcset_empty_domain ~> PiE_empty_domain
1931 extensional_funcset_empty_range ~> PiE_empty_range
1932 extensional_funcset_arb ~> PiE_arb
1933 extensional_funcset_mem ~> PiE_mem
1934 extensional_funcset_extend_domainI ~> PiE_fun_upd
1935 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1936 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1937 card_extensional_funcset ~> card_PiE
1938 finite_extensional_funcset ~> finite_PiE
1942 * Theory Library/FinFun: theory of almost everywhere constant
1943 functions (supersedes the AFP entry "Code Generation for Functions as
1946 * Theory Library/Phantom: generic phantom type to make a type
1947 parameter appear in a constant's type. This alternative to adding
1948 TYPE('a) as another parameter avoids unnecessary closures in generated
1951 * Theory Library/RBT_Impl: efficient construction of red-black trees
1952 from sorted associative lists. Merging two trees with rbt_union may
1953 return a structurally different tree than before. Potential
1956 * Theory Library/IArray: immutable arrays with code generation.
1958 * Theory Library/Finite_Lattice: theory of finite lattices.
1960 * HOL/Multivariate_Analysis: replaced
1962 "basis :: 'a::euclidean_space => nat => real"
1963 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1965 on euclidean spaces by using the inner product "_ \<bullet> _" with
1966 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1967 "SUM i : Basis. f i * r i".
1969 With this change the following constants are also changed or removed:
1971 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1972 a $$ i ~> inner a i (where i : Basis)
1974 \<pi>, \<pi>' removed
1976 Theorems about these constants where removed.
1980 component_le_norm ~> Basis_le_norm
1981 euclidean_eq ~> euclidean_eq_iff
1982 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1983 euclidean_simps ~> inner_simps
1984 independent_basis ~> independent_Basis
1985 span_basis ~> span_Basis
1986 in_span_basis ~> in_span_Basis
1987 norm_bound_component_le ~> norm_boound_Basis_le
1988 norm_bound_component_lt ~> norm_boound_Basis_lt
1989 component_le_infnorm ~> Basis_le_infnorm
1995 - Added simproc "measurable" to automatically prove measurability.
1997 - Added induction rules for sigma sets with disjoint union
1998 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1999 (borel_measurable_induct).
2001 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
2004 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
2005 AFP entry "Ordinals_and_Cardinals").
2007 * HOL/BNF: New (co)datatype package based on bounded natural functors
2008 with support for mixed, nested recursion and interesting non-free
2011 * HOL/Finite_Set and Relation: added new set and relation operations
2012 expressed by Finite_Set.fold.
2014 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
2015 trees for the code generator.
2017 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
2019 possible INCOMPATIBILITY.
2021 * HOL/Set: renamed Set.project -> Set.filter
2025 *** Document preparation ***
2027 * Dropped legacy antiquotations "term_style" and "thm_style", since
2028 styles may be given as arguments to "term" and "thm" already.
2029 Discontinued legacy styles "prem1" .. "prem19".
2031 * Default LaTeX rendering for \<euro> is now based on eurosym package,
2032 instead of slightly exotic babel/greek.
2034 * Document variant NAME may use different LaTeX entry point
2035 document/root_NAME.tex if that file exists, instead of the common
2038 * Simplified custom document/build script, instead of old-style
2039 document/IsaMakefile. Minor INCOMPATIBILITY.
2044 * The default limit for maximum number of worker threads is now 8,
2045 instead of 4, in correspondence to capabilities of contemporary
2046 hardware and Poly/ML runtime system.
2048 * Type Seq.results and related operations support embedded error
2049 messages within lazy enumerations, and thus allow to provide
2050 informative errors in the absence of any usable results.
2052 * Renamed Position.str_of to Position.here to emphasize that this is a
2053 formal device to inline positions into message text, but not
2054 necessarily printing visible text.
2059 * Advanced support for Isabelle sessions and build management, see
2060 "system" manual for the chapter of that name, especially the "isabelle
2061 build" tool and its examples. The "isabelle mkroot" tool prepares
2062 session root directories for use with "isabelle build", similar to
2063 former "isabelle mkdir" for "isabelle usedir". Note that this affects
2064 document preparation as well. INCOMPATIBILITY, isabelle usedir /
2065 mkdir / make are rendered obsolete.
2067 * Discontinued obsolete Isabelle/build script, it is superseded by the
2068 regular isabelle build tool. For example:
2070 isabelle build -s -b HOL
2072 * Discontinued obsolete "isabelle makeall".
2074 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
2075 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
2076 provides some traditional targets that invoke "isabelle build". Note
2077 that this is inefficient! Applications of Isabelle/HOL involving
2078 "isabelle make" should be upgraded to use "isabelle build" directly.
2080 * The "isabelle options" tool prints Isabelle system options, as
2081 required for "isabelle build", for example.
2083 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2084 Minor INCOMPATIBILITY in command-line options.
2086 * The "isabelle install" tool has now a simpler command-line. Minor
2089 * The "isabelle components" tool helps to resolve add-on components
2090 that are not bundled, or referenced from a bare-bones repository
2091 version of Isabelle.
2093 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2094 platform family: "linux", "macos", "windows".
2096 * The ML system is configured as regular component, and no longer
2097 picked up from some surrounding directory. Potential INCOMPATIBILITY
2098 for home-made settings.
2100 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2102 * Discontinued support for Poly/ML 5.2.1, which was the last version
2103 without exception positions and advanced ML compiler/toplevel
2106 * Discontinued special treatment of Proof General -- no longer guess
2107 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2108 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2109 settings manually, or use a Proof General version that has been
2110 bundled as Isabelle component.
2114 New in Isabelle2012 (May 2012)
2115 ------------------------------
2119 * Prover IDE (PIDE) improvements:
2121 - more robust Sledgehammer integration (as before the sledgehammer
2122 command-line needs to be typed into the source buffer)
2123 - markup for bound variables
2124 - markup for types of term variables (displayed as tooltips)
2125 - support for user-defined Isar commands within the running session
2126 - improved support for Unicode outside original 16bit range
2127 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2129 * Forward declaration of outer syntax keywords within the theory
2130 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2131 commands to be used in the same theory where defined.
2133 * Auxiliary contexts indicate block structure for specifications with
2134 additional parameters and assumptions. Such unnamed contexts may be
2135 nested within other targets, like 'theory', 'locale', 'class',
2136 'instantiation' etc. Results from the local context are generalized
2137 accordingly and applied to the enclosing target context. Example:
2141 assumes xy: "x = y" and yz: "y = z"
2144 lemma my_trans: "x = z" using xy yz by simp
2150 The most basic application is to factor-out context elements of
2151 several fixes/assumes/shows theorem statements, e.g. see
2152 ~~/src/HOL/Isar_Examples/Group_Context.thy
2154 Any other local theory specification element works within the "context
2155 ... begin ... end" block as well.
2157 * Bundled declarations associate attributed fact expressions with a
2158 given name in the context. These may be later included in other
2159 contexts. This allows to manage context extensions casually, without
2160 the logical dependencies of locales and locale interpretation. See
2161 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2163 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2164 declaration, and results are standardized before being stored. Thus
2165 old-style "standard" after instantiation or composition of facts
2166 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2167 indices of schematic variables.
2169 * Rule attributes in local theory declarations (e.g. locale or class)
2170 are now statically evaluated: the resulting theorem is stored instead
2171 of the original expression. INCOMPATIBILITY in rare situations, where
2172 the historic accident of dynamic re-evaluation in interpretations
2175 * New tutorial "Programming and Proving in Isabelle/HOL"
2176 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2177 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2178 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2179 Logic" as the recommended beginners tutorial, but does not cover all
2180 of the material of that old tutorial.
2182 * Updated and extended reference manuals: "isar-ref",
2183 "implementation", "system"; reduced remaining material in old "ref"
2189 * Command 'definition' no longer exports the foundational "raw_def"
2190 into the user context. Minor INCOMPATIBILITY, may use the regular
2191 "def" result with attribute "abs_def" to imitate the old version.
2193 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2194 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2195 expand it. This also works for object-logic equality. (Formerly
2196 undocumented feature.)
2198 * Sort constraints are now propagated in simultaneous statements, just
2199 like type constraints. INCOMPATIBILITY in rare situations, where
2200 distinct sorts used to be assigned accidentally. For example:
2202 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2204 lemma "P (x::'a)" and "Q (y::'a::bar)"
2205 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2207 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2208 tolerant against multiple unifiers, as long as the final result is
2209 unique. (As before, rules are composed in canonical right-to-left
2210 order to accommodate newly introduced premises.)
2212 * Renamed some inner syntax categories:
2218 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2219 "num_position" etc. are mainly used instead (which also include
2220 position information via constraints).
2222 * Simplified configuration options for syntax ambiguity: see
2223 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2224 manual. Minor INCOMPATIBILITY.
2226 * Discontinued configuration option "syntax_positions": atomic terms
2227 in parse trees are always annotated by position constraints.
2229 * Old code generator for SML and its commands 'code_module',
2230 'code_library', 'consts_code', 'types_code' have been discontinued.
2231 Use commands of the generic code generator instead. INCOMPATIBILITY.
2233 * Redundant attribute "code_inline" has been discontinued. Use
2234 "code_unfold" instead. INCOMPATIBILITY.
2236 * Dropped attribute "code_unfold_post" in favor of the its dual
2237 "code_abbrev", which yields a common pattern in definitions like
2239 definition [code_abbrev]: "f = t"
2243 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2244 instead. INCOMPATIBILITY.
2246 * Discontinued old "prems" fact, which used to refer to the accidental
2247 collection of foundational premises in the context (already marked as
2248 legacy since Isabelle2011).
2253 * Type 'a set is now a proper type constructor (just as before
2254 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2255 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2256 sets separate, it is often sufficient to rephrase some set S that has
2257 been accidentally used as predicates by "%x. x : S", and some
2258 predicate P that has been accidentally used as set by "{x. P x}".
2259 Corresponding proofs in a first step should be pruned from any
2260 tinkering with former theorems mem_def and Collect_def as far as
2263 For developments which deliberately mix predicates and sets, a
2264 planning step is necessary to determine what should become a predicate
2265 and what a set. It can be helpful to carry out that step in
2266 Isabelle2011-1 before jumping right into the current release.
2268 * Code generation by default implements sets as container type rather
2269 than predicates. INCOMPATIBILITY.
2271 * New type synonym 'a rel = ('a * 'a) set
2273 * The representation of numerals has changed. Datatype "num"
2274 represents strictly positive binary numerals, along with functions
2275 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2276 positive and negated numeric literals, respectively. See also
2277 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2278 user theories may require adaptations as follows:
2280 - Theorems with number_ring or number_semiring constraints: These
2281 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2283 - Theories defining numeric types: Remove number, number_semiring,
2284 and number_ring instances. Defer all theorems about numerals until
2285 after classes one and semigroup_add have been instantiated.
2287 - Numeral-only simp rules: Replace each rule having a "number_of v"
2288 pattern with two copies, one for numeral and one for neg_numeral.
2290 - Theorems about subclasses of semiring_1 or ring_1: These classes
2291 automatically support numerals now, so more simp rules and
2292 simprocs may now apply within the proof.
2294 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2295 Redefine using other integer operations.
2297 * Transfer: New package intended to generalize the existing
2298 "descending" method and related theorem attributes from the Quotient
2299 package. (Not all functionality is implemented yet, but future
2300 development will focus on Transfer as an eventual replacement for the
2301 corresponding parts of the Quotient package.)
2303 - transfer_rule attribute: Maintains a collection of transfer rules,
2304 which relate constants at two different types. Transfer rules may
2305 relate different type instances of the same polymorphic constant,
2306 or they may relate an operation on a raw type to a corresponding
2307 operation on an abstract type (quotient or subtype). For example:
2309 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2310 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2312 - transfer method: Replaces a subgoal on abstract types with an
2313 equivalent subgoal on the corresponding raw types. Constants are
2314 replaced with corresponding ones according to the transfer rules.
2315 Goals are generalized over all free variables by default; this is
2316 necessary for variables whose types change, but can be overridden
2317 for specific variables with e.g. "transfer fixing: x y z". The
2318 variant transfer' method allows replacing a subgoal with one that
2319 is logically stronger (rather than equivalent).
2321 - relator_eq attribute: Collects identity laws for relators of
2322 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2323 transfer method uses these lemmas to infer transfer rules for
2324 non-polymorphic constants on the fly.
2326 - transfer_prover method: Assists with proving a transfer rule for a
2327 new constant, provided the constant is defined in terms of other
2328 constants that already have transfer rules. It should be applied
2329 after unfolding the constant definitions.
2331 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2332 from type nat to type int.
2334 * Lifting: New package intended to generalize the quotient_definition
2335 facility of the Quotient package; designed to work with Transfer.
2337 - lift_definition command: Defines operations on an abstract type in
2338 terms of a corresponding operation on a representation
2339 type. Example syntax:
2341 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2344 Users must discharge a respectfulness proof obligation when each
2345 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2346 the proof is discharged automatically.) The obligation is
2347 presented in a user-friendly, readable form; a respectfulness
2348 theorem in the standard format and a transfer rule are generated
2351 - Integration with code_abstype: For typedefs (e.g. subtypes
2352 corresponding to a datatype invariant, such as dlist),
2353 lift_definition generates a code certificate theorem and sets up
2354 code generation for each constant.
2356 - setup_lifting command: Sets up the Lifting package to work with a
2357 user-defined type. The user must provide either a quotient theorem
2358 or a type_definition theorem. The package configures transfer
2359 rules for equality and quantifiers on the type, and sets up the
2360 lift_definition command to work with the type.
2362 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2363 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2364 Word/Word.thy and Library/Float.thy.
2368 - The 'quotient_type' command now supports a 'morphisms' option with
2369 rep and abs functions, similar to typedef.
2371 - 'quotient_type' sets up new types to work with the Lifting and
2372 Transfer packages, as with 'setup_lifting'.
2374 - The 'quotient_definition' command now requires the user to prove a
2375 respectfulness property at the point where the constant is
2376 defined, similar to lift_definition; INCOMPATIBILITY.
2378 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2379 accordingly, INCOMPATIBILITY.
2381 * New diagnostic command 'find_unused_assms' to find potentially
2382 superfluous assumptions in theorems using Quickcheck.
2386 - Quickcheck returns variable assignments as counterexamples, which
2387 allows to reveal the underspecification of functions under test.
2388 For example, refuting "hd xs = x", it presents the variable
2389 assignment xs = [] and x = a1 as a counterexample, assuming that
2390 any property is false whenever "hd []" occurs in it.
2392 These counterexample are marked as potentially spurious, as
2393 Quickcheck also returns "xs = []" as a counterexample to the
2394 obvious theorem "hd xs = hd xs".
2396 After finding a potentially spurious counterexample, Quickcheck
2397 continues searching for genuine ones.
2399 By default, Quickcheck shows potentially spurious and genuine
2400 counterexamples. The option "genuine_only" sets quickcheck to only
2401 show genuine counterexamples.
2403 - The command 'quickcheck_generator' creates random and exhaustive
2404 value generators for a given type and operations.
2406 It generates values by using the operations as if they were
2407 constructors of that type.
2409 - Support for multisets.
2411 - Added "use_subtype" options.
2413 - Added "quickcheck_locale" configuration to specify how to process
2414 conjectures in a locale context.
2416 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2417 and affecting 'rat' and 'real'.
2420 - Integrated more tightly with SPASS, as described in the ITP 2012
2421 paper "More SPASS with Isabelle".
2422 - Made it try "smt" as a fallback if "metis" fails or times out.
2423 - Added support for the following provers: Alt-Ergo (via Why3 and
2424 TFF1), iProver, iProver-Eq.
2425 - Sped up the minimizer.
2426 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2427 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2428 - Renamed "sound" option to "strict".
2430 * Metis: Added possibility to specify lambda translations scheme as a
2431 parenthesized argument (e.g., "by (metis (lifting) ...)").
2433 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2435 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2437 * New "case_product" attribute to generate a case rule doing multiple
2438 case distinctions at the same time. E.g.
2440 list.exhaust [case_product nat.exhaust]
2442 produces a rule which can be used to perform case distinction on both
2445 * New "eventually_elim" method as a generalized variant of the
2446 eventually_elim* rules. Supports structured proofs.
2448 * Typedef with implicit set definition is considered legacy. Use
2449 "typedef (open)" form instead, which will eventually become the
2452 * Record: code generation can be switched off manually with
2454 declare [[record_coden = false]] -- "default true"
2456 * Datatype: type parameters allow explicit sort constraints.
2458 * Concrete syntax for case expressions includes constraints for source
2459 positions, and thus produces Prover IDE markup for its bindings.
2460 INCOMPATIBILITY for old-style syntax translations that augment the
2461 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2464 * Clarified attribute "mono_set": pure declaration without modifying
2465 the result of the fact expression.
2467 * More default pred/set conversions on a couple of relation operations
2468 and predicates. Added powers of predicate relations. Consolidation
2469 of some relation theorems:
2471 converse_def ~> converse_unfold
2472 rel_comp_def ~> relcomp_unfold
2473 symp_def ~> (modified, use symp_def and sym_def instead)
2474 transp_def ~> transp_trans
2475 Domain_def ~> Domain_unfold
2476 Range_def ~> Domain_converse [symmetric]
2478 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2480 See theory "Relation" for examples for making use of pred/set
2481 conversions by means of attributes "to_set" and "to_pred".
2485 * Renamed facts about the power operation on relations, i.e., relpow
2486 to match the constant's name:
2488 rel_pow_1 ~> relpow_1
2489 rel_pow_0_I ~> relpow_0_I
2490 rel_pow_Suc_I ~> relpow_Suc_I
2491 rel_pow_Suc_I2 ~> relpow_Suc_I2
2492 rel_pow_0_E ~> relpow_0_E
2493 rel_pow_Suc_E ~> relpow_Suc_E
2494 rel_pow_E ~> relpow_E
2495 rel_pow_Suc_D2 ~> relpow_Suc_D2
2496 rel_pow_Suc_E2 ~> relpow_Suc_E2
2497 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2498 rel_pow_E2 ~> relpow_E2
2499 rel_pow_add ~> relpow_add
2500 rel_pow_commute ~> relpow
2501 rel_pow_empty ~> relpow_empty:
2502 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2503 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2504 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2505 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2506 rel_pow_fun_conv ~> relpow_fun_conv
2507 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2508 rel_pow_finite_bounded ~> relpow_finite_bounded
2509 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2510 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2511 single_valued_rel_pow ~> single_valued_relpow
2515 * Theory Relation: Consolidated constant name for relation composition
2516 and corresponding theorem names:
2518 - Renamed constant rel_comp to relcomp.
2520 - Dropped abbreviation pred_comp. Use relcompp instead.
2524 rel_compI ~> relcompI
2525 rel_compEpair ~> relcompEpair
2526 rel_compE ~> relcompE
2527 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2528 rel_comp_empty1 ~> relcomp_empty1
2529 rel_comp_mono ~> relcomp_mono
2530 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2531 rel_comp_distrib ~> relcomp_distrib
2532 rel_comp_distrib2 ~> relcomp_distrib2
2533 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2534 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2535 single_valued_rel_comp ~> single_valued_relcomp
2536 rel_comp_def ~> relcomp_unfold
2537 converse_rel_comp ~> converse_relcomp
2538 pred_compI ~> relcomppI
2539 pred_compE ~> relcomppE
2540 pred_comp_bot1 ~> relcompp_bot1
2541 pred_comp_bot2 ~> relcompp_bot2
2542 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2543 pred_comp_mono ~> relcompp_mono
2544 pred_comp_distrib ~> relcompp_distrib
2545 pred_comp_distrib2 ~> relcompp_distrib2
2546 converse_pred_comp ~> converse_relcompp
2548 finite_rel_comp ~> finite_relcomp
2550 set_rel_comp ~> set_relcomp
2554 * Theory Divides: Discontinued redundant theorems about div and mod.
2555 INCOMPATIBILITY, use the corresponding generic theorems instead.
2557 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2558 zdiv_self ~> div_self
2559 zmod_self ~> mod_self
2562 zdiv_zmod_equality ~> div_mod_equality2
2563 zdiv_zmod_equality2 ~> div_mod_equality
2564 zmod_zdiv_trivial ~> mod_div_trivial
2565 zdiv_zminus_zminus ~> div_minus_minus
2566 zmod_zminus_zminus ~> mod_minus_minus
2567 zdiv_zminus2 ~> div_minus_right
2568 zmod_zminus2 ~> mod_minus_right
2569 zdiv_minus1_right ~> div_minus1_right
2570 zmod_minus1_right ~> mod_minus1_right
2571 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2572 zmod_zmult1_eq ~> mod_mult_right_eq
2573 zpower_zmod ~> power_mod
2574 zdvd_zmod ~> dvd_mod
2575 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2576 mod_mult_distrib ~> mult_mod_left
2577 mod_mult_distrib2 ~> mult_mod_right
2579 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2580 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2582 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2584 * Consolidated theorem names concerning fold combinators:
2586 inf_INFI_fold_inf ~> inf_INF_fold_inf
2587 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2588 INFI_fold_inf ~> INF_fold_inf
2589 SUPR_fold_sup ~> SUP_fold_sup
2590 union_set ~> union_set_fold
2591 minus_set ~> minus_set_fold
2592 INFI_set_fold ~> INF_set_fold
2593 SUPR_set_fold ~> SUP_set_fold
2594 INF_code ~> INF_set_foldr
2595 SUP_code ~> SUP_set_foldr
2596 foldr.simps ~> foldr.simps (in point-free formulation)
2597 foldr_fold_rev ~> foldr_conv_fold
2598 foldl_fold ~> foldl_conv_fold
2599 foldr_foldr ~> foldr_conv_foldl
2600 foldl_foldr ~> foldl_conv_foldr
2601 fold_set_remdups ~> fold_set_fold_remdups
2602 fold_set ~> fold_set_fold
2603 fold1_set ~> fold1_set_fold
2607 * Dropped rarely useful theorems concerning fold combinators:
2608 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2609 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2610 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2611 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2612 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2613 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2614 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2615 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2616 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2617 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2619 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2620 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2621 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2622 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2623 lemmas over fold rather than foldr, or make use of lemmas
2624 fold_conv_foldr and fold_rev.
2626 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2627 through option types.
2629 * "Transitive_Closure.ntrancl": bounded transitive closure on
2632 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2634 * Theory Int: Discontinued many legacy theorems specific to type int.
2635 INCOMPATIBILITY, use the corresponding generic theorems instead.
2637 zminus_zminus ~> minus_minus
2638 zminus_0 ~> minus_zero
2639 zminus_zadd_distrib ~> minus_add_distrib
2640 zadd_commute ~> add_commute
2641 zadd_assoc ~> add_assoc
2642 zadd_left_commute ~> add_left_commute
2645 zadd_0 ~> add_0_left
2646 zadd_0_right ~> add_0_right
2647 zadd_zminus_inverse2 ~> left_minus
2648 zmult_zminus ~> mult_minus_left
2649 zmult_commute ~> mult_commute
2650 zmult_assoc ~> mult_assoc
2651 zadd_zmult_distrib ~> left_distrib
2652 zadd_zmult_distrib2 ~> right_distrib
2653 zdiff_zmult_distrib ~> left_diff_distrib
2654 zdiff_zmult_distrib2 ~> right_diff_distrib
2655 zmult_1 ~> mult_1_left
2656 zmult_1_right ~> mult_1_right
2657 zle_refl ~> order_refl
2658 zle_trans ~> order_trans
2659 zle_antisym ~> order_antisym
2660 zle_linear ~> linorder_linear
2661 zless_linear ~> linorder_less_linear
2662 zadd_left_mono ~> add_left_mono
2663 zadd_strict_right_mono ~> add_strict_right_mono
2664 zadd_zless_mono ~> add_less_le_mono
2665 int_0_less_1 ~> zero_less_one
2666 int_0_neq_1 ~> zero_neq_one
2668 zpower_zadd_distrib ~> power_add
2669 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2670 zero_le_zpower_abs ~> zero_le_power_abs
2672 * Theory Deriv: Renamed
2674 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2676 * Theory Library/Multiset: Improved code generation of multisets.
2678 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2679 are expressed via type classes again. The special syntax
2680 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2681 setsum_set, which is now subsumed by Big_Operators.setsum.
2684 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2685 use theory HOL/Library/Nat_Bijection instead.
2687 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2688 trees is now inside a type class context. Names of affected
2689 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2690 theories working directly with raw red-black trees, adapt the names as
2694 bulkload -> rbt_bulkload
2695 del_from_left -> rbt_del_from_left
2696 del_from_right -> rbt_del_from_right
2698 delete -> rbt_delete
2700 insert -> rbt_insert
2701 insertw -> rbt_insert_with
2702 insert_with_key -> rbt_insert_with_key
2703 map_entry -> rbt_map_entry
2704 lookup -> rbt_lookup
2705 sorted -> rbt_sorted
2706 tree_greater -> rbt_greater
2707 tree_less -> rbt_less
2708 tree_less_symbol -> rbt_less_symbol
2710 union_with -> rbt_union_with
2711 union_with_key -> rbt_union_with_key
2714 balance_left_sorted -> balance_left_rbt_sorted
2715 balance_left_tree_greater -> balance_left_rbt_greater
2716 balance_left_tree_less -> balance_left_rbt_less
2717 balance_right_sorted -> balance_right_rbt_sorted
2718 balance_right_tree_greater -> balance_right_rbt_greater
2719 balance_right_tree_less -> balance_right_rbt_less
2720 balance_sorted -> balance_rbt_sorted
2721 balance_tree_greater -> balance_rbt_greater
2722 balance_tree_less -> balance_rbt_less
2723 bulkload_is_rbt -> rbt_bulkload_is_rbt
2724 combine_sorted -> combine_rbt_sorted
2725 combine_tree_greater -> combine_rbt_greater
2726 combine_tree_less -> combine_rbt_less
2727 delete_in_tree -> rbt_delete_in_tree
2728 delete_is_rbt -> rbt_delete_is_rbt
2729 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2730 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2731 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2732 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2733 del_in_tree -> rbt_del_in_tree
2734 del_inv1_inv2 -> rbt_del_inv1_inv2
2735 del_sorted -> rbt_del_rbt_sorted
2736 del_tree_greater -> rbt_del_rbt_greater
2737 del_tree_less -> rbt_del_rbt_less
2738 dom_lookup_Branch -> dom_rbt_lookup_Branch
2739 entries_lookup -> entries_rbt_lookup
2740 finite_dom_lookup -> finite_dom_rbt_lookup
2741 insert_sorted -> rbt_insert_rbt_sorted
2742 insertw_is_rbt -> rbt_insertw_is_rbt
2743 insertwk_is_rbt -> rbt_insertwk_is_rbt
2744 insertwk_sorted -> rbt_insertwk_rbt_sorted
2745 insertw_sorted -> rbt_insertw_rbt_sorted
2746 ins_sorted -> ins_rbt_sorted
2747 ins_tree_greater -> ins_rbt_greater
2748 ins_tree_less -> ins_rbt_less
2749 is_rbt_sorted -> is_rbt_rbt_sorted
2750 lookup_balance -> rbt_lookup_balance
2751 lookup_bulkload -> rbt_lookup_rbt_bulkload
2752 lookup_delete -> rbt_lookup_rbt_delete
2753 lookup_Empty -> rbt_lookup_Empty
2754 lookup_from_in_tree -> rbt_lookup_from_in_tree
2755 lookup_in_tree -> rbt_lookup_in_tree
2756 lookup_ins -> rbt_lookup_ins
2757 lookup_insert -> rbt_lookup_rbt_insert
2758 lookup_insertw -> rbt_lookup_rbt_insertw
2759 lookup_insertwk -> rbt_lookup_rbt_insertwk
2760 lookup_keys -> rbt_lookup_keys
2761 lookup_map -> rbt_lookup_map
2762 lookup_map_entry -> rbt_lookup_rbt_map_entry
2763 lookup_tree_greater -> rbt_lookup_rbt_greater
2764 lookup_tree_less -> rbt_lookup_rbt_less
2765 lookup_union -> rbt_lookup_rbt_union
2766 map_entry_color_of -> rbt_map_entry_color_of
2767 map_entry_inv1 -> rbt_map_entry_inv1
2768 map_entry_inv2 -> rbt_map_entry_inv2
2769 map_entry_is_rbt -> rbt_map_entry_is_rbt
2770 map_entry_sorted -> rbt_map_entry_rbt_sorted
2771 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2772 map_entry_tree_less -> rbt_map_entry_rbt_less
2773 map_tree_greater -> map_rbt_greater
2774 map_tree_less -> map_rbt_less
2775 map_sorted -> map_rbt_sorted
2776 paint_sorted -> paint_rbt_sorted
2777 paint_lookup -> paint_rbt_lookup
2778 paint_tree_greater -> paint_rbt_greater
2779 paint_tree_less -> paint_rbt_less
2780 sorted_entries -> rbt_sorted_entries
2781 tree_greater_eq_trans -> rbt_greater_eq_trans
2782 tree_greater_nit -> rbt_greater_nit
2783 tree_greater_prop -> rbt_greater_prop
2784 tree_greater_simps -> rbt_greater_simps
2785 tree_greater_trans -> rbt_greater_trans
2786 tree_less_eq_trans -> rbt_less_eq_trans
2787 tree_less_nit -> rbt_less_nit
2788 tree_less_prop -> rbt_less_prop
2789 tree_less_simps -> rbt_less_simps
2790 tree_less_trans -> rbt_less_trans
2791 tree_ord_props -> rbt_ord_props
2792 union_Branch -> rbt_union_Branch
2793 union_is_rbt -> rbt_union_is_rbt
2794 unionw_is_rbt -> rbt_unionw_is_rbt
2795 unionwk_is_rbt -> rbt_unionwk_is_rbt
2796 unionwk_sorted -> rbt_unionwk_rbt_sorted
2798 * Theory HOL/Library/Float: Floating point numbers are now defined as
2799 a subset of the real numbers. All operations are defined using the
2800 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2807 round_down -> float_round_down
2808 round_up -> float_round_up
2812 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2815 abs_float_def -> Float.compute_float_abs
2816 bitlen_ge0 -> bitlen_nonneg
2817 bitlen.simps -> Float.compute_bitlen
2818 float_components -> Float_mantissa_exponent
2819 float_divl.simps -> Float.compute_float_divl
2820 float_divr.simps -> Float.compute_float_divr
2821 float_eq_odd -> mult_powr_eq_mult_powr_iff
2822 float_power -> real_of_float_power
2823 lapprox_posrat_def -> Float.compute_lapprox_posrat
2824 lapprox_rat.simps -> Float.compute_lapprox_rat
2825 le_float_def' -> Float.compute_float_le
2826 le_float_def -> less_eq_float.rep_eq
2827 less_float_def' -> Float.compute_float_less
2828 less_float_def -> less_float.rep_eq
2829 normfloat_def -> Float.compute_normfloat
2830 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2831 normfloat -> normfloat_def
2832 normfloat_unique -> use normfloat_def
2833 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2834 one_float_def -> Float.compute_float_one
2835 plus_float_def -> Float.compute_float_plus
2836 rapprox_posrat_def -> Float.compute_rapprox_posrat
2837 rapprox_rat.simps -> Float.compute_rapprox_rat
2838 real_of_float_0 -> zero_float.rep_eq
2839 real_of_float_1 -> one_float.rep_eq
2840 real_of_float_abs -> abs_float.rep_eq
2841 real_of_float_add -> plus_float.rep_eq
2842 real_of_float_minus -> uminus_float.rep_eq
2843 real_of_float_mult -> times_float.rep_eq
2844 real_of_float_simp -> Float.rep_eq
2845 real_of_float_sub -> minus_float.rep_eq
2846 round_down.simps -> Float.compute_float_round_down
2847 round_up.simps -> Float.compute_float_round_up
2848 times_float_def -> Float.compute_float_times
2849 uminus_float_def -> Float.compute_float_uminus
2850 zero_float_def -> Float.compute_float_zero
2852 Lemmas not necessary anymore, use the transfer method:
2853 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2854 float_divr, float_le_simp, float_less1_mantissa_bound,
2855 float_less_simp, float_less_zero, float_le_zero,
2856 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2857 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2858 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2859 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2860 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2861 round_up, zero_le_float, zero_less_float
2863 * New theory HOL/Library/DAList provides an abstract type for
2864 association lists with distinct keys.
2866 * Session HOL/IMP: Added new theory of abstract interpretation of
2869 * Session HOL-Import: Re-implementation from scratch is faster,
2870 simpler, and more scalable. Requires a proof bundle, which is
2871 available as an external component. Discontinued old (and mostly
2872 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2874 * Session HOL-Word: Discontinued many redundant theorems specific to
2875 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2878 word_sub_alt ~> word_sub_wi
2879 word_add_alt ~> word_add_def
2880 word_mult_alt ~> word_mult_def
2881 word_minus_alt ~> word_minus_def
2882 word_0_alt ~> word_0_wi
2883 word_1_alt ~> word_1_wi
2884 word_add_0 ~> add_0_left
2885 word_add_0_right ~> add_0_right
2886 word_mult_1 ~> mult_1_left
2887 word_mult_1_right ~> mult_1_right
2888 word_add_commute ~> add_commute
2889 word_add_assoc ~> add_assoc
2890 word_add_left_commute ~> add_left_commute
2891 word_mult_commute ~> mult_commute
2892 word_mult_assoc ~> mult_assoc
2893 word_mult_left_commute ~> mult_left_commute
2894 word_left_distrib ~> left_distrib
2895 word_right_distrib ~> right_distrib
2896 word_left_minus ~> left_minus
2897 word_diff_0_right ~> diff_0_right
2898 word_diff_self ~> diff_self
2899 word_sub_def ~> diff_minus
2900 word_diff_minus ~> diff_minus
2901 word_add_ac ~> add_ac
2902 word_mult_ac ~> mult_ac
2903 word_plus_ac0 ~> add_0_left add_0_right add_ac
2904 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2905 word_order_trans ~> order_trans
2906 word_order_refl ~> order_refl
2907 word_order_antisym ~> order_antisym
2908 word_order_linear ~> linorder_linear
2909 lenw1_zero_neq_one ~> zero_neq_one
2910 word_number_of_eq ~> number_of_eq
2911 word_of_int_add_hom ~> wi_hom_add
2912 word_of_int_sub_hom ~> wi_hom_sub
2913 word_of_int_mult_hom ~> wi_hom_mult
2914 word_of_int_minus_hom ~> wi_hom_neg
2915 word_of_int_succ_hom ~> wi_hom_succ
2916 word_of_int_pred_hom ~> wi_hom_pred
2917 word_of_int_0_hom ~> word_0_wi
2918 word_of_int_1_hom ~> word_1_wi
2920 * Session HOL-Word: New proof method "word_bitwise" for splitting
2921 machine word equalities and inequalities into logical circuits,
2922 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2923 multiplication, shifting by constants, bitwise operators and numeric
2924 constants. Requires fixed-length word types, not 'a word. Solves
2925 many standard word identities outright and converts more into first
2926 order problems amenable to blast or similar. See also examples in
2927 HOL/Word/Examples/WordExamples.thy.
2929 * Session HOL-Probability: Introduced the type "'a measure" to
2930 represent measures, this replaces the records 'a algebra and 'a
2931 measure_space. The locales based on subset_class now have two
2932 locale-parameters the space \<Omega> and the set of measurable sets M.
2933 The product of probability spaces uses now the same constant as the
2934 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2935 measure". Most constants are defined now outside of locales and gain
2936 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2937 Measure space constructions for distributions and densities now got
2938 their own constants distr and density. Instead of using locales to
2939 describe measure spaces with a finite space, the measure count_space
2940 and point_measure is introduced. INCOMPATIBILITY.
2944 finite_measure.\<mu>' -> measure
2945 product_algebra_generator -> prod_algebra
2946 product_prob_space.emb -> prod_emb
2947 product_prob_space.infprod_algebra -> PiM
2950 completeable_measure_space
2951 finite_measure_space
2953 finite_product_finite_prob_space
2954 finite_product_sigma_algebra
2955 finite_sigma_algebra
2957 pair_finite_prob_space
2958 pair_finite_sigma_algebra
2961 product_sigma_algebra
2965 distribution -> use distr measure, or distributed predicate
2967 joint_distribution -> use distr measure, or distributed predicate
2968 pair_measure_generator
2969 product_prob_space.infprod_algebra -> use PiM
2972 Replacement theorems:
2973 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2974 finite_measure.empty_measure -> measure_empty
2975 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2976 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2977 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2978 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2979 finite_measure.finite_measure -> finite_measure.emeasure_finite
2980 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2981 finite_measure.positive_measure' -> measure_nonneg
2982 finite_measure.real_measure -> finite_measure.emeasure_real
2983 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2984 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2985 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2986 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2987 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2988 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2989 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2990 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2991 information_space.entropy_commute -> information_space.entropy_commute_simple
2992 information_space.entropy_eq -> information_space.entropy_simple_distributed
2993 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2994 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2995 information_space.entropy_uniform_max -> information_space.entropy_uniform
2996 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2997 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2998 information_space.KL_ge_0 -> information_space.KL_nonneg
2999 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
3000 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
3001 Int_stable_cuboids -> Int_stable_atLeastAtMost
3002 Int_stable_product_algebra_generator -> positive_integral
3003 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
3004 measure_space.additive -> emeasure_additive
3005 measure_space.AE_iff_null_set -> AE_iff_null
3006 measure_space.almost_everywhere_def -> eventually_ae_filter
3007 measure_space.almost_everywhere_vimage -> AE_distrD
3008 measure_space.continuity_from_above -> INF_emeasure_decseq
3009 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
3010 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
3011 measure_space.continuity_from_below -> SUP_emeasure_incseq
3012 measure_space_density -> emeasure_density
3013 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
3014 measure_space.integrable_vimage -> integrable_distr
3015 measure_space.integral_translated_density -> integral_density
3016 measure_space.integral_vimage -> integral_distr
3017 measure_space.measure_additive -> plus_emeasure
3018 measure_space.measure_compl -> emeasure_compl
3019 measure_space.measure_countable_increasing -> emeasure_countable_increasing
3020 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
3021 measure_space.measure_decseq -> decseq_emeasure
3022 measure_space.measure_Diff -> emeasure_Diff
3023 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
3024 measure_space.measure_eq_0 -> emeasure_eq_0
3025 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
3026 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
3027 measure_space.measure_incseq -> incseq_emeasure
3028 measure_space.measure_insert -> emeasure_insert
3029 measure_space.measure_mono -> emeasure_mono
3030 measure_space.measure_not_negative -> emeasure_not_MInf
3031 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
3032 measure_space.measure_setsum -> setsum_emeasure
3033 measure_space.measure_setsum_split -> setsum_emeasure_cover
3034 measure_space.measure_space_vimage -> emeasure_distr
3035 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
3036 measure_space.measure_subadditive -> subadditive
3037 measure_space.measure_top -> emeasure_space
3038 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
3039 measure_space.measure_Un_null_set -> emeasure_Un_null_set
3040 measure_space.positive_integral_translated_density -> positive_integral_density
3041 measure_space.positive_integral_vimage -> positive_integral_distr
3042 measure_space.real_continuity_from_above -> Lim_measure_decseq
3043 measure_space.real_continuity_from_below -> Lim_measure_incseq
3044 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
3045 measure_space.real_measure_Diff -> measure_Diff
3046 measure_space.real_measure_finite_Union -> measure_finite_Union
3047 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
3048 measure_space.real_measure_subadditive -> measure_subadditive
3049 measure_space.real_measure_Union -> measure_Union
3050 measure_space.real_measure_UNION -> measure_UNION
3051 measure_space.simple_function_vimage -> simple_function_comp
3052 measure_space.simple_integral_vimage -> simple_integral_distr
3053 measure_space.simple_integral_vimage -> simple_integral_distr
3054 measure_unique_Int_stable -> measure_eqI_generator_eq
3055 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
3056 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
3057 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
3058 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
3059 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
3060 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
3061 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
3062 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
3063 pair_sigma_algebra.sets_swap -> sets_pair_swap
3064 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
3065 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
3066 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
3067 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
3068 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
3069 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
3070 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
3071 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
3072 prob_space.measure_space_1 -> prob_space.emeasure_space_1
3073 prob_space.prob_space_vimage -> prob_space_distr
3074 prob_space.random_variable_restrict -> measurable_restrict
3075 prob_space_unique_Int_stable -> measure_eqI_prob_space
3076 product_algebraE -> prod_algebraE_all
3077 product_algebra_generator_der -> prod_algebra_eq_finite
3078 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3079 product_algebraI -> sets_PiM_I_finite
3080 product_measure_exists -> product_sigma_finite.sigma_finite
3081 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3082 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3083 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3084 product_prob_space.measurable_component -> measurable_component_singleton
3085 product_prob_space.measurable_emb -> measurable_prod_emb
3086 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3087 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3088 product_prob_space.measure_emb -> emeasure_prod_emb
3089 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3090 product_sigma_algebra.product_algebra_into_space -> space_closed
3091 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3092 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3093 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3094 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3095 sets_product_algebra -> sets_PiM
3096 sigma_algebra.measurable_sigma -> measurable_measure_of
3097 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3098 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3099 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3100 space_product_algebra -> space_PiM
3102 * Session HOL-TPTP: support to parse and import TPTP problems (all
3103 languages) into Isabelle/HOL.
3108 * New "case_product" attribute (see HOL).
3113 * Greater support for structured proofs involving induction or case
3116 * Much greater use of mathematical symbols.
3118 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3123 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3124 from a minor keyword introduced via theory header declaration.
3126 * Antiquotation @{command_spec "name"} produces the
3127 Outer_Syntax.command_spec from a major keyword introduced via theory
3128 header declaration; it can be passed to Outer_Syntax.command etc.
3130 * Local_Theory.define no longer hard-wires default theorem name
3131 "foo_def", but retains the binding as given. If that is Binding.empty
3132 / Attrib.empty_binding, the result is not registered as user-level
3133 fact. The Local_Theory.define_internal variant allows to specify a
3134 non-empty name (used for the foundation in the background theory),
3135 while omitting the fact binding in the user-context. Potential
3136 INCOMPATIBILITY for derived definitional packages: need to specify
3137 naming policy for primitive definitions more explicitly.
3139 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3140 conformance with similar operations in structure Term and Logic.
3142 * Antiquotation @{attributes [...]} embeds attribute source
3143 representation into the ML text, which is particularly useful with
3144 declarations like Local_Theory.note.
3146 * Structure Proof_Context follows standard naming scheme. Old
3147 ProofContext has been discontinued. INCOMPATIBILITY.
3149 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3150 change of semantics: update is applied to auxiliary local theory
3153 * Modernized some old-style infix operations:
3155 addeqcongs ~> Simplifier.add_eqcong
3156 deleqcongs ~> Simplifier.del_eqcong
3157 addcongs ~> Simplifier.add_cong
3158 delcongs ~> Simplifier.del_cong
3159 setmksimps ~> Simplifier.set_mksimps
3160 setmkcong ~> Simplifier.set_mkcong
3161 setmksym ~> Simplifier.set_mksym
3162 setmkeqTrue ~> Simplifier.set_mkeqTrue
3163 settermless ~> Simplifier.set_termless
3164 setsubgoaler ~> Simplifier.set_subgoaler
3165 addsplits ~> Splitter.add_split
3166 delsplits ~> Splitter.del_split
3171 * USER_HOME settings variable points to cross-platform user home
3172 directory, which coincides with HOME on POSIX systems only. Likewise,
3173 the Isabelle path specification "~" now expands to $USER_HOME, instead
3174 of former $HOME. A different default for USER_HOME may be set
3175 explicitly in shell environment, before Isabelle settings are
3176 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3177 the generic user home was intended.
3179 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3180 notation, which is useful for the jEdit file browser, for example.
3182 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3187 New in Isabelle2011-1 (October 2011)
3188 ------------------------------------
3192 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3193 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3195 - Management of multiple theory files directly from the editor
3196 buffer store -- bypassing the file-system (no requirement to save
3197 files for checking).
3199 - Markup of formal entities within the text buffer, with semantic
3200 highlighting, tooltips and hyperlinks to jump to defining source
3203 - Improved text rendering, with sub/superscripts in the source
3204 buffer (including support for copy/paste wrt. output panel, HTML
3205 theory output and other non-Isabelle text boxes).
3207 - Refined scheduling of proof checking and printing of results,
3208 based on interactive editor view. (Note: jEdit folding and
3209 narrowing allows to restrict buffer perspectives explicitly.)
3211 - Reduced CPU performance requirements, usable on machines with few
3214 - Reduced memory requirements due to pruning of unused document
3215 versions (garbage collection).
3217 See also ~~/src/Tools/jEdit/README.html for further information,
3218 including some remaining limitations.
3220 * Theory loader: source files are exclusively located via the master
3221 directory of each theory node (where the .thy file itself resides).
3222 The global load path (such as src/HOL/Library) has been discontinued.
3223 Note that the path element ~~ may be used to reference theories in the
3224 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3227 * Theory loader: source files are identified by content via SHA1
3228 digests. Discontinued former path/modtime identification and optional
3229 ISABELLE_FILE_IDENT plugin scripts.
3231 * Parallelization of nested Isar proofs is subject to
3232 Goal.parallel_proofs_threshold (default 100). See also isabelle
3235 * Name space: former unsynchronized references are now proper
3236 configuration options, with more conventional names:
3238 long_names ~> names_long
3239 short_names ~> names_short
3240 unique_names ~> names_unique
3242 Minor INCOMPATIBILITY, need to declare options in context like this:
3244 declare [[names_unique = false]]
3246 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3247 that the result needs to be unique, which means fact specifications
3248 may have to be refined after enriching a proof context.
3250 * Attribute "case_names" has been refined: the assumptions in each case
3251 can be named now by following the case name with [name1 name2 ...].
3253 * Isabelle/Isar reference manual has been updated and extended:
3254 - "Synopsis" provides a catalog of main Isar language concepts.
3255 - Formal references in syntax diagrams, via @{rail} antiquotation.
3256 - Updated material from classic "ref" manual, notably about
3257 "Classical Reasoner".
3262 * Class bot and top require underlying partial order rather than
3263 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3265 * Class complete_lattice: generalized a couple of lemmas from sets;
3266 generalized theorems INF_cong and SUP_cong. New type classes for
3267 complete boolean algebras and complete linear orders. Lemmas
3268 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3269 class complete_linorder.
3271 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3272 Sup_fun_def, Inf_apply, Sup_apply.
3274 Removed redundant lemmas (the right hand side gives hints how to
3275 replace them for (metis ...), or (simp only: ...) proofs):
3277 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3278 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3279 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3280 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3281 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3282 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3283 Inter_def ~> INF_def, image_def
3284 Union_def ~> SUP_def, image_def
3285 INT_eq ~> INF_def, and image_def
3286 UN_eq ~> SUP_def, and image_def
3287 INF_subset ~> INF_superset_mono [OF _ order_refl]
3289 More consistent and comprehensive names:
3291 INTER_eq_Inter_image ~> INF_def
3292 UNION_eq_Union_image ~> SUP_def
3295 INF_leI ~> INF_lower
3296 INF_leI2 ~> INF_lower2
3297 le_INFI ~> INF_greatest
3298 le_SUPI ~> SUP_upper
3299 le_SUPI2 ~> SUP_upper2
3300 SUP_leI ~> SUP_least
3301 INFI_bool_eq ~> INF_bool_eq
3302 SUPR_bool_eq ~> SUP_bool_eq
3303 INFI_apply ~> INF_apply
3304 SUPR_apply ~> SUP_apply
3305 INTER_def ~> INTER_eq
3306 UNION_def ~> UNION_eq
3310 * Renamed theory Complete_Lattice to Complete_Lattices.
3313 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3314 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3315 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3316 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3318 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3319 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3320 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3323 * Added syntactic classes "inf" and "sup" for the respective
3324 constants. INCOMPATIBILITY: Changes in the argument order of the
3325 (mostly internal) locale predicates for some derived classes.
3327 * Theorem collections ball_simps and bex_simps do not contain theorems
3328 referring to UNION any longer; these have been moved to collection
3329 UN_ball_bex_simps. INCOMPATIBILITY.
3331 * Theory Archimedean_Field: floor now is defined as parameter of a
3332 separate type class floor_ceiling.
3334 * Theory Finite_Set: more coherent development of fold_set locales:
3336 locale fun_left_comm ~> locale comp_fun_commute
3337 locale fun_left_comm_idem ~> locale comp_fun_idem
3339 Both use point-free characterization; interpretation proofs may need
3340 adjustment. INCOMPATIBILITY.
3342 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3343 accordance with standard mathematical terminology. INCOMPATIBILITY.
3345 * Theory Complex_Main: The locale interpretations for the
3346 bounded_linear and bounded_bilinear locales have been removed, in
3347 order to reduce the number of duplicate lemmas. Users must use the
3348 original names for distributivity theorems, potential INCOMPATIBILITY.
3350 divide.add ~> add_divide_distrib
3351 divide.diff ~> diff_divide_distrib
3352 divide.setsum ~> setsum_divide_distrib
3353 mult.add_right ~> right_distrib
3354 mult.diff_right ~> right_diff_distrib
3355 mult_right.setsum ~> setsum_right_distrib
3356 mult_left.diff ~> left_diff_distrib
3358 * Theory Complex_Main: Several redundant theorems have been removed or
3359 replaced by more general versions. INCOMPATIBILITY.
3361 real_diff_def ~> minus_real_def
3362 real_divide_def ~> divide_real_def
3363 real_less_def ~> less_le
3364 real_abs_def ~> abs_real_def
3365 real_sgn_def ~> sgn_real_def
3366 real_mult_commute ~> mult_commute
3367 real_mult_assoc ~> mult_assoc
3368 real_mult_1 ~> mult_1_left
3369 real_add_mult_distrib ~> left_distrib
3370 real_zero_not_eq_one ~> zero_neq_one
3371 real_mult_inverse_left ~> left_inverse
3372 INVERSE_ZERO ~> inverse_zero
3373 real_le_refl ~> order_refl
3374 real_le_antisym ~> order_antisym
3375 real_le_trans ~> order_trans
3376 real_le_linear ~> linear
3377 real_le_eq_diff ~> le_iff_diff_le_0
3378 real_add_left_mono ~> add_left_mono
3379 real_mult_order ~> mult_pos_pos
3380 real_mult_less_mono2 ~> mult_strict_left_mono
3381 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3382 real_0_le_divide_iff ~> zero_le_divide_iff
3383 realpow_two_disj ~> power2_eq_iff
3384 real_squared_diff_one_factored ~> square_diff_one_factored
3385 realpow_two_diff ~> square_diff_square_factored
3386 reals_complete2 ~> complete_real
3387 real_sum_squared_expand ~> power2_sum
3388 exp_ln_eq ~> ln_unique
3390 expi_zero ~> exp_zero
3391 lemma_DERIV_subst ~> DERIV_cong
3392 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3393 LIMSEQ_const ~> tendsto_const
3394 LIMSEQ_norm ~> tendsto_norm
3395 LIMSEQ_add ~> tendsto_add
3396 LIMSEQ_minus ~> tendsto_minus
3397 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3398 LIMSEQ_diff ~> tendsto_diff
3399 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3400 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3401 LIMSEQ_mult ~> tendsto_mult
3402 LIMSEQ_inverse ~> tendsto_inverse
3403 LIMSEQ_divide ~> tendsto_divide
3404 LIMSEQ_pow ~> tendsto_power
3405 LIMSEQ_setsum ~> tendsto_setsum
3406 LIMSEQ_setprod ~> tendsto_setprod
3407 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3408 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3409 LIMSEQ_imp_rabs ~> tendsto_rabs
3410 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3411 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3412 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3413 LIMSEQ_Complex ~> tendsto_Complex
3414 LIM_ident ~> tendsto_ident_at
3415 LIM_const ~> tendsto_const
3416 LIM_add ~> tendsto_add
3417 LIM_add_zero ~> tendsto_add_zero
3418 LIM_minus ~> tendsto_minus
3419 LIM_diff ~> tendsto_diff
3420 LIM_norm ~> tendsto_norm
3421 LIM_norm_zero ~> tendsto_norm_zero
3422 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3423 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3424 LIM_rabs ~> tendsto_rabs
3425 LIM_rabs_zero ~> tendsto_rabs_zero
3426 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3427 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3428 LIM_compose ~> tendsto_compose
3429 LIM_mult ~> tendsto_mult
3430 LIM_scaleR ~> tendsto_scaleR
3431 LIM_of_real ~> tendsto_of_real
3432 LIM_power ~> tendsto_power
3433 LIM_inverse ~> tendsto_inverse
3434 LIM_sgn ~> tendsto_sgn
3435 isCont_LIM_compose ~> isCont_tendsto_compose
3436 bounded_linear.LIM ~> bounded_linear.tendsto
3437 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3438 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3439 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3440 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3441 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3442 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3444 * Theory Complex_Main: The definition of infinite series was
3445 generalized. Now it is defined on the type class {topological_space,
3446 comm_monoid_add}. Hence it is useable also for extended real numbers.
3448 * Theory Complex_Main: The complex exponential function "expi" is now
3449 a type-constrained abbreviation for "exp :: complex => complex"; thus
3450 several polymorphic lemmas about "exp" are now applicable to "expi".
3454 - Theory Library/Code_Char_ord provides native ordering of
3455 characters in the target language.
3457 - Commands code_module and code_library are legacy, use export_code
3460 - Method "evaluation" is legacy, use method "eval" instead.
3462 - Legacy evaluator "SML" is deactivated by default. May be
3463 reactivated by the following theory command:
3465 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3467 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3469 * New proof method "induction" that gives induction hypotheses the
3470 name "IH", thus distinguishing them from further hypotheses that come
3471 from rule induction. The latter are still called "hyps". Method
3472 "induction" is a thin wrapper around "induct" and follows the same
3475 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3476 still available as a legacy feature for some time.
3479 - Added "need" and "total_consts" options.
3480 - Reintroduced "show_skolems" option by popular demand.
3481 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3485 - Use quasi-sound (and efficient) translations by default.
3486 - Added support for the following provers: E-ToFoF, LEO-II,
3487 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3488 - Automatically preplay and minimize proofs before showing them if
3489 this can be done within reasonable time.
3490 - sledgehammer available_provers ~> sledgehammer supported_provers.
3492 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3493 "max_mono_iters", and "max_new_mono_instances" options.
3494 - Removed "explicit_apply" and "full_types" options as well as "Full
3495 Types" Proof General menu item. INCOMPATIBILITY.
3498 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3499 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3503 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3504 "elim:" options. INCOMPATIBILITY.
3505 - Introduced 'try' that not only runs 'try_methods' but also
3506 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3509 - Added "eval" option to evaluate terms for the found counterexample
3510 (currently only supported by the default (exhaustive) tester).
3511 - Added post-processing of terms to obtain readable counterexamples
3512 (currently only supported by the default (exhaustive) tester).
3513 - New counterexample generator quickcheck[narrowing] enables
3514 narrowing-based testing. Requires the Glasgow Haskell compiler
3515 with its installation location defined in the Isabelle settings
3516 environment as ISABELLE_GHC.
3517 - Removed quickcheck tester "SML" based on the SML code generator
3518 (formly in HOL/Library).
3520 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3521 use 'partial_function' instead.
3523 * Theory Library/Extended_Reals replaces now the positive extended
3524 reals found in probability theory. This file is extended by
3525 Multivariate_Analysis/Extended_Real_Limits.
3527 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3528 from where it must be imported explicitly if it is really required.
3531 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3532 been moved here. INCOMPATIBILITY.
3534 * Theory Library/Saturated provides type of numbers with saturated
3537 * Theory Library/Product_Lattice defines a pointwise ordering for the
3538 product type 'a * 'b, and provides instance proofs for various order
3539 and lattice type classes.
3541 * Theory Library/Countable now provides the "countable_datatype" proof
3542 method for proving "countable" class instances for datatypes.
3544 * Theory Library/Cset_Monad allows do notation for computable sets
3545 (cset) via the generic monad ad-hoc overloading facility.
3547 * Library: Theories of common data structures are split into theories
3548 for implementation, an invariant-ensuring type, and connection to an
3549 abstract type. INCOMPATIBILITY.
3551 - RBT is split into RBT and RBT_Mapping.
3552 - AssocList is split and renamed into AList and AList_Mapping.
3553 - DList is split into DList_Impl, DList, and DList_Cset.
3554 - Cset is split into Cset and List_Cset.
3556 * Theory Library/Nat_Infinity has been renamed to
3557 Library/Extended_Nat, with name changes of the following types and
3560 type inat ~> type enat
3562 Infty ~> infinity (overloaded)
3566 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3567 been renamed accordingly. INCOMPATIBILITY.
3569 * Session Multivariate_Analysis: The euclidean_space type class now
3570 fixes a constant "Basis :: 'a set" consisting of the standard
3571 orthonormal basis for the type. Users now have the option of
3572 quantifying over this set instead of using the "basis" function, e.g.
3573 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3575 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3576 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3577 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3578 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3579 changed to match. Definition theorems for overloaded constants now use
3580 the standard "foo_vec_def" naming scheme. A few other theorems have
3581 been renamed as follows (INCOMPATIBILITY):
3583 Cart_eq ~> vec_eq_iff
3584 dist_nth_le_cart ~> dist_vec_nth_le
3585 tendsto_vector ~> vec_tendstoI
3586 Cauchy_vector ~> vec_CauchyI
3588 * Session Multivariate_Analysis: Several duplicate theorems have been
3589 removed, and other theorems have been renamed or replaced with more
3590 general versions. INCOMPATIBILITY.
3592 finite_choice ~> finite_set_choice
3593 eventually_conjI ~> eventually_conj
3594 eventually_and ~> eventually_conj_iff
3595 eventually_false ~> eventually_False
3596 setsum_norm ~> norm_setsum
3597 Lim_sequentially ~> LIMSEQ_def
3598 Lim_ident_at ~> LIM_ident
3599 Lim_const ~> tendsto_const
3600 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3601 Lim_neg ~> tendsto_minus
3602 Lim_add ~> tendsto_add
3603 Lim_sub ~> tendsto_diff
3604 Lim_mul ~> tendsto_scaleR
3605 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3606 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3607 Lim_linear ~> bounded_linear.tendsto
3608 Lim_component ~> tendsto_euclidean_component
3609 Lim_component_cart ~> tendsto_vec_nth
3610 Lim_inner ~> tendsto_inner [OF tendsto_const]
3611 dot_lsum ~> inner_setsum_left
3612 dot_rsum ~> inner_setsum_right
3613 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3614 continuous_neg ~> continuous_minus
3615 continuous_sub ~> continuous_diff
3616 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3617 continuous_mul ~> continuous_scaleR
3618 continuous_inv ~> continuous_inverse
3619 continuous_at_within_inv ~> continuous_at_within_inverse
3620 continuous_at_inv ~> continuous_at_inverse
3621 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3622 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3623 continuous_at_component ~> continuous_component [OF continuous_at_id]
3624 continuous_on_neg ~> continuous_on_minus
3625 continuous_on_sub ~> continuous_on_diff
3626 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3627 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3628 continuous_on_mul ~> continuous_on_scaleR
3629 continuous_on_mul_real ~> continuous_on_mult
3630 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3631 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3632 continuous_on_inverse ~> continuous_on_inv
3633 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3634 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3635 subset_interior ~> interior_mono
3636 subset_closure ~> closure_mono
3637 closure_univ ~> closure_UNIV
3638 real_arch_lt ~> reals_Archimedean2
3639 real_arch ~> reals_Archimedean3
3640 real_abs_norm ~> abs_norm_cancel
3641 real_abs_sub_norm ~> norm_triangle_ineq3
3642 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3644 * Session HOL-Probability:
3645 - Caratheodory's extension lemma is now proved for ring_of_sets.
3646 - Infinite products of probability measures are now available.
3647 - Sigma closure is independent, if the generator is independent
3648 - Use extended reals instead of positive extended
3649 reals. INCOMPATIBILITY.
3651 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3653 expand_fun_below ~> fun_below_iff
3654 below_fun_ext ~> fun_belowI
3655 expand_cfun_eq ~> cfun_eq_iff
3656 ext_cfun ~> cfun_eqI
3657 expand_cfun_below ~> cfun_below_iff
3658 below_cfun_ext ~> cfun_belowI
3659 monofun_fun_fun ~> fun_belowD
3660 monofun_fun_arg ~> monofunE
3661 monofun_lub_fun ~> adm_monofun [THEN admD]
3662 cont_lub_fun ~> adm_cont [THEN admD]
3663 cont2cont_Rep_CFun ~> cont2cont_APP
3664 cont_Rep_CFun_app ~> cont_APP_app
3665 cont_Rep_CFun_app_app ~> cont_APP_app_app
3666 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3667 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3668 contlub_cfun ~> lub_APP [symmetric]
3669 contlub_LAM ~> lub_LAM [symmetric]
3672 lift_distinct1 ~> lift.distinct(1)
3673 lift_distinct2 ~> lift.distinct(2)
3674 Def_not_UU ~> lift.distinct(2)
3675 Def_inject ~> lift.inject
3676 below_UU_iff ~> below_bottom_iff
3677 eq_UU_iff ~> eq_bottom_iff
3680 *** Document preparation ***
3682 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3683 isar-ref manual, both for description and actual application of the
3686 * Antiquotation @{value} evaluates the given term and presents its
3689 * Antiquotations: term style "isub" provides ad-hoc conversion of
3690 variables x1, y23 into subscripted form x\<^isub>1,
3691 y\<^isub>2\<^isub>3.
3693 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3694 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3696 * Localized \isabellestyle switch can be used within blocks or groups
3699 \isabellestyle{it} %preferred default
3700 {\isabellestylett @{text "typewriter stuff"}}
3702 * Discontinued special treatment of hard tabulators. Implicit
3703 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3709 * The inner syntax of sort/type/term/prop supports inlined YXML
3710 representations within quoted string tokens. By encoding logical
3711 entities via Term_XML (in ML or Scala) concrete syntax can be
3712 bypassed, which is particularly useful for producing bits of text
3713 under external program control.
3715 * Antiquotations for ML and document preparation are managed as theory
3716 data, which requires explicit setup.
3718 * Isabelle_Process.is_active allows tools to check if the official
3719 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3720 (better known as Proof General).
3722 * Structure Proof_Context follows standard naming scheme. Old
3723 ProofContext is still available for some time as legacy alias.
3725 * Structure Timing provides various operations for timing; supersedes
3726 former start_timing/end_timing etc.
3728 * Path.print is the official way to show file-system paths to users
3729 (including quotes etc.).
3731 * Inner syntax: identifiers in parse trees of generic categories
3732 "logic", "aprop", "idt" etc. carry position information (disguised as
3733 type constraints). Occasional INCOMPATIBILITY with non-compliant
3734 translations that choke on unexpected type constraints. Positions can
3735 be stripped in ML translations via Syntax.strip_positions /
3736 Syntax.strip_positions_ast, or via the syntax constant
3737 "_strip_positions" within parse trees. As last resort, positions can
3738 be disabled via the configuration option Syntax.positions, which is
3739 called "syntax_positions" in Isar attribute syntax.
3741 * Discontinued special status of various ML structures that contribute
3742 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3743 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3744 refer directly to Ast.Constant, Lexicon.is_identifier,
3745 Syntax_Trans.mk_binder_tr etc.
3747 * Typed print translation: discontinued show_sorts argument, which is
3748 already available via context of "advanced" translation.
3750 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3751 goal states; body tactic needs to address all subgoals uniformly.
3753 * Slightly more special eq_list/eq_set, with shortcut involving
3754 pointer equality (assumes that eq relation is reflexive).
3756 * Classical tactics use proper Proof.context instead of historic types
3757 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3758 operate directly on Proof.context. Raw type claset retains its use as
3759 snapshot of the classical context, which can be recovered via
3760 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3761 INCOMPATIBILITY, classical tactics and derived proof methods require
3762 proper Proof.context.
3767 * Discontinued support for Poly/ML 5.2, which was the last version
3768 without proper multithreading and TimeLimit implementation.
3770 * Discontinued old lib/scripts/polyml-platform, which has been
3771 obsolete since Isabelle2009-2.
3773 * Various optional external tools are referenced more robustly and
3774 uniformly by explicit Isabelle settings as follows:
3776 ISABELLE_CSDP (formerly CSDP_EXE)
3777 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3778 ISABELLE_OCAML (formerly EXEC_OCAML)
3779 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3780 ISABELLE_YAP (formerly EXEC_YAP)
3782 Note that automated detection from the file-system or search path has
3783 been discontinued. INCOMPATIBILITY.
3785 * Scala layer provides JVM method invocation service for static
3786 methods of type (String)String, see Invoke_Scala.method in ML. For
3789 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3791 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3792 this allows to pass structured values between ML and Scala.
3794 * The IsabelleText fonts includes some further glyphs to support the
3795 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3796 installed a local copy (which is normally *not* required) need to
3797 delete or update it from ~~/lib/fonts/.
3801 New in Isabelle2011 (January 2011)
3802 ----------------------------------
3806 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3807 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3808 useful tooltips and hyperlinks produced from its static analysis. The
3809 bundled component provides an executable Isabelle tool that can be run
3812 Isabelle2011/bin/isabelle jedit
3814 * Significantly improved Isabelle/Isar implementation manual.
3816 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3817 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3818 while the default heap location within that directory lacks that extra
3819 suffix. This isolates multiple Isabelle installations from each
3820 other, avoiding problems with old settings in new versions.
3821 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3823 * Source files are always encoded as UTF-8, instead of old-fashioned
3824 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3825 the following package declarations:
3827 \usepackage[utf8]{inputenc}
3828 \usepackage{textcomp}
3830 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3831 a Unicode character is treated as a single symbol, not a sequence of
3832 non-ASCII bytes as before. Since Isabelle/ML string literals may
3833 contain symbols without further backslash escapes, Unicode can now be
3834 used here as well. Recall that Symbol.explode in ML provides a
3835 consistent view on symbols, while raw explode (or String.explode)
3836 merely give a byte-oriented representation.
3838 * Theory loader: source files are primarily located via the master
3839 directory of each theory node (where the .thy file itself resides).
3840 The global load path is still partially available as legacy feature.
3841 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3842 explicit paths, relatively to the theory.
3844 * Special treatment of ML file names has been discontinued.
3845 Historically, optional extensions .ML or .sml were added on demand --
3846 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3847 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3849 * Various options that affect pretty printing etc. are now properly
3850 handled within the context via configuration options, instead of
3851 unsynchronized references or print modes. There are both ML Config.T
3852 entities and Isar declaration attributes to access these.
3854 ML (Config.T) Isar (attribute)
3856 eta_contract eta_contract
3857 show_brackets show_brackets
3858 show_sorts show_sorts
3859 show_types show_types
3860 show_question_marks show_question_marks
3861 show_consts show_consts
3862 show_abbrevs show_abbrevs
3864 Syntax.ast_trace syntax_ast_trace
3865 Syntax.ast_stat syntax_ast_stat
3866 Syntax.ambiguity_level syntax_ambiguity_level
3868 Goal_Display.goals_limit goals_limit
3869 Goal_Display.show_main_goal show_main_goal
3871 Method.rule_trace rule_trace
3873 Thy_Output.display thy_output_display
3874 Thy_Output.quotes thy_output_quotes
3875 Thy_Output.indent thy_output_indent
3876 Thy_Output.source thy_output_source
3877 Thy_Output.break thy_output_break
3879 Note that corresponding "..._default" references in ML may only be
3880 changed globally at the ROOT session setup, but *not* within a theory.
3881 The option "show_abbrevs" supersedes the former print mode
3882 "no_abbrevs" with inverted meaning.
3884 * More systematic naming of some configuration options.
3887 trace_simp ~> simp_trace
3888 debug_simp ~> simp_debug
3890 * Support for real valued configuration options, using simplistic
3891 floating-point notation that coincides with the inner syntax for
3894 * Support for real valued preferences (with approximative PGIP type):
3895 front-ends need to accept "pgint" values in float notation.
3898 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3901 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3906 * Command 'type_synonym' (with single argument) replaces somewhat
3907 outdated 'types', which is still available as legacy feature for some
3910 * Command 'nonterminal' (with 'and' separated list of arguments)
3911 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3913 * Command 'notepad' replaces former 'example_proof' for
3914 experimentation in Isar without any result. INCOMPATIBILITY.
3916 * Locale interpretation commands 'interpret' and 'sublocale' accept
3917 lists of equations to map definitions in a locale to appropriate
3918 entities in the context of the interpretation. The 'interpretation'
3919 command already provided this functionality.
3921 * Diagnostic command 'print_dependencies' prints the locale instances
3922 that would be activated if the specified expression was interpreted in
3923 the current context. Variant "print_dependencies!" assumes a context
3924 without interpretations.
3926 * Diagnostic command 'print_interps' prints interpretations in proofs
3927 in addition to interpretations in theories.
3929 * Discontinued obsolete 'global' and 'local' commands to manipulate
3930 the theory name space. Rare INCOMPATIBILITY. The ML functions
3931 Sign.root_path and Sign.local_path may be applied directly where this
3932 feature is still required for historical reasons.
3934 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3935 'definition' instead.
3937 * The "prems" fact, which refers to the accidental collection of
3938 foundational premises in the context, is now explicitly marked as
3939 legacy feature and will be discontinued soon. Consider using "assms"
3940 of the head statement or reference facts by explicit names.
3942 * Document antiquotations @{class} and @{type} print classes and type
3945 * Document antiquotation @{file} checks file/directory entries within
3946 the local file system.
3951 * Coercive subtyping: functions can be declared as coercions and type
3952 inference will add them as necessary upon input of a term. Theory
3953 Complex_Main declares real :: nat => real and real :: int => real as
3954 coercions. A coercion function f is declared like this:
3956 declare [[coercion f]]
3958 To lift coercions through type constructors (e.g. from nat => real to
3959 nat list => real list), map functions can be declared, e.g.
3961 declare [[coercion_map map]]
3963 Currently coercion inference is activated only in theories including
3964 real numbers, i.e. descendants of Complex_Main. This is controlled by
3965 the configuration option "coercion_enabled", e.g. it can be enabled in
3966 other theories like this:
3968 declare [[coercion_enabled]]
3970 * Command 'partial_function' provides basic support for recursive
3971 function definitions over complete partial orders. Concrete instances
3972 are provided for i) the option type, ii) tail recursion on arbitrary
3973 types, and iii) the heap monad of Imperative_HOL. See
3974 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3977 * Function package: f.psimps rules are no longer implicitly declared
3978 as [simp]. INCOMPATIBILITY.
3980 * Datatype package: theorems generated for executable equality (class
3981 "eq") carry proper names and are treated as default code equations.
3983 * Inductive package: now offers command 'inductive_simps' to
3984 automatically derive instantiated and simplified equations for
3985 inductive predicates, similar to 'inductive_cases'.
3987 * Command 'enriched_type' allows to register properties of the
3988 functorial structure of types.
3990 * Improved infrastructure for term evaluation using code generator
3991 techniques, in particular static evaluation conversions.
3993 * Code generator: Scala (2.8 or higher) has been added to the target
3996 * Code generator: globbing constant expressions "*" and "Theory.*"
3997 have been replaced by the more idiomatic "_" and "Theory._".
4000 * Code generator: export_code without explicit file declaration prints
4001 to standard output. INCOMPATIBILITY.
4003 * Code generator: do not print function definitions for case
4004 combinators any longer.
4006 * Code generator: simplification with rules determined with
4007 src/Tools/Code/code_simp.ML and method "code_simp".
4009 * Code generator for records: more idiomatic representation of record
4010 types. Warning: records are not covered by ancient SML code
4011 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
4012 rep_datatype declaration helps to succeed then:
4016 rep_datatype foo_ext ...
4018 * Records: logical foundation type for records does not carry a
4019 '_type' suffix any longer (obsolete due to authentic syntax).
4022 * Quickcheck now by default uses exhaustive testing instead of random
4023 testing. Random testing can be invoked by "quickcheck [random]",
4024 exhaustive testing by "quickcheck [exhaustive]".
4026 * Quickcheck instantiates polymorphic types with small finite
4027 datatypes by default. This enables a simple execution mechanism to
4028 handle quantifiers and function equality over the finite datatypes.
4030 * Quickcheck random generator has been renamed from "code" to
4031 "random". INCOMPATIBILITY.
4033 * Quickcheck now has a configurable time limit which is set to 30
4034 seconds by default. This can be changed by adding [timeout = n] to the
4035 quickcheck command. The time limit for Auto Quickcheck is still set
4038 * Quickcheck in locales considers interpretations of that locale for
4039 counter example search.
4042 - Added "smt" and "remote_smt" provers based on the "smt" proof
4043 method. See the Sledgehammer manual for details ("isabelle doc
4046 sledgehammer atp_info ~> sledgehammer running_provers
4047 sledgehammer atp_kill ~> sledgehammer kill_provers
4048 sledgehammer available_atps ~> sledgehammer available_provers
4051 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
4052 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
4053 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
4054 (and "ms" and "min" are no longer supported)
4059 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
4060 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
4062 - Added support for partial quotient types.
4063 - Added local versions of the "Nitpick.register_xxx" functions.
4064 - Added "whack" option.
4065 - Allow registration of quotient types as codatatypes.
4066 - Improved "merge_type_vars" option to merge more types.
4067 - Removed unsound "fast_descrs" option.
4068 - Added custom symmetry breaking for datatypes, making it possible to reach
4069 higher cardinalities.
4070 - Prevent the expansion of too large definitions.
4072 * Proof methods "metis" and "meson" now have configuration options
4073 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
4074 to diagnose these tools. E.g.
4076 using [[metis_trace = true]]
4078 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4079 manually as command 'solve_direct'.
4081 * The default SMT solver Z3 must be enabled explicitly (due to
4082 licensing issues) by setting the environment variable
4083 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4084 commercial applications, the SMT solver CVC3 is provided as fall-back;
4085 changing the SMT solver is done via the configuration option
4088 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4089 i.e. "remote_cvc3" and "remote_z3".
4091 * Added basic SMT support for datatypes, records, and typedefs using
4092 the oracle mode (no proofs). Direct support of pairs has been dropped
4093 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4094 support for a similar behavior). Minor INCOMPATIBILITY.
4096 * Changed SMT configuration options:
4098 z3_proofs ~> smt_oracle (with inverted meaning)
4099 z3_trace_assms ~> smt_trace_used_facts
4112 * Boogie output files (.b2i files) need to be declared in the theory
4115 * Simplification procedure "list_to_set_comprehension" rewrites list
4116 comprehensions applied to List.set to set comprehensions. Occasional
4117 INCOMPATIBILITY, may be deactivated like this:
4119 declare [[simproc del: list_to_set_comprehension]]
4121 * Removed old version of primrec package. INCOMPATIBILITY.
4123 * Removed simplifier congruence rule of "prod_case", as has for long
4124 been the case with "split". INCOMPATIBILITY.
4126 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4128 * Removed [split_format ... and ... and ...] version of
4129 [split_format]. Potential INCOMPATIBILITY.
4131 * Predicate "sorted" now defined inductively, with nice induction
4132 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4134 * Constant "contents" renamed to "the_elem", to free the generic name
4135 contents for other uses. INCOMPATIBILITY.
4137 * Renamed class eq and constant eq (for code generation) to class
4138 equal and constant equal, plus renaming of related facts and various
4139 tuning. INCOMPATIBILITY.
4141 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4143 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4146 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4147 avoid confusion with finite sets. INCOMPATIBILITY.
4149 * Abandoned locales equiv, congruent and congruent2 for equivalence
4150 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4153 * Some previously unqualified names have been qualified:
4160 Trueprop ~> HOL.Trueprop
4165 op --> ~> HOL.implies
4177 Pair ~> Product_Type.Pair
4178 fst ~> Product_Type.fst
4179 snd ~> Product_Type.snd
4180 curry ~> Product_Type.curry
4182 Collect ~> Set.Collect
4186 * More canonical naming convention for some fundamental definitions:
4188 bot_bool_eq ~> bot_bool_def
4189 top_bool_eq ~> top_bool_def
4190 inf_bool_eq ~> inf_bool_def
4191 sup_bool_eq ~> sup_bool_def
4192 bot_fun_eq ~> bot_fun_def
4193 top_fun_eq ~> top_fun_def
4194 inf_fun_eq ~> inf_fun_def
4195 sup_fun_eq ~> sup_fun_def
4199 * More stylized fact names:
4201 expand_fun_eq ~> fun_eq_iff
4202 expand_set_eq ~> set_eq_iff
4204 nat_number ~> eval_nat_numeral
4208 * Refactoring of code-generation specific operations in theory List:
4214 mem_iff ~> member_def
4215 null_empty ~> null_def
4217 INCOMPATIBILITY. Note that these were not supposed to be used
4218 regularly unless for striking reasons; their main purpose was code
4221 Various operations from the Haskell prelude are used for generating
4224 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4225 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4226 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4228 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4229 "*" and "+" respectively. INCOMPATIBILITY.
4231 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4232 "Sum_Type.Plus" instead.
4234 * Constant "split" has been merged with constant "prod_case"; names of
4235 ML functions, facts etc. involving split have been retained so far,
4236 though. INCOMPATIBILITY.
4238 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4239 instead. INCOMPATIBILITY.
4241 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4244 * Former theory Library/Enum is now part of the HOL-Main image.
4245 INCOMPATIBILITY: all constants of the Enum theory now have to be
4246 referred to by its qualified name.
4249 nlists ~> Enum.nlists
4250 product ~> Enum.product
4252 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4253 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4256 * Theory Library/SetsAndFunctions has been split into
4257 Library/Function_Algebras and Library/Set_Algebras; canonical names
4258 for instance definitions for functions; various improvements.
4261 * Theory Library/Multiset provides stable quicksort implementation of
4264 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4267 * Session Multivariate_Analysis: introduced a type class for euclidean
4268 space. Most theorems are now stated in terms of euclidean spaces
4269 instead of finite cartesian products.
4272 real ^ 'n ~> 'a::real_vector
4273 ~> 'a::euclidean_space
4274 ~> 'a::ordered_euclidean_space
4275 (depends on your needs)
4279 \<chi> x. _ ~> \<chi>\<chi> x. _
4282 Also note that the indices are now natural numbers and not from some
4283 finite type. Finite cartesian products of euclidean spaces, products
4284 of euclidean spaces the real and complex numbers are instantiated to
4285 be euclidean_spaces. INCOMPATIBILITY.
4287 * Session Probability: introduced pextreal as positive extended real
4288 numbers. Use pextreal as value for measures. Introduce the
4289 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4290 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4291 the integral in Multivariate Analysis. INCOMPATIBILITY.
4293 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4296 * Session SPARK (with image HOL-SPARK) provides commands to load and
4297 prove verification conditions generated by the SPARK Ada program
4298 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4303 * Theorems for additive ring operations (locale abelian_monoid and
4304 descendants) are generated by interpretation from their multiplicative
4305 counterparts. Names (in particular theorem names) have the mandatory
4306 qualifier 'add'. Previous theorem names are redeclared for
4309 * Structure "int_ring" is now an abbreviation (previously a
4310 definition). This fits more natural with advanced interpretations.
4315 * The domain package now runs in definitional mode by default: The
4316 former command 'new_domain' is now called 'domain'. To use the domain
4317 package in its original axiomatic mode, use 'domain (unsafe)'.
4320 * The new class "domain" is now the default sort. Class "predomain"
4321 is an unpointed version of "domain". Theories can be updated by
4322 replacing sort annotations as shown below. INCOMPATIBILITY.
4324 'a::type ~> 'a::countable
4325 'a::cpo ~> 'a::predomain
4326 'a::pcpo ~> 'a::domain
4328 * The old type class "rep" has been superseded by class "domain".
4329 Accordingly, users of the definitional package must remove any
4330 "default_sort rep" declarations. INCOMPATIBILITY.
4332 * The domain package (definitional mode) now supports unpointed
4333 predomain argument types, as long as they are marked 'lazy'. (Strict
4334 arguments must be in class "domain".) For example, the following
4335 domain definition now works:
4337 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4339 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4340 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4341 'a option, and 'a list. Additionally, it configures fixrec and the
4342 domain package to work with these types. For example:
4344 fixrec isInl :: "('a + 'b) u -> tr"
4345 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4347 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4349 * The "(permissive)" option of fixrec has been replaced with a
4350 per-equation "(unchecked)" option. See
4351 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4353 * The "bifinite" class no longer fixes a constant "approx"; the class
4354 now just asserts that such a function exists. INCOMPATIBILITY.
4356 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4357 defines an embedding of type 'a defl into udom by default; instances
4358 of "bifinite" and "domain" classes are available in
4359 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4361 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4363 * The predicate "directed" has been removed. INCOMPATIBILITY.
4365 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4367 * The function "cprod_map" has been renamed to "prod_map".
4370 * The monadic bind operator on each powerdomain has new binder syntax
4371 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4372 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4374 * The infix syntax for binary union on each powerdomain has changed
4375 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4376 syntax. INCOMPATIBILITY.
4378 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4379 still supported as an input translation.
4381 * Renamed some theorems (the original names are also still available).
4383 expand_fun_below ~> fun_below_iff
4384 below_fun_ext ~> fun_belowI
4385 expand_cfun_eq ~> cfun_eq_iff
4386 ext_cfun ~> cfun_eqI
4387 expand_cfun_below ~> cfun_below_iff
4388 below_cfun_ext ~> cfun_belowI
4389 cont2cont_Rep_CFun ~> cont2cont_APP
4391 * The Abs and Rep functions for various types have changed names.
4392 Related theorem names have also changed to match. INCOMPATIBILITY.
4394 Rep_CFun ~> Rep_cfun
4395 Abs_CFun ~> Abs_cfun
4396 Rep_Sprod ~> Rep_sprod
4397 Abs_Sprod ~> Abs_sprod
4398 Rep_Ssum ~> Rep_ssum
4399 Abs_Ssum ~> Abs_ssum
4401 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4402 been renamed to *_bottom_iff. INCOMPATIBILITY.
4404 * Various changes to bisimulation/coinduction with domain package:
4406 - Definitions of "bisim" constants no longer mention definedness.
4407 - With mutual recursion, "bisim" predicate is now curried.
4408 - With mutual recursion, each type gets a separate coind theorem.
4409 - Variable names in bisim_def and coinduct rules have changed.
4413 * Case combinators generated by the domain package for type "foo" are
4414 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4416 * Several theorems have been renamed to more accurately reflect the
4417 names of constants and types involved. INCOMPATIBILITY.
4419 thelub_const ~> lub_const
4420 lub_const ~> is_lub_const
4422 is_lub_lub ~> is_lubD2
4424 unique_lub ~> is_lub_unique
4425 is_ub_lub ~> is_lub_rangeD1
4426 lub_bin_chain ~> is_lub_bin_chain
4427 lub_fun ~> is_lub_fun
4428 thelub_fun ~> lub_fun
4429 thelub_cfun ~> lub_cfun
4430 thelub_Pair ~> lub_Pair
4431 lub_cprod ~> is_lub_prod
4432 thelub_cprod ~> lub_prod
4433 minimal_cprod ~> minimal_prod
4434 inst_cprod_pcpo ~> inst_prod_pcpo
4436 compact_UU ~> compact_bottom
4437 deflation_UU ~> deflation_bottom
4438 finite_deflation_UU ~> finite_deflation_bottom
4440 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4442 sq_ord_less_eq_trans ~> below_eq_trans
4443 sq_ord_eq_less_trans ~> eq_below_trans
4444 refl_less ~> below_refl
4445 trans_less ~> below_trans
4446 antisym_less ~> below_antisym
4447 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4448 box_less ~> box_below
4449 rev_trans_less ~> rev_below_trans
4450 not_less2not_eq ~> not_below2not_eq
4451 less_UU_iff ~> below_UU_iff
4452 flat_less_iff ~> flat_below_iff
4453 adm_less ~> adm_below
4454 adm_not_less ~> adm_not_below
4455 adm_compact_not_less ~> adm_compact_not_below
4456 less_fun_def ~> below_fun_def
4457 expand_fun_less ~> fun_below_iff
4458 less_fun_ext ~> fun_belowI
4459 less_discr_def ~> below_discr_def
4460 discr_less_eq ~> discr_below_eq
4461 less_unit_def ~> below_unit_def
4462 less_cprod_def ~> below_prod_def
4463 prod_lessI ~> prod_belowI
4464 Pair_less_iff ~> Pair_below_iff
4465 fst_less_iff ~> fst_below_iff
4466 snd_less_iff ~> snd_below_iff
4467 expand_cfun_less ~> cfun_below_iff
4468 less_cfun_ext ~> cfun_belowI
4469 injection_less ~> injection_below
4470 less_up_def ~> below_up_def
4471 not_Iup_less ~> not_Iup_below
4472 Iup_less ~> Iup_below
4474 Def_inject_less_eq ~> Def_below_Def
4475 Def_less_is_eq ~> Def_below_iff
4476 spair_less_iff ~> spair_below_iff
4477 less_sprod ~> below_sprod
4478 spair_less ~> spair_below
4479 sfst_less_iff ~> sfst_below_iff
4480 ssnd_less_iff ~> ssnd_below_iff
4481 fix_least_less ~> fix_least_below
4482 dist_less_one ~> dist_below_one
4483 less_ONE ~> below_ONE
4484 ONE_less_iff ~> ONE_below_iff
4485 less_sinlD ~> below_sinlD
4486 less_sinrD ~> below_sinrD
4491 * All constant names are now qualified internally and use proper
4492 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4497 * Antiquotation @{assert} inlines a function bool -> unit that raises
4498 Fail if the argument is false. Due to inlining the source position of
4499 failed assertions is included in the error output.
4501 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4502 text is in practice always evaluated with a stable theory checkpoint.
4503 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4505 * Antiquotation @{theory A} refers to theory A from the ancestry of
4506 the current context, not any accidental theory loader state as before.
4507 Potential INCOMPATIBILITY, subtle change in semantics.
4509 * Syntax.pretty_priority (default 0) configures the required priority
4510 of pretty-printed output and thus affects insertion of parentheses.
4512 * Syntax.default_root (default "any") configures the inner syntax
4513 category (nonterminal symbol) for parsing of terms.
4515 * Former exception Library.UnequalLengths now coincides with
4516 ListPair.UnequalLengths.
4518 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4519 main functionality is provided by structure Simplifier.
4521 * Renamed raw "explode" function to "raw_explode" to emphasize its
4522 meaning. Note that internally to Isabelle, Symbol.explode is used in
4523 almost all situations.
4525 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4526 See implementation manual for further details on exceptions in
4529 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4532 * Renamed structure PureThy to Pure_Thy and moved most of its
4533 operations to structure Global_Theory, to emphasize that this is
4534 rarely-used global-only stuff.
4536 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4537 instead (or tracing for high-volume output).
4539 * Configuration option show_question_marks only affects regular pretty
4540 printing of types and terms, not raw Term.string_of_vname.
4542 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4543 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4544 @{thms} for most purposes.
4546 * ML structure Unsynchronized is never opened, not even in Isar
4547 interaction mode as before. Old Unsynchronized.set etc. have been
4548 discontinued -- use plain := instead. This should be *rare* anyway,
4549 since modern tools always work via official context data, notably
4550 configuration options.
4552 * Parallel and asynchronous execution requires special care concerning
4553 interrupts. Structure Exn provides some convenience functions that
4554 avoid working directly with raw Interrupt. User code must not absorb
4555 interrupts -- intermediate handling (for cleanup etc.) needs to be
4556 followed by re-raising of the original exception. Another common
4557 source of mistakes are "handle _" patterns, which make the meaning of
4558 the program subject to physical effects of the environment.
4562 New in Isabelle2009-2 (June 2010)
4563 ---------------------------------
4567 * Authentic syntax for *all* logical entities (type classes, type
4568 constructors, term constants): provides simple and robust
4569 correspondence between formal entities and concrete syntax. Within
4570 the parse tree / AST representations, "constants" are decorated by
4571 their category (class, type, const) and spelled out explicitly with
4572 their full internal name.
4574 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4575 and translations (translation rules and translation functions in ML).
4576 Some hints on upgrading:
4578 - Many existing uses of 'syntax' and 'translations' can be replaced
4579 by more modern 'type_notation', 'notation' and 'abbreviation',
4580 which are independent of this issue.
4582 - 'translations' require markup within the AST; the term syntax
4583 provides the following special forms:
4585 CONST c -- produces syntax version of constant c from context
4586 XCONST c -- literally c, checked as constant from context
4587 c -- literally c, if declared by 'syntax'
4589 Plain identifiers are treated as AST variables -- occasionally the
4590 system indicates accidental variables via the error "rhs contains
4593 Type classes and type constructors are marked according to their
4594 concrete syntax. Some old translations rules need to be written
4595 for the "type" category, using type constructor application
4596 instead of pseudo-term application of the default category
4599 - 'parse_translation' etc. in ML may use the following
4602 @{class_syntax c} -- type class c within parse tree / AST
4603 @{term_syntax c} -- type constructor c within parse tree / AST
4604 @{const_syntax c} -- ML version of "CONST c" above
4605 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4607 - Literal types within 'typed_print_translations', i.e. those *not*
4608 represented as pseudo-terms are represented verbatim. Use @{class
4609 c} or @{type_name c} here instead of the above syntax
4612 Note that old non-authentic syntax was based on unqualified base
4613 names, so all of the above "constant" names would coincide. Recall
4614 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4615 diagnose syntax problems.
4617 * Type constructors admit general mixfix syntax, not just infix.
4619 * Concrete syntax may be attached to local entities without a proof
4620 body, too. This works via regular mixfix annotations for 'fix',
4621 'def', 'obtain' etc. or via the explicit 'write' command, which is
4622 similar to the 'notation' command in theory specifications.
4624 * Discontinued unnamed infix syntax (legacy feature for many years) --
4625 need to specify constant name and syntax separately. Internal ML
4626 datatype constructors have been renamed from InfixName to Infix etc.
4627 Minor INCOMPATIBILITY.
4629 * Schematic theorem statements need to be explicitly markup as such,
4630 via commands 'schematic_lemma', 'schematic_theorem',
4631 'schematic_corollary'. Thus the relevance of the proof is made
4632 syntactically clear, which impacts performance in a parallel or
4633 asynchronous interactive environment. Minor INCOMPATIBILITY.
4635 * Use of cumulative prems via "!" in some proof methods has been
4636 discontinued (old legacy feature).
4638 * References 'trace_simp' and 'debug_simp' have been replaced by
4639 configuration options stored in the context. Enabling tracing (the
4640 case of debugging is similar) in proofs works via
4642 using [[trace_simp = true]]
4644 Tracing is then active for all invocations of the simplifier in
4645 subsequent goal refinement steps. Tracing may also still be enabled or
4646 disabled via the ProofGeneral settings menu.
4648 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4649 'hide_fact' replace the former 'hide' KIND command. Minor
4652 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4653 more efficient than combinations with -q1 or -q2.
4658 * Proofterms record type-class reasoning explicitly, using the
4659 "unconstrain" operation internally. This eliminates all sort
4660 constraints from a theorem and proof, introducing explicit
4661 OFCLASS-premises. On the proof term level, this operation is
4662 automatically applied at theorem boundaries, such that closed proofs
4663 are always free of sort constraints. INCOMPATIBILITY for tools that
4664 inspect proof terms.
4666 * Local theory specifications may depend on extra type variables that
4667 are not present in the result type -- arguments TYPE('a) :: 'a itself
4668 are added internally. For example:
4670 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4672 * Predicates of locales introduced by classes carry a mandatory
4673 "class" prefix. INCOMPATIBILITY.
4675 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4677 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4680 * Command 'code_reflect' allows to incorporate generated ML code into
4681 runtime environment; replaces immature code_datatype antiquotation.
4684 * Code generator: simple concept for abstract datatypes obeying
4687 * Code generator: details of internal data cache have no impact on the
4688 user space functionality any longer.
4690 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4691 subgoals. This is more appropriate for interpretations with 'where'.
4694 * Command 'example_proof' opens an empty proof body. This allows to
4695 experiment with Isar, without producing any persistent result.
4697 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4698 within a local theory context, with explicit checking of the
4699 constructors involved (in contrast to the raw 'syntax' versions).
4701 * Commands 'types' and 'typedecl' now work within a local theory
4702 context -- without introducing dependencies on parameters or
4703 assumptions, which is not possible in Isabelle/Pure.
4705 * Command 'defaultsort' has been renamed to 'default_sort', it works
4706 within a local theory context. Minor INCOMPATIBILITY.
4711 * Command 'typedef' now works within a local theory context -- without
4712 introducing dependencies on parameters or assumptions, which is not
4713 possible in Isabelle/Pure/HOL. Note that the logical environment may
4714 contain multiple interpretations of local typedefs (with different
4715 non-emptiness proofs), even in a global theory context.
4717 * New package for quotient types. Commands 'quotient_type' and
4718 'quotient_definition' may be used for defining types and constants by
4719 quotient constructions. An example is the type of integers created by
4720 quotienting pairs of natural numbers:
4723 intrel :: "(nat * nat) => (nat * nat) => bool"
4725 "intrel (x, y) (u, v) = (x + v = u + y)"
4727 quotient_type int = "nat * nat" / intrel
4728 by (auto simp add: equivp_def expand_fun_eq)
4731 "0::int" is "(0::nat, 0::nat)"
4733 The method "lifting" can be used to lift of theorems from the
4734 underlying "raw" type to the quotient type. The example
4735 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4736 construction and provides a reasoning infrastructure for finite sets.
4738 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4739 clash with new theory Quotient in Main HOL.
4741 * Moved the SMT binding into the main HOL session, eliminating
4742 separate HOL-SMT session.
4744 * List membership infix mem operation is only an input abbreviation.
4747 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4748 for future developements; former Library/Word.thy is still present in
4749 the AFP entry RSAPPS.
4751 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4752 longer shadowed. INCOMPATIBILITY.
4754 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4757 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4760 * Dropped normalizing_semiring etc; use the facts in semiring classes
4761 instead. INCOMPATIBILITY.
4763 * Dropped several real-specific versions of lemmas about floor and
4764 ceiling; use the generic lemmas from theory "Archimedean_Field"
4765 instead. INCOMPATIBILITY.
4767 floor_number_of_eq ~> floor_number_of
4768 le_floor_eq_number_of ~> number_of_le_floor
4769 le_floor_eq_zero ~> zero_le_floor
4770 le_floor_eq_one ~> one_le_floor
4771 floor_less_eq_number_of ~> floor_less_number_of
4772 floor_less_eq_zero ~> floor_less_zero
4773 floor_less_eq_one ~> floor_less_one
4774 less_floor_eq_number_of ~> number_of_less_floor
4775 less_floor_eq_zero ~> zero_less_floor
4776 less_floor_eq_one ~> one_less_floor
4777 floor_le_eq_number_of ~> floor_le_number_of
4778 floor_le_eq_zero ~> floor_le_zero
4779 floor_le_eq_one ~> floor_le_one
4780 floor_subtract_number_of ~> floor_diff_number_of
4781 floor_subtract_one ~> floor_diff_one
4782 ceiling_number_of_eq ~> ceiling_number_of
4783 ceiling_le_eq_number_of ~> ceiling_le_number_of
4784 ceiling_le_zero_eq ~> ceiling_le_zero
4785 ceiling_le_eq_one ~> ceiling_le_one
4786 less_ceiling_eq_number_of ~> number_of_less_ceiling
4787 less_ceiling_eq_zero ~> zero_less_ceiling
4788 less_ceiling_eq_one ~> one_less_ceiling
4789 ceiling_less_eq_number_of ~> ceiling_less_number_of
4790 ceiling_less_eq_zero ~> ceiling_less_zero
4791 ceiling_less_eq_one ~> ceiling_less_one
4792 le_ceiling_eq_number_of ~> number_of_le_ceiling
4793 le_ceiling_eq_zero ~> zero_le_ceiling
4794 le_ceiling_eq_one ~> one_le_ceiling
4795 ceiling_subtract_number_of ~> ceiling_diff_number_of
4796 ceiling_subtract_one ~> ceiling_diff_one
4798 * Theory "Finite_Set": various folding_XXX locales facilitate the
4799 application of the various fold combinators on finite sets.
4801 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4802 provides abstract red-black tree type which is backed by "RBT_Impl" as
4803 implementation. INCOMPATIBILTY.
4805 * Theory Library/Coinductive_List has been removed -- superseded by
4806 AFP/thys/Coinductive.
4808 * Theory PReal, including the type "preal" and related operations, has
4809 been removed. INCOMPATIBILITY.
4811 * Real: new development using Cauchy Sequences.
4813 * Split off theory "Big_Operators" containing setsum, setprod,
4814 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4816 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4817 "Int" etc. INCOMPATIBILITY.
4819 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4821 * New set of rules "ac_simps" provides combined assoc / commute
4822 rewrites for all interpretations of the appropriate generic locales.
4824 * Renamed theory "OrderedGroup" to "Groups" and split theory
4825 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4826 appropriate and more consistent names suitable for name prefixes
4827 within the HOL theories. INCOMPATIBILITY.
4829 * Some generic constants have been put to appropriate theories:
4830 - less_eq, less: Orderings
4831 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4832 - inverse, divide: Rings
4835 * More consistent naming of type classes involving orderings (and
4838 lower_semilattice ~> semilattice_inf
4839 upper_semilattice ~> semilattice_sup
4841 dense_linear_order ~> dense_linorder
4843 pordered_ab_group_add ~> ordered_ab_group_add
4844 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4845 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4846 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4847 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4848 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4849 pordered_cancel_semiring ~> ordered_cancel_semiring
4850 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4851 pordered_comm_ring ~> ordered_comm_ring
4852 pordered_comm_semiring ~> ordered_comm_semiring
4853 pordered_ring ~> ordered_ring
4854 pordered_ring_abs ~> ordered_ring_abs
4855 pordered_semiring ~> ordered_semiring
4857 ordered_ab_group_add ~> linordered_ab_group_add
4858 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4859 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4860 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4861 ordered_field ~> linordered_field
4862 ordered_field_no_lb ~> linordered_field_no_lb
4863 ordered_field_no_ub ~> linordered_field_no_ub
4864 ordered_field_dense_linear_order ~> dense_linordered_field
4865 ordered_idom ~> linordered_idom
4866 ordered_ring ~> linordered_ring
4867 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4868 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4869 ordered_ring_strict ~> linordered_ring_strict
4870 ordered_semidom ~> linordered_semidom
4871 ordered_semiring ~> linordered_semiring
4872 ordered_semiring_1 ~> linordered_semiring_1
4873 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4874 ordered_semiring_strict ~> linordered_semiring_strict
4876 The following slightly odd type classes have been moved to a
4877 separate theory Library/Lattice_Algebras:
4879 lordered_ab_group_add ~> lattice_ab_group_add
4880 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4881 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4882 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4883 lordered_ring ~> lattice_ring
4887 * Refined field classes:
4888 - classes division_ring_inverse_zero, field_inverse_zero,
4889 linordered_field_inverse_zero include rule inverse 0 = 0 --
4890 subsumes former division_by_zero class;
4891 - numerous lemmas have been ported from field to division_ring.
4894 * Refined algebra theorem collections:
4895 - dropped theorem group group_simps, use algebra_simps instead;
4896 - dropped theorem group ring_simps, use field_simps instead;
4897 - proper theorem collection field_simps subsumes former theorem
4898 groups field_eq_simps and field_simps;
4899 - dropped lemma eq_minus_self_iff which is a duplicate for
4903 * Theory Finite_Set and List: some lemmas have been generalized from
4906 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4907 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4908 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4909 union_Union_fold_union ~> sup_Sup_fold_sup
4910 Inter_fold_inter ~> Inf_fold_inf
4911 Union_fold_union ~> Sup_fold_sup
4912 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4913 union_UNION_fold_union ~> sup_SUPR_fold_sup
4914 INTER_fold_inter ~> INFI_fold_inf
4915 UNION_fold_union ~> SUPR_fold_sup
4917 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4918 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4919 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4920 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4921 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4922 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4924 * Reorganized theory Multiset: swapped notation of pointwise and
4927 - pointwise ordering is instance of class order with standard syntax
4929 - multiset ordering has syntax <=# and <#; partial order properties
4930 are provided by means of interpretation with prefix
4932 - less duplication, less historical organization of sections,
4933 conversion from associations lists to multisets, rudimentary code
4935 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4940 multiset_eq_conv_count_eq ~> multiset_ext_iff
4941 multi_count_ext ~> multiset_ext
4942 diff_union_inverse2 ~> diff_union_cancelR
4946 * Theory Permutation: replaced local "remove" by List.remove1.
4948 * Code generation: ML and OCaml code is decorated with signatures.
4950 * Theory List: added transpose.
4952 * Library/Nat_Bijection.thy is a collection of bijective functions
4953 between nat and other types, which supersedes the older libraries
4954 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4957 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4958 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4959 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4960 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4961 Countable.pair_encode ~> prod_encode
4962 NatIso.prod2nat ~> prod_encode
4963 NatIso.nat2prod ~> prod_decode
4964 NatIso.sum2nat ~> sum_encode
4965 NatIso.nat2sum ~> sum_decode
4966 NatIso.list2nat ~> list_encode
4967 NatIso.nat2list ~> list_decode
4968 NatIso.set2nat ~> set_encode
4969 NatIso.nat2set ~> set_decode
4972 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4973 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4974 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4975 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4976 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4977 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4978 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4979 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4980 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4981 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4982 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4983 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4984 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4987 - Renamed ATP commands:
4988 atp_info ~> sledgehammer running_atps
4989 atp_kill ~> sledgehammer kill_atps
4990 atp_messages ~> sledgehammer messages
4991 atp_minimize ~> sledgehammer minimize
4992 print_atps ~> sledgehammer available_atps
4994 - Added user's manual ("isabelle doc sledgehammer").
4995 - Added option syntax and "sledgehammer_params" to customize
4996 Sledgehammer's behavior. See the manual for details.
4997 - Modified the Isar proof reconstruction code so that it produces
4998 direct proofs rather than proofs by contradiction. (This feature
4999 is still experimental.)
5000 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
5002 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
5005 - Added and implemented "binary_ints" and "bits" options.
5006 - Added "std" option and implemented support for nonstandard models.
5007 - Added and implemented "finitize" option to improve the precision
5008 of infinite datatypes based on a monotonicity analysis.
5009 - Added support for quotient types.
5010 - Added support for "specification" and "ax_specification"
5012 - Added support for local definitions (for "function" and
5013 "termination" proofs).
5014 - Added support for term postprocessors.
5015 - Optimized "Multiset.multiset" and "FinFun.finfun".
5016 - Improved efficiency of "destroy_constrs" optimization.
5017 - Fixed soundness bugs related to "destroy_constrs" optimization and
5019 - Fixed soundness bug related to higher-order constructors.
5020 - Fixed soundness bug when "full_descrs" is enabled.
5021 - Improved precision of set constructs.
5022 - Added "atoms" option.
5023 - Added cache to speed up repeated Kodkod invocations on the same
5025 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
5026 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
5027 "SAT4J_Light". INCOMPATIBILITY.
5028 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
5029 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
5030 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
5032 * Method "induct" now takes instantiations of the form t, where t is not
5033 a variable, as a shorthand for "x == t", where x is a fresh variable.
5034 If this is not intended, t has to be enclosed in parentheses.
5035 By default, the equalities generated by definitional instantiations
5036 are pre-simplified, which may cause parameters of inductive cases
5037 to disappear, or may even delete some of the inductive cases.
5038 Use "induct (no_simp)" instead of "induct" to restore the old
5039 behaviour. The (no_simp) option is also understood by the "cases"
5040 and "nominal_induct" methods, which now perform pre-simplification, too.
5046 * Variable names in lemmas generated by the domain package have
5047 changed; the naming scheme is now consistent with the HOL datatype
5048 package. Some proof scripts may be affected, INCOMPATIBILITY.
5050 * The domain package no longer defines the function "foo_copy" for
5051 recursive domain "foo". The reach lemma is now stated directly in
5052 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
5053 be reformulated in terms of "foo_take", INCOMPATIBILITY.
5055 * Most definedness lemmas generated by the domain package (previously
5056 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
5057 like "foo$x = UU <-> x = UU", which works better as a simp rule.
5058 Proofs that used definedness lemmas as intro rules may break,
5059 potential INCOMPATIBILITY.
5061 * Induction and casedist rules generated by the domain package now
5062 declare proper case_names (one called "bottom", and one named for each
5063 constructor). INCOMPATIBILITY.
5065 * For mutually-recursive domains, separate "reach" and "take_lemma"
5066 rules are generated for each domain, INCOMPATIBILITY.
5068 foo_bar.reach ~> foo.reach bar.reach
5069 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
5071 * Some lemmas generated by the domain package have been renamed for
5072 consistency with the datatype package, INCOMPATIBILITY.
5074 foo.ind ~> foo.induct
5075 foo.finite_ind ~> foo.finite_induct
5076 foo.coind ~> foo.coinduct
5077 foo.casedist ~> foo.exhaust
5078 foo.exhaust ~> foo.nchotomy
5080 * For consistency with other definition packages, the fixrec package
5081 now generates qualified theorem names, INCOMPATIBILITY.
5083 foo_simps ~> foo.simps
5084 foo_unfold ~> foo.unfold
5085 foo_induct ~> foo.induct
5087 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5088 method and internal fixrec proofs now use the default simpset instead.
5091 * The "contlub" predicate has been removed. Proof scripts should use
5092 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5094 * The "admw" predicate has been removed, INCOMPATIBILITY.
5096 * The constants cpair, cfst, and csnd have been removed in favor of
5097 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5102 * Antiquotations for basic formal entities:
5104 @{class NAME} -- type class
5105 @{class_syntax NAME} -- syntax representation of the above
5107 @{type_name NAME} -- logical type
5108 @{type_abbrev NAME} -- type abbreviation
5109 @{nonterminal NAME} -- type of concrete syntactic category
5110 @{type_syntax NAME} -- syntax representation of any of the above
5112 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5113 @{const_abbrev NAME} -- abbreviated constant
5114 @{const_syntax NAME} -- syntax representation of any of the above
5116 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5117 syntax constant (cf. 'syntax' command).
5119 * Antiquotation @{make_string} inlines a function to print arbitrary
5120 values similar to the ML toplevel. The result is compiler dependent
5121 and may fall back on "?" in certain situations.
5123 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5124 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5125 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5126 not work with the asynchronous Isar document model.
5128 * Configuration options now admit dynamic default values, depending on
5129 the context or even global references.
5131 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5132 uses an efficient external library if available (for Poly/ML).
5134 * Renamed some important ML structures, while keeping the old names
5135 for some time as aliases within the structure Legacy:
5137 OuterKeyword ~> Keyword
5140 OuterSyntax ~> Outer_Syntax
5141 PrintMode ~> Print_Mode
5142 SpecParse ~> Parse_Spec
5145 ThyOutput ~> Thy_Output
5146 TypeInfer ~> Type_Infer
5148 Note that "open Legacy" simplifies porting of sources, but forgetting
5149 to remove it again will complicate porting again in the future.
5151 * Most operations that refer to a global context are named
5152 accordingly, e.g. Simplifier.global_context or
5153 ProofContext.init_global. There are some situations where a global
5154 context actually works, but under normal circumstances one needs to
5155 pass the proper local context through the code!
5157 * Discontinued old TheoryDataFun with its copy/init operation -- data
5158 needs to be pure. Functor Theory_Data_PP retains the traditional
5159 Pretty.pp argument to merge, which is absent in the standard
5160 Theory_Data version.
5162 * Sorts.certify_sort and derived "cert" operations for types and terms
5163 no longer minimize sorts. Thus certification at the boundary of the
5164 inference kernel becomes invariant under addition of class relations,
5165 which is an important monotonicity principle. Sorts are now minimized
5166 in the syntax layer only, at the boundary between the end-user and the
5167 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5168 explicitly in rare situations.
5170 * Renamed old-style Drule.standard to Drule.export_without_context, to
5171 emphasize that this is in no way a standard operation.
5174 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5175 usual for resolution. Rare INCOMPATIBILITY.
5177 * Renamed varify/unvarify operations to varify_global/unvarify_global
5178 to emphasize that these only work in a global situation (which is
5181 * Curried take and drop in library.ML; negative length is interpreted
5182 as infinity (as in chop). Subtle INCOMPATIBILITY.
5184 * Proof terms: type substitutions on proof constants now use canonical
5185 order of type variables. INCOMPATIBILITY for tools working with proof
5188 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5189 may no longer carry premises. User-level specifications are
5190 transformed accordingly by Thm.add_axiom/add_def.
5195 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5196 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5197 proof terms are enabled unconditionally in the new HOL-Proofs image.
5199 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5200 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5203 * Old lib/scripts/polyml-platform is superseded by the
5204 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5205 variant, even on a 64 bit machine. The following example setting
5206 prefers 64 bit if available:
5208 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5210 * The preliminary Isabelle/jEdit application demonstrates the emerging
5211 Isabelle/Scala layer for advanced prover interaction and integration.
5212 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5215 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5216 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5217 similar to the default assignment of the document preparation system
5218 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5219 provides some operations for direct access to the font without asking
5220 the user for manual installation.
5224 New in Isabelle2009-1 (December 2009)
5225 -------------------------------------
5229 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5230 one backslash should be used, even in ML sources.
5235 * Locale interpretation propagates mixins along the locale hierarchy.
5236 The currently only available mixins are the equations used to map
5237 local definitions to terms of the target domain of an interpretation.
5239 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5240 loc" to print all interpretations of locale "loc" in the theory.
5241 Interpretations in proofs are not shown.
5243 * Thoroughly revised locales tutorial. New section on conditional
5246 * On instantiation of classes, remaining undefined class parameters
5247 are formally declared. INCOMPATIBILITY.
5250 *** Document preparation ***
5252 * New generalized style concept for printing terms: @{foo (style) ...}
5253 instead of @{foo_style style ...} (old form is still retained for
5254 backward compatibility). Styles can be also applied for
5255 antiquotations prop, term_type and typeof.
5260 * New proof method "smt" for a combination of first-order logic with
5261 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5262 fixed-size bitvectors; there is also basic support for higher-order
5263 features (esp. lambda abstractions). It is an incomplete decision
5264 procedure based on external SMT solvers using the oracle mechanism;
5265 for the SMT solver Z3, this method is proof-producing. Certificates
5266 are provided to avoid calling the external solvers solely for
5267 re-checking proofs. Due to a remote SMT service there is no need for
5268 installing SMT solvers locally. See src/HOL/SMT.
5270 * New commands to load and prove verification conditions generated by
5271 the Boogie program verifier or derived systems (e.g. the Verifying C
5272 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5274 * New counterexample generator tool 'nitpick' based on the Kodkod
5275 relational model finder. See src/HOL/Tools/Nitpick and
5276 src/HOL/Nitpick_Examples.
5278 * New commands 'code_pred' and 'values' to invoke the predicate
5279 compiler and to enumerate values of inductive predicates.
5281 * A tabled implementation of the reflexive transitive closure.
5283 * New implementation of quickcheck uses generic code generator;
5284 default generators are provided for all suitable HOL types, records
5285 and datatypes. Old quickcheck can be re-activated importing theory
5286 Library/SML_Quickcheck.
5288 * New testing tool Mirabelle for automated proof tools. Applies
5289 several tools and tactics like sledgehammer, metis, or quickcheck, to
5290 every proof step in a theory. To be used in batch mode via the
5291 "mirabelle" utility.
5293 * New proof method "sos" (sum of squares) for nonlinear real
5294 arithmetic (originally due to John Harison). It requires theory
5295 Library/Sum_Of_Squares. It is not a complete decision procedure but
5296 works well in practice on quantifier-free real arithmetic with +, -,
5297 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5298 inequalities between polynomials. It makes use of external
5299 semidefinite programming solvers. Method "sos" generates a
5300 certificate that can be pasted into the proof thus avoiding the need
5301 to call an external tool every time the proof is checked. See
5302 src/HOL/Library/Sum_Of_Squares.
5304 * New method "linarith" invokes existing linear arithmetic decision
5307 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5309 * New Sledgehammer option "Full Types" in Proof General settings menu.
5310 Causes full type information to be output to the ATPs. This slows
5311 ATPs down considerably but eliminates a source of unsound "proofs"
5314 * New method "metisFT": A version of metis that uses full type
5315 information in order to avoid failures of proof reconstruction.
5317 * New evaluator "approximate" approximates an real valued term using
5318 the same method as the approximation method.
5320 * Method "approximate" now supports arithmetic expressions as
5321 boundaries of intervals and implements interval splitting and Taylor
5324 * ML antiquotation @{code_datatype} inserts definition of a datatype
5325 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5327 * New theory SupInf of the supremum and infimum operators for sets of
5330 * New theory Probability, which contains a development of measure
5331 theory, eventually leading to Lebesgue integration and probability.
5333 * Extended Multivariate Analysis to include derivation and Brouwer's
5336 * Reorganization of number theory, INCOMPATIBILITY:
5337 - new number theory development for nat and int, in theories Divides
5338 and GCD as well as in new session Number_Theory
5339 - some constants and facts now suffixed with _nat and _int
5341 - former session NumberTheory now named Old_Number_Theory, including
5342 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5343 - moved theory Pocklington from src/HOL/Library to
5344 src/HOL/Old_Number_Theory
5346 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5347 lcm of finite and infinite sets. It is shown that they form a complete
5350 * Class semiring_div requires superclass no_zero_divisors and proof of
5351 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5352 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5353 generalized to class semiring_div, subsuming former theorems
5354 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5355 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5358 * Refinements to lattice classes and sets:
5359 - less default intro/elim rules in locale variant, more default
5360 intro/elim rules in class variant: more uniformity
5361 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5363 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5365 - renamed ACI to inf_sup_aci
5366 - new class "boolean_algebra"
5367 - class "complete_lattice" moved to separate theory
5368 "Complete_Lattice"; corresponding constants (and abbreviations)
5369 renamed and with authentic syntax:
5370 Set.Inf ~> Complete_Lattice.Inf
5371 Set.Sup ~> Complete_Lattice.Sup
5372 Set.INFI ~> Complete_Lattice.INFI
5373 Set.SUPR ~> Complete_Lattice.SUPR
5374 Set.Inter ~> Complete_Lattice.Inter
5375 Set.Union ~> Complete_Lattice.Union
5376 Set.INTER ~> Complete_Lattice.INTER
5377 Set.UNION ~> Complete_Lattice.UNION
5378 - authentic syntax for
5381 - mere abbreviations:
5384 Set.inter (for inf, formerly Set.Int)
5385 Set.union (for sup, formerly Set.Un)
5386 Complete_Lattice.Inter (for Inf)
5387 Complete_Lattice.Union (for Sup)
5388 Complete_Lattice.INTER (for INFI)
5389 Complete_Lattice.UNION (for SUPR)
5390 - object-logic definitions as far as appropriate
5392 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5393 Un_subset_iff are explicitly deleted as default simp rules; then also
5394 their lattice counterparts le_inf_iff and le_sup_iff have to be
5395 deleted to achieve the desired effect.
5397 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5398 rules by default any longer; the same applies to min_max.inf_absorb1
5399 etc. INCOMPATIBILITY.
5401 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5402 pred_set_conv by default. INCOMPATIBILITY.
5404 * Power operations on relations and functions are now one dedicated
5405 constant "compow" with infix syntax "^^". Power operation on
5406 multiplicative monoids retains syntax "^" and is now defined generic
5407 in class power. INCOMPATIBILITY.
5409 * Relation composition "R O S" now has a more standard argument order:
5410 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5411 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5412 break, since the O_assoc rule was not rewritten like this. Fix using
5413 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5415 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5416 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5419 * Most rules produced by inductive and datatype package have mandatory
5420 prefixes. INCOMPATIBILITY.
5422 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5423 the attribute of the same name. Each of the theorems in the list
5424 DERIV_intros assumes composition with an additional function and
5425 matches a variable to the derivative, which has to be solved by the
5426 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5427 of most elementary terms. Former Maclauren.DERIV_tac and
5428 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5431 * Code generator attributes follow the usual underscore convention:
5432 code_unfold replaces code unfold
5433 code_post replaces code post
5438 sizechange -> size_change
5439 induct_scheme -> induction_schema
5442 * Discontinued abbreviation "arbitrary" of constant "undefined".
5443 INCOMPATIBILITY, use "undefined" directly.
5446 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5447 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5448 Suc_plus1 -> Suc_eq_plus1
5449 *anti_sym -> *antisym*
5450 vector_less_eq_def -> vector_le_def
5453 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5456 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5462 * Theory Representable defines a class "rep" of domains that are
5463 representable (via an ep-pair) in the universal domain type "udom".
5464 Instances are provided for all type constructors defined in HOLCF.
5466 * The 'new_domain' command is a purely definitional version of the
5467 domain package, for representable domains. Syntax is identical to the
5468 old domain package. The 'new_domain' package also supports indirect
5469 recursion using previously-defined type constructors. See
5470 src/HOLCF/ex/New_Domain.thy for examples.
5472 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5473 on the left-hand side of an equation, and then performs
5474 simplification. Rewriting is done using rules declared with the
5475 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5476 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5478 * The pattern-match compiler in 'fixrec' can now handle constructors
5479 with HOL function types. Pattern-match combinators for the Pair
5480 constructor are pre-configured.
5482 * The 'fixrec' package now produces better fixed-point induction rules
5483 for mutually-recursive definitions: Induction rules have conclusions
5484 of the form "P foo bar" instead of "P <foo, bar>".
5486 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5487 been renamed to "below". The name "below" now replaces "less" in many
5488 theorem names. (Legacy theorem names using "less" are still supported
5491 * The 'fixrec' package now supports "bottom patterns". Bottom
5492 patterns can be used to generate strictness rules, or to make
5493 functions more strict (much like the bang-patterns supported by the
5494 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5500 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5501 errors and run-time exceptions, including detailed source positions.
5503 * Structure Name_Space (formerly NameSpace) now manages uniquely
5504 identified entries, with some additional information such as source
5505 position, logical grouping etc.
5507 * Theory and context data is now introduced by the simplified and
5508 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5509 to be pure, but the old TheoryDataFun for mutable data (with explicit
5510 copy operation) is still available for some time.
5512 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5513 provides a high-level programming interface to synchronized state
5514 variables with atomic update. This works via pure function
5515 application within a critical section -- its runtime should be as
5516 short as possible; beware of deadlocks if critical code is nested,
5517 either directly or indirectly via other synchronized variables!
5519 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5520 wraps raw ML references, explicitly indicating their non-thread-safe
5521 behaviour. The Isar toplevel keeps this structure open, to
5522 accommodate Proof General as well as quick and dirty interactive
5523 experiments with references.
5525 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5526 parallel tactical reasoning.
5528 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5529 are similar to SUBPROOF, but are slightly more flexible: only the
5530 specified parts of the subgoal are imported into the context, and the
5531 body tactic may introduce new subgoals and schematic variables.
5533 * Old tactical METAHYPS, which does not observe the proof context, has
5534 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5535 or Subgoal.FOCUS etc.
5537 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5538 functors have their own ML name space there is no point to mark them
5539 separately.) Minor INCOMPATIBILITY.
5541 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5543 * Renamed several structures FooBar to Foo_Bar. Occasional,
5546 * Operations of structure Skip_Proof no longer require quick_and_dirty
5547 mode, which avoids critical setmp.
5549 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5550 combinators for "args". INCOMPATIBILITY, need to use simplified
5551 Attrib/Method.setup introduced in Isabelle2009.
5553 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5554 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5555 last resort. INCOMPATIBILITY.
5557 * Display.pretty_thm now requires a proper context (cf. former
5558 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5559 or even Display.pretty_thm_without_context as last resort.
5562 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5563 Syntax.pretty_typ/term directly, preferably with proper context
5564 instead of global theory.
5569 * Further fine tuning of parallel proof checking, scales up to 8 cores
5570 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5573 * Support for additional "Isabelle components" via etc/components, see
5574 also the system manual.
5576 * The isabelle makeall tool now operates on all components with
5577 IsaMakefile, not just hardwired "logics".
5579 * Removed "compress" option from isabelle-process and isabelle usedir;
5580 this is always enabled.
5582 * Discontinued support for Poly/ML 4.x versions.
5584 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5585 on a given logic image. This requires the lighttpd webserver and is
5586 currently supported on Linux only.
5590 New in Isabelle2009 (April 2009)
5591 --------------------------------
5595 * Simplified main Isabelle executables, with less surprises on
5596 case-insensitive file-systems (such as Mac OS).
5598 - The main Isabelle tool wrapper is now called "isabelle" instead of
5601 - The former "isabelle" alias for "isabelle-process" has been
5602 removed (should rarely occur to regular users).
5604 - The former "isabelle-interface" and its alias "Isabelle" have been
5605 removed (interfaces are now regular Isabelle tools).
5607 Within scripts and make files, the Isabelle environment variables
5608 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5609 respectively. (The latter are still available as legacy feature.)
5611 The old isabelle-interface wrapper could react in confusing ways if
5612 the interface was uninstalled or changed otherwise. Individual
5613 interface tool configuration is now more explicit, see also the
5614 Isabelle system manual. In particular, Proof General is now available
5615 via "isabelle emacs".
5617 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5618 purge installed copies of Isabelle executables and re-run "isabelle
5619 install -p ...", or use symlinks.
5621 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5622 old ~/isabelle, which was slightly non-standard and apt to cause
5623 surprises on case-insensitive file-systems (such as Mac OS).
5625 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5626 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5627 care is required when using older releases of Isabelle. Note that
5628 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5629 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5631 * Proofs of fully specified statements are run in parallel on
5632 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5633 a regular 4-core machine, if the initial heap space is made reasonably
5634 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5636 * The main reference manuals ("isar-ref", "implementation", and
5637 "system") have been updated and extended. Formally checked references
5638 as hyperlinks are now available uniformly.
5643 * Complete re-implementation of locales. INCOMPATIBILITY in several
5644 respects. The most important changes are listed below. See the
5645 Tutorial on Locales ("locales" manual) for details.
5647 - In locale expressions, instantiation replaces renaming. Parameters
5648 must be declared in a for clause. To aid compatibility with previous
5649 parameter inheritance, in locale declarations, parameters that are not
5650 'touched' (instantiation position "_" or omitted) are implicitly added
5651 with their syntax at the beginning of the for clause.
5653 - Syntax from abbreviations and definitions in locales is available in
5654 locale expressions and context elements. The latter is particularly
5655 useful in locale declarations.
5657 - More flexible mechanisms to qualify names generated by locale
5658 expressions. Qualifiers (prefixes) may be specified in locale
5659 expressions, and can be marked as mandatory (syntax: "name!:") or
5660 optional (syntax "name?:"). The default depends for plain "name:"
5661 depends on the situation where a locale expression is used: in
5662 commands 'locale' and 'sublocale' prefixes are optional, in
5663 'interpretation' and 'interpret' prefixes are mandatory. The old
5664 implicit qualifiers derived from the parameter names of a locale are
5665 no longer generated.
5667 - Command "sublocale l < e" replaces "interpretation l < e". The
5668 instantiation clause in "interpretation" and "interpret" (square
5669 brackets) is no longer available. Use locale expressions.
5671 - When converting proof scripts, mandatory qualifiers in
5672 'interpretation' and 'interpret' should be retained by default, even
5673 if this is an INCOMPATIBILITY compared to former behavior. In the
5674 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5675 in locale expressions range over a single locale instance only.
5677 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5678 In existing theorem specifications replace the includes element by the
5679 respective context elements of the included locale, omitting those
5680 that are already present in the theorem specification. Multiple
5681 assume elements of a locale should be replaced by a single one
5682 involving the locale predicate. In the proof body, declarations (most
5683 notably theorems) may be regained by interpreting the respective
5684 locales in the proof context as required (command "interpret").
5686 If using "includes" in replacement of a target solely because the
5687 parameter types in the theorem are not as general as in the target,
5688 consider declaring a new locale with additional type constraints on
5689 the parameters (context element "constrains").
5691 - Discontinued "locale (open)". INCOMPATIBILITY.
5693 - Locale interpretation commands no longer attempt to simplify goal.
5694 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5695 methods intro_locales and unfold_locales to clarify.
5697 - Locale interpretation commands no longer accept interpretation
5698 attributes. INCOMPATIBILITY.
5700 * Class declaration: so-called "base sort" must not be given in import
5701 list any longer, but is inferred from the specification. Particularly
5708 class foo = type + ...
5710 * Class target: global versions of theorems stemming do not carry a
5711 parameter prefix any longer. INCOMPATIBILITY.
5713 * Class 'instance' command no longer accepts attached definitions.
5714 INCOMPATIBILITY, use proper 'instantiation' target instead.
5716 * Recovered hiding of consts, which was accidentally broken in
5717 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5718 makes c inaccessible; consider using ``hide (open) const c'' instead.
5720 * Slightly more coherent Pure syntax, with updated documentation in
5721 isar-ref manual. Removed locales meta_term_syntax and
5722 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5723 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5724 directly in regular applications.
5726 * There is a new syntactic category "float_const" for signed decimal
5727 fractions (e.g. 123.45 or -123.45).
5729 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5730 interface with 'setup' command instead.
5732 * Command 'local_setup' is similar to 'setup', but operates on a local
5735 * The 'axiomatization' command now only works within a global theory
5736 context. INCOMPATIBILITY.
5738 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5739 hypotheses. Sorts required in the course of reasoning need to be
5740 covered by the constraints in the initial statement, completed by the
5741 type instance information of the background theory. Non-trivial sort
5742 hypotheses, which rarely occur in practice, may be specified via
5743 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5745 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5747 The result contains an implicit sort hypotheses as before --
5748 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5751 * Generalized Isar history, with support for linear undo, direct state
5754 * Changed defaults for unify configuration options:
5756 unify_trace_bound = 50 (formerly 25)
5757 unify_search_bound = 60 (formerly 30)
5759 * Different bookkeeping for code equations (INCOMPATIBILITY):
5761 a) On theory merge, the last set of code equations for a particular
5762 constant is taken (in accordance with the policy applied by other
5763 parts of the code generator framework).
5765 b) Code equations stemming from explicit declarations (e.g. code
5766 attribute) gain priority over default code equations stemming
5767 from definition, primrec, fun etc.
5769 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5771 * Unified theorem tables for both code generators. Thus [code
5772 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5774 * Command 'find_consts' searches for constants based on type and name
5777 find_consts "_ => bool"
5779 By default, matching is against subtypes, but it may be restricted to
5780 the whole type. Searching by name is possible. Multiple queries are
5781 conjunctive and queries may be negated by prefixing them with a
5784 find_consts strict: "_ => bool" name: "Int" -"int => int"
5786 * New 'find_theorems' criterion "solves" matches theorems that
5787 directly solve the current goal (modulo higher-order unification).
5789 * Auto solve feature for main theorem statements: whenever a new goal
5790 is stated, "find_theorems solves" is called; any theorems that could
5791 solve the lemma directly are listed as part of the goal state.
5792 Cf. associated options in Proof General Isabelle settings menu,
5793 enabled by default, with reasonable timeout for pathological cases of
5794 higher-order unification.
5797 *** Document preparation ***
5799 * Antiquotation @{lemma} now imitates a regular terminal proof,
5800 demanding keyword 'by' and supporting the full method expression
5801 syntax just like the Isar command 'by'.
5806 * Integrated main parts of former image HOL-Complex with HOL. Entry
5807 points Main and Complex_Main remain as before.
5809 * Logic image HOL-Plain provides a minimal HOL with the most important
5810 tools available (inductive, datatype, primrec, ...). This facilitates
5811 experimentation and tool development. Note that user applications
5812 (and library theories) should never refer to anything below theory
5815 * Logic image HOL-Main stops at theory Main, and thus facilitates
5816 experimentation due to shorter build times.
5818 * Logic image HOL-NSA contains theories of nonstandard analysis which
5819 were previously part of former HOL-Complex. Entry point Hyperreal
5820 remains valid, but theories formerly using Complex_Main should now use
5821 new entry point Hypercomplex.
5823 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5824 Posix processes. Avoids potentially expensive forking of the ML
5825 process. New thread-based implementation also works on non-Unix
5826 platforms (Cygwin). Provers are no longer hardwired, but defined
5827 within the theory via plain ML wrapper functions. Basic Sledgehammer
5828 commands are covered in the isar-ref manual.
5830 * Wrapper scripts for remote SystemOnTPTP service allows to use
5831 sledgehammer without local ATP installation (Vampire etc.). Other
5832 provers may be included via suitable ML wrappers, see also
5833 src/HOL/ATP_Linkup.thy.
5835 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5838 * The metis method no longer fails because the theorem is too trivial
5839 (contains the empty clause).
5841 * The metis method now fails in the usual manner, rather than raising
5842 an exception, if it determines that it cannot prove the theorem.
5844 * Method "coherent" implements a prover for coherent logic (see also
5845 src/Tools/coherent.ML).
5847 * Constants "undefined" and "default" replace "arbitrary". Usually
5848 "undefined" is the right choice to replace "arbitrary", though
5849 logically there is no difference. INCOMPATIBILITY.
5851 * Command "value" now integrates different evaluation mechanisms. The
5852 result of the first successful evaluation mechanism is printed. In
5853 square brackets a particular named evaluation mechanisms may be
5854 specified (currently, [SML], [code] or [nbe]). See further
5855 src/HOL/ex/Eval_Examples.thy.
5857 * Normalization by evaluation now allows non-leftlinear equations.
5858 Declare with attribute [code nbe].
5860 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5861 as the structured Isar versions "cases" and "induct", cf. the
5862 corresponding "cases" and "induct" attributes. Mutual induction rules
5863 are now presented as a list of individual projections
5864 (e.g. foo_bar.inducts for types foo and bar); the old format with
5865 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5866 rare situations a different rule is selected --- notably nested tuple
5867 elimination instead of former prod.exhaust: use explicit (case_tac t
5868 rule: prod.exhaust) here.
5870 * Attributes "cases", "induct", "coinduct" support "del" option.
5872 * Removed fact "case_split_thm", which duplicates "case_split".
5874 * The option datatype has been moved to a new theory Option. Renamed
5875 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5877 * New predicate "strict_mono" classifies strict functions on partial
5878 orders. With strict functions on linear orders, reasoning about
5879 (in)equalities is facilitated by theorems "strict_mono_eq",
5880 "strict_mono_less_eq" and "strict_mono_less".
5882 * Some set operations are now proper qualified constants with
5883 authentic syntax. INCOMPATIBILITY:
5894 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5897 * Auxiliary class "itself" has disappeared -- classes without any
5898 parameter are treated as expected by the 'class' command.
5900 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5902 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5903 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5905 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5906 method "approximation". It proves formulas on real values by using
5907 interval arithmetic. In the formulas are also the transcendental
5908 functions sin, cos, tan, atan, ln, exp and the constant pi are
5909 allowed. For examples see
5910 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5912 * Theory "Reflection" now resides in HOL/Library.
5914 * Entry point to Word library now simply named "Word".
5917 * Made source layout more coherent with logical distribution
5920 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5921 src/HOL/Library/Code_Message.thy ~> src/HOL/
5922 src/HOL/Library/GCD.thy ~> src/HOL/
5923 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5924 src/HOL/Library/Parity.thy ~> src/HOL/
5925 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5926 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5927 src/HOL/Real/Lubs.thy ~> src/HOL/
5928 src/HOL/Real/PReal.thy ~> src/HOL/
5929 src/HOL/Real/Rational.thy ~> src/HOL/
5930 src/HOL/Real/RComplete.thy ~> src/HOL/
5931 src/HOL/Real/RealDef.thy ~> src/HOL/
5932 src/HOL/Real/RealPow.thy ~> src/HOL/
5933 src/HOL/Real/Real.thy ~> src/HOL/
5934 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5935 src/HOL/Complex/Complex.thy ~> src/HOL/
5936 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5937 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5938 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5939 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5940 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5941 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5942 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5943 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5944 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5945 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5946 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5947 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5948 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5949 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5950 src/HOL/Real/Float ~> src/HOL/Library/
5951 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5952 src/HOL/Real/RealVector.thy ~> src/HOL/
5954 src/HOL/arith_data.ML ~> src/HOL/Tools
5955 src/HOL/hologic.ML ~> src/HOL/Tools
5956 src/HOL/simpdata.ML ~> src/HOL/Tools
5957 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5958 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5959 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5960 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5961 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5962 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5963 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5965 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5966 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5967 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5968 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5969 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5970 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5972 * If methods "eval" and "evaluation" encounter a structured proof
5973 state with !!/==>, only the conclusion is evaluated to True (if
5974 possible), avoiding strange error messages.
5976 * Method "sizechange" automates termination proofs using (a
5977 modification of) the size-change principle. Requires SAT solver. See
5978 src/HOL/ex/Termination.thy for examples.
5980 * Simplifier: simproc for let expressions now unfolds if bound
5981 variable occurs at most once in let expression body. INCOMPATIBILITY.
5983 * Method "arith": Linear arithmetic now ignores all inequalities when
5984 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5986 * New attribute "arith" for facts that should always be used
5987 automatically by arithmetic. It is intended to be used locally in
5990 assumes [arith]: "x > 0"
5992 Global usage is discouraged because of possible performance impact.
5994 * New classes "top" and "bot" with corresponding operations "top" and
5995 "bot" in theory Orderings; instantiation of class "complete_lattice"
5996 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5998 * Changed definition lemma "less_fun_def" in order to provide an
5999 instance for preorders on functions; use lemma "less_le" instead.
6002 * Theory Orderings: class "wellorder" moved here, with explicit
6003 induction rule "less_induct" as assumption. For instantiation of
6004 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
6007 * Theory Orderings: added class "preorder" as superclass of "order".
6008 INCOMPATIBILITY: Instantiation proofs for order, linorder
6009 etc. slightly changed. Some theorems named order_class.* now named
6012 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
6015 * Theory Finite_Set: added a new fold combinator of type
6017 ('a => 'b => 'b) => 'b => 'a set => 'b
6019 Occasionally this is more convenient than the old fold combinator
6020 which is now defined in terms of the new one and renamed to
6023 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
6024 and "ring_simps" have been replaced by "algebra_simps" (which can be
6025 extended with further lemmas!). At the moment both still exist but
6026 the former will disappear at some point.
6028 * Theory Power: Lemma power_Suc is now declared as a simp rule in
6029 class recpower. Type-specific simp rules for various recpower types
6030 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
6032 rat_power_0 -> power_0
6033 rat_power_Suc -> power_Suc
6034 realpow_0 -> power_0
6035 realpow_Suc -> power_Suc
6036 complexpow_0 -> power_0
6037 complexpow_Suc -> power_Suc
6038 power_poly_0 -> power_0
6039 power_poly_Suc -> power_Suc
6041 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
6042 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
6043 dvd has been generalized to class comm_semiring_1. Likewise a bunch
6044 of lemmas from Divides has been generalized from nat to class
6045 semiring_div. INCOMPATIBILITY. This involves the following theorem
6046 renames resulting from duplicate elimination:
6048 dvd_def_mod ~> dvd_eq_mod_eq_0
6049 zero_dvd_iff ~> dvd_0_left_iff
6050 dvd_0 ~> dvd_0_right
6051 DIVISION_BY_ZERO_DIV ~> div_by_0
6052 DIVISION_BY_ZERO_MOD ~> mod_by_0
6053 mult_div ~> div_mult_self2_is_id
6054 mult_mod ~> mod_mult_self2_is_0
6056 * Theory IntDiv: removed many lemmas that are instances of class-based
6057 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
6058 rename old lemmas as follows:
6060 dvd_diff -> nat_dvd_diff
6061 dvd_zminus_iff -> dvd_minus_iff
6062 mod_add1_eq -> mod_add_eq
6063 mod_mult1_eq -> mod_mult_right_eq
6064 mod_mult1_eq' -> mod_mult_left_eq
6065 mod_mult_distrib_mod -> mod_mult_eq
6066 nat_mod_add_left_eq -> mod_add_left_eq
6067 nat_mod_add_right_eq -> mod_add_right_eq
6068 nat_mod_div_trivial -> mod_div_trivial
6069 nat_mod_mod_trivial -> mod_mod_trivial
6070 zdiv_zadd_self1 -> div_add_self1
6071 zdiv_zadd_self2 -> div_add_self2
6072 zdiv_zmult_self1 -> div_mult_self2_is_id
6073 zdiv_zmult_self2 -> div_mult_self1_is_id
6074 zdvd_triv_left -> dvd_triv_left
6075 zdvd_triv_right -> dvd_triv_right
6076 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
6077 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6078 zmod_zadd_left_eq -> mod_add_left_eq
6079 zmod_zadd_right_eq -> mod_add_right_eq
6080 zmod_zadd_self1 -> mod_add_self1
6081 zmod_zadd_self2 -> mod_add_self2
6082 zmod_zadd1_eq -> mod_add_eq
6083 zmod_zdiff1_eq -> mod_diff_eq
6084 zmod_zdvd_zmod -> mod_mod_cancel
6085 zmod_zmod_cancel -> mod_mod_cancel
6086 zmod_zmult_self1 -> mod_mult_self2_is_0
6087 zmod_zmult_self2 -> mod_mult_self1_is_0
6090 zdvd_abs1 -> abs_dvd_iff
6091 zdvd_abs2 -> dvd_abs_iff
6092 zdvd_refl -> dvd_refl
6093 zdvd_trans -> dvd_trans
6094 zdvd_zadd -> dvd_add
6095 zdvd_zdiff -> dvd_diff
6096 zdvd_zminus_iff -> dvd_minus_iff
6097 zdvd_zminus2_iff -> minus_dvd_iff
6098 zdvd_zmultD -> dvd_mult_right
6099 zdvd_zmultD2 -> dvd_mult_left
6100 zdvd_zmult_mono -> mult_dvd_mono
6101 zdvd_0_right -> dvd_0_right
6102 zdvd_0_left -> dvd_0_left_iff
6103 zdvd_1_left -> one_dvd
6104 zminus_dvd_iff -> minus_dvd_iff
6106 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6108 * The real numbers offer decimal input syntax: 12.34 is translated
6109 into 1234/10^2. This translation is not reversed upon output.
6111 * Theory Library/Polynomial defines an abstract type 'a poly of
6112 univariate polynomials with coefficients of type 'a. In addition to
6113 the standard ring operations, it also supports div and mod. Code
6114 generation is also supported, using list-style constructors.
6116 * Theory Library/Inner_Product defines a class of real_inner for real
6117 inner product spaces, with an overloaded operation inner :: 'a => 'a
6118 => real. Class real_inner is a subclass of real_normed_vector from
6121 * Theory Library/Product_Vector provides instances for the product
6122 type 'a * 'b of several classes from RealVector and Inner_Product.
6123 Definitions of addition, subtraction, scalar multiplication, norms,
6124 and inner products are included.
6126 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6127 addition to the field operations, numerals and case syntax are also
6130 * Theory Library/Diagonalize provides constructive version of Cantor's
6131 first diagonalization argument.
6133 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6134 zlcm (for int); carried together from various gcd/lcm developements in
6135 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6136 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6137 may recover tupled syntax as follows:
6139 hide (open) const gcd
6140 abbreviation gcd where
6141 "gcd == (%(a, b). GCD.gcd a b)"
6143 GCD.gcd ("gcd '(_, _')")
6145 The same works for lcm, zgcd, zlcm.
6147 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6148 instantiations for algebraic structures. Removed some duplicate
6149 theorems. Changes in simp rules. INCOMPATIBILITY.
6151 * ML antiquotation @{code} takes a constant as argument and generates
6152 corresponding code in background and inserts name of the corresponding
6153 resulting ML value/function/datatype constructor binding in place.
6154 All occurrences of @{code} with a single ML block are generated
6155 simultaneously. Provides a generic and safe interface for
6156 instrumentalizing code generation. See
6157 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6158 In future you ought to refrain from ad-hoc compiling generated SML
6159 code on the ML toplevel. Note that (for technical reasons) @{code}
6160 cannot refer to constants for which user-defined serializations are
6161 set. Refer to the corresponding ML counterpart directly in that
6164 * Command 'rep_datatype': instead of theorem names the command now
6165 takes a list of terms denoting the constructors of the type to be
6166 represented as datatype. The characteristic theorems have to be
6167 proven. INCOMPATIBILITY. Also observe that the following theorems
6168 have disappeared in favour of existing ones:
6170 unit_induct ~> unit.induct
6171 prod_induct ~> prod.induct
6172 sum_induct ~> sum.induct
6173 Suc_Suc_eq ~> nat.inject
6174 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6179 * New locales for orders and lattices where the equivalence relation
6180 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6181 locales use a record structure with field eq for the equivalence.
6183 * New theory of factorial domains.
6185 * Units_l_inv and Units_r_inv are now simp rules by default.
6186 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6187 and/or r_inv will now also require deletion of these lemmas.
6189 * Renamed the following theorems, INCOMPATIBILITY:
6191 UpperD ~> Upper_memD
6192 LowerD ~> Lower_memD
6193 least_carrier ~> least_closed
6194 greatest_carrier ~> greatest_closed
6195 greatest_Lower_above ~> greatest_Lower_below
6196 one_zero ~> carrier_one_zero
6197 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6202 * Nominal datatypes can now contain type-variables.
6204 * Commands 'nominal_inductive' and 'equivariance' work with local
6207 * Nominal primrec can now works with local theory targets and its
6208 specification syntax now conforms to the general format as seen in
6211 * Method "perm_simp" honours the standard simplifier attributes
6212 (no_asm), (no_asm_use) etc.
6214 * The new predicate #* is defined like freshness, except that on the
6215 left hand side can be a set or list of atoms.
6217 * Experimental command 'nominal_inductive2' derives strong induction
6218 principles for inductive definitions. In contrast to
6219 'nominal_inductive', which can only deal with a fixed number of
6220 binders, it can deal with arbitrary expressions standing for sets of
6221 atoms to be avoided. The only inductive definition we have at the
6222 moment that needs this generalisation is the typing rule for Lets in
6225 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6226 -----------------------------------------------------------------
6227 Gamma |- Let x be t1 in t2 : T2
6229 In this rule one wants to avoid all the binders that are introduced by
6230 "close Gamma T1". We are looking for other examples where this
6231 feature might be useful. Please let us know.
6236 * Reimplemented the simplification procedure for proving continuity
6237 subgoals. The new simproc is extensible; users can declare additional
6238 continuity introduction rules with the attribute [cont2cont].
6240 * The continuity simproc now uses a different introduction rule for
6241 solving continuity subgoals on terms with lambda abstractions. In
6242 some rare cases the new simproc may fail to solve subgoals that the
6243 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6244 Potential INCOMPATIBILITY.
6246 * Command 'fixrec': specification syntax now conforms to the general
6247 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6248 examples. INCOMPATIBILITY.
6253 * Proof of Zorn's Lemma for partial orders.
6258 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6259 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6260 depends on multithreading, so timouts will not work before Poly/ML
6263 * High-level support for concurrent ML programming, see
6264 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6265 particularly convenient to organize independent functional
6266 computations. The concept of "synchronized variables" provides a
6267 higher-order interface for components with shared state, avoiding the
6268 delicate details of mutexes and condition variables. (Requires
6269 Poly/ML 5.2.1 or later.)
6271 * ML bindings produced via Isar commands are stored within the Isar
6272 context (theory or proof). Consequently, commands like 'use' and 'ML'
6273 become thread-safe and work with undo as expected (concerning
6274 top-level bindings, not side-effects on global references).
6275 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6276 compiler at runtime; really global bindings need to be given outside a
6277 theory. (Requires Poly/ML 5.2 or later.)
6279 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6280 context. Top-level ML bindings are stored within the proof context in
6281 a purely sequential fashion, disregarding the nested proof structure.
6282 ML bindings introduced by 'ML_prf' are discarded at the end of the
6283 proof. (Requires Poly/ML 5.2 or later.)
6285 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6286 and Method.setup, as well as Isar commands 'attribute_setup' and
6287 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6288 existing code accordingly, or use plain 'setup' together with old
6291 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6292 to 'a -> thm, while results are always tagged with an authentic oracle
6293 name. The Isar command 'oracle' is now polymorphic, no argument type
6294 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6295 accordingly. Note that extra performance may be gained by producing
6296 the cterm carefully, avoiding slow Thm.cterm_of.
6298 * Simplified interface for defining document antiquotations via
6299 ThyOutput.antiquotation, ThyOutput.output, and optionally
6300 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6301 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6304 * More systematic treatment of long names, abstract name bindings, and
6305 name space operations. Basic operations on qualified names have been
6306 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6307 Long_Name.append. Old type bstring has been mostly replaced by
6308 abstract type binding (see structure Binding), which supports precise
6309 qualification by packages and local theory targets, as well as proper
6310 tracking of source positions. INCOMPATIBILITY, need to wrap old
6311 bstring values into Binding.name, or better pass through abstract
6312 bindings everywhere. See further src/Pure/General/long_name.ML,
6313 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6315 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6316 LocalTheory.note etc.) now refer to the *full* internal name, not the
6317 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6319 * Disposed old type and term read functions (Sign.read_def_typ,
6320 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6321 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6322 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6323 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6324 resort for legacy applications.
6326 * Disposed old declarations, tactics, tactic combinators that refer to
6327 the simpset or claset of an implicit theory (such as Addsimps,
6328 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6329 embedded ML text, or local_simpset_of with a proper context passed as
6330 explicit runtime argument.
6332 * Rules and tactics that read instantiations (read_instantiate,
6333 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6334 context, which is required for parsing and type-checking. Moreover,
6335 the variables are specified as plain indexnames, not string encodings
6336 thereof. INCOMPATIBILITY.
6338 * Generic Toplevel.add_hook interface allows to analyze the result of
6339 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6340 for theorem dependency output of transactions resulting in a new
6343 * ML antiquotations: block-structured compilation context indicated by
6344 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6346 @{binding name} - basic name binding
6347 @{let ?pat = term} - term abbreviation (HO matching)
6348 @{note name = fact} - fact abbreviation
6349 @{thm fact} - singleton fact (with attributes)
6350 @{thms fact} - general fact (with attributes)
6351 @{lemma prop by method} - singleton goal
6352 @{lemma prop by meth1 meth2} - singleton goal
6353 @{lemma prop1 ... propN by method} - general goal
6354 @{lemma prop1 ... propN by meth1 meth2} - general goal
6355 @{lemma (open) ...} - open derivation
6360 * The Isabelle "emacs" tool provides a specific interface to invoke
6361 Proof General / Emacs, with more explicit failure if that is not
6362 installed (the old isabelle-interface script silently falls back on
6363 isabelle-process). The PROOFGENERAL_HOME setting determines the
6364 installation location of the Proof General distribution.
6366 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6367 the Isabelle process into a JVM/Scala application. See
6368 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6369 process wrapper has been discontinued.)
6371 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6373 * Various status messages (with exact source position information) are
6374 emitted, if proper markup print mode is enabled. This allows
6375 user-interface components to provide detailed feedback on internal
6380 New in Isabelle2008 (June 2008)
6381 -------------------------------
6385 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6386 and updated, with formally checked references as hyperlinks.
6388 * Theory loader: use_thy (and similar operations) no longer set the
6389 implicit ML context, which was occasionally hard to predict and in
6390 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6391 provides a proper context already.
6393 * Theory loader: old-style ML proof scripts being *attached* to a thy
6394 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6395 'use' within a theory file will do the job.
6397 * Name space merge now observes canonical order, i.e. the second space
6398 is inserted into the first one, while existing entries in the first
6399 space take precedence. INCOMPATIBILITY in rare situations, may try to
6400 swap theory imports.
6402 * Syntax: symbol \<chi> is now considered a letter. Potential
6403 INCOMPATIBILITY in identifier syntax etc.
6405 * Outer syntax: string tokens no longer admit escaped white space,
6406 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6407 white space without escapes.
6409 * Outer syntax: string tokens may contain arbitrary character codes
6410 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6416 * Context-dependent token translations. Default setup reverts locally
6417 fixed variables, and adds hilite markup for undeclared frees.
6419 * Unused theorems can be found using the new command 'unused_thms'.
6420 There are three ways of invoking it:
6423 Only finds unused theorems in the current theory.
6425 (2) unused_thms thy_1 ... thy_n -
6426 Finds unused theorems in the current theory and all of its ancestors,
6427 excluding the theories thy_1 ... thy_n and all of their ancestors.
6429 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6430 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6431 their ancestors, excluding the theories thy_1 ... thy_n and all of
6434 In order to increase the readability of the list produced by
6435 unused_thms, theorems that have been created by a particular instance
6436 of a theory command such as 'inductive' or 'function' are considered
6437 to belong to the same "group", meaning that if at least one theorem in
6438 this group is used, the other theorems in the same group are no longer
6439 reported as unused. Moreover, if all theorems in the group are
6440 unused, only one theorem in the group is displayed.
6442 Note that proof objects have to be switched on in order for
6443 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6444 usually the case when using Proof General with the default settings).
6446 * Authentic naming of facts disallows ad-hoc overwriting of previous
6447 theorems within the same name space. INCOMPATIBILITY, need to remove
6448 duplicate fact bindings, or even accidental fact duplications. Note
6449 that tools may maintain dynamically scoped facts systematically, using
6450 PureThy.add_thms_dynamic.
6452 * Command 'hide' now allows to hide from "fact" name space as well.
6454 * Eliminated destructive theorem database, simpset, claset, and
6455 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6456 update of theories within ML code.
6458 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6459 INCOMPATIBILITY, object-logics depending on former Pure require
6460 additional setup PureThy.old_appl_syntax_setup; object-logics
6461 depending on former CPure need to refer to Pure.
6463 * Commands 'use' and 'ML' are now purely functional, operating on
6464 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6465 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6468 * Command 'setup': discontinued implicit version with ML reference.
6470 * Instantiation target allows for simultaneous specification of class
6471 instance operations together with an instantiation proof.
6472 Type-checking phase allows to refer to class operations uniformly.
6473 See src/HOL/Complex/Complex.thy for an Isar example and
6474 src/HOL/Library/Eval.thy for an ML example.
6476 * Indexing of literal facts: be more serious about including only
6477 facts from the visible specification/proof context, but not the
6478 background context (locale etc.). Affects `prop` notation and method
6479 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6482 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6483 "(open)" option, which used to expose internal bound variables to the
6486 * Isar statements: removed obsolete case "rule_context".
6487 INCOMPATIBILITY, better use explicit fixes/assumes.
6489 * Locale proofs: default proof step now includes 'unfold_locales';
6490 hence 'proof' without argument may be used to unfold locale
6494 *** Document preparation ***
6496 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6497 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6498 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6499 spot); renamed link color from "darkblue" to "linkcolor" (default
6500 value unchanged, can be redefined via \definecolor); no longer sets
6501 "a4paper" option (unnecessary or even intrusive).
6503 * Antiquotation @{lemma A method} proves proposition A by the given
6504 method (either a method name or a method name plus (optional) method
6505 arguments in parentheses) and prints A just like @{prop A}.
6510 * New primrec package. Specification syntax conforms in style to
6511 definition/function/.... No separate induction rule is provided. The
6512 "primrec" command distinguishes old-style and new-style specifications
6513 by syntax. The former primrec package is now named OldPrimrecPackage.
6514 When adjusting theories, beware: constants stemming from new-style
6515 primrec specifications have authentic syntax.
6517 * Metis prover is now an order of magnitude faster, and also works
6518 with multithreading.
6520 * Metis: the maximum number of clauses that can be produced from a
6521 theorem is now given by the attribute max_clauses. Theorems that
6522 exceed this number are ignored, with a warning printed.
6524 * Sledgehammer no longer produces structured proofs by default. To
6525 enable, declare [[sledgehammer_full = true]]. Attributes
6526 reconstruction_modulus, reconstruction_sorts renamed
6527 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6529 * Method "induct_scheme" derives user-specified induction rules
6530 from well-founded induction and completeness of patterns. This factors
6531 out some operations that are done internally by the function package
6532 and makes them available separately. See
6533 src/HOL/ex/Induction_Scheme.thy for examples.
6535 * More flexible generation of measure functions for termination
6536 proofs: Measure functions can be declared by proving a rule of the
6537 form "is_measure f" and giving it the [measure_function] attribute.
6538 The "is_measure" predicate is logically meaningless (always true), and
6539 just guides the heuristic. To find suitable measure functions, the
6540 termination prover sets up the goal "is_measure ?f" of the appropriate
6541 type and generates all solutions by Prolog-style backward proof using
6544 This setup also deals with rules like
6546 "is_measure f ==> is_measure (list_size f)"
6548 which accommodates nested datatypes that recurse through lists.
6549 Similar rules are predeclared for products and option types.
6551 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6555 - Definitions of overloaded constants on sets have to be replaced by
6556 definitions on => and bool.
6558 - Some definitions of overloaded operators on sets can now be proved
6559 using the definitions of the operators on => and bool. Therefore,
6560 the following theorems have been renamed:
6562 subset_def -> subset_eq
6563 psubset_def -> psubset_eq
6564 set_diff_def -> set_diff_eq
6565 Compl_def -> Compl_eq
6566 Sup_set_def -> Sup_set_eq
6567 Inf_set_def -> Inf_set_eq
6568 sup_set_def -> sup_set_eq
6569 inf_set_def -> inf_set_eq
6571 - Due to the incompleteness of the HO unification algorithm, some
6572 rules such as subst may require manual instantiation, if some of
6573 the unknowns in the rule is a set.
6575 - Higher order unification and forward proofs:
6578 have "P (S::'a set)" <...>
6579 then have "EX S. P S" ..
6581 no longer works (due to the incompleteness of the HO unification
6582 algorithm) and must be replaced by the pattern
6589 - Calculational reasoning with subst (or similar rules):
6592 have "P (S::'a set)" <...>
6593 also have "S = T" <...>
6594 finally have "P T" .
6596 no longer works (for similar reasons as the previous example) and
6597 must be replaced by something like
6599 have "P (S::'a set)" <...>
6600 moreover have "S = T" <...>
6601 ultimately have "P T" by simp
6603 - Tactics or packages written in ML code:
6604 Code performing pattern matching on types via
6606 Type ("set", [T]) => ...
6608 must be rewritten. Moreover, functions like strip_type or
6609 binder_types no longer return the right value when applied to a
6612 T1 => ... => Tn => U => bool
6616 T1 => ... => Tn => U set
6618 * Merged theories Wellfounded_Recursion, Accessible_Part and
6619 Wellfounded_Relations to theory Wellfounded.
6621 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6623 * Class finite no longer treats UNIV as class parameter. Use class
6624 enum from theory Library/Enum instead to achieve a similar effect.
6627 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6628 and "Cons". INCOMPATIBILITY.
6630 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6631 Potential INCOMPATIBILITY.
6633 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6634 injective_fst_snd removed, use split_eta and prod_eqI instead.
6635 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6637 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6638 the same name in theory Orderings:
6648 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6649 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6650 and different variable names.
6652 * Library/Option_ord.thy: Canonical order on option type.
6654 * Library/RBT.thy: Red-black trees, an efficient implementation of
6657 * Library/Countable.thy: Type class for countable types.
6659 * Theory Int: The representation of numerals has changed. The infix
6660 operator BIT and the bit datatype with constructors B0 and B1 have
6661 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6662 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6663 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6666 * Theory Nat: definition of <= and < on natural numbers no longer
6667 depend on well-founded relations. INCOMPATIBILITY. Definitions
6668 le_def and less_def have disappeared. Consider lemmas not_less
6669 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6671 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6672 (whose purpose mainly is for various fold_set functionals) have been
6673 abandoned in favor of the existing algebraic classes
6674 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6675 lower_semilattice (resp. upper_semilattice) and linorder.
6678 * Theory Transitive_Closure: induct and cases rules now declare proper
6679 case_names ("base" and "step"). INCOMPATIBILITY.
6681 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6682 lattices. The form set-specific version is available as
6683 Inductive.lfp_ordinal_induct_set.
6685 * Renamed theorems "power.simps" to "power_int.simps".
6688 * Class semiring_div provides basic abstract properties of semirings
6689 with division and modulo operations. Subsumes former class dvd_mod.
6691 * Merged theories IntDef, Numeral and IntArith into unified theory
6692 Int. INCOMPATIBILITY.
6694 * Theory Library/Code_Index: type "index" now represents natural
6695 numbers rather than integers. INCOMPATIBILITY.
6697 * New class "uminus" with operation "uminus" (split of from class
6698 "minus" which now only has operation "minus", binary).
6701 * Constants "card", "internal_split", "option_map" now with authentic
6702 syntax. INCOMPATIBILITY.
6704 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6705 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6706 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6707 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6708 Sup_set_def, le_def, less_def, option_map_def now with object
6709 equality. INCOMPATIBILITY.
6711 * Records. Removed K_record, and replaced it by pure lambda term
6712 %x. c. The simplifier setup is now more robust against eta expansion.
6713 INCOMPATIBILITY: in cases explicitly referring to K_record.
6715 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6717 * Library/ListVector: new theory of arithmetic vector operations.
6719 * Library/Order_Relation: new theory of various orderings as sets of
6720 pairs. Defines preorders, partial orders, linear orders and
6721 well-orders on sets and on types.
6726 * Renamed some theories to allow to loading both ZF and HOL in the
6729 Datatype -> Datatype_ZF
6730 Inductive -> Inductive_ZF
6737 INCOMPATIBILITY: ZF theories that import individual theories below
6738 Main might need to be adapted. Regular theory Main is still
6739 available, as trivial extension of Main_ZF.
6744 * ML within Isar: antiquotation @{const name} or @{const
6745 name(typargs)} produces statically-checked Const term.
6747 * Functor NamedThmsFun: data is available to the user as dynamic fact
6748 (of the same name). Removed obsolete print command.
6750 * Removed obsolete "use_legacy_bindings" function.
6752 * The ``print mode'' is now a thread-local value derived from a global
6753 template (the former print_mode reference), thus access becomes
6754 non-critical. The global print_mode reference is for session
6755 management only; user-code should use print_mode_value,
6756 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6758 * Functions system/system_out provide a robust way to invoke external
6759 shell commands, with propagation of interrupts (requires Poly/ML
6760 5.2.1). Do not use OS.Process.system etc. from the basis library!
6765 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6766 in accordance with Proof General 3.7, which prefers GNU emacs.
6768 * isatool tty runs Isabelle process with plain tty interaction;
6769 optional line editor may be specified via ISABELLE_LINE_EDITOR
6770 setting, the default settings attempt to locate "ledit" and "rlwrap".
6772 * isatool browser now works with Cygwin as well, using general
6773 "javapath" function defined in Isabelle process environment.
6775 * YXML notation provides a simple and efficient alternative to
6776 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6777 isatool yxml as described in the Isabelle system manual.
6779 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6780 provides general wrapper for managing an Isabelle process in a robust
6781 fashion, with ``cooked'' output from stdin/stderr.
6783 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6784 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6786 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6787 way of changing the user's settings is via
6788 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6791 * Multithreading.max_threads := 0 refers to the number of actual CPU
6792 cores of the underlying machine, which is a good starting point for
6793 optimal performance tuning. The corresponding usedir option -M allows
6794 "max" as an alias for "0". WARNING: does not work on certain versions
6795 of Mac OS (with Poly/ML 5.1).
6797 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6798 adverse effect of Isabelle flooding interactive front-ends (notably
6799 ProofGeneral / XEmacs).
6803 New in Isabelle2007 (November 2007)
6804 -----------------------------------
6808 * More uniform information about legacy features, notably a
6809 warning/error of "Legacy feature: ...", depending on the state of the
6810 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6811 legacy features will disappear eventually.
6813 * Theory syntax: the header format ``theory A = B + C:'' has been
6814 discontinued in favour of ``theory A imports B C begin''. Use isatool
6815 fixheaders to convert existing theory files. INCOMPATIBILITY.
6817 * Theory syntax: the old non-Isar theory file format has been
6818 discontinued altogether. Note that ML proof scripts may still be used
6819 with Isar theories; migration is usually quite simple with the ML
6820 function use_legacy_bindings. INCOMPATIBILITY.
6822 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6823 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6826 * Theory loader: be more serious about observing the static theory
6827 header specifications (including optional directories), but not the
6828 accidental file locations of previously successful loads. The strict
6829 update policy of former update_thy is now already performed by
6830 use_thy, so the former has been removed; use_thys updates several
6831 theories simultaneously, just as 'imports' within a theory header
6832 specification, but without merging the results. Potential
6833 INCOMPATIBILITY: may need to refine theory headers and commands
6834 ROOT.ML which depend on load order.
6836 * Theory loader: optional support for content-based file
6837 identification, instead of the traditional scheme of full physical
6838 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6839 (cf. the system manual). The new scheme allows to work with
6840 non-finished theories in persistent session images, such that source
6841 files may be moved later on without requiring reloads.
6843 * Theory loader: old-style ML proof scripts being *attached* to a thy
6844 file (with the same base name as the theory) are considered a legacy
6845 feature, which will disappear eventually. Even now, the theory loader
6846 no longer maintains dependencies on such files.
6848 * Syntax: the scope for resolving ambiguities via type-inference is
6849 now limited to individual terms, instead of whole simultaneous
6850 specifications as before. This greatly reduces the complexity of the
6851 syntax module and improves flexibility by separating parsing and
6852 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6853 'fixes' etc.) are required in rare situations.
6855 * Syntax: constants introduced by new-style packages ('definition',
6856 'abbreviation' etc.) are passed through the syntax module in
6857 ``authentic mode''. This means that associated mixfix annotations
6858 really stick to such constants, independently of potential name space
6859 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6860 trees are represented slightly differently, may need to adapt syntax
6861 translations accordingly. Use CONST marker in 'translations' and
6862 @{const_syntax} antiquotation in 'parse_translation' etc.
6864 * Legacy goal package: reduced interface to the bare minimum required
6865 to keep existing proof scripts running. Most other user-level
6866 functions are now part of the OldGoals structure, which is *not* open
6867 by default (consider isatool expandshort before open OldGoals).
6868 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6869 these tend to cause confusion about the actual goal (!) context being
6870 used here, which is not necessarily the same as the_context().
6872 * Command 'find_theorems': supports "*" wild-card in "name:"
6873 criterion; "with_dups" option. Certain ProofGeneral versions might
6874 support a specific search form (see ProofGeneral/CHANGES).
6876 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6877 by default, which means that "prems" (and also "fixed variables") are
6878 suppressed from proof state output. Note that the ProofGeneral
6879 settings mechanism allows to change and save options persistently, but
6880 older versions of Isabelle will fail to start up if a negative prems
6883 * Local theory targets may be specified by non-nested blocks of
6884 ``context/locale/class ... begin'' followed by ``end''. The body may
6885 contain definitions, theorems etc., including any derived mechanism
6886 that has been implemented on top of these primitives. This concept
6887 generalizes the existing ``theorem (in ...)'' towards more versatility
6890 * Proof General interface: proper undo of final 'end' command;
6891 discontinued Isabelle/classic mode (ML proof scripts).
6894 *** Document preparation ***
6896 * Added antiquotation @{theory name} which prints the given name,
6897 after checking that it refers to a valid ancestor theory in the
6900 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6901 check the given source text as ML type/structure, printing verbatim.
6903 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6904 "c args == rhs" given in the current context. (Any number of
6905 arguments may be given on the LHS.)
6910 * The 'class' package offers a combination of axclass and locale to
6911 achieve Haskell-like type classes in Isabelle. Definitions and
6912 theorems within a class context produce both relative results (with
6913 implicit parameters according to the locale context), and polymorphic
6914 constants with qualified polymorphism (according to the class
6915 context). Within the body context of a 'class' target, a separate
6916 syntax layer ("user space type system") takes care of converting
6917 between global polymorphic consts and internal locale representation.
6918 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6919 "isatool doc classes" provides a tutorial.
6921 * Generic code generator framework allows to generate executable
6922 code for ML and Haskell (including Isabelle classes). A short usage
6925 internal compilation:
6926 export_code <list of constants (term syntax)> in SML
6927 writing SML code to a file:
6928 export_code <list of constants (term syntax)> in SML <filename>
6929 writing OCaml code to a file:
6930 export_code <list of constants (term syntax)> in OCaml <filename>
6931 writing Haskell code to a bunch of files:
6932 export_code <list of constants (term syntax)> in Haskell <filename>
6934 evaluating closed propositions to True/False using code generation:
6937 Reasonable default setup of framework in HOL.
6939 Theorem attributs for selecting and transforming function equations theorems:
6941 [code fun]: select a theorem as function equation for a specific constant
6942 [code fun del]: deselect a theorem as function equation for a specific constant
6943 [code inline]: select an equation theorem for unfolding (inlining) in place
6944 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6946 User-defined serializations (target in {SML, OCaml, Haskell}):
6948 code_const <and-list of constants (term syntax)>
6949 {(target) <and-list of const target syntax>}+
6951 code_type <and-list of type constructors>
6952 {(target) <and-list of type target syntax>}+
6954 code_instance <and-list of instances>
6956 where instance ::= <type constructor> :: <class>
6958 code_class <and_list of classes>
6959 {(target) <and-list of class target syntax>}+
6960 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6962 code_instance and code_class only are effective to target Haskell.
6964 For example usage see src/HOL/ex/Codegenerator.thy and
6965 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6966 generation from Isabelle/HOL theories is available via "isatool doc
6969 * Code generator: consts in 'consts_code' Isar commands are now
6970 referred to by usual term syntax (including optional type
6973 * Command 'no_translations' removes translation rules from theory
6976 * Overloaded definitions are now actually checked for acyclic
6977 dependencies. The overloading scheme is slightly more general than
6978 that of Haskell98, although Isabelle does not demand an exact
6979 correspondence to type class and instance declarations.
6980 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6981 exotic versions of overloading -- at the discretion of the user!
6983 Polymorphic constants are represented via type arguments, i.e. the
6984 instantiation that matches an instance against the most general
6985 declaration given in the signature. For example, with the declaration
6986 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6987 as c(nat). Overloading is essentially simultaneous structural
6988 recursion over such type arguments. Incomplete specification patterns
6989 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6990 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6991 Command 'print_theory' outputs the normalized system of recursive
6992 equations, see section "definitions".
6994 * Configuration options are maintained within the theory or proof
6995 context (with name and type bool/int/string), providing a very simple
6996 interface to a poor-man's version of general context data. Tools may
6997 declare options in ML (e.g. using Attrib.config_int) and then refer to
6998 these values using Config.get etc. Users may change options via an
6999 associated attribute of the same name. This form of context
7000 declaration works particularly well with commands 'declare' or
7001 'using', for example ``declare [[foo = 42]]''. Thus it has become
7002 very easy to avoid global references, which would not observe Isar
7003 toplevel undo/redo and fail to work with multithreading.
7005 Various global ML references of Pure and HOL have been turned into
7006 configuration options:
7008 Unify.search_bound unify_search_bound
7009 Unify.trace_bound unify_trace_bound
7010 Unify.trace_simp unify_trace_simp
7011 Unify.trace_types unify_trace_types
7012 Simplifier.simp_depth_limit simp_depth_limit
7013 Blast.depth_limit blast_depth_limit
7014 DatatypeProp.dtK datatype_distinctness_limit
7015 fast_arith_neq_limit fast_arith_neq_limit
7016 fast_arith_split_limit fast_arith_split_limit
7018 * Named collections of theorems may be easily installed as context
7019 data using the functor NamedThmsFun (see also
7020 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
7021 attributes; there is also a toplevel print command. This facility is
7022 just a common case of general context data, which is the preferred way
7023 for anything more complex than just a list of facts in canonical
7026 * Isar: command 'declaration' augments a local theory by generic
7027 declaration functions written in ML. This enables arbitrary content
7028 being added to the context, depending on a morphism that tells the
7029 difference of the original declaration context wrt. the application
7030 context encountered later on.
7032 * Isar: proper interfaces for simplification procedures. Command
7033 'simproc_setup' declares named simprocs (with match patterns, and body
7034 text in ML). Attribute "simproc" adds/deletes simprocs in the current
7035 context. ML antiquotation @{simproc name} retrieves named simprocs.
7037 * Isar: an extra pair of brackets around attribute declarations
7038 abbreviates a theorem reference involving an internal dummy fact,
7039 which will be ignored later --- only the effect of the attribute on
7040 the background context will persist. This form of in-place
7041 declarations is particularly useful with commands like 'declare' and
7042 'using', for example ``have A using [[simproc a]] by simp''.
7044 * Isar: method "assumption" (and implicit closing of subproofs) now
7045 takes simple non-atomic goal assumptions into account: after applying
7046 an assumption as a rule the resulting subgoals are solved by atomic
7047 assumption steps. This is particularly useful to finish 'obtain'
7048 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
7049 without referring to the original premise "!!x. P x ==> thesis" in the
7050 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
7053 * Isar: implicit use of prems from the Isar proof context is
7054 considered a legacy feature. Common applications like ``have A .''
7055 may be replaced by ``have A by fact'' or ``note `A`''. In general,
7056 referencing facts explicitly here improves readability and
7057 maintainability of proof texts.
7059 * Isar: improper proof element 'guess' is like 'obtain', but derives
7060 the obtained context from the course of reasoning! For example:
7062 assume "EX x y. A x & B y" -- "any previous fact"
7063 then guess x and y by clarify
7065 This technique is potentially adventurous, depending on the facts and
7066 proof tools being involved here.
7068 * Isar: known facts from the proof context may be specified as literal
7069 propositions, using ASCII back-quote syntax. This works wherever
7070 named facts used to be allowed so far, in proof commands, proof
7071 methods, attributes etc. Literal facts are retrieved from the context
7072 according to unification of type and term parameters. For example,
7073 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
7074 theorems in the current context, then these are valid literal facts:
7075 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
7077 There is also a proof method "fact" which does the same composition
7078 for explicit goal states, e.g. the following proof texts coincide with
7079 certain special cases of literal facts:
7081 have "A" by fact == note `A`
7082 have "A ==> B" by fact == note `A ==> B`
7083 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7084 have "P a ==> Q a" by fact == note `P a ==> Q a`
7086 * Isar: ":" (colon) is no longer a symbolic identifier character in
7087 outer syntax. Thus symbolic identifiers may be used without
7088 additional white space in declarations like this: ``assume *: A''.
7090 * Isar: 'print_facts' prints all local facts of the current context,
7091 both named and unnamed ones.
7093 * Isar: 'def' now admits simultaneous definitions, e.g.:
7095 def x == "t" and y == "u"
7097 * Isar: added command 'unfolding', which is structurally similar to
7098 'using', but affects both the goal state and facts by unfolding given
7099 rewrite rules. Thus many occurrences of the 'unfold' method or
7100 'unfolded' attribute may be replaced by first-class proof text.
7102 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7103 and command 'unfolding' now all support object-level equalities
7104 (potentially conditional). The underlying notion of rewrite rule is
7105 analogous to the 'rule_format' attribute, but *not* that of the
7106 Simplifier (which is usually more generous).
7108 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7109 premises of a theorem by n. Useful in conjunction with drule.
7111 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7112 method expression within a sandbox consisting of the first N
7113 sub-goals, which need to exist. For example, ``simp_all [3]''
7114 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7115 simplifies all new goals that emerge from applying rule foo to the
7116 originally first one.
7118 * Isar: schematic goals are no longer restricted to higher-order
7119 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7122 * Isar: the conclusion of a long theorem statement is now either
7123 'shows' (a simultaneous conjunction, as before), or 'obtains'
7124 (essentially a disjunction of cases with local parameters and
7125 assumptions). The latter allows to express general elimination rules
7126 adequately; in this notation common elimination rules look like this:
7128 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7130 obtains x where "P x"
7132 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7136 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7142 The subsequent classical rules even refer to the formal "thesis"
7145 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7148 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7149 obtains "thesis ==> something"
7151 The actual proof of an 'obtains' statement is analogous to that of the
7152 Isar proof element 'obtain', only that there may be several cases.
7153 Optional case names may be specified in parentheses; these will be
7154 available both in the present proof and as annotations in the
7155 resulting rule, for later use with the 'cases' method (cf. attribute
7158 * Isar: the assumptions of a long theorem statement are available as
7159 "assms" fact in the proof context. This is more appropriate than the
7160 (historical) "prems", which refers to all assumptions of the current
7161 context, including those from the target locale, proof body etc.
7163 * Isar: 'print_statement' prints theorems from the current theory or
7164 proof context in long statement form, according to the syntax of a
7167 * Isar: 'obtain' takes an optional case name for the local context
7168 introduction rule (default "that").
7170 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7171 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7174 * Pure: syntax "CONST name" produces a fully internalized constant
7175 according to the current context. This is particularly useful for
7176 syntax translations that should refer to internal constant
7177 representations independently of name spaces.
7179 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7180 instead of "FOO ". This allows multiple binder declarations to coexist
7181 in the same context. INCOMPATIBILITY.
7183 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7184 primitive that also works in a locale context (both for constants and
7185 fixed variables). Type declaration and internal syntactic representation
7186 of given constants retrieved from the context. Likewise, the
7187 'no_notation' command allows to remove given syntax annotations from the
7190 * Isar/locales: new derived specification elements 'axiomatization',
7191 'definition', 'abbreviation', which support type-inference, admit
7192 object-level specifications (equality, equivalence). See also the
7193 isar-ref manual. Examples:
7196 eq (infix "===" 50) where
7197 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7199 definition "f x y = x + y + 1"
7200 definition g where "g x = f x x"
7203 neq (infix "=!=" 50) where
7204 "x =!= y == ~ (x === y)"
7206 These specifications may be also used in a locale context. Then the
7207 constants being introduced depend on certain fixed parameters, and the
7208 constant name is qualified by the locale base name. An internal
7209 abbreviation takes care for convenient input and output, making the
7210 parameters implicit and using the original short name. See also
7211 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7212 entities from a monomorphic theory.
7214 Presently, abbreviations are only available 'in' a target locale, but
7215 not inherited by general import expressions. Also note that
7216 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7217 'translations' in common applications. The "no_abbrevs" print mode
7218 prevents folding of abbreviations in term output.
7220 Concrete syntax is attached to specified constants in internal form,
7221 independently of name spaces. The parse tree representation is
7222 slightly different -- use 'notation' instead of raw 'syntax', and
7223 'translations' with explicit "CONST" markup to accommodate this.
7225 * Pure/Isar: unified syntax for new-style specification mechanisms
7226 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7227 full type inference and dummy patterns ("_"). For example:
7229 definition "K x _ = x"
7231 inductive conj for A B
7232 where "A ==> B ==> conj A B"
7234 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7235 the current context. Print mode "no_abbrevs" prevents inversion of
7236 abbreviations on output.
7238 * Isar/locales: improved parameter handling: use of locales "var" and
7239 "struct" no longer necessary; - parameter renamings are no longer
7240 required to be injective. For example, this allows to define
7241 endomorphisms as locale endom = homom mult mult h.
7243 * Isar/locales: changed the way locales with predicates are defined.
7244 Instead of accumulating the specification, the imported expression is
7245 now an interpretation. INCOMPATIBILITY: different normal form of
7246 locale expressions. In particular, in interpretations of locales with
7247 predicates, goals repesenting already interpreted fragments are not
7248 removed automatically. Use methods `intro_locales' and
7249 `unfold_locales'; see below.
7251 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7252 provide backward reasoning on locales predicates. The methods are
7253 aware of interpretations and discharge corresponding goals.
7254 `intro_locales' is less aggressive then `unfold_locales' and does not
7255 unfold predicates to assumptions.
7257 * Isar/locales: the order in which locale fragments are accumulated
7258 has changed. This enables to override declarations from fragments due
7259 to interpretations -- for example, unwanted simp rules.
7261 * Isar/locales: interpretation in theories and proof contexts has been
7262 extended. One may now specify (and prove) equations, which are
7263 unfolded in interpreted theorems. This is useful for replacing
7264 defined concepts (constants depending on locale parameters) by
7265 concepts already existing in the target context. Example:
7267 interpretation partial_order ["op <= :: [int, int] => bool"]
7268 where "partial_order.less (op <=) (x::int) y = (x < y)"
7270 Typically, the constant `partial_order.less' is created by a
7271 definition specification element in the context of locale
7274 * Method "induct": improved internal context management to support
7275 local fixes and defines on-the-fly. Thus explicit meta-level
7276 connectives !! and ==> are rarely required anymore in inductive goals
7277 (using object-logic connectives for this purpose has been long
7278 obsolete anyway). Common proof patterns are explained in
7279 src/HOL/Induct/Common_Patterns.thy, see also
7280 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7283 * Method "induct": improved handling of simultaneous goals. Instead of
7284 introducing object-level conjunction, the statement is now split into
7285 several conclusions, while the corresponding symbolic cases are nested
7286 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7287 see src/HOL/Induct/Common_Patterns.thy, for example.
7289 * Method "induct": mutual induction rules are now specified as a list
7290 of rule sharing the same induction cases. HOL packages usually provide
7291 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7292 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7293 mutual induction rules differently, i.e. like this:
7295 (induct rule: foo_bar.inducts)
7296 (induct set: foo bar)
7297 (induct pred: foo bar)
7298 (induct type: foo bar)
7300 The ML function ProjectRule.projections turns old-style rules into the
7303 * Method "coinduct": dual of induction, see
7304 src/HOL/Library/Coinductive_List.thy for various examples.
7306 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7307 considered a legacy feature.
7309 * Attribute "symmetric" produces result with standardized schematic
7310 variables (index 0). Potential INCOMPATIBILITY.
7312 * Simplifier: by default the simplifier trace only shows top level
7313 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7314 default. Thus there is less danger of being flooded by the trace. The
7315 trace indicates where parts have been suppressed.
7317 * Provers/classical: removed obsolete classical version of elim_format
7318 attribute; classical elim/dest rules are now treated uniformly when
7319 manipulating the claset.
7321 * Provers/classical: stricter checks to ensure that supplied intro,
7322 dest and elim rules are well-formed; dest and elim rules must have at
7325 * Provers/classical: attributes dest/elim/intro take an optional
7326 weight argument for the rule (just as the Pure versions). Weights are
7327 ignored by automated tools, but determine the search order of single
7330 * Syntax: input syntax now supports dummy variable binding "%_. b",
7331 where the body does not mention the bound variable. Note that dummy
7332 patterns implicitly depend on their context of bounds, which makes
7333 "{_. _}" match any set comprehension as expected. Potential
7334 INCOMPATIBILITY -- parse translations need to cope with syntactic
7335 constant "_idtdummy" in the binding position.
7337 * Syntax: removed obsolete syntactic constant "_K" and its associated
7338 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7339 for example "A -> B" => "Pi A (%_. B)".
7341 * Pure: 'class_deps' command visualizes the subclass relation, using
7342 the graph browser tool.
7344 * Pure: 'print_theory' now suppresses certain internal declarations by
7345 default; use '!' option for full details.
7350 * Method "metis" proves goals by applying the Metis general-purpose
7351 resolution prover (see also http://gilith.com/software/metis/).
7352 Examples are in the directory MetisExamples. WARNING: the
7353 Isabelle/HOL-Metis integration does not yet work properly with
7356 * Command 'sledgehammer' invokes external automatic theorem provers as
7357 background processes. It generates calls to the "metis" method if
7358 successful. These can be pasted into the proof. Users do not have to
7359 wait for the automatic provers to return. WARNING: does not really
7360 work with multi-threading.
7362 * New "auto_quickcheck" feature tests outermost goal statements for
7363 potential counter-examples. Controlled by ML references
7364 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7365 5000 milliseconds). Fails silently if statements is outside of
7366 executable fragment, or any other codgenerator problem occurs.
7368 * New constant "undefined" with axiom "undefined x = undefined".
7370 * Added class "HOL.eq", allowing for code generation with polymorphic
7373 * Some renaming of class constants due to canonical name prefixing in
7374 the new 'class' package:
7376 HOL.abs ~> HOL.abs_class.abs
7377 HOL.divide ~> HOL.divide_class.divide
7378 0 ~> HOL.zero_class.zero
7379 1 ~> HOL.one_class.one
7380 op + ~> HOL.plus_class.plus
7381 op - ~> HOL.minus_class.minus
7382 uminus ~> HOL.minus_class.uminus
7383 op * ~> HOL.times_class.times
7384 op < ~> HOL.ord_class.less
7385 op <= > HOL.ord_class.less_eq
7386 Nat.power ~> Power.power_class.power
7387 Nat.size ~> Nat.size_class.size
7388 Numeral.number_of ~> Numeral.number_class.number_of
7389 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7390 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7391 Orderings.min ~> Orderings.ord_class.min
7392 Orderings.max ~> Orderings.ord_class.max
7393 Divides.op div ~> Divides.div_class.div
7394 Divides.op mod ~> Divides.div_class.mod
7395 Divides.op dvd ~> Divides.div_class.dvd
7397 INCOMPATIBILITY. Adaptions may be required in the following cases:
7399 a) User-defined constants using any of the names "plus", "minus",
7400 "times", "less" or "less_eq". The standard syntax translations for
7401 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7404 b) Variables named "plus", "minus", "times", "less", "less_eq"
7405 INCOMPATIBILITY: use more specific names.
7407 c) Permutative equations (e.g. "a + b = b + a")
7408 Since the change of names also changes the order of terms, permutative
7409 rewrite rules may get applied in a different order. Experience shows
7410 that this is rarely the case (only two adaptions in the whole Isabelle
7411 distribution). INCOMPATIBILITY: rewrite proofs
7413 d) ML code directly refering to constant names
7414 This in general only affects hand-written proof tactics, simprocs and
7415 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7416 Consider using @{const_name} antiquotation.
7418 * New class "default" with associated constant "default".
7420 * Function "sgn" is now overloaded and available on int, real, complex
7421 (and other numeric types), using class "sgn". Two possible defs of
7422 sgn are given as equational assumptions in the classes sgn_if and
7423 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7426 * Locale "partial_order" now unified with class "order" (cf. theory
7427 Orderings), added parameter "less". INCOMPATIBILITY.
7429 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7430 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7431 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7433 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7434 changed order of proof goals in instance proofs.
7436 * The transitivity reasoner for partial and linear orders is set up
7437 for classes "order" and "linorder". Instances of the reasoner are available
7438 in all contexts importing or interpreting the corresponding locales.
7439 Method "order" invokes the reasoner separately; the reasoner
7440 is also integrated with the Simplifier as a solver. Diagnostic
7441 command 'print_orders' shows the available instances of the reasoner
7442 in the current context.
7444 * Localized monotonicity predicate in theory "Orderings"; integrated
7445 lemmas max_of_mono and min_of_mono with this predicate.
7448 * Formulation of theorem "dense" changed slightly due to integration
7449 with new class dense_linear_order.
7451 * Uniform lattice theory development in HOL.
7453 constants "meet" and "join" now named "inf" and "sup"
7454 constant "Meet" now named "Inf"
7456 classes "meet_semilorder" and "join_semilorder" now named
7457 "lower_semilattice" and "upper_semilattice"
7458 class "lorder" now named "lattice"
7459 class "comp_lat" now named "complete_lattice"
7461 Instantiation of lattice classes allows explicit definitions
7462 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7464 INCOMPATIBILITY. Theorem renames:
7466 meet_left_le ~> inf_le1
7467 meet_right_le ~> inf_le2
7468 join_left_le ~> sup_ge1
7469 join_right_le ~> sup_ge2
7470 meet_join_le ~> inf_sup_ord
7473 le_meet ~> le_inf_iff
7474 le_join ~> ge_sup_conv
7475 meet_idempotent ~> inf_idem
7476 join_idempotent ~> sup_idem
7477 meet_comm ~> inf_commute
7478 join_comm ~> sup_commute
7479 meet_leI1 ~> le_infI1
7480 meet_leI2 ~> le_infI2
7481 le_joinI1 ~> le_supI1
7482 le_joinI2 ~> le_supI2
7483 meet_assoc ~> inf_assoc
7484 join_assoc ~> sup_assoc
7485 meet_left_comm ~> inf_left_commute
7486 meet_left_idempotent ~> inf_left_idem
7487 join_left_comm ~> sup_left_commute
7488 join_left_idempotent ~> sup_left_idem
7491 le_def_meet ~> le_iff_inf
7492 le_def_join ~> le_iff_sup
7493 join_absorp2 ~> sup_absorb2
7494 join_absorp1 ~> sup_absorb1
7495 meet_absorp1 ~> inf_absorb1
7496 meet_absorp2 ~> inf_absorb2
7497 meet_join_absorp ~> inf_sup_absorb
7498 join_meet_absorp ~> sup_inf_absorb
7499 distrib_join_le ~> distrib_sup_le
7500 distrib_meet_le ~> distrib_inf_le
7502 add_meet_distrib_left ~> add_inf_distrib_left
7503 add_join_distrib_left ~> add_sup_distrib_left
7504 is_join_neg_meet ~> is_join_neg_inf
7505 is_meet_neg_join ~> is_meet_neg_sup
7506 add_meet_distrib_right ~> add_inf_distrib_right
7507 add_join_distrib_right ~> add_sup_distrib_right
7508 add_meet_join_distribs ~> add_sup_inf_distribs
7509 join_eq_neg_meet ~> sup_eq_neg_inf
7510 meet_eq_neg_join ~> inf_eq_neg_sup
7511 add_eq_meet_join ~> add_eq_inf_sup
7512 meet_0_imp_0 ~> inf_0_imp_0
7513 join_0_imp_0 ~> sup_0_imp_0
7514 meet_0_eq_0 ~> inf_0_eq_0
7515 join_0_eq_0 ~> sup_0_eq_0
7516 neg_meet_eq_join ~> neg_inf_eq_sup
7517 neg_join_eq_meet ~> neg_sup_eq_inf
7518 join_eq_if ~> sup_eq_if
7520 mono_meet ~> mono_inf
7521 mono_join ~> mono_sup
7522 meet_bool_eq ~> inf_bool_eq
7523 join_bool_eq ~> sup_bool_eq
7524 meet_fun_eq ~> inf_fun_eq
7525 join_fun_eq ~> sup_fun_eq
7526 meet_set_eq ~> inf_set_eq
7527 join_set_eq ~> sup_set_eq
7528 meet1_iff ~> inf1_iff
7529 meet2_iff ~> inf2_iff
7538 join1_iff ~> sup1_iff
7539 join2_iff ~> sup2_iff
7549 is_meet_Meet ~> is_meet_Inf
7550 Meet_bool_def ~> Inf_bool_def
7551 Meet_fun_def ~> Inf_fun_def
7552 Meet_greatest ~> Inf_greatest
7553 Meet_lower ~> Inf_lower
7554 Meet_set_def ~> Inf_set_def
7557 Sup_bool_eq ~> Sup_bool_def
7558 Sup_fun_eq ~> Sup_fun_def
7559 Sup_set_eq ~> Sup_set_def
7561 listsp_meetI ~> listsp_infI
7562 listsp_meet_eq ~> listsp_inf_eq
7567 * Added syntactic class "size"; overloaded constant "size" now has
7568 type "'a::size ==> bool"
7570 * Internal reorganisation of `size' of datatypes: size theorems
7571 "foo.size" are no longer subsumed by "foo.simps" (but are still
7572 simplification rules by default!); theorems "prod.size" now named
7575 * Class "div" now inherits from class "times" rather than "type".
7578 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7579 Linorder etc. have disappeared; operations defined in terms of
7580 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7582 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7584 * HOL-Word: New extensive library and type for generic, fixed size
7585 machine words, with arithmetic, bit-wise, shifting and rotating
7586 operations, reflection into int, nat, and bool lists, automation for
7587 linear arithmetic (by automatic reflection into nat or int), including
7588 lemmas on overflow and monotonicity. Instantiated to all appropriate
7589 arithmetic type classes, supporting automatic simplification of
7590 numerals on all operations.
7592 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7594 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7596 * Code generator library theories:
7597 - Code_Integer represents HOL integers by big integer literals in target
7599 - Code_Char represents HOL characters by character literals in target
7601 - Code_Char_chr like Code_Char, but also offers treatment of character
7602 codes; includes Code_Integer.
7603 - Executable_Set allows to generate code for finite sets using lists.
7604 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7606 - Executable_Real implements a subset of real numbers, namly those
7607 representable by rational numbers.
7608 - Efficient_Nat implements natural numbers by integers, which in general will
7609 result in higher efficency; pattern matching with 0/Suc is eliminated;
7610 includes Code_Integer.
7611 - Code_Index provides an additional datatype index which is mapped to
7612 target-language built-in integers.
7613 - Code_Message provides an additional datatype message_string which is isomorphic to
7614 strings; messages are mapped to target-language strings.
7616 * New package for inductive predicates
7618 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7621 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7622 for z_1 :: U_1 and ... and z_n :: U_m
7624 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7627 with full support for type-inference, rather than
7629 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7631 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7632 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7634 inductive "s z_1 ... z_m"
7636 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7639 For backward compatibility, there is a wrapper allowing inductive
7640 sets to be defined with the new package via
7643 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7644 for z_1 :: U_1 and ... and z_n :: U_m
7646 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7652 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7653 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7654 for z_1 :: U_1 and ... and z_n :: U_m
7656 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7657 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7660 if the additional syntax "p ..." is required.
7662 Numerous examples can be found in the subdirectories src/HOL/Auth,
7663 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7667 - Since declaration and definition of inductive sets or predicates
7668 is no longer separated, abbreviations involving the newly
7669 introduced sets or predicates must be specified together with the
7670 introduction rules after the 'where' keyword (see above), rather
7671 than before the actual inductive definition.
7673 - The variables in induction and elimination rules are now
7674 quantified in the order of their occurrence in the introduction
7675 rules, rather than in alphabetical order. Since this may break
7676 some proofs, these proofs either have to be repaired, e.g. by
7677 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7678 statements of the form
7680 case (rule_i a_i_1 ... a_i_{k_i})
7682 or the old order of quantification has to be restored by explicitly adding
7683 meta-level quantifiers in the introduction rules, i.e.
7685 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7687 - The format of the elimination rules is now
7689 p z_1 ... z_m x_1 ... x_n ==>
7690 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7695 (x_1, ..., x_n) : s z_1 ... z_m ==>
7696 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7699 for sets rather than
7701 x : s z_1 ... z_m ==>
7702 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7705 This may require terms in goals to be expanded to n-tuples
7706 (e.g. using case_tac or simplification with the split_paired_all
7707 rule) before the above elimination rule is applicable.
7709 - The elimination or case analysis rules for (mutually) inductive
7710 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7711 list of rules "p_1_..._p_k.elims" is no longer available.
7713 * New package "function"/"fun" for general recursive functions,
7714 supporting mutual and nested recursion, definitions in local contexts,
7715 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7716 for small examples, and the separate tutorial on the function
7717 package. The old recdef "package" is still available as before, but
7718 users are encouraged to use the new package.
7720 * Method "lexicographic_order" automatically synthesizes termination
7721 relations as lexicographic combinations of size measures.
7723 * Case-expressions allow arbitrary constructor-patterns (including
7724 "_") and take their order into account, like in functional
7725 programming. Internally, this is translated into nested
7726 case-expressions; missing cases are added and mapped to the predefined
7727 constant "undefined". In complicated cases printing may no longer show
7728 the original input but the internal form. Lambda-abstractions allow
7729 the same form of pattern matching: "% pat1 => e1 | ..." is an
7730 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7733 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7734 is an abbreviation for "of_nat :: nat => int". The simplification
7735 rules for "of_nat" have been changed to work like "int" did
7736 previously. Potential INCOMPATIBILITY:
7737 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7738 - of_nat_diff and of_nat_mult are no longer default simp rules
7740 * Method "algebra" solves polynomial equations over (semi)rings using
7741 Groebner bases. The (semi)ring structure is defined by locales and the
7742 tool setup depends on that generic context. Installing the method for
7743 a specific type involves instantiating the locale and possibly adding
7744 declarations for computation on the coefficients. The method is
7745 already instantiated for natural numbers and for the axiomatic class
7746 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7747 CALCULEMUS 2007 for the general principles underlying this
7748 architecture of context-aware proof-tools.
7750 * Method "ferrack" implements quantifier elimination over
7751 special-purpose dense linear orders using locales (analogous to
7752 "algebra"). The method is already installed for class
7753 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7756 * Former constant "List.op @" now named "List.append". Use ML
7757 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7758 circumvent possible incompatibilities when working on ML level.
7760 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7762 * New function listsum :: 'a list => 'a for arbitrary monoids.
7763 Special syntax: "SUM x <- xs. f x" (and latex variants)
7765 * New syntax for Haskell-like list comprehension (input only), eg.
7766 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7768 * The special syntax for function "filter" has changed from [x :
7769 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7770 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7772 * [a..b] is now defined for arbitrary linear orders. It used to be
7773 defined on nat only, as an abbreviation for [a..<Suc b]
7776 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7778 * New functions "sorted" and "sort" in src/HOL/List.thy.
7780 * New lemma collection field_simps (an extension of ring_simps) for
7781 manipulating (in)equations involving division. Multiplies with all
7782 denominators that can be proved to be non-zero (in equations) or
7783 positive/negative (in inequations).
7785 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7786 have been improved and renamed to ring_simps, group_simps and
7787 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7788 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7790 * Theory Library/Commutative_Ring: switched from recdef to function
7791 package; constants add, mul, pow now curried. Infix syntax for
7792 algebraic operations.
7794 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7797 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7800 * HOL/records: generalised field-update to take a function on the
7801 field rather than the new value: r(|A := x|) is translated to A_update
7802 (K x) r The K-combinator that is internally used is called K_record.
7803 INCOMPATIBILITY: Usage of the plain update functions has to be
7806 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7807 * x = 0, which are required for a semiring. Richer structures do not
7808 inherit from semiring_0 anymore, because this property is a theorem
7809 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7810 there is more to prove, but this is mostly trivial.
7812 * Class "recpower" is generalized to arbitrary monoids, not just
7813 commutative semirings. INCOMPATIBILITY: may need to incorporate
7814 commutativity or semiring properties additionally.
7816 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7817 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7818 better use 'abbreviation'.
7820 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7822 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7823 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7824 significant changes for setting up numeral syntax for types:
7825 - New constants Numeral.pred and Numeral.succ instead
7826 of former Numeral.bin_pred and Numeral.bin_succ.
7827 - Use integer operations instead of bin_add, bin_mult and so on.
7828 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7829 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7831 See src/HOL/Integ/IntArith.thy for an example setup.
7833 * Command 'normal_form' computes the normal form of a term that may
7834 contain free variables. For example ``normal_form "rev [a, b, c]"''
7835 produces ``[b, c, a]'' (without proof). This command is suitable for
7836 heavy-duty computations because the functions are compiled to ML
7837 first. Correspondingly, a method "normalization" is provided. See
7838 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7840 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7841 25 like -->); output depends on the "iff" print_mode, the default is
7842 "A = B" (with priority 50).
7844 * Relations less (<) and less_eq (<=) are also available on type bool.
7845 Modified syntax to disallow nesting without explicit parentheses,
7846 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7849 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7851 * Relation composition operator "op O" now has precedence 75 and binds
7852 stronger than union and intersection. INCOMPATIBILITY.
7854 * The old set interval syntax "{m..n(}" (and relatives) has been
7855 removed. Use "{m..<n}" (and relatives) instead.
7857 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7858 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7859 ``declare [[simproc del: neq]]''.
7861 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7864 * Theorem Cons_eq_map_conv no longer declared as "simp".
7866 * Theorem setsum_mult renamed to setsum_right_distrib.
7868 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7871 * Reimplemented methods "sat" and "satx", with several improvements:
7872 goals no longer need to be stated as "<prems> ==> False", equivalences
7873 (i.e. "=" on type bool) are handled, variable names of the form
7874 "lit_<n>" are no longer reserved, significant speedup.
7876 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7877 zChaff is still supported as well.
7879 * 'inductive' and 'datatype': provide projections of mutual rules,
7880 bundled as foo_bar.inducts;
7882 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7885 * Library: moved theory Accessible_Part to main HOL.
7887 * Library: added theory Coinductive_List of potentially infinite lists
7888 as greatest fixed-point.
7890 * Library: added theory AssocList which implements (finite) maps as
7893 * Method "evaluation" solves goals (i.e. a boolean expression)
7894 efficiently by compiling it to ML. The goal is "proved" (via an
7895 oracle) if it evaluates to True.
7897 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7898 also when invoked by the simplifier. This results in the Simplifier
7899 being more powerful on arithmetic goals. INCOMPATIBILITY.
7900 Configuration option fast_arith_split_limit=0 recovers the old
7903 * Support for hex (0x20) and binary (0b1001) numerals.
7905 * New method: reify eqs (t), where eqs are equations for an
7906 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7907 parameter, computes a term s::'b and a list xs::'a list and proves the
7908 theorem I xs s = t. This is also known as reification or quoting. The
7909 resulting theorem is applied to the subgoal to substitute t with I xs
7910 s. If t is omitted, the subgoal itself is reified.
7912 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7913 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7914 where f is supposed to be a computable function (in the sense of code
7915 generattion). The method uses reify to compute s and xs as above then
7916 applies corr_thm and uses normalization by evaluation to "prove" f s =
7917 r and finally gets the theorem t = r, which is again applied to the
7918 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7920 * Reflection: Automatic reification now handels binding, an example is
7921 available in src/HOL/ex/ReflectionEx.thy
7923 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7924 command 'statespace' that is similar to 'record', but introduces an
7925 abstract specification based on the locale infrastructure instead of
7926 HOL types. This leads to extra flexibility in composing state spaces,
7927 in particular multiple inheritance and renaming of components.
7932 * Hyperreal: Functions root and sqrt are now defined on negative real
7933 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7934 Nonnegativity side conditions have been removed from many lemmas, so
7935 that more subgoals may now be solved by simplification; potential
7938 * Real: new type classes formalize real normed vector spaces and
7939 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7940 and norm :: 'a => real.
7942 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7943 reals into other types. The overloaded constant Reals :: 'a set is now
7944 defined as range of_real; potential INCOMPATIBILITY.
7946 * Real: proper support for ML code generation, including 'quickcheck'.
7947 Reals are implemented as arbitrary precision rationals.
7949 * Hyperreal: Several constants that previously worked only for the
7950 reals have been generalized, so they now work over arbitrary vector
7951 spaces. Type annotations may need to be added in some cases; potential
7954 Infinitesimal :: ('a::real_normed_vector) star set
7955 HFinite :: ('a::real_normed_vector) star set
7956 HInfinite :: ('a::real_normed_vector) star set
7957 approx :: ('a::real_normed_vector) star => 'a star => bool
7958 monad :: ('a::real_normed_vector) star => 'a star set
7959 galaxy :: ('a::real_normed_vector) star => 'a star set
7960 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7961 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7962 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7963 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7964 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7965 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7966 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7967 sgn :: 'a::real_normed_vector => 'a
7968 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7970 * Complex: Some complex-specific constants are now abbreviations for
7971 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7972 hnorm. Other constants have been entirely removed in favor of the
7973 polymorphic versions (INCOMPATIBILITY):
7977 HInfinite <-- CInfinite
7978 Infinitesimal <-- CInfinitesimal
7981 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7982 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7983 (ns)deriv <-- (ns)cderiv
7988 * Formalisation of ideals and the quotient construction over rings.
7990 * Order and lattice theory no longer based on records.
7993 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7994 greatest_closed. INCOMPATIBILITY.
7996 * Method algebra is now set up via an attribute. For examples see
7997 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7998 of algebraic structures.
8000 * Renamed theory CRing to Ring.
8005 * Substantial, yet incomplete support for nominal datatypes (binding
8006 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
8007 src/HOL/Nominal/Examples. Prospective users should consult
8008 http://isabelle.in.tum.de/nominal/
8013 * ML basics: just one true type int, which coincides with IntInf.int
8016 * ML within Isar: antiquotations allow to embed statically-checked
8017 formal entities in the source, referring to the context available at
8018 compile-time. For example:
8020 ML {* @{sort "{zero,one}"} *}
8021 ML {* @{typ "'a => 'b"} *}
8022 ML {* @{term "%x. x"} *}
8023 ML {* @{prop "x == y"} *}
8024 ML {* @{ctyp "'a => 'b"} *}
8025 ML {* @{cterm "%x. x"} *}
8026 ML {* @{cprop "x == y"} *}
8027 ML {* @{thm asm_rl} *}
8028 ML {* @{thms asm_rl} *}
8029 ML {* @{type_name c} *}
8030 ML {* @{type_syntax c} *}
8031 ML {* @{const_name c} *}
8032 ML {* @{const_syntax c} *}
8035 ML {* @{theory Pure} *}
8036 ML {* @{theory_ref} *}
8037 ML {* @{theory_ref Pure} *}
8040 ML {* @{clasimpset} *}
8042 The same works for sources being ``used'' within an Isar context.
8044 * ML in Isar: improved error reporting; extra verbosity with
8045 ML_Context.trace enabled.
8047 * Pure/General/table.ML: the join operations now works via exceptions
8048 DUP/SAME instead of type option. This is simpler in simple cases, and
8049 admits slightly more efficient complex applications.
8051 * Pure: 'advanced' translation functions (parse_translation etc.) now
8052 use Context.generic instead of just theory.
8054 * Pure: datatype Context.generic joins theory/Proof.context and
8055 provides some facilities for code that works in either kind of
8056 context, notably GenericDataFun for uniform theory and proof data.
8058 * Pure: simplified internal attribute type, which is now always
8059 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
8060 local (Proof.context) attributes have been discontinued, while
8061 minimizing code duplication. Thm.rule_attribute and
8062 Thm.declaration_attribute build canonical attributes; see also structure
8063 Context for further operations on Context.generic, notably
8064 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
8065 declarations and definitions.
8067 * Context data interfaces (Theory/Proof/GenericDataFun): removed
8068 name/print, uninitialized data defaults to ad-hoc copy of empty value,
8069 init only required for impure data. INCOMPATIBILITY: empty really need
8070 to be empty (no dependencies on theory content!)
8072 * Pure/kernel: consts certification ignores sort constraints given in
8073 signature declarations. (This information is not relevant to the
8074 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
8075 potential INCOMPATIBILITY.
8077 * Pure: axiomatic type classes are now purely definitional, with
8078 explicit proofs of class axioms and super class relations performed
8079 internally. See Pure/axclass.ML for the main internal interfaces --
8080 notably AxClass.define_class supercedes AxClass.add_axclass, and
8081 AxClass.axiomatize_class/classrel/arity supersede
8082 Sign.add_classes/classrel/arities.
8084 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8085 global/local versions on theory vs. Proof.context have been
8086 discontinued; Attrib.syntax and Method.syntax have been adapted
8087 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8088 attributes, methods, etc.
8090 * Pure: several functions of signature "... -> theory -> theory * ..."
8091 have been reoriented to "... -> theory -> ... * theory" in order to
8092 allow natural usage in combination with the ||>, ||>>, |-> and
8093 fold_map combinators.
8095 * Pure: official theorem names (closed derivations) and additional
8096 comments (tags) are now strictly separate. Name hints -- which are
8097 maintained as tags -- may be attached any time without affecting the
8100 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8101 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8102 achieve the old behaviour.
8104 * Pure: the "Goal" constant is now called "prop", supporting a
8105 slightly more general idea of ``protecting'' meta-level rule
8108 * Pure: Logic.(un)varify only works in a global context, which is now
8109 enforced instead of silently assumed. INCOMPATIBILITY, may use
8110 Logic.legacy_(un)varify as temporary workaround.
8112 * Pure: structure Name provides scalable operations for generating
8113 internal variable names, notably Name.variants etc. This replaces
8114 some popular functions from term.ML:
8116 Term.variant -> Name.variant
8117 Term.variantlist -> Name.variant_list
8118 Term.invent_names -> Name.invent_list
8120 Note that low-level renaming rarely occurs in new code -- operations
8121 from structure Variable are used instead (see below).
8123 * Pure: structure Variable provides fundamental operations for proper
8124 treatment of fixed/schematic variables in a context. For example,
8125 Variable.import introduces fixes for schematics of given facts and
8126 Variable.export reverses the effect (up to renaming) -- this replaces
8127 various freeze_thaw operations.
8129 * Pure: structure Goal provides simple interfaces for
8130 init/conclude/finish and tactical prove operations (replacing former
8131 Tactic.prove). Goal.prove is the canonical way to prove results
8132 within a given context; Goal.prove_global is a degraded version for
8133 theory level goals, including a global Drule.standard. Note that
8134 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8135 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8136 in a locale context).
8138 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8139 and type checking (Syntax.check_term etc.), with common combinations
8140 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8141 which are considered legacy and await removal.
8143 * Pure/Syntax: generic interfaces for type unchecking
8144 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8145 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8146 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8147 available for convenience, but refer to the very same operations using
8148 a mere theory instead of a full context.
8150 * Isar: simplified treatment of user-level errors, using exception
8151 ERROR of string uniformly. Function error now merely raises ERROR,
8152 without any side effect on output channels. The Isar toplevel takes
8153 care of proper display of ERROR exceptions. ML code may use plain
8154 handle/can/try; cat_error may be used to concatenate errors like this:
8156 ... handle ERROR msg => cat_error msg "..."
8158 Toplevel ML code (run directly or through the Isar toplevel) may be
8159 embedded into the Isar toplevel with exception display/debug like
8162 Isar.toplevel (fn () => ...)
8164 INCOMPATIBILITY, removed special transform_error facilities, removed
8165 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8166 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8167 -- use plain ERROR instead.
8169 * Isar: theory setup now has type (theory -> theory), instead of a
8170 list. INCOMPATIBILITY, may use #> to compose setup functions.
8172 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8173 ProofContext.debug/verbose flags.
8175 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8176 theory before entering a proof state. Transactions now always see a
8177 quasi-functional intermediate checkpoint, both in interactive and
8180 * Isar: simplified interfaces for outer syntax. Renamed
8181 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8182 OuterSyntax.add_parsers -- this functionality is now included in
8183 OuterSyntax.command etc. INCOMPATIBILITY.
8185 * Simplifier: the simpset of a running simplification process now
8186 contains a proof context (cf. Simplifier.the_context), which is the
8187 very context that the initial simpset has been retrieved from (by
8188 simpset_of/local_simpset_of). Consequently, all plug-in components
8189 (solver, looper etc.) may depend on arbitrary proof data.
8191 * Simplifier.inherit_context inherits the proof context (plus the
8192 local bounds) of the current simplification process; any simproc
8193 etc. that calls the Simplifier recursively should do this! Removed
8194 former Simplifier.inherit_bounds, which is already included here --
8195 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8196 specify an explicit context using Simplifier.context/theory_context.
8198 * Simplifier/Classical Reasoner: more abstract interfaces
8199 change_simpset/claset for modifying the simpset/claset reference of a
8200 theory; raw versions simpset/claset_ref etc. have been discontinued --
8203 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8209 * settings: the default heap location within ISABELLE_HOME_USER now
8210 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8211 Isabelle installations.
8213 * isabelle-process: option -S (secure mode) disables some critical
8214 operations, notably runtime compilation and evaluation of ML source
8217 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8219 * Support for parallel execution, using native multicore support of
8220 Poly/ML 5.1. The theory loader exploits parallelism when processing
8221 independent theories, according to the given theory header
8222 specifications. The maximum number of worker threads is specified via
8223 usedir option -M or the "max-threads" setting in Proof General. A
8224 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8225 to 6 on a 8-core machine. User-code needs to observe certain
8226 guidelines for thread-safe programming, see appendix A in the Isar
8227 Implementation manual.
8231 New in Isabelle2005 (October 2005)
8232 ----------------------------------
8236 * Theory headers: the new header syntax for Isar theories is
8239 imports <theory1> ... <theoryN>
8240 uses <file1> ... <fileM>
8243 where the 'uses' part is optional. The previous syntax
8245 theory <name> = <theory1> + ... + <theoryN>:
8247 will disappear in the next release. Use isatool fixheaders to convert
8248 existing theory files. Note that there is no change in ancient
8249 non-Isar theories now, but these will disappear soon.
8251 * Theory loader: parent theories can now also be referred to via
8252 relative and absolute paths.
8254 * Command 'find_theorems' searches for a list of criteria instead of a
8255 list of constants. Known criteria are: intro, elim, dest, name:string,
8256 simp:term, and any term. Criteria can be preceded by '-' to select
8257 theorems that do not match. Intro, elim, dest select theorems that
8258 match the current goal, name:s selects theorems whose fully qualified
8259 name contain s, and simp:term selects all simplification rules whose
8260 lhs match term. Any other term is interpreted as pattern and selects
8261 all theorems matching the pattern. Available in ProofGeneral under
8262 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8264 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8266 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8267 matching the current goal as introduction rule and not having "HOL."
8268 in their name (i.e. not being defined in theory HOL).
8270 * Command 'thms_containing' has been discontinued in favour of
8271 'find_theorems'; INCOMPATIBILITY.
8273 * Communication with Proof General is now 8bit clean, which means that
8274 Unicode text in UTF-8 encoding may be used within theory texts (both
8275 formal and informal parts). Cf. option -U of the Isabelle Proof
8276 General interface. Here are some simple examples (cf. src/HOL/ex):
8278 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8279 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8281 * Improved efficiency of the Simplifier and, to a lesser degree, the
8282 Classical Reasoner. Typical big applications run around 2 times
8286 *** Document preparation ***
8288 * Commands 'display_drafts' and 'print_drafts' perform simple output
8289 of raw sources. Only those symbols that do not require additional
8290 LaTeX packages (depending on comments in isabellesym.sty) are
8291 displayed properly, everything else is left verbatim. isatool display
8292 and isatool print are used as front ends (these are subject to the
8293 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8295 * Command tags control specific markup of certain regions of text,
8296 notably folding and hiding. Predefined tags include "theory" (for
8297 theory begin and end), "proof" for proof commands, and "ML" for
8298 commands involving ML code; the additional tags "visible" and
8299 "invisible" are unused by default. Users may give explicit tag
8300 specifications in the text, e.g. ''by %invisible (auto)''. The
8301 interpretation of tags is determined by the LaTeX job during document
8302 preparation: see option -V of isatool usedir, or options -n and -t of
8303 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8306 Several document versions may be produced at the same time via isatool
8307 usedir (the generated index.html will link all of them). Typical
8308 specifications include ''-V document=theory,proof,ML'' to present
8309 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8310 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8311 these parts without any formal replacement text. The Isabelle site
8312 default settings produce ''document'' and ''outline'' versions as
8315 * Several new antiquotations:
8317 @{term_type term} prints a term with its type annotated;
8319 @{typeof term} prints the type of a term;
8321 @{const const} is the same as @{term const}, but checks that the
8322 argument is a known logical constant;
8324 @{term_style style term} and @{thm_style style thm} print a term or
8325 theorem applying a "style" to it
8329 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8330 definitions, equations, inequations etc., 'concl' printing only the
8331 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8332 to print the specified premise. TermStyle.add_style provides an ML
8333 interface for introducing further styles. See also the "LaTeX Sugar"
8334 document practical applications. The ML antiquotation prints
8335 type-checked ML expressions verbatim.
8337 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8338 and 'text' support optional locale specification '(in loc)', which
8339 specifies the default context for interpreting antiquotations. For
8340 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8342 * Option 'locale=NAME' of antiquotations specifies an alternative
8343 context interpreting the subsequent argument. For example: @{thm
8344 [locale=lattice] inf_assoc}.
8346 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8349 * Proper output of antiquotations for theory commands involving a
8350 proof context (such as 'locale' or 'theorem (in loc) ...').
8352 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8353 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8355 * isatool usedir: new option -C (default true) controls whether option
8356 -D should include a copy of the original document directory; -C false
8357 prevents unwanted effects such as copying of administrative CVS data.
8362 * Considerably improved version of 'constdefs' command. Now performs
8363 automatic type-inference of declared constants; additional support for
8364 local structure declarations (cf. locales and HOL records), see also
8365 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8366 sequential dependencies of definitions within a single 'constdefs'
8367 section; moreover, the declared name needs to be an identifier. If
8368 all fails, consider to fall back on 'consts' and 'defs' separately.
8370 * Improved indexed syntax and implicit structures. First of all,
8371 indexed syntax provides a notational device for subscripted
8372 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8373 expressions. Secondly, in a local context with structure
8374 declarations, number indexes \<^sub>n or the empty index (default
8375 number 1) refer to a certain fixed variable implicitly; option
8376 show_structs controls printing of implicit structures. Typical
8377 applications of these concepts involve record types and locales.
8379 * New command 'no_syntax' removes grammar declarations (and
8380 translations) resulting from the given syntax specification, which is
8381 interpreted in the same manner as for the 'syntax' command.
8383 * 'Advanced' translation functions (parse_translation etc.) may depend
8384 on the signature of the theory context being presently used for
8385 parsing/printing, see also isar-ref manual.
8387 * Improved 'oracle' command provides a type-safe interface to turn an
8388 ML expression of type theory -> T -> term into a primitive rule of
8389 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8390 is already included here); see also FOL/ex/IffExample.thy;
8393 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8394 before); "cI" is no longer bound, use "c.intro" instead.
8395 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8396 axclasses vs. locales.
8398 * Improved internal renaming of symbolic identifiers -- attach primes
8399 instead of base 26 numbers.
8401 * New flag show_question_marks controls printing of leading question
8402 marks in schematic variable names.
8404 * In schematic variable names, *any* symbol following \<^isub> or
8405 \<^isup> is now treated as part of the base name. For example, the
8406 following works without printing of awkward ".0" indexes:
8408 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8411 * Inner syntax includes (*(*nested*) comments*).
8413 * Pretty printer now supports unbreakable blocks, specified in mixfix
8414 annotations as "(00...)".
8416 * Clear separation of logical types and nonterminals, where the latter
8417 may only occur in 'syntax' specifications or type abbreviations.
8418 Before that distinction was only partially implemented via type class
8419 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8420 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8421 exotic syntax specifications may require further adaption
8422 (e.g. Cube/Cube.thy).
8424 * Removed obsolete type class "logic", use the top sort {} instead.
8425 Note that non-logical types should be declared as 'nonterminals'
8426 rather than 'types'. INCOMPATIBILITY for new object-logic
8429 * Attributes 'induct' and 'cases': type or set names may now be
8430 locally fixed variables as well.
8432 * Simplifier: can now control the depth to which conditional rewriting
8433 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8436 * Simplifier: simplification procedures may now take the current
8437 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8438 interface), which is very useful for calling the Simplifier
8439 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8440 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8441 low-level mk_simproc no longer applies Logic.varify internally, to
8442 allow for use in a context of fixed variables.
8444 * thin_tac now works even if the assumption being deleted contains !!
8445 or ==>. More generally, erule now works even if the major premise of
8446 the elimination rule contains !! or ==>.
8448 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8450 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8451 from Pure, which contains all common declarations already. Both
8452 theories are defined via plain Isabelle/Isar .thy files.
8453 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8454 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8455 use isatool fixcpure to adapt your theory and ML sources.
8457 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8458 selections of theorems in named facts via index ranges.
8460 * 'print_theorems': in theory mode, really print the difference
8461 wrt. the last state (works for interactive theory development only),
8462 in proof mode print all local facts (cf. 'print_facts');
8464 * 'hide': option '(open)' hides only base names.
8466 * More efficient treatment of intermediate checkpoints in interactive
8469 * Code generator is now invoked via code_module (incremental code
8470 generation) and code_library (modular code generation, ML structures
8471 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8472 must be quoted when used as identifiers.
8474 * New 'value' command for reading, evaluating and printing terms using
8475 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8476 quoted when used as identifier.
8481 * New commands for the interpretation of locale expressions in
8482 theories (1), locales (2) and proof contexts (3). These generate
8483 proof obligations from the expression specification. After the
8484 obligations have been discharged, theorems of the expression are added
8485 to the theory, target locale or proof context. The synopsis of the
8486 commands is a follows:
8488 (1) interpretation expr inst
8489 (2) interpretation target < expr
8490 (3) interpret expr inst
8492 Interpretation in theories and proof contexts require a parameter
8493 instantiation of terms from the current context. This is applied to
8494 specifications and theorems of the interpreted expression.
8495 Interpretation in locales only permits parameter renaming through the
8496 locale expression. Interpretation is smart in that interpretations
8497 that are active already do not occur in proof obligations, neither are
8498 instantiated theorems stored in duplicate. Use 'print_interps' to
8499 inspect active interpretations of a particular locale. For details,
8500 see the Isar Reference manual. Examples can be found in
8501 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8503 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8504 'interpret' instead.
8506 * New context element 'constrains' for adding type constraints to
8509 * Context expressions: renaming of parameters with syntax
8512 * Locale declaration: 'includes' disallowed.
8514 * Proper static binding of attribute syntax -- i.e. types / terms /
8515 facts mentioned as arguments are always those of the locale definition
8516 context, independently of the context of later invocations. Moreover,
8517 locale operations (renaming and type / term instantiation) are applied
8518 to attribute arguments as expected.
8520 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8521 actual attributes; rare situations may require Attrib.attribute to
8522 embed those attributes into Attrib.src that lack concrete syntax.
8523 Attribute implementations need to cooperate properly with the static
8524 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8525 Attrib.XXX_thm etc. already do the right thing without further
8526 intervention. Only unusual applications -- such as "where" or "of"
8527 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8528 on the context and the facts involved -- may have to assign parsed
8529 values to argument tokens explicitly.
8531 * Changed parameter management in theorem generation for long goal
8532 statements with 'includes'. INCOMPATIBILITY: produces a different
8533 theorem statement in rare situations.
8535 * Locale inspection command 'print_locale' omits notes elements. Use
8536 'print_locale!' to have them included in the output.
8541 * Provers/hypsubst.ML: improved version of the subst method, for
8542 single-step rewriting: it now works in bound variable contexts. New is
8543 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8544 rewrite a different subterm than the original subst method, which is
8545 still available as 'simplesubst'.
8547 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8550 * Provers/trancl.ML: new transitivity reasoner for transitive and
8551 reflexive-transitive closure of relations.
8553 * Provers/blast.ML: new reference depth_limit to make blast's depth
8554 limit (previously hard-coded with a value of 20) user-definable.
8556 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8557 is peformed already. Object-logics merely need to finish their
8558 initial simpset configuration as before. INCOMPATIBILITY.
8563 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8566 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8568 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8569 and x-symbol; use option '-m epsilon' to get it actually printed.
8570 Moreover, the mathematically important symbolic identifier \<epsilon>
8571 becomes available as variable, constant etc. INCOMPATIBILITY,
8573 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8574 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8575 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8576 support corresponding Isar calculations.
8578 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8581 * theory SetInterval: changed the syntax for open intervals:
8590 The old syntax is still supported but will disappear in the next
8591 release. For conversion use the following Emacs search and replace
8592 patterns (these are not perfect but work quite well):
8594 {)\([^\.]*\)\.\. -> {\1<\.\.}
8595 \.\.\([^(}]*\)(} -> \.\.<\1}
8597 * Theory Commutative_Ring (in Library): method comm_ring for proving
8598 equalities in commutative rings; method 'algebra' provides a generic
8601 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8602 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8603 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8606 Some new syntax forms are available:
8608 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8609 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8610 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8611 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8613 The latter form "\<Sum>x < k. e" used to be based on a separate
8614 function "Summation", which has been discontinued.
8616 * theory Finite_Set: in structured induction proofs, the insert case
8617 is now 'case (insert x F)' instead of the old counterintuitive 'case
8620 * The 'refute' command has been extended to support a much larger
8621 fragment of HOL, including axiomatic type classes, constdefs and
8622 typedefs, inductive datatypes and recursion.
8624 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8625 Requires zChaff with proof generation to be installed. See
8626 HOL/ex/SAT_Examples.thy for examples.
8628 * Datatype induction via method 'induct' now preserves the name of the
8629 induction variable. For example, when proving P(xs::'a list) by
8630 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8631 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8632 in unstructured proof scripts.
8634 * Reworked implementation of records. Improved scalability for
8635 records with many fields, avoiding performance problems for type
8636 inference. Records are no longer composed of nested field types, but
8637 of nested extension types. Therefore the record type only grows linear
8638 in the number of extensions and not in the number of fields. The
8639 top-level (users) view on records is preserved. Potential
8640 INCOMPATIBILITY only in strange cases, where the theory depends on the
8641 old record representation. The type generated for a record is called
8642 <record_name>_ext_type.
8644 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8645 proofs triggered by a record definition or a simproc (if
8646 quick_and_dirty is enabled). Definitions of large records can take
8649 New simproc record_upd_simproc for simplification of multiple record
8650 updates enabled by default. Moreover, trivial updates are also
8651 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8652 occasionally, since simplification is more powerful by default.
8654 * typedef: proper support for polymorphic sets, which contain extra
8655 type-variables in the term.
8657 * Simplifier: automatically reasons about transitivity chains
8658 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8659 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8660 old proofs break occasionally as simplification may now solve more
8661 goals than previously.
8663 * Simplifier: converts x <= y into x = y if assumption y <= x is
8664 present. Works for all partial orders (class "order"), in particular
8665 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8668 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8669 bound variable or a constant then the let is unfolded. Otherwise
8670 first a is simplified to b, and then f b is simplified to g. If
8671 possible we abstract b from g arriving at "let x = b in h x",
8672 otherwise we unfold the let and arrive at g. The simproc can be
8673 enabled/disabled by the reference use_let_simproc. Potential
8674 INCOMPATIBILITY since simplification is more powerful by default.
8676 * Classical reasoning: the meson method now accepts theorems as arguments.
8678 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8679 jobs to provide advice on the provability of subgoals.
8681 * Theory OrderedGroup and Ring_and_Field: various additions and
8682 improvements to faciliate calculations involving equalities and
8685 The following theorems have been eliminated or modified
8688 abs_eq now named abs_of_nonneg
8689 abs_of_ge_0 now named abs_of_nonneg
8690 abs_minus_eq now named abs_of_nonpos
8691 imp_abs_id now named abs_of_nonneg
8692 imp_abs_neg_id now named abs_of_nonpos
8693 mult_pos now named mult_pos_pos
8694 mult_pos_le now named mult_nonneg_nonneg
8695 mult_pos_neg_le now named mult_nonneg_nonpos
8696 mult_pos_neg2_le now named mult_nonneg_nonpos2
8697 mult_neg now named mult_neg_neg
8698 mult_neg_le now named mult_nonpos_nonpos
8700 * The following lemmas in Ring_and_Field have been added to the simplifier:
8703 not_square_less_zero
8705 The following lemmas have been deleted from Real/RealPow:
8715 * Theory Parity: added rules for simplifying exponents.
8719 The following theorems have been eliminated or modified
8722 list_all_Nil now named list_all.simps(1)
8723 list_all_Cons now named list_all.simps(2)
8724 list_all_conv now named list_all_iff
8725 set_mem_eq now named mem_iff
8727 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8728 asymptotic "big O" calculations. See the notes in BigO.thy.
8733 * Theory RealDef: better support for embedding natural numbers and
8734 integers in the reals.
8736 The following theorems have been eliminated or modified
8739 exp_ge_add_one_self now requires no hypotheses
8740 real_of_int_add reversed direction of equality (use [symmetric])
8741 real_of_int_minus reversed direction of equality (use [symmetric])
8742 real_of_int_diff reversed direction of equality (use [symmetric])
8743 real_of_int_mult reversed direction of equality (use [symmetric])
8745 * Theory RComplete: expanded support for floor and ceiling functions.
8747 * Theory Ln is new, with properties of the natural logarithm
8749 * Hyperreal: There is a new type constructor "star" for making
8750 nonstandard types. The old type names are now type synonyms:
8754 hcomplex = complex star
8756 * Hyperreal: Many groups of similarly-defined constants have been
8757 replaced by polymorphic versions (INCOMPATIBILITY):
8759 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8761 starset <-- starsetNat, starsetC
8762 *s* <-- *sNat*, *sc*
8763 starset_n <-- starsetNat_n, starsetC_n
8764 *sn* <-- *sNatn*, *scn*
8765 InternalSets <-- InternalNatSets, InternalCSets
8767 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8768 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8769 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8770 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8771 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8773 * Hyperreal: Many type-specific theorems have been removed in favor of
8774 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8776 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8777 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8778 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8779 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8780 right_minus <-- hypreal_add_minus
8781 left_minus <-- {hypreal,hcomplex}_add_minus_left
8782 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8783 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8784 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8785 mult_1_right <-- hcomplex_mult_one_right
8786 mult_zero_left <-- hcomplex_mult_zero_left
8787 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8788 right_distrib <-- hypnat_add_mult_distrib2
8789 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8790 right_inverse <-- hypreal_mult_inverse
8791 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8792 order_refl <-- {hypreal,hypnat}_le_refl
8793 order_trans <-- {hypreal,hypnat}_le_trans
8794 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8795 order_less_le <-- {hypreal,hypnat}_less_le
8796 linorder_linear <-- {hypreal,hypnat}_le_linear
8797 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8798 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8799 add_nonneg_nonneg <-- hypreal_le_add_order
8801 * Hyperreal: Separate theorems having to do with type-specific
8802 versions of constants have been merged into theorems that apply to the
8803 new polymorphic constants (INCOMPATIBILITY):
8805 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8806 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8807 STAR_Un <-- {STAR,NatStar,STARC}_Un
8808 STAR_Int <-- {STAR,NatStar,STARC}_Int
8809 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8810 STAR_subset <-- {STAR,NatStar,STARC}_subset
8811 STAR_mem <-- {STAR,NatStar,STARC}_mem
8812 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8813 STAR_diff <-- {STAR,STARC}_diff
8814 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8815 STARC_hcomplex_of_complex}_image_subset
8816 starset_n_Un <-- starset{Nat,C}_n_Un
8817 starset_n_Int <-- starset{Nat,C}_n_Int
8818 starset_n_Compl <-- starset{Nat,C}_n_Compl
8819 starset_n_diff <-- starset{Nat,C}_n_diff
8820 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8821 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8822 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8823 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8824 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8825 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8826 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8827 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8828 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8829 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8830 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8831 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8832 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8833 starfun_diff <-- starfun{C,RC,CR}_diff
8834 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8835 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8836 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8837 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8838 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8839 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8840 starfun_Id <-- starfunC_Id
8841 starfun_approx <-- starfun{Nat,CR}_approx
8842 starfun_capprox <-- starfun{C,RC}_capprox
8843 starfun_abs <-- starfunNat_rabs
8844 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8845 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8846 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8847 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8848 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8849 starfun_add_approx <-- starfunCR_add_approx
8850 starfun_inverse_inverse <-- starfunC_inverse_inverse
8851 starfun_divide <-- starfun{C,CR,RC}_divide
8852 starfun_n <-- starfun{Nat,C}_n
8853 starfun_n_mult <-- starfun{Nat,C}_n_mult
8854 starfun_n_add <-- starfun{Nat,C}_n_add
8855 starfun_n_add_minus <-- starfunNat_n_add_minus
8856 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8857 starfun_n_minus <-- starfun{Nat,C}_n_minus
8858 starfun_n_eq <-- starfun{Nat,C}_n_eq
8860 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8861 star_n_minus <-- {hypreal,hcomplex}_minus
8862 star_n_diff <-- {hypreal,hcomplex}_diff
8863 star_n_mult <-- {hypreal,hcomplex}_mult
8864 star_n_inverse <-- {hypreal,hcomplex}_inverse
8865 star_n_le <-- {hypreal,hypnat}_le
8866 star_n_less <-- {hypreal,hypnat}_less
8867 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8868 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8869 star_n_abs <-- hypreal_hrabs
8870 star_n_divide <-- hcomplex_divide
8872 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8873 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8874 star_of_diff <-- hypreal_of_real_diff
8875 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8876 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8877 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8878 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8879 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8880 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8881 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8882 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8883 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8884 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8885 star_of_number_of <-- {hypreal,hcomplex}_number_of
8886 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8887 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8888 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8889 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8890 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8891 star_of_power <-- hypreal_of_real_power
8892 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8894 * Hyperreal: new method "transfer" that implements the transfer
8895 principle of nonstandard analysis. With a subgoal that mentions
8896 nonstandard types like "'a star", the command "apply transfer"
8897 replaces it with an equivalent one that mentions only standard types.
8898 To be successful, all free variables must have standard types; non-
8899 standard variables must have explicit universal quantifiers.
8901 * Hyperreal: A theory of Taylor series.
8906 * Discontinued special version of 'constdefs' (which used to support
8907 continuous functions) in favor of the general Pure one with full
8910 * New simplification procedure for solving continuity conditions; it
8911 is much faster on terms with many nested lambda abstractions (cubic
8912 instead of exponential time).
8914 * New syntax for domain package: selector names are now optional.
8915 Parentheses should be omitted unless argument is lazy, for example:
8917 domain 'a stream = cons "'a" (lazy "'a stream")
8919 * New command 'fixrec' for defining recursive functions with pattern
8920 matching; defining multiple functions with mutual recursion is also
8921 supported. Patterns may include the constants cpair, spair, up, sinl,
8922 sinr, or any data constructor defined by the domain package. The given
8923 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8924 syntax and examples.
8926 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8927 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8928 but the proof obligation additionally includes an admissibility
8929 requirement. The packages generate instances of class cpo or pcpo,
8930 with continuity and strictness theorems for Rep and Abs.
8932 * HOLCF: Many theorems have been renamed according to a more standard naming
8933 scheme (INCOMPATIBILITY):
8935 foo_inject: "foo$x = foo$y ==> x = y"
8936 foo_eq: "(foo$x = foo$y) = (x = y)"
8937 foo_less: "(foo$x << foo$y) = (x << y)"
8938 foo_strict: "foo$UU = UU"
8939 foo_defined: "... ==> foo$x ~= UU"
8940 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8945 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8946 including the First Isomorphism Theorem (on quotienting by the kernel
8949 * ZF/Simplifier: install second copy of type solver that actually
8950 makes use of TC rules declared to Isar proof contexts (or locales);
8951 the old version is still required for ML proof scripts.
8956 * Converted to Isar theory format; use locales instead of axiomatic
8962 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8965 * Pure/library.ML no longer defines its own option datatype, but uses
8966 that of the SML basis, which has constructors NONE and SOME instead of
8967 None and Some, as well as exception Option.Option instead of OPTION.
8968 The functions the, if_none, is_some, is_none have been adapted
8969 accordingly, while Option.map replaces apsome.
8971 * Pure/library.ML: the exception LIST has been given up in favour of
8972 the standard exceptions Empty and Subscript, as well as
8973 Library.UnequalLengths. Function like Library.hd and Library.tl are
8974 superceded by the standard hd and tl functions etc.
8976 A number of basic list functions are no longer exported to the ML
8977 toplevel, as they are variants of predefined functions. The following
8978 suggests how one can translate existing code:
8980 rev_append xs ys = List.revAppend (xs, ys)
8981 nth_elem (i, xs) = List.nth (xs, i)
8982 last_elem xs = List.last xs
8983 flat xss = List.concat xss
8984 seq fs = List.app fs
8985 partition P xs = List.partition P xs
8986 mapfilter f xs = List.mapPartial f xs
8988 * Pure/library.ML: several combinators for linear functional
8989 transformations, notably reverse application and composition:
8992 (x, y) |-> f f #-> g
8994 * Pure/library.ML: introduced/changed precedence of infix operators:
8996 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8998 infix 3 o oo ooo oooo;
8999 infix 4 ~~ upto downto;
9001 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
9004 * Pure/library.ML: natural list combinators fold, fold_rev, and
9005 fold_map support linear functional transformations and nesting. For
9008 fold f [x1, ..., xN] y =
9009 y |> f x1 |> ... |> f xN
9011 (fold o fold) f [xs1, ..., xsN] y =
9012 y |> fold f xs1 |> ... |> fold f xsN
9014 fold f [x1, ..., xN] =
9017 (fold o fold) f [xs1, ..., xsN] =
9018 fold f xs1 #> ... #> fold f xsN
9020 * Pure/library.ML: the following selectors on type 'a option are
9023 the: 'a option -> 'a (*partial*)
9024 these: 'a option -> 'a where 'a = 'b list
9025 the_default: 'a -> 'a option -> 'a
9026 the_list: 'a option -> 'a list
9028 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9029 basic operations for association lists, following natural argument
9030 order; moreover the explicit equality predicate passed here avoids
9031 potentially expensive polymorphic runtime equality checks.
9032 The old functions may be expressed as follows:
9034 assoc = uncurry (AList.lookup (op =))
9035 assocs = these oo AList.lookup (op =)
9036 overwrite = uncurry (AList.update (op =)) o swap
9038 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9040 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
9041 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
9043 replacing make_keylist and keyfilter (occassionally used)
9046 make_keylist = AList.make
9047 keyfilter = AList.find (op =)
9049 * eq_fst and eq_snd now take explicit equality parameter, thus
9050 avoiding eqtypes. Naive rewrites:
9052 eq_fst = eq_fst (op =)
9053 eq_snd = eq_snd (op =)
9055 * Removed deprecated apl and apr (rarely used).
9058 apl (n, op) =>>= curry op n
9059 apr (op, m) =>>= fn n => op (n, m)
9061 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
9062 provides a reasonably efficient light-weight implementation of sets as
9065 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
9066 few new operations; existing lookup and update are now curried to
9067 follow natural argument order (for use with fold etc.);
9068 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
9070 * Pure/General: output via the Isabelle channels of
9071 writeln/warning/error etc. is now passed through Output.output, with a
9072 hook for arbitrary transformations depending on the print_mode
9073 (cf. Output.add_mode -- the first active mode that provides a output
9074 function wins). Already formatted output may be embedded into further
9075 text via Output.raw; the result of Pretty.string_of/str_of and derived
9076 functions (string_of_term/cterm/thm etc.) is already marked raw to
9077 accommodate easy composition of diagnostic messages etc. Programmers
9078 rarely need to care about Output.output or Output.raw at all, with
9079 some notable exceptions: Output.output is required when bypassing the
9080 standard channels (writeln etc.), or in token translations to produce
9081 properly formatted results; Output.raw is required when capturing
9082 already output material that will eventually be presented to the user
9083 a second time. For the default print mode, both Output.output and
9084 Output.raw have no effect.
9086 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9087 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9088 cumulative results are displayed at the end of a batch session.
9090 * Pure/General: File.sysify_path and File.quote_sysify path have been
9091 replaced by File.platform_path and File.shell_path (with appropriate
9092 hooks). This provides a clean interface for unusual systems where the
9093 internal and external process view of file names are different.
9095 * Pure: more efficient orders for basic syntactic entities: added
9096 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9097 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9098 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9099 orders now -- potential INCOMPATIBILITY for code that depends on a
9100 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9101 Library.sort_strings on result).
9103 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9104 fold_types traverse types/terms from left to right, observing natural
9105 argument order. Supercedes previous foldl_XXX versions, add_frees,
9106 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9108 * Pure: name spaces have been refined, with significant changes of the
9109 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9110 to extern(_table). The plain name entry path is superceded by a
9111 general 'naming' context, which also includes the 'policy' to produce
9112 a fully qualified name and external accesses of a fully qualified
9113 name; NameSpace.extend is superceded by context dependent
9114 Sign.declare_name. Several theory and proof context operations modify
9115 the naming context. Especially note Theory.restore_naming and
9116 ProofContext.restore_naming to get back to a sane state; note that
9117 Theory.add_path is no longer sufficient to recover from
9118 Theory.absolute_path in particular.
9120 * Pure: new flags short_names (default false) and unique_names
9121 (default true) for controlling output of qualified names. If
9122 short_names is set, names are printed unqualified. If unique_names is
9123 reset, the name prefix is reduced to the minimum required to achieve
9124 the original result when interning again, even if there is an overlap
9125 with earlier declarations.
9127 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9128 now 'extend', and 'merge' gets an additional Pretty.pp argument
9129 (useful for printing error messages). INCOMPATIBILITY.
9131 * Pure: major reorganization of the theory context. Type Sign.sg and
9132 Theory.theory are now identified, referring to the universal
9133 Context.theory (see Pure/context.ML). Actual signature and theory
9134 content is managed as theory data. The old code and interfaces were
9135 spread over many files and structures; the new arrangement introduces
9136 considerable INCOMPATIBILITY to gain more clarity:
9138 Context -- theory management operations (name, identity, inclusion,
9139 parents, ancestors, merge, etc.), plus generic theory data;
9141 Sign -- logical signature and syntax operations (declaring consts,
9142 types, etc.), plus certify/read for common entities;
9144 Theory -- logical theory operations (stating axioms, definitions,
9145 oracles), plus a copy of logical signature operations (consts,
9146 types, etc.); also a few basic management operations (Theory.copy,
9149 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9150 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9151 for convenience -- they merely return the theory.
9153 * Pure: type Type.tsig is superceded by theory in most interfaces.
9155 * Pure: the Isar proof context type is already defined early in Pure
9156 as Context.proof (note that ProofContext.context and Proof.context are
9157 aliases, where the latter is the preferred name). This enables other
9158 Isabelle components to refer to that type even before Isar is present.
9160 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9161 typeK, constK, axiomK, oracleK), but provide explicit operations for
9162 any of these kinds. For example, Sign.intern typeK is now
9163 Sign.intern_type, Theory.hide_space Sign.typeK is now
9164 Theory.hide_types. Also note that former
9165 Theory.hide_classes/types/consts are now
9166 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9167 internalize their arguments! INCOMPATIBILITY.
9169 * Pure: get_thm interface (of PureThy and ProofContext) expects
9170 datatype thmref (with constructors Name and NameSelection) instead of
9171 plain string -- INCOMPATIBILITY;
9173 * Pure: cases produced by proof methods specify options, where NONE
9174 means to remove case bindings -- INCOMPATIBILITY in
9177 * Pure: the following operations retrieve axioms or theorems from a
9178 theory node or theory hierarchy, respectively:
9180 Theory.axioms_of: theory -> (string * term) list
9181 Theory.all_axioms_of: theory -> (string * term) list
9182 PureThy.thms_of: theory -> (string * thm) list
9183 PureThy.all_thms_of: theory -> (string * thm) list
9185 * Pure: print_tac now outputs the goal through the trace channel.
9187 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9188 Reference Toplevel.debug (default false) controls detailed printing
9189 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9190 controls execution profiling -- set to 1 for time and 2 for space
9191 (both increase the runtime).
9193 * Isar session: The initial use of ROOT.ML is now always timed,
9194 i.e. the log will show the actual process times, in contrast to the
9195 elapsed wall-clock time that the outer shell wrapper produces.
9197 * Simplifier: improved handling of bound variables (nameless
9198 representation, avoid allocating new strings). Simprocs that invoke
9199 the Simplifier recursively should use Simplifier.inherit_bounds to
9200 avoid local name clashes. Failure to do so produces warnings
9201 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9202 for further details.
9204 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9205 bindings for all theorems stored within a given theory; this may help
9206 in porting non-Isar theories to Isar ones, while keeping ML proof
9207 scripts for the time being.
9209 * ML operator HTML.with_charset specifies the charset begin used for
9210 generated HTML files. For example:
9212 HTML.with_charset "utf-8" use_thy "Hebrew";
9213 HTML.with_charset "utf-8" use_thy "Chinese";
9218 * Allow symlinks to all proper Isabelle executables (Isabelle,
9219 isabelle, isatool etc.).
9221 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9222 isatool doc, isatool mkdir, display_drafts etc.).
9224 * isatool usedir: option -f allows specification of the ML file to be
9225 used by Isabelle; default is ROOT.ML.
9227 * New isatool version outputs the version identifier of the Isabelle
9228 distribution being used.
9230 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9231 (containing Boolean satisfiability problems) into Isabelle/HOL
9236 New in Isabelle2004 (April 2004)
9237 --------------------------------
9241 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9242 Replaces linorder.ML.
9244 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9245 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9246 (\<a>...\<z>), are now considered normal letters, and can therefore
9247 be used anywhere where an ASCII letter (a...zA...Z) has until
9248 now. COMPATIBILITY: This obviously changes the parsing of some
9249 terms, especially where a symbol has been used as a binder, say
9250 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9251 as an identifier. Fix it by inserting a space around former
9252 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9253 existing theory and ML files.
9255 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9257 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9258 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9259 a normal (but invisible) letter. For multiple letter subscripts repeat
9260 \<^isub> like this: x\<^isub>1\<^isub>2.
9262 * Pure: There are now sub-/superscripts that can span more than one
9263 character. Text between \<^bsub> and \<^esub> is set in subscript in
9264 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9265 superscript. The new control characters are not identifier parts.
9267 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9268 content of "..." to the latex file instead of \isacntrl... . The "..."
9269 may consist of any printable characters excluding the end bracket >.
9271 * Pure: Using new Isar command "finalconsts" (or the ML functions
9272 Theory.add_finals or Theory.add_finals_i) it is now possible to
9273 declare constants "final", which prevents their being given a definition
9274 later. It is useful for constants whose behaviour is fixed axiomatically
9275 rather than definitionally, such as the meta-logic connectives.
9277 * Pure: 'instance' now handles general arities with general sorts
9278 (i.e. intersections of classes),
9280 * Presentation: generated HTML now uses a CSS style sheet to make layout
9281 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9282 It can be changed to alter the colors/layout of generated pages.
9287 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9288 cut_tac, subgoal_tac and thin_tac:
9289 - Now understand static (Isar) contexts. As a consequence, users of Isar
9290 locales are no longer forced to write Isar proof scripts.
9291 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9293 - INCOMPATIBILITY: names of variables to be instantiated may no
9294 longer be enclosed in quotes. Instead, precede variable name with `?'.
9295 This is consistent with the instantiation attribute "where".
9297 * Attributes "where" and "of":
9298 - Now take type variables of instantiated theorem into account when reading
9299 the instantiation string. This fixes a bug that caused instantiated
9300 theorems to have too special types in some circumstances.
9301 - "where" permits explicit instantiations of type variables.
9303 * Calculation commands "moreover" and "also" no longer interfere with
9304 current facts ("this"), admitting arbitrary combinations with "then"
9308 - Goal statements involving the context element "includes" no longer
9309 generate theorems with internal delta predicates (those ending on
9310 "_axioms") in the premise.
9311 Resolve particular premise with <locale>.intro to obtain old form.
9312 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9313 specification and "includes" elements in goal statement.
9314 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9315 [intro?] and [elim?] (respectively) by default.
9316 - Experimental command for instantiation of locales in proof contexts:
9317 instantiate <label>[<attrs>]: <loc>
9318 Instantiates locale <loc> and adds all its theorems to the current context
9319 taking into account their attributes. Label and attrs are optional
9320 modifiers, like in theorem declarations. If present, names of
9321 instantiated theorems are qualified with <label>, and the attributes
9322 <attrs> are applied after any attributes these theorems might have already.
9323 If the locale has assumptions, a chained fact of the form
9324 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9325 are derived. The command does not support old-style locales declared
9326 with "locale (open)".
9327 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9329 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9335 * Proof import: new image HOL4 contains the imported library from
9336 the HOL4 system with about 2500 theorems. It is imported by
9337 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9338 can be used like any other Isabelle image. See
9339 HOL/Import/HOL/README for more information.
9342 - Much improved handling of linear and partial orders.
9343 Reasoners for linear and partial orders are set up for type classes
9344 "linorder" and "order" respectively, and are added to the default simpset
9345 as solvers. This means that the simplifier can build transitivity chains
9346 to solve goals from the assumptions.
9347 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9348 of blast or auto after simplification become unnecessary because the goal
9349 is solved by simplification already.
9351 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9352 all proved in axiomatic type classes for semirings, rings and fields.
9355 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9356 now formalized using the Ring_and_Field theory mentioned above.
9357 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9358 than before, because now they are set up once in a generic manner.
9359 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9360 Look for the general versions in Ring_and_Field (and Power if they concern
9363 * Type "rat" of the rational numbers is now available in HOL-Complex.
9366 - Record types are now by default printed with their type abbreviation
9367 instead of the list of all field types. This can be configured via
9368 the reference "print_record_type_abbr".
9369 - Simproc "record_upd_simproc" for simplification of multiple updates added
9370 (not enabled by default).
9371 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9372 EX x. x = sel r to True (not enabled by default).
9373 - Tactic "record_split_simp_tac" to split and simplify records added.
9375 * 'specification' command added, allowing for definition by
9376 specification. There is also an 'ax_specification' command that
9377 introduces the new constants axiomatically.
9379 * arith(_tac) is now able to generate counterexamples for reals as well.
9381 * HOL-Algebra: new locale "ring" for non-commutative rings.
9383 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9384 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9386 * HOL-Matrix: a first theory for matrices in HOL with an application of
9387 matrix theory to linear programming.
9389 * Unions and Intersections:
9390 The latex output syntax of UN and INT has been changed
9391 from "\Union x \in A. B" to "\Union_{x \in A} B"
9392 i.e. the index formulae has become a subscript.
9393 Similarly for "\Union x. B", and for \Inter instead of \Union.
9395 * Unions and Intersections over Intervals:
9396 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9397 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9398 like in normal math, and corresponding versions for < and for intersection.
9400 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9401 lexicographic dictonary ordering has been added as "lexord".
9403 * ML: the legacy theory structures Int and List have been removed. They had
9404 conflicted with ML Basis Library structures having the same names.
9406 * 'refute' command added to search for (finite) countermodels. Only works
9407 for a fragment of HOL. The installation of an external SAT solver is
9408 highly recommended. See "HOL/Refute.thy" for details.
9410 * 'quickcheck' command: Allows to find counterexamples by evaluating
9411 formulae under an assignment of free variables to random values.
9412 In contrast to 'refute', it can deal with inductive datatypes,
9413 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9419 * Streams now come with concatenation and are part of the HOLCF image
9423 New in Isabelle2003 (May 2003)
9424 ------------------------------
9428 * Provers/simplifier:
9430 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9431 Assumptions are now subject to complete mutual simplification,
9432 not just from left to right. The simplifier now preserves
9433 the order of assumptions.
9435 Potential INCOMPATIBILITY:
9437 -- simp sometimes diverges where the old version did
9438 not, e.g. invoking simp on the goal
9440 [| P (f x); y = x; f x = f y |] ==> Q
9442 now gives rise to the infinite reduction sequence
9444 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9446 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9449 -- Tactics combining classical reasoner and simplification (such as auto)
9450 are also affected by this change, because many of them rely on
9451 simp. They may sometimes diverge as well or yield a different numbers
9452 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9453 in case of problems. Sometimes subsequent calls to the classical
9454 reasoner will fail because a preceeding call to the simplifier too
9455 eagerly simplified the goal, e.g. deleted redundant premises.
9457 - The simplifier trace now shows the names of the applied rewrite rules
9459 - You can limit the number of recursive invocations of the simplifier
9460 during conditional rewriting (where the simplifie tries to solve the
9461 conditions before applying the rewrite rule):
9462 ML "simp_depth_limit := n"
9463 where n is an integer. Thus you can force termination where previously
9464 the simplifier would diverge.
9466 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9468 - No longer aborts on failed congruence proof. Instead, the
9469 congruence is ignored.
9471 * Pure: New generic framework for extracting programs from constructive
9472 proofs. See HOL/Extraction.thy for an example instantiation, as well
9473 as HOL/Extraction for some case studies.
9475 * Pure: The main goal of the proof state is no longer shown by default, only
9476 the subgoals. This behaviour is controlled by a new flag.
9477 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9478 (ML: Proof.show_main_goal).
9480 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9481 rules whose conclusion matches subgoal 1:
9482 PG menu: Isabelle/Isar -> Show me -> matching rules
9483 The rules are ordered by how closely they match the subgoal.
9484 In particular, rules that solve a subgoal outright are displayed first
9485 (or rather last, the way they are printed).
9486 (ML: ProofGeneral.print_intros())
9488 * Pure: New flag trace_unify_fail causes unification to print
9489 diagnostic information (PG: in trace buffer) when it fails. This is
9490 useful for figuring out why single step proofs like rule, erule or
9493 * Pure: Locale specifications now produce predicate definitions
9494 according to the body of text (covering assumptions modulo local
9495 definitions); predicate "loc_axioms" covers newly introduced text,
9496 while "loc" is cumulative wrt. all included locale expressions; the
9497 latter view is presented only on export into the global theory
9498 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9499 on the old view without predicates;
9501 * Pure: predefined locales "var" and "struct" are useful for sharing
9502 parameters (as in CASL, for example); just specify something like
9503 ``var x + var y + struct M'' as import;
9505 * Pure: improved thms_containing: proper indexing of facts instead of
9506 raw theorems; check validity of results wrt. current name space;
9507 include local facts of proof configuration (also covers active
9508 locales), cover fixed variables in index; may use "_" in term
9509 specification; an optional limit for the number of printed facts may
9510 be given (the default is 40);
9512 * Pure: disallow duplicate fact bindings within new-style theory files
9515 * Provers: improved induct method: assumptions introduced by case
9516 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9517 the goal statement); "foo" still refers to all facts collectively;
9519 * Provers: the function blast.overloaded has been removed: all constants
9520 are regarded as potentially overloaded, which improves robustness in exchange
9521 for slight decrease in efficiency;
9523 * Provers/linorder: New generic prover for transitivity reasoning over
9524 linear orders. Note: this prover is not efficient!
9526 * Isar: preview of problems to finish 'show' now produce an error
9527 rather than just a warning (in interactive mode);
9534 - Produces a counter example if it cannot prove a goal.
9535 Note that the counter example may be spurious if the goal is not a formula
9536 of quantifier-free linear arithmetic.
9537 In ProofGeneral the counter example appears in the trace buffer.
9539 - Knows about div k and mod k where k is a numeral of type nat or int.
9541 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9542 linear arithmetic fails. This takes account of quantifiers and divisibility.
9543 Presburger arithmetic can also be called explicitly via presburger(_tac).
9545 * simp's arithmetic capabilities have been enhanced a bit: it now
9546 takes ~= in premises into account (by performing a case split);
9548 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9549 are distributed over a sum of terms;
9551 * New tactic "trans_tac" and method "trans" instantiate
9552 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9555 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9556 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9558 * 'typedef' command has new option "open" to suppress the set
9561 * functions Min and Max on finite sets have been introduced (theory
9564 * attribute [symmetric] now works for relations as well; it turns
9565 (x,y) : R^-1 into (y,x) : R, and vice versa;
9567 * induct over a !!-quantified statement (say !!x1..xn):
9568 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9570 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9571 %x. None. Warning: empty_def now refers to the previously hidden definition
9574 * Algebra: formalization of classical algebra. Intended as base for
9575 any algebraic development in Isabelle. Currently covers group theory
9576 (up to Sylow's theorem) and ring theory (Universal Property of
9577 Univariate Polynomials). Contributions welcome;
9579 * GroupTheory: deleted, since its material has been moved to Algebra;
9581 * Complex: new directory of the complex numbers with numeric constants,
9582 nonstandard complex numbers, and some complex analysis, standard and
9583 nonstandard (Jacques Fleuriot);
9585 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9587 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9590 * Real/HahnBanach: updated and adapted to locales;
9592 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9595 * UNITY: added the Meier-Sanders theory of progress sets;
9597 * MicroJava: bytecode verifier and lightweight bytecode verifier
9598 as abstract algorithms, instantiated to the JVM;
9600 * Bali: Java source language formalization. Type system, operational
9601 semantics, axiomatic semantics. Supported language features:
9602 classes, interfaces, objects,virtual methods, static methods,
9603 static/instance fields, arrays, access modifiers, definite
9604 assignment, exceptions.
9609 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9612 * Main ZF: virtually all theories converted to new-style format;
9617 * Pure: Tactic.prove provides sane interface for internal proofs;
9618 omits the infamous "standard" operation, so this is more appropriate
9619 than prove_goalw_cterm in many situations (e.g. in simprocs);
9621 * Pure: improved error reporting of simprocs;
9623 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9627 *** Document preparation ***
9629 * uses \par instead of \\ for line breaks in theory text. This may
9630 shift some page breaks in large documents. To get the old behaviour
9631 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9633 * minimized dependencies of isabelle.sty and isabellesym.sty on
9636 * \<euro> now needs package babel/greek instead of marvosym (which
9639 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9644 New in Isabelle2002 (March 2002)
9645 --------------------------------
9647 *** Document preparation ***
9649 * greatly simplified document preparation setup, including more
9650 graceful interpretation of isatool usedir -i/-d/-D options, and more
9651 instructive isatool mkdir; users should basically be able to get
9652 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9653 users may run a separate document processing stage manually like this:
9654 "isatool usedir -D output HOL Test && isatool document Test/output";
9656 * theory dependency graph may now be incorporated into documents;
9657 isatool usedir -g true will produce session_graph.eps/.pdf for use
9658 with \includegraphics of LaTeX;
9660 * proper spacing of consecutive markup elements, especially text
9661 blocks after section headings;
9663 * support bold style (for single symbols only), input syntax is like
9664 this: "\<^bold>\<alpha>" or "\<^bold>A";
9666 * \<bullet> is now output as bold \cdot by default, which looks much
9667 better in printed text;
9669 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9670 note that these symbols are currently unavailable in Proof General /
9671 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9673 * isatool latex no longer depends on changed TEXINPUTS, instead
9674 isatool document copies the Isabelle style files to the target
9680 * Pure/Provers: improved proof by cases and induction;
9681 - 'case' command admits impromptu naming of parameters (such as
9683 - 'induct' method divinates rule instantiation from the inductive
9684 claim; no longer requires excessive ?P bindings for proper
9685 instantiation of cases;
9686 - 'induct' method properly enumerates all possibilities of set/type
9687 rules; as a consequence facts may be also passed through *type*
9688 rules without further ado;
9689 - 'induct' method now derives symbolic cases from the *rulified*
9690 rule (before it used to rulify cases stemming from the internal
9691 atomized version); this means that the context of a non-atomic
9692 statement becomes is included in the hypothesis, avoiding the
9693 slightly cumbersome show "PROP ?case" form;
9694 - 'induct' may now use elim-style induction rules without chaining
9695 facts, using ``missing'' premises from the goal state; this allows
9696 rules stemming from inductive sets to be applied in unstructured
9697 scripts, while still benefitting from proper handling of non-atomic
9698 statements; NB: major inductive premises need to be put first, all
9699 the rest of the goal is passed through the induction;
9700 - 'induct' proper support for mutual induction involving non-atomic
9701 rule statements (uses the new concept of simultaneous goals, see
9703 - append all possible rule selections, but only use the first
9704 success (no backtracking);
9705 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9706 - undeclared rule case names default to numbers 1, 2, 3, ...;
9707 - added 'print_induct_rules' (covered by help item in recent Proof
9709 - moved induct/cases attributes to Pure, methods to Provers;
9710 - generic method setup instantiated for FOL and HOL;
9712 * Pure: support multiple simultaneous goal statements, for example
9713 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9714 meta-level mechanism, this acts as if several individual goals had
9715 been stated separately; in particular common proof methods need to be
9716 repeated in order to cover all claims; note that a single elimination
9717 step is *not* sufficient to establish the two conjunctions, so this
9720 assume "A & B" then have A and B .. (*".." fails*)
9722 better use "obtain" in situations as above; alternative refer to
9723 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9725 * Pure: proper integration with ``locales''; unlike the original
9726 version by Florian Kammller, Isar locales package high-level proof
9727 contexts rather than raw logical ones (e.g. we admit to include
9728 attributes everywhere); operations on locales include merge and
9729 rename; support for implicit arguments (``structures''); simultaneous
9730 type-inference over imports and text; see also HOL/ex/Locales.thy for
9733 * Pure: the following commands have been ``localized'', supporting a
9734 target locale specification "(in name)": 'lemma', 'theorem',
9735 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9736 stored both within the locale and at the theory level (exported and
9737 qualified by the locale name);
9739 * Pure: theory goals may now be specified in ``long'' form, with
9740 ad-hoc contexts consisting of arbitrary locale elements. for example
9741 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9742 definitions may be given, too); the result is a meta-level rule with
9743 the context elements being discharged in the obvious way;
9745 * Pure: new proof command 'using' allows to augment currently used
9746 facts after a goal statement ('using' is syntactically analogous to
9747 'apply', but acts on the goal's facts only); this allows chained facts
9748 to be separated into parts given before and after a claim, as in
9749 ``from a and b have C using d and e <proof>'';
9751 * Pure: renamed "antecedent" case to "rule_context";
9753 * Pure: new 'judgment' command records explicit information about the
9754 object-logic embedding (used by several tools internally); no longer
9755 use hard-wired "Trueprop";
9757 * Pure: added 'corollary' command;
9759 * Pure: fixed 'token_translation' command;
9761 * Pure: removed obsolete 'exported' attribute;
9763 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9764 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9765 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9767 * Pure: method 'atomize' presents local goal premises as object-level
9768 statements (atomic meta-level propositions); setup controlled via
9769 rewrite rules declarations of 'atomize' attribute; example
9770 application: 'induct' method with proper rule statements in improper
9773 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9774 now consider the syntactic context of assumptions, giving a better
9775 chance to get type-inference of the arguments right (this is
9776 especially important for locales);
9778 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9781 * Pure/obtain: the formal conclusion "thesis", being marked as
9782 ``internal'', may no longer be reference directly in the text;
9783 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9786 * Pure: generic 'sym' attribute which declares a rule both as pure
9787 'elim?' and for the 'symmetric' operation;
9789 * Pure: marginal comments ``--'' may now occur just anywhere in the
9790 text; the fixed correlation with particular command syntax has been
9793 * Pure: new method 'rules' is particularly well-suited for proof
9794 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9795 but often produces more compact proof terms with less detours;
9797 * Pure/Provers/classical: simplified integration with pure rule
9798 attributes and methods; the classical "intro?/elim?/dest?"
9799 declarations coincide with the pure ones; the "rule" method no longer
9800 includes classically swapped intros; "intro" and "elim" methods no
9801 longer pick rules from the context; also got rid of ML declarations
9802 AddXIs/AddXEs/AddXDs; all of this has some potential for
9805 * Provers/classical: attribute 'swapped' produces classical inversions
9806 of introduction rules;
9808 * Provers/simplifier: 'simplified' attribute may refer to explicit
9809 rules instead of full simplifier context; 'iff' attribute handles
9812 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9814 * HOL: 'recdef' now fails on unfinished automated proofs, use
9815 "(permissive)" option to recover old behavior;
9817 * HOL: 'inductive' no longer features separate (collective) attributes
9818 for 'intros' (was found too confusing);
9820 * HOL: properly declared induction rules less_induct and
9826 * HOL: moved over to sane numeral syntax; the new policy is as
9829 - 0 and 1 are polymorphic constants, which are defined on any
9830 numeric type (nat, int, real etc.);
9832 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9833 binary representation internally;
9835 - type nat has special constructor Suc, and generally prefers Suc 0
9836 over 1::nat and Suc (Suc 0) over 2::nat;
9838 This change may cause significant problems of INCOMPATIBILITY; here
9839 are some hints on converting existing sources:
9841 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9842 entities, so expressions involving "-" (unary or binary minus) need
9843 to be spaced properly;
9845 - existing occurrences of "1" may need to be constraint "1::nat" or
9846 even replaced by Suc 0; similar for old "2";
9848 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9850 - remove all special provisions on numerals in proofs;
9852 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9853 representation (depends on bin_arith_simps in the default context);
9855 * HOL: symbolic syntax for x^2 (numeral 2);
9857 * HOL: the class of all HOL types is now called "type" rather than
9858 "term"; INCOMPATIBILITY, need to adapt references to this type class
9859 in axclass/classes, instance/arities, and (usually rare) occurrences
9860 in typings (of consts etc.); internally the class is called
9861 "HOL.type", ML programs should refer to HOLogic.typeS;
9863 * HOL/record package improvements:
9864 - new derived operations "fields" to build a partial record section,
9865 "extend" to promote a fixed record to a record scheme, and
9866 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9867 declared as simp by default;
9868 - shared operations ("more", "fields", etc.) now need to be always
9869 qualified) --- potential INCOMPATIBILITY;
9870 - removed "make_scheme" operations (use "make" with "extend") --
9872 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9873 - provides cases/induct rules for use with corresponding Isar
9874 methods (for concrete records, record schemes, concrete more
9875 parts, and schematic more parts -- in that order);
9876 - internal definitions directly based on a light-weight abstract
9877 theory of product types over typedef rather than datatype;
9879 * HOL: generic code generator for generating executable ML code from
9880 specifications; specific support for HOL constructs such as inductive
9881 datatypes and sets, as well as recursive functions; can be invoked
9882 via 'generate_code' theory section;
9884 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9886 * HOL: consolidated and renamed several theories. In particular:
9887 Ord.thy has been absorbed into HOL.thy
9888 String.thy has been absorbed into List.thy
9890 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9891 (beware of argument permutation!);
9893 * HOL: linorder_less_split superseded by linorder_cases;
9895 * HOL/List: "nodups" renamed to "distinct";
9897 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9898 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9899 - Ex_def has changed, now need to use some_eq_ex
9901 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9902 in this (rare) case use:
9904 delSWrapper "split_all_tac"
9905 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9907 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9910 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9911 Isabelle's type classes, ^ on functions and relations has too general
9912 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9913 necessary to attach explicit type constraints;
9915 * HOL/Relation: the prefix name of the infix "O" has been changed from
9916 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9917 renamed accordingly (eg "compI" -> "rel_compI").
9919 * HOL: syntax translations now work properly with numerals and records
9922 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9923 of "lam" -- INCOMPATIBILITY;
9925 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9926 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9927 renamed "Product_Type.unit";
9929 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9931 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9932 the "cases" method);
9934 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9937 * HOL/IMP: updated and converted to new-style theory format; several
9938 parts turned into readable document, with proper Isar proof texts and
9939 some explanations (by Gerwin Klein);
9941 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9943 * HOL-Hyperreal is now a logic image;
9948 * Isar: consts/constdefs supports mixfix syntax for continuous
9951 * Isar: domain package adapted to new-style theory format, e.g. see
9954 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9955 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9956 lift.induct_tac, always use UU instead of Undef;
9958 * HOLCF/IMP: updated and converted to new-style theory;
9963 * Isar: proper integration of logic-specific tools and packages,
9964 including theory commands '(co)inductive', '(co)datatype',
9965 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9966 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9968 * theory Main no longer includes AC; for the Axiom of Choice, base
9969 your theory on Main_ZFC;
9971 * the integer library now covers quotients and remainders, with many
9972 laws relating division to addition, multiplication, etc.;
9974 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9975 typeless version of the formalism;
9977 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9980 * ZF/Induct: new directory for examples of inductive definitions,
9981 including theory Multiset for multiset orderings; converted to
9982 new-style theory format;
9984 * ZF: many new theorems about lists, ordinals, etc.;
9989 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9990 variable proof controls level of detail: 0 = no proofs (only oracle
9991 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9992 also ref manual for further ML interfaces;
9994 * Pure/axclass: removed obsolete ML interface
9995 goal_subclass/goal_arity;
9997 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9998 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9999 separate tokens, so expressions involving minus need to be spaced
10002 * Pure/syntax: support non-oriented infixes, using keyword "infix"
10003 rather than "infixl" or "infixr";
10005 * Pure/syntax: concrete syntax for dummy type variables admits genuine
10006 sort constraint specifications in type inference; e.g. "x::_::foo"
10007 ensures that the type of "x" is of sort "foo" (but not necessarily a
10010 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
10011 control output of nested => (types); the default behavior is
10014 * Pure/syntax: builtin parse translation for "_constify" turns valued
10015 tokens into AST constants;
10017 * Pure/syntax: prefer later declarations of translations and print
10018 translation functions; potential INCOMPATIBILITY: need to reverse
10019 multiple declarations for same syntax element constant;
10021 * Pure/show_hyps reset by default (in accordance to existing Isar
10024 * Provers/classical: renamed addaltern to addafter, addSaltern to
10027 * Provers/clasimp: ``iff'' declarations now handle conditional rules
10030 * system: tested support for MacOS X; should be able to get Isabelle +
10031 Proof General to work in a plain Terminal after installing Poly/ML
10032 (e.g. from the Isabelle distribution area) and GNU bash alone
10033 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
10034 support requires further installations, e.g. from
10035 http://fink.sourceforge.net/);
10037 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
10039 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
10040 of 40 MB), cf. ML_OPTIONS;
10042 * system: Proof General keywords specification is now part of the
10043 Isabelle distribution (see etc/isar-keywords.el);
10045 * system: support for persistent Proof General sessions (refrain from
10046 outdating all loaded theories on startup); user may create writable
10047 logic images like this: ``isabelle -q HOL Test'';
10049 * system: smart selection of Isabelle process versus Isabelle
10050 interface, accommodates case-insensitive file systems (e.g. HFS+); may
10051 run both "isabelle" and "Isabelle" even if file names are badly
10052 damaged (executable inspects the case of the first letter of its own
10053 name); added separate "isabelle-process" and "isabelle-interface";
10055 * system: refrain from any attempt at filtering input streams; no
10056 longer support ``8bit'' encoding of old isabelle font, instead proper
10057 iso-latin characters may now be used; the related isatools
10058 "symbolinput" and "nonascii" have disappeared as well;
10060 * system: removed old "xterm" interface (the print modes "xterm" and
10061 "xterm_color" are still available for direct use in a suitable
10066 New in Isabelle99-2 (February 2001)
10067 -----------------------------------
10069 *** Overview of INCOMPATIBILITIES ***
10071 * HOL: please note that theories in the Library and elsewhere often use the
10072 new-style (Isar) format; to refer to their theorems in an ML script you must
10073 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
10075 * HOL: inductive package no longer splits induction rule aggressively,
10076 but only as far as specified by the introductions given; the old
10077 format may be recovered via ML function complete_split_rule or attribute
10078 'split_rule (complete)';
10080 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10081 gfp_Tarski to gfp_unfold;
10083 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10085 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10086 relation); infix "^^" has been renamed "``"; infix "``" has been
10087 renamed "`"; "univalent" has been renamed "single_valued";
10089 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10092 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10094 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10096 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10097 consequence, it is no longer monotonic wrt. the local goal context
10098 (which is now passed through the inductive cases);
10100 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10101 \<gg> to \<ggreater>;
10104 *** Document preparation ***
10106 * \isabellestyle{NAME} selects version of Isabelle output (currently
10107 available: are "it" for near math-mode best-style output, "sl" for
10108 slanted text style, and "tt" for plain type-writer; if no
10109 \isabellestyle command is given, output is according to slanted
10112 * support sub/super scripts (for single symbols only), input syntax is
10113 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10115 * some more standard symbols; see Appendix A of the system manual for
10116 the complete list of symbols defined in isabellesym.sty;
10118 * improved isabelle style files; more abstract symbol implementation
10119 (should now use \isamath{...} and \isatext{...} in custom symbol
10122 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10123 state; Note that presentation of goal states does not conform to
10124 actual human-readable proof documents. Please do not include goal
10125 states into document output unless you really know what you are doing!
10127 * proper indentation of antiquoted output with proportional LaTeX
10130 * no_document ML operator temporarily disables LaTeX document
10133 * isatool unsymbolize tunes sources for plain ASCII communication;
10138 * Pure: Isar now suffers initial goal statements to contain unbound
10139 schematic variables (this does not conform to actual readable proof
10140 documents, due to unpredictable outcome and non-compositional proof
10141 checking); users who know what they are doing may use schematic goals
10142 for Prolog-style synthesis of proven results;
10144 * Pure: assumption method (an implicit finishing) now handles actual
10147 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10148 initial goal, declare "that" only as Pure intro (only for single
10149 steps); the "that" rule assumption may now be involved in implicit
10150 finishing, thus ".." becomes a feasible for trivial obtains;
10152 * Pure: default proof step now includes 'intro_classes'; thus trivial
10153 instance proofs may be performed by "..";
10155 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10156 statements as well;
10158 * Pure: more robust selection of calculational rules;
10160 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10161 rule (as well as the assumption rule);
10163 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10164 lemmas, using the graph browser tool;
10166 * Pure: predict failure of "show" in interactive mode;
10168 * Pure: 'thms_containing' now takes actual terms as arguments;
10170 * HOL: improved method 'induct' --- now handles non-atomic goals
10171 (potential INCOMPATIBILITY); tuned error handling;
10173 * HOL: cases and induct rules now provide explicit hints about the
10174 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10175 any remaining facts are inserted into the goal verbatim;
10177 * HOL: local contexts (aka cases) may now contain term bindings as
10178 well; the 'cases' and 'induct' methods new provide a ?case binding for
10179 the result to be shown in each case;
10181 * HOL: added 'recdef_tc' command;
10183 * isatool convert assists in eliminating legacy ML scripts;
10188 * HOL/Library: a collection of generic theories to be used together
10189 with main HOL; the theory loader path already includes this directory
10190 by default; the following existing theories have been moved here:
10191 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10192 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10194 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10195 modelling and verification task performed in Isabelle/HOL +
10196 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10198 * HOL/Algebra: special summation operator SUM no longer exists, it has
10199 been replaced by setsum; infix 'assoc' now has priority 50 (like
10200 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10201 'domain', this makes the theory consistent with mathematical
10204 * HOL basics: added overloaded operations "inverse" and "divide"
10205 (infix "/"), syntax for generic "abs" operation, generic summation
10208 * HOL/typedef: simplified package, provide more useful rules (see also
10211 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10212 now expressed as a proper nested rule (old-style tactic scripts may
10213 require atomize_strip_tac to cope with non-atomic premises);
10215 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10216 to "split_conv" (old name still available for compatibility);
10218 * HOL: improved concrete syntax for strings (e.g. allows translation
10219 rules with string literals);
10221 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10222 and Fleuriot's mechanization of analysis, including the transcendental
10223 functions for the reals;
10225 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10230 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10231 "lam" is displayed as TWO lambda-symbols
10233 * CTT: theory Main now available, containing everything (that is, Bool
10239 * Pure: the Simplifier has been implemented properly as a derived rule
10240 outside of the actual kernel (at last!); the overall performance
10241 penalty in practical applications is about 50%, while reliability of
10242 the Isabelle inference kernel has been greatly improved;
10244 * print modes "brackets" and "no_brackets" control output of nested =>
10245 (types) and ==> (props); the default behaviour is "brackets";
10247 * Provers: fast_tac (and friends) now handle actual object-logic rules
10248 as assumptions as well;
10250 * system: support Poly/ML 4.0;
10252 * system: isatool install handles KDE version 1 or 2;
10256 New in Isabelle99-1 (October 2000)
10257 ----------------------------------
10259 *** Overview of INCOMPATIBILITIES ***
10261 * HOL: simplification of natural numbers is much changed; to partly
10262 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10263 issue the following ML commands:
10265 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10266 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10268 * HOL: simplification no longer dives into case-expressions; this is
10269 controlled by "t.weak_case_cong" for each datatype t;
10271 * HOL: nat_less_induct renamed to less_induct;
10273 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10274 fixsome to patch .thy and .ML sources automatically;
10276 select_equality -> some_equality
10277 select_eq_Ex -> some_eq_ex
10278 selectI2EX -> someI2_ex
10281 select1_equality -> some1_equality
10282 Eps_sym_eq -> some_sym_eq_trivial
10283 Eps_eq -> some_eq_trivial
10285 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10287 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10290 * HOL: the recursion equations generated by 'recdef' are now called
10291 f.simps instead of f.rules;
10293 * HOL: qed_spec_mp now also handles bounded ALL as well;
10295 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10296 sometimes be needed;
10298 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10300 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10302 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10303 product is now "<*>" instead of "Times"; the lexicographic product is
10304 now "<*lex*>" instead of "**";
10306 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10307 of main HOL, but was unused); better use HOL's datatype package;
10309 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10310 the old syntax may be recovered as follows:
10313 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10314 (infixl "\\<oplus>" 100)
10316 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10318 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10319 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10322 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10323 changed from A/r to A//r;
10325 * ZF: new treatment of arithmetic (nat & int) may break some old
10328 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10329 rulify -> rule_format, elimify -> elim_format, ...);
10331 * Isar/Provers: intro/elim/dest attributes changed; renamed
10332 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10333 should have to change intro!! to intro? only); replaced "delrule" by
10336 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10338 * Provers: strengthened force_tac by using new first_best_tac;
10340 * LaTeX document preparation: several changes of isabelle.sty (see
10344 *** Document preparation ***
10346 * formal comments (text blocks etc.) in new-style theories may now
10347 contain antiquotations of thm/prop/term/typ/text to be presented
10348 according to latex print mode; concrete syntax is like this:
10349 @{term[show_types] "f(x) = a + x"};
10351 * isatool mkdir provides easy setup of Isabelle session directories,
10352 including proper document sources;
10354 * generated LaTeX sources are now deleted after successful run
10355 (isatool document -c); may retain a copy somewhere else via -D option
10358 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10359 style files, achieving self-contained LaTeX sources and simplifying
10362 * old-style theories now produce (crude) LaTeX output as well;
10364 * browser info session directories are now self-contained (may be put
10365 on WWW server seperately); improved graphs of nested sessions; removed
10366 graph for 'all sessions';
10368 * several improvements in isabelle style files; \isabellestyle{it}
10369 produces fake math mode output; \isamarkupheader is now \section by
10370 default; see lib/texinputs/isabelle.sty etc.;
10375 * Isar/Pure: local results and corresponding term bindings are now
10376 subject to Hindley-Milner polymorphism (similar to ML); this
10377 accommodates incremental type-inference very nicely;
10379 * Isar/Pure: new derived language element 'obtain' supports
10380 generalized existence reasoning;
10382 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10383 support accumulation of results, without applying any rules yet;
10384 useful to collect intermediate results without explicit name
10385 references, and for use with transitivity rules with more than 2
10388 * Isar/Pure: scalable support for case-analysis type proofs: new
10389 'case' language element refers to local contexts symbolically, as
10390 produced by certain proof methods; internally, case names are attached
10391 to theorems as "tags";
10393 * Isar/Pure: theory command 'hide' removes declarations from
10394 class/type/const name spaces;
10396 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10397 indicate potential overloading;
10399 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10401 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10402 "{a,b,c}" instead of {a,b,c};
10404 * Isar/Pure now provides its own version of intro/elim/dest
10405 attributes; useful for building new logics, but beware of confusion
10406 with the version in Provers/classical;
10408 * Isar/Pure: the local context of (non-atomic) goals is provided via
10409 case name 'antecedent';
10411 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10412 to the current context is now done automatically);
10414 * Isar/Pure: theory command 'method_setup' provides a simple interface
10415 for definining proof methods in ML;
10417 * Isar/Provers: intro/elim/dest attributes changed; renamed
10418 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10419 most cases, one should have to change intro!! to intro? only);
10420 replaced "delrule" by "rule del";
10422 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10423 'symmetric' attribute (the latter supercedes [RS sym]);
10425 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10426 method modifier); 'simp' method: 'only:' modifier removes loopers as
10427 well (including splits);
10429 * Isar/Provers: Simplifier and Classical methods now support all kind
10430 of modifiers used in the past, including 'cong', 'iff', etc.
10432 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10433 of Simplifier and Classical reasoner);
10435 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10436 now support named cases; major packages (inductive, datatype, primrec,
10437 recdef) support case names and properly name parameters;
10439 * Isar/HOL: new transitivity rules for substitution in inequalities --
10440 monotonicity conditions are extracted to be proven at end of
10443 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10446 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10447 split_if split_if_asm; datatype package provides theorems foo.splits =
10448 foo.split foo.split_asm for each datatype;
10450 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10451 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10452 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10453 use "(cases (simplified))" method in proper proof texts);
10455 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10457 * Isar: names of theorems etc. may be natural numbers as well;
10459 * Isar: 'pr' command: optional arguments for goals_limit and
10460 ProofContext.prems_limit; no longer prints theory contexts, but only
10463 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10464 additional print modes to be specified; e.g. "pr(latex)" will print
10465 proof state according to the Isabelle LaTeX style;
10467 * Isar: improved support for emulating tactic scripts, including proof
10468 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10469 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10470 (for HOL datatypes);
10472 * Isar: simplified (more robust) goal selection of proof methods: 1st
10473 goal, all goals, or explicit goal specifier (tactic emulation); thus
10474 'proof method scripts' have to be in depth-first order;
10476 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10478 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10479 should instead use individual commands for printing items
10480 (print_commands, print_methods etc.);
10482 * Isar: added 'nothing' --- the empty list of theorems;
10487 * HOL/MicroJava: formalization of a fragment of Java, together with a
10488 corresponding virtual machine and a specification of its bytecode
10489 verifier and a lightweight bytecode verifier, including proofs of
10490 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10491 Cornelia Pusch (see also the homepage of project Bali at
10492 http://isabelle.in.tum.de/Bali/);
10494 * HOL/Algebra: new theory of rings and univariate polynomials, by
10497 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10498 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10501 * HOL/Lattice: fundamental concepts of lattice theory and order
10502 structures, including duals, properties of bounds versus algebraic
10503 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10504 Theorem for complete lattices etc.; may also serve as a demonstration
10505 for abstract algebraic reasoning using axiomatic type classes, and
10506 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10508 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10511 * HOL/IMPP: extension of IMP with local variables and mutually
10512 recursive procedures, by David von Oheimb;
10514 * HOL/Lambda: converted into new-style theory and document;
10516 * HOL/ex/Multiquote: example of multiple nested quotations and
10517 anti-quotations -- basically a generalized version of de-Bruijn
10518 representation; very useful in avoiding lifting of operations;
10520 * HOL/record: added general record equality rule to simpset; fixed
10521 select-update simplification procedure to handle extended records as
10522 well; admit "r" as field name;
10524 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10525 other numeric types and also as the identity of groups, rings, etc.;
10527 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10528 Types nat and int belong to this axclass;
10530 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10531 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10532 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10533 two terms #m*u and #n*u are replaced by #(m+n)*u
10534 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10535 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10536 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10538 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10539 powerful prover for predicate logic but knows nothing of clasets; see
10540 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10542 * HOL: new version of "case_tac" subsumes both boolean case split and
10543 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10544 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10546 * HOL: simplification no longer dives into case-expressions: only the
10547 selector expression is simplified, but not the remaining arms; to
10548 enable full simplification of case-expressions for datatype t, you may
10549 remove t.weak_case_cong from the simpset, either globally (Delcongs
10550 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10552 * HOL/recdef: the recursion equations generated by 'recdef' for
10553 function 'f' are now called f.simps instead of f.rules; if all
10554 termination conditions are proved automatically, these simplification
10555 rules are added to the simpset, as in primrec; rules may be named
10556 individually as well, resulting in a separate list of theorems for
10559 * HOL/While is a new theory that provides a while-combinator. It
10560 permits the definition of tail-recursive functions without the
10561 provision of a termination measure. The latter is necessary once the
10562 invariant proof rule for while is applied.
10564 * HOL: new (overloaded) notation for the set of elements below/above
10565 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10567 * HOL: theorems impI, allI, ballI bound as "strip";
10569 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10570 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10571 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10573 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10575 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10576 main HOL, but was unused);
10578 * HOL: fewer consts declared as global (e.g. have to refer to
10579 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10581 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10582 in case of overlap with user translations (e.g. judgements over
10583 tuples); (note that the underlying logical represenation is still
10589 * ZF: simplification automatically cancels common terms in arithmetic
10590 expressions over nat and int;
10592 * ZF: new treatment of nat to minimize type-checking: all operators
10593 coerce their operands to a natural number using the function natify,
10594 making the algebraic laws unconditional;
10596 * ZF: as above, for int: operators coerce their operands to an integer
10597 using the function intify;
10599 * ZF: the integer library now contains many of the usual laws for the
10600 orderings, including $<=, and monotonicity laws for $+ and $*;
10602 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10605 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10606 to the simplifier and classical reasoner simultaneously;
10611 * Provers: blast_tac now handles actual object-logic rules as
10612 assumptions; note that auto_tac uses blast_tac internally as well;
10614 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10615 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10617 * Provers: delrules now handles destruct rules as well (no longer need
10618 explicit make_elim);
10620 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10621 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10622 use instead the strong form,
10623 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10624 in HOL, FOL and ZF the function cla_make_elim will create such rules
10625 from destruct-rules;
10627 * Provers: Simplifier.easy_setup provides a fast path to basic
10628 Simplifier setup for new object-logics;
10630 * Pure: AST translation rules no longer require constant head on LHS;
10632 * Pure: improved name spaces: ambiguous output is qualified; support
10633 for hiding of names;
10635 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10636 XSYMBOL_HOME; no longer need to do manual configuration in most
10639 * system: compression of ML heaps images may now be controlled via -c
10640 option of isabelle and isatool usedir (currently only observed by
10643 * system: isatool installfonts may handle X-Symbol fonts as well (very
10644 useful for remote X11);
10646 * system: provide TAGS file for Isabelle sources;
10648 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10651 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10652 timing flag supersedes proof_timing and Toplevel.trace;
10654 * ML: new combinators |>> and |>>> for incremental transformations
10655 with secondary results (e.g. certain theory extensions):
10657 * ML: PureThy.add_defs gets additional argument to indicate potential
10658 overloading (usually false);
10660 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10665 New in Isabelle99 (October 1999)
10666 --------------------------------
10668 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10670 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10671 are no longer simplified. (This allows the simplifier to unfold recursive
10672 functional programs.) To restore the old behaviour, declare
10674 Delcongs [if_weak_cong];
10676 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10679 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10681 * HOL/datatype: mutual_induct_tac no longer exists --
10682 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10684 * HOL/typedef: fixed type inference for representing set; type
10685 arguments now have to occur explicitly on the rhs as type constraints;
10687 * ZF: The con_defs part of an inductive definition may no longer refer
10688 to constants declared in the same theory;
10690 * HOL, ZF: the function mk_cases, generated by the inductive
10691 definition package, has lost an argument. To simplify its result, it
10692 uses the default simpset instead of a supplied list of theorems.
10694 * HOL/List: the constructors of type list are now Nil and Cons;
10696 * Simplifier: the type of the infix ML functions
10697 setSSolver addSSolver setSolver addSolver
10698 is now simpset * solver -> simpset where `solver' is a new abstract type
10699 for packaging solvers. A solver is created via
10700 mk_solver: string -> (thm list -> int -> tactic) -> solver
10701 where the string argument is only a comment.
10704 *** Proof tools ***
10706 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10707 decision procedure for linear arithmetic. Currently it is used for
10708 types `nat', `int', and `real' in HOL (see below); it can, should and
10709 will be instantiated for other types and logics as well.
10711 * The simplifier now accepts rewrite rules with flexible heads, eg
10712 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10713 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10719 * New Isabelle/Isar subsystem provides an alternative to traditional
10720 tactical theorem proving; together with the ProofGeneral/isar user
10721 interface it offers an interactive environment for developing human
10722 readable proof documents (Isar == Intelligible semi-automated
10723 reasoning); for further information see isatool doc isar-ref,
10724 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10726 * improved and simplified presentation of theories: better HTML markup
10727 (including colors), graph views in several sizes; isatool usedir now
10728 provides a proper interface for user theories (via -P option); actual
10729 document preparation based on (PDF)LaTeX is available as well (for
10730 new-style theories only); see isatool doc system for more information;
10732 * native support for Proof General, both for classic Isabelle and
10735 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10736 using the graph browser tool;
10738 * Isabelle manuals now also available as PDF;
10740 * theory loader rewritten from scratch (may not be fully
10741 bug-compatible); old loadpath variable has been replaced by show_path,
10742 add_path, del_path, reset_path functions; new operations such as
10743 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10746 * improved isatool install: option -k creates KDE application icon,
10747 option -p DIR installs standalone binaries;
10749 * added ML_PLATFORM setting (useful for cross-platform installations);
10750 more robust handling of platform specific ML images for SML/NJ;
10752 * the settings environment is now statically scoped, i.e. it is never
10753 created again in sub-processes invoked from isabelle, isatool, or
10756 * path element specification '~~' refers to '$ISABELLE_HOME';
10758 * in locales, the "assumes" and "defines" parts may be omitted if
10761 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10764 * new print_mode "HTML";
10766 * new flag show_tags controls display of tags of theorems (which are
10767 basically just comments that may be attached by some tools);
10769 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10770 mode and goal output format:
10772 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10774 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10776 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10777 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10779 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10781 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10783 * function bind_thms stores lists of theorems (cf. bind_thm);
10785 * new shorthand tactics ftac, eatac, datac, fatac;
10787 * qed (and friends) now accept "" as result name; in that case the
10788 theorem is not stored, but proper checks and presentation of the
10789 result still apply;
10791 * theorem database now also indexes constants "Trueprop", "all",
10792 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10797 ** HOL arithmetic **
10799 * There are now decision procedures for linear arithmetic over nat and
10802 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10803 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10804 are treated as atomic; subformulae not involving type `nat' or `int'
10805 are ignored; quantified subformulae are ignored unless they are
10806 positive universal or negative existential. The tactic has to be
10807 invoked by hand and can be a little bit slow. In particular, the
10808 running time is exponential in the number of occurrences of `min' and
10809 `max', and `-' on `nat'.
10811 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10812 (negated) (in)equalities among the premises and the conclusion into
10813 account (i.e. no compound formulae) and does not know about `min' and
10814 `max', and `-' on `nat'. It is fast and is used automatically by the
10817 NB: At the moment, these decision procedures do not cope with mixed
10818 nat/int formulae where the two parts interact, such as `m < n ==>
10821 * HOL/Numeral provides a generic theory of numerals (encoded
10822 efficiently as bit strings); setup for types nat/int/real is in place;
10823 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10824 int, existing theories and proof scripts may require a few additional
10827 * integer division and remainder can now be performed on constant
10830 * many properties of integer multiplication, division and remainder
10833 * An interface to the Stanford Validity Checker (SVC) is available through the
10834 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10835 are proved automatically. SVC must be installed separately, and its results
10836 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10837 invocation of the underlying oracle). For SVC see
10838 http://verify.stanford.edu/SVC
10840 * IsaMakefile: the HOL-Real target now builds an actual image;
10845 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10846 (in Isabelle/Isar) -- by Gertrud Bauer;
10848 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10849 analysis for assembly languages with subtypes;
10851 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10852 -- avoids syntactic ambiguities and treats state, transition, and
10853 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10854 changed syntax and (many) tactics;
10856 * HOL/inductive: Now also handles more general introduction rules such
10857 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10858 theorems are now maintained within the theory (maintained via the
10861 * HOL/datatype: Now also handles arbitrarily branching datatypes
10862 (using function types) such as
10864 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10866 * HOL/record: record_simproc (part of the default simpset) takes care
10867 of selectors applied to updated records; record_split_tac is no longer
10868 part of the default claset; update_defs may now be removed from the
10869 simpset in many cases; COMPATIBILITY: old behavior achieved by
10871 claset_ref () := claset() addSWrapper record_split_wrapper;
10872 Delsimprocs [record_simproc]
10874 * HOL/typedef: fixed type inference for representing set; type
10875 arguments now have to occur explicitly on the rhs as type constraints;
10877 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10878 names rather than an ML expression;
10880 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10881 supplied later. Program schemes can be defined, such as
10882 "While B C s = (if B s then While B C (C s) else s)"
10883 where the well-founded relation can be chosen after B and C have been given.
10885 * HOL/List: the constructors of type list are now Nil and Cons;
10886 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10887 course, ML tools referring to List.list.op # etc. have to be adapted;
10889 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10890 disabled by default; run isabelle with option -m HOL to get back to
10891 the original Gordon/HOL-style output;
10893 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10894 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10896 * HOL basic syntax simplified (more orthogonal): all variants of
10897 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10898 Eps operator is provided as well: "SOME x. P[x]";
10900 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10902 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10903 thus available for user theories;
10905 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10906 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10909 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10910 several times and then mp;
10915 * the notation <<...>> is now available as a notation for sequences of
10918 * the simplifier is now installed
10920 * the axiom system has been generalized (thanks to Soren Heilmann)
10922 * the classical reasoner now has a default rule database
10927 * new primrec section allows primitive recursive functions to be given
10928 directly (as in HOL) over datatypes and the natural numbers;
10930 * new tactics induct_tac and exhaust_tac for induction (or case
10931 analysis) over datatypes and the natural numbers;
10933 * the datatype declaration of type T now defines the recursor T_rec;
10935 * simplification automatically does freeness reasoning for datatype
10938 * automatic type-inference, with AddTCs command to insert new
10939 type-checking rules;
10941 * datatype introduction rules are now added as Safe Introduction rules
10944 * the syntax "if P then x else y" is now available in addition to
10948 *** Internal programming interfaces ***
10950 * tuned simplifier trace output; new flag debug_simp;
10952 * structures Vartab / Termtab (instances of TableFun) offer efficient
10953 tables indexed by indexname_ord / term_ord (compatible with aconv);
10955 * AxClass.axclass_tac lost the theory argument;
10957 * tuned current_goals_markers semantics: begin / end goal avoids
10958 printing empty lines;
10960 * removed prs and prs_fn hook, which was broken because it did not
10961 include \n in its semantics, forcing writeln to add one
10962 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10963 string -> unit if you really want to output text without newline;
10965 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10966 plain output, interface builders may have to enable 'isabelle_font'
10967 mode to get Isabelle font glyphs as before;
10969 * refined token_translation interface; INCOMPATIBILITY: output length
10970 now of type real instead of int;
10972 * theory loader actions may be traced via new ThyInfo.add_hook
10973 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10974 your own database of information attached to *whole* theories -- as
10975 opposed to intra-theory data slots offered via TheoryDataFun;
10977 * proper handling of dangling sort hypotheses (at last!);
10978 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10979 extra sort hypotheses that can be witnessed from the type signature;
10980 the force_strip_shyps flag is gone, any remaining shyps are simply
10981 left in the theorem (with a warning issued by strip_shyps_warning);
10985 New in Isabelle98-1 (October 1998)
10986 ----------------------------------
10988 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10990 * several changes of automated proof tools;
10992 * HOL: major changes to the inductive and datatype packages, including
10993 some minor incompatibilities of theory syntax;
10995 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10998 * HOL: removed duplicate thms in Arith:
10999 less_imp_add_less should be replaced by trans_less_add1
11000 le_imp_add_le should be replaced by trans_le_add1
11002 * HOL: unary minus is now overloaded (new type constraints may be
11005 * HOL and ZF: unary minus for integers is now #- instead of #~. In
11006 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
11007 now taken as an integer constant.
11009 * Pure: ML function 'theory_of' renamed to 'theory';
11012 *** Proof tools ***
11015 1. Asm_full_simp_tac is now more aggressive.
11016 1. It will sometimes reorient premises if that increases their power to
11018 2. It does no longer proceed strictly from left to right but may also
11019 rotate premises to achieve further simplification.
11020 For compatibility reasons there is now Asm_lr_simp_tac which is like the
11021 old Asm_full_simp_tac in that it does not rotate premises.
11022 2. The simplifier now knows a little bit about nat-arithmetic.
11024 * Classical reasoner: wrapper mechanism for the classical reasoner now
11025 allows for selected deletion of wrappers, by introduction of names for
11026 wrapper functionals. This implies that addbefore, addSbefore,
11027 addaltern, and addSaltern now take a pair (name, tactic) as argument,
11028 and that adding two tactics with the same name overwrites the first
11029 one (emitting a warning).
11030 type wrapper = (int -> tactic) -> (int -> tactic)
11031 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
11032 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
11033 delWrapper, delSWrapper: claset * string -> claset
11034 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
11036 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
11037 semantics; addbefore now affects only the unsafe part of step_tac
11038 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
11039 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
11042 * Classical reasoner: setwrapper to setWrapper and compwrapper to
11043 compWrapper; added safe wrapper (and access functions for it);
11045 * HOL/split_all_tac is now much faster and fails if there is nothing
11046 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
11047 and the names of the automatically generated variables have changed.
11048 split_all_tac has moved within claset() from unsafe wrappers to safe
11049 wrappers, which means that !!-bound variables are split much more
11050 aggressively, and safe_tac and clarify_tac now split such variables.
11051 If this splitting is not appropriate, use delSWrapper "split_all_tac".
11052 Note: the same holds for record_split_tac, which does the job of
11053 split_all_tac for record fields.
11055 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
11056 permanently to the default simpset using Addsplits just like
11057 Addsimps. They can be removed via Delsplits just like
11058 Delsimps. Lower-case versions are also available.
11060 * HOL/Simplifier: The rule split_if is now part of the default
11061 simpset. This means that the simplifier will eliminate all occurrences
11062 of if-then-else in the conclusion of a goal. To prevent this, you can
11063 either remove split_if completely from the default simpset by
11064 `Delsplits [split_if]' or remove it in a specific call of the
11065 simplifier using `... delsplits [split_if]'. You can also add/delete
11066 other case splitting rules to/from the default simpset: every datatype
11067 generates suitable rules `split_t_case' and `split_t_case_asm' (where
11068 t is the name of the datatype).
11070 * Classical reasoner / Simplifier combination: new force_tac (and
11071 derivatives Force_tac, force) combines rewriting and classical
11072 reasoning (and whatever other tools) similarly to auto_tac, but is
11073 aimed to solve the given subgoal completely.
11078 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11079 and `goalw': the theory is no longer needed as an explicit argument -
11080 the current theory context is used; assumptions are no longer returned
11081 at the ML-level unless one of them starts with ==> or !!; it is
11082 recommended to convert to these new commands using isatool fixgoal
11083 (backup your sources first!);
11085 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11086 the current theory context, and 'theory' to lookup stored theories;
11088 * new theory section 'locale' for declaring constants, assumptions and
11089 definitions that have local scope;
11091 * new theory section 'nonterminals' for purely syntactic types;
11093 * new theory section 'setup' for generic ML setup functions
11094 (e.g. package initialization);
11096 * the distribution now includes Isabelle icons: see
11097 lib/logo/isabelle-{small,tiny}.xpm;
11099 * isatool install - install binaries with absolute references to
11102 * isatool logo -- create instances of the Isabelle logo (as EPS);
11104 * print mode 'emacs' reserved for Isamode;
11106 * support multiple print (ast) translations per constant name;
11108 * theorems involving oracles are now printed with a suffixed [!];
11113 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11115 * HOL/inductive package reorganized and improved: now supports mutual
11116 definitions such as
11121 oddI "n : EVEN ==> Suc n : ODD"
11122 evenI "n : ODD ==> Suc n : EVEN"
11124 new theorem list "elims" contains an elimination rule for each of the
11125 recursive sets; inductive definitions now handle disjunctive premises
11126 correctly (also ZF);
11128 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11129 "mutual_induct" no longer exists - the induction rule is always
11130 contained in "induct";
11133 * HOL/datatype package re-implemented and greatly improved: now
11134 supports mutually recursive datatypes such as
11137 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11138 | SUM ('a aexp) ('a aexp)
11139 | DIFF ('a aexp) ('a aexp)
11142 'a bexp = LESS ('a aexp) ('a aexp)
11143 | AND ('a bexp) ('a bexp)
11144 | OR ('a bexp) ('a bexp)
11146 as well as indirectly recursive datatypes such as
11149 ('a, 'b) term = Var 'a
11150 | App 'b ((('a, 'b) term) list)
11152 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11153 induction on mutually / indirectly recursive datatypes.
11155 Primrec equations are now stored in theory and can be accessed via
11156 <function_name>.simps.
11160 - Theories using datatypes must now have theory Datatype as an
11162 - The specific <typename>.induct_tac no longer exists - use the
11163 generic induct_tac instead.
11164 - natE has been renamed to nat.exhaust - use exhaust_tac
11165 instead of res_inst_tac ... natE. Note that the variable
11166 names in nat.exhaust differ from the names in natE, this
11167 may cause some "fragile" proofs to fail.
11168 - The theorems split_<typename>_case and split_<typename>_case_asm
11169 have been renamed to <typename>.split and <typename>.split_asm.
11170 - Since default sorts of type variables are now handled correctly,
11171 some datatype definitions may have to be annotated with explicit
11173 - Primrec definitions no longer require function name and type
11174 of recursive argument.
11176 Consider using isatool fixdatatype to adapt your theories and proof
11177 scripts to the new package (backup your sources first!).
11180 * HOL/record package: considerably improved implementation; now
11181 includes concrete syntax for record types, terms, updates; theorems
11182 for surjective pairing and splitting !!-bound record variables; proof
11183 support is as follows:
11185 1) standard conversions (selectors or updates applied to record
11186 constructor terms) are part of the standard simpset;
11188 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11189 made part of standard simpset and claset via addIffs;
11191 3) a tactic for record field splitting (record_split_tac) is part of
11192 the standard claset (addSWrapper);
11194 To get a better idea about these rules you may retrieve them via
11195 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11196 the name of your record type.
11198 The split tactic 3) conceptually simplifies by the following rule:
11200 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11202 Thus any record variable that is bound by meta-all will automatically
11203 blow up into some record constructor term, consequently the
11204 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11205 solve record problems automatically.
11208 * reorganized the main HOL image: HOL/Integ and String loaded by
11209 default; theory Main includes everything;
11211 * automatic simplification of integer sums and comparisons, using cancellation;
11213 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11215 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11217 * many new identities for unions, intersections, set difference, etc.;
11219 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11220 called split_if, split_split, split_sum_case and split_nat_case (to go
11221 with add/delsplits);
11223 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11224 (?x::unit) = (); this is made part of the default simpset, which COULD
11225 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11226 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11227 unit_abs_eta_conv is added in order to counter the effect of
11228 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11231 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11234 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11235 It and 'sym RS equals0D' are now in the default claset, giving automatic
11236 disjointness reasoning but breaking a few old proofs.
11238 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11239 to 'converse' from 'inverse' (for compatibility with ZF and some
11242 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11243 the well-founded relation;
11245 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11246 Compl A. The "Compl" syntax remains available as input syntax for this
11249 * HOL/Update: new theory of function updates:
11250 f(a:=b) == %x. if x=a then b else f x
11251 may also be iterated as in f(a:=b,c:=d,...);
11253 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11256 - new function list_update written xs[i:=v] that updates the i-th
11257 list position. May also be iterated as in xs[i:=a,j:=b,...].
11258 - new function `upt' written [i..j(] which generates the list
11259 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11260 bound write [i..j], which is a shorthand for [i..j+1(].
11261 - new lexicographic orderings and corresponding wellfoundedness theorems.
11264 - removed 'pred' (predecessor) function;
11265 - generalized some theorems about n-1;
11266 - many new laws about "div" and "mod";
11267 - new laws about greatest common divisors (see theory ex/Primes);
11269 * HOL/Relation: renamed the relational operator r^-1 "converse"
11270 instead of "inverse";
11272 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11273 of the multiset ordering;
11275 * directory HOL/Real: a construction of the reals using Dedekind cuts
11276 (not included by default);
11278 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11280 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11281 programs, i.e. different program variables may have different types.
11283 * calling (stac rew i) now fails if "rew" has no effect on the goal
11284 [previously, this check worked only if the rewrite rule was unconditional]
11285 Now rew can involve either definitions or equalities (either == or =).
11290 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11291 only the theorems proved on ZF.ML;
11293 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11294 It and 'sym RS equals0D' are now in the default claset, giving automatic
11295 disjointness reasoning but breaking a few old proofs.
11297 * ZF/Update: new theory of function updates
11298 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11299 may also be iterated as in f(a:=b,c:=d,...);
11301 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11303 * calling (stac rew i) now fails if "rew" has no effect on the goal
11304 [previously, this check worked only if the rewrite rule was unconditional]
11305 Now rew can involve either definitions or equalities (either == or =).
11307 * case_tac provided for compatibility with HOL
11308 (like the old excluded_middle_tac, but with subgoals swapped)
11311 *** Internal programming interfaces ***
11313 * Pure: several new basic modules made available for general use, see
11314 also src/Pure/README;
11316 * improved the theory data mechanism to support encapsulation (data
11317 kind name replaced by private Object.kind, acting as authorization
11318 key); new type-safe user interface via functor TheoryDataFun; generic
11319 print_data function becomes basically useless;
11321 * removed global_names compatibility flag -- all theory declarations
11322 are qualified by default;
11324 * module Pure/Syntax now offers quote / antiquote translation
11325 functions (useful for Hoare logic etc. with implicit dependencies);
11326 see HOL/ex/Antiquote for an example use;
11328 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11331 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11334 * Display.print_goals function moved to Locale.print_goals;
11336 * standard print function for goals supports current_goals_markers
11337 variable for marking begin of proof, end of proof, start of goal; the
11338 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11339 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11344 New in Isabelle98 (January 1998)
11345 --------------------------------
11347 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11349 * changed lexical syntax of terms / types: dots made part of long
11350 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11352 * simpset (and claset) reference variable replaced by functions
11353 simpset / simpset_ref;
11355 * no longer supports theory aliases (via merge) and non-trivial
11356 implicit merge of thms' signatures;
11358 * most internal names of constants changed due to qualified names;
11360 * changed Pure/Sequence interface (see Pure/seq.ML);
11363 *** General Changes ***
11365 * hierachically structured name spaces (for consts, types, axms, thms
11366 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11367 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11368 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11369 long_names for fully qualified output names; NOTE: ML programs
11370 (special tactics, packages etc.) referring to internal names may have
11371 to be adapted to cope with fully qualified names; in case of severe
11372 backward campatibility problems try setting 'global_names' at compile
11373 time to have enrything declared within a flat name space; one may also
11374 fine tune name declarations in theories via the 'global' and 'local'
11377 * reimplemented the implicit simpset and claset using the new anytype
11378 data filed in signatures; references simpset:simpset ref etc. are
11379 replaced by functions simpset:unit->simpset and
11380 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11381 to patch your ML files accordingly;
11383 * HTML output now includes theory graph data for display with Java
11384 applet or isatool browser; data generated automatically via isatool
11385 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11387 * defs may now be conditional; improved rewrite_goals_tac to handle
11388 conditional equations;
11390 * defs now admits additional type arguments, using TYPE('a) syntax;
11392 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11393 creates a new theory node; implicit merge of thms' signatures is
11394 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11395 transfer:theory->thm->thm in (rare) cases;
11397 * improved handling of draft signatures / theories; draft thms (and
11398 ctyps, cterms) are automatically promoted to real ones;
11400 * slightly changed interfaces for oracles: admit many per theory, named
11401 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11403 * print_goals: optional output of const types (set show_consts and
11406 * improved output of warnings (###) and errors (***);
11408 * subgoal_tac displays a warning if the new subgoal has type variables;
11410 * removed old README and Makefiles;
11412 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11414 * removed obsolete init_pps and init_database;
11416 * deleted the obsolete tactical STATE, which was declared by
11417 fun STATE tacfun st = tacfun st st;
11419 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11420 (which abbreviates $HOME);
11422 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11423 use isatool fixseq to adapt your ML programs (this works for fully
11424 qualified references to the Sequence structure only!);
11426 * use_thy no longer requires writable current directory; it always
11427 reloads .ML *and* .thy file, if either one is out of date;
11430 *** Classical Reasoner ***
11432 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11433 tactics that use classical reasoning to simplify a subgoal without
11434 splitting it into several subgoals;
11436 * Safe_tac: like safe_tac but uses the default claset;
11441 * added simplification meta rules:
11442 (asm_)(full_)simplify: simpset -> thm -> thm;
11444 * simplifier.ML no longer part of Pure -- has to be loaded by object
11447 * added prems argument to simplification procedures;
11449 * HOL, FOL, ZF: added infix function `addsplits':
11450 instead of `<simpset> setloop (split_tac <thms>)'
11451 you can simply write `<simpset> addsplits <thms>'
11456 * TYPE('a) syntax for type reflection terms;
11458 * no longer handles consts with name "" -- declare as 'syntax' instead;
11460 * pretty printer: changed order of mixfix annotation preference (again!);
11462 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11467 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11468 with `addloop' of the simplifier to faciliate case splitting in premises.
11470 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11472 * HOL/Auth: new protocol proofs including some for the Internet
11475 * HOL/Map: new theory of `maps' a la VDM;
11477 * HOL/simplifier: simplification procedures nat_cancel_sums for
11478 cancelling out common nat summands from =, <, <= (in)equalities, or
11479 differences; simplification procedures nat_cancel_factor for
11480 cancelling common factor from =, <, <= (in)equalities over natural
11481 sums; nat_cancel contains both kinds of procedures, it is installed by
11482 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11484 * HOL/simplifier: terms of the form
11485 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11487 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11488 and those of the form
11489 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11491 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11494 Each datatype `t' now comes with a theorem `split_t_case' of the form
11496 P(t_case f1 ... fn x) =
11497 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11499 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11502 and a theorem `split_t_case_asm' of the form
11504 P(t_case f1 ... fn x) =
11505 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11507 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11509 which can be added to a simpset via `addsplits'. The existing theorems
11510 expand_list_case and expand_option_case have been renamed to
11511 split_list_case and split_option_case.
11514 - `pred n' is automatically converted to `n-1'.
11515 Users are strongly encouraged not to use `pred' any longer,
11516 because it will disappear altogether at some point.
11517 - Users are strongly encouraged to write "0 < n" rather than
11518 "n ~= 0". Theorems and proof tools have been modified towards this
11522 the function "set_of_list" has been renamed "set" (and its theorems too);
11523 the function "nth" now takes its arguments in the reverse order and
11524 has acquired the infix notation "!" as in "xs!n".
11526 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11528 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11529 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11531 * HOL/record: extensible records with schematic structural subtyping
11532 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11533 still lacks various theorems and concrete record syntax;
11538 * removed "axioms" and "generated by" sections;
11540 * replaced "ops" section by extended "consts" section, which is capable of
11541 handling the continuous function space "->" directly;
11544 . proves theorems immediately and stores them in the theory,
11545 . creates hierachical name space,
11546 . now uses normal mixfix annotations (instead of cinfix...),
11547 . minor changes to some names and values (for consistency),
11548 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11549 . separator between mutual domain defs: changed "," to "and",
11550 . improved handling of sort constraints; now they have to
11551 appear on the left-hand side of the equations only;
11553 * fixed LAM <x,y,zs>.b syntax;
11555 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11556 adm (%x. P (t x)), where P is chainfinite and t continuous;
11561 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11562 with `addloop' of the simplifier to faciliate case splitting in premises.
11564 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11565 in HOL, they strip ALL and --> from proved theorems;
11569 New in Isabelle94-8 (May 1997)
11570 ------------------------------
11572 *** General Changes ***
11574 * new utilities to build / run / maintain Isabelle etc. (in parts
11575 still somewhat experimental); old Makefiles etc. still functional;
11577 * new 'Isabelle System Manual';
11579 * INSTALL text, together with ./configure and ./build scripts;
11581 * reimplemented type inference for greater efficiency, better error
11582 messages and clean internal interface;
11584 * prlim command for dealing with lots of subgoals (an easier way of
11585 setting goals_limit);
11590 * supports alternative (named) syntax tables (parser and pretty
11591 printer); internal interface is provided by add_modesyntax(_i);
11593 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11594 be used in conjunction with the Isabelle symbol font; uses the
11595 "symbols" syntax table;
11597 * added token_translation interface (may translate name tokens in
11598 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11599 the current print_mode); IMPORTANT: user print translation functions
11600 are responsible for marking newly introduced bounds
11601 (Syntax.mark_boundT);
11603 * token translations for modes "xterm" and "xterm_color" that display
11604 names in bold, underline etc. or colors (which requires a color
11607 * infixes may now be declared with names independent of their syntax;
11609 * added typed_print_translation (like print_translation, but may
11610 access type of constant);
11613 *** Classical Reasoner ***
11615 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11616 some limitations. Blast_tac...
11617 + ignores addss, addbefore, addafter; this restriction is intrinsic
11618 + ignores elimination rules that don't have the correct format
11619 (the conclusion MUST be a formula variable)
11620 + ignores types, which can make HOL proofs fail
11621 + rules must not require higher-order unification, e.g. apply_type in ZF
11622 [message "Function Var's argument not a bound variable" relates to this]
11623 + its proof strategy is more general but can actually be slower
11625 * substitution with equality assumptions no longer permutes other
11628 * minor changes in semantics of addafter (now called addaltern); renamed
11629 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11630 (and access functions for it);
11632 * improved combination of classical reasoner and simplifier:
11633 + functions for handling clasimpsets
11634 + improvement of addss: now the simplifier is called _after_ the
11636 + safe variant of addss called addSss: uses safe simplifications
11637 _during_ the safe steps. It is more complete as it allows multiple
11638 instantiations of unknowns (e.g. with slow_tac).
11642 * added interface for simplification procedures (functions that
11643 produce *proven* rewrite rules on the fly, depending on current
11646 * ordering on terms as parameter (used for ordered rewriting);
11648 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11650 * the solver is now split into a safe and an unsafe part.
11651 This should be invisible for the normal user, except that the
11652 functions setsolver and addsolver have been renamed to setSolver and
11653 addSolver; added safe_asm_full_simp_tac;
11658 * a generic induction tactic `induct_tac' which works for all datatypes and
11659 also for type `nat';
11661 * a generic case distinction tactic `exhaust_tac' which works for all
11662 datatypes and also for type `nat';
11664 * each datatype comes with a function `size';
11666 * patterns in case expressions allow tuple patterns as arguments to
11667 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11669 * primrec now also works with type nat;
11671 * recdef: a new declaration form, allows general recursive functions to be
11672 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11674 * the constant for negation has been renamed from "not" to "Not" to
11675 harmonize with FOL, ZF, LK, etc.;
11677 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11680 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11682 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11683 problems in commutative rings, using axiomatic type classes for + and *;
11685 * more examples in HOL/MiniML and HOL/Auth;
11687 * more default rewrite rules for quantifiers, union/intersection;
11689 * a new constant `arbitrary == @x.False';
11691 * HOLCF/IOA replaces old HOL/IOA;
11693 * HOLCF changes: derived all rules and arities
11694 + axiomatic type classes instead of classes
11695 + typedef instead of faking type definitions
11696 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11697 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11698 + eliminated the types void, one, tr
11699 + use unit lift and bool lift (with translations) instead of one and tr
11700 + eliminated blift from Lift3.thy (use Def instead of blift)
11701 all eliminated rules are derived as theorems --> no visible changes ;
11706 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11707 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11708 as ZF_cs addSIs [equalityI];
11712 New in Isabelle94-7 (November 96)
11713 ---------------------------------
11715 * allowing negative levels (as offsets) in prlev and choplev;
11717 * super-linear speedup for large simplifications;
11719 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11720 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11721 FAIL); can suppress it using the command Delsimps (ex_simps @
11722 all_simps); De Morgan laws are also now included, by default;
11724 * improved printing of ==> : ~:
11726 * new object-logic "Sequents" adds linear logic, while replacing LK
11727 and Modal (thanks to Sara Kalvala);
11729 * HOL/Auth: correctness proofs for authentication protocols;
11731 * HOL: new auto_tac combines rewriting and classical reasoning (many
11732 examples on HOL/Auth);
11734 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11735 the rewriter and classical reasoner simultaneously;
11737 * function uresult no longer returns theorems in "standard" format;
11738 regain previous version by: val uresult = standard o uresult;
11742 New in Isabelle94-6
11743 -------------------
11745 * oracles -- these establish an interface between Isabelle and trusted
11746 external reasoners, which may deliver results as theorems;
11748 * proof objects (in particular record all uses of oracles);
11750 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11752 * "constdefs" section in theory files;
11754 * "primrec" section (HOL) no longer requires names;
11756 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11760 New in Isabelle94-5
11761 -------------------
11763 * reduced space requirements;
11765 * automatic HTML generation from theories;
11767 * theory files no longer require "..." (quotes) around most types;
11769 * new examples, including two proofs of the Church-Rosser theorem;
11771 * non-curried (1994) version of HOL is no longer distributed;
11775 New in Isabelle94-4
11776 -------------------
11778 * greatly reduced space requirements;
11780 * theory files (.thy) no longer require \...\ escapes at line breaks;
11782 * searchable theorem database (see the section "Retrieving theorems" on
11783 page 8 of the Reference Manual);
11785 * new examples, including Grabczewski's monumental case study of the
11788 * The previous version of HOL renamed to Old_HOL;
11790 * The new version of HOL (previously called CHOL) uses a curried syntax
11791 for functions. Application looks like f a b instead of f(a,b);
11793 * Mutually recursive inductive definitions finally work in HOL;
11795 * In ZF, pattern-matching on tuples is now available in all abstractions and
11796 translates to the operator "split";
11800 New in Isabelle94-3
11801 -------------------
11803 * new infix operator, addss, allowing the classical reasoner to
11804 perform simplification at each step of its search. Example:
11805 fast_tac (cs addss ss)
11807 * a new logic, CHOL, the same as HOL, but with a curried syntax
11808 for functions. Application looks like f a b instead of f(a,b). Also pairs
11809 look like (a,b) instead of <a,b>;
11811 * PLEASE NOTE: CHOL will eventually replace HOL!
11813 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11814 It translates to the operator "split". A new theory of integers is available;
11816 * In ZF, integer numerals now denote two's-complement binary integers.
11817 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11819 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11820 of the Axiom of Choice;
11824 New in Isabelle94-2
11825 -------------------
11827 * Significantly faster resolution;
11829 * the different sections in a .thy file can now be mixed and repeated
11832 * Database of theorems for FOL, HOL and ZF. New
11833 commands including qed, qed_goal and bind_thm store theorems in the database.
11835 * Simple database queries: return a named theorem (get_thm) or all theorems of
11836 a given theory (thms_of), or find out what theory a theorem was proved in
11839 * Bugs fixed in the inductive definition and datatype packages;
11841 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11842 and HOL_dup_cs obsolete;
11844 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11847 * Simpler definition of function space in ZF;
11849 * new results about cardinal and ordinal arithmetic in ZF;
11851 * 'subtype' facility in HOL for introducing new types as subsets of existing
11854 :mode=isabelle-news:wrap=hard:maxLineLen=72: