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: RBT.thy: various constants and facts are hidden;
810 lifting setup is unregistered
813 * HOL-Cardinals: new theory src/HOL/Cardinals/Ordinal_Arithmetic.thy.
815 * HOL-Word: bit representations prefer type bool over type bit.
819 - Abandoned fact collection "word_arith_alts", which is a duplicate
821 - Dropped first (duplicated) element in fact collections
822 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
823 "uint_word_arith_bintrs".
826 - consolidated the proofs of the binomial theorem
827 - the function fib is again of type nat => nat and not overloaded
828 - no more references to Old_Number_Theory in the HOL libraries
833 * HOL-Multivariate_Analysis:
834 - Type class ordered_real_vector for ordered vector spaces.
835 - New theory Complex_Basic_Analysis defining complex derivatives,
836 holomorphic functions, etc., ported from HOL Light's canal.ml.
837 - Changed order of ordered_euclidean_space to be compatible with
838 pointwise ordering on products. Therefore instance of
839 conditionally_complete_lattice and ordered_real_vector.
840 INCOMPATIBILITY: use box instead of greaterThanLessThan or
841 explicit set-comprehensions with eucl_less for other (half-)open
843 - removed dependencies on type class ordered_euclidean_space with
844 introduction of "cbox" on euclidean_space
847 mem_interval ~> mem_box
848 interval_eq_empty ~> box_eq_empty
849 interval_ne_empty ~> box_ne_empty
850 interval_sing(1) ~> cbox_sing
851 interval_sing(2) ~> box_sing
852 subset_interval_imp ~> subset_box_imp
853 subset_interval ~> subset_box
854 open_interval ~> open_box
855 closed_interval ~> closed_cbox
856 interior_closed_interval ~> interior_cbox
857 bounded_closed_interval ~> bounded_cbox
858 compact_interval ~> compact_cbox
859 bounded_subset_closed_interval_symmetric ~> bounded_subset_cbox_symmetric
860 bounded_subset_closed_interval ~> bounded_subset_cbox
861 mem_interval_componentwiseI ~> mem_box_componentwiseI
862 convex_box ~> convex_prod
863 rel_interior_real_interval ~> rel_interior_real_box
864 convex_interval ~> convex_box
865 convex_hull_eq_real_interval ~> convex_hull_eq_real_cbox
866 frechet_derivative_within_closed_interval ~> frechet_derivative_within_cbox
867 content_closed_interval' ~> content_cbox'
868 elementary_subset_interval ~> elementary_subset_box
869 diameter_closed_interval ~> diameter_cbox
870 frontier_closed_interval ~> frontier_cbox
871 frontier_open_interval ~> frontier_box
872 bounded_subset_open_interval_symmetric ~> bounded_subset_box_symmetric
873 closure_open_interval ~> closure_box
874 open_closed_interval_convex ~> open_cbox_convex
875 open_interval_midpoint ~> box_midpoint
876 content_image_affinity_interval ~> content_image_affinity_cbox
877 is_interval_interval ~> is_interval_cbox + is_interval_box + is_interval_closed_interval
878 bounded_interval ~> bounded_closed_interval + bounded_boxes
880 - respective theorems for intervals over the reals:
881 content_closed_interval + content_cbox
882 has_integral + has_integral_real
883 fine_division_exists + fine_division_exists_real
884 has_integral_null + has_integral_null_real
885 tagged_division_union_interval + tagged_division_union_interval_real
886 has_integral_const + has_integral_const_real
887 integral_const + integral_const_real
888 has_integral_bound + has_integral_bound_real
889 integrable_continuous + integrable_continuous_real
890 integrable_subinterval + integrable_subinterval_real
891 has_integral_reflect_lemma + has_integral_reflect_lemma_real
892 integrable_reflect + integrable_reflect_real
893 integral_reflect + integral_reflect_real
894 image_affinity_interval + image_affinity_cbox
895 image_smult_interval + image_smult_cbox
896 integrable_const + integrable_const_ivl
897 integrable_on_subinterval + integrable_on_subcbox
900 derivative_linear ~> has_derivative_bounded_linear
901 derivative_is_linear ~> has_derivative_linear
902 bounded_linear_imp_linear ~> bounded_linear.linear
905 - Renamed positive_integral to nn_integral:
907 . Renamed all lemmas "*positive_integral*" to *nn_integral*"
908 positive_integral_positive ~> nn_integral_nonneg
910 . Renamed abbreviation integral\<^sup>P to integral\<^sup>N.
912 - replaced the Lebesgue integral on real numbers by the more general
913 Bochner integral for functions into a real-normed vector space.
915 integral_zero ~> integral_zero / integrable_zero
916 integral_minus ~> integral_minus / integrable_minus
917 integral_add ~> integral_add / integrable_add
918 integral_diff ~> integral_diff / integrable_diff
919 integral_setsum ~> integral_setsum / integrable_setsum
920 integral_multc ~> integral_mult_left / integrable_mult_left
921 integral_cmult ~> integral_mult_right / integrable_mult_right
922 integral_triangle_inequality~> integral_norm_bound
923 integrable_nonneg ~> integrableI_nonneg
924 integral_positive ~> integral_nonneg_AE
925 integrable_abs_iff ~> integrable_abs_cancel
926 positive_integral_lim_INF ~> nn_integral_liminf
927 lebesgue_real_affine ~> lborel_real_affine
928 borel_integral_has_integral ~> has_integral_lebesgue_integral
929 integral_indicator ~>
930 integral_real_indicator / integrable_real_indicator
931 positive_integral_fst ~> nn_integral_fst'
932 positive_integral_fst_measurable ~> nn_integral_fst
933 positive_integral_snd_measurable ~> nn_integral_snd
935 integrable_fst_measurable ~>
936 integral_fst / integrable_fst / AE_integrable_fst
938 integrable_snd_measurable ~>
939 integral_snd / integrable_snd / AE_integrable_snd
941 integral_monotone_convergence ~>
942 integral_monotone_convergence / integrable_monotone_convergence
944 integral_monotone_convergence_at_top ~>
945 integral_monotone_convergence_at_top /
946 integrable_monotone_convergence_at_top
948 has_integral_iff_positive_integral_lebesgue ~>
949 has_integral_iff_has_bochner_integral_lebesgue_nonneg
951 lebesgue_integral_has_integral ~>
952 has_integral_integrable_lebesgue_nonneg
954 positive_integral_lebesgue_has_integral ~>
955 integral_has_integral_lebesgue_nonneg /
956 integrable_has_integral_lebesgue_nonneg
958 lebesgue_integral_real_affine ~>
959 nn_integral_real_affine
961 has_integral_iff_positive_integral_lborel ~>
962 integral_has_integral_nonneg / integrable_has_integral_nonneg
964 The following theorems where removed:
966 lebesgue_integral_nonneg
967 lebesgue_integral_uminus
968 lebesgue_integral_cmult
969 lebesgue_integral_multc
970 lebesgue_integral_cmult_nonneg
971 integral_cmul_indicator
974 - Formalized properties about exponentially, Erlang, and normal
975 distributed random variables.
977 * HOL-Decision_Procs: Separate command 'approximate' for approximative
978 computation in src/HOL/Decision_Procs/Approximation. Minor
984 * The signature and semantics of Document.Snapshot.cumulate_markup /
985 select_markup have been clarified. Markup is now traversed in the
986 order of reports given by the prover: later markup is usually more
987 specific and may override results accumulated so far. The elements
988 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
990 * Substantial reworking of internal PIDE protocol communication
991 channels. INCOMPATIBILITY.
996 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
997 compared (according to Thm.thm_ord), but assumed to be covered by the
998 current background theory. Thus equivalent data produced in different
999 branches of the theory graph usually coincides (e.g. relevant for
1000 theory merge). Note that the softer Thm.eq_thm_prop is often more
1001 appropriate than Thm.eq_thm.
1003 * Proper context for basic Simplifier operations: rewrite_rule,
1004 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
1005 pass runtime Proof.context (and ensure that the simplified entity
1006 actually belongs to it).
1008 * Proper context discipline for read_instantiate and instantiate_tac:
1009 variables that are meant to become schematic need to be given as
1010 fixed, and are generalized by the explicit context of local variables.
1011 This corresponds to Isar attributes "where" and "of" with 'for'
1012 declaration. INCOMPATIBILITY, also due to potential change of indices
1013 of schematic variables.
1015 * Moved ML_Compiler.exn_trace and other operations on exceptions to
1016 structure Runtime. Minor INCOMPATIBILITY.
1018 * Discontinued old Toplevel.debug in favour of system option
1019 "ML_exception_trace", which may be also declared within the context
1020 via "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
1022 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
1025 * Configuration option "ML_print_depth" controls the pretty-printing
1026 depth of the ML compiler within the context. The old print_depth in
1027 ML is still available as default_print_depth, but rarely used. Minor
1030 * Toplevel function "use" refers to raw ML bootstrap environment,
1031 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
1032 Note that 'ML_file' is the canonical command to load ML files into the
1035 * Simplified programming interface to define ML antiquotations, see
1036 structure ML_Antiquotation. Minor INCOMPATIBILITY.
1038 * ML antiquotation @{here} refers to its source position, which is
1039 occasionally useful for experimentation and diagnostic purposes.
1041 * ML antiquotation @{path} produces a Path.T value, similarly to
1042 Path.explode, but with compile-time check against the file-system and
1043 some PIDE markup. Note that unlike theory source, ML does not have a
1044 well-defined master directory, so an absolute symbolic path
1045 specification is usually required, e.g. "~~/src/HOL".
1047 * ML antiquotation @{print} inlines a function to print an arbitrary
1048 ML value, which is occasionally useful for diagnostic or demonstration
1054 * Proof General with its traditional helper scripts is now an optional
1055 Isabelle component, e.g. see ProofGeneral-4.2-2 from the Isabelle
1056 component repository http://isabelle.in.tum.de/components/. Note that
1057 the "system" manual provides general explanations about add-on
1058 components, especially those that are not bundled with the release.
1060 * The raw Isabelle process executable has been renamed from
1061 "isabelle-process" to "isabelle_process", which conforms to common
1062 shell naming conventions, and allows to define a shell function within
1063 the Isabelle environment to avoid dynamic path lookup. Rare
1064 incompatibility for old tools that do not use the ISABELLE_PROCESS
1067 * Former "isabelle tty" has been superseded by "isabelle console",
1068 with implicit build like "isabelle jedit", and without the mostly
1069 obsolete Isar TTY loop.
1071 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
1072 and PDF_VIEWER now refer to the actual programs, not shell
1073 command-lines. Discontinued option -c: invocation may be asynchronous
1074 via desktop environment, without any special precautions. Potential
1075 INCOMPATIBILITY with ambitious private settings.
1077 * Removed obsolete "isabelle unsymbolize". Note that the usual format
1078 for email communication is the Unicode rendering of Isabelle symbols,
1079 as produced by Isabelle/jEdit, for example.
1081 * Removed obsolete tool "wwwfind". Similar functionality may be
1082 integrated into Isabelle/jEdit eventually.
1084 * Improved 'display_drafts' concerning desktop integration and
1085 repeated invocation in PIDE front-end: re-use single file
1086 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
1088 * Session ROOT specifications require explicit 'document_files' for
1089 robust dependencies on LaTeX sources. Only these explicitly given
1090 files are copied to the document output directory, before document
1091 processing is started.
1093 * Windows: support for regular TeX installation (e.g. MiKTeX) instead
1094 of TeX Live from Cygwin.
1098 New in Isabelle2013-2 (December 2013)
1099 -------------------------------------
1101 *** Prover IDE -- Isabelle/Scala/jEdit ***
1103 * More robust editing of running commands with internal forks,
1104 e.g. non-terminating 'by' steps.
1106 * More relaxed Sledgehammer panel: avoid repeated application of query
1107 after edits surrounding the command location.
1109 * More status information about commands that are interrupted
1110 accidentally (via physical event or Poly/ML runtime system signal,
1111 e.g. out-of-memory).
1116 * More robust termination of external processes managed by
1117 Isabelle/ML: support cancellation of tasks within the range of
1118 milliseconds, as required for PIDE document editing with automatically
1119 tried tools (e.g. Sledgehammer).
1121 * Reactivated Isabelle/Scala kill command for external processes on
1122 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
1123 workaround for some Debian/Ubuntu Linux versions from 2013.
1127 New in Isabelle2013-1 (November 2013)
1128 -------------------------------------
1132 * Discontinued obsolete 'uses' within theory header. Note that
1133 commands like 'ML_file' work without separate declaration of file
1134 dependencies. Minor INCOMPATIBILITY.
1136 * Discontinued redundant 'use' command, which was superseded by
1137 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
1139 * Simplified subscripts within identifiers, using plain \<^sub>
1140 instead of the second copy \<^isub> and \<^isup>. Superscripts are
1141 only for literal tokens within notation; explicit mixfix annotations
1142 for consts or fixed variables may be used as fall-back for unusual
1143 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
1144 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
1145 standardize symbols as a starting point for further manual cleanup.
1146 The ML reference variable "legacy_isub_isup" may be set as temporary
1147 workaround, to make the prover accept a subset of the old identifier
1150 * Document antiquotations: term style "isub" has been renamed to
1151 "sub". Minor INCOMPATIBILITY.
1153 * Uniform management of "quick_and_dirty" as system option (see also
1154 "isabelle options"), configuration option within the context (see also
1155 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
1156 INCOMPATIBILITY, need to use more official Isabelle means to access
1157 quick_and_dirty, instead of historical poking into mutable reference.
1159 * Renamed command 'print_configs' to 'print_options'. Minor
1162 * Proper diagnostic command 'print_state'. Old 'pr' (with its
1163 implicit change of some global references) is retained for now as
1164 control command, e.g. for ProofGeneral 3.7.x.
1166 * Discontinued 'print_drafts' command with its old-fashioned PS output
1167 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
1168 'display_drafts' instead and print via the regular document viewer.
1170 * Updated and extended "isar-ref" and "implementation" manual,
1171 eliminated old "ref" manual.
1174 *** Prover IDE -- Isabelle/Scala/jEdit ***
1176 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
1177 Documentation panel.
1179 * Dockable window "Documentation" provides access to Isabelle
1182 * Dockable window "Find" provides query operations for formal entities
1183 (GUI front-end to 'find_theorems' command).
1185 * Dockable window "Sledgehammer" manages asynchronous / parallel
1186 sledgehammer runs over existing document sources, independently of
1187 normal editing and checking process.
1189 * Dockable window "Timing" provides an overview of relevant command
1190 timing information, depending on option jedit_timing_threshold. The
1191 same timing information is shown in the extended tooltip of the
1192 command keyword, when hovering the mouse over it while the CONTROL or
1193 COMMAND modifier is pressed.
1195 * Improved dockable window "Theories": Continuous checking of proof
1196 document (visible and required parts) may be controlled explicitly,
1197 using check box or shortcut "C+e ENTER". Individual theory nodes may
1198 be marked explicitly as required and checked in full, using check box
1199 or shortcut "C+e SPACE".
1201 * Improved completion mechanism, which is now managed by the
1202 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
1203 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
1205 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
1206 isabelle.complete for explicit completion in Isabelle sources.
1207 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
1208 to resolve conflict.
1210 * Improved support of various "minor modes" for Isabelle NEWS,
1211 options, session ROOT etc., with completion and SideKick tree view.
1213 * Strictly monotonic document update, without premature cancellation of
1214 running transactions that are still needed: avoid reset/restart of
1215 such command executions while editing.
1217 * Support for asynchronous print functions, as overlay to existing
1220 * Support for automatic tools in HOL, which try to prove or disprove
1221 toplevel theorem statements.
1223 * Action isabelle.reset-font-size resets main text area font size
1224 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
1225 also "Plugin Options / Isabelle / General"). It can be bound to some
1226 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
1228 * File specifications in jEdit (e.g. file browser) may refer to
1229 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
1230 obsolete $ISABELLE_HOME_WINDOWS variable.
1232 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
1233 / Global Options / Appearance".
1235 * Improved support of native Mac OS X functionality via "MacOSX"
1236 plugin, which is now enabled by default.
1241 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
1242 In particular, 'interpretation' allows for non-persistent
1243 interpretation within "context ... begin ... end" blocks offering a
1244 light-weight alternative to 'sublocale'. See "isar-ref" manual for
1247 * Improved locales diagnostic command 'print_dependencies'.
1249 * Discontinued obsolete 'axioms' command, which has been marked as
1250 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
1251 instead, while observing its uniform scope for polymorphism.
1253 * Discontinued empty name bindings in 'axiomatization'.
1256 * System option "proofs" has been discontinued. Instead the global
1257 state of Proofterm.proofs is persistently compiled into logic images
1258 as required, notably HOL-Proofs. Users no longer need to change
1259 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
1261 * Syntax translation functions (print_translation etc.) always depend
1262 on Proof.context. Discontinued former "(advanced)" option -- this is
1263 now the default. Minor INCOMPATIBILITY.
1265 * Former global reference trace_unify_fail is now available as
1266 configuration option "unify_trace_failure" (global context only).
1268 * SELECT_GOAL now retains the syntactic context of the overall goal
1269 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
1275 * Stronger precedence of syntax for big intersection and union on
1276 sets, in accordance with corresponding lattice operations.
1279 * Notation "{p:A. P}" now allows tuple patterns as well.
1281 * Nested case expressions are now translated in a separate check phase
1282 rather than during parsing. The data for case combinators is separated
1283 from the datatype package. The declaration attribute
1284 "case_translation" can be used to register new case combinators:
1286 declare [[case_translation case_combinator constructor1 ... constructorN]]
1289 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
1291 - 'code_identifier' declares name hints for arbitrary identifiers in
1292 generated code, subsuming 'code_modulename'.
1294 See the isar-ref manual for syntax diagrams, and the HOL theories for
1297 * Attibute 'code': 'code' now declares concrete and abstract code
1298 equations uniformly. Use explicit 'code equation' and 'code abstract'
1299 to distinguish both when desired.
1301 * Discontinued theories Code_Integer and Efficient_Nat by a more
1302 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
1303 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
1304 generation for details. INCOMPATIBILITY.
1306 * Numeric types are mapped by default to target language numerals:
1307 natural (replaces former code_numeral) and integer (replaces former
1308 code_int). Conversions are available as integer_of_natural /
1309 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
1310 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
1311 ML). INCOMPATIBILITY.
1313 * Function package: For mutually recursive functions f and g, separate
1314 cases rules f.cases and g.cases are generated instead of unusable
1315 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
1316 in the case that the unusable rule was used nevertheless.
1318 * Function package: For each function f, new rules f.elims are
1319 generated, which eliminate equalities of the form "f x = t".
1321 * New command 'fun_cases' derives ad-hoc elimination rules for
1322 function equations as simplified instances of f.elims, analogous to
1323 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
1326 - parametrized correspondence relations are now supported:
1327 + parametricity theorems for the raw term can be specified in
1328 the command lift_definition, which allow us to generate stronger
1330 + setup_lifting generates stronger transfer rules if parametric
1331 correspondence relation can be generated
1332 + various new properties of the relator must be specified to support
1334 + parametricity theorem for the Quotient relation can be specified
1335 - setup_lifting generates domain rules for the Transfer package
1336 - stronger reflexivity prover of respectfulness theorems for type
1338 - ===> and --> are now local. The symbols can be introduced
1339 by interpreting the locale lifting_syntax (typically in an
1341 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1342 Main. Potential INCOMPATIBILITY
1343 - new commands for restoring and deleting Lifting/Transfer context:
1344 lifting_forget, lifting_update
1345 - the command print_quotmaps was renamed to print_quot_maps.
1349 - better support for domains in Transfer: replace Domainp T
1350 by the actual invariant in a transferred goal
1351 - transfer rules can have as assumptions other transfer rules
1352 - Experimental support for transferring from the raw level to the
1353 abstract level: Transfer.transferred attribute
1354 - Attribute version of the transfer method: untransferred attribute
1356 * Reification and reflection:
1357 - Reification is now directly available in HOL-Main in structure
1359 - Reflection now handles multiple lists with variables also.
1360 - The whole reflection stack has been decomposed into conversions.
1363 * Revised devices for recursive definitions over finite sets:
1364 - Only one fundamental fold combinator on finite set remains:
1365 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1366 This is now identity on infinite sets.
1367 - Locales ("mini packages") for fundamental definitions with
1368 Finite_Set.fold: folding, folding_idem.
1369 - Locales comm_monoid_set, semilattice_order_set and
1370 semilattice_neutr_order_set for big operators on sets.
1371 See theory Big_Operators for canonical examples.
1372 Note that foundational constants comm_monoid_set.F and
1373 semilattice_set.F correspond to former combinators fold_image
1374 and fold1 respectively. These are now gone. You may use
1375 those foundational constants as substitutes, but it is
1376 preferable to interpret the above locales accordingly.
1377 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1378 no longer needed in connection with Finite_Set.fold etc.)
1380 card.union_inter ~> card_Un_Int [symmetric]
1381 card.union_disjoint ~> card_Un_disjoint
1384 * Locale hierarchy for abstract orderings and (semi)lattices.
1386 * Complete_Partial_Order.admissible is defined outside the type class
1387 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1388 class predicate assumption or sort constraint when possible.
1391 * Introduce type class "conditionally_complete_lattice": Like a
1392 complete lattice but does not assume the existence of the top and
1393 bottom elements. Allows to generalize some lemmas about reals and
1394 extended reals. Removed SupInf and replaced it by the instantiation
1395 of conditionally_complete_lattice for real. Renamed lemmas about
1396 conditionally-complete lattice from Sup_... to cSup_... and from
1397 Inf_... to cInf_... to avoid hidding of similar complete lattice
1400 * Introduce type class linear_continuum as combination of
1401 conditionally-complete lattices and inner dense linorders which have
1402 more than one element. INCOMPATIBILITY.
1404 * Introduced type classes order_top and order_bot. The old classes top
1405 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1406 Rename bot -> order_bot, top -> order_top
1408 * Introduce type classes "no_top" and "no_bot" for orderings without
1409 top and bottom elements.
1411 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1413 * Complex_Main: Unify and move various concepts from
1414 HOL-Multivariate_Analysis to HOL-Complex_Main.
1416 - Introduce type class (lin)order_topology and
1417 linear_continuum_topology. Allows to generalize theorems about
1418 limits and order. Instances are reals and extended reals.
1420 - continuous and continuos_on from Multivariate_Analysis:
1421 "continuous" is the continuity of a function at a filter. "isCont"
1422 is now an abbrevitation: "isCont x f == continuous (at _) f".
1424 Generalized continuity lemmas from isCont to continuous on an
1427 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1428 compactness of closed intervals on reals. Continuous functions
1429 attain infimum and supremum on compact sets. The inverse of a
1430 continuous function is continuous, when the function is continuous
1433 - connected from Multivariate_Analysis. Use it to prove the
1434 intermediate value theorem. Show connectedness of intervals on
1435 linear_continuum_topology).
1437 - first_countable_topology from Multivariate_Analysis. Is used to
1438 show equivalence of properties on the neighbourhood filter of x and
1439 on all sequences converging to x.
1441 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1442 theorems from Library/FDERIV.thy to Deriv.thy and base the
1443 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1444 which are restricted to sets, i.e. to represent derivatives from
1447 - Removed the within-filter. It is replaced by the principal filter:
1449 F within X = inf F (principal X)
1451 - Introduce "at x within U" as a single constant, "at x" is now an
1452 abbreviation for "at x within UNIV"
1454 - Introduce named theorem collections tendsto_intros,
1455 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1456 in tendsto_intros (or FDERIV_intros) are also available as
1457 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1458 is replaced by a congruence rule. This allows to apply them as
1459 intro rules and then proving equivalence by the simplifier.
1461 - Restructured theories in HOL-Complex_Main:
1463 + Moved RealDef and RComplete into Real
1465 + Introduced Topological_Spaces and moved theorems about
1466 topological spaces, filters, limits and continuity to it
1468 + Renamed RealVector to Real_Vector_Spaces
1470 + Split Lim, SEQ, Series into Topological_Spaces,
1471 Real_Vector_Spaces, and Limits
1473 + Moved Ln and Log to Transcendental
1475 + Moved theorems about continuity from Deriv to Topological_Spaces
1477 - Remove various auxiliary lemmas.
1482 - Added option "spy".
1483 - Reduce incidence of "too high arity" errors.
1487 isar_shrink ~> isar_compress
1489 - Added options "isar_try0", "spy".
1490 - Better support for "isar_proofs".
1491 - MaSh has been fined-tuned and now runs as a local server.
1493 * Improved support for ad hoc overloading of constants (see also
1494 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1496 * Library/Polynomial.thy:
1497 - Use lifting for primitive definitions.
1498 - Explicit conversions from and to lists of coefficients, used for
1500 - Replaced recursion operator poly_rec by fold_coeffs.
1501 - Prefer pre-existing gcd operation for gcd.
1503 poly_eq_iff ~> poly_eq_poly_eq_iff
1504 poly_ext ~> poly_eqI
1505 expand_poly_eq ~> poly_eq_iff
1508 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1509 case_of_simps to convert function definitions between a list of
1510 equations with patterns on the lhs and a single equation with case
1511 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1513 * New Library/FSet.thy: type of finite sets defined as a subtype of
1514 sets defined by Lifting/Transfer.
1516 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1518 * Consolidation of library theories on product orders:
1520 Product_Lattice ~> Product_Order -- pointwise order on products
1521 Product_ord ~> Product_Lexorder -- lexicographic order on products
1525 * Imperative-HOL: The MREC combinator is considered legacy and no
1526 longer included by default. INCOMPATIBILITY, use partial_function
1527 instead, or import theory Legacy_Mrec as a fallback.
1529 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1530 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1531 ~~/src/HOL/Library/Polynomial instead. The latter provides
1532 integration with HOL's type classes for rings. INCOMPATIBILITY.
1535 - Various improvements to BNF-based (co)datatype package, including
1536 new commands "primrec_new", "primcorec", and
1537 "datatype_new_compat", as well as documentation. See
1538 "datatypes.pdf" for details.
1539 - New "coinduction" method to avoid some boilerplate (compared to
1542 data ~> datatype_new
1543 codata ~> codatatype
1545 - Renamed many generated theorems, including
1547 map_comp' ~> map_comp
1557 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1558 "check_property" allows to check specifications of the form "ALL x y
1559 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1560 Examples.thy in particular.
1562 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1563 tracing output in the command transaction context instead of physical
1564 stdout. See also Toplevel.debug, Toplevel.debugging and
1565 ML_Compiler.exn_trace.
1567 * ML type "theory" is now immutable, without any special treatment of
1568 drafts or linear updates (which could lead to "stale theory" errors in
1569 the past). Discontinued obsolete operations like Theory.copy,
1570 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1573 * More uniform naming of goal functions for skipped proofs:
1575 Skip_Proof.prove ~> Goal.prove_sorry
1576 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1578 Minor INCOMPATIBILITY.
1580 * Simplifier tactics and tools use proper Proof.context instead of
1581 historic type simpset. Old-style declarations like addsimps,
1582 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1583 retains its use as snapshot of the main Simplifier context, using
1584 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1585 old tools by making them depend on (ctxt : Proof.context) instead of
1586 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1588 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1589 operate on Proof.context instead of claset, for uniformity with addIs,
1590 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1591 clasets separately from the context.
1593 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1594 INCOMPATIBILITY, use @{context} instead.
1596 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1597 presents the result as initial Proof.context.
1602 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1603 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1605 * Discontinued obsolete isabelle-process options -f and -u (former
1606 administrative aliases of option -e). Minor INCOMPATIBILITY.
1608 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1611 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1612 document formats: dvi.gz, ps, ps.gz -- the default document format is
1615 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1616 specify global resources of the JVM process run by isabelle build.
1618 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1619 to run Isabelle/Scala source files as standalone programs.
1621 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1622 keyword tables): use Isabelle/Scala operations, which inspect outer
1623 syntax without requiring to build sessions first.
1625 * Sessions may be organized via 'chapter' specifications in the ROOT
1626 file, which determines a two-level hierarchy of browser info. The old
1627 tree-like organization via implicit sub-session relation (with its
1628 tendency towards erratic fluctuation of URLs) has been discontinued.
1629 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1630 for HTML presentation of theories.
1634 New in Isabelle2013 (February 2013)
1635 -----------------------------------
1639 * Theorem status about oracles and unfinished/failed future proofs is
1640 no longer printed by default, since it is incompatible with
1641 incremental / parallel checking of the persistent document model. ML
1642 function Thm.peek_status may be used to inspect a snapshot of the
1643 ongoing evaluation process. Note that in batch mode --- notably
1644 isabelle build --- the system ensures that future proofs of all
1645 accessible theorems in the theory context are finished (as before).
1647 * Configuration option show_markup controls direct inlining of markup
1648 into the printed representation of formal entities --- notably type
1649 and sort constraints. This enables Prover IDE users to retrieve that
1650 information via tooltips in the output window, for example.
1652 * Command 'ML_file' evaluates ML text from a file directly within the
1653 theory, without any predeclaration via 'uses' in the theory header.
1655 * Old command 'use' command and corresponding keyword 'uses' in the
1656 theory header are legacy features and will be discontinued soon.
1657 Tools that load their additional source files may imitate the
1658 'ML_file' implementation, such that the system can take care of
1659 dependencies properly.
1661 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1662 is called fastforce / fast_force_tac already since Isabelle2011-1.
1664 * Updated and extended "isar-ref" and "implementation" manual, reduced
1665 remaining material in old "ref" manual.
1667 * Improved support for auxiliary contexts that indicate block structure
1668 for specifications. Nesting of "context fixes ... context assumes ..."
1669 and "class ... context ...".
1671 * Attribute "consumes" allows a negative value as well, which is
1672 interpreted relatively to the total number of premises of the rule in
1673 the target context. This form of declaration is stable when exported
1674 from a nested 'context' with additional assumptions. It is the
1675 preferred form for definitional packages, notably cases/rules produced
1676 in HOL/inductive and HOL/function.
1678 * More informative error messages for Isar proof commands involving
1679 lazy enumerations (method applications etc.).
1681 * Refined 'help' command to retrieve outer syntax commands according
1682 to name patterns (with clickable results).
1685 *** Prover IDE -- Isabelle/Scala/jEdit ***
1687 * Parallel terminal proofs ('by') are enabled by default, likewise
1688 proofs that are built into packages like 'datatype', 'function'. This
1689 allows to "run ahead" checking the theory specifications on the
1690 surface, while the prover is still crunching on internal
1691 justifications. Unfinished / cancelled proofs are restarted as
1692 required to complete full proof checking eventually.
1694 * Improved output panel with tooltips, hyperlinks etc. based on the
1695 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1696 tooltips leads to some window that supports the same recursively,
1697 which can lead to stacks of tooltips as the semantic document content
1698 is explored. ESCAPE closes the whole stack, individual windows may be
1699 closed separately, or detached to become independent jEdit dockables.
1701 * Improved support for commands that produce graph output: the text
1702 message contains a clickable area to open a new instance of the graph
1705 * More robust incremental parsing of outer syntax (partial comments,
1706 malformed symbols). Changing the balance of open/close quotes and
1707 comment delimiters works more conveniently with unfinished situations
1708 that frequently occur in user interaction.
1710 * More efficient painting and improved reactivity when editing large
1711 files. More scalable management of formal document content.
1713 * Smarter handling of tracing messages: prover process pauses after
1714 certain number of messages per command transaction, with some user
1715 dialog to stop or continue. This avoids swamping the front-end with
1716 potentially infinite message streams.
1718 * More plugin options and preferences, based on Isabelle/Scala. The
1719 jEdit plugin option panel provides access to some Isabelle/Scala
1720 options, including tuning parameters for editor reactivity and color
1723 * Dockable window "Symbols" provides some editing support for Isabelle
1726 * Dockable window "Monitor" shows ML runtime statistics. Note that
1727 continuous display of the chart slows down the system.
1729 * Improved editing support for control styles: subscript, superscript,
1730 bold, reset of style -- operating on single symbols or text
1731 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1733 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1734 adjust the main text area font size, and its derivatives for output,
1735 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1736 need to be adapted to local keyboard layouts.
1738 * More reactive completion popup by default: use \t (TAB) instead of
1739 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1740 also "Plugin Options / SideKick / General / Code Completion Options".
1742 * Implicit check and build dialog of the specified logic session
1743 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1744 demand, without bundling big platform-dependent heap images in the
1745 Isabelle distribution.
1747 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1748 from Oracle provide better multi-platform experience. This version is
1749 now bundled exclusively with Isabelle.
1754 * Code generation for Haskell: restrict unqualified imports from
1755 Haskell Prelude to a small set of fundamental operations.
1757 * Command 'export_code': relative file names are interpreted
1758 relatively to master directory of current theory rather than the
1759 rather arbitrary current working directory. INCOMPATIBILITY.
1761 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1762 use regular rule composition via "OF" / "THEN", or explicit proof
1763 structure instead. Note that Isabelle/ML provides a variety of
1764 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1765 with some care where this is really required.
1767 * Command 'typ' supports an additional variant with explicit sort
1768 constraint, to infer and check the most general type conforming to a
1769 given sort. Example (in HOL):
1771 typ "_ * _ * bool * unit" :: finite
1773 * Command 'locale_deps' visualizes all locales and their relations as
1781 - Added MaSh relevance filter based on machine-learning; see the
1782 Sledgehammer manual for details.
1783 - Polished Isar proofs generated with "isar_proofs" option.
1784 - Rationalized type encodings ("type_enc" option).
1785 - Renamed "kill_provers" subcommand to "kill_all".
1787 isar_proof ~> isar_proofs
1788 isar_shrink_factor ~> isar_shrink
1789 max_relevant ~> max_facts
1790 relevance_thresholds ~> fact_thresholds
1792 * Quickcheck: added an optimisation for equality premises. It is
1793 switched on by default, and can be switched off by setting the
1794 configuration quickcheck_optimise_equality to false.
1796 * Quotient: only one quotient can be defined by quotient_type
1800 - generation of an abstraction function equation in lift_definition
1801 - quot_del attribute
1802 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1804 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1807 * Preprocessing of the code generator rewrites set comprehensions into
1808 pointfree expressions.
1810 * The SMT solver Z3 has now by default a restricted set of directly
1811 supported features. For the full set of features (div/mod, nonlinear
1812 arithmetic, datatypes/records) with potential proof reconstruction
1813 failures, enable the configuration option "z3_with_extensions". Minor
1816 * Simplified 'typedef' specifications: historical options for implicit
1817 set definition and alternative name have been discontinued. The
1818 former behavior of "typedef (open) t = A" is now the default, but
1819 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1822 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1823 directly. INCOMPATIBILITY.
1825 * Moved operation product, sublists and n_lists from theory Enum to
1826 List. INCOMPATIBILITY.
1828 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1830 * Class "comm_monoid_diff" formalises properties of bounded
1831 subtraction, with natural numbers and multisets as typical instances.
1833 * Added combinator "Option.these" with type "'a option set => 'a set".
1835 * Theory "Transitive_Closure": renamed lemmas
1837 reflcl_tranclp -> reflclp_tranclp
1838 rtranclp_reflcl -> rtranclp_reflclp
1842 * Theory "Rings": renamed lemmas (in class semiring)
1844 left_distrib ~> distrib_right
1845 right_distrib ~> distrib_left
1849 * Generalized the definition of limits:
1851 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1852 expresses that when the input values x converge to F then the
1853 output f x converges to G.
1855 - Added filters for convergence to positive (at_top) and negative
1858 - Moved infinity in the norm (at_infinity) from
1859 Multivariate_Analysis to Complex_Main.
1861 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1866 * Theory "Library/Option_ord" provides instantiation of option type to
1867 lattice type classes.
1869 * Theory "Library/Multiset": renamed
1871 constant fold_mset ~> Multiset.fold
1872 fact fold_mset_commute ~> fold_mset_comm
1876 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1879 - Renamed constants (and related lemmas)
1882 strict_prefix ~> prefix
1884 - Replaced constant "postfix" by "suffixeq" with swapped argument
1885 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1886 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1887 Renamed lemmas accordingly.
1889 - Added constant "list_hembeq" for homeomorphic embedding on
1890 lists. Added abbreviation "sublisteq" for special case
1891 "list_hembeq (op =)".
1893 - Theory Library/Sublist no longer provides "order" and "bot" type
1894 class instances for the prefix order (merely corresponding locale
1895 interpretations). The type class instances are now in theory
1896 Library/Prefix_Order.
1898 - The sublist relation of theory Library/Sublist_Order is now based
1899 on "Sublist.sublisteq". Renamed lemmas accordingly:
1901 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1902 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1903 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1904 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1905 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1906 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1907 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1908 le_list_drop_many ~> Sublist.sublisteq_drop_many
1909 le_list_filter_left ~> Sublist.sublisteq_filter_left
1910 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1911 le_list_rev_take_iff ~> Sublist.sublisteq_append
1912 le_list_same_length ~> Sublist.sublisteq_same_length
1913 le_list_take_many_iff ~> Sublist.sublisteq_append'
1914 less_eq_list.drop ~> less_eq_list_drop
1915 less_eq_list.induct ~> less_eq_list_induct
1916 not_le_list_length ~> Sublist.not_sublisteq_length
1920 * New theory Library/Countable_Set.
1922 * Theory Library/Debug and Library/Parallel provide debugging and
1923 parallel execution for code generated towards Isabelle/ML.
1925 * Theory Library/FuncSet: Extended support for Pi and extensional and
1926 introduce the extensional dependent function space "PiE". Replaced
1927 extensional_funcset by an abbreviation, and renamed lemmas from
1928 extensional_funcset to PiE as follows:
1930 extensional_empty ~> PiE_empty
1931 extensional_funcset_empty_domain ~> PiE_empty_domain
1932 extensional_funcset_empty_range ~> PiE_empty_range
1933 extensional_funcset_arb ~> PiE_arb
1934 extensional_funcset_mem ~> PiE_mem
1935 extensional_funcset_extend_domainI ~> PiE_fun_upd
1936 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1937 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1938 card_extensional_funcset ~> card_PiE
1939 finite_extensional_funcset ~> finite_PiE
1943 * Theory Library/FinFun: theory of almost everywhere constant
1944 functions (supersedes the AFP entry "Code Generation for Functions as
1947 * Theory Library/Phantom: generic phantom type to make a type
1948 parameter appear in a constant's type. This alternative to adding
1949 TYPE('a) as another parameter avoids unnecessary closures in generated
1952 * Theory Library/RBT_Impl: efficient construction of red-black trees
1953 from sorted associative lists. Merging two trees with rbt_union may
1954 return a structurally different tree than before. Potential
1957 * Theory Library/IArray: immutable arrays with code generation.
1959 * Theory Library/Finite_Lattice: theory of finite lattices.
1961 * HOL/Multivariate_Analysis: replaced
1963 "basis :: 'a::euclidean_space => nat => real"
1964 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1966 on euclidean spaces by using the inner product "_ \<bullet> _" with
1967 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1968 "SUM i : Basis. f i * r i".
1970 With this change the following constants are also changed or removed:
1972 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1973 a $$ i ~> inner a i (where i : Basis)
1975 \<pi>, \<pi>' removed
1977 Theorems about these constants where removed.
1981 component_le_norm ~> Basis_le_norm
1982 euclidean_eq ~> euclidean_eq_iff
1983 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1984 euclidean_simps ~> inner_simps
1985 independent_basis ~> independent_Basis
1986 span_basis ~> span_Basis
1987 in_span_basis ~> in_span_Basis
1988 norm_bound_component_le ~> norm_boound_Basis_le
1989 norm_bound_component_lt ~> norm_boound_Basis_lt
1990 component_le_infnorm ~> Basis_le_infnorm
1996 - Added simproc "measurable" to automatically prove measurability.
1998 - Added induction rules for sigma sets with disjoint union
1999 (sigma_sets_induct_disjoint) and for Borel-measurable functions
2000 (borel_measurable_induct).
2002 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
2005 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
2006 AFP entry "Ordinals_and_Cardinals").
2008 * HOL/BNF: New (co)datatype package based on bounded natural functors
2009 with support for mixed, nested recursion and interesting non-free
2012 * HOL/Finite_Set and Relation: added new set and relation operations
2013 expressed by Finite_Set.fold.
2015 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
2016 trees for the code generator.
2018 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
2020 possible INCOMPATIBILITY.
2022 * HOL/Set: renamed Set.project -> Set.filter
2026 *** Document preparation ***
2028 * Dropped legacy antiquotations "term_style" and "thm_style", since
2029 styles may be given as arguments to "term" and "thm" already.
2030 Discontinued legacy styles "prem1" .. "prem19".
2032 * Default LaTeX rendering for \<euro> is now based on eurosym package,
2033 instead of slightly exotic babel/greek.
2035 * Document variant NAME may use different LaTeX entry point
2036 document/root_NAME.tex if that file exists, instead of the common
2039 * Simplified custom document/build script, instead of old-style
2040 document/IsaMakefile. Minor INCOMPATIBILITY.
2045 * The default limit for maximum number of worker threads is now 8,
2046 instead of 4, in correspondence to capabilities of contemporary
2047 hardware and Poly/ML runtime system.
2049 * Type Seq.results and related operations support embedded error
2050 messages within lazy enumerations, and thus allow to provide
2051 informative errors in the absence of any usable results.
2053 * Renamed Position.str_of to Position.here to emphasize that this is a
2054 formal device to inline positions into message text, but not
2055 necessarily printing visible text.
2060 * Advanced support for Isabelle sessions and build management, see
2061 "system" manual for the chapter of that name, especially the "isabelle
2062 build" tool and its examples. The "isabelle mkroot" tool prepares
2063 session root directories for use with "isabelle build", similar to
2064 former "isabelle mkdir" for "isabelle usedir". Note that this affects
2065 document preparation as well. INCOMPATIBILITY, isabelle usedir /
2066 mkdir / make are rendered obsolete.
2068 * Discontinued obsolete Isabelle/build script, it is superseded by the
2069 regular isabelle build tool. For example:
2071 isabelle build -s -b HOL
2073 * Discontinued obsolete "isabelle makeall".
2075 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
2076 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
2077 provides some traditional targets that invoke "isabelle build". Note
2078 that this is inefficient! Applications of Isabelle/HOL involving
2079 "isabelle make" should be upgraded to use "isabelle build" directly.
2081 * The "isabelle options" tool prints Isabelle system options, as
2082 required for "isabelle build", for example.
2084 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
2085 Minor INCOMPATIBILITY in command-line options.
2087 * The "isabelle install" tool has now a simpler command-line. Minor
2090 * The "isabelle components" tool helps to resolve add-on components
2091 that are not bundled, or referenced from a bare-bones repository
2092 version of Isabelle.
2094 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
2095 platform family: "linux", "macos", "windows".
2097 * The ML system is configured as regular component, and no longer
2098 picked up from some surrounding directory. Potential INCOMPATIBILITY
2099 for home-made settings.
2101 * Improved ML runtime statistics (heap, threads, future tasks etc.).
2103 * Discontinued support for Poly/ML 5.2.1, which was the last version
2104 without exception positions and advanced ML compiler/toplevel
2107 * Discontinued special treatment of Proof General -- no longer guess
2108 PROOFGENERAL_HOME based on accidental file-system layout. Minor
2109 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
2110 settings manually, or use a Proof General version that has been
2111 bundled as Isabelle component.
2115 New in Isabelle2012 (May 2012)
2116 ------------------------------
2120 * Prover IDE (PIDE) improvements:
2122 - more robust Sledgehammer integration (as before the sledgehammer
2123 command-line needs to be typed into the source buffer)
2124 - markup for bound variables
2125 - markup for types of term variables (displayed as tooltips)
2126 - support for user-defined Isar commands within the running session
2127 - improved support for Unicode outside original 16bit range
2128 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
2130 * Forward declaration of outer syntax keywords within the theory
2131 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
2132 commands to be used in the same theory where defined.
2134 * Auxiliary contexts indicate block structure for specifications with
2135 additional parameters and assumptions. Such unnamed contexts may be
2136 nested within other targets, like 'theory', 'locale', 'class',
2137 'instantiation' etc. Results from the local context are generalized
2138 accordingly and applied to the enclosing target context. Example:
2142 assumes xy: "x = y" and yz: "y = z"
2145 lemma my_trans: "x = z" using xy yz by simp
2151 The most basic application is to factor-out context elements of
2152 several fixes/assumes/shows theorem statements, e.g. see
2153 ~~/src/HOL/Isar_Examples/Group_Context.thy
2155 Any other local theory specification element works within the "context
2156 ... begin ... end" block as well.
2158 * Bundled declarations associate attributed fact expressions with a
2159 given name in the context. These may be later included in other
2160 contexts. This allows to manage context extensions casually, without
2161 the logical dependencies of locales and locale interpretation. See
2162 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
2164 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
2165 declaration, and results are standardized before being stored. Thus
2166 old-style "standard" after instantiation or composition of facts
2167 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
2168 indices of schematic variables.
2170 * Rule attributes in local theory declarations (e.g. locale or class)
2171 are now statically evaluated: the resulting theorem is stored instead
2172 of the original expression. INCOMPATIBILITY in rare situations, where
2173 the historic accident of dynamic re-evaluation in interpretations
2176 * New tutorial "Programming and Proving in Isabelle/HOL"
2177 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
2178 Structured Isar Proofs" ("isar-overview"), which has been removed. It
2179 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
2180 Logic" as the recommended beginners tutorial, but does not cover all
2181 of the material of that old tutorial.
2183 * Updated and extended reference manuals: "isar-ref",
2184 "implementation", "system"; reduced remaining material in old "ref"
2190 * Command 'definition' no longer exports the foundational "raw_def"
2191 into the user context. Minor INCOMPATIBILITY, may use the regular
2192 "def" result with attribute "abs_def" to imitate the old version.
2194 * Attribute "abs_def" turns an equation of the form "f x y == t" into
2195 "f == %x y. t", which ensures that "simp" or "unfold" steps always
2196 expand it. This also works for object-logic equality. (Formerly
2197 undocumented feature.)
2199 * Sort constraints are now propagated in simultaneous statements, just
2200 like type constraints. INCOMPATIBILITY in rare situations, where
2201 distinct sorts used to be assigned accidentally. For example:
2203 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
2205 lemma "P (x::'a)" and "Q (y::'a::bar)"
2206 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
2208 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
2209 tolerant against multiple unifiers, as long as the final result is
2210 unique. (As before, rules are composed in canonical right-to-left
2211 order to accommodate newly introduced premises.)
2213 * Renamed some inner syntax categories:
2219 Minor INCOMPATIBILITY. Note that in practice "num_const" or
2220 "num_position" etc. are mainly used instead (which also include
2221 position information via constraints).
2223 * Simplified configuration options for syntax ambiguity: see
2224 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
2225 manual. Minor INCOMPATIBILITY.
2227 * Discontinued configuration option "syntax_positions": atomic terms
2228 in parse trees are always annotated by position constraints.
2230 * Old code generator for SML and its commands 'code_module',
2231 'code_library', 'consts_code', 'types_code' have been discontinued.
2232 Use commands of the generic code generator instead. INCOMPATIBILITY.
2234 * Redundant attribute "code_inline" has been discontinued. Use
2235 "code_unfold" instead. INCOMPATIBILITY.
2237 * Dropped attribute "code_unfold_post" in favor of the its dual
2238 "code_abbrev", which yields a common pattern in definitions like
2240 definition [code_abbrev]: "f = t"
2244 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
2245 instead. INCOMPATIBILITY.
2247 * Discontinued old "prems" fact, which used to refer to the accidental
2248 collection of foundational premises in the context (already marked as
2249 legacy since Isabelle2011).
2254 * Type 'a set is now a proper type constructor (just as before
2255 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
2256 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
2257 sets separate, it is often sufficient to rephrase some set S that has
2258 been accidentally used as predicates by "%x. x : S", and some
2259 predicate P that has been accidentally used as set by "{x. P x}".
2260 Corresponding proofs in a first step should be pruned from any
2261 tinkering with former theorems mem_def and Collect_def as far as
2264 For developments which deliberately mix predicates and sets, a
2265 planning step is necessary to determine what should become a predicate
2266 and what a set. It can be helpful to carry out that step in
2267 Isabelle2011-1 before jumping right into the current release.
2269 * Code generation by default implements sets as container type rather
2270 than predicates. INCOMPATIBILITY.
2272 * New type synonym 'a rel = ('a * 'a) set
2274 * The representation of numerals has changed. Datatype "num"
2275 represents strictly positive binary numerals, along with functions
2276 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
2277 positive and negated numeric literals, respectively. See also
2278 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
2279 user theories may require adaptations as follows:
2281 - Theorems with number_ring or number_semiring constraints: These
2282 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
2284 - Theories defining numeric types: Remove number, number_semiring,
2285 and number_ring instances. Defer all theorems about numerals until
2286 after classes one and semigroup_add have been instantiated.
2288 - Numeral-only simp rules: Replace each rule having a "number_of v"
2289 pattern with two copies, one for numeral and one for neg_numeral.
2291 - Theorems about subclasses of semiring_1 or ring_1: These classes
2292 automatically support numerals now, so more simp rules and
2293 simprocs may now apply within the proof.
2295 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
2296 Redefine using other integer operations.
2298 * Transfer: New package intended to generalize the existing
2299 "descending" method and related theorem attributes from the Quotient
2300 package. (Not all functionality is implemented yet, but future
2301 development will focus on Transfer as an eventual replacement for the
2302 corresponding parts of the Quotient package.)
2304 - transfer_rule attribute: Maintains a collection of transfer rules,
2305 which relate constants at two different types. Transfer rules may
2306 relate different type instances of the same polymorphic constant,
2307 or they may relate an operation on a raw type to a corresponding
2308 operation on an abstract type (quotient or subtype). For example:
2310 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
2311 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
2313 - transfer method: Replaces a subgoal on abstract types with an
2314 equivalent subgoal on the corresponding raw types. Constants are
2315 replaced with corresponding ones according to the transfer rules.
2316 Goals are generalized over all free variables by default; this is
2317 necessary for variables whose types change, but can be overridden
2318 for specific variables with e.g. "transfer fixing: x y z". The
2319 variant transfer' method allows replacing a subgoal with one that
2320 is logically stronger (rather than equivalent).
2322 - relator_eq attribute: Collects identity laws for relators of
2323 various type constructors, e.g. "list_all2 (op =) = (op =)". The
2324 transfer method uses these lemmas to infer transfer rules for
2325 non-polymorphic constants on the fly.
2327 - transfer_prover method: Assists with proving a transfer rule for a
2328 new constant, provided the constant is defined in terms of other
2329 constants that already have transfer rules. It should be applied
2330 after unfolding the constant definitions.
2332 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
2333 from type nat to type int.
2335 * Lifting: New package intended to generalize the quotient_definition
2336 facility of the Quotient package; designed to work with Transfer.
2338 - lift_definition command: Defines operations on an abstract type in
2339 terms of a corresponding operation on a representation
2340 type. Example syntax:
2342 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2345 Users must discharge a respectfulness proof obligation when each
2346 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2347 the proof is discharged automatically.) The obligation is
2348 presented in a user-friendly, readable form; a respectfulness
2349 theorem in the standard format and a transfer rule are generated
2352 - Integration with code_abstype: For typedefs (e.g. subtypes
2353 corresponding to a datatype invariant, such as dlist),
2354 lift_definition generates a code certificate theorem and sets up
2355 code generation for each constant.
2357 - setup_lifting command: Sets up the Lifting package to work with a
2358 user-defined type. The user must provide either a quotient theorem
2359 or a type_definition theorem. The package configures transfer
2360 rules for equality and quantifiers on the type, and sets up the
2361 lift_definition command to work with the type.
2363 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2364 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2365 Word/Word.thy and Library/Float.thy.
2369 - The 'quotient_type' command now supports a 'morphisms' option with
2370 rep and abs functions, similar to typedef.
2372 - 'quotient_type' sets up new types to work with the Lifting and
2373 Transfer packages, as with 'setup_lifting'.
2375 - The 'quotient_definition' command now requires the user to prove a
2376 respectfulness property at the point where the constant is
2377 defined, similar to lift_definition; INCOMPATIBILITY.
2379 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2380 accordingly, INCOMPATIBILITY.
2382 * New diagnostic command 'find_unused_assms' to find potentially
2383 superfluous assumptions in theorems using Quickcheck.
2387 - Quickcheck returns variable assignments as counterexamples, which
2388 allows to reveal the underspecification of functions under test.
2389 For example, refuting "hd xs = x", it presents the variable
2390 assignment xs = [] and x = a1 as a counterexample, assuming that
2391 any property is false whenever "hd []" occurs in it.
2393 These counterexample are marked as potentially spurious, as
2394 Quickcheck also returns "xs = []" as a counterexample to the
2395 obvious theorem "hd xs = hd xs".
2397 After finding a potentially spurious counterexample, Quickcheck
2398 continues searching for genuine ones.
2400 By default, Quickcheck shows potentially spurious and genuine
2401 counterexamples. The option "genuine_only" sets quickcheck to only
2402 show genuine counterexamples.
2404 - The command 'quickcheck_generator' creates random and exhaustive
2405 value generators for a given type and operations.
2407 It generates values by using the operations as if they were
2408 constructors of that type.
2410 - Support for multisets.
2412 - Added "use_subtype" options.
2414 - Added "quickcheck_locale" configuration to specify how to process
2415 conjectures in a locale context.
2417 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2418 and affecting 'rat' and 'real'.
2421 - Integrated more tightly with SPASS, as described in the ITP 2012
2422 paper "More SPASS with Isabelle".
2423 - Made it try "smt" as a fallback if "metis" fails or times out.
2424 - Added support for the following provers: Alt-Ergo (via Why3 and
2425 TFF1), iProver, iProver-Eq.
2426 - Sped up the minimizer.
2427 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2428 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2429 - Renamed "sound" option to "strict".
2431 * Metis: Added possibility to specify lambda translations scheme as a
2432 parenthesized argument (e.g., "by (metis (lifting) ...)").
2434 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2436 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2438 * New "case_product" attribute to generate a case rule doing multiple
2439 case distinctions at the same time. E.g.
2441 list.exhaust [case_product nat.exhaust]
2443 produces a rule which can be used to perform case distinction on both
2446 * New "eventually_elim" method as a generalized variant of the
2447 eventually_elim* rules. Supports structured proofs.
2449 * Typedef with implicit set definition is considered legacy. Use
2450 "typedef (open)" form instead, which will eventually become the
2453 * Record: code generation can be switched off manually with
2455 declare [[record_coden = false]] -- "default true"
2457 * Datatype: type parameters allow explicit sort constraints.
2459 * Concrete syntax for case expressions includes constraints for source
2460 positions, and thus produces Prover IDE markup for its bindings.
2461 INCOMPATIBILITY for old-style syntax translations that augment the
2462 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2465 * Clarified attribute "mono_set": pure declaration without modifying
2466 the result of the fact expression.
2468 * More default pred/set conversions on a couple of relation operations
2469 and predicates. Added powers of predicate relations. Consolidation
2470 of some relation theorems:
2472 converse_def ~> converse_unfold
2473 rel_comp_def ~> relcomp_unfold
2474 symp_def ~> (modified, use symp_def and sym_def instead)
2475 transp_def ~> transp_trans
2476 Domain_def ~> Domain_unfold
2477 Range_def ~> Domain_converse [symmetric]
2479 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2481 See theory "Relation" for examples for making use of pred/set
2482 conversions by means of attributes "to_set" and "to_pred".
2486 * Renamed facts about the power operation on relations, i.e., relpow
2487 to match the constant's name:
2489 rel_pow_1 ~> relpow_1
2490 rel_pow_0_I ~> relpow_0_I
2491 rel_pow_Suc_I ~> relpow_Suc_I
2492 rel_pow_Suc_I2 ~> relpow_Suc_I2
2493 rel_pow_0_E ~> relpow_0_E
2494 rel_pow_Suc_E ~> relpow_Suc_E
2495 rel_pow_E ~> relpow_E
2496 rel_pow_Suc_D2 ~> relpow_Suc_D2
2497 rel_pow_Suc_E2 ~> relpow_Suc_E2
2498 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2499 rel_pow_E2 ~> relpow_E2
2500 rel_pow_add ~> relpow_add
2501 rel_pow_commute ~> relpow
2502 rel_pow_empty ~> relpow_empty:
2503 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2504 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2505 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2506 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2507 rel_pow_fun_conv ~> relpow_fun_conv
2508 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2509 rel_pow_finite_bounded ~> relpow_finite_bounded
2510 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2511 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2512 single_valued_rel_pow ~> single_valued_relpow
2516 * Theory Relation: Consolidated constant name for relation composition
2517 and corresponding theorem names:
2519 - Renamed constant rel_comp to relcomp.
2521 - Dropped abbreviation pred_comp. Use relcompp instead.
2525 rel_compI ~> relcompI
2526 rel_compEpair ~> relcompEpair
2527 rel_compE ~> relcompE
2528 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2529 rel_comp_empty1 ~> relcomp_empty1
2530 rel_comp_mono ~> relcomp_mono
2531 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2532 rel_comp_distrib ~> relcomp_distrib
2533 rel_comp_distrib2 ~> relcomp_distrib2
2534 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2535 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2536 single_valued_rel_comp ~> single_valued_relcomp
2537 rel_comp_def ~> relcomp_unfold
2538 converse_rel_comp ~> converse_relcomp
2539 pred_compI ~> relcomppI
2540 pred_compE ~> relcomppE
2541 pred_comp_bot1 ~> relcompp_bot1
2542 pred_comp_bot2 ~> relcompp_bot2
2543 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2544 pred_comp_mono ~> relcompp_mono
2545 pred_comp_distrib ~> relcompp_distrib
2546 pred_comp_distrib2 ~> relcompp_distrib2
2547 converse_pred_comp ~> converse_relcompp
2549 finite_rel_comp ~> finite_relcomp
2551 set_rel_comp ~> set_relcomp
2555 * Theory Divides: Discontinued redundant theorems about div and mod.
2556 INCOMPATIBILITY, use the corresponding generic theorems instead.
2558 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2559 zdiv_self ~> div_self
2560 zmod_self ~> mod_self
2563 zdiv_zmod_equality ~> div_mod_equality2
2564 zdiv_zmod_equality2 ~> div_mod_equality
2565 zmod_zdiv_trivial ~> mod_div_trivial
2566 zdiv_zminus_zminus ~> div_minus_minus
2567 zmod_zminus_zminus ~> mod_minus_minus
2568 zdiv_zminus2 ~> div_minus_right
2569 zmod_zminus2 ~> mod_minus_right
2570 zdiv_minus1_right ~> div_minus1_right
2571 zmod_minus1_right ~> mod_minus1_right
2572 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2573 zmod_zmult1_eq ~> mod_mult_right_eq
2574 zpower_zmod ~> power_mod
2575 zdvd_zmod ~> dvd_mod
2576 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2577 mod_mult_distrib ~> mult_mod_left
2578 mod_mult_distrib2 ~> mult_mod_right
2580 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2581 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2583 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2585 * Consolidated theorem names concerning fold combinators:
2587 inf_INFI_fold_inf ~> inf_INF_fold_inf
2588 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2589 INFI_fold_inf ~> INF_fold_inf
2590 SUPR_fold_sup ~> SUP_fold_sup
2591 union_set ~> union_set_fold
2592 minus_set ~> minus_set_fold
2593 INFI_set_fold ~> INF_set_fold
2594 SUPR_set_fold ~> SUP_set_fold
2595 INF_code ~> INF_set_foldr
2596 SUP_code ~> SUP_set_foldr
2597 foldr.simps ~> foldr.simps (in point-free formulation)
2598 foldr_fold_rev ~> foldr_conv_fold
2599 foldl_fold ~> foldl_conv_fold
2600 foldr_foldr ~> foldr_conv_foldl
2601 foldl_foldr ~> foldl_conv_foldr
2602 fold_set_remdups ~> fold_set_fold_remdups
2603 fold_set ~> fold_set_fold
2604 fold1_set ~> fold1_set_fold
2608 * Dropped rarely useful theorems concerning fold combinators:
2609 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2610 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2611 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2612 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2613 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2614 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2615 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2616 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2617 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2618 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2620 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2621 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2622 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2623 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2624 lemmas over fold rather than foldr, or make use of lemmas
2625 fold_conv_foldr and fold_rev.
2627 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2628 through option types.
2630 * "Transitive_Closure.ntrancl": bounded transitive closure on
2633 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2635 * Theory Int: Discontinued many legacy theorems specific to type int.
2636 INCOMPATIBILITY, use the corresponding generic theorems instead.
2638 zminus_zminus ~> minus_minus
2639 zminus_0 ~> minus_zero
2640 zminus_zadd_distrib ~> minus_add_distrib
2641 zadd_commute ~> add_commute
2642 zadd_assoc ~> add_assoc
2643 zadd_left_commute ~> add_left_commute
2646 zadd_0 ~> add_0_left
2647 zadd_0_right ~> add_0_right
2648 zadd_zminus_inverse2 ~> left_minus
2649 zmult_zminus ~> mult_minus_left
2650 zmult_commute ~> mult_commute
2651 zmult_assoc ~> mult_assoc
2652 zadd_zmult_distrib ~> left_distrib
2653 zadd_zmult_distrib2 ~> right_distrib
2654 zdiff_zmult_distrib ~> left_diff_distrib
2655 zdiff_zmult_distrib2 ~> right_diff_distrib
2656 zmult_1 ~> mult_1_left
2657 zmult_1_right ~> mult_1_right
2658 zle_refl ~> order_refl
2659 zle_trans ~> order_trans
2660 zle_antisym ~> order_antisym
2661 zle_linear ~> linorder_linear
2662 zless_linear ~> linorder_less_linear
2663 zadd_left_mono ~> add_left_mono
2664 zadd_strict_right_mono ~> add_strict_right_mono
2665 zadd_zless_mono ~> add_less_le_mono
2666 int_0_less_1 ~> zero_less_one
2667 int_0_neq_1 ~> zero_neq_one
2669 zpower_zadd_distrib ~> power_add
2670 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2671 zero_le_zpower_abs ~> zero_le_power_abs
2673 * Theory Deriv: Renamed
2675 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2677 * Theory Library/Multiset: Improved code generation of multisets.
2679 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2680 are expressed via type classes again. The special syntax
2681 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2682 setsum_set, which is now subsumed by Big_Operators.setsum.
2685 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2686 use theory HOL/Library/Nat_Bijection instead.
2688 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2689 trees is now inside a type class context. Names of affected
2690 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2691 theories working directly with raw red-black trees, adapt the names as
2695 bulkload -> rbt_bulkload
2696 del_from_left -> rbt_del_from_left
2697 del_from_right -> rbt_del_from_right
2699 delete -> rbt_delete
2701 insert -> rbt_insert
2702 insertw -> rbt_insert_with
2703 insert_with_key -> rbt_insert_with_key
2704 map_entry -> rbt_map_entry
2705 lookup -> rbt_lookup
2706 sorted -> rbt_sorted
2707 tree_greater -> rbt_greater
2708 tree_less -> rbt_less
2709 tree_less_symbol -> rbt_less_symbol
2711 union_with -> rbt_union_with
2712 union_with_key -> rbt_union_with_key
2715 balance_left_sorted -> balance_left_rbt_sorted
2716 balance_left_tree_greater -> balance_left_rbt_greater
2717 balance_left_tree_less -> balance_left_rbt_less
2718 balance_right_sorted -> balance_right_rbt_sorted
2719 balance_right_tree_greater -> balance_right_rbt_greater
2720 balance_right_tree_less -> balance_right_rbt_less
2721 balance_sorted -> balance_rbt_sorted
2722 balance_tree_greater -> balance_rbt_greater
2723 balance_tree_less -> balance_rbt_less
2724 bulkload_is_rbt -> rbt_bulkload_is_rbt
2725 combine_sorted -> combine_rbt_sorted
2726 combine_tree_greater -> combine_rbt_greater
2727 combine_tree_less -> combine_rbt_less
2728 delete_in_tree -> rbt_delete_in_tree
2729 delete_is_rbt -> rbt_delete_is_rbt
2730 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2731 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2732 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2733 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2734 del_in_tree -> rbt_del_in_tree
2735 del_inv1_inv2 -> rbt_del_inv1_inv2
2736 del_sorted -> rbt_del_rbt_sorted
2737 del_tree_greater -> rbt_del_rbt_greater
2738 del_tree_less -> rbt_del_rbt_less
2739 dom_lookup_Branch -> dom_rbt_lookup_Branch
2740 entries_lookup -> entries_rbt_lookup
2741 finite_dom_lookup -> finite_dom_rbt_lookup
2742 insert_sorted -> rbt_insert_rbt_sorted
2743 insertw_is_rbt -> rbt_insertw_is_rbt
2744 insertwk_is_rbt -> rbt_insertwk_is_rbt
2745 insertwk_sorted -> rbt_insertwk_rbt_sorted
2746 insertw_sorted -> rbt_insertw_rbt_sorted
2747 ins_sorted -> ins_rbt_sorted
2748 ins_tree_greater -> ins_rbt_greater
2749 ins_tree_less -> ins_rbt_less
2750 is_rbt_sorted -> is_rbt_rbt_sorted
2751 lookup_balance -> rbt_lookup_balance
2752 lookup_bulkload -> rbt_lookup_rbt_bulkload
2753 lookup_delete -> rbt_lookup_rbt_delete
2754 lookup_Empty -> rbt_lookup_Empty
2755 lookup_from_in_tree -> rbt_lookup_from_in_tree
2756 lookup_in_tree -> rbt_lookup_in_tree
2757 lookup_ins -> rbt_lookup_ins
2758 lookup_insert -> rbt_lookup_rbt_insert
2759 lookup_insertw -> rbt_lookup_rbt_insertw
2760 lookup_insertwk -> rbt_lookup_rbt_insertwk
2761 lookup_keys -> rbt_lookup_keys
2762 lookup_map -> rbt_lookup_map
2763 lookup_map_entry -> rbt_lookup_rbt_map_entry
2764 lookup_tree_greater -> rbt_lookup_rbt_greater
2765 lookup_tree_less -> rbt_lookup_rbt_less
2766 lookup_union -> rbt_lookup_rbt_union
2767 map_entry_color_of -> rbt_map_entry_color_of
2768 map_entry_inv1 -> rbt_map_entry_inv1
2769 map_entry_inv2 -> rbt_map_entry_inv2
2770 map_entry_is_rbt -> rbt_map_entry_is_rbt
2771 map_entry_sorted -> rbt_map_entry_rbt_sorted
2772 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2773 map_entry_tree_less -> rbt_map_entry_rbt_less
2774 map_tree_greater -> map_rbt_greater
2775 map_tree_less -> map_rbt_less
2776 map_sorted -> map_rbt_sorted
2777 paint_sorted -> paint_rbt_sorted
2778 paint_lookup -> paint_rbt_lookup
2779 paint_tree_greater -> paint_rbt_greater
2780 paint_tree_less -> paint_rbt_less
2781 sorted_entries -> rbt_sorted_entries
2782 tree_greater_eq_trans -> rbt_greater_eq_trans
2783 tree_greater_nit -> rbt_greater_nit
2784 tree_greater_prop -> rbt_greater_prop
2785 tree_greater_simps -> rbt_greater_simps
2786 tree_greater_trans -> rbt_greater_trans
2787 tree_less_eq_trans -> rbt_less_eq_trans
2788 tree_less_nit -> rbt_less_nit
2789 tree_less_prop -> rbt_less_prop
2790 tree_less_simps -> rbt_less_simps
2791 tree_less_trans -> rbt_less_trans
2792 tree_ord_props -> rbt_ord_props
2793 union_Branch -> rbt_union_Branch
2794 union_is_rbt -> rbt_union_is_rbt
2795 unionw_is_rbt -> rbt_unionw_is_rbt
2796 unionwk_is_rbt -> rbt_unionwk_is_rbt
2797 unionwk_sorted -> rbt_unionwk_rbt_sorted
2799 * Theory HOL/Library/Float: Floating point numbers are now defined as
2800 a subset of the real numbers. All operations are defined using the
2801 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2808 round_down -> float_round_down
2809 round_up -> float_round_up
2813 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2816 abs_float_def -> Float.compute_float_abs
2817 bitlen_ge0 -> bitlen_nonneg
2818 bitlen.simps -> Float.compute_bitlen
2819 float_components -> Float_mantissa_exponent
2820 float_divl.simps -> Float.compute_float_divl
2821 float_divr.simps -> Float.compute_float_divr
2822 float_eq_odd -> mult_powr_eq_mult_powr_iff
2823 float_power -> real_of_float_power
2824 lapprox_posrat_def -> Float.compute_lapprox_posrat
2825 lapprox_rat.simps -> Float.compute_lapprox_rat
2826 le_float_def' -> Float.compute_float_le
2827 le_float_def -> less_eq_float.rep_eq
2828 less_float_def' -> Float.compute_float_less
2829 less_float_def -> less_float.rep_eq
2830 normfloat_def -> Float.compute_normfloat
2831 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2832 normfloat -> normfloat_def
2833 normfloat_unique -> use normfloat_def
2834 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2835 one_float_def -> Float.compute_float_one
2836 plus_float_def -> Float.compute_float_plus
2837 rapprox_posrat_def -> Float.compute_rapprox_posrat
2838 rapprox_rat.simps -> Float.compute_rapprox_rat
2839 real_of_float_0 -> zero_float.rep_eq
2840 real_of_float_1 -> one_float.rep_eq
2841 real_of_float_abs -> abs_float.rep_eq
2842 real_of_float_add -> plus_float.rep_eq
2843 real_of_float_minus -> uminus_float.rep_eq
2844 real_of_float_mult -> times_float.rep_eq
2845 real_of_float_simp -> Float.rep_eq
2846 real_of_float_sub -> minus_float.rep_eq
2847 round_down.simps -> Float.compute_float_round_down
2848 round_up.simps -> Float.compute_float_round_up
2849 times_float_def -> Float.compute_float_times
2850 uminus_float_def -> Float.compute_float_uminus
2851 zero_float_def -> Float.compute_float_zero
2853 Lemmas not necessary anymore, use the transfer method:
2854 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2855 float_divr, float_le_simp, float_less1_mantissa_bound,
2856 float_less_simp, float_less_zero, float_le_zero,
2857 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2858 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2859 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2860 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2861 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2862 round_up, zero_le_float, zero_less_float
2864 * New theory HOL/Library/DAList provides an abstract type for
2865 association lists with distinct keys.
2867 * Session HOL/IMP: Added new theory of abstract interpretation of
2870 * Session HOL-Import: Re-implementation from scratch is faster,
2871 simpler, and more scalable. Requires a proof bundle, which is
2872 available as an external component. Discontinued old (and mostly
2873 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2875 * Session HOL-Word: Discontinued many redundant theorems specific to
2876 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2879 word_sub_alt ~> word_sub_wi
2880 word_add_alt ~> word_add_def
2881 word_mult_alt ~> word_mult_def
2882 word_minus_alt ~> word_minus_def
2883 word_0_alt ~> word_0_wi
2884 word_1_alt ~> word_1_wi
2885 word_add_0 ~> add_0_left
2886 word_add_0_right ~> add_0_right
2887 word_mult_1 ~> mult_1_left
2888 word_mult_1_right ~> mult_1_right
2889 word_add_commute ~> add_commute
2890 word_add_assoc ~> add_assoc
2891 word_add_left_commute ~> add_left_commute
2892 word_mult_commute ~> mult_commute
2893 word_mult_assoc ~> mult_assoc
2894 word_mult_left_commute ~> mult_left_commute
2895 word_left_distrib ~> left_distrib
2896 word_right_distrib ~> right_distrib
2897 word_left_minus ~> left_minus
2898 word_diff_0_right ~> diff_0_right
2899 word_diff_self ~> diff_self
2900 word_sub_def ~> diff_minus
2901 word_diff_minus ~> diff_minus
2902 word_add_ac ~> add_ac
2903 word_mult_ac ~> mult_ac
2904 word_plus_ac0 ~> add_0_left add_0_right add_ac
2905 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2906 word_order_trans ~> order_trans
2907 word_order_refl ~> order_refl
2908 word_order_antisym ~> order_antisym
2909 word_order_linear ~> linorder_linear
2910 lenw1_zero_neq_one ~> zero_neq_one
2911 word_number_of_eq ~> number_of_eq
2912 word_of_int_add_hom ~> wi_hom_add
2913 word_of_int_sub_hom ~> wi_hom_sub
2914 word_of_int_mult_hom ~> wi_hom_mult
2915 word_of_int_minus_hom ~> wi_hom_neg
2916 word_of_int_succ_hom ~> wi_hom_succ
2917 word_of_int_pred_hom ~> wi_hom_pred
2918 word_of_int_0_hom ~> word_0_wi
2919 word_of_int_1_hom ~> word_1_wi
2921 * Session HOL-Word: New proof method "word_bitwise" for splitting
2922 machine word equalities and inequalities into logical circuits,
2923 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2924 multiplication, shifting by constants, bitwise operators and numeric
2925 constants. Requires fixed-length word types, not 'a word. Solves
2926 many standard word identities outright and converts more into first
2927 order problems amenable to blast or similar. See also examples in
2928 HOL/Word/Examples/WordExamples.thy.
2930 * Session HOL-Probability: Introduced the type "'a measure" to
2931 represent measures, this replaces the records 'a algebra and 'a
2932 measure_space. The locales based on subset_class now have two
2933 locale-parameters the space \<Omega> and the set of measurable sets M.
2934 The product of probability spaces uses now the same constant as the
2935 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2936 measure". Most constants are defined now outside of locales and gain
2937 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2938 Measure space constructions for distributions and densities now got
2939 their own constants distr and density. Instead of using locales to
2940 describe measure spaces with a finite space, the measure count_space
2941 and point_measure is introduced. INCOMPATIBILITY.
2945 finite_measure.\<mu>' -> measure
2946 product_algebra_generator -> prod_algebra
2947 product_prob_space.emb -> prod_emb
2948 product_prob_space.infprod_algebra -> PiM
2951 completeable_measure_space
2952 finite_measure_space
2954 finite_product_finite_prob_space
2955 finite_product_sigma_algebra
2956 finite_sigma_algebra
2958 pair_finite_prob_space
2959 pair_finite_sigma_algebra
2962 product_sigma_algebra
2966 distribution -> use distr measure, or distributed predicate
2968 joint_distribution -> use distr measure, or distributed predicate
2969 pair_measure_generator
2970 product_prob_space.infprod_algebra -> use PiM
2973 Replacement theorems:
2974 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2975 finite_measure.empty_measure -> measure_empty
2976 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2977 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2978 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2979 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2980 finite_measure.finite_measure -> finite_measure.emeasure_finite
2981 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2982 finite_measure.positive_measure' -> measure_nonneg
2983 finite_measure.real_measure -> finite_measure.emeasure_real
2984 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2985 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2986 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2987 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2988 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2989 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2990 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2991 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2992 information_space.entropy_commute -> information_space.entropy_commute_simple
2993 information_space.entropy_eq -> information_space.entropy_simple_distributed
2994 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2995 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2996 information_space.entropy_uniform_max -> information_space.entropy_uniform
2997 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2998 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2999 information_space.KL_ge_0 -> information_space.KL_nonneg
3000 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
3001 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
3002 Int_stable_cuboids -> Int_stable_atLeastAtMost
3003 Int_stable_product_algebra_generator -> positive_integral
3004 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
3005 measure_space.additive -> emeasure_additive
3006 measure_space.AE_iff_null_set -> AE_iff_null
3007 measure_space.almost_everywhere_def -> eventually_ae_filter
3008 measure_space.almost_everywhere_vimage -> AE_distrD
3009 measure_space.continuity_from_above -> INF_emeasure_decseq
3010 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
3011 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
3012 measure_space.continuity_from_below -> SUP_emeasure_incseq
3013 measure_space_density -> emeasure_density
3014 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
3015 measure_space.integrable_vimage -> integrable_distr
3016 measure_space.integral_translated_density -> integral_density
3017 measure_space.integral_vimage -> integral_distr
3018 measure_space.measure_additive -> plus_emeasure
3019 measure_space.measure_compl -> emeasure_compl
3020 measure_space.measure_countable_increasing -> emeasure_countable_increasing
3021 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
3022 measure_space.measure_decseq -> decseq_emeasure
3023 measure_space.measure_Diff -> emeasure_Diff
3024 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
3025 measure_space.measure_eq_0 -> emeasure_eq_0
3026 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
3027 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
3028 measure_space.measure_incseq -> incseq_emeasure
3029 measure_space.measure_insert -> emeasure_insert
3030 measure_space.measure_mono -> emeasure_mono
3031 measure_space.measure_not_negative -> emeasure_not_MInf
3032 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
3033 measure_space.measure_setsum -> setsum_emeasure
3034 measure_space.measure_setsum_split -> setsum_emeasure_cover
3035 measure_space.measure_space_vimage -> emeasure_distr
3036 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
3037 measure_space.measure_subadditive -> subadditive
3038 measure_space.measure_top -> emeasure_space
3039 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
3040 measure_space.measure_Un_null_set -> emeasure_Un_null_set
3041 measure_space.positive_integral_translated_density -> positive_integral_density
3042 measure_space.positive_integral_vimage -> positive_integral_distr
3043 measure_space.real_continuity_from_above -> Lim_measure_decseq
3044 measure_space.real_continuity_from_below -> Lim_measure_incseq
3045 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
3046 measure_space.real_measure_Diff -> measure_Diff
3047 measure_space.real_measure_finite_Union -> measure_finite_Union
3048 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
3049 measure_space.real_measure_subadditive -> measure_subadditive
3050 measure_space.real_measure_Union -> measure_Union
3051 measure_space.real_measure_UNION -> measure_UNION
3052 measure_space.simple_function_vimage -> simple_function_comp
3053 measure_space.simple_integral_vimage -> simple_integral_distr
3054 measure_space.simple_integral_vimage -> simple_integral_distr
3055 measure_unique_Int_stable -> measure_eqI_generator_eq
3056 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
3057 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
3058 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
3059 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
3060 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
3061 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
3062 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
3063 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
3064 pair_sigma_algebra.sets_swap -> sets_pair_swap
3065 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
3066 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
3067 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
3068 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
3069 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
3070 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
3071 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
3072 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
3073 prob_space.measure_space_1 -> prob_space.emeasure_space_1
3074 prob_space.prob_space_vimage -> prob_space_distr
3075 prob_space.random_variable_restrict -> measurable_restrict
3076 prob_space_unique_Int_stable -> measure_eqI_prob_space
3077 product_algebraE -> prod_algebraE_all
3078 product_algebra_generator_der -> prod_algebra_eq_finite
3079 product_algebra_generator_into_space -> prod_algebra_sets_into_space
3080 product_algebraI -> sets_PiM_I_finite
3081 product_measure_exists -> product_sigma_finite.sigma_finite
3082 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
3083 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
3084 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
3085 product_prob_space.measurable_component -> measurable_component_singleton
3086 product_prob_space.measurable_emb -> measurable_prod_emb
3087 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
3088 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
3089 product_prob_space.measure_emb -> emeasure_prod_emb
3090 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
3091 product_sigma_algebra.product_algebra_into_space -> space_closed
3092 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
3093 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
3094 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
3095 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
3096 sets_product_algebra -> sets_PiM
3097 sigma_algebra.measurable_sigma -> measurable_measure_of
3098 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
3099 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
3100 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
3101 space_product_algebra -> space_PiM
3103 * Session HOL-TPTP: support to parse and import TPTP problems (all
3104 languages) into Isabelle/HOL.
3109 * New "case_product" attribute (see HOL).
3114 * Greater support for structured proofs involving induction or case
3117 * Much greater use of mathematical symbols.
3119 * Removal of many ML theorem bindings. INCOMPATIBILITY.
3124 * Antiquotation @{keyword "name"} produces a parser for outer syntax
3125 from a minor keyword introduced via theory header declaration.
3127 * Antiquotation @{command_spec "name"} produces the
3128 Outer_Syntax.command_spec from a major keyword introduced via theory
3129 header declaration; it can be passed to Outer_Syntax.command etc.
3131 * Local_Theory.define no longer hard-wires default theorem name
3132 "foo_def", but retains the binding as given. If that is Binding.empty
3133 / Attrib.empty_binding, the result is not registered as user-level
3134 fact. The Local_Theory.define_internal variant allows to specify a
3135 non-empty name (used for the foundation in the background theory),
3136 while omitting the fact binding in the user-context. Potential
3137 INCOMPATIBILITY for derived definitional packages: need to specify
3138 naming policy for primitive definitions more explicitly.
3140 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
3141 conformance with similar operations in structure Term and Logic.
3143 * Antiquotation @{attributes [...]} embeds attribute source
3144 representation into the ML text, which is particularly useful with
3145 declarations like Local_Theory.note.
3147 * Structure Proof_Context follows standard naming scheme. Old
3148 ProofContext has been discontinued. INCOMPATIBILITY.
3150 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
3151 change of semantics: update is applied to auxiliary local theory
3154 * Modernized some old-style infix operations:
3156 addeqcongs ~> Simplifier.add_eqcong
3157 deleqcongs ~> Simplifier.del_eqcong
3158 addcongs ~> Simplifier.add_cong
3159 delcongs ~> Simplifier.del_cong
3160 setmksimps ~> Simplifier.set_mksimps
3161 setmkcong ~> Simplifier.set_mkcong
3162 setmksym ~> Simplifier.set_mksym
3163 setmkeqTrue ~> Simplifier.set_mkeqTrue
3164 settermless ~> Simplifier.set_termless
3165 setsubgoaler ~> Simplifier.set_subgoaler
3166 addsplits ~> Splitter.add_split
3167 delsplits ~> Splitter.del_split
3172 * USER_HOME settings variable points to cross-platform user home
3173 directory, which coincides with HOME on POSIX systems only. Likewise,
3174 the Isabelle path specification "~" now expands to $USER_HOME, instead
3175 of former $HOME. A different default for USER_HOME may be set
3176 explicitly in shell environment, before Isabelle settings are
3177 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
3178 the generic user home was intended.
3180 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
3181 notation, which is useful for the jEdit file browser, for example.
3183 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
3188 New in Isabelle2011-1 (October 2011)
3189 ------------------------------------
3193 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
3194 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
3196 - Management of multiple theory files directly from the editor
3197 buffer store -- bypassing the file-system (no requirement to save
3198 files for checking).
3200 - Markup of formal entities within the text buffer, with semantic
3201 highlighting, tooltips and hyperlinks to jump to defining source
3204 - Improved text rendering, with sub/superscripts in the source
3205 buffer (including support for copy/paste wrt. output panel, HTML
3206 theory output and other non-Isabelle text boxes).
3208 - Refined scheduling of proof checking and printing of results,
3209 based on interactive editor view. (Note: jEdit folding and
3210 narrowing allows to restrict buffer perspectives explicitly.)
3212 - Reduced CPU performance requirements, usable on machines with few
3215 - Reduced memory requirements due to pruning of unused document
3216 versions (garbage collection).
3218 See also ~~/src/Tools/jEdit/README.html for further information,
3219 including some remaining limitations.
3221 * Theory loader: source files are exclusively located via the master
3222 directory of each theory node (where the .thy file itself resides).
3223 The global load path (such as src/HOL/Library) has been discontinued.
3224 Note that the path element ~~ may be used to reference theories in the
3225 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
3228 * Theory loader: source files are identified by content via SHA1
3229 digests. Discontinued former path/modtime identification and optional
3230 ISABELLE_FILE_IDENT plugin scripts.
3232 * Parallelization of nested Isar proofs is subject to
3233 Goal.parallel_proofs_threshold (default 100). See also isabelle
3236 * Name space: former unsynchronized references are now proper
3237 configuration options, with more conventional names:
3239 long_names ~> names_long
3240 short_names ~> names_short
3241 unique_names ~> names_unique
3243 Minor INCOMPATIBILITY, need to declare options in context like this:
3245 declare [[names_unique = false]]
3247 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
3248 that the result needs to be unique, which means fact specifications
3249 may have to be refined after enriching a proof context.
3251 * Attribute "case_names" has been refined: the assumptions in each case
3252 can be named now by following the case name with [name1 name2 ...].
3254 * Isabelle/Isar reference manual has been updated and extended:
3255 - "Synopsis" provides a catalog of main Isar language concepts.
3256 - Formal references in syntax diagrams, via @{rail} antiquotation.
3257 - Updated material from classic "ref" manual, notably about
3258 "Classical Reasoner".
3263 * Class bot and top require underlying partial order rather than
3264 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
3266 * Class complete_lattice: generalized a couple of lemmas from sets;
3267 generalized theorems INF_cong and SUP_cong. New type classes for
3268 complete boolean algebras and complete linear orders. Lemmas
3269 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
3270 class complete_linorder.
3272 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
3273 Sup_fun_def, Inf_apply, Sup_apply.
3275 Removed redundant lemmas (the right hand side gives hints how to
3276 replace them for (metis ...), or (simp only: ...) proofs):
3278 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
3279 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
3280 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
3281 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
3282 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
3283 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
3284 Inter_def ~> INF_def, image_def
3285 Union_def ~> SUP_def, image_def
3286 INT_eq ~> INF_def, and image_def
3287 UN_eq ~> SUP_def, and image_def
3288 INF_subset ~> INF_superset_mono [OF _ order_refl]
3290 More consistent and comprehensive names:
3292 INTER_eq_Inter_image ~> INF_def
3293 UNION_eq_Union_image ~> SUP_def
3296 INF_leI ~> INF_lower
3297 INF_leI2 ~> INF_lower2
3298 le_INFI ~> INF_greatest
3299 le_SUPI ~> SUP_upper
3300 le_SUPI2 ~> SUP_upper2
3301 SUP_leI ~> SUP_least
3302 INFI_bool_eq ~> INF_bool_eq
3303 SUPR_bool_eq ~> SUP_bool_eq
3304 INFI_apply ~> INF_apply
3305 SUPR_apply ~> SUP_apply
3306 INTER_def ~> INTER_eq
3307 UNION_def ~> UNION_eq
3311 * Renamed theory Complete_Lattice to Complete_Lattices.
3314 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
3315 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
3316 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
3317 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
3319 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
3320 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
3321 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
3324 * Added syntactic classes "inf" and "sup" for the respective
3325 constants. INCOMPATIBILITY: Changes in the argument order of the
3326 (mostly internal) locale predicates for some derived classes.
3328 * Theorem collections ball_simps and bex_simps do not contain theorems
3329 referring to UNION any longer; these have been moved to collection
3330 UN_ball_bex_simps. INCOMPATIBILITY.
3332 * Theory Archimedean_Field: floor now is defined as parameter of a
3333 separate type class floor_ceiling.
3335 * Theory Finite_Set: more coherent development of fold_set locales:
3337 locale fun_left_comm ~> locale comp_fun_commute
3338 locale fun_left_comm_idem ~> locale comp_fun_idem
3340 Both use point-free characterization; interpretation proofs may need
3341 adjustment. INCOMPATIBILITY.
3343 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3344 accordance with standard mathematical terminology. INCOMPATIBILITY.
3346 * Theory Complex_Main: The locale interpretations for the
3347 bounded_linear and bounded_bilinear locales have been removed, in
3348 order to reduce the number of duplicate lemmas. Users must use the
3349 original names for distributivity theorems, potential INCOMPATIBILITY.
3351 divide.add ~> add_divide_distrib
3352 divide.diff ~> diff_divide_distrib
3353 divide.setsum ~> setsum_divide_distrib
3354 mult.add_right ~> right_distrib
3355 mult.diff_right ~> right_diff_distrib
3356 mult_right.setsum ~> setsum_right_distrib
3357 mult_left.diff ~> left_diff_distrib
3359 * Theory Complex_Main: Several redundant theorems have been removed or
3360 replaced by more general versions. INCOMPATIBILITY.
3362 real_diff_def ~> minus_real_def
3363 real_divide_def ~> divide_real_def
3364 real_less_def ~> less_le
3365 real_abs_def ~> abs_real_def
3366 real_sgn_def ~> sgn_real_def
3367 real_mult_commute ~> mult_commute
3368 real_mult_assoc ~> mult_assoc
3369 real_mult_1 ~> mult_1_left
3370 real_add_mult_distrib ~> left_distrib
3371 real_zero_not_eq_one ~> zero_neq_one
3372 real_mult_inverse_left ~> left_inverse
3373 INVERSE_ZERO ~> inverse_zero
3374 real_le_refl ~> order_refl
3375 real_le_antisym ~> order_antisym
3376 real_le_trans ~> order_trans
3377 real_le_linear ~> linear
3378 real_le_eq_diff ~> le_iff_diff_le_0
3379 real_add_left_mono ~> add_left_mono
3380 real_mult_order ~> mult_pos_pos
3381 real_mult_less_mono2 ~> mult_strict_left_mono
3382 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3383 real_0_le_divide_iff ~> zero_le_divide_iff
3384 realpow_two_disj ~> power2_eq_iff
3385 real_squared_diff_one_factored ~> square_diff_one_factored
3386 realpow_two_diff ~> square_diff_square_factored
3387 reals_complete2 ~> complete_real
3388 real_sum_squared_expand ~> power2_sum
3389 exp_ln_eq ~> ln_unique
3391 expi_zero ~> exp_zero
3392 lemma_DERIV_subst ~> DERIV_cong
3393 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3394 LIMSEQ_const ~> tendsto_const
3395 LIMSEQ_norm ~> tendsto_norm
3396 LIMSEQ_add ~> tendsto_add
3397 LIMSEQ_minus ~> tendsto_minus
3398 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3399 LIMSEQ_diff ~> tendsto_diff
3400 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3401 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3402 LIMSEQ_mult ~> tendsto_mult
3403 LIMSEQ_inverse ~> tendsto_inverse
3404 LIMSEQ_divide ~> tendsto_divide
3405 LIMSEQ_pow ~> tendsto_power
3406 LIMSEQ_setsum ~> tendsto_setsum
3407 LIMSEQ_setprod ~> tendsto_setprod
3408 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3409 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3410 LIMSEQ_imp_rabs ~> tendsto_rabs
3411 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3412 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3413 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3414 LIMSEQ_Complex ~> tendsto_Complex
3415 LIM_ident ~> tendsto_ident_at
3416 LIM_const ~> tendsto_const
3417 LIM_add ~> tendsto_add
3418 LIM_add_zero ~> tendsto_add_zero
3419 LIM_minus ~> tendsto_minus
3420 LIM_diff ~> tendsto_diff
3421 LIM_norm ~> tendsto_norm
3422 LIM_norm_zero ~> tendsto_norm_zero
3423 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3424 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3425 LIM_rabs ~> tendsto_rabs
3426 LIM_rabs_zero ~> tendsto_rabs_zero
3427 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3428 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3429 LIM_compose ~> tendsto_compose
3430 LIM_mult ~> tendsto_mult
3431 LIM_scaleR ~> tendsto_scaleR
3432 LIM_of_real ~> tendsto_of_real
3433 LIM_power ~> tendsto_power
3434 LIM_inverse ~> tendsto_inverse
3435 LIM_sgn ~> tendsto_sgn
3436 isCont_LIM_compose ~> isCont_tendsto_compose
3437 bounded_linear.LIM ~> bounded_linear.tendsto
3438 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3439 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3440 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3441 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3442 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3443 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3445 * Theory Complex_Main: The definition of infinite series was
3446 generalized. Now it is defined on the type class {topological_space,
3447 comm_monoid_add}. Hence it is useable also for extended real numbers.
3449 * Theory Complex_Main: The complex exponential function "expi" is now
3450 a type-constrained abbreviation for "exp :: complex => complex"; thus
3451 several polymorphic lemmas about "exp" are now applicable to "expi".
3455 - Theory Library/Code_Char_ord provides native ordering of
3456 characters in the target language.
3458 - Commands code_module and code_library are legacy, use export_code
3461 - Method "evaluation" is legacy, use method "eval" instead.
3463 - Legacy evaluator "SML" is deactivated by default. May be
3464 reactivated by the following theory command:
3466 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3468 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3470 * New proof method "induction" that gives induction hypotheses the
3471 name "IH", thus distinguishing them from further hypotheses that come
3472 from rule induction. The latter are still called "hyps". Method
3473 "induction" is a thin wrapper around "induct" and follows the same
3476 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3477 still available as a legacy feature for some time.
3480 - Added "need" and "total_consts" options.
3481 - Reintroduced "show_skolems" option by popular demand.
3482 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3486 - Use quasi-sound (and efficient) translations by default.
3487 - Added support for the following provers: E-ToFoF, LEO-II,
3488 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3489 - Automatically preplay and minimize proofs before showing them if
3490 this can be done within reasonable time.
3491 - sledgehammer available_provers ~> sledgehammer supported_provers.
3493 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3494 "max_mono_iters", and "max_new_mono_instances" options.
3495 - Removed "explicit_apply" and "full_types" options as well as "Full
3496 Types" Proof General menu item. INCOMPATIBILITY.
3499 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3500 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3504 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3505 "elim:" options. INCOMPATIBILITY.
3506 - Introduced 'try' that not only runs 'try_methods' but also
3507 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3510 - Added "eval" option to evaluate terms for the found counterexample
3511 (currently only supported by the default (exhaustive) tester).
3512 - Added post-processing of terms to obtain readable counterexamples
3513 (currently only supported by the default (exhaustive) tester).
3514 - New counterexample generator quickcheck[narrowing] enables
3515 narrowing-based testing. Requires the Glasgow Haskell compiler
3516 with its installation location defined in the Isabelle settings
3517 environment as ISABELLE_GHC.
3518 - Removed quickcheck tester "SML" based on the SML code generator
3519 (formly in HOL/Library).
3521 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3522 use 'partial_function' instead.
3524 * Theory Library/Extended_Reals replaces now the positive extended
3525 reals found in probability theory. This file is extended by
3526 Multivariate_Analysis/Extended_Real_Limits.
3528 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3529 from where it must be imported explicitly if it is really required.
3532 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3533 been moved here. INCOMPATIBILITY.
3535 * Theory Library/Saturated provides type of numbers with saturated
3538 * Theory Library/Product_Lattice defines a pointwise ordering for the
3539 product type 'a * 'b, and provides instance proofs for various order
3540 and lattice type classes.
3542 * Theory Library/Countable now provides the "countable_datatype" proof
3543 method for proving "countable" class instances for datatypes.
3545 * Theory Library/Cset_Monad allows do notation for computable sets
3546 (cset) via the generic monad ad-hoc overloading facility.
3548 * Library: Theories of common data structures are split into theories
3549 for implementation, an invariant-ensuring type, and connection to an
3550 abstract type. INCOMPATIBILITY.
3552 - RBT is split into RBT and RBT_Mapping.
3553 - AssocList is split and renamed into AList and AList_Mapping.
3554 - DList is split into DList_Impl, DList, and DList_Cset.
3555 - Cset is split into Cset and List_Cset.
3557 * Theory Library/Nat_Infinity has been renamed to
3558 Library/Extended_Nat, with name changes of the following types and
3561 type inat ~> type enat
3563 Infty ~> infinity (overloaded)
3567 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3568 been renamed accordingly. INCOMPATIBILITY.
3570 * Session Multivariate_Analysis: The euclidean_space type class now
3571 fixes a constant "Basis :: 'a set" consisting of the standard
3572 orthonormal basis for the type. Users now have the option of
3573 quantifying over this set instead of using the "basis" function, e.g.
3574 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3576 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3577 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3578 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3579 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3580 changed to match. Definition theorems for overloaded constants now use
3581 the standard "foo_vec_def" naming scheme. A few other theorems have
3582 been renamed as follows (INCOMPATIBILITY):
3584 Cart_eq ~> vec_eq_iff
3585 dist_nth_le_cart ~> dist_vec_nth_le
3586 tendsto_vector ~> vec_tendstoI
3587 Cauchy_vector ~> vec_CauchyI
3589 * Session Multivariate_Analysis: Several duplicate theorems have been
3590 removed, and other theorems have been renamed or replaced with more
3591 general versions. INCOMPATIBILITY.
3593 finite_choice ~> finite_set_choice
3594 eventually_conjI ~> eventually_conj
3595 eventually_and ~> eventually_conj_iff
3596 eventually_false ~> eventually_False
3597 setsum_norm ~> norm_setsum
3598 Lim_sequentially ~> LIMSEQ_def
3599 Lim_ident_at ~> LIM_ident
3600 Lim_const ~> tendsto_const
3601 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3602 Lim_neg ~> tendsto_minus
3603 Lim_add ~> tendsto_add
3604 Lim_sub ~> tendsto_diff
3605 Lim_mul ~> tendsto_scaleR
3606 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3607 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3608 Lim_linear ~> bounded_linear.tendsto
3609 Lim_component ~> tendsto_euclidean_component
3610 Lim_component_cart ~> tendsto_vec_nth
3611 Lim_inner ~> tendsto_inner [OF tendsto_const]
3612 dot_lsum ~> inner_setsum_left
3613 dot_rsum ~> inner_setsum_right
3614 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3615 continuous_neg ~> continuous_minus
3616 continuous_sub ~> continuous_diff
3617 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3618 continuous_mul ~> continuous_scaleR
3619 continuous_inv ~> continuous_inverse
3620 continuous_at_within_inv ~> continuous_at_within_inverse
3621 continuous_at_inv ~> continuous_at_inverse
3622 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3623 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3624 continuous_at_component ~> continuous_component [OF continuous_at_id]
3625 continuous_on_neg ~> continuous_on_minus
3626 continuous_on_sub ~> continuous_on_diff
3627 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3628 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3629 continuous_on_mul ~> continuous_on_scaleR
3630 continuous_on_mul_real ~> continuous_on_mult
3631 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3632 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3633 continuous_on_inverse ~> continuous_on_inv
3634 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3635 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3636 subset_interior ~> interior_mono
3637 subset_closure ~> closure_mono
3638 closure_univ ~> closure_UNIV
3639 real_arch_lt ~> reals_Archimedean2
3640 real_arch ~> reals_Archimedean3
3641 real_abs_norm ~> abs_norm_cancel
3642 real_abs_sub_norm ~> norm_triangle_ineq3
3643 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3645 * Session HOL-Probability:
3646 - Caratheodory's extension lemma is now proved for ring_of_sets.
3647 - Infinite products of probability measures are now available.
3648 - Sigma closure is independent, if the generator is independent
3649 - Use extended reals instead of positive extended
3650 reals. INCOMPATIBILITY.
3652 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3654 expand_fun_below ~> fun_below_iff
3655 below_fun_ext ~> fun_belowI
3656 expand_cfun_eq ~> cfun_eq_iff
3657 ext_cfun ~> cfun_eqI
3658 expand_cfun_below ~> cfun_below_iff
3659 below_cfun_ext ~> cfun_belowI
3660 monofun_fun_fun ~> fun_belowD
3661 monofun_fun_arg ~> monofunE
3662 monofun_lub_fun ~> adm_monofun [THEN admD]
3663 cont_lub_fun ~> adm_cont [THEN admD]
3664 cont2cont_Rep_CFun ~> cont2cont_APP
3665 cont_Rep_CFun_app ~> cont_APP_app
3666 cont_Rep_CFun_app_app ~> cont_APP_app_app
3667 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3668 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3669 contlub_cfun ~> lub_APP [symmetric]
3670 contlub_LAM ~> lub_LAM [symmetric]
3673 lift_distinct1 ~> lift.distinct(1)
3674 lift_distinct2 ~> lift.distinct(2)
3675 Def_not_UU ~> lift.distinct(2)
3676 Def_inject ~> lift.inject
3677 below_UU_iff ~> below_bottom_iff
3678 eq_UU_iff ~> eq_bottom_iff
3681 *** Document preparation ***
3683 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3684 isar-ref manual, both for description and actual application of the
3687 * Antiquotation @{value} evaluates the given term and presents its
3690 * Antiquotations: term style "isub" provides ad-hoc conversion of
3691 variables x1, y23 into subscripted form x\<^isub>1,
3692 y\<^isub>2\<^isub>3.
3694 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3695 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3697 * Localized \isabellestyle switch can be used within blocks or groups
3700 \isabellestyle{it} %preferred default
3701 {\isabellestylett @{text "typewriter stuff"}}
3703 * Discontinued special treatment of hard tabulators. Implicit
3704 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3710 * The inner syntax of sort/type/term/prop supports inlined YXML
3711 representations within quoted string tokens. By encoding logical
3712 entities via Term_XML (in ML or Scala) concrete syntax can be
3713 bypassed, which is particularly useful for producing bits of text
3714 under external program control.
3716 * Antiquotations for ML and document preparation are managed as theory
3717 data, which requires explicit setup.
3719 * Isabelle_Process.is_active allows tools to check if the official
3720 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3721 (better known as Proof General).
3723 * Structure Proof_Context follows standard naming scheme. Old
3724 ProofContext is still available for some time as legacy alias.
3726 * Structure Timing provides various operations for timing; supersedes
3727 former start_timing/end_timing etc.
3729 * Path.print is the official way to show file-system paths to users
3730 (including quotes etc.).
3732 * Inner syntax: identifiers in parse trees of generic categories
3733 "logic", "aprop", "idt" etc. carry position information (disguised as
3734 type constraints). Occasional INCOMPATIBILITY with non-compliant
3735 translations that choke on unexpected type constraints. Positions can
3736 be stripped in ML translations via Syntax.strip_positions /
3737 Syntax.strip_positions_ast, or via the syntax constant
3738 "_strip_positions" within parse trees. As last resort, positions can
3739 be disabled via the configuration option Syntax.positions, which is
3740 called "syntax_positions" in Isar attribute syntax.
3742 * Discontinued special status of various ML structures that contribute
3743 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3744 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3745 refer directly to Ast.Constant, Lexicon.is_identifier,
3746 Syntax_Trans.mk_binder_tr etc.
3748 * Typed print translation: discontinued show_sorts argument, which is
3749 already available via context of "advanced" translation.
3751 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3752 goal states; body tactic needs to address all subgoals uniformly.
3754 * Slightly more special eq_list/eq_set, with shortcut involving
3755 pointer equality (assumes that eq relation is reflexive).
3757 * Classical tactics use proper Proof.context instead of historic types
3758 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3759 operate directly on Proof.context. Raw type claset retains its use as
3760 snapshot of the classical context, which can be recovered via
3761 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3762 INCOMPATIBILITY, classical tactics and derived proof methods require
3763 proper Proof.context.
3768 * Discontinued support for Poly/ML 5.2, which was the last version
3769 without proper multithreading and TimeLimit implementation.
3771 * Discontinued old lib/scripts/polyml-platform, which has been
3772 obsolete since Isabelle2009-2.
3774 * Various optional external tools are referenced more robustly and
3775 uniformly by explicit Isabelle settings as follows:
3777 ISABELLE_CSDP (formerly CSDP_EXE)
3778 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3779 ISABELLE_OCAML (formerly EXEC_OCAML)
3780 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3781 ISABELLE_YAP (formerly EXEC_YAP)
3783 Note that automated detection from the file-system or search path has
3784 been discontinued. INCOMPATIBILITY.
3786 * Scala layer provides JVM method invocation service for static
3787 methods of type (String)String, see Invoke_Scala.method in ML. For
3790 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3792 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3793 this allows to pass structured values between ML and Scala.
3795 * The IsabelleText fonts includes some further glyphs to support the
3796 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3797 installed a local copy (which is normally *not* required) need to
3798 delete or update it from ~~/lib/fonts/.
3802 New in Isabelle2011 (January 2011)
3803 ----------------------------------
3807 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3808 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3809 useful tooltips and hyperlinks produced from its static analysis. The
3810 bundled component provides an executable Isabelle tool that can be run
3813 Isabelle2011/bin/isabelle jedit
3815 * Significantly improved Isabelle/Isar implementation manual.
3817 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3818 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3819 while the default heap location within that directory lacks that extra
3820 suffix. This isolates multiple Isabelle installations from each
3821 other, avoiding problems with old settings in new versions.
3822 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3824 * Source files are always encoded as UTF-8, instead of old-fashioned
3825 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3826 the following package declarations:
3828 \usepackage[utf8]{inputenc}
3829 \usepackage{textcomp}
3831 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3832 a Unicode character is treated as a single symbol, not a sequence of
3833 non-ASCII bytes as before. Since Isabelle/ML string literals may
3834 contain symbols without further backslash escapes, Unicode can now be
3835 used here as well. Recall that Symbol.explode in ML provides a
3836 consistent view on symbols, while raw explode (or String.explode)
3837 merely give a byte-oriented representation.
3839 * Theory loader: source files are primarily located via the master
3840 directory of each theory node (where the .thy file itself resides).
3841 The global load path is still partially available as legacy feature.
3842 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3843 explicit paths, relatively to the theory.
3845 * Special treatment of ML file names has been discontinued.
3846 Historically, optional extensions .ML or .sml were added on demand --
3847 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3848 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3850 * Various options that affect pretty printing etc. are now properly
3851 handled within the context via configuration options, instead of
3852 unsynchronized references or print modes. There are both ML Config.T
3853 entities and Isar declaration attributes to access these.
3855 ML (Config.T) Isar (attribute)
3857 eta_contract eta_contract
3858 show_brackets show_brackets
3859 show_sorts show_sorts
3860 show_types show_types
3861 show_question_marks show_question_marks
3862 show_consts show_consts
3863 show_abbrevs show_abbrevs
3865 Syntax.ast_trace syntax_ast_trace
3866 Syntax.ast_stat syntax_ast_stat
3867 Syntax.ambiguity_level syntax_ambiguity_level
3869 Goal_Display.goals_limit goals_limit
3870 Goal_Display.show_main_goal show_main_goal
3872 Method.rule_trace rule_trace
3874 Thy_Output.display thy_output_display
3875 Thy_Output.quotes thy_output_quotes
3876 Thy_Output.indent thy_output_indent
3877 Thy_Output.source thy_output_source
3878 Thy_Output.break thy_output_break
3880 Note that corresponding "..._default" references in ML may only be
3881 changed globally at the ROOT session setup, but *not* within a theory.
3882 The option "show_abbrevs" supersedes the former print mode
3883 "no_abbrevs" with inverted meaning.
3885 * More systematic naming of some configuration options.
3888 trace_simp ~> simp_trace
3889 debug_simp ~> simp_debug
3891 * Support for real valued configuration options, using simplistic
3892 floating-point notation that coincides with the inner syntax for
3895 * Support for real valued preferences (with approximative PGIP type):
3896 front-ends need to accept "pgint" values in float notation.
3899 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3902 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3907 * Command 'type_synonym' (with single argument) replaces somewhat
3908 outdated 'types', which is still available as legacy feature for some
3911 * Command 'nonterminal' (with 'and' separated list of arguments)
3912 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3914 * Command 'notepad' replaces former 'example_proof' for
3915 experimentation in Isar without any result. INCOMPATIBILITY.
3917 * Locale interpretation commands 'interpret' and 'sublocale' accept
3918 lists of equations to map definitions in a locale to appropriate
3919 entities in the context of the interpretation. The 'interpretation'
3920 command already provided this functionality.
3922 * Diagnostic command 'print_dependencies' prints the locale instances
3923 that would be activated if the specified expression was interpreted in
3924 the current context. Variant "print_dependencies!" assumes a context
3925 without interpretations.
3927 * Diagnostic command 'print_interps' prints interpretations in proofs
3928 in addition to interpretations in theories.
3930 * Discontinued obsolete 'global' and 'local' commands to manipulate
3931 the theory name space. Rare INCOMPATIBILITY. The ML functions
3932 Sign.root_path and Sign.local_path may be applied directly where this
3933 feature is still required for historical reasons.
3935 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3936 'definition' instead.
3938 * The "prems" fact, which refers to the accidental collection of
3939 foundational premises in the context, is now explicitly marked as
3940 legacy feature and will be discontinued soon. Consider using "assms"
3941 of the head statement or reference facts by explicit names.
3943 * Document antiquotations @{class} and @{type} print classes and type
3946 * Document antiquotation @{file} checks file/directory entries within
3947 the local file system.
3952 * Coercive subtyping: functions can be declared as coercions and type
3953 inference will add them as necessary upon input of a term. Theory
3954 Complex_Main declares real :: nat => real and real :: int => real as
3955 coercions. A coercion function f is declared like this:
3957 declare [[coercion f]]
3959 To lift coercions through type constructors (e.g. from nat => real to
3960 nat list => real list), map functions can be declared, e.g.
3962 declare [[coercion_map map]]
3964 Currently coercion inference is activated only in theories including
3965 real numbers, i.e. descendants of Complex_Main. This is controlled by
3966 the configuration option "coercion_enabled", e.g. it can be enabled in
3967 other theories like this:
3969 declare [[coercion_enabled]]
3971 * Command 'partial_function' provides basic support for recursive
3972 function definitions over complete partial orders. Concrete instances
3973 are provided for i) the option type, ii) tail recursion on arbitrary
3974 types, and iii) the heap monad of Imperative_HOL. See
3975 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3978 * Function package: f.psimps rules are no longer implicitly declared
3979 as [simp]. INCOMPATIBILITY.
3981 * Datatype package: theorems generated for executable equality (class
3982 "eq") carry proper names and are treated as default code equations.
3984 * Inductive package: now offers command 'inductive_simps' to
3985 automatically derive instantiated and simplified equations for
3986 inductive predicates, similar to 'inductive_cases'.
3988 * Command 'enriched_type' allows to register properties of the
3989 functorial structure of types.
3991 * Improved infrastructure for term evaluation using code generator
3992 techniques, in particular static evaluation conversions.
3994 * Code generator: Scala (2.8 or higher) has been added to the target
3997 * Code generator: globbing constant expressions "*" and "Theory.*"
3998 have been replaced by the more idiomatic "_" and "Theory._".
4001 * Code generator: export_code without explicit file declaration prints
4002 to standard output. INCOMPATIBILITY.
4004 * Code generator: do not print function definitions for case
4005 combinators any longer.
4007 * Code generator: simplification with rules determined with
4008 src/Tools/Code/code_simp.ML and method "code_simp".
4010 * Code generator for records: more idiomatic representation of record
4011 types. Warning: records are not covered by ancient SML code
4012 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
4013 rep_datatype declaration helps to succeed then:
4017 rep_datatype foo_ext ...
4019 * Records: logical foundation type for records does not carry a
4020 '_type' suffix any longer (obsolete due to authentic syntax).
4023 * Quickcheck now by default uses exhaustive testing instead of random
4024 testing. Random testing can be invoked by "quickcheck [random]",
4025 exhaustive testing by "quickcheck [exhaustive]".
4027 * Quickcheck instantiates polymorphic types with small finite
4028 datatypes by default. This enables a simple execution mechanism to
4029 handle quantifiers and function equality over the finite datatypes.
4031 * Quickcheck random generator has been renamed from "code" to
4032 "random". INCOMPATIBILITY.
4034 * Quickcheck now has a configurable time limit which is set to 30
4035 seconds by default. This can be changed by adding [timeout = n] to the
4036 quickcheck command. The time limit for Auto Quickcheck is still set
4039 * Quickcheck in locales considers interpretations of that locale for
4040 counter example search.
4043 - Added "smt" and "remote_smt" provers based on the "smt" proof
4044 method. See the Sledgehammer manual for details ("isabelle doc
4047 sledgehammer atp_info ~> sledgehammer running_provers
4048 sledgehammer atp_kill ~> sledgehammer kill_provers
4049 sledgehammer available_atps ~> sledgehammer available_provers
4052 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
4053 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
4054 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
4055 (and "ms" and "min" are no longer supported)
4060 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
4061 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
4063 - Added support for partial quotient types.
4064 - Added local versions of the "Nitpick.register_xxx" functions.
4065 - Added "whack" option.
4066 - Allow registration of quotient types as codatatypes.
4067 - Improved "merge_type_vars" option to merge more types.
4068 - Removed unsound "fast_descrs" option.
4069 - Added custom symmetry breaking for datatypes, making it possible to reach
4070 higher cardinalities.
4071 - Prevent the expansion of too large definitions.
4073 * Proof methods "metis" and "meson" now have configuration options
4074 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
4075 to diagnose these tools. E.g.
4077 using [[metis_trace = true]]
4079 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
4080 manually as command 'solve_direct'.
4082 * The default SMT solver Z3 must be enabled explicitly (due to
4083 licensing issues) by setting the environment variable
4084 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
4085 commercial applications, the SMT solver CVC3 is provided as fall-back;
4086 changing the SMT solver is done via the configuration option
4089 * Remote SMT solvers need to be referred to by the "remote_" prefix,
4090 i.e. "remote_cvc3" and "remote_z3".
4092 * Added basic SMT support for datatypes, records, and typedefs using
4093 the oracle mode (no proofs). Direct support of pairs has been dropped
4094 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
4095 support for a similar behavior). Minor INCOMPATIBILITY.
4097 * Changed SMT configuration options:
4099 z3_proofs ~> smt_oracle (with inverted meaning)
4100 z3_trace_assms ~> smt_trace_used_facts
4113 * Boogie output files (.b2i files) need to be declared in the theory
4116 * Simplification procedure "list_to_set_comprehension" rewrites list
4117 comprehensions applied to List.set to set comprehensions. Occasional
4118 INCOMPATIBILITY, may be deactivated like this:
4120 declare [[simproc del: list_to_set_comprehension]]
4122 * Removed old version of primrec package. INCOMPATIBILITY.
4124 * Removed simplifier congruence rule of "prod_case", as has for long
4125 been the case with "split". INCOMPATIBILITY.
4127 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
4129 * Removed [split_format ... and ... and ...] version of
4130 [split_format]. Potential INCOMPATIBILITY.
4132 * Predicate "sorted" now defined inductively, with nice induction
4133 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
4135 * Constant "contents" renamed to "the_elem", to free the generic name
4136 contents for other uses. INCOMPATIBILITY.
4138 * Renamed class eq and constant eq (for code generation) to class
4139 equal and constant equal, plus renaming of related facts and various
4140 tuning. INCOMPATIBILITY.
4142 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
4144 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
4147 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
4148 avoid confusion with finite sets. INCOMPATIBILITY.
4150 * Abandoned locales equiv, congruent and congruent2 for equivalence
4151 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
4154 * Some previously unqualified names have been qualified:
4161 Trueprop ~> HOL.Trueprop
4166 op --> ~> HOL.implies
4178 Pair ~> Product_Type.Pair
4179 fst ~> Product_Type.fst
4180 snd ~> Product_Type.snd
4181 curry ~> Product_Type.curry
4183 Collect ~> Set.Collect
4187 * More canonical naming convention for some fundamental definitions:
4189 bot_bool_eq ~> bot_bool_def
4190 top_bool_eq ~> top_bool_def
4191 inf_bool_eq ~> inf_bool_def
4192 sup_bool_eq ~> sup_bool_def
4193 bot_fun_eq ~> bot_fun_def
4194 top_fun_eq ~> top_fun_def
4195 inf_fun_eq ~> inf_fun_def
4196 sup_fun_eq ~> sup_fun_def
4200 * More stylized fact names:
4202 expand_fun_eq ~> fun_eq_iff
4203 expand_set_eq ~> set_eq_iff
4205 nat_number ~> eval_nat_numeral
4209 * Refactoring of code-generation specific operations in theory List:
4215 mem_iff ~> member_def
4216 null_empty ~> null_def
4218 INCOMPATIBILITY. Note that these were not supposed to be used
4219 regularly unless for striking reasons; their main purpose was code
4222 Various operations from the Haskell prelude are used for generating
4225 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
4226 "surj f" is now an abbreviation of "range f = UNIV". The theorems
4227 bij_def and surj_def are unchanged. INCOMPATIBILITY.
4229 * Abolished some non-alphabetic type names: "prod" and "sum" replace
4230 "*" and "+" respectively. INCOMPATIBILITY.
4232 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
4233 "Sum_Type.Plus" instead.
4235 * Constant "split" has been merged with constant "prod_case"; names of
4236 ML functions, facts etc. involving split have been retained so far,
4237 though. INCOMPATIBILITY.
4239 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
4240 instead. INCOMPATIBILITY.
4242 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
4245 * Former theory Library/Enum is now part of the HOL-Main image.
4246 INCOMPATIBILITY: all constants of the Enum theory now have to be
4247 referred to by its qualified name.
4250 nlists ~> Enum.nlists
4251 product ~> Enum.product
4253 * Theory Library/Monad_Syntax provides do-syntax for monad types.
4254 Syntax in Library/State_Monad has been changed to avoid ambiguities.
4257 * Theory Library/SetsAndFunctions has been split into
4258 Library/Function_Algebras and Library/Set_Algebras; canonical names
4259 for instance definitions for functions; various improvements.
4262 * Theory Library/Multiset provides stable quicksort implementation of
4265 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
4268 * Session Multivariate_Analysis: introduced a type class for euclidean
4269 space. Most theorems are now stated in terms of euclidean spaces
4270 instead of finite cartesian products.
4273 real ^ 'n ~> 'a::real_vector
4274 ~> 'a::euclidean_space
4275 ~> 'a::ordered_euclidean_space
4276 (depends on your needs)
4280 \<chi> x. _ ~> \<chi>\<chi> x. _
4283 Also note that the indices are now natural numbers and not from some
4284 finite type. Finite cartesian products of euclidean spaces, products
4285 of euclidean spaces the real and complex numbers are instantiated to
4286 be euclidean_spaces. INCOMPATIBILITY.
4288 * Session Probability: introduced pextreal as positive extended real
4289 numbers. Use pextreal as value for measures. Introduce the
4290 Radon-Nikodym derivative, product spaces and Fubini's theorem for
4291 arbitrary sigma finite measures. Introduces Lebesgue measure based on
4292 the integral in Multivariate Analysis. INCOMPATIBILITY.
4294 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
4297 * Session SPARK (with image HOL-SPARK) provides commands to load and
4298 prove verification conditions generated by the SPARK Ada program
4299 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
4304 * Theorems for additive ring operations (locale abelian_monoid and
4305 descendants) are generated by interpretation from their multiplicative
4306 counterparts. Names (in particular theorem names) have the mandatory
4307 qualifier 'add'. Previous theorem names are redeclared for
4310 * Structure "int_ring" is now an abbreviation (previously a
4311 definition). This fits more natural with advanced interpretations.
4316 * The domain package now runs in definitional mode by default: The
4317 former command 'new_domain' is now called 'domain'. To use the domain
4318 package in its original axiomatic mode, use 'domain (unsafe)'.
4321 * The new class "domain" is now the default sort. Class "predomain"
4322 is an unpointed version of "domain". Theories can be updated by
4323 replacing sort annotations as shown below. INCOMPATIBILITY.
4325 'a::type ~> 'a::countable
4326 'a::cpo ~> 'a::predomain
4327 'a::pcpo ~> 'a::domain
4329 * The old type class "rep" has been superseded by class "domain".
4330 Accordingly, users of the definitional package must remove any
4331 "default_sort rep" declarations. INCOMPATIBILITY.
4333 * The domain package (definitional mode) now supports unpointed
4334 predomain argument types, as long as they are marked 'lazy'. (Strict
4335 arguments must be in class "domain".) For example, the following
4336 domain definition now works:
4338 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4340 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4341 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4342 'a option, and 'a list. Additionally, it configures fixrec and the
4343 domain package to work with these types. For example:
4345 fixrec isInl :: "('a + 'b) u -> tr"
4346 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4348 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4350 * The "(permissive)" option of fixrec has been replaced with a
4351 per-equation "(unchecked)" option. See
4352 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4354 * The "bifinite" class no longer fixes a constant "approx"; the class
4355 now just asserts that such a function exists. INCOMPATIBILITY.
4357 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4358 defines an embedding of type 'a defl into udom by default; instances
4359 of "bifinite" and "domain" classes are available in
4360 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4362 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4364 * The predicate "directed" has been removed. INCOMPATIBILITY.
4366 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4368 * The function "cprod_map" has been renamed to "prod_map".
4371 * The monadic bind operator on each powerdomain has new binder syntax
4372 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4373 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4375 * The infix syntax for binary union on each powerdomain has changed
4376 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4377 syntax. INCOMPATIBILITY.
4379 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4380 still supported as an input translation.
4382 * Renamed some theorems (the original names are also still available).
4384 expand_fun_below ~> fun_below_iff
4385 below_fun_ext ~> fun_belowI
4386 expand_cfun_eq ~> cfun_eq_iff
4387 ext_cfun ~> cfun_eqI
4388 expand_cfun_below ~> cfun_below_iff
4389 below_cfun_ext ~> cfun_belowI
4390 cont2cont_Rep_CFun ~> cont2cont_APP
4392 * The Abs and Rep functions for various types have changed names.
4393 Related theorem names have also changed to match. INCOMPATIBILITY.
4395 Rep_CFun ~> Rep_cfun
4396 Abs_CFun ~> Abs_cfun
4397 Rep_Sprod ~> Rep_sprod
4398 Abs_Sprod ~> Abs_sprod
4399 Rep_Ssum ~> Rep_ssum
4400 Abs_Ssum ~> Abs_ssum
4402 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4403 been renamed to *_bottom_iff. INCOMPATIBILITY.
4405 * Various changes to bisimulation/coinduction with domain package:
4407 - Definitions of "bisim" constants no longer mention definedness.
4408 - With mutual recursion, "bisim" predicate is now curried.
4409 - With mutual recursion, each type gets a separate coind theorem.
4410 - Variable names in bisim_def and coinduct rules have changed.
4414 * Case combinators generated by the domain package for type "foo" are
4415 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4417 * Several theorems have been renamed to more accurately reflect the
4418 names of constants and types involved. INCOMPATIBILITY.
4420 thelub_const ~> lub_const
4421 lub_const ~> is_lub_const
4423 is_lub_lub ~> is_lubD2
4425 unique_lub ~> is_lub_unique
4426 is_ub_lub ~> is_lub_rangeD1
4427 lub_bin_chain ~> is_lub_bin_chain
4428 lub_fun ~> is_lub_fun
4429 thelub_fun ~> lub_fun
4430 thelub_cfun ~> lub_cfun
4431 thelub_Pair ~> lub_Pair
4432 lub_cprod ~> is_lub_prod
4433 thelub_cprod ~> lub_prod
4434 minimal_cprod ~> minimal_prod
4435 inst_cprod_pcpo ~> inst_prod_pcpo
4437 compact_UU ~> compact_bottom
4438 deflation_UU ~> deflation_bottom
4439 finite_deflation_UU ~> finite_deflation_bottom
4441 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4443 sq_ord_less_eq_trans ~> below_eq_trans
4444 sq_ord_eq_less_trans ~> eq_below_trans
4445 refl_less ~> below_refl
4446 trans_less ~> below_trans
4447 antisym_less ~> below_antisym
4448 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4449 box_less ~> box_below
4450 rev_trans_less ~> rev_below_trans
4451 not_less2not_eq ~> not_below2not_eq
4452 less_UU_iff ~> below_UU_iff
4453 flat_less_iff ~> flat_below_iff
4454 adm_less ~> adm_below
4455 adm_not_less ~> adm_not_below
4456 adm_compact_not_less ~> adm_compact_not_below
4457 less_fun_def ~> below_fun_def
4458 expand_fun_less ~> fun_below_iff
4459 less_fun_ext ~> fun_belowI
4460 less_discr_def ~> below_discr_def
4461 discr_less_eq ~> discr_below_eq
4462 less_unit_def ~> below_unit_def
4463 less_cprod_def ~> below_prod_def
4464 prod_lessI ~> prod_belowI
4465 Pair_less_iff ~> Pair_below_iff
4466 fst_less_iff ~> fst_below_iff
4467 snd_less_iff ~> snd_below_iff
4468 expand_cfun_less ~> cfun_below_iff
4469 less_cfun_ext ~> cfun_belowI
4470 injection_less ~> injection_below
4471 less_up_def ~> below_up_def
4472 not_Iup_less ~> not_Iup_below
4473 Iup_less ~> Iup_below
4475 Def_inject_less_eq ~> Def_below_Def
4476 Def_less_is_eq ~> Def_below_iff
4477 spair_less_iff ~> spair_below_iff
4478 less_sprod ~> below_sprod
4479 spair_less ~> spair_below
4480 sfst_less_iff ~> sfst_below_iff
4481 ssnd_less_iff ~> ssnd_below_iff
4482 fix_least_less ~> fix_least_below
4483 dist_less_one ~> dist_below_one
4484 less_ONE ~> below_ONE
4485 ONE_less_iff ~> ONE_below_iff
4486 less_sinlD ~> below_sinlD
4487 less_sinrD ~> below_sinrD
4492 * All constant names are now qualified internally and use proper
4493 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4498 * Antiquotation @{assert} inlines a function bool -> unit that raises
4499 Fail if the argument is false. Due to inlining the source position of
4500 failed assertions is included in the error output.
4502 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4503 text is in practice always evaluated with a stable theory checkpoint.
4504 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4506 * Antiquotation @{theory A} refers to theory A from the ancestry of
4507 the current context, not any accidental theory loader state as before.
4508 Potential INCOMPATIBILITY, subtle change in semantics.
4510 * Syntax.pretty_priority (default 0) configures the required priority
4511 of pretty-printed output and thus affects insertion of parentheses.
4513 * Syntax.default_root (default "any") configures the inner syntax
4514 category (nonterminal symbol) for parsing of terms.
4516 * Former exception Library.UnequalLengths now coincides with
4517 ListPair.UnequalLengths.
4519 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4520 main functionality is provided by structure Simplifier.
4522 * Renamed raw "explode" function to "raw_explode" to emphasize its
4523 meaning. Note that internally to Isabelle, Symbol.explode is used in
4524 almost all situations.
4526 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4527 See implementation manual for further details on exceptions in
4530 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4533 * Renamed structure PureThy to Pure_Thy and moved most of its
4534 operations to structure Global_Theory, to emphasize that this is
4535 rarely-used global-only stuff.
4537 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4538 instead (or tracing for high-volume output).
4540 * Configuration option show_question_marks only affects regular pretty
4541 printing of types and terms, not raw Term.string_of_vname.
4543 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4544 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4545 @{thms} for most purposes.
4547 * ML structure Unsynchronized is never opened, not even in Isar
4548 interaction mode as before. Old Unsynchronized.set etc. have been
4549 discontinued -- use plain := instead. This should be *rare* anyway,
4550 since modern tools always work via official context data, notably
4551 configuration options.
4553 * Parallel and asynchronous execution requires special care concerning
4554 interrupts. Structure Exn provides some convenience functions that
4555 avoid working directly with raw Interrupt. User code must not absorb
4556 interrupts -- intermediate handling (for cleanup etc.) needs to be
4557 followed by re-raising of the original exception. Another common
4558 source of mistakes are "handle _" patterns, which make the meaning of
4559 the program subject to physical effects of the environment.
4563 New in Isabelle2009-2 (June 2010)
4564 ---------------------------------
4568 * Authentic syntax for *all* logical entities (type classes, type
4569 constructors, term constants): provides simple and robust
4570 correspondence between formal entities and concrete syntax. Within
4571 the parse tree / AST representations, "constants" are decorated by
4572 their category (class, type, const) and spelled out explicitly with
4573 their full internal name.
4575 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4576 and translations (translation rules and translation functions in ML).
4577 Some hints on upgrading:
4579 - Many existing uses of 'syntax' and 'translations' can be replaced
4580 by more modern 'type_notation', 'notation' and 'abbreviation',
4581 which are independent of this issue.
4583 - 'translations' require markup within the AST; the term syntax
4584 provides the following special forms:
4586 CONST c -- produces syntax version of constant c from context
4587 XCONST c -- literally c, checked as constant from context
4588 c -- literally c, if declared by 'syntax'
4590 Plain identifiers are treated as AST variables -- occasionally the
4591 system indicates accidental variables via the error "rhs contains
4594 Type classes and type constructors are marked according to their
4595 concrete syntax. Some old translations rules need to be written
4596 for the "type" category, using type constructor application
4597 instead of pseudo-term application of the default category
4600 - 'parse_translation' etc. in ML may use the following
4603 @{class_syntax c} -- type class c within parse tree / AST
4604 @{term_syntax c} -- type constructor c within parse tree / AST
4605 @{const_syntax c} -- ML version of "CONST c" above
4606 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4608 - Literal types within 'typed_print_translations', i.e. those *not*
4609 represented as pseudo-terms are represented verbatim. Use @{class
4610 c} or @{type_name c} here instead of the above syntax
4613 Note that old non-authentic syntax was based on unqualified base
4614 names, so all of the above "constant" names would coincide. Recall
4615 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4616 diagnose syntax problems.
4618 * Type constructors admit general mixfix syntax, not just infix.
4620 * Concrete syntax may be attached to local entities without a proof
4621 body, too. This works via regular mixfix annotations for 'fix',
4622 'def', 'obtain' etc. or via the explicit 'write' command, which is
4623 similar to the 'notation' command in theory specifications.
4625 * Discontinued unnamed infix syntax (legacy feature for many years) --
4626 need to specify constant name and syntax separately. Internal ML
4627 datatype constructors have been renamed from InfixName to Infix etc.
4628 Minor INCOMPATIBILITY.
4630 * Schematic theorem statements need to be explicitly markup as such,
4631 via commands 'schematic_lemma', 'schematic_theorem',
4632 'schematic_corollary'. Thus the relevance of the proof is made
4633 syntactically clear, which impacts performance in a parallel or
4634 asynchronous interactive environment. Minor INCOMPATIBILITY.
4636 * Use of cumulative prems via "!" in some proof methods has been
4637 discontinued (old legacy feature).
4639 * References 'trace_simp' and 'debug_simp' have been replaced by
4640 configuration options stored in the context. Enabling tracing (the
4641 case of debugging is similar) in proofs works via
4643 using [[trace_simp = true]]
4645 Tracing is then active for all invocations of the simplifier in
4646 subsequent goal refinement steps. Tracing may also still be enabled or
4647 disabled via the ProofGeneral settings menu.
4649 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4650 'hide_fact' replace the former 'hide' KIND command. Minor
4653 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4654 more efficient than combinations with -q1 or -q2.
4659 * Proofterms record type-class reasoning explicitly, using the
4660 "unconstrain" operation internally. This eliminates all sort
4661 constraints from a theorem and proof, introducing explicit
4662 OFCLASS-premises. On the proof term level, this operation is
4663 automatically applied at theorem boundaries, such that closed proofs
4664 are always free of sort constraints. INCOMPATIBILITY for tools that
4665 inspect proof terms.
4667 * Local theory specifications may depend on extra type variables that
4668 are not present in the result type -- arguments TYPE('a) :: 'a itself
4669 are added internally. For example:
4671 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4673 * Predicates of locales introduced by classes carry a mandatory
4674 "class" prefix. INCOMPATIBILITY.
4676 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4678 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4681 * Command 'code_reflect' allows to incorporate generated ML code into
4682 runtime environment; replaces immature code_datatype antiquotation.
4685 * Code generator: simple concept for abstract datatypes obeying
4688 * Code generator: details of internal data cache have no impact on the
4689 user space functionality any longer.
4691 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4692 subgoals. This is more appropriate for interpretations with 'where'.
4695 * Command 'example_proof' opens an empty proof body. This allows to
4696 experiment with Isar, without producing any persistent result.
4698 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4699 within a local theory context, with explicit checking of the
4700 constructors involved (in contrast to the raw 'syntax' versions).
4702 * Commands 'types' and 'typedecl' now work within a local theory
4703 context -- without introducing dependencies on parameters or
4704 assumptions, which is not possible in Isabelle/Pure.
4706 * Command 'defaultsort' has been renamed to 'default_sort', it works
4707 within a local theory context. Minor INCOMPATIBILITY.
4712 * Command 'typedef' now works within a local theory context -- without
4713 introducing dependencies on parameters or assumptions, which is not
4714 possible in Isabelle/Pure/HOL. Note that the logical environment may
4715 contain multiple interpretations of local typedefs (with different
4716 non-emptiness proofs), even in a global theory context.
4718 * New package for quotient types. Commands 'quotient_type' and
4719 'quotient_definition' may be used for defining types and constants by
4720 quotient constructions. An example is the type of integers created by
4721 quotienting pairs of natural numbers:
4724 intrel :: "(nat * nat) => (nat * nat) => bool"
4726 "intrel (x, y) (u, v) = (x + v = u + y)"
4728 quotient_type int = "nat * nat" / intrel
4729 by (auto simp add: equivp_def expand_fun_eq)
4732 "0::int" is "(0::nat, 0::nat)"
4734 The method "lifting" can be used to lift of theorems from the
4735 underlying "raw" type to the quotient type. The example
4736 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4737 construction and provides a reasoning infrastructure for finite sets.
4739 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4740 clash with new theory Quotient in Main HOL.
4742 * Moved the SMT binding into the main HOL session, eliminating
4743 separate HOL-SMT session.
4745 * List membership infix mem operation is only an input abbreviation.
4748 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4749 for future developements; former Library/Word.thy is still present in
4750 the AFP entry RSAPPS.
4752 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4753 longer shadowed. INCOMPATIBILITY.
4755 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4758 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4761 * Dropped normalizing_semiring etc; use the facts in semiring classes
4762 instead. INCOMPATIBILITY.
4764 * Dropped several real-specific versions of lemmas about floor and
4765 ceiling; use the generic lemmas from theory "Archimedean_Field"
4766 instead. INCOMPATIBILITY.
4768 floor_number_of_eq ~> floor_number_of
4769 le_floor_eq_number_of ~> number_of_le_floor
4770 le_floor_eq_zero ~> zero_le_floor
4771 le_floor_eq_one ~> one_le_floor
4772 floor_less_eq_number_of ~> floor_less_number_of
4773 floor_less_eq_zero ~> floor_less_zero
4774 floor_less_eq_one ~> floor_less_one
4775 less_floor_eq_number_of ~> number_of_less_floor
4776 less_floor_eq_zero ~> zero_less_floor
4777 less_floor_eq_one ~> one_less_floor
4778 floor_le_eq_number_of ~> floor_le_number_of
4779 floor_le_eq_zero ~> floor_le_zero
4780 floor_le_eq_one ~> floor_le_one
4781 floor_subtract_number_of ~> floor_diff_number_of
4782 floor_subtract_one ~> floor_diff_one
4783 ceiling_number_of_eq ~> ceiling_number_of
4784 ceiling_le_eq_number_of ~> ceiling_le_number_of
4785 ceiling_le_zero_eq ~> ceiling_le_zero
4786 ceiling_le_eq_one ~> ceiling_le_one
4787 less_ceiling_eq_number_of ~> number_of_less_ceiling
4788 less_ceiling_eq_zero ~> zero_less_ceiling
4789 less_ceiling_eq_one ~> one_less_ceiling
4790 ceiling_less_eq_number_of ~> ceiling_less_number_of
4791 ceiling_less_eq_zero ~> ceiling_less_zero
4792 ceiling_less_eq_one ~> ceiling_less_one
4793 le_ceiling_eq_number_of ~> number_of_le_ceiling
4794 le_ceiling_eq_zero ~> zero_le_ceiling
4795 le_ceiling_eq_one ~> one_le_ceiling
4796 ceiling_subtract_number_of ~> ceiling_diff_number_of
4797 ceiling_subtract_one ~> ceiling_diff_one
4799 * Theory "Finite_Set": various folding_XXX locales facilitate the
4800 application of the various fold combinators on finite sets.
4802 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4803 provides abstract red-black tree type which is backed by "RBT_Impl" as
4804 implementation. INCOMPATIBILTY.
4806 * Theory Library/Coinductive_List has been removed -- superseded by
4807 AFP/thys/Coinductive.
4809 * Theory PReal, including the type "preal" and related operations, has
4810 been removed. INCOMPATIBILITY.
4812 * Real: new development using Cauchy Sequences.
4814 * Split off theory "Big_Operators" containing setsum, setprod,
4815 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4817 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4818 "Int" etc. INCOMPATIBILITY.
4820 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4822 * New set of rules "ac_simps" provides combined assoc / commute
4823 rewrites for all interpretations of the appropriate generic locales.
4825 * Renamed theory "OrderedGroup" to "Groups" and split theory
4826 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4827 appropriate and more consistent names suitable for name prefixes
4828 within the HOL theories. INCOMPATIBILITY.
4830 * Some generic constants have been put to appropriate theories:
4831 - less_eq, less: Orderings
4832 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4833 - inverse, divide: Rings
4836 * More consistent naming of type classes involving orderings (and
4839 lower_semilattice ~> semilattice_inf
4840 upper_semilattice ~> semilattice_sup
4842 dense_linear_order ~> dense_linorder
4844 pordered_ab_group_add ~> ordered_ab_group_add
4845 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4846 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4847 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4848 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4849 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4850 pordered_cancel_semiring ~> ordered_cancel_semiring
4851 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4852 pordered_comm_ring ~> ordered_comm_ring
4853 pordered_comm_semiring ~> ordered_comm_semiring
4854 pordered_ring ~> ordered_ring
4855 pordered_ring_abs ~> ordered_ring_abs
4856 pordered_semiring ~> ordered_semiring
4858 ordered_ab_group_add ~> linordered_ab_group_add
4859 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4860 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4861 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4862 ordered_field ~> linordered_field
4863 ordered_field_no_lb ~> linordered_field_no_lb
4864 ordered_field_no_ub ~> linordered_field_no_ub
4865 ordered_field_dense_linear_order ~> dense_linordered_field
4866 ordered_idom ~> linordered_idom
4867 ordered_ring ~> linordered_ring
4868 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4869 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4870 ordered_ring_strict ~> linordered_ring_strict
4871 ordered_semidom ~> linordered_semidom
4872 ordered_semiring ~> linordered_semiring
4873 ordered_semiring_1 ~> linordered_semiring_1
4874 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4875 ordered_semiring_strict ~> linordered_semiring_strict
4877 The following slightly odd type classes have been moved to a
4878 separate theory Library/Lattice_Algebras:
4880 lordered_ab_group_add ~> lattice_ab_group_add
4881 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4882 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4883 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4884 lordered_ring ~> lattice_ring
4888 * Refined field classes:
4889 - classes division_ring_inverse_zero, field_inverse_zero,
4890 linordered_field_inverse_zero include rule inverse 0 = 0 --
4891 subsumes former division_by_zero class;
4892 - numerous lemmas have been ported from field to division_ring.
4895 * Refined algebra theorem collections:
4896 - dropped theorem group group_simps, use algebra_simps instead;
4897 - dropped theorem group ring_simps, use field_simps instead;
4898 - proper theorem collection field_simps subsumes former theorem
4899 groups field_eq_simps and field_simps;
4900 - dropped lemma eq_minus_self_iff which is a duplicate for
4904 * Theory Finite_Set and List: some lemmas have been generalized from
4907 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4908 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4909 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4910 union_Union_fold_union ~> sup_Sup_fold_sup
4911 Inter_fold_inter ~> Inf_fold_inf
4912 Union_fold_union ~> Sup_fold_sup
4913 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4914 union_UNION_fold_union ~> sup_SUPR_fold_sup
4915 INTER_fold_inter ~> INFI_fold_inf
4916 UNION_fold_union ~> SUPR_fold_sup
4918 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4919 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4920 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4921 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4922 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4923 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4925 * Reorganized theory Multiset: swapped notation of pointwise and
4928 - pointwise ordering is instance of class order with standard syntax
4930 - multiset ordering has syntax <=# and <#; partial order properties
4931 are provided by means of interpretation with prefix
4933 - less duplication, less historical organization of sections,
4934 conversion from associations lists to multisets, rudimentary code
4936 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4941 multiset_eq_conv_count_eq ~> multiset_ext_iff
4942 multi_count_ext ~> multiset_ext
4943 diff_union_inverse2 ~> diff_union_cancelR
4947 * Theory Permutation: replaced local "remove" by List.remove1.
4949 * Code generation: ML and OCaml code is decorated with signatures.
4951 * Theory List: added transpose.
4953 * Library/Nat_Bijection.thy is a collection of bijective functions
4954 between nat and other types, which supersedes the older libraries
4955 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4958 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4959 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4960 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4961 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4962 Countable.pair_encode ~> prod_encode
4963 NatIso.prod2nat ~> prod_encode
4964 NatIso.nat2prod ~> prod_decode
4965 NatIso.sum2nat ~> sum_encode
4966 NatIso.nat2sum ~> sum_decode
4967 NatIso.list2nat ~> list_encode
4968 NatIso.nat2list ~> list_decode
4969 NatIso.set2nat ~> set_encode
4970 NatIso.nat2set ~> set_decode
4973 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4974 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4975 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4976 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4977 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4978 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4979 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4980 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4981 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4982 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4983 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4984 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4985 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4988 - Renamed ATP commands:
4989 atp_info ~> sledgehammer running_atps
4990 atp_kill ~> sledgehammer kill_atps
4991 atp_messages ~> sledgehammer messages
4992 atp_minimize ~> sledgehammer minimize
4993 print_atps ~> sledgehammer available_atps
4995 - Added user's manual ("isabelle doc sledgehammer").
4996 - Added option syntax and "sledgehammer_params" to customize
4997 Sledgehammer's behavior. See the manual for details.
4998 - Modified the Isar proof reconstruction code so that it produces
4999 direct proofs rather than proofs by contradiction. (This feature
5000 is still experimental.)
5001 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
5003 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
5006 - Added and implemented "binary_ints" and "bits" options.
5007 - Added "std" option and implemented support for nonstandard models.
5008 - Added and implemented "finitize" option to improve the precision
5009 of infinite datatypes based on a monotonicity analysis.
5010 - Added support for quotient types.
5011 - Added support for "specification" and "ax_specification"
5013 - Added support for local definitions (for "function" and
5014 "termination" proofs).
5015 - Added support for term postprocessors.
5016 - Optimized "Multiset.multiset" and "FinFun.finfun".
5017 - Improved efficiency of "destroy_constrs" optimization.
5018 - Fixed soundness bugs related to "destroy_constrs" optimization and
5020 - Fixed soundness bug related to higher-order constructors.
5021 - Fixed soundness bug when "full_descrs" is enabled.
5022 - Improved precision of set constructs.
5023 - Added "atoms" option.
5024 - Added cache to speed up repeated Kodkod invocations on the same
5026 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
5027 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
5028 "SAT4J_Light". INCOMPATIBILITY.
5029 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
5030 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
5031 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
5033 * Method "induct" now takes instantiations of the form t, where t is not
5034 a variable, as a shorthand for "x == t", where x is a fresh variable.
5035 If this is not intended, t has to be enclosed in parentheses.
5036 By default, the equalities generated by definitional instantiations
5037 are pre-simplified, which may cause parameters of inductive cases
5038 to disappear, or may even delete some of the inductive cases.
5039 Use "induct (no_simp)" instead of "induct" to restore the old
5040 behaviour. The (no_simp) option is also understood by the "cases"
5041 and "nominal_induct" methods, which now perform pre-simplification, too.
5047 * Variable names in lemmas generated by the domain package have
5048 changed; the naming scheme is now consistent with the HOL datatype
5049 package. Some proof scripts may be affected, INCOMPATIBILITY.
5051 * The domain package no longer defines the function "foo_copy" for
5052 recursive domain "foo". The reach lemma is now stated directly in
5053 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
5054 be reformulated in terms of "foo_take", INCOMPATIBILITY.
5056 * Most definedness lemmas generated by the domain package (previously
5057 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
5058 like "foo$x = UU <-> x = UU", which works better as a simp rule.
5059 Proofs that used definedness lemmas as intro rules may break,
5060 potential INCOMPATIBILITY.
5062 * Induction and casedist rules generated by the domain package now
5063 declare proper case_names (one called "bottom", and one named for each
5064 constructor). INCOMPATIBILITY.
5066 * For mutually-recursive domains, separate "reach" and "take_lemma"
5067 rules are generated for each domain, INCOMPATIBILITY.
5069 foo_bar.reach ~> foo.reach bar.reach
5070 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
5072 * Some lemmas generated by the domain package have been renamed for
5073 consistency with the datatype package, INCOMPATIBILITY.
5075 foo.ind ~> foo.induct
5076 foo.finite_ind ~> foo.finite_induct
5077 foo.coind ~> foo.coinduct
5078 foo.casedist ~> foo.exhaust
5079 foo.exhaust ~> foo.nchotomy
5081 * For consistency with other definition packages, the fixrec package
5082 now generates qualified theorem names, INCOMPATIBILITY.
5084 foo_simps ~> foo.simps
5085 foo_unfold ~> foo.unfold
5086 foo_induct ~> foo.induct
5088 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
5089 method and internal fixrec proofs now use the default simpset instead.
5092 * The "contlub" predicate has been removed. Proof scripts should use
5093 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
5095 * The "admw" predicate has been removed, INCOMPATIBILITY.
5097 * The constants cpair, cfst, and csnd have been removed in favor of
5098 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
5103 * Antiquotations for basic formal entities:
5105 @{class NAME} -- type class
5106 @{class_syntax NAME} -- syntax representation of the above
5108 @{type_name NAME} -- logical type
5109 @{type_abbrev NAME} -- type abbreviation
5110 @{nonterminal NAME} -- type of concrete syntactic category
5111 @{type_syntax NAME} -- syntax representation of any of the above
5113 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
5114 @{const_abbrev NAME} -- abbreviated constant
5115 @{const_syntax NAME} -- syntax representation of any of the above
5117 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
5118 syntax constant (cf. 'syntax' command).
5120 * Antiquotation @{make_string} inlines a function to print arbitrary
5121 values similar to the ML toplevel. The result is compiler dependent
5122 and may fall back on "?" in certain situations.
5124 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
5125 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
5126 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
5127 not work with the asynchronous Isar document model.
5129 * Configuration options now admit dynamic default values, depending on
5130 the context or even global references.
5132 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
5133 uses an efficient external library if available (for Poly/ML).
5135 * Renamed some important ML structures, while keeping the old names
5136 for some time as aliases within the structure Legacy:
5138 OuterKeyword ~> Keyword
5141 OuterSyntax ~> Outer_Syntax
5142 PrintMode ~> Print_Mode
5143 SpecParse ~> Parse_Spec
5146 ThyOutput ~> Thy_Output
5147 TypeInfer ~> Type_Infer
5149 Note that "open Legacy" simplifies porting of sources, but forgetting
5150 to remove it again will complicate porting again in the future.
5152 * Most operations that refer to a global context are named
5153 accordingly, e.g. Simplifier.global_context or
5154 ProofContext.init_global. There are some situations where a global
5155 context actually works, but under normal circumstances one needs to
5156 pass the proper local context through the code!
5158 * Discontinued old TheoryDataFun with its copy/init operation -- data
5159 needs to be pure. Functor Theory_Data_PP retains the traditional
5160 Pretty.pp argument to merge, which is absent in the standard
5161 Theory_Data version.
5163 * Sorts.certify_sort and derived "cert" operations for types and terms
5164 no longer minimize sorts. Thus certification at the boundary of the
5165 inference kernel becomes invariant under addition of class relations,
5166 which is an important monotonicity principle. Sorts are now minimized
5167 in the syntax layer only, at the boundary between the end-user and the
5168 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
5169 explicitly in rare situations.
5171 * Renamed old-style Drule.standard to Drule.export_without_context, to
5172 emphasize that this is in no way a standard operation.
5175 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
5176 usual for resolution. Rare INCOMPATIBILITY.
5178 * Renamed varify/unvarify operations to varify_global/unvarify_global
5179 to emphasize that these only work in a global situation (which is
5182 * Curried take and drop in library.ML; negative length is interpreted
5183 as infinity (as in chop). Subtle INCOMPATIBILITY.
5185 * Proof terms: type substitutions on proof constants now use canonical
5186 order of type variables. INCOMPATIBILITY for tools working with proof
5189 * Raw axioms/defs may no longer carry sort constraints, and raw defs
5190 may no longer carry premises. User-level specifications are
5191 transformed accordingly by Thm.add_axiom/add_def.
5196 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
5197 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
5198 proof terms are enabled unconditionally in the new HOL-Proofs image.
5200 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
5201 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
5204 * Old lib/scripts/polyml-platform is superseded by the
5205 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
5206 variant, even on a 64 bit machine. The following example setting
5207 prefers 64 bit if available:
5209 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
5211 * The preliminary Isabelle/jEdit application demonstrates the emerging
5212 Isabelle/Scala layer for advanced prover interaction and integration.
5213 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
5216 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
5217 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
5218 similar to the default assignment of the document preparation system
5219 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
5220 provides some operations for direct access to the font without asking
5221 the user for manual installation.
5225 New in Isabelle2009-1 (December 2009)
5226 -------------------------------------
5230 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
5231 one backslash should be used, even in ML sources.
5236 * Locale interpretation propagates mixins along the locale hierarchy.
5237 The currently only available mixins are the equations used to map
5238 local definitions to terms of the target domain of an interpretation.
5240 * Reactivated diagnostic command 'print_interps'. Use "print_interps
5241 loc" to print all interpretations of locale "loc" in the theory.
5242 Interpretations in proofs are not shown.
5244 * Thoroughly revised locales tutorial. New section on conditional
5247 * On instantiation of classes, remaining undefined class parameters
5248 are formally declared. INCOMPATIBILITY.
5251 *** Document preparation ***
5253 * New generalized style concept for printing terms: @{foo (style) ...}
5254 instead of @{foo_style style ...} (old form is still retained for
5255 backward compatibility). Styles can be also applied for
5256 antiquotations prop, term_type and typeof.
5261 * New proof method "smt" for a combination of first-order logic with
5262 equality, linear and nonlinear (natural/integer/real) arithmetic, and
5263 fixed-size bitvectors; there is also basic support for higher-order
5264 features (esp. lambda abstractions). It is an incomplete decision
5265 procedure based on external SMT solvers using the oracle mechanism;
5266 for the SMT solver Z3, this method is proof-producing. Certificates
5267 are provided to avoid calling the external solvers solely for
5268 re-checking proofs. Due to a remote SMT service there is no need for
5269 installing SMT solvers locally. See src/HOL/SMT.
5271 * New commands to load and prove verification conditions generated by
5272 the Boogie program verifier or derived systems (e.g. the Verifying C
5273 Compiler (VCC) or Spec#). See src/HOL/Boogie.
5275 * New counterexample generator tool 'nitpick' based on the Kodkod
5276 relational model finder. See src/HOL/Tools/Nitpick and
5277 src/HOL/Nitpick_Examples.
5279 * New commands 'code_pred' and 'values' to invoke the predicate
5280 compiler and to enumerate values of inductive predicates.
5282 * A tabled implementation of the reflexive transitive closure.
5284 * New implementation of quickcheck uses generic code generator;
5285 default generators are provided for all suitable HOL types, records
5286 and datatypes. Old quickcheck can be re-activated importing theory
5287 Library/SML_Quickcheck.
5289 * New testing tool Mirabelle for automated proof tools. Applies
5290 several tools and tactics like sledgehammer, metis, or quickcheck, to
5291 every proof step in a theory. To be used in batch mode via the
5292 "mirabelle" utility.
5294 * New proof method "sos" (sum of squares) for nonlinear real
5295 arithmetic (originally due to John Harison). It requires theory
5296 Library/Sum_Of_Squares. It is not a complete decision procedure but
5297 works well in practice on quantifier-free real arithmetic with +, -,
5298 *, ^, =, <= and <, i.e. boolean combinations of equalities and
5299 inequalities between polynomials. It makes use of external
5300 semidefinite programming solvers. Method "sos" generates a
5301 certificate that can be pasted into the proof thus avoiding the need
5302 to call an external tool every time the proof is checked. See
5303 src/HOL/Library/Sum_Of_Squares.
5305 * New method "linarith" invokes existing linear arithmetic decision
5308 * New command 'atp_minimal' reduces result produced by Sledgehammer.
5310 * New Sledgehammer option "Full Types" in Proof General settings menu.
5311 Causes full type information to be output to the ATPs. This slows
5312 ATPs down considerably but eliminates a source of unsound "proofs"
5315 * New method "metisFT": A version of metis that uses full type
5316 information in order to avoid failures of proof reconstruction.
5318 * New evaluator "approximate" approximates an real valued term using
5319 the same method as the approximation method.
5321 * Method "approximate" now supports arithmetic expressions as
5322 boundaries of intervals and implements interval splitting and Taylor
5325 * ML antiquotation @{code_datatype} inserts definition of a datatype
5326 generated by the code generator; e.g. see src/HOL/Predicate.thy.
5328 * New theory SupInf of the supremum and infimum operators for sets of
5331 * New theory Probability, which contains a development of measure
5332 theory, eventually leading to Lebesgue integration and probability.
5334 * Extended Multivariate Analysis to include derivation and Brouwer's
5337 * Reorganization of number theory, INCOMPATIBILITY:
5338 - new number theory development for nat and int, in theories Divides
5339 and GCD as well as in new session Number_Theory
5340 - some constants and facts now suffixed with _nat and _int
5342 - former session NumberTheory now named Old_Number_Theory, including
5343 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5344 - moved theory Pocklington from src/HOL/Library to
5345 src/HOL/Old_Number_Theory
5347 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5348 lcm of finite and infinite sets. It is shown that they form a complete
5351 * Class semiring_div requires superclass no_zero_divisors and proof of
5352 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5353 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5354 generalized to class semiring_div, subsuming former theorems
5355 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5356 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5359 * Refinements to lattice classes and sets:
5360 - less default intro/elim rules in locale variant, more default
5361 intro/elim rules in class variant: more uniformity
5362 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5364 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5366 - renamed ACI to inf_sup_aci
5367 - new class "boolean_algebra"
5368 - class "complete_lattice" moved to separate theory
5369 "Complete_Lattice"; corresponding constants (and abbreviations)
5370 renamed and with authentic syntax:
5371 Set.Inf ~> Complete_Lattice.Inf
5372 Set.Sup ~> Complete_Lattice.Sup
5373 Set.INFI ~> Complete_Lattice.INFI
5374 Set.SUPR ~> Complete_Lattice.SUPR
5375 Set.Inter ~> Complete_Lattice.Inter
5376 Set.Union ~> Complete_Lattice.Union
5377 Set.INTER ~> Complete_Lattice.INTER
5378 Set.UNION ~> Complete_Lattice.UNION
5379 - authentic syntax for
5382 - mere abbreviations:
5385 Set.inter (for inf, formerly Set.Int)
5386 Set.union (for sup, formerly Set.Un)
5387 Complete_Lattice.Inter (for Inf)
5388 Complete_Lattice.Union (for Sup)
5389 Complete_Lattice.INTER (for INFI)
5390 Complete_Lattice.UNION (for SUPR)
5391 - object-logic definitions as far as appropriate
5393 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5394 Un_subset_iff are explicitly deleted as default simp rules; then also
5395 their lattice counterparts le_inf_iff and le_sup_iff have to be
5396 deleted to achieve the desired effect.
5398 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5399 rules by default any longer; the same applies to min_max.inf_absorb1
5400 etc. INCOMPATIBILITY.
5402 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5403 pred_set_conv by default. INCOMPATIBILITY.
5405 * Power operations on relations and functions are now one dedicated
5406 constant "compow" with infix syntax "^^". Power operation on
5407 multiplicative monoids retains syntax "^" and is now defined generic
5408 in class power. INCOMPATIBILITY.
5410 * Relation composition "R O S" now has a more standard argument order:
5411 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5412 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5413 break, since the O_assoc rule was not rewritten like this. Fix using
5414 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5416 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5417 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5420 * Most rules produced by inductive and datatype package have mandatory
5421 prefixes. INCOMPATIBILITY.
5423 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5424 the attribute of the same name. Each of the theorems in the list
5425 DERIV_intros assumes composition with an additional function and
5426 matches a variable to the derivative, which has to be solved by the
5427 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5428 of most elementary terms. Former Maclauren.DERIV_tac and
5429 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5432 * Code generator attributes follow the usual underscore convention:
5433 code_unfold replaces code unfold
5434 code_post replaces code post
5439 sizechange -> size_change
5440 induct_scheme -> induction_schema
5443 * Discontinued abbreviation "arbitrary" of constant "undefined".
5444 INCOMPATIBILITY, use "undefined" directly.
5447 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5448 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5449 Suc_plus1 -> Suc_eq_plus1
5450 *anti_sym -> *antisym*
5451 vector_less_eq_def -> vector_le_def
5454 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5457 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5463 * Theory Representable defines a class "rep" of domains that are
5464 representable (via an ep-pair) in the universal domain type "udom".
5465 Instances are provided for all type constructors defined in HOLCF.
5467 * The 'new_domain' command is a purely definitional version of the
5468 domain package, for representable domains. Syntax is identical to the
5469 old domain package. The 'new_domain' package also supports indirect
5470 recursion using previously-defined type constructors. See
5471 src/HOLCF/ex/New_Domain.thy for examples.
5473 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5474 on the left-hand side of an equation, and then performs
5475 simplification. Rewriting is done using rules declared with the
5476 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5477 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5479 * The pattern-match compiler in 'fixrec' can now handle constructors
5480 with HOL function types. Pattern-match combinators for the Pair
5481 constructor are pre-configured.
5483 * The 'fixrec' package now produces better fixed-point induction rules
5484 for mutually-recursive definitions: Induction rules have conclusions
5485 of the form "P foo bar" instead of "P <foo, bar>".
5487 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5488 been renamed to "below". The name "below" now replaces "less" in many
5489 theorem names. (Legacy theorem names using "less" are still supported
5492 * The 'fixrec' package now supports "bottom patterns". Bottom
5493 patterns can be used to generate strictness rules, or to make
5494 functions more strict (much like the bang-patterns supported by the
5495 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5501 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5502 errors and run-time exceptions, including detailed source positions.
5504 * Structure Name_Space (formerly NameSpace) now manages uniquely
5505 identified entries, with some additional information such as source
5506 position, logical grouping etc.
5508 * Theory and context data is now introduced by the simplified and
5509 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5510 to be pure, but the old TheoryDataFun for mutable data (with explicit
5511 copy operation) is still available for some time.
5513 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5514 provides a high-level programming interface to synchronized state
5515 variables with atomic update. This works via pure function
5516 application within a critical section -- its runtime should be as
5517 short as possible; beware of deadlocks if critical code is nested,
5518 either directly or indirectly via other synchronized variables!
5520 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5521 wraps raw ML references, explicitly indicating their non-thread-safe
5522 behaviour. The Isar toplevel keeps this structure open, to
5523 accommodate Proof General as well as quick and dirty interactive
5524 experiments with references.
5526 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5527 parallel tactical reasoning.
5529 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5530 are similar to SUBPROOF, but are slightly more flexible: only the
5531 specified parts of the subgoal are imported into the context, and the
5532 body tactic may introduce new subgoals and schematic variables.
5534 * Old tactical METAHYPS, which does not observe the proof context, has
5535 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5536 or Subgoal.FOCUS etc.
5538 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5539 functors have their own ML name space there is no point to mark them
5540 separately.) Minor INCOMPATIBILITY.
5542 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5544 * Renamed several structures FooBar to Foo_Bar. Occasional,
5547 * Operations of structure Skip_Proof no longer require quick_and_dirty
5548 mode, which avoids critical setmp.
5550 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5551 combinators for "args". INCOMPATIBILITY, need to use simplified
5552 Attrib/Method.setup introduced in Isabelle2009.
5554 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5555 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5556 last resort. INCOMPATIBILITY.
5558 * Display.pretty_thm now requires a proper context (cf. former
5559 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5560 or even Display.pretty_thm_without_context as last resort.
5563 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5564 Syntax.pretty_typ/term directly, preferably with proper context
5565 instead of global theory.
5570 * Further fine tuning of parallel proof checking, scales up to 8 cores
5571 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5574 * Support for additional "Isabelle components" via etc/components, see
5575 also the system manual.
5577 * The isabelle makeall tool now operates on all components with
5578 IsaMakefile, not just hardwired "logics".
5580 * Removed "compress" option from isabelle-process and isabelle usedir;
5581 this is always enabled.
5583 * Discontinued support for Poly/ML 4.x versions.
5585 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5586 on a given logic image. This requires the lighttpd webserver and is
5587 currently supported on Linux only.
5591 New in Isabelle2009 (April 2009)
5592 --------------------------------
5596 * Simplified main Isabelle executables, with less surprises on
5597 case-insensitive file-systems (such as Mac OS).
5599 - The main Isabelle tool wrapper is now called "isabelle" instead of
5602 - The former "isabelle" alias for "isabelle-process" has been
5603 removed (should rarely occur to regular users).
5605 - The former "isabelle-interface" and its alias "Isabelle" have been
5606 removed (interfaces are now regular Isabelle tools).
5608 Within scripts and make files, the Isabelle environment variables
5609 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5610 respectively. (The latter are still available as legacy feature.)
5612 The old isabelle-interface wrapper could react in confusing ways if
5613 the interface was uninstalled or changed otherwise. Individual
5614 interface tool configuration is now more explicit, see also the
5615 Isabelle system manual. In particular, Proof General is now available
5616 via "isabelle emacs".
5618 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5619 purge installed copies of Isabelle executables and re-run "isabelle
5620 install -p ...", or use symlinks.
5622 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5623 old ~/isabelle, which was slightly non-standard and apt to cause
5624 surprises on case-insensitive file-systems (such as Mac OS).
5626 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5627 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5628 care is required when using older releases of Isabelle. Note that
5629 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5630 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5632 * Proofs of fully specified statements are run in parallel on
5633 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5634 a regular 4-core machine, if the initial heap space is made reasonably
5635 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5637 * The main reference manuals ("isar-ref", "implementation", and
5638 "system") have been updated and extended. Formally checked references
5639 as hyperlinks are now available uniformly.
5644 * Complete re-implementation of locales. INCOMPATIBILITY in several
5645 respects. The most important changes are listed below. See the
5646 Tutorial on Locales ("locales" manual) for details.
5648 - In locale expressions, instantiation replaces renaming. Parameters
5649 must be declared in a for clause. To aid compatibility with previous
5650 parameter inheritance, in locale declarations, parameters that are not
5651 'touched' (instantiation position "_" or omitted) are implicitly added
5652 with their syntax at the beginning of the for clause.
5654 - Syntax from abbreviations and definitions in locales is available in
5655 locale expressions and context elements. The latter is particularly
5656 useful in locale declarations.
5658 - More flexible mechanisms to qualify names generated by locale
5659 expressions. Qualifiers (prefixes) may be specified in locale
5660 expressions, and can be marked as mandatory (syntax: "name!:") or
5661 optional (syntax "name?:"). The default depends for plain "name:"
5662 depends on the situation where a locale expression is used: in
5663 commands 'locale' and 'sublocale' prefixes are optional, in
5664 'interpretation' and 'interpret' prefixes are mandatory. The old
5665 implicit qualifiers derived from the parameter names of a locale are
5666 no longer generated.
5668 - Command "sublocale l < e" replaces "interpretation l < e". The
5669 instantiation clause in "interpretation" and "interpret" (square
5670 brackets) is no longer available. Use locale expressions.
5672 - When converting proof scripts, mandatory qualifiers in
5673 'interpretation' and 'interpret' should be retained by default, even
5674 if this is an INCOMPATIBILITY compared to former behavior. In the
5675 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5676 in locale expressions range over a single locale instance only.
5678 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5679 In existing theorem specifications replace the includes element by the
5680 respective context elements of the included locale, omitting those
5681 that are already present in the theorem specification. Multiple
5682 assume elements of a locale should be replaced by a single one
5683 involving the locale predicate. In the proof body, declarations (most
5684 notably theorems) may be regained by interpreting the respective
5685 locales in the proof context as required (command "interpret").
5687 If using "includes" in replacement of a target solely because the
5688 parameter types in the theorem are not as general as in the target,
5689 consider declaring a new locale with additional type constraints on
5690 the parameters (context element "constrains").
5692 - Discontinued "locale (open)". INCOMPATIBILITY.
5694 - Locale interpretation commands no longer attempt to simplify goal.
5695 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5696 methods intro_locales and unfold_locales to clarify.
5698 - Locale interpretation commands no longer accept interpretation
5699 attributes. INCOMPATIBILITY.
5701 * Class declaration: so-called "base sort" must not be given in import
5702 list any longer, but is inferred from the specification. Particularly
5709 class foo = type + ...
5711 * Class target: global versions of theorems stemming do not carry a
5712 parameter prefix any longer. INCOMPATIBILITY.
5714 * Class 'instance' command no longer accepts attached definitions.
5715 INCOMPATIBILITY, use proper 'instantiation' target instead.
5717 * Recovered hiding of consts, which was accidentally broken in
5718 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5719 makes c inaccessible; consider using ``hide (open) const c'' instead.
5721 * Slightly more coherent Pure syntax, with updated documentation in
5722 isar-ref manual. Removed locales meta_term_syntax and
5723 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5724 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5725 directly in regular applications.
5727 * There is a new syntactic category "float_const" for signed decimal
5728 fractions (e.g. 123.45 or -123.45).
5730 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5731 interface with 'setup' command instead.
5733 * Command 'local_setup' is similar to 'setup', but operates on a local
5736 * The 'axiomatization' command now only works within a global theory
5737 context. INCOMPATIBILITY.
5739 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5740 hypotheses. Sorts required in the course of reasoning need to be
5741 covered by the constraints in the initial statement, completed by the
5742 type instance information of the background theory. Non-trivial sort
5743 hypotheses, which rarely occur in practice, may be specified via
5744 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5746 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5748 The result contains an implicit sort hypotheses as before --
5749 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5752 * Generalized Isar history, with support for linear undo, direct state
5755 * Changed defaults for unify configuration options:
5757 unify_trace_bound = 50 (formerly 25)
5758 unify_search_bound = 60 (formerly 30)
5760 * Different bookkeeping for code equations (INCOMPATIBILITY):
5762 a) On theory merge, the last set of code equations for a particular
5763 constant is taken (in accordance with the policy applied by other
5764 parts of the code generator framework).
5766 b) Code equations stemming from explicit declarations (e.g. code
5767 attribute) gain priority over default code equations stemming
5768 from definition, primrec, fun etc.
5770 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5772 * Unified theorem tables for both code generators. Thus [code
5773 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5775 * Command 'find_consts' searches for constants based on type and name
5778 find_consts "_ => bool"
5780 By default, matching is against subtypes, but it may be restricted to
5781 the whole type. Searching by name is possible. Multiple queries are
5782 conjunctive and queries may be negated by prefixing them with a
5785 find_consts strict: "_ => bool" name: "Int" -"int => int"
5787 * New 'find_theorems' criterion "solves" matches theorems that
5788 directly solve the current goal (modulo higher-order unification).
5790 * Auto solve feature for main theorem statements: whenever a new goal
5791 is stated, "find_theorems solves" is called; any theorems that could
5792 solve the lemma directly are listed as part of the goal state.
5793 Cf. associated options in Proof General Isabelle settings menu,
5794 enabled by default, with reasonable timeout for pathological cases of
5795 higher-order unification.
5798 *** Document preparation ***
5800 * Antiquotation @{lemma} now imitates a regular terminal proof,
5801 demanding keyword 'by' and supporting the full method expression
5802 syntax just like the Isar command 'by'.
5807 * Integrated main parts of former image HOL-Complex with HOL. Entry
5808 points Main and Complex_Main remain as before.
5810 * Logic image HOL-Plain provides a minimal HOL with the most important
5811 tools available (inductive, datatype, primrec, ...). This facilitates
5812 experimentation and tool development. Note that user applications
5813 (and library theories) should never refer to anything below theory
5816 * Logic image HOL-Main stops at theory Main, and thus facilitates
5817 experimentation due to shorter build times.
5819 * Logic image HOL-NSA contains theories of nonstandard analysis which
5820 were previously part of former HOL-Complex. Entry point Hyperreal
5821 remains valid, but theories formerly using Complex_Main should now use
5822 new entry point Hypercomplex.
5824 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5825 Posix processes. Avoids potentially expensive forking of the ML
5826 process. New thread-based implementation also works on non-Unix
5827 platforms (Cygwin). Provers are no longer hardwired, but defined
5828 within the theory via plain ML wrapper functions. Basic Sledgehammer
5829 commands are covered in the isar-ref manual.
5831 * Wrapper scripts for remote SystemOnTPTP service allows to use
5832 sledgehammer without local ATP installation (Vampire etc.). Other
5833 provers may be included via suitable ML wrappers, see also
5834 src/HOL/ATP_Linkup.thy.
5836 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5839 * The metis method no longer fails because the theorem is too trivial
5840 (contains the empty clause).
5842 * The metis method now fails in the usual manner, rather than raising
5843 an exception, if it determines that it cannot prove the theorem.
5845 * Method "coherent" implements a prover for coherent logic (see also
5846 src/Tools/coherent.ML).
5848 * Constants "undefined" and "default" replace "arbitrary". Usually
5849 "undefined" is the right choice to replace "arbitrary", though
5850 logically there is no difference. INCOMPATIBILITY.
5852 * Command "value" now integrates different evaluation mechanisms. The
5853 result of the first successful evaluation mechanism is printed. In
5854 square brackets a particular named evaluation mechanisms may be
5855 specified (currently, [SML], [code] or [nbe]). See further
5856 src/HOL/ex/Eval_Examples.thy.
5858 * Normalization by evaluation now allows non-leftlinear equations.
5859 Declare with attribute [code nbe].
5861 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5862 as the structured Isar versions "cases" and "induct", cf. the
5863 corresponding "cases" and "induct" attributes. Mutual induction rules
5864 are now presented as a list of individual projections
5865 (e.g. foo_bar.inducts for types foo and bar); the old format with
5866 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5867 rare situations a different rule is selected --- notably nested tuple
5868 elimination instead of former prod.exhaust: use explicit (case_tac t
5869 rule: prod.exhaust) here.
5871 * Attributes "cases", "induct", "coinduct" support "del" option.
5873 * Removed fact "case_split_thm", which duplicates "case_split".
5875 * The option datatype has been moved to a new theory Option. Renamed
5876 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5878 * New predicate "strict_mono" classifies strict functions on partial
5879 orders. With strict functions on linear orders, reasoning about
5880 (in)equalities is facilitated by theorems "strict_mono_eq",
5881 "strict_mono_less_eq" and "strict_mono_less".
5883 * Some set operations are now proper qualified constants with
5884 authentic syntax. INCOMPATIBILITY:
5895 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5898 * Auxiliary class "itself" has disappeared -- classes without any
5899 parameter are treated as expected by the 'class' command.
5901 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5903 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5904 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5906 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5907 method "approximation". It proves formulas on real values by using
5908 interval arithmetic. In the formulas are also the transcendental
5909 functions sin, cos, tan, atan, ln, exp and the constant pi are
5910 allowed. For examples see
5911 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5913 * Theory "Reflection" now resides in HOL/Library.
5915 * Entry point to Word library now simply named "Word".
5918 * Made source layout more coherent with logical distribution
5921 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5922 src/HOL/Library/Code_Message.thy ~> src/HOL/
5923 src/HOL/Library/GCD.thy ~> src/HOL/
5924 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5925 src/HOL/Library/Parity.thy ~> src/HOL/
5926 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5927 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5928 src/HOL/Real/Lubs.thy ~> src/HOL/
5929 src/HOL/Real/PReal.thy ~> src/HOL/
5930 src/HOL/Real/Rational.thy ~> src/HOL/
5931 src/HOL/Real/RComplete.thy ~> src/HOL/
5932 src/HOL/Real/RealDef.thy ~> src/HOL/
5933 src/HOL/Real/RealPow.thy ~> src/HOL/
5934 src/HOL/Real/Real.thy ~> src/HOL/
5935 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5936 src/HOL/Complex/Complex.thy ~> src/HOL/
5937 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5938 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5939 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5940 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5941 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5942 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5943 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5944 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5945 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5946 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5947 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5948 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5949 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5950 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5951 src/HOL/Real/Float ~> src/HOL/Library/
5952 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5953 src/HOL/Real/RealVector.thy ~> src/HOL/
5955 src/HOL/arith_data.ML ~> src/HOL/Tools
5956 src/HOL/hologic.ML ~> src/HOL/Tools
5957 src/HOL/simpdata.ML ~> src/HOL/Tools
5958 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5959 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5960 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5961 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5962 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5963 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5964 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5966 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5967 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5968 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5969 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5970 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5971 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5973 * If methods "eval" and "evaluation" encounter a structured proof
5974 state with !!/==>, only the conclusion is evaluated to True (if
5975 possible), avoiding strange error messages.
5977 * Method "sizechange" automates termination proofs using (a
5978 modification of) the size-change principle. Requires SAT solver. See
5979 src/HOL/ex/Termination.thy for examples.
5981 * Simplifier: simproc for let expressions now unfolds if bound
5982 variable occurs at most once in let expression body. INCOMPATIBILITY.
5984 * Method "arith": Linear arithmetic now ignores all inequalities when
5985 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5987 * New attribute "arith" for facts that should always be used
5988 automatically by arithmetic. It is intended to be used locally in
5991 assumes [arith]: "x > 0"
5993 Global usage is discouraged because of possible performance impact.
5995 * New classes "top" and "bot" with corresponding operations "top" and
5996 "bot" in theory Orderings; instantiation of class "complete_lattice"
5997 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5999 * Changed definition lemma "less_fun_def" in order to provide an
6000 instance for preorders on functions; use lemma "less_le" instead.
6003 * Theory Orderings: class "wellorder" moved here, with explicit
6004 induction rule "less_induct" as assumption. For instantiation of
6005 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
6008 * Theory Orderings: added class "preorder" as superclass of "order".
6009 INCOMPATIBILITY: Instantiation proofs for order, linorder
6010 etc. slightly changed. Some theorems named order_class.* now named
6013 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
6016 * Theory Finite_Set: added a new fold combinator of type
6018 ('a => 'b => 'b) => 'b => 'a set => 'b
6020 Occasionally this is more convenient than the old fold combinator
6021 which is now defined in terms of the new one and renamed to
6024 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
6025 and "ring_simps" have been replaced by "algebra_simps" (which can be
6026 extended with further lemmas!). At the moment both still exist but
6027 the former will disappear at some point.
6029 * Theory Power: Lemma power_Suc is now declared as a simp rule in
6030 class recpower. Type-specific simp rules for various recpower types
6031 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
6033 rat_power_0 -> power_0
6034 rat_power_Suc -> power_Suc
6035 realpow_0 -> power_0
6036 realpow_Suc -> power_Suc
6037 complexpow_0 -> power_0
6038 complexpow_Suc -> power_Suc
6039 power_poly_0 -> power_0
6040 power_poly_Suc -> power_Suc
6042 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
6043 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
6044 dvd has been generalized to class comm_semiring_1. Likewise a bunch
6045 of lemmas from Divides has been generalized from nat to class
6046 semiring_div. INCOMPATIBILITY. This involves the following theorem
6047 renames resulting from duplicate elimination:
6049 dvd_def_mod ~> dvd_eq_mod_eq_0
6050 zero_dvd_iff ~> dvd_0_left_iff
6051 dvd_0 ~> dvd_0_right
6052 DIVISION_BY_ZERO_DIV ~> div_by_0
6053 DIVISION_BY_ZERO_MOD ~> mod_by_0
6054 mult_div ~> div_mult_self2_is_id
6055 mult_mod ~> mod_mult_self2_is_0
6057 * Theory IntDiv: removed many lemmas that are instances of class-based
6058 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
6059 rename old lemmas as follows:
6061 dvd_diff -> nat_dvd_diff
6062 dvd_zminus_iff -> dvd_minus_iff
6063 mod_add1_eq -> mod_add_eq
6064 mod_mult1_eq -> mod_mult_right_eq
6065 mod_mult1_eq' -> mod_mult_left_eq
6066 mod_mult_distrib_mod -> mod_mult_eq
6067 nat_mod_add_left_eq -> mod_add_left_eq
6068 nat_mod_add_right_eq -> mod_add_right_eq
6069 nat_mod_div_trivial -> mod_div_trivial
6070 nat_mod_mod_trivial -> mod_mod_trivial
6071 zdiv_zadd_self1 -> div_add_self1
6072 zdiv_zadd_self2 -> div_add_self2
6073 zdiv_zmult_self1 -> div_mult_self2_is_id
6074 zdiv_zmult_self2 -> div_mult_self1_is_id
6075 zdvd_triv_left -> dvd_triv_left
6076 zdvd_triv_right -> dvd_triv_right
6077 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
6078 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
6079 zmod_zadd_left_eq -> mod_add_left_eq
6080 zmod_zadd_right_eq -> mod_add_right_eq
6081 zmod_zadd_self1 -> mod_add_self1
6082 zmod_zadd_self2 -> mod_add_self2
6083 zmod_zadd1_eq -> mod_add_eq
6084 zmod_zdiff1_eq -> mod_diff_eq
6085 zmod_zdvd_zmod -> mod_mod_cancel
6086 zmod_zmod_cancel -> mod_mod_cancel
6087 zmod_zmult_self1 -> mod_mult_self2_is_0
6088 zmod_zmult_self2 -> mod_mult_self1_is_0
6091 zdvd_abs1 -> abs_dvd_iff
6092 zdvd_abs2 -> dvd_abs_iff
6093 zdvd_refl -> dvd_refl
6094 zdvd_trans -> dvd_trans
6095 zdvd_zadd -> dvd_add
6096 zdvd_zdiff -> dvd_diff
6097 zdvd_zminus_iff -> dvd_minus_iff
6098 zdvd_zminus2_iff -> minus_dvd_iff
6099 zdvd_zmultD -> dvd_mult_right
6100 zdvd_zmultD2 -> dvd_mult_left
6101 zdvd_zmult_mono -> mult_dvd_mono
6102 zdvd_0_right -> dvd_0_right
6103 zdvd_0_left -> dvd_0_left_iff
6104 zdvd_1_left -> one_dvd
6105 zminus_dvd_iff -> minus_dvd_iff
6107 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
6109 * The real numbers offer decimal input syntax: 12.34 is translated
6110 into 1234/10^2. This translation is not reversed upon output.
6112 * Theory Library/Polynomial defines an abstract type 'a poly of
6113 univariate polynomials with coefficients of type 'a. In addition to
6114 the standard ring operations, it also supports div and mod. Code
6115 generation is also supported, using list-style constructors.
6117 * Theory Library/Inner_Product defines a class of real_inner for real
6118 inner product spaces, with an overloaded operation inner :: 'a => 'a
6119 => real. Class real_inner is a subclass of real_normed_vector from
6122 * Theory Library/Product_Vector provides instances for the product
6123 type 'a * 'b of several classes from RealVector and Inner_Product.
6124 Definitions of addition, subtraction, scalar multiplication, norms,
6125 and inner products are included.
6127 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
6128 addition to the field operations, numerals and case syntax are also
6131 * Theory Library/Diagonalize provides constructive version of Cantor's
6132 first diagonalization argument.
6134 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
6135 zlcm (for int); carried together from various gcd/lcm developements in
6136 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
6137 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
6138 may recover tupled syntax as follows:
6140 hide (open) const gcd
6141 abbreviation gcd where
6142 "gcd == (%(a, b). GCD.gcd a b)"
6144 GCD.gcd ("gcd '(_, _')")
6146 The same works for lcm, zgcd, zlcm.
6148 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
6149 instantiations for algebraic structures. Removed some duplicate
6150 theorems. Changes in simp rules. INCOMPATIBILITY.
6152 * ML antiquotation @{code} takes a constant as argument and generates
6153 corresponding code in background and inserts name of the corresponding
6154 resulting ML value/function/datatype constructor binding in place.
6155 All occurrences of @{code} with a single ML block are generated
6156 simultaneously. Provides a generic and safe interface for
6157 instrumentalizing code generation. See
6158 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
6159 In future you ought to refrain from ad-hoc compiling generated SML
6160 code on the ML toplevel. Note that (for technical reasons) @{code}
6161 cannot refer to constants for which user-defined serializations are
6162 set. Refer to the corresponding ML counterpart directly in that
6165 * Command 'rep_datatype': instead of theorem names the command now
6166 takes a list of terms denoting the constructors of the type to be
6167 represented as datatype. The characteristic theorems have to be
6168 proven. INCOMPATIBILITY. Also observe that the following theorems
6169 have disappeared in favour of existing ones:
6171 unit_induct ~> unit.induct
6172 prod_induct ~> prod.induct
6173 sum_induct ~> sum.induct
6174 Suc_Suc_eq ~> nat.inject
6175 Suc_not_Zero Zero_not_Suc ~> nat.distinct
6180 * New locales for orders and lattices where the equivalence relation
6181 is not restricted to equality. INCOMPATIBILITY: all order and lattice
6182 locales use a record structure with field eq for the equivalence.
6184 * New theory of factorial domains.
6186 * Units_l_inv and Units_r_inv are now simp rules by default.
6187 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
6188 and/or r_inv will now also require deletion of these lemmas.
6190 * Renamed the following theorems, INCOMPATIBILITY:
6192 UpperD ~> Upper_memD
6193 LowerD ~> Lower_memD
6194 least_carrier ~> least_closed
6195 greatest_carrier ~> greatest_closed
6196 greatest_Lower_above ~> greatest_Lower_below
6197 one_zero ~> carrier_one_zero
6198 one_not_zero ~> carrier_one_not_zero (collision with assumption)
6203 * Nominal datatypes can now contain type-variables.
6205 * Commands 'nominal_inductive' and 'equivariance' work with local
6208 * Nominal primrec can now works with local theory targets and its
6209 specification syntax now conforms to the general format as seen in
6212 * Method "perm_simp" honours the standard simplifier attributes
6213 (no_asm), (no_asm_use) etc.
6215 * The new predicate #* is defined like freshness, except that on the
6216 left hand side can be a set or list of atoms.
6218 * Experimental command 'nominal_inductive2' derives strong induction
6219 principles for inductive definitions. In contrast to
6220 'nominal_inductive', which can only deal with a fixed number of
6221 binders, it can deal with arbitrary expressions standing for sets of
6222 atoms to be avoided. The only inductive definition we have at the
6223 moment that needs this generalisation is the typing rule for Lets in
6226 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
6227 -----------------------------------------------------------------
6228 Gamma |- Let x be t1 in t2 : T2
6230 In this rule one wants to avoid all the binders that are introduced by
6231 "close Gamma T1". We are looking for other examples where this
6232 feature might be useful. Please let us know.
6237 * Reimplemented the simplification procedure for proving continuity
6238 subgoals. The new simproc is extensible; users can declare additional
6239 continuity introduction rules with the attribute [cont2cont].
6241 * The continuity simproc now uses a different introduction rule for
6242 solving continuity subgoals on terms with lambda abstractions. In
6243 some rare cases the new simproc may fail to solve subgoals that the
6244 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
6245 Potential INCOMPATIBILITY.
6247 * Command 'fixrec': specification syntax now conforms to the general
6248 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
6249 examples. INCOMPATIBILITY.
6254 * Proof of Zorn's Lemma for partial orders.
6259 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
6260 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
6261 depends on multithreading, so timouts will not work before Poly/ML
6264 * High-level support for concurrent ML programming, see
6265 src/Pure/Cuncurrent. The data-oriented model of "future values" is
6266 particularly convenient to organize independent functional
6267 computations. The concept of "synchronized variables" provides a
6268 higher-order interface for components with shared state, avoiding the
6269 delicate details of mutexes and condition variables. (Requires
6270 Poly/ML 5.2.1 or later.)
6272 * ML bindings produced via Isar commands are stored within the Isar
6273 context (theory or proof). Consequently, commands like 'use' and 'ML'
6274 become thread-safe and work with undo as expected (concerning
6275 top-level bindings, not side-effects on global references).
6276 INCOMPATIBILITY, need to provide proper Isar context when invoking the
6277 compiler at runtime; really global bindings need to be given outside a
6278 theory. (Requires Poly/ML 5.2 or later.)
6280 * Command 'ML_prf' is analogous to 'ML' but works within a proof
6281 context. Top-level ML bindings are stored within the proof context in
6282 a purely sequential fashion, disregarding the nested proof structure.
6283 ML bindings introduced by 'ML_prf' are discarded at the end of the
6284 proof. (Requires Poly/ML 5.2 or later.)
6286 * Simplified ML attribute and method setup, cf. functions Attrib.setup
6287 and Method.setup, as well as Isar commands 'attribute_setup' and
6288 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
6289 existing code accordingly, or use plain 'setup' together with old
6292 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
6293 to 'a -> thm, while results are always tagged with an authentic oracle
6294 name. The Isar command 'oracle' is now polymorphic, no argument type
6295 is specified. INCOMPATIBILITY, need to simplify existing oracle code
6296 accordingly. Note that extra performance may be gained by producing
6297 the cterm carefully, avoiding slow Thm.cterm_of.
6299 * Simplified interface for defining document antiquotations via
6300 ThyOutput.antiquotation, ThyOutput.output, and optionally
6301 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
6302 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
6305 * More systematic treatment of long names, abstract name bindings, and
6306 name space operations. Basic operations on qualified names have been
6307 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
6308 Long_Name.append. Old type bstring has been mostly replaced by
6309 abstract type binding (see structure Binding), which supports precise
6310 qualification by packages and local theory targets, as well as proper
6311 tracking of source positions. INCOMPATIBILITY, need to wrap old
6312 bstring values into Binding.name, or better pass through abstract
6313 bindings everywhere. See further src/Pure/General/long_name.ML,
6314 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
6316 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
6317 LocalTheory.note etc.) now refer to the *full* internal name, not the
6318 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
6320 * Disposed old type and term read functions (Sign.read_def_typ,
6321 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
6322 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
6323 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
6324 Syntax.read_term_global etc.; see also OldGoals.read_term as last
6325 resort for legacy applications.
6327 * Disposed old declarations, tactics, tactic combinators that refer to
6328 the simpset or claset of an implicit theory (such as Addsimps,
6329 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
6330 embedded ML text, or local_simpset_of with a proper context passed as
6331 explicit runtime argument.
6333 * Rules and tactics that read instantiations (read_instantiate,
6334 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
6335 context, which is required for parsing and type-checking. Moreover,
6336 the variables are specified as plain indexnames, not string encodings
6337 thereof. INCOMPATIBILITY.
6339 * Generic Toplevel.add_hook interface allows to analyze the result of
6340 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6341 for theorem dependency output of transactions resulting in a new
6344 * ML antiquotations: block-structured compilation context indicated by
6345 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6347 @{binding name} - basic name binding
6348 @{let ?pat = term} - term abbreviation (HO matching)
6349 @{note name = fact} - fact abbreviation
6350 @{thm fact} - singleton fact (with attributes)
6351 @{thms fact} - general fact (with attributes)
6352 @{lemma prop by method} - singleton goal
6353 @{lemma prop by meth1 meth2} - singleton goal
6354 @{lemma prop1 ... propN by method} - general goal
6355 @{lemma prop1 ... propN by meth1 meth2} - general goal
6356 @{lemma (open) ...} - open derivation
6361 * The Isabelle "emacs" tool provides a specific interface to invoke
6362 Proof General / Emacs, with more explicit failure if that is not
6363 installed (the old isabelle-interface script silently falls back on
6364 isabelle-process). The PROOFGENERAL_HOME setting determines the
6365 installation location of the Proof General distribution.
6367 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6368 the Isabelle process into a JVM/Scala application. See
6369 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6370 process wrapper has been discontinued.)
6372 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6374 * Various status messages (with exact source position information) are
6375 emitted, if proper markup print mode is enabled. This allows
6376 user-interface components to provide detailed feedback on internal
6381 New in Isabelle2008 (June 2008)
6382 -------------------------------
6386 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6387 and updated, with formally checked references as hyperlinks.
6389 * Theory loader: use_thy (and similar operations) no longer set the
6390 implicit ML context, which was occasionally hard to predict and in
6391 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6392 provides a proper context already.
6394 * Theory loader: old-style ML proof scripts being *attached* to a thy
6395 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6396 'use' within a theory file will do the job.
6398 * Name space merge now observes canonical order, i.e. the second space
6399 is inserted into the first one, while existing entries in the first
6400 space take precedence. INCOMPATIBILITY in rare situations, may try to
6401 swap theory imports.
6403 * Syntax: symbol \<chi> is now considered a letter. Potential
6404 INCOMPATIBILITY in identifier syntax etc.
6406 * Outer syntax: string tokens no longer admit escaped white space,
6407 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6408 white space without escapes.
6410 * Outer syntax: string tokens may contain arbitrary character codes
6411 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6417 * Context-dependent token translations. Default setup reverts locally
6418 fixed variables, and adds hilite markup for undeclared frees.
6420 * Unused theorems can be found using the new command 'unused_thms'.
6421 There are three ways of invoking it:
6424 Only finds unused theorems in the current theory.
6426 (2) unused_thms thy_1 ... thy_n -
6427 Finds unused theorems in the current theory and all of its ancestors,
6428 excluding the theories thy_1 ... thy_n and all of their ancestors.
6430 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6431 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6432 their ancestors, excluding the theories thy_1 ... thy_n and all of
6435 In order to increase the readability of the list produced by
6436 unused_thms, theorems that have been created by a particular instance
6437 of a theory command such as 'inductive' or 'function' are considered
6438 to belong to the same "group", meaning that if at least one theorem in
6439 this group is used, the other theorems in the same group are no longer
6440 reported as unused. Moreover, if all theorems in the group are
6441 unused, only one theorem in the group is displayed.
6443 Note that proof objects have to be switched on in order for
6444 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6445 usually the case when using Proof General with the default settings).
6447 * Authentic naming of facts disallows ad-hoc overwriting of previous
6448 theorems within the same name space. INCOMPATIBILITY, need to remove
6449 duplicate fact bindings, or even accidental fact duplications. Note
6450 that tools may maintain dynamically scoped facts systematically, using
6451 PureThy.add_thms_dynamic.
6453 * Command 'hide' now allows to hide from "fact" name space as well.
6455 * Eliminated destructive theorem database, simpset, claset, and
6456 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6457 update of theories within ML code.
6459 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6460 INCOMPATIBILITY, object-logics depending on former Pure require
6461 additional setup PureThy.old_appl_syntax_setup; object-logics
6462 depending on former CPure need to refer to Pure.
6464 * Commands 'use' and 'ML' are now purely functional, operating on
6465 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6466 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6469 * Command 'setup': discontinued implicit version with ML reference.
6471 * Instantiation target allows for simultaneous specification of class
6472 instance operations together with an instantiation proof.
6473 Type-checking phase allows to refer to class operations uniformly.
6474 See src/HOL/Complex/Complex.thy for an Isar example and
6475 src/HOL/Library/Eval.thy for an ML example.
6477 * Indexing of literal facts: be more serious about including only
6478 facts from the visible specification/proof context, but not the
6479 background context (locale etc.). Affects `prop` notation and method
6480 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6483 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6484 "(open)" option, which used to expose internal bound variables to the
6487 * Isar statements: removed obsolete case "rule_context".
6488 INCOMPATIBILITY, better use explicit fixes/assumes.
6490 * Locale proofs: default proof step now includes 'unfold_locales';
6491 hence 'proof' without argument may be used to unfold locale
6495 *** Document preparation ***
6497 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6498 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6499 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6500 spot); renamed link color from "darkblue" to "linkcolor" (default
6501 value unchanged, can be redefined via \definecolor); no longer sets
6502 "a4paper" option (unnecessary or even intrusive).
6504 * Antiquotation @{lemma A method} proves proposition A by the given
6505 method (either a method name or a method name plus (optional) method
6506 arguments in parentheses) and prints A just like @{prop A}.
6511 * New primrec package. Specification syntax conforms in style to
6512 definition/function/.... No separate induction rule is provided. The
6513 "primrec" command distinguishes old-style and new-style specifications
6514 by syntax. The former primrec package is now named OldPrimrecPackage.
6515 When adjusting theories, beware: constants stemming from new-style
6516 primrec specifications have authentic syntax.
6518 * Metis prover is now an order of magnitude faster, and also works
6519 with multithreading.
6521 * Metis: the maximum number of clauses that can be produced from a
6522 theorem is now given by the attribute max_clauses. Theorems that
6523 exceed this number are ignored, with a warning printed.
6525 * Sledgehammer no longer produces structured proofs by default. To
6526 enable, declare [[sledgehammer_full = true]]. Attributes
6527 reconstruction_modulus, reconstruction_sorts renamed
6528 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6530 * Method "induct_scheme" derives user-specified induction rules
6531 from well-founded induction and completeness of patterns. This factors
6532 out some operations that are done internally by the function package
6533 and makes them available separately. See
6534 src/HOL/ex/Induction_Scheme.thy for examples.
6536 * More flexible generation of measure functions for termination
6537 proofs: Measure functions can be declared by proving a rule of the
6538 form "is_measure f" and giving it the [measure_function] attribute.
6539 The "is_measure" predicate is logically meaningless (always true), and
6540 just guides the heuristic. To find suitable measure functions, the
6541 termination prover sets up the goal "is_measure ?f" of the appropriate
6542 type and generates all solutions by Prolog-style backward proof using
6545 This setup also deals with rules like
6547 "is_measure f ==> is_measure (list_size f)"
6549 which accommodates nested datatypes that recurse through lists.
6550 Similar rules are predeclared for products and option types.
6552 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6556 - Definitions of overloaded constants on sets have to be replaced by
6557 definitions on => and bool.
6559 - Some definitions of overloaded operators on sets can now be proved
6560 using the definitions of the operators on => and bool. Therefore,
6561 the following theorems have been renamed:
6563 subset_def -> subset_eq
6564 psubset_def -> psubset_eq
6565 set_diff_def -> set_diff_eq
6566 Compl_def -> Compl_eq
6567 Sup_set_def -> Sup_set_eq
6568 Inf_set_def -> Inf_set_eq
6569 sup_set_def -> sup_set_eq
6570 inf_set_def -> inf_set_eq
6572 - Due to the incompleteness of the HO unification algorithm, some
6573 rules such as subst may require manual instantiation, if some of
6574 the unknowns in the rule is a set.
6576 - Higher order unification and forward proofs:
6579 have "P (S::'a set)" <...>
6580 then have "EX S. P S" ..
6582 no longer works (due to the incompleteness of the HO unification
6583 algorithm) and must be replaced by the pattern
6590 - Calculational reasoning with subst (or similar rules):
6593 have "P (S::'a set)" <...>
6594 also have "S = T" <...>
6595 finally have "P T" .
6597 no longer works (for similar reasons as the previous example) and
6598 must be replaced by something like
6600 have "P (S::'a set)" <...>
6601 moreover have "S = T" <...>
6602 ultimately have "P T" by simp
6604 - Tactics or packages written in ML code:
6605 Code performing pattern matching on types via
6607 Type ("set", [T]) => ...
6609 must be rewritten. Moreover, functions like strip_type or
6610 binder_types no longer return the right value when applied to a
6613 T1 => ... => Tn => U => bool
6617 T1 => ... => Tn => U set
6619 * Merged theories Wellfounded_Recursion, Accessible_Part and
6620 Wellfounded_Relations to theory Wellfounded.
6622 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6624 * Class finite no longer treats UNIV as class parameter. Use class
6625 enum from theory Library/Enum instead to achieve a similar effect.
6628 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6629 and "Cons". INCOMPATIBILITY.
6631 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6632 Potential INCOMPATIBILITY.
6634 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6635 injective_fst_snd removed, use split_eta and prod_eqI instead.
6636 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6638 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6639 the same name in theory Orderings:
6649 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6650 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6651 and different variable names.
6653 * Library/Option_ord.thy: Canonical order on option type.
6655 * Library/RBT.thy: Red-black trees, an efficient implementation of
6658 * Library/Countable.thy: Type class for countable types.
6660 * Theory Int: The representation of numerals has changed. The infix
6661 operator BIT and the bit datatype with constructors B0 and B1 have
6662 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6663 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6664 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6667 * Theory Nat: definition of <= and < on natural numbers no longer
6668 depend on well-founded relations. INCOMPATIBILITY. Definitions
6669 le_def and less_def have disappeared. Consider lemmas not_less
6670 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6672 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6673 (whose purpose mainly is for various fold_set functionals) have been
6674 abandoned in favor of the existing algebraic classes
6675 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6676 lower_semilattice (resp. upper_semilattice) and linorder.
6679 * Theory Transitive_Closure: induct and cases rules now declare proper
6680 case_names ("base" and "step"). INCOMPATIBILITY.
6682 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6683 lattices. The form set-specific version is available as
6684 Inductive.lfp_ordinal_induct_set.
6686 * Renamed theorems "power.simps" to "power_int.simps".
6689 * Class semiring_div provides basic abstract properties of semirings
6690 with division and modulo operations. Subsumes former class dvd_mod.
6692 * Merged theories IntDef, Numeral and IntArith into unified theory
6693 Int. INCOMPATIBILITY.
6695 * Theory Library/Code_Index: type "index" now represents natural
6696 numbers rather than integers. INCOMPATIBILITY.
6698 * New class "uminus" with operation "uminus" (split of from class
6699 "minus" which now only has operation "minus", binary).
6702 * Constants "card", "internal_split", "option_map" now with authentic
6703 syntax. INCOMPATIBILITY.
6705 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6706 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6707 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6708 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6709 Sup_set_def, le_def, less_def, option_map_def now with object
6710 equality. INCOMPATIBILITY.
6712 * Records. Removed K_record, and replaced it by pure lambda term
6713 %x. c. The simplifier setup is now more robust against eta expansion.
6714 INCOMPATIBILITY: in cases explicitly referring to K_record.
6716 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6718 * Library/ListVector: new theory of arithmetic vector operations.
6720 * Library/Order_Relation: new theory of various orderings as sets of
6721 pairs. Defines preorders, partial orders, linear orders and
6722 well-orders on sets and on types.
6727 * Renamed some theories to allow to loading both ZF and HOL in the
6730 Datatype -> Datatype_ZF
6731 Inductive -> Inductive_ZF
6738 INCOMPATIBILITY: ZF theories that import individual theories below
6739 Main might need to be adapted. Regular theory Main is still
6740 available, as trivial extension of Main_ZF.
6745 * ML within Isar: antiquotation @{const name} or @{const
6746 name(typargs)} produces statically-checked Const term.
6748 * Functor NamedThmsFun: data is available to the user as dynamic fact
6749 (of the same name). Removed obsolete print command.
6751 * Removed obsolete "use_legacy_bindings" function.
6753 * The ``print mode'' is now a thread-local value derived from a global
6754 template (the former print_mode reference), thus access becomes
6755 non-critical. The global print_mode reference is for session
6756 management only; user-code should use print_mode_value,
6757 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6759 * Functions system/system_out provide a robust way to invoke external
6760 shell commands, with propagation of interrupts (requires Poly/ML
6761 5.2.1). Do not use OS.Process.system etc. from the basis library!
6766 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6767 in accordance with Proof General 3.7, which prefers GNU emacs.
6769 * isatool tty runs Isabelle process with plain tty interaction;
6770 optional line editor may be specified via ISABELLE_LINE_EDITOR
6771 setting, the default settings attempt to locate "ledit" and "rlwrap".
6773 * isatool browser now works with Cygwin as well, using general
6774 "javapath" function defined in Isabelle process environment.
6776 * YXML notation provides a simple and efficient alternative to
6777 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6778 isatool yxml as described in the Isabelle system manual.
6780 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6781 provides general wrapper for managing an Isabelle process in a robust
6782 fashion, with ``cooked'' output from stdin/stderr.
6784 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6785 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6787 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6788 way of changing the user's settings is via
6789 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6792 * Multithreading.max_threads := 0 refers to the number of actual CPU
6793 cores of the underlying machine, which is a good starting point for
6794 optimal performance tuning. The corresponding usedir option -M allows
6795 "max" as an alias for "0". WARNING: does not work on certain versions
6796 of Mac OS (with Poly/ML 5.1).
6798 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6799 adverse effect of Isabelle flooding interactive front-ends (notably
6800 ProofGeneral / XEmacs).
6804 New in Isabelle2007 (November 2007)
6805 -----------------------------------
6809 * More uniform information about legacy features, notably a
6810 warning/error of "Legacy feature: ...", depending on the state of the
6811 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6812 legacy features will disappear eventually.
6814 * Theory syntax: the header format ``theory A = B + C:'' has been
6815 discontinued in favour of ``theory A imports B C begin''. Use isatool
6816 fixheaders to convert existing theory files. INCOMPATIBILITY.
6818 * Theory syntax: the old non-Isar theory file format has been
6819 discontinued altogether. Note that ML proof scripts may still be used
6820 with Isar theories; migration is usually quite simple with the ML
6821 function use_legacy_bindings. INCOMPATIBILITY.
6823 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6824 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6827 * Theory loader: be more serious about observing the static theory
6828 header specifications (including optional directories), but not the
6829 accidental file locations of previously successful loads. The strict
6830 update policy of former update_thy is now already performed by
6831 use_thy, so the former has been removed; use_thys updates several
6832 theories simultaneously, just as 'imports' within a theory header
6833 specification, but without merging the results. Potential
6834 INCOMPATIBILITY: may need to refine theory headers and commands
6835 ROOT.ML which depend on load order.
6837 * Theory loader: optional support for content-based file
6838 identification, instead of the traditional scheme of full physical
6839 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6840 (cf. the system manual). The new scheme allows to work with
6841 non-finished theories in persistent session images, such that source
6842 files may be moved later on without requiring reloads.
6844 * Theory loader: old-style ML proof scripts being *attached* to a thy
6845 file (with the same base name as the theory) are considered a legacy
6846 feature, which will disappear eventually. Even now, the theory loader
6847 no longer maintains dependencies on such files.
6849 * Syntax: the scope for resolving ambiguities via type-inference is
6850 now limited to individual terms, instead of whole simultaneous
6851 specifications as before. This greatly reduces the complexity of the
6852 syntax module and improves flexibility by separating parsing and
6853 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6854 'fixes' etc.) are required in rare situations.
6856 * Syntax: constants introduced by new-style packages ('definition',
6857 'abbreviation' etc.) are passed through the syntax module in
6858 ``authentic mode''. This means that associated mixfix annotations
6859 really stick to such constants, independently of potential name space
6860 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6861 trees are represented slightly differently, may need to adapt syntax
6862 translations accordingly. Use CONST marker in 'translations' and
6863 @{const_syntax} antiquotation in 'parse_translation' etc.
6865 * Legacy goal package: reduced interface to the bare minimum required
6866 to keep existing proof scripts running. Most other user-level
6867 functions are now part of the OldGoals structure, which is *not* open
6868 by default (consider isatool expandshort before open OldGoals).
6869 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6870 these tend to cause confusion about the actual goal (!) context being
6871 used here, which is not necessarily the same as the_context().
6873 * Command 'find_theorems': supports "*" wild-card in "name:"
6874 criterion; "with_dups" option. Certain ProofGeneral versions might
6875 support a specific search form (see ProofGeneral/CHANGES).
6877 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6878 by default, which means that "prems" (and also "fixed variables") are
6879 suppressed from proof state output. Note that the ProofGeneral
6880 settings mechanism allows to change and save options persistently, but
6881 older versions of Isabelle will fail to start up if a negative prems
6884 * Local theory targets may be specified by non-nested blocks of
6885 ``context/locale/class ... begin'' followed by ``end''. The body may
6886 contain definitions, theorems etc., including any derived mechanism
6887 that has been implemented on top of these primitives. This concept
6888 generalizes the existing ``theorem (in ...)'' towards more versatility
6891 * Proof General interface: proper undo of final 'end' command;
6892 discontinued Isabelle/classic mode (ML proof scripts).
6895 *** Document preparation ***
6897 * Added antiquotation @{theory name} which prints the given name,
6898 after checking that it refers to a valid ancestor theory in the
6901 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6902 check the given source text as ML type/structure, printing verbatim.
6904 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6905 "c args == rhs" given in the current context. (Any number of
6906 arguments may be given on the LHS.)
6911 * The 'class' package offers a combination of axclass and locale to
6912 achieve Haskell-like type classes in Isabelle. Definitions and
6913 theorems within a class context produce both relative results (with
6914 implicit parameters according to the locale context), and polymorphic
6915 constants with qualified polymorphism (according to the class
6916 context). Within the body context of a 'class' target, a separate
6917 syntax layer ("user space type system") takes care of converting
6918 between global polymorphic consts and internal locale representation.
6919 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6920 "isatool doc classes" provides a tutorial.
6922 * Generic code generator framework allows to generate executable
6923 code for ML and Haskell (including Isabelle classes). A short usage
6926 internal compilation:
6927 export_code <list of constants (term syntax)> in SML
6928 writing SML code to a file:
6929 export_code <list of constants (term syntax)> in SML <filename>
6930 writing OCaml code to a file:
6931 export_code <list of constants (term syntax)> in OCaml <filename>
6932 writing Haskell code to a bunch of files:
6933 export_code <list of constants (term syntax)> in Haskell <filename>
6935 evaluating closed propositions to True/False using code generation:
6938 Reasonable default setup of framework in HOL.
6940 Theorem attributs for selecting and transforming function equations theorems:
6942 [code fun]: select a theorem as function equation for a specific constant
6943 [code fun del]: deselect a theorem as function equation for a specific constant
6944 [code inline]: select an equation theorem for unfolding (inlining) in place
6945 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6947 User-defined serializations (target in {SML, OCaml, Haskell}):
6949 code_const <and-list of constants (term syntax)>
6950 {(target) <and-list of const target syntax>}+
6952 code_type <and-list of type constructors>
6953 {(target) <and-list of type target syntax>}+
6955 code_instance <and-list of instances>
6957 where instance ::= <type constructor> :: <class>
6959 code_class <and_list of classes>
6960 {(target) <and-list of class target syntax>}+
6961 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6963 code_instance and code_class only are effective to target Haskell.
6965 For example usage see src/HOL/ex/Codegenerator.thy and
6966 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6967 generation from Isabelle/HOL theories is available via "isatool doc
6970 * Code generator: consts in 'consts_code' Isar commands are now
6971 referred to by usual term syntax (including optional type
6974 * Command 'no_translations' removes translation rules from theory
6977 * Overloaded definitions are now actually checked for acyclic
6978 dependencies. The overloading scheme is slightly more general than
6979 that of Haskell98, although Isabelle does not demand an exact
6980 correspondence to type class and instance declarations.
6981 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6982 exotic versions of overloading -- at the discretion of the user!
6984 Polymorphic constants are represented via type arguments, i.e. the
6985 instantiation that matches an instance against the most general
6986 declaration given in the signature. For example, with the declaration
6987 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6988 as c(nat). Overloading is essentially simultaneous structural
6989 recursion over such type arguments. Incomplete specification patterns
6990 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6991 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6992 Command 'print_theory' outputs the normalized system of recursive
6993 equations, see section "definitions".
6995 * Configuration options are maintained within the theory or proof
6996 context (with name and type bool/int/string), providing a very simple
6997 interface to a poor-man's version of general context data. Tools may
6998 declare options in ML (e.g. using Attrib.config_int) and then refer to
6999 these values using Config.get etc. Users may change options via an
7000 associated attribute of the same name. This form of context
7001 declaration works particularly well with commands 'declare' or
7002 'using', for example ``declare [[foo = 42]]''. Thus it has become
7003 very easy to avoid global references, which would not observe Isar
7004 toplevel undo/redo and fail to work with multithreading.
7006 Various global ML references of Pure and HOL have been turned into
7007 configuration options:
7009 Unify.search_bound unify_search_bound
7010 Unify.trace_bound unify_trace_bound
7011 Unify.trace_simp unify_trace_simp
7012 Unify.trace_types unify_trace_types
7013 Simplifier.simp_depth_limit simp_depth_limit
7014 Blast.depth_limit blast_depth_limit
7015 DatatypeProp.dtK datatype_distinctness_limit
7016 fast_arith_neq_limit fast_arith_neq_limit
7017 fast_arith_split_limit fast_arith_split_limit
7019 * Named collections of theorems may be easily installed as context
7020 data using the functor NamedThmsFun (see also
7021 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
7022 attributes; there is also a toplevel print command. This facility is
7023 just a common case of general context data, which is the preferred way
7024 for anything more complex than just a list of facts in canonical
7027 * Isar: command 'declaration' augments a local theory by generic
7028 declaration functions written in ML. This enables arbitrary content
7029 being added to the context, depending on a morphism that tells the
7030 difference of the original declaration context wrt. the application
7031 context encountered later on.
7033 * Isar: proper interfaces for simplification procedures. Command
7034 'simproc_setup' declares named simprocs (with match patterns, and body
7035 text in ML). Attribute "simproc" adds/deletes simprocs in the current
7036 context. ML antiquotation @{simproc name} retrieves named simprocs.
7038 * Isar: an extra pair of brackets around attribute declarations
7039 abbreviates a theorem reference involving an internal dummy fact,
7040 which will be ignored later --- only the effect of the attribute on
7041 the background context will persist. This form of in-place
7042 declarations is particularly useful with commands like 'declare' and
7043 'using', for example ``have A using [[simproc a]] by simp''.
7045 * Isar: method "assumption" (and implicit closing of subproofs) now
7046 takes simple non-atomic goal assumptions into account: after applying
7047 an assumption as a rule the resulting subgoals are solved by atomic
7048 assumption steps. This is particularly useful to finish 'obtain'
7049 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
7050 without referring to the original premise "!!x. P x ==> thesis" in the
7051 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
7054 * Isar: implicit use of prems from the Isar proof context is
7055 considered a legacy feature. Common applications like ``have A .''
7056 may be replaced by ``have A by fact'' or ``note `A`''. In general,
7057 referencing facts explicitly here improves readability and
7058 maintainability of proof texts.
7060 * Isar: improper proof element 'guess' is like 'obtain', but derives
7061 the obtained context from the course of reasoning! For example:
7063 assume "EX x y. A x & B y" -- "any previous fact"
7064 then guess x and y by clarify
7066 This technique is potentially adventurous, depending on the facts and
7067 proof tools being involved here.
7069 * Isar: known facts from the proof context may be specified as literal
7070 propositions, using ASCII back-quote syntax. This works wherever
7071 named facts used to be allowed so far, in proof commands, proof
7072 methods, attributes etc. Literal facts are retrieved from the context
7073 according to unification of type and term parameters. For example,
7074 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
7075 theorems in the current context, then these are valid literal facts:
7076 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
7078 There is also a proof method "fact" which does the same composition
7079 for explicit goal states, e.g. the following proof texts coincide with
7080 certain special cases of literal facts:
7082 have "A" by fact == note `A`
7083 have "A ==> B" by fact == note `A ==> B`
7084 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
7085 have "P a ==> Q a" by fact == note `P a ==> Q a`
7087 * Isar: ":" (colon) is no longer a symbolic identifier character in
7088 outer syntax. Thus symbolic identifiers may be used without
7089 additional white space in declarations like this: ``assume *: A''.
7091 * Isar: 'print_facts' prints all local facts of the current context,
7092 both named and unnamed ones.
7094 * Isar: 'def' now admits simultaneous definitions, e.g.:
7096 def x == "t" and y == "u"
7098 * Isar: added command 'unfolding', which is structurally similar to
7099 'using', but affects both the goal state and facts by unfolding given
7100 rewrite rules. Thus many occurrences of the 'unfold' method or
7101 'unfolded' attribute may be replaced by first-class proof text.
7103 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
7104 and command 'unfolding' now all support object-level equalities
7105 (potentially conditional). The underlying notion of rewrite rule is
7106 analogous to the 'rule_format' attribute, but *not* that of the
7107 Simplifier (which is usually more generous).
7109 * Isar: the new attribute [rotated n] (default n = 1) rotates the
7110 premises of a theorem by n. Useful in conjunction with drule.
7112 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
7113 method expression within a sandbox consisting of the first N
7114 sub-goals, which need to exist. For example, ``simp_all [3]''
7115 simplifies the first three sub-goals, while (rule foo, simp_all)[]
7116 simplifies all new goals that emerge from applying rule foo to the
7117 originally first one.
7119 * Isar: schematic goals are no longer restricted to higher-order
7120 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
7123 * Isar: the conclusion of a long theorem statement is now either
7124 'shows' (a simultaneous conjunction, as before), or 'obtains'
7125 (essentially a disjunction of cases with local parameters and
7126 assumptions). The latter allows to express general elimination rules
7127 adequately; in this notation common elimination rules look like this:
7129 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
7131 obtains x where "P x"
7133 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
7137 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
7143 The subsequent classical rules even refer to the formal "thesis"
7146 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
7149 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
7150 obtains "thesis ==> something"
7152 The actual proof of an 'obtains' statement is analogous to that of the
7153 Isar proof element 'obtain', only that there may be several cases.
7154 Optional case names may be specified in parentheses; these will be
7155 available both in the present proof and as annotations in the
7156 resulting rule, for later use with the 'cases' method (cf. attribute
7159 * Isar: the assumptions of a long theorem statement are available as
7160 "assms" fact in the proof context. This is more appropriate than the
7161 (historical) "prems", which refers to all assumptions of the current
7162 context, including those from the target locale, proof body etc.
7164 * Isar: 'print_statement' prints theorems from the current theory or
7165 proof context in long statement form, according to the syntax of a
7168 * Isar: 'obtain' takes an optional case name for the local context
7169 introduction rule (default "that").
7171 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
7172 explicit (is "_ ==> ?foo") in the rare cases where this still happens
7175 * Pure: syntax "CONST name" produces a fully internalized constant
7176 according to the current context. This is particularly useful for
7177 syntax translations that should refer to internal constant
7178 representations independently of name spaces.
7180 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
7181 instead of "FOO ". This allows multiple binder declarations to coexist
7182 in the same context. INCOMPATIBILITY.
7184 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
7185 primitive that also works in a locale context (both for constants and
7186 fixed variables). Type declaration and internal syntactic representation
7187 of given constants retrieved from the context. Likewise, the
7188 'no_notation' command allows to remove given syntax annotations from the
7191 * Isar/locales: new derived specification elements 'axiomatization',
7192 'definition', 'abbreviation', which support type-inference, admit
7193 object-level specifications (equality, equivalence). See also the
7194 isar-ref manual. Examples:
7197 eq (infix "===" 50) where
7198 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
7200 definition "f x y = x + y + 1"
7201 definition g where "g x = f x x"
7204 neq (infix "=!=" 50) where
7205 "x =!= y == ~ (x === y)"
7207 These specifications may be also used in a locale context. Then the
7208 constants being introduced depend on certain fixed parameters, and the
7209 constant name is qualified by the locale base name. An internal
7210 abbreviation takes care for convenient input and output, making the
7211 parameters implicit and using the original short name. See also
7212 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
7213 entities from a monomorphic theory.
7215 Presently, abbreviations are only available 'in' a target locale, but
7216 not inherited by general import expressions. Also note that
7217 'abbreviation' may be used as a type-safe replacement for 'syntax' +
7218 'translations' in common applications. The "no_abbrevs" print mode
7219 prevents folding of abbreviations in term output.
7221 Concrete syntax is attached to specified constants in internal form,
7222 independently of name spaces. The parse tree representation is
7223 slightly different -- use 'notation' instead of raw 'syntax', and
7224 'translations' with explicit "CONST" markup to accommodate this.
7226 * Pure/Isar: unified syntax for new-style specification mechanisms
7227 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
7228 full type inference and dummy patterns ("_"). For example:
7230 definition "K x _ = x"
7232 inductive conj for A B
7233 where "A ==> B ==> conj A B"
7235 * Pure: command 'print_abbrevs' prints all constant abbreviations of
7236 the current context. Print mode "no_abbrevs" prevents inversion of
7237 abbreviations on output.
7239 * Isar/locales: improved parameter handling: use of locales "var" and
7240 "struct" no longer necessary; - parameter renamings are no longer
7241 required to be injective. For example, this allows to define
7242 endomorphisms as locale endom = homom mult mult h.
7244 * Isar/locales: changed the way locales with predicates are defined.
7245 Instead of accumulating the specification, the imported expression is
7246 now an interpretation. INCOMPATIBILITY: different normal form of
7247 locale expressions. In particular, in interpretations of locales with
7248 predicates, goals repesenting already interpreted fragments are not
7249 removed automatically. Use methods `intro_locales' and
7250 `unfold_locales'; see below.
7252 * Isar/locales: new methods `intro_locales' and `unfold_locales'
7253 provide backward reasoning on locales predicates. The methods are
7254 aware of interpretations and discharge corresponding goals.
7255 `intro_locales' is less aggressive then `unfold_locales' and does not
7256 unfold predicates to assumptions.
7258 * Isar/locales: the order in which locale fragments are accumulated
7259 has changed. This enables to override declarations from fragments due
7260 to interpretations -- for example, unwanted simp rules.
7262 * Isar/locales: interpretation in theories and proof contexts has been
7263 extended. One may now specify (and prove) equations, which are
7264 unfolded in interpreted theorems. This is useful for replacing
7265 defined concepts (constants depending on locale parameters) by
7266 concepts already existing in the target context. Example:
7268 interpretation partial_order ["op <= :: [int, int] => bool"]
7269 where "partial_order.less (op <=) (x::int) y = (x < y)"
7271 Typically, the constant `partial_order.less' is created by a
7272 definition specification element in the context of locale
7275 * Method "induct": improved internal context management to support
7276 local fixes and defines on-the-fly. Thus explicit meta-level
7277 connectives !! and ==> are rarely required anymore in inductive goals
7278 (using object-logic connectives for this purpose has been long
7279 obsolete anyway). Common proof patterns are explained in
7280 src/HOL/Induct/Common_Patterns.thy, see also
7281 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
7284 * Method "induct": improved handling of simultaneous goals. Instead of
7285 introducing object-level conjunction, the statement is now split into
7286 several conclusions, while the corresponding symbolic cases are nested
7287 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
7288 see src/HOL/Induct/Common_Patterns.thy, for example.
7290 * Method "induct": mutual induction rules are now specified as a list
7291 of rule sharing the same induction cases. HOL packages usually provide
7292 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
7293 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
7294 mutual induction rules differently, i.e. like this:
7296 (induct rule: foo_bar.inducts)
7297 (induct set: foo bar)
7298 (induct pred: foo bar)
7299 (induct type: foo bar)
7301 The ML function ProjectRule.projections turns old-style rules into the
7304 * Method "coinduct": dual of induction, see
7305 src/HOL/Library/Coinductive_List.thy for various examples.
7307 * Method "cases", "induct", "coinduct": the ``(open)'' option is
7308 considered a legacy feature.
7310 * Attribute "symmetric" produces result with standardized schematic
7311 variables (index 0). Potential INCOMPATIBILITY.
7313 * Simplifier: by default the simplifier trace only shows top level
7314 rewrites now. That is, trace_simp_depth_limit is set to 1 by
7315 default. Thus there is less danger of being flooded by the trace. The
7316 trace indicates where parts have been suppressed.
7318 * Provers/classical: removed obsolete classical version of elim_format
7319 attribute; classical elim/dest rules are now treated uniformly when
7320 manipulating the claset.
7322 * Provers/classical: stricter checks to ensure that supplied intro,
7323 dest and elim rules are well-formed; dest and elim rules must have at
7326 * Provers/classical: attributes dest/elim/intro take an optional
7327 weight argument for the rule (just as the Pure versions). Weights are
7328 ignored by automated tools, but determine the search order of single
7331 * Syntax: input syntax now supports dummy variable binding "%_. b",
7332 where the body does not mention the bound variable. Note that dummy
7333 patterns implicitly depend on their context of bounds, which makes
7334 "{_. _}" match any set comprehension as expected. Potential
7335 INCOMPATIBILITY -- parse translations need to cope with syntactic
7336 constant "_idtdummy" in the binding position.
7338 * Syntax: removed obsolete syntactic constant "_K" and its associated
7339 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7340 for example "A -> B" => "Pi A (%_. B)".
7342 * Pure: 'class_deps' command visualizes the subclass relation, using
7343 the graph browser tool.
7345 * Pure: 'print_theory' now suppresses certain internal declarations by
7346 default; use '!' option for full details.
7351 * Method "metis" proves goals by applying the Metis general-purpose
7352 resolution prover (see also http://gilith.com/software/metis/).
7353 Examples are in the directory MetisExamples. WARNING: the
7354 Isabelle/HOL-Metis integration does not yet work properly with
7357 * Command 'sledgehammer' invokes external automatic theorem provers as
7358 background processes. It generates calls to the "metis" method if
7359 successful. These can be pasted into the proof. Users do not have to
7360 wait for the automatic provers to return. WARNING: does not really
7361 work with multi-threading.
7363 * New "auto_quickcheck" feature tests outermost goal statements for
7364 potential counter-examples. Controlled by ML references
7365 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7366 5000 milliseconds). Fails silently if statements is outside of
7367 executable fragment, or any other codgenerator problem occurs.
7369 * New constant "undefined" with axiom "undefined x = undefined".
7371 * Added class "HOL.eq", allowing for code generation with polymorphic
7374 * Some renaming of class constants due to canonical name prefixing in
7375 the new 'class' package:
7377 HOL.abs ~> HOL.abs_class.abs
7378 HOL.divide ~> HOL.divide_class.divide
7379 0 ~> HOL.zero_class.zero
7380 1 ~> HOL.one_class.one
7381 op + ~> HOL.plus_class.plus
7382 op - ~> HOL.minus_class.minus
7383 uminus ~> HOL.minus_class.uminus
7384 op * ~> HOL.times_class.times
7385 op < ~> HOL.ord_class.less
7386 op <= > HOL.ord_class.less_eq
7387 Nat.power ~> Power.power_class.power
7388 Nat.size ~> Nat.size_class.size
7389 Numeral.number_of ~> Numeral.number_class.number_of
7390 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7391 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7392 Orderings.min ~> Orderings.ord_class.min
7393 Orderings.max ~> Orderings.ord_class.max
7394 Divides.op div ~> Divides.div_class.div
7395 Divides.op mod ~> Divides.div_class.mod
7396 Divides.op dvd ~> Divides.div_class.dvd
7398 INCOMPATIBILITY. Adaptions may be required in the following cases:
7400 a) User-defined constants using any of the names "plus", "minus",
7401 "times", "less" or "less_eq". The standard syntax translations for
7402 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7405 b) Variables named "plus", "minus", "times", "less", "less_eq"
7406 INCOMPATIBILITY: use more specific names.
7408 c) Permutative equations (e.g. "a + b = b + a")
7409 Since the change of names also changes the order of terms, permutative
7410 rewrite rules may get applied in a different order. Experience shows
7411 that this is rarely the case (only two adaptions in the whole Isabelle
7412 distribution). INCOMPATIBILITY: rewrite proofs
7414 d) ML code directly refering to constant names
7415 This in general only affects hand-written proof tactics, simprocs and
7416 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7417 Consider using @{const_name} antiquotation.
7419 * New class "default" with associated constant "default".
7421 * Function "sgn" is now overloaded and available on int, real, complex
7422 (and other numeric types), using class "sgn". Two possible defs of
7423 sgn are given as equational assumptions in the classes sgn_if and
7424 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7427 * Locale "partial_order" now unified with class "order" (cf. theory
7428 Orderings), added parameter "less". INCOMPATIBILITY.
7430 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7431 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7432 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7434 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7435 changed order of proof goals in instance proofs.
7437 * The transitivity reasoner for partial and linear orders is set up
7438 for classes "order" and "linorder". Instances of the reasoner are available
7439 in all contexts importing or interpreting the corresponding locales.
7440 Method "order" invokes the reasoner separately; the reasoner
7441 is also integrated with the Simplifier as a solver. Diagnostic
7442 command 'print_orders' shows the available instances of the reasoner
7443 in the current context.
7445 * Localized monotonicity predicate in theory "Orderings"; integrated
7446 lemmas max_of_mono and min_of_mono with this predicate.
7449 * Formulation of theorem "dense" changed slightly due to integration
7450 with new class dense_linear_order.
7452 * Uniform lattice theory development in HOL.
7454 constants "meet" and "join" now named "inf" and "sup"
7455 constant "Meet" now named "Inf"
7457 classes "meet_semilorder" and "join_semilorder" now named
7458 "lower_semilattice" and "upper_semilattice"
7459 class "lorder" now named "lattice"
7460 class "comp_lat" now named "complete_lattice"
7462 Instantiation of lattice classes allows explicit definitions
7463 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7465 INCOMPATIBILITY. Theorem renames:
7467 meet_left_le ~> inf_le1
7468 meet_right_le ~> inf_le2
7469 join_left_le ~> sup_ge1
7470 join_right_le ~> sup_ge2
7471 meet_join_le ~> inf_sup_ord
7474 le_meet ~> le_inf_iff
7475 le_join ~> ge_sup_conv
7476 meet_idempotent ~> inf_idem
7477 join_idempotent ~> sup_idem
7478 meet_comm ~> inf_commute
7479 join_comm ~> sup_commute
7480 meet_leI1 ~> le_infI1
7481 meet_leI2 ~> le_infI2
7482 le_joinI1 ~> le_supI1
7483 le_joinI2 ~> le_supI2
7484 meet_assoc ~> inf_assoc
7485 join_assoc ~> sup_assoc
7486 meet_left_comm ~> inf_left_commute
7487 meet_left_idempotent ~> inf_left_idem
7488 join_left_comm ~> sup_left_commute
7489 join_left_idempotent ~> sup_left_idem
7492 le_def_meet ~> le_iff_inf
7493 le_def_join ~> le_iff_sup
7494 join_absorp2 ~> sup_absorb2
7495 join_absorp1 ~> sup_absorb1
7496 meet_absorp1 ~> inf_absorb1
7497 meet_absorp2 ~> inf_absorb2
7498 meet_join_absorp ~> inf_sup_absorb
7499 join_meet_absorp ~> sup_inf_absorb
7500 distrib_join_le ~> distrib_sup_le
7501 distrib_meet_le ~> distrib_inf_le
7503 add_meet_distrib_left ~> add_inf_distrib_left
7504 add_join_distrib_left ~> add_sup_distrib_left
7505 is_join_neg_meet ~> is_join_neg_inf
7506 is_meet_neg_join ~> is_meet_neg_sup
7507 add_meet_distrib_right ~> add_inf_distrib_right
7508 add_join_distrib_right ~> add_sup_distrib_right
7509 add_meet_join_distribs ~> add_sup_inf_distribs
7510 join_eq_neg_meet ~> sup_eq_neg_inf
7511 meet_eq_neg_join ~> inf_eq_neg_sup
7512 add_eq_meet_join ~> add_eq_inf_sup
7513 meet_0_imp_0 ~> inf_0_imp_0
7514 join_0_imp_0 ~> sup_0_imp_0
7515 meet_0_eq_0 ~> inf_0_eq_0
7516 join_0_eq_0 ~> sup_0_eq_0
7517 neg_meet_eq_join ~> neg_inf_eq_sup
7518 neg_join_eq_meet ~> neg_sup_eq_inf
7519 join_eq_if ~> sup_eq_if
7521 mono_meet ~> mono_inf
7522 mono_join ~> mono_sup
7523 meet_bool_eq ~> inf_bool_eq
7524 join_bool_eq ~> sup_bool_eq
7525 meet_fun_eq ~> inf_fun_eq
7526 join_fun_eq ~> sup_fun_eq
7527 meet_set_eq ~> inf_set_eq
7528 join_set_eq ~> sup_set_eq
7529 meet1_iff ~> inf1_iff
7530 meet2_iff ~> inf2_iff
7539 join1_iff ~> sup1_iff
7540 join2_iff ~> sup2_iff
7550 is_meet_Meet ~> is_meet_Inf
7551 Meet_bool_def ~> Inf_bool_def
7552 Meet_fun_def ~> Inf_fun_def
7553 Meet_greatest ~> Inf_greatest
7554 Meet_lower ~> Inf_lower
7555 Meet_set_def ~> Inf_set_def
7558 Sup_bool_eq ~> Sup_bool_def
7559 Sup_fun_eq ~> Sup_fun_def
7560 Sup_set_eq ~> Sup_set_def
7562 listsp_meetI ~> listsp_infI
7563 listsp_meet_eq ~> listsp_inf_eq
7568 * Added syntactic class "size"; overloaded constant "size" now has
7569 type "'a::size ==> bool"
7571 * Internal reorganisation of `size' of datatypes: size theorems
7572 "foo.size" are no longer subsumed by "foo.simps" (but are still
7573 simplification rules by default!); theorems "prod.size" now named
7576 * Class "div" now inherits from class "times" rather than "type".
7579 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7580 Linorder etc. have disappeared; operations defined in terms of
7581 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7583 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7585 * HOL-Word: New extensive library and type for generic, fixed size
7586 machine words, with arithmetic, bit-wise, shifting and rotating
7587 operations, reflection into int, nat, and bool lists, automation for
7588 linear arithmetic (by automatic reflection into nat or int), including
7589 lemmas on overflow and monotonicity. Instantiated to all appropriate
7590 arithmetic type classes, supporting automatic simplification of
7591 numerals on all operations.
7593 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7595 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7597 * Code generator library theories:
7598 - Code_Integer represents HOL integers by big integer literals in target
7600 - Code_Char represents HOL characters by character literals in target
7602 - Code_Char_chr like Code_Char, but also offers treatment of character
7603 codes; includes Code_Integer.
7604 - Executable_Set allows to generate code for finite sets using lists.
7605 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7607 - Executable_Real implements a subset of real numbers, namly those
7608 representable by rational numbers.
7609 - Efficient_Nat implements natural numbers by integers, which in general will
7610 result in higher efficency; pattern matching with 0/Suc is eliminated;
7611 includes Code_Integer.
7612 - Code_Index provides an additional datatype index which is mapped to
7613 target-language built-in integers.
7614 - Code_Message provides an additional datatype message_string which is isomorphic to
7615 strings; messages are mapped to target-language strings.
7617 * New package for inductive predicates
7619 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7622 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7623 for z_1 :: U_1 and ... and z_n :: U_m
7625 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7628 with full support for type-inference, rather than
7630 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7632 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7633 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7635 inductive "s z_1 ... z_m"
7637 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7640 For backward compatibility, there is a wrapper allowing inductive
7641 sets to be defined with the new package via
7644 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7645 for z_1 :: U_1 and ... and z_n :: U_m
7647 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7653 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7654 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7655 for z_1 :: U_1 and ... and z_n :: U_m
7657 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7658 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7661 if the additional syntax "p ..." is required.
7663 Numerous examples can be found in the subdirectories src/HOL/Auth,
7664 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7668 - Since declaration and definition of inductive sets or predicates
7669 is no longer separated, abbreviations involving the newly
7670 introduced sets or predicates must be specified together with the
7671 introduction rules after the 'where' keyword (see above), rather
7672 than before the actual inductive definition.
7674 - The variables in induction and elimination rules are now
7675 quantified in the order of their occurrence in the introduction
7676 rules, rather than in alphabetical order. Since this may break
7677 some proofs, these proofs either have to be repaired, e.g. by
7678 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7679 statements of the form
7681 case (rule_i a_i_1 ... a_i_{k_i})
7683 or the old order of quantification has to be restored by explicitly adding
7684 meta-level quantifiers in the introduction rules, i.e.
7686 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7688 - The format of the elimination rules is now
7690 p z_1 ... z_m x_1 ... x_n ==>
7691 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7696 (x_1, ..., x_n) : s z_1 ... z_m ==>
7697 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7700 for sets rather than
7702 x : s z_1 ... z_m ==>
7703 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7706 This may require terms in goals to be expanded to n-tuples
7707 (e.g. using case_tac or simplification with the split_paired_all
7708 rule) before the above elimination rule is applicable.
7710 - The elimination or case analysis rules for (mutually) inductive
7711 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7712 list of rules "p_1_..._p_k.elims" is no longer available.
7714 * New package "function"/"fun" for general recursive functions,
7715 supporting mutual and nested recursion, definitions in local contexts,
7716 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7717 for small examples, and the separate tutorial on the function
7718 package. The old recdef "package" is still available as before, but
7719 users are encouraged to use the new package.
7721 * Method "lexicographic_order" automatically synthesizes termination
7722 relations as lexicographic combinations of size measures.
7724 * Case-expressions allow arbitrary constructor-patterns (including
7725 "_") and take their order into account, like in functional
7726 programming. Internally, this is translated into nested
7727 case-expressions; missing cases are added and mapped to the predefined
7728 constant "undefined". In complicated cases printing may no longer show
7729 the original input but the internal form. Lambda-abstractions allow
7730 the same form of pattern matching: "% pat1 => e1 | ..." is an
7731 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7734 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7735 is an abbreviation for "of_nat :: nat => int". The simplification
7736 rules for "of_nat" have been changed to work like "int" did
7737 previously. Potential INCOMPATIBILITY:
7738 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7739 - of_nat_diff and of_nat_mult are no longer default simp rules
7741 * Method "algebra" solves polynomial equations over (semi)rings using
7742 Groebner bases. The (semi)ring structure is defined by locales and the
7743 tool setup depends on that generic context. Installing the method for
7744 a specific type involves instantiating the locale and possibly adding
7745 declarations for computation on the coefficients. The method is
7746 already instantiated for natural numbers and for the axiomatic class
7747 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7748 CALCULEMUS 2007 for the general principles underlying this
7749 architecture of context-aware proof-tools.
7751 * Method "ferrack" implements quantifier elimination over
7752 special-purpose dense linear orders using locales (analogous to
7753 "algebra"). The method is already installed for class
7754 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7757 * Former constant "List.op @" now named "List.append". Use ML
7758 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7759 circumvent possible incompatibilities when working on ML level.
7761 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7763 * New function listsum :: 'a list => 'a for arbitrary monoids.
7764 Special syntax: "SUM x <- xs. f x" (and latex variants)
7766 * New syntax for Haskell-like list comprehension (input only), eg.
7767 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7769 * The special syntax for function "filter" has changed from [x :
7770 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7771 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7773 * [a..b] is now defined for arbitrary linear orders. It used to be
7774 defined on nat only, as an abbreviation for [a..<Suc b]
7777 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7779 * New functions "sorted" and "sort" in src/HOL/List.thy.
7781 * New lemma collection field_simps (an extension of ring_simps) for
7782 manipulating (in)equations involving division. Multiplies with all
7783 denominators that can be proved to be non-zero (in equations) or
7784 positive/negative (in inequations).
7786 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7787 have been improved and renamed to ring_simps, group_simps and
7788 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7789 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7791 * Theory Library/Commutative_Ring: switched from recdef to function
7792 package; constants add, mul, pow now curried. Infix syntax for
7793 algebraic operations.
7795 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7798 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7801 * HOL/records: generalised field-update to take a function on the
7802 field rather than the new value: r(|A := x|) is translated to A_update
7803 (K x) r The K-combinator that is internally used is called K_record.
7804 INCOMPATIBILITY: Usage of the plain update functions has to be
7807 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7808 * x = 0, which are required for a semiring. Richer structures do not
7809 inherit from semiring_0 anymore, because this property is a theorem
7810 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7811 there is more to prove, but this is mostly trivial.
7813 * Class "recpower" is generalized to arbitrary monoids, not just
7814 commutative semirings. INCOMPATIBILITY: may need to incorporate
7815 commutativity or semiring properties additionally.
7817 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7818 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7819 better use 'abbreviation'.
7821 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7823 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7824 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7825 significant changes for setting up numeral syntax for types:
7826 - New constants Numeral.pred and Numeral.succ instead
7827 of former Numeral.bin_pred and Numeral.bin_succ.
7828 - Use integer operations instead of bin_add, bin_mult and so on.
7829 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7830 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7832 See src/HOL/Integ/IntArith.thy for an example setup.
7834 * Command 'normal_form' computes the normal form of a term that may
7835 contain free variables. For example ``normal_form "rev [a, b, c]"''
7836 produces ``[b, c, a]'' (without proof). This command is suitable for
7837 heavy-duty computations because the functions are compiled to ML
7838 first. Correspondingly, a method "normalization" is provided. See
7839 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7841 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7842 25 like -->); output depends on the "iff" print_mode, the default is
7843 "A = B" (with priority 50).
7845 * Relations less (<) and less_eq (<=) are also available on type bool.
7846 Modified syntax to disallow nesting without explicit parentheses,
7847 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7850 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7852 * Relation composition operator "op O" now has precedence 75 and binds
7853 stronger than union and intersection. INCOMPATIBILITY.
7855 * The old set interval syntax "{m..n(}" (and relatives) has been
7856 removed. Use "{m..<n}" (and relatives) instead.
7858 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7859 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7860 ``declare [[simproc del: neq]]''.
7862 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7865 * Theorem Cons_eq_map_conv no longer declared as "simp".
7867 * Theorem setsum_mult renamed to setsum_right_distrib.
7869 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7872 * Reimplemented methods "sat" and "satx", with several improvements:
7873 goals no longer need to be stated as "<prems> ==> False", equivalences
7874 (i.e. "=" on type bool) are handled, variable names of the form
7875 "lit_<n>" are no longer reserved, significant speedup.
7877 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7878 zChaff is still supported as well.
7880 * 'inductive' and 'datatype': provide projections of mutual rules,
7881 bundled as foo_bar.inducts;
7883 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7886 * Library: moved theory Accessible_Part to main HOL.
7888 * Library: added theory Coinductive_List of potentially infinite lists
7889 as greatest fixed-point.
7891 * Library: added theory AssocList which implements (finite) maps as
7894 * Method "evaluation" solves goals (i.e. a boolean expression)
7895 efficiently by compiling it to ML. The goal is "proved" (via an
7896 oracle) if it evaluates to True.
7898 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7899 also when invoked by the simplifier. This results in the Simplifier
7900 being more powerful on arithmetic goals. INCOMPATIBILITY.
7901 Configuration option fast_arith_split_limit=0 recovers the old
7904 * Support for hex (0x20) and binary (0b1001) numerals.
7906 * New method: reify eqs (t), where eqs are equations for an
7907 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7908 parameter, computes a term s::'b and a list xs::'a list and proves the
7909 theorem I xs s = t. This is also known as reification or quoting. The
7910 resulting theorem is applied to the subgoal to substitute t with I xs
7911 s. If t is omitted, the subgoal itself is reified.
7913 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7914 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7915 where f is supposed to be a computable function (in the sense of code
7916 generattion). The method uses reify to compute s and xs as above then
7917 applies corr_thm and uses normalization by evaluation to "prove" f s =
7918 r and finally gets the theorem t = r, which is again applied to the
7919 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7921 * Reflection: Automatic reification now handels binding, an example is
7922 available in src/HOL/ex/ReflectionEx.thy
7924 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7925 command 'statespace' that is similar to 'record', but introduces an
7926 abstract specification based on the locale infrastructure instead of
7927 HOL types. This leads to extra flexibility in composing state spaces,
7928 in particular multiple inheritance and renaming of components.
7933 * Hyperreal: Functions root and sqrt are now defined on negative real
7934 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7935 Nonnegativity side conditions have been removed from many lemmas, so
7936 that more subgoals may now be solved by simplification; potential
7939 * Real: new type classes formalize real normed vector spaces and
7940 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7941 and norm :: 'a => real.
7943 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7944 reals into other types. The overloaded constant Reals :: 'a set is now
7945 defined as range of_real; potential INCOMPATIBILITY.
7947 * Real: proper support for ML code generation, including 'quickcheck'.
7948 Reals are implemented as arbitrary precision rationals.
7950 * Hyperreal: Several constants that previously worked only for the
7951 reals have been generalized, so they now work over arbitrary vector
7952 spaces. Type annotations may need to be added in some cases; potential
7955 Infinitesimal :: ('a::real_normed_vector) star set
7956 HFinite :: ('a::real_normed_vector) star set
7957 HInfinite :: ('a::real_normed_vector) star set
7958 approx :: ('a::real_normed_vector) star => 'a star => bool
7959 monad :: ('a::real_normed_vector) star => 'a star set
7960 galaxy :: ('a::real_normed_vector) star => 'a star set
7961 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7962 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7963 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7964 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7965 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7966 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7967 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7968 sgn :: 'a::real_normed_vector => 'a
7969 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7971 * Complex: Some complex-specific constants are now abbreviations for
7972 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7973 hnorm. Other constants have been entirely removed in favor of the
7974 polymorphic versions (INCOMPATIBILITY):
7978 HInfinite <-- CInfinite
7979 Infinitesimal <-- CInfinitesimal
7982 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7983 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7984 (ns)deriv <-- (ns)cderiv
7989 * Formalisation of ideals and the quotient construction over rings.
7991 * Order and lattice theory no longer based on records.
7994 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7995 greatest_closed. INCOMPATIBILITY.
7997 * Method algebra is now set up via an attribute. For examples see
7998 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7999 of algebraic structures.
8001 * Renamed theory CRing to Ring.
8006 * Substantial, yet incomplete support for nominal datatypes (binding
8007 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
8008 src/HOL/Nominal/Examples. Prospective users should consult
8009 http://isabelle.in.tum.de/nominal/
8014 * ML basics: just one true type int, which coincides with IntInf.int
8017 * ML within Isar: antiquotations allow to embed statically-checked
8018 formal entities in the source, referring to the context available at
8019 compile-time. For example:
8021 ML {* @{sort "{zero,one}"} *}
8022 ML {* @{typ "'a => 'b"} *}
8023 ML {* @{term "%x. x"} *}
8024 ML {* @{prop "x == y"} *}
8025 ML {* @{ctyp "'a => 'b"} *}
8026 ML {* @{cterm "%x. x"} *}
8027 ML {* @{cprop "x == y"} *}
8028 ML {* @{thm asm_rl} *}
8029 ML {* @{thms asm_rl} *}
8030 ML {* @{type_name c} *}
8031 ML {* @{type_syntax c} *}
8032 ML {* @{const_name c} *}
8033 ML {* @{const_syntax c} *}
8036 ML {* @{theory Pure} *}
8037 ML {* @{theory_ref} *}
8038 ML {* @{theory_ref Pure} *}
8041 ML {* @{clasimpset} *}
8043 The same works for sources being ``used'' within an Isar context.
8045 * ML in Isar: improved error reporting; extra verbosity with
8046 ML_Context.trace enabled.
8048 * Pure/General/table.ML: the join operations now works via exceptions
8049 DUP/SAME instead of type option. This is simpler in simple cases, and
8050 admits slightly more efficient complex applications.
8052 * Pure: 'advanced' translation functions (parse_translation etc.) now
8053 use Context.generic instead of just theory.
8055 * Pure: datatype Context.generic joins theory/Proof.context and
8056 provides some facilities for code that works in either kind of
8057 context, notably GenericDataFun for uniform theory and proof data.
8059 * Pure: simplified internal attribute type, which is now always
8060 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
8061 local (Proof.context) attributes have been discontinued, while
8062 minimizing code duplication. Thm.rule_attribute and
8063 Thm.declaration_attribute build canonical attributes; see also structure
8064 Context for further operations on Context.generic, notably
8065 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
8066 declarations and definitions.
8068 * Context data interfaces (Theory/Proof/GenericDataFun): removed
8069 name/print, uninitialized data defaults to ad-hoc copy of empty value,
8070 init only required for impure data. INCOMPATIBILITY: empty really need
8071 to be empty (no dependencies on theory content!)
8073 * Pure/kernel: consts certification ignores sort constraints given in
8074 signature declarations. (This information is not relevant to the
8075 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
8076 potential INCOMPATIBILITY.
8078 * Pure: axiomatic type classes are now purely definitional, with
8079 explicit proofs of class axioms and super class relations performed
8080 internally. See Pure/axclass.ML for the main internal interfaces --
8081 notably AxClass.define_class supercedes AxClass.add_axclass, and
8082 AxClass.axiomatize_class/classrel/arity supersede
8083 Sign.add_classes/classrel/arities.
8085 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
8086 global/local versions on theory vs. Proof.context have been
8087 discontinued; Attrib.syntax and Method.syntax have been adapted
8088 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
8089 attributes, methods, etc.
8091 * Pure: several functions of signature "... -> theory -> theory * ..."
8092 have been reoriented to "... -> theory -> ... * theory" in order to
8093 allow natural usage in combination with the ||>, ||>>, |-> and
8094 fold_map combinators.
8096 * Pure: official theorem names (closed derivations) and additional
8097 comments (tags) are now strictly separate. Name hints -- which are
8098 maintained as tags -- may be attached any time without affecting the
8101 * Pure: primitive rule lift_rule now takes goal cterm instead of an
8102 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
8103 achieve the old behaviour.
8105 * Pure: the "Goal" constant is now called "prop", supporting a
8106 slightly more general idea of ``protecting'' meta-level rule
8109 * Pure: Logic.(un)varify only works in a global context, which is now
8110 enforced instead of silently assumed. INCOMPATIBILITY, may use
8111 Logic.legacy_(un)varify as temporary workaround.
8113 * Pure: structure Name provides scalable operations for generating
8114 internal variable names, notably Name.variants etc. This replaces
8115 some popular functions from term.ML:
8117 Term.variant -> Name.variant
8118 Term.variantlist -> Name.variant_list
8119 Term.invent_names -> Name.invent_list
8121 Note that low-level renaming rarely occurs in new code -- operations
8122 from structure Variable are used instead (see below).
8124 * Pure: structure Variable provides fundamental operations for proper
8125 treatment of fixed/schematic variables in a context. For example,
8126 Variable.import introduces fixes for schematics of given facts and
8127 Variable.export reverses the effect (up to renaming) -- this replaces
8128 various freeze_thaw operations.
8130 * Pure: structure Goal provides simple interfaces for
8131 init/conclude/finish and tactical prove operations (replacing former
8132 Tactic.prove). Goal.prove is the canonical way to prove results
8133 within a given context; Goal.prove_global is a degraded version for
8134 theory level goals, including a global Drule.standard. Note that
8135 OldGoals.prove_goalw_cterm has long been obsolete, since it is
8136 ill-behaved in a local proof context (e.g. with local fixes/assumes or
8137 in a locale context).
8139 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
8140 and type checking (Syntax.check_term etc.), with common combinations
8141 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
8142 which are considered legacy and await removal.
8144 * Pure/Syntax: generic interfaces for type unchecking
8145 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
8146 with common combinations (Syntax.pretty_term, Syntax.string_of_term
8147 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
8148 available for convenience, but refer to the very same operations using
8149 a mere theory instead of a full context.
8151 * Isar: simplified treatment of user-level errors, using exception
8152 ERROR of string uniformly. Function error now merely raises ERROR,
8153 without any side effect on output channels. The Isar toplevel takes
8154 care of proper display of ERROR exceptions. ML code may use plain
8155 handle/can/try; cat_error may be used to concatenate errors like this:
8157 ... handle ERROR msg => cat_error msg "..."
8159 Toplevel ML code (run directly or through the Isar toplevel) may be
8160 embedded into the Isar toplevel with exception display/debug like
8163 Isar.toplevel (fn () => ...)
8165 INCOMPATIBILITY, removed special transform_error facilities, removed
8166 obsolete variants of user-level exceptions (ERROR_MESSAGE,
8167 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
8168 -- use plain ERROR instead.
8170 * Isar: theory setup now has type (theory -> theory), instead of a
8171 list. INCOMPATIBILITY, may use #> to compose setup functions.
8173 * Isar: ML toplevel pretty printer for type Proof.context, subject to
8174 ProofContext.debug/verbose flags.
8176 * Isar: Toplevel.theory_to_proof admits transactions that modify the
8177 theory before entering a proof state. Transactions now always see a
8178 quasi-functional intermediate checkpoint, both in interactive and
8181 * Isar: simplified interfaces for outer syntax. Renamed
8182 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
8183 OuterSyntax.add_parsers -- this functionality is now included in
8184 OuterSyntax.command etc. INCOMPATIBILITY.
8186 * Simplifier: the simpset of a running simplification process now
8187 contains a proof context (cf. Simplifier.the_context), which is the
8188 very context that the initial simpset has been retrieved from (by
8189 simpset_of/local_simpset_of). Consequently, all plug-in components
8190 (solver, looper etc.) may depend on arbitrary proof data.
8192 * Simplifier.inherit_context inherits the proof context (plus the
8193 local bounds) of the current simplification process; any simproc
8194 etc. that calls the Simplifier recursively should do this! Removed
8195 former Simplifier.inherit_bounds, which is already included here --
8196 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
8197 specify an explicit context using Simplifier.context/theory_context.
8199 * Simplifier/Classical Reasoner: more abstract interfaces
8200 change_simpset/claset for modifying the simpset/claset reference of a
8201 theory; raw versions simpset/claset_ref etc. have been discontinued --
8204 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
8210 * settings: the default heap location within ISABELLE_HOME_USER now
8211 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
8212 Isabelle installations.
8214 * isabelle-process: option -S (secure mode) disables some critical
8215 operations, notably runtime compilation and evaluation of ML source
8218 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
8220 * Support for parallel execution, using native multicore support of
8221 Poly/ML 5.1. The theory loader exploits parallelism when processing
8222 independent theories, according to the given theory header
8223 specifications. The maximum number of worker threads is specified via
8224 usedir option -M or the "max-threads" setting in Proof General. A
8225 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
8226 to 6 on a 8-core machine. User-code needs to observe certain
8227 guidelines for thread-safe programming, see appendix A in the Isar
8228 Implementation manual.
8232 New in Isabelle2005 (October 2005)
8233 ----------------------------------
8237 * Theory headers: the new header syntax for Isar theories is
8240 imports <theory1> ... <theoryN>
8241 uses <file1> ... <fileM>
8244 where the 'uses' part is optional. The previous syntax
8246 theory <name> = <theory1> + ... + <theoryN>:
8248 will disappear in the next release. Use isatool fixheaders to convert
8249 existing theory files. Note that there is no change in ancient
8250 non-Isar theories now, but these will disappear soon.
8252 * Theory loader: parent theories can now also be referred to via
8253 relative and absolute paths.
8255 * Command 'find_theorems' searches for a list of criteria instead of a
8256 list of constants. Known criteria are: intro, elim, dest, name:string,
8257 simp:term, and any term. Criteria can be preceded by '-' to select
8258 theorems that do not match. Intro, elim, dest select theorems that
8259 match the current goal, name:s selects theorems whose fully qualified
8260 name contain s, and simp:term selects all simplification rules whose
8261 lhs match term. Any other term is interpreted as pattern and selects
8262 all theorems matching the pattern. Available in ProofGeneral under
8263 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
8265 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
8267 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
8268 matching the current goal as introduction rule and not having "HOL."
8269 in their name (i.e. not being defined in theory HOL).
8271 * Command 'thms_containing' has been discontinued in favour of
8272 'find_theorems'; INCOMPATIBILITY.
8274 * Communication with Proof General is now 8bit clean, which means that
8275 Unicode text in UTF-8 encoding may be used within theory texts (both
8276 formal and informal parts). Cf. option -U of the Isabelle Proof
8277 General interface. Here are some simple examples (cf. src/HOL/ex):
8279 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
8280 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
8282 * Improved efficiency of the Simplifier and, to a lesser degree, the
8283 Classical Reasoner. Typical big applications run around 2 times
8287 *** Document preparation ***
8289 * Commands 'display_drafts' and 'print_drafts' perform simple output
8290 of raw sources. Only those symbols that do not require additional
8291 LaTeX packages (depending on comments in isabellesym.sty) are
8292 displayed properly, everything else is left verbatim. isatool display
8293 and isatool print are used as front ends (these are subject to the
8294 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
8296 * Command tags control specific markup of certain regions of text,
8297 notably folding and hiding. Predefined tags include "theory" (for
8298 theory begin and end), "proof" for proof commands, and "ML" for
8299 commands involving ML code; the additional tags "visible" and
8300 "invisible" are unused by default. Users may give explicit tag
8301 specifications in the text, e.g. ''by %invisible (auto)''. The
8302 interpretation of tags is determined by the LaTeX job during document
8303 preparation: see option -V of isatool usedir, or options -n and -t of
8304 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
8307 Several document versions may be produced at the same time via isatool
8308 usedir (the generated index.html will link all of them). Typical
8309 specifications include ''-V document=theory,proof,ML'' to present
8310 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
8311 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
8312 these parts without any formal replacement text. The Isabelle site
8313 default settings produce ''document'' and ''outline'' versions as
8316 * Several new antiquotations:
8318 @{term_type term} prints a term with its type annotated;
8320 @{typeof term} prints the type of a term;
8322 @{const const} is the same as @{term const}, but checks that the
8323 argument is a known logical constant;
8325 @{term_style style term} and @{thm_style style thm} print a term or
8326 theorem applying a "style" to it
8330 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
8331 definitions, equations, inequations etc., 'concl' printing only the
8332 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
8333 to print the specified premise. TermStyle.add_style provides an ML
8334 interface for introducing further styles. See also the "LaTeX Sugar"
8335 document practical applications. The ML antiquotation prints
8336 type-checked ML expressions verbatim.
8338 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
8339 and 'text' support optional locale specification '(in loc)', which
8340 specifies the default context for interpreting antiquotations. For
8341 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8343 * Option 'locale=NAME' of antiquotations specifies an alternative
8344 context interpreting the subsequent argument. For example: @{thm
8345 [locale=lattice] inf_assoc}.
8347 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8350 * Proper output of antiquotations for theory commands involving a
8351 proof context (such as 'locale' or 'theorem (in loc) ...').
8353 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8354 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8356 * isatool usedir: new option -C (default true) controls whether option
8357 -D should include a copy of the original document directory; -C false
8358 prevents unwanted effects such as copying of administrative CVS data.
8363 * Considerably improved version of 'constdefs' command. Now performs
8364 automatic type-inference of declared constants; additional support for
8365 local structure declarations (cf. locales and HOL records), see also
8366 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8367 sequential dependencies of definitions within a single 'constdefs'
8368 section; moreover, the declared name needs to be an identifier. If
8369 all fails, consider to fall back on 'consts' and 'defs' separately.
8371 * Improved indexed syntax and implicit structures. First of all,
8372 indexed syntax provides a notational device for subscripted
8373 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8374 expressions. Secondly, in a local context with structure
8375 declarations, number indexes \<^sub>n or the empty index (default
8376 number 1) refer to a certain fixed variable implicitly; option
8377 show_structs controls printing of implicit structures. Typical
8378 applications of these concepts involve record types and locales.
8380 * New command 'no_syntax' removes grammar declarations (and
8381 translations) resulting from the given syntax specification, which is
8382 interpreted in the same manner as for the 'syntax' command.
8384 * 'Advanced' translation functions (parse_translation etc.) may depend
8385 on the signature of the theory context being presently used for
8386 parsing/printing, see also isar-ref manual.
8388 * Improved 'oracle' command provides a type-safe interface to turn an
8389 ML expression of type theory -> T -> term into a primitive rule of
8390 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8391 is already included here); see also FOL/ex/IffExample.thy;
8394 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8395 before); "cI" is no longer bound, use "c.intro" instead.
8396 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8397 axclasses vs. locales.
8399 * Improved internal renaming of symbolic identifiers -- attach primes
8400 instead of base 26 numbers.
8402 * New flag show_question_marks controls printing of leading question
8403 marks in schematic variable names.
8405 * In schematic variable names, *any* symbol following \<^isub> or
8406 \<^isup> is now treated as part of the base name. For example, the
8407 following works without printing of awkward ".0" indexes:
8409 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8412 * Inner syntax includes (*(*nested*) comments*).
8414 * Pretty printer now supports unbreakable blocks, specified in mixfix
8415 annotations as "(00...)".
8417 * Clear separation of logical types and nonterminals, where the latter
8418 may only occur in 'syntax' specifications or type abbreviations.
8419 Before that distinction was only partially implemented via type class
8420 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8421 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8422 exotic syntax specifications may require further adaption
8423 (e.g. Cube/Cube.thy).
8425 * Removed obsolete type class "logic", use the top sort {} instead.
8426 Note that non-logical types should be declared as 'nonterminals'
8427 rather than 'types'. INCOMPATIBILITY for new object-logic
8430 * Attributes 'induct' and 'cases': type or set names may now be
8431 locally fixed variables as well.
8433 * Simplifier: can now control the depth to which conditional rewriting
8434 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8437 * Simplifier: simplification procedures may now take the current
8438 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8439 interface), which is very useful for calling the Simplifier
8440 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8441 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8442 low-level mk_simproc no longer applies Logic.varify internally, to
8443 allow for use in a context of fixed variables.
8445 * thin_tac now works even if the assumption being deleted contains !!
8446 or ==>. More generally, erule now works even if the major premise of
8447 the elimination rule contains !! or ==>.
8449 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8451 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8452 from Pure, which contains all common declarations already. Both
8453 theories are defined via plain Isabelle/Isar .thy files.
8454 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8455 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8456 use isatool fixcpure to adapt your theory and ML sources.
8458 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8459 selections of theorems in named facts via index ranges.
8461 * 'print_theorems': in theory mode, really print the difference
8462 wrt. the last state (works for interactive theory development only),
8463 in proof mode print all local facts (cf. 'print_facts');
8465 * 'hide': option '(open)' hides only base names.
8467 * More efficient treatment of intermediate checkpoints in interactive
8470 * Code generator is now invoked via code_module (incremental code
8471 generation) and code_library (modular code generation, ML structures
8472 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8473 must be quoted when used as identifiers.
8475 * New 'value' command for reading, evaluating and printing terms using
8476 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8477 quoted when used as identifier.
8482 * New commands for the interpretation of locale expressions in
8483 theories (1), locales (2) and proof contexts (3). These generate
8484 proof obligations from the expression specification. After the
8485 obligations have been discharged, theorems of the expression are added
8486 to the theory, target locale or proof context. The synopsis of the
8487 commands is a follows:
8489 (1) interpretation expr inst
8490 (2) interpretation target < expr
8491 (3) interpret expr inst
8493 Interpretation in theories and proof contexts require a parameter
8494 instantiation of terms from the current context. This is applied to
8495 specifications and theorems of the interpreted expression.
8496 Interpretation in locales only permits parameter renaming through the
8497 locale expression. Interpretation is smart in that interpretations
8498 that are active already do not occur in proof obligations, neither are
8499 instantiated theorems stored in duplicate. Use 'print_interps' to
8500 inspect active interpretations of a particular locale. For details,
8501 see the Isar Reference manual. Examples can be found in
8502 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8504 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8505 'interpret' instead.
8507 * New context element 'constrains' for adding type constraints to
8510 * Context expressions: renaming of parameters with syntax
8513 * Locale declaration: 'includes' disallowed.
8515 * Proper static binding of attribute syntax -- i.e. types / terms /
8516 facts mentioned as arguments are always those of the locale definition
8517 context, independently of the context of later invocations. Moreover,
8518 locale operations (renaming and type / term instantiation) are applied
8519 to attribute arguments as expected.
8521 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8522 actual attributes; rare situations may require Attrib.attribute to
8523 embed those attributes into Attrib.src that lack concrete syntax.
8524 Attribute implementations need to cooperate properly with the static
8525 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8526 Attrib.XXX_thm etc. already do the right thing without further
8527 intervention. Only unusual applications -- such as "where" or "of"
8528 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8529 on the context and the facts involved -- may have to assign parsed
8530 values to argument tokens explicitly.
8532 * Changed parameter management in theorem generation for long goal
8533 statements with 'includes'. INCOMPATIBILITY: produces a different
8534 theorem statement in rare situations.
8536 * Locale inspection command 'print_locale' omits notes elements. Use
8537 'print_locale!' to have them included in the output.
8542 * Provers/hypsubst.ML: improved version of the subst method, for
8543 single-step rewriting: it now works in bound variable contexts. New is
8544 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8545 rewrite a different subterm than the original subst method, which is
8546 still available as 'simplesubst'.
8548 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8551 * Provers/trancl.ML: new transitivity reasoner for transitive and
8552 reflexive-transitive closure of relations.
8554 * Provers/blast.ML: new reference depth_limit to make blast's depth
8555 limit (previously hard-coded with a value of 20) user-definable.
8557 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8558 is peformed already. Object-logics merely need to finish their
8559 initial simpset configuration as before. INCOMPATIBILITY.
8564 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8567 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8569 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8570 and x-symbol; use option '-m epsilon' to get it actually printed.
8571 Moreover, the mathematically important symbolic identifier \<epsilon>
8572 becomes available as variable, constant etc. INCOMPATIBILITY,
8574 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8575 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8576 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8577 support corresponding Isar calculations.
8579 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8582 * theory SetInterval: changed the syntax for open intervals:
8591 The old syntax is still supported but will disappear in the next
8592 release. For conversion use the following Emacs search and replace
8593 patterns (these are not perfect but work quite well):
8595 {)\([^\.]*\)\.\. -> {\1<\.\.}
8596 \.\.\([^(}]*\)(} -> \.\.<\1}
8598 * Theory Commutative_Ring (in Library): method comm_ring for proving
8599 equalities in commutative rings; method 'algebra' provides a generic
8602 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8603 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8604 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8607 Some new syntax forms are available:
8609 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8610 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8611 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8612 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8614 The latter form "\<Sum>x < k. e" used to be based on a separate
8615 function "Summation", which has been discontinued.
8617 * theory Finite_Set: in structured induction proofs, the insert case
8618 is now 'case (insert x F)' instead of the old counterintuitive 'case
8621 * The 'refute' command has been extended to support a much larger
8622 fragment of HOL, including axiomatic type classes, constdefs and
8623 typedefs, inductive datatypes and recursion.
8625 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8626 Requires zChaff with proof generation to be installed. See
8627 HOL/ex/SAT_Examples.thy for examples.
8629 * Datatype induction via method 'induct' now preserves the name of the
8630 induction variable. For example, when proving P(xs::'a list) by
8631 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8632 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8633 in unstructured proof scripts.
8635 * Reworked implementation of records. Improved scalability for
8636 records with many fields, avoiding performance problems for type
8637 inference. Records are no longer composed of nested field types, but
8638 of nested extension types. Therefore the record type only grows linear
8639 in the number of extensions and not in the number of fields. The
8640 top-level (users) view on records is preserved. Potential
8641 INCOMPATIBILITY only in strange cases, where the theory depends on the
8642 old record representation. The type generated for a record is called
8643 <record_name>_ext_type.
8645 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8646 proofs triggered by a record definition or a simproc (if
8647 quick_and_dirty is enabled). Definitions of large records can take
8650 New simproc record_upd_simproc for simplification of multiple record
8651 updates enabled by default. Moreover, trivial updates are also
8652 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8653 occasionally, since simplification is more powerful by default.
8655 * typedef: proper support for polymorphic sets, which contain extra
8656 type-variables in the term.
8658 * Simplifier: automatically reasons about transitivity chains
8659 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8660 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8661 old proofs break occasionally as simplification may now solve more
8662 goals than previously.
8664 * Simplifier: converts x <= y into x = y if assumption y <= x is
8665 present. Works for all partial orders (class "order"), in particular
8666 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8669 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8670 bound variable or a constant then the let is unfolded. Otherwise
8671 first a is simplified to b, and then f b is simplified to g. If
8672 possible we abstract b from g arriving at "let x = b in h x",
8673 otherwise we unfold the let and arrive at g. The simproc can be
8674 enabled/disabled by the reference use_let_simproc. Potential
8675 INCOMPATIBILITY since simplification is more powerful by default.
8677 * Classical reasoning: the meson method now accepts theorems as arguments.
8679 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8680 jobs to provide advice on the provability of subgoals.
8682 * Theory OrderedGroup and Ring_and_Field: various additions and
8683 improvements to faciliate calculations involving equalities and
8686 The following theorems have been eliminated or modified
8689 abs_eq now named abs_of_nonneg
8690 abs_of_ge_0 now named abs_of_nonneg
8691 abs_minus_eq now named abs_of_nonpos
8692 imp_abs_id now named abs_of_nonneg
8693 imp_abs_neg_id now named abs_of_nonpos
8694 mult_pos now named mult_pos_pos
8695 mult_pos_le now named mult_nonneg_nonneg
8696 mult_pos_neg_le now named mult_nonneg_nonpos
8697 mult_pos_neg2_le now named mult_nonneg_nonpos2
8698 mult_neg now named mult_neg_neg
8699 mult_neg_le now named mult_nonpos_nonpos
8701 * The following lemmas in Ring_and_Field have been added to the simplifier:
8704 not_square_less_zero
8706 The following lemmas have been deleted from Real/RealPow:
8716 * Theory Parity: added rules for simplifying exponents.
8720 The following theorems have been eliminated or modified
8723 list_all_Nil now named list_all.simps(1)
8724 list_all_Cons now named list_all.simps(2)
8725 list_all_conv now named list_all_iff
8726 set_mem_eq now named mem_iff
8728 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8729 asymptotic "big O" calculations. See the notes in BigO.thy.
8734 * Theory RealDef: better support for embedding natural numbers and
8735 integers in the reals.
8737 The following theorems have been eliminated or modified
8740 exp_ge_add_one_self now requires no hypotheses
8741 real_of_int_add reversed direction of equality (use [symmetric])
8742 real_of_int_minus reversed direction of equality (use [symmetric])
8743 real_of_int_diff reversed direction of equality (use [symmetric])
8744 real_of_int_mult reversed direction of equality (use [symmetric])
8746 * Theory RComplete: expanded support for floor and ceiling functions.
8748 * Theory Ln is new, with properties of the natural logarithm
8750 * Hyperreal: There is a new type constructor "star" for making
8751 nonstandard types. The old type names are now type synonyms:
8755 hcomplex = complex star
8757 * Hyperreal: Many groups of similarly-defined constants have been
8758 replaced by polymorphic versions (INCOMPATIBILITY):
8760 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8762 starset <-- starsetNat, starsetC
8763 *s* <-- *sNat*, *sc*
8764 starset_n <-- starsetNat_n, starsetC_n
8765 *sn* <-- *sNatn*, *scn*
8766 InternalSets <-- InternalNatSets, InternalCSets
8768 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8769 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8770 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8771 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8772 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8774 * Hyperreal: Many type-specific theorems have been removed in favor of
8775 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8777 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8778 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8779 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8780 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8781 right_minus <-- hypreal_add_minus
8782 left_minus <-- {hypreal,hcomplex}_add_minus_left
8783 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8784 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8785 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8786 mult_1_right <-- hcomplex_mult_one_right
8787 mult_zero_left <-- hcomplex_mult_zero_left
8788 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8789 right_distrib <-- hypnat_add_mult_distrib2
8790 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8791 right_inverse <-- hypreal_mult_inverse
8792 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8793 order_refl <-- {hypreal,hypnat}_le_refl
8794 order_trans <-- {hypreal,hypnat}_le_trans
8795 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8796 order_less_le <-- {hypreal,hypnat}_less_le
8797 linorder_linear <-- {hypreal,hypnat}_le_linear
8798 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8799 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8800 add_nonneg_nonneg <-- hypreal_le_add_order
8802 * Hyperreal: Separate theorems having to do with type-specific
8803 versions of constants have been merged into theorems that apply to the
8804 new polymorphic constants (INCOMPATIBILITY):
8806 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8807 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8808 STAR_Un <-- {STAR,NatStar,STARC}_Un
8809 STAR_Int <-- {STAR,NatStar,STARC}_Int
8810 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8811 STAR_subset <-- {STAR,NatStar,STARC}_subset
8812 STAR_mem <-- {STAR,NatStar,STARC}_mem
8813 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8814 STAR_diff <-- {STAR,STARC}_diff
8815 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8816 STARC_hcomplex_of_complex}_image_subset
8817 starset_n_Un <-- starset{Nat,C}_n_Un
8818 starset_n_Int <-- starset{Nat,C}_n_Int
8819 starset_n_Compl <-- starset{Nat,C}_n_Compl
8820 starset_n_diff <-- starset{Nat,C}_n_diff
8821 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8822 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8823 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8824 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8825 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8826 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8827 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8828 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8829 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8830 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8831 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8832 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8833 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8834 starfun_diff <-- starfun{C,RC,CR}_diff
8835 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8836 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8837 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8838 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8839 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8840 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8841 starfun_Id <-- starfunC_Id
8842 starfun_approx <-- starfun{Nat,CR}_approx
8843 starfun_capprox <-- starfun{C,RC}_capprox
8844 starfun_abs <-- starfunNat_rabs
8845 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8846 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8847 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8848 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8849 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8850 starfun_add_approx <-- starfunCR_add_approx
8851 starfun_inverse_inverse <-- starfunC_inverse_inverse
8852 starfun_divide <-- starfun{C,CR,RC}_divide
8853 starfun_n <-- starfun{Nat,C}_n
8854 starfun_n_mult <-- starfun{Nat,C}_n_mult
8855 starfun_n_add <-- starfun{Nat,C}_n_add
8856 starfun_n_add_minus <-- starfunNat_n_add_minus
8857 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8858 starfun_n_minus <-- starfun{Nat,C}_n_minus
8859 starfun_n_eq <-- starfun{Nat,C}_n_eq
8861 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8862 star_n_minus <-- {hypreal,hcomplex}_minus
8863 star_n_diff <-- {hypreal,hcomplex}_diff
8864 star_n_mult <-- {hypreal,hcomplex}_mult
8865 star_n_inverse <-- {hypreal,hcomplex}_inverse
8866 star_n_le <-- {hypreal,hypnat}_le
8867 star_n_less <-- {hypreal,hypnat}_less
8868 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8869 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8870 star_n_abs <-- hypreal_hrabs
8871 star_n_divide <-- hcomplex_divide
8873 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8874 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8875 star_of_diff <-- hypreal_of_real_diff
8876 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8877 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8878 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8879 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8880 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8881 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8882 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8883 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8884 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8885 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8886 star_of_number_of <-- {hypreal,hcomplex}_number_of
8887 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8888 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8889 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8890 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8891 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8892 star_of_power <-- hypreal_of_real_power
8893 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8895 * Hyperreal: new method "transfer" that implements the transfer
8896 principle of nonstandard analysis. With a subgoal that mentions
8897 nonstandard types like "'a star", the command "apply transfer"
8898 replaces it with an equivalent one that mentions only standard types.
8899 To be successful, all free variables must have standard types; non-
8900 standard variables must have explicit universal quantifiers.
8902 * Hyperreal: A theory of Taylor series.
8907 * Discontinued special version of 'constdefs' (which used to support
8908 continuous functions) in favor of the general Pure one with full
8911 * New simplification procedure for solving continuity conditions; it
8912 is much faster on terms with many nested lambda abstractions (cubic
8913 instead of exponential time).
8915 * New syntax for domain package: selector names are now optional.
8916 Parentheses should be omitted unless argument is lazy, for example:
8918 domain 'a stream = cons "'a" (lazy "'a stream")
8920 * New command 'fixrec' for defining recursive functions with pattern
8921 matching; defining multiple functions with mutual recursion is also
8922 supported. Patterns may include the constants cpair, spair, up, sinl,
8923 sinr, or any data constructor defined by the domain package. The given
8924 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8925 syntax and examples.
8927 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8928 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8929 but the proof obligation additionally includes an admissibility
8930 requirement. The packages generate instances of class cpo or pcpo,
8931 with continuity and strictness theorems for Rep and Abs.
8933 * HOLCF: Many theorems have been renamed according to a more standard naming
8934 scheme (INCOMPATIBILITY):
8936 foo_inject: "foo$x = foo$y ==> x = y"
8937 foo_eq: "(foo$x = foo$y) = (x = y)"
8938 foo_less: "(foo$x << foo$y) = (x << y)"
8939 foo_strict: "foo$UU = UU"
8940 foo_defined: "... ==> foo$x ~= UU"
8941 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8946 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8947 including the First Isomorphism Theorem (on quotienting by the kernel
8950 * ZF/Simplifier: install second copy of type solver that actually
8951 makes use of TC rules declared to Isar proof contexts (or locales);
8952 the old version is still required for ML proof scripts.
8957 * Converted to Isar theory format; use locales instead of axiomatic
8963 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8966 * Pure/library.ML no longer defines its own option datatype, but uses
8967 that of the SML basis, which has constructors NONE and SOME instead of
8968 None and Some, as well as exception Option.Option instead of OPTION.
8969 The functions the, if_none, is_some, is_none have been adapted
8970 accordingly, while Option.map replaces apsome.
8972 * Pure/library.ML: the exception LIST has been given up in favour of
8973 the standard exceptions Empty and Subscript, as well as
8974 Library.UnequalLengths. Function like Library.hd and Library.tl are
8975 superceded by the standard hd and tl functions etc.
8977 A number of basic list functions are no longer exported to the ML
8978 toplevel, as they are variants of predefined functions. The following
8979 suggests how one can translate existing code:
8981 rev_append xs ys = List.revAppend (xs, ys)
8982 nth_elem (i, xs) = List.nth (xs, i)
8983 last_elem xs = List.last xs
8984 flat xss = List.concat xss
8985 seq fs = List.app fs
8986 partition P xs = List.partition P xs
8987 mapfilter f xs = List.mapPartial f xs
8989 * Pure/library.ML: several combinators for linear functional
8990 transformations, notably reverse application and composition:
8993 (x, y) |-> f f #-> g
8995 * Pure/library.ML: introduced/changed precedence of infix operators:
8997 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8999 infix 3 o oo ooo oooo;
9000 infix 4 ~~ upto downto;
9002 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
9005 * Pure/library.ML: natural list combinators fold, fold_rev, and
9006 fold_map support linear functional transformations and nesting. For
9009 fold f [x1, ..., xN] y =
9010 y |> f x1 |> ... |> f xN
9012 (fold o fold) f [xs1, ..., xsN] y =
9013 y |> fold f xs1 |> ... |> fold f xsN
9015 fold f [x1, ..., xN] =
9018 (fold o fold) f [xs1, ..., xsN] =
9019 fold f xs1 #> ... #> fold f xsN
9021 * Pure/library.ML: the following selectors on type 'a option are
9024 the: 'a option -> 'a (*partial*)
9025 these: 'a option -> 'a where 'a = 'b list
9026 the_default: 'a -> 'a option -> 'a
9027 the_list: 'a option -> 'a list
9029 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9030 basic operations for association lists, following natural argument
9031 order; moreover the explicit equality predicate passed here avoids
9032 potentially expensive polymorphic runtime equality checks.
9033 The old functions may be expressed as follows:
9035 assoc = uncurry (AList.lookup (op =))
9036 assocs = these oo AList.lookup (op =)
9037 overwrite = uncurry (AList.update (op =)) o swap
9039 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
9041 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
9042 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
9044 replacing make_keylist and keyfilter (occassionally used)
9047 make_keylist = AList.make
9048 keyfilter = AList.find (op =)
9050 * eq_fst and eq_snd now take explicit equality parameter, thus
9051 avoiding eqtypes. Naive rewrites:
9053 eq_fst = eq_fst (op =)
9054 eq_snd = eq_snd (op =)
9056 * Removed deprecated apl and apr (rarely used).
9059 apl (n, op) =>>= curry op n
9060 apr (op, m) =>>= fn n => op (n, m)
9062 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
9063 provides a reasonably efficient light-weight implementation of sets as
9066 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
9067 few new operations; existing lookup and update are now curried to
9068 follow natural argument order (for use with fold etc.);
9069 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
9071 * Pure/General: output via the Isabelle channels of
9072 writeln/warning/error etc. is now passed through Output.output, with a
9073 hook for arbitrary transformations depending on the print_mode
9074 (cf. Output.add_mode -- the first active mode that provides a output
9075 function wins). Already formatted output may be embedded into further
9076 text via Output.raw; the result of Pretty.string_of/str_of and derived
9077 functions (string_of_term/cterm/thm etc.) is already marked raw to
9078 accommodate easy composition of diagnostic messages etc. Programmers
9079 rarely need to care about Output.output or Output.raw at all, with
9080 some notable exceptions: Output.output is required when bypassing the
9081 standard channels (writeln etc.), or in token translations to produce
9082 properly formatted results; Output.raw is required when capturing
9083 already output material that will eventually be presented to the user
9084 a second time. For the default print mode, both Output.output and
9085 Output.raw have no effect.
9087 * Pure/General: Output.time_accumulator NAME creates an operator ('a
9088 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
9089 cumulative results are displayed at the end of a batch session.
9091 * Pure/General: File.sysify_path and File.quote_sysify path have been
9092 replaced by File.platform_path and File.shell_path (with appropriate
9093 hooks). This provides a clean interface for unusual systems where the
9094 internal and external process view of file names are different.
9096 * Pure: more efficient orders for basic syntactic entities: added
9097 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
9098 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
9099 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
9100 orders now -- potential INCOMPATIBILITY for code that depends on a
9101 particular order for Symtab.keys, Symtab.dest, etc. (consider using
9102 Library.sort_strings on result).
9104 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
9105 fold_types traverse types/terms from left to right, observing natural
9106 argument order. Supercedes previous foldl_XXX versions, add_frees,
9107 add_vars etc. have been adapted as well: INCOMPATIBILITY.
9109 * Pure: name spaces have been refined, with significant changes of the
9110 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
9111 to extern(_table). The plain name entry path is superceded by a
9112 general 'naming' context, which also includes the 'policy' to produce
9113 a fully qualified name and external accesses of a fully qualified
9114 name; NameSpace.extend is superceded by context dependent
9115 Sign.declare_name. Several theory and proof context operations modify
9116 the naming context. Especially note Theory.restore_naming and
9117 ProofContext.restore_naming to get back to a sane state; note that
9118 Theory.add_path is no longer sufficient to recover from
9119 Theory.absolute_path in particular.
9121 * Pure: new flags short_names (default false) and unique_names
9122 (default true) for controlling output of qualified names. If
9123 short_names is set, names are printed unqualified. If unique_names is
9124 reset, the name prefix is reduced to the minimum required to achieve
9125 the original result when interning again, even if there is an overlap
9126 with earlier declarations.
9128 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
9129 now 'extend', and 'merge' gets an additional Pretty.pp argument
9130 (useful for printing error messages). INCOMPATIBILITY.
9132 * Pure: major reorganization of the theory context. Type Sign.sg and
9133 Theory.theory are now identified, referring to the universal
9134 Context.theory (see Pure/context.ML). Actual signature and theory
9135 content is managed as theory data. The old code and interfaces were
9136 spread over many files and structures; the new arrangement introduces
9137 considerable INCOMPATIBILITY to gain more clarity:
9139 Context -- theory management operations (name, identity, inclusion,
9140 parents, ancestors, merge, etc.), plus generic theory data;
9142 Sign -- logical signature and syntax operations (declaring consts,
9143 types, etc.), plus certify/read for common entities;
9145 Theory -- logical theory operations (stating axioms, definitions,
9146 oracles), plus a copy of logical signature operations (consts,
9147 types, etc.); also a few basic management operations (Theory.copy,
9150 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
9151 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
9152 for convenience -- they merely return the theory.
9154 * Pure: type Type.tsig is superceded by theory in most interfaces.
9156 * Pure: the Isar proof context type is already defined early in Pure
9157 as Context.proof (note that ProofContext.context and Proof.context are
9158 aliases, where the latter is the preferred name). This enables other
9159 Isabelle components to refer to that type even before Isar is present.
9161 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
9162 typeK, constK, axiomK, oracleK), but provide explicit operations for
9163 any of these kinds. For example, Sign.intern typeK is now
9164 Sign.intern_type, Theory.hide_space Sign.typeK is now
9165 Theory.hide_types. Also note that former
9166 Theory.hide_classes/types/consts are now
9167 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
9168 internalize their arguments! INCOMPATIBILITY.
9170 * Pure: get_thm interface (of PureThy and ProofContext) expects
9171 datatype thmref (with constructors Name and NameSelection) instead of
9172 plain string -- INCOMPATIBILITY;
9174 * Pure: cases produced by proof methods specify options, where NONE
9175 means to remove case bindings -- INCOMPATIBILITY in
9178 * Pure: the following operations retrieve axioms or theorems from a
9179 theory node or theory hierarchy, respectively:
9181 Theory.axioms_of: theory -> (string * term) list
9182 Theory.all_axioms_of: theory -> (string * term) list
9183 PureThy.thms_of: theory -> (string * thm) list
9184 PureThy.all_thms_of: theory -> (string * thm) list
9186 * Pure: print_tac now outputs the goal through the trace channel.
9188 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
9189 Reference Toplevel.debug (default false) controls detailed printing
9190 and tracing of low-level exceptions; Toplevel.profiling (default 0)
9191 controls execution profiling -- set to 1 for time and 2 for space
9192 (both increase the runtime).
9194 * Isar session: The initial use of ROOT.ML is now always timed,
9195 i.e. the log will show the actual process times, in contrast to the
9196 elapsed wall-clock time that the outer shell wrapper produces.
9198 * Simplifier: improved handling of bound variables (nameless
9199 representation, avoid allocating new strings). Simprocs that invoke
9200 the Simplifier recursively should use Simplifier.inherit_bounds to
9201 avoid local name clashes. Failure to do so produces warnings
9202 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
9203 for further details.
9205 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
9206 bindings for all theorems stored within a given theory; this may help
9207 in porting non-Isar theories to Isar ones, while keeping ML proof
9208 scripts for the time being.
9210 * ML operator HTML.with_charset specifies the charset begin used for
9211 generated HTML files. For example:
9213 HTML.with_charset "utf-8" use_thy "Hebrew";
9214 HTML.with_charset "utf-8" use_thy "Chinese";
9219 * Allow symlinks to all proper Isabelle executables (Isabelle,
9220 isabelle, isatool etc.).
9222 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
9223 isatool doc, isatool mkdir, display_drafts etc.).
9225 * isatool usedir: option -f allows specification of the ML file to be
9226 used by Isabelle; default is ROOT.ML.
9228 * New isatool version outputs the version identifier of the Isabelle
9229 distribution being used.
9231 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
9232 (containing Boolean satisfiability problems) into Isabelle/HOL
9237 New in Isabelle2004 (April 2004)
9238 --------------------------------
9242 * Provers/order.ML: new efficient reasoner for partial and linear orders.
9243 Replaces linorder.ML.
9245 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
9246 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
9247 (\<a>...\<z>), are now considered normal letters, and can therefore
9248 be used anywhere where an ASCII letter (a...zA...Z) has until
9249 now. COMPATIBILITY: This obviously changes the parsing of some
9250 terms, especially where a symbol has been used as a binder, say
9251 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
9252 as an identifier. Fix it by inserting a space around former
9253 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
9254 existing theory and ML files.
9256 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
9258 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
9259 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
9260 a normal (but invisible) letter. For multiple letter subscripts repeat
9261 \<^isub> like this: x\<^isub>1\<^isub>2.
9263 * Pure: There are now sub-/superscripts that can span more than one
9264 character. Text between \<^bsub> and \<^esub> is set in subscript in
9265 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
9266 superscript. The new control characters are not identifier parts.
9268 * Pure: Control-symbols of the form \<^raw:...> will literally print the
9269 content of "..." to the latex file instead of \isacntrl... . The "..."
9270 may consist of any printable characters excluding the end bracket >.
9272 * Pure: Using new Isar command "finalconsts" (or the ML functions
9273 Theory.add_finals or Theory.add_finals_i) it is now possible to
9274 declare constants "final", which prevents their being given a definition
9275 later. It is useful for constants whose behaviour is fixed axiomatically
9276 rather than definitionally, such as the meta-logic connectives.
9278 * Pure: 'instance' now handles general arities with general sorts
9279 (i.e. intersections of classes),
9281 * Presentation: generated HTML now uses a CSS style sheet to make layout
9282 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
9283 It can be changed to alter the colors/layout of generated pages.
9288 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
9289 cut_tac, subgoal_tac and thin_tac:
9290 - Now understand static (Isar) contexts. As a consequence, users of Isar
9291 locales are no longer forced to write Isar proof scripts.
9292 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
9294 - INCOMPATIBILITY: names of variables to be instantiated may no
9295 longer be enclosed in quotes. Instead, precede variable name with `?'.
9296 This is consistent with the instantiation attribute "where".
9298 * Attributes "where" and "of":
9299 - Now take type variables of instantiated theorem into account when reading
9300 the instantiation string. This fixes a bug that caused instantiated
9301 theorems to have too special types in some circumstances.
9302 - "where" permits explicit instantiations of type variables.
9304 * Calculation commands "moreover" and "also" no longer interfere with
9305 current facts ("this"), admitting arbitrary combinations with "then"
9309 - Goal statements involving the context element "includes" no longer
9310 generate theorems with internal delta predicates (those ending on
9311 "_axioms") in the premise.
9312 Resolve particular premise with <locale>.intro to obtain old form.
9313 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
9314 specification and "includes" elements in goal statement.
9315 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
9316 [intro?] and [elim?] (respectively) by default.
9317 - Experimental command for instantiation of locales in proof contexts:
9318 instantiate <label>[<attrs>]: <loc>
9319 Instantiates locale <loc> and adds all its theorems to the current context
9320 taking into account their attributes. Label and attrs are optional
9321 modifiers, like in theorem declarations. If present, names of
9322 instantiated theorems are qualified with <label>, and the attributes
9323 <attrs> are applied after any attributes these theorems might have already.
9324 If the locale has assumptions, a chained fact of the form
9325 "<loc> t1 ... tn" is expected from which instantiations of the parameters
9326 are derived. The command does not support old-style locales declared
9327 with "locale (open)".
9328 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
9330 * HOL: Tactic emulation methods induct_tac and case_tac understand static
9336 * Proof import: new image HOL4 contains the imported library from
9337 the HOL4 system with about 2500 theorems. It is imported by
9338 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
9339 can be used like any other Isabelle image. See
9340 HOL/Import/HOL/README for more information.
9343 - Much improved handling of linear and partial orders.
9344 Reasoners for linear and partial orders are set up for type classes
9345 "linorder" and "order" respectively, and are added to the default simpset
9346 as solvers. This means that the simplifier can build transitivity chains
9347 to solve goals from the assumptions.
9348 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9349 of blast or auto after simplification become unnecessary because the goal
9350 is solved by simplification already.
9352 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9353 all proved in axiomatic type classes for semirings, rings and fields.
9356 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9357 now formalized using the Ring_and_Field theory mentioned above.
9358 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9359 than before, because now they are set up once in a generic manner.
9360 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9361 Look for the general versions in Ring_and_Field (and Power if they concern
9364 * Type "rat" of the rational numbers is now available in HOL-Complex.
9367 - Record types are now by default printed with their type abbreviation
9368 instead of the list of all field types. This can be configured via
9369 the reference "print_record_type_abbr".
9370 - Simproc "record_upd_simproc" for simplification of multiple updates added
9371 (not enabled by default).
9372 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9373 EX x. x = sel r to True (not enabled by default).
9374 - Tactic "record_split_simp_tac" to split and simplify records added.
9376 * 'specification' command added, allowing for definition by
9377 specification. There is also an 'ax_specification' command that
9378 introduces the new constants axiomatically.
9380 * arith(_tac) is now able to generate counterexamples for reals as well.
9382 * HOL-Algebra: new locale "ring" for non-commutative rings.
9384 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9385 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9387 * HOL-Matrix: a first theory for matrices in HOL with an application of
9388 matrix theory to linear programming.
9390 * Unions and Intersections:
9391 The latex output syntax of UN and INT has been changed
9392 from "\Union x \in A. B" to "\Union_{x \in A} B"
9393 i.e. the index formulae has become a subscript.
9394 Similarly for "\Union x. B", and for \Inter instead of \Union.
9396 * Unions and Intersections over Intervals:
9397 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9398 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9399 like in normal math, and corresponding versions for < and for intersection.
9401 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9402 lexicographic dictonary ordering has been added as "lexord".
9404 * ML: the legacy theory structures Int and List have been removed. They had
9405 conflicted with ML Basis Library structures having the same names.
9407 * 'refute' command added to search for (finite) countermodels. Only works
9408 for a fragment of HOL. The installation of an external SAT solver is
9409 highly recommended. See "HOL/Refute.thy" for details.
9411 * 'quickcheck' command: Allows to find counterexamples by evaluating
9412 formulae under an assignment of free variables to random values.
9413 In contrast to 'refute', it can deal with inductive datatypes,
9414 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9420 * Streams now come with concatenation and are part of the HOLCF image
9424 New in Isabelle2003 (May 2003)
9425 ------------------------------
9429 * Provers/simplifier:
9431 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9432 Assumptions are now subject to complete mutual simplification,
9433 not just from left to right. The simplifier now preserves
9434 the order of assumptions.
9436 Potential INCOMPATIBILITY:
9438 -- simp sometimes diverges where the old version did
9439 not, e.g. invoking simp on the goal
9441 [| P (f x); y = x; f x = f y |] ==> Q
9443 now gives rise to the infinite reduction sequence
9445 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9447 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9450 -- Tactics combining classical reasoner and simplification (such as auto)
9451 are also affected by this change, because many of them rely on
9452 simp. They may sometimes diverge as well or yield a different numbers
9453 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9454 in case of problems. Sometimes subsequent calls to the classical
9455 reasoner will fail because a preceeding call to the simplifier too
9456 eagerly simplified the goal, e.g. deleted redundant premises.
9458 - The simplifier trace now shows the names of the applied rewrite rules
9460 - You can limit the number of recursive invocations of the simplifier
9461 during conditional rewriting (where the simplifie tries to solve the
9462 conditions before applying the rewrite rule):
9463 ML "simp_depth_limit := n"
9464 where n is an integer. Thus you can force termination where previously
9465 the simplifier would diverge.
9467 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9469 - No longer aborts on failed congruence proof. Instead, the
9470 congruence is ignored.
9472 * Pure: New generic framework for extracting programs from constructive
9473 proofs. See HOL/Extraction.thy for an example instantiation, as well
9474 as HOL/Extraction for some case studies.
9476 * Pure: The main goal of the proof state is no longer shown by default, only
9477 the subgoals. This behaviour is controlled by a new flag.
9478 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9479 (ML: Proof.show_main_goal).
9481 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9482 rules whose conclusion matches subgoal 1:
9483 PG menu: Isabelle/Isar -> Show me -> matching rules
9484 The rules are ordered by how closely they match the subgoal.
9485 In particular, rules that solve a subgoal outright are displayed first
9486 (or rather last, the way they are printed).
9487 (ML: ProofGeneral.print_intros())
9489 * Pure: New flag trace_unify_fail causes unification to print
9490 diagnostic information (PG: in trace buffer) when it fails. This is
9491 useful for figuring out why single step proofs like rule, erule or
9494 * Pure: Locale specifications now produce predicate definitions
9495 according to the body of text (covering assumptions modulo local
9496 definitions); predicate "loc_axioms" covers newly introduced text,
9497 while "loc" is cumulative wrt. all included locale expressions; the
9498 latter view is presented only on export into the global theory
9499 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9500 on the old view without predicates;
9502 * Pure: predefined locales "var" and "struct" are useful for sharing
9503 parameters (as in CASL, for example); just specify something like
9504 ``var x + var y + struct M'' as import;
9506 * Pure: improved thms_containing: proper indexing of facts instead of
9507 raw theorems; check validity of results wrt. current name space;
9508 include local facts of proof configuration (also covers active
9509 locales), cover fixed variables in index; may use "_" in term
9510 specification; an optional limit for the number of printed facts may
9511 be given (the default is 40);
9513 * Pure: disallow duplicate fact bindings within new-style theory files
9516 * Provers: improved induct method: assumptions introduced by case
9517 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9518 the goal statement); "foo" still refers to all facts collectively;
9520 * Provers: the function blast.overloaded has been removed: all constants
9521 are regarded as potentially overloaded, which improves robustness in exchange
9522 for slight decrease in efficiency;
9524 * Provers/linorder: New generic prover for transitivity reasoning over
9525 linear orders. Note: this prover is not efficient!
9527 * Isar: preview of problems to finish 'show' now produce an error
9528 rather than just a warning (in interactive mode);
9535 - Produces a counter example if it cannot prove a goal.
9536 Note that the counter example may be spurious if the goal is not a formula
9537 of quantifier-free linear arithmetic.
9538 In ProofGeneral the counter example appears in the trace buffer.
9540 - Knows about div k and mod k where k is a numeral of type nat or int.
9542 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9543 linear arithmetic fails. This takes account of quantifiers and divisibility.
9544 Presburger arithmetic can also be called explicitly via presburger(_tac).
9546 * simp's arithmetic capabilities have been enhanced a bit: it now
9547 takes ~= in premises into account (by performing a case split);
9549 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9550 are distributed over a sum of terms;
9552 * New tactic "trans_tac" and method "trans" instantiate
9553 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9556 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9557 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9559 * 'typedef' command has new option "open" to suppress the set
9562 * functions Min and Max on finite sets have been introduced (theory
9565 * attribute [symmetric] now works for relations as well; it turns
9566 (x,y) : R^-1 into (y,x) : R, and vice versa;
9568 * induct over a !!-quantified statement (say !!x1..xn):
9569 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9571 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9572 %x. None. Warning: empty_def now refers to the previously hidden definition
9575 * Algebra: formalization of classical algebra. Intended as base for
9576 any algebraic development in Isabelle. Currently covers group theory
9577 (up to Sylow's theorem) and ring theory (Universal Property of
9578 Univariate Polynomials). Contributions welcome;
9580 * GroupTheory: deleted, since its material has been moved to Algebra;
9582 * Complex: new directory of the complex numbers with numeric constants,
9583 nonstandard complex numbers, and some complex analysis, standard and
9584 nonstandard (Jacques Fleuriot);
9586 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9588 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9591 * Real/HahnBanach: updated and adapted to locales;
9593 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9596 * UNITY: added the Meier-Sanders theory of progress sets;
9598 * MicroJava: bytecode verifier and lightweight bytecode verifier
9599 as abstract algorithms, instantiated to the JVM;
9601 * Bali: Java source language formalization. Type system, operational
9602 semantics, axiomatic semantics. Supported language features:
9603 classes, interfaces, objects,virtual methods, static methods,
9604 static/instance fields, arrays, access modifiers, definite
9605 assignment, exceptions.
9610 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9613 * Main ZF: virtually all theories converted to new-style format;
9618 * Pure: Tactic.prove provides sane interface for internal proofs;
9619 omits the infamous "standard" operation, so this is more appropriate
9620 than prove_goalw_cterm in many situations (e.g. in simprocs);
9622 * Pure: improved error reporting of simprocs;
9624 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9628 *** Document preparation ***
9630 * uses \par instead of \\ for line breaks in theory text. This may
9631 shift some page breaks in large documents. To get the old behaviour
9632 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9634 * minimized dependencies of isabelle.sty and isabellesym.sty on
9637 * \<euro> now needs package babel/greek instead of marvosym (which
9640 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9645 New in Isabelle2002 (March 2002)
9646 --------------------------------
9648 *** Document preparation ***
9650 * greatly simplified document preparation setup, including more
9651 graceful interpretation of isatool usedir -i/-d/-D options, and more
9652 instructive isatool mkdir; users should basically be able to get
9653 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9654 users may run a separate document processing stage manually like this:
9655 "isatool usedir -D output HOL Test && isatool document Test/output";
9657 * theory dependency graph may now be incorporated into documents;
9658 isatool usedir -g true will produce session_graph.eps/.pdf for use
9659 with \includegraphics of LaTeX;
9661 * proper spacing of consecutive markup elements, especially text
9662 blocks after section headings;
9664 * support bold style (for single symbols only), input syntax is like
9665 this: "\<^bold>\<alpha>" or "\<^bold>A";
9667 * \<bullet> is now output as bold \cdot by default, which looks much
9668 better in printed text;
9670 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9671 note that these symbols are currently unavailable in Proof General /
9672 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9674 * isatool latex no longer depends on changed TEXINPUTS, instead
9675 isatool document copies the Isabelle style files to the target
9681 * Pure/Provers: improved proof by cases and induction;
9682 - 'case' command admits impromptu naming of parameters (such as
9684 - 'induct' method divinates rule instantiation from the inductive
9685 claim; no longer requires excessive ?P bindings for proper
9686 instantiation of cases;
9687 - 'induct' method properly enumerates all possibilities of set/type
9688 rules; as a consequence facts may be also passed through *type*
9689 rules without further ado;
9690 - 'induct' method now derives symbolic cases from the *rulified*
9691 rule (before it used to rulify cases stemming from the internal
9692 atomized version); this means that the context of a non-atomic
9693 statement becomes is included in the hypothesis, avoiding the
9694 slightly cumbersome show "PROP ?case" form;
9695 - 'induct' may now use elim-style induction rules without chaining
9696 facts, using ``missing'' premises from the goal state; this allows
9697 rules stemming from inductive sets to be applied in unstructured
9698 scripts, while still benefitting from proper handling of non-atomic
9699 statements; NB: major inductive premises need to be put first, all
9700 the rest of the goal is passed through the induction;
9701 - 'induct' proper support for mutual induction involving non-atomic
9702 rule statements (uses the new concept of simultaneous goals, see
9704 - append all possible rule selections, but only use the first
9705 success (no backtracking);
9706 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9707 - undeclared rule case names default to numbers 1, 2, 3, ...;
9708 - added 'print_induct_rules' (covered by help item in recent Proof
9710 - moved induct/cases attributes to Pure, methods to Provers;
9711 - generic method setup instantiated for FOL and HOL;
9713 * Pure: support multiple simultaneous goal statements, for example
9714 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9715 meta-level mechanism, this acts as if several individual goals had
9716 been stated separately; in particular common proof methods need to be
9717 repeated in order to cover all claims; note that a single elimination
9718 step is *not* sufficient to establish the two conjunctions, so this
9721 assume "A & B" then have A and B .. (*".." fails*)
9723 better use "obtain" in situations as above; alternative refer to
9724 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9726 * Pure: proper integration with ``locales''; unlike the original
9727 version by Florian Kammller, Isar locales package high-level proof
9728 contexts rather than raw logical ones (e.g. we admit to include
9729 attributes everywhere); operations on locales include merge and
9730 rename; support for implicit arguments (``structures''); simultaneous
9731 type-inference over imports and text; see also HOL/ex/Locales.thy for
9734 * Pure: the following commands have been ``localized'', supporting a
9735 target locale specification "(in name)": 'lemma', 'theorem',
9736 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9737 stored both within the locale and at the theory level (exported and
9738 qualified by the locale name);
9740 * Pure: theory goals may now be specified in ``long'' form, with
9741 ad-hoc contexts consisting of arbitrary locale elements. for example
9742 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9743 definitions may be given, too); the result is a meta-level rule with
9744 the context elements being discharged in the obvious way;
9746 * Pure: new proof command 'using' allows to augment currently used
9747 facts after a goal statement ('using' is syntactically analogous to
9748 'apply', but acts on the goal's facts only); this allows chained facts
9749 to be separated into parts given before and after a claim, as in
9750 ``from a and b have C using d and e <proof>'';
9752 * Pure: renamed "antecedent" case to "rule_context";
9754 * Pure: new 'judgment' command records explicit information about the
9755 object-logic embedding (used by several tools internally); no longer
9756 use hard-wired "Trueprop";
9758 * Pure: added 'corollary' command;
9760 * Pure: fixed 'token_translation' command;
9762 * Pure: removed obsolete 'exported' attribute;
9764 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9765 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9766 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9768 * Pure: method 'atomize' presents local goal premises as object-level
9769 statements (atomic meta-level propositions); setup controlled via
9770 rewrite rules declarations of 'atomize' attribute; example
9771 application: 'induct' method with proper rule statements in improper
9774 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9775 now consider the syntactic context of assumptions, giving a better
9776 chance to get type-inference of the arguments right (this is
9777 especially important for locales);
9779 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9782 * Pure/obtain: the formal conclusion "thesis", being marked as
9783 ``internal'', may no longer be reference directly in the text;
9784 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9787 * Pure: generic 'sym' attribute which declares a rule both as pure
9788 'elim?' and for the 'symmetric' operation;
9790 * Pure: marginal comments ``--'' may now occur just anywhere in the
9791 text; the fixed correlation with particular command syntax has been
9794 * Pure: new method 'rules' is particularly well-suited for proof
9795 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9796 but often produces more compact proof terms with less detours;
9798 * Pure/Provers/classical: simplified integration with pure rule
9799 attributes and methods; the classical "intro?/elim?/dest?"
9800 declarations coincide with the pure ones; the "rule" method no longer
9801 includes classically swapped intros; "intro" and "elim" methods no
9802 longer pick rules from the context; also got rid of ML declarations
9803 AddXIs/AddXEs/AddXDs; all of this has some potential for
9806 * Provers/classical: attribute 'swapped' produces classical inversions
9807 of introduction rules;
9809 * Provers/simplifier: 'simplified' attribute may refer to explicit
9810 rules instead of full simplifier context; 'iff' attribute handles
9813 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9815 * HOL: 'recdef' now fails on unfinished automated proofs, use
9816 "(permissive)" option to recover old behavior;
9818 * HOL: 'inductive' no longer features separate (collective) attributes
9819 for 'intros' (was found too confusing);
9821 * HOL: properly declared induction rules less_induct and
9827 * HOL: moved over to sane numeral syntax; the new policy is as
9830 - 0 and 1 are polymorphic constants, which are defined on any
9831 numeric type (nat, int, real etc.);
9833 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9834 binary representation internally;
9836 - type nat has special constructor Suc, and generally prefers Suc 0
9837 over 1::nat and Suc (Suc 0) over 2::nat;
9839 This change may cause significant problems of INCOMPATIBILITY; here
9840 are some hints on converting existing sources:
9842 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9843 entities, so expressions involving "-" (unary or binary minus) need
9844 to be spaced properly;
9846 - existing occurrences of "1" may need to be constraint "1::nat" or
9847 even replaced by Suc 0; similar for old "2";
9849 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9851 - remove all special provisions on numerals in proofs;
9853 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9854 representation (depends on bin_arith_simps in the default context);
9856 * HOL: symbolic syntax for x^2 (numeral 2);
9858 * HOL: the class of all HOL types is now called "type" rather than
9859 "term"; INCOMPATIBILITY, need to adapt references to this type class
9860 in axclass/classes, instance/arities, and (usually rare) occurrences
9861 in typings (of consts etc.); internally the class is called
9862 "HOL.type", ML programs should refer to HOLogic.typeS;
9864 * HOL/record package improvements:
9865 - new derived operations "fields" to build a partial record section,
9866 "extend" to promote a fixed record to a record scheme, and
9867 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9868 declared as simp by default;
9869 - shared operations ("more", "fields", etc.) now need to be always
9870 qualified) --- potential INCOMPATIBILITY;
9871 - removed "make_scheme" operations (use "make" with "extend") --
9873 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9874 - provides cases/induct rules for use with corresponding Isar
9875 methods (for concrete records, record schemes, concrete more
9876 parts, and schematic more parts -- in that order);
9877 - internal definitions directly based on a light-weight abstract
9878 theory of product types over typedef rather than datatype;
9880 * HOL: generic code generator for generating executable ML code from
9881 specifications; specific support for HOL constructs such as inductive
9882 datatypes and sets, as well as recursive functions; can be invoked
9883 via 'generate_code' theory section;
9885 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9887 * HOL: consolidated and renamed several theories. In particular:
9888 Ord.thy has been absorbed into HOL.thy
9889 String.thy has been absorbed into List.thy
9891 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9892 (beware of argument permutation!);
9894 * HOL: linorder_less_split superseded by linorder_cases;
9896 * HOL/List: "nodups" renamed to "distinct";
9898 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9899 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9900 - Ex_def has changed, now need to use some_eq_ex
9902 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9903 in this (rare) case use:
9905 delSWrapper "split_all_tac"
9906 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9908 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9911 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9912 Isabelle's type classes, ^ on functions and relations has too general
9913 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9914 necessary to attach explicit type constraints;
9916 * HOL/Relation: the prefix name of the infix "O" has been changed from
9917 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9918 renamed accordingly (eg "compI" -> "rel_compI").
9920 * HOL: syntax translations now work properly with numerals and records
9923 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9924 of "lam" -- INCOMPATIBILITY;
9926 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9927 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9928 renamed "Product_Type.unit";
9930 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9932 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9933 the "cases" method);
9935 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9938 * HOL/IMP: updated and converted to new-style theory format; several
9939 parts turned into readable document, with proper Isar proof texts and
9940 some explanations (by Gerwin Klein);
9942 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9944 * HOL-Hyperreal is now a logic image;
9949 * Isar: consts/constdefs supports mixfix syntax for continuous
9952 * Isar: domain package adapted to new-style theory format, e.g. see
9955 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9956 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9957 lift.induct_tac, always use UU instead of Undef;
9959 * HOLCF/IMP: updated and converted to new-style theory;
9964 * Isar: proper integration of logic-specific tools and packages,
9965 including theory commands '(co)inductive', '(co)datatype',
9966 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9967 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9969 * theory Main no longer includes AC; for the Axiom of Choice, base
9970 your theory on Main_ZFC;
9972 * the integer library now covers quotients and remainders, with many
9973 laws relating division to addition, multiplication, etc.;
9975 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9976 typeless version of the formalism;
9978 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9981 * ZF/Induct: new directory for examples of inductive definitions,
9982 including theory Multiset for multiset orderings; converted to
9983 new-style theory format;
9985 * ZF: many new theorems about lists, ordinals, etc.;
9990 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9991 variable proof controls level of detail: 0 = no proofs (only oracle
9992 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9993 also ref manual for further ML interfaces;
9995 * Pure/axclass: removed obsolete ML interface
9996 goal_subclass/goal_arity;
9998 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9999 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
10000 separate tokens, so expressions involving minus need to be spaced
10003 * Pure/syntax: support non-oriented infixes, using keyword "infix"
10004 rather than "infixl" or "infixr";
10006 * Pure/syntax: concrete syntax for dummy type variables admits genuine
10007 sort constraint specifications in type inference; e.g. "x::_::foo"
10008 ensures that the type of "x" is of sort "foo" (but not necessarily a
10011 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
10012 control output of nested => (types); the default behavior is
10015 * Pure/syntax: builtin parse translation for "_constify" turns valued
10016 tokens into AST constants;
10018 * Pure/syntax: prefer later declarations of translations and print
10019 translation functions; potential INCOMPATIBILITY: need to reverse
10020 multiple declarations for same syntax element constant;
10022 * Pure/show_hyps reset by default (in accordance to existing Isar
10025 * Provers/classical: renamed addaltern to addafter, addSaltern to
10028 * Provers/clasimp: ``iff'' declarations now handle conditional rules
10031 * system: tested support for MacOS X; should be able to get Isabelle +
10032 Proof General to work in a plain Terminal after installing Poly/ML
10033 (e.g. from the Isabelle distribution area) and GNU bash alone
10034 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
10035 support requires further installations, e.g. from
10036 http://fink.sourceforge.net/);
10038 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
10040 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
10041 of 40 MB), cf. ML_OPTIONS;
10043 * system: Proof General keywords specification is now part of the
10044 Isabelle distribution (see etc/isar-keywords.el);
10046 * system: support for persistent Proof General sessions (refrain from
10047 outdating all loaded theories on startup); user may create writable
10048 logic images like this: ``isabelle -q HOL Test'';
10050 * system: smart selection of Isabelle process versus Isabelle
10051 interface, accommodates case-insensitive file systems (e.g. HFS+); may
10052 run both "isabelle" and "Isabelle" even if file names are badly
10053 damaged (executable inspects the case of the first letter of its own
10054 name); added separate "isabelle-process" and "isabelle-interface";
10056 * system: refrain from any attempt at filtering input streams; no
10057 longer support ``8bit'' encoding of old isabelle font, instead proper
10058 iso-latin characters may now be used; the related isatools
10059 "symbolinput" and "nonascii" have disappeared as well;
10061 * system: removed old "xterm" interface (the print modes "xterm" and
10062 "xterm_color" are still available for direct use in a suitable
10067 New in Isabelle99-2 (February 2001)
10068 -----------------------------------
10070 *** Overview of INCOMPATIBILITIES ***
10072 * HOL: please note that theories in the Library and elsewhere often use the
10073 new-style (Isar) format; to refer to their theorems in an ML script you must
10074 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
10076 * HOL: inductive package no longer splits induction rule aggressively,
10077 but only as far as specified by the introductions given; the old
10078 format may be recovered via ML function complete_split_rule or attribute
10079 'split_rule (complete)';
10081 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
10082 gfp_Tarski to gfp_unfold;
10084 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
10086 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
10087 relation); infix "^^" has been renamed "``"; infix "``" has been
10088 renamed "`"; "univalent" has been renamed "single_valued";
10090 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
10093 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
10095 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
10097 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
10098 consequence, it is no longer monotonic wrt. the local goal context
10099 (which is now passed through the inductive cases);
10101 * Document preparation: renamed standard symbols \<ll> to \<lless> and
10102 \<gg> to \<ggreater>;
10105 *** Document preparation ***
10107 * \isabellestyle{NAME} selects version of Isabelle output (currently
10108 available: are "it" for near math-mode best-style output, "sl" for
10109 slanted text style, and "tt" for plain type-writer; if no
10110 \isabellestyle command is given, output is according to slanted
10113 * support sub/super scripts (for single symbols only), input syntax is
10114 like this: "A\<^sup>*" or "A\<^sup>\<star>";
10116 * some more standard symbols; see Appendix A of the system manual for
10117 the complete list of symbols defined in isabellesym.sty;
10119 * improved isabelle style files; more abstract symbol implementation
10120 (should now use \isamath{...} and \isatext{...} in custom symbol
10123 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
10124 state; Note that presentation of goal states does not conform to
10125 actual human-readable proof documents. Please do not include goal
10126 states into document output unless you really know what you are doing!
10128 * proper indentation of antiquoted output with proportional LaTeX
10131 * no_document ML operator temporarily disables LaTeX document
10134 * isatool unsymbolize tunes sources for plain ASCII communication;
10139 * Pure: Isar now suffers initial goal statements to contain unbound
10140 schematic variables (this does not conform to actual readable proof
10141 documents, due to unpredictable outcome and non-compositional proof
10142 checking); users who know what they are doing may use schematic goals
10143 for Prolog-style synthesis of proven results;
10145 * Pure: assumption method (an implicit finishing) now handles actual
10148 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
10149 initial goal, declare "that" only as Pure intro (only for single
10150 steps); the "that" rule assumption may now be involved in implicit
10151 finishing, thus ".." becomes a feasible for trivial obtains;
10153 * Pure: default proof step now includes 'intro_classes'; thus trivial
10154 instance proofs may be performed by "..";
10156 * Pure: ?thesis / ?this / "..." now work for pure meta-level
10157 statements as well;
10159 * Pure: more robust selection of calculational rules;
10161 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
10162 rule (as well as the assumption rule);
10164 * Pure: 'thm_deps' command visualizes dependencies of theorems and
10165 lemmas, using the graph browser tool;
10167 * Pure: predict failure of "show" in interactive mode;
10169 * Pure: 'thms_containing' now takes actual terms as arguments;
10171 * HOL: improved method 'induct' --- now handles non-atomic goals
10172 (potential INCOMPATIBILITY); tuned error handling;
10174 * HOL: cases and induct rules now provide explicit hints about the
10175 number of facts to be consumed (0 for "type" and 1 for "set" rules);
10176 any remaining facts are inserted into the goal verbatim;
10178 * HOL: local contexts (aka cases) may now contain term bindings as
10179 well; the 'cases' and 'induct' methods new provide a ?case binding for
10180 the result to be shown in each case;
10182 * HOL: added 'recdef_tc' command;
10184 * isatool convert assists in eliminating legacy ML scripts;
10189 * HOL/Library: a collection of generic theories to be used together
10190 with main HOL; the theory loader path already includes this directory
10191 by default; the following existing theories have been moved here:
10192 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
10193 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
10195 * HOL/Unix: "Some aspects of Unix file-system security", a typical
10196 modelling and verification task performed in Isabelle/HOL +
10197 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
10199 * HOL/Algebra: special summation operator SUM no longer exists, it has
10200 been replaced by setsum; infix 'assoc' now has priority 50 (like
10201 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
10202 'domain', this makes the theory consistent with mathematical
10205 * HOL basics: added overloaded operations "inverse" and "divide"
10206 (infix "/"), syntax for generic "abs" operation, generic summation
10209 * HOL/typedef: simplified package, provide more useful rules (see also
10212 * HOL/datatype: induction rule for arbitrarily branching datatypes is
10213 now expressed as a proper nested rule (old-style tactic scripts may
10214 require atomize_strip_tac to cope with non-atomic premises);
10216 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
10217 to "split_conv" (old name still available for compatibility);
10219 * HOL: improved concrete syntax for strings (e.g. allows translation
10220 rules with string literals);
10222 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
10223 and Fleuriot's mechanization of analysis, including the transcendental
10224 functions for the reals;
10226 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
10231 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
10232 "lam" is displayed as TWO lambda-symbols
10234 * CTT: theory Main now available, containing everything (that is, Bool
10240 * Pure: the Simplifier has been implemented properly as a derived rule
10241 outside of the actual kernel (at last!); the overall performance
10242 penalty in practical applications is about 50%, while reliability of
10243 the Isabelle inference kernel has been greatly improved;
10245 * print modes "brackets" and "no_brackets" control output of nested =>
10246 (types) and ==> (props); the default behaviour is "brackets";
10248 * Provers: fast_tac (and friends) now handle actual object-logic rules
10249 as assumptions as well;
10251 * system: support Poly/ML 4.0;
10253 * system: isatool install handles KDE version 1 or 2;
10257 New in Isabelle99-1 (October 2000)
10258 ----------------------------------
10260 *** Overview of INCOMPATIBILITIES ***
10262 * HOL: simplification of natural numbers is much changed; to partly
10263 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
10264 issue the following ML commands:
10266 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
10267 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
10269 * HOL: simplification no longer dives into case-expressions; this is
10270 controlled by "t.weak_case_cong" for each datatype t;
10272 * HOL: nat_less_induct renamed to less_induct;
10274 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
10275 fixsome to patch .thy and .ML sources automatically;
10277 select_equality -> some_equality
10278 select_eq_Ex -> some_eq_ex
10279 selectI2EX -> someI2_ex
10282 select1_equality -> some1_equality
10283 Eps_sym_eq -> some_sym_eq_trivial
10284 Eps_eq -> some_eq_trivial
10286 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
10288 * HOL: removed obsolete theorem binding expand_if (refer to split_if
10291 * HOL: the recursion equations generated by 'recdef' are now called
10292 f.simps instead of f.rules;
10294 * HOL: qed_spec_mp now also handles bounded ALL as well;
10296 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
10297 sometimes be needed;
10299 * HOL: the constant for "f``x" is now "image" rather than "op ``";
10301 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
10303 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
10304 product is now "<*>" instead of "Times"; the lexicographic product is
10305 now "<*lex*>" instead of "**";
10307 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
10308 of main HOL, but was unused); better use HOL's datatype package;
10310 * HOL: removed "symbols" syntax for constant "override" of theory Map;
10311 the old syntax may be recovered as follows:
10314 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
10315 (infixl "\\<oplus>" 100)
10317 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10319 * HOL/ML: even fewer consts are declared as global (see theories Ord,
10320 Lfp, Gfp, WF); this only affects ML packages that refer to const names
10323 * HOL and ZF: syntax for quotienting wrt an equivalence relation
10324 changed from A/r to A//r;
10326 * ZF: new treatment of arithmetic (nat & int) may break some old
10329 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
10330 rulify -> rule_format, elimify -> elim_format, ...);
10332 * Isar/Provers: intro/elim/dest attributes changed; renamed
10333 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
10334 should have to change intro!! to intro? only); replaced "delrule" by
10337 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
10339 * Provers: strengthened force_tac by using new first_best_tac;
10341 * LaTeX document preparation: several changes of isabelle.sty (see
10345 *** Document preparation ***
10347 * formal comments (text blocks etc.) in new-style theories may now
10348 contain antiquotations of thm/prop/term/typ/text to be presented
10349 according to latex print mode; concrete syntax is like this:
10350 @{term[show_types] "f(x) = a + x"};
10352 * isatool mkdir provides easy setup of Isabelle session directories,
10353 including proper document sources;
10355 * generated LaTeX sources are now deleted after successful run
10356 (isatool document -c); may retain a copy somewhere else via -D option
10359 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10360 style files, achieving self-contained LaTeX sources and simplifying
10363 * old-style theories now produce (crude) LaTeX output as well;
10365 * browser info session directories are now self-contained (may be put
10366 on WWW server seperately); improved graphs of nested sessions; removed
10367 graph for 'all sessions';
10369 * several improvements in isabelle style files; \isabellestyle{it}
10370 produces fake math mode output; \isamarkupheader is now \section by
10371 default; see lib/texinputs/isabelle.sty etc.;
10376 * Isar/Pure: local results and corresponding term bindings are now
10377 subject to Hindley-Milner polymorphism (similar to ML); this
10378 accommodates incremental type-inference very nicely;
10380 * Isar/Pure: new derived language element 'obtain' supports
10381 generalized existence reasoning;
10383 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10384 support accumulation of results, without applying any rules yet;
10385 useful to collect intermediate results without explicit name
10386 references, and for use with transitivity rules with more than 2
10389 * Isar/Pure: scalable support for case-analysis type proofs: new
10390 'case' language element refers to local contexts symbolically, as
10391 produced by certain proof methods; internally, case names are attached
10392 to theorems as "tags";
10394 * Isar/Pure: theory command 'hide' removes declarations from
10395 class/type/const name spaces;
10397 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10398 indicate potential overloading;
10400 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10402 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10403 "{a,b,c}" instead of {a,b,c};
10405 * Isar/Pure now provides its own version of intro/elim/dest
10406 attributes; useful for building new logics, but beware of confusion
10407 with the version in Provers/classical;
10409 * Isar/Pure: the local context of (non-atomic) goals is provided via
10410 case name 'antecedent';
10412 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10413 to the current context is now done automatically);
10415 * Isar/Pure: theory command 'method_setup' provides a simple interface
10416 for definining proof methods in ML;
10418 * Isar/Provers: intro/elim/dest attributes changed; renamed
10419 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10420 most cases, one should have to change intro!! to intro? only);
10421 replaced "delrule" by "rule del";
10423 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10424 'symmetric' attribute (the latter supercedes [RS sym]);
10426 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10427 method modifier); 'simp' method: 'only:' modifier removes loopers as
10428 well (including splits);
10430 * Isar/Provers: Simplifier and Classical methods now support all kind
10431 of modifiers used in the past, including 'cong', 'iff', etc.
10433 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10434 of Simplifier and Classical reasoner);
10436 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10437 now support named cases; major packages (inductive, datatype, primrec,
10438 recdef) support case names and properly name parameters;
10440 * Isar/HOL: new transitivity rules for substitution in inequalities --
10441 monotonicity conditions are extracted to be proven at end of
10444 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10447 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10448 split_if split_if_asm; datatype package provides theorems foo.splits =
10449 foo.split foo.split_asm for each datatype;
10451 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10452 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10453 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10454 use "(cases (simplified))" method in proper proof texts);
10456 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10458 * Isar: names of theorems etc. may be natural numbers as well;
10460 * Isar: 'pr' command: optional arguments for goals_limit and
10461 ProofContext.prems_limit; no longer prints theory contexts, but only
10464 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10465 additional print modes to be specified; e.g. "pr(latex)" will print
10466 proof state according to the Isabelle LaTeX style;
10468 * Isar: improved support for emulating tactic scripts, including proof
10469 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10470 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10471 (for HOL datatypes);
10473 * Isar: simplified (more robust) goal selection of proof methods: 1st
10474 goal, all goals, or explicit goal specifier (tactic emulation); thus
10475 'proof method scripts' have to be in depth-first order;
10477 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10479 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10480 should instead use individual commands for printing items
10481 (print_commands, print_methods etc.);
10483 * Isar: added 'nothing' --- the empty list of theorems;
10488 * HOL/MicroJava: formalization of a fragment of Java, together with a
10489 corresponding virtual machine and a specification of its bytecode
10490 verifier and a lightweight bytecode verifier, including proofs of
10491 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10492 Cornelia Pusch (see also the homepage of project Bali at
10493 http://isabelle.in.tum.de/Bali/);
10495 * HOL/Algebra: new theory of rings and univariate polynomials, by
10498 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10499 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10502 * HOL/Lattice: fundamental concepts of lattice theory and order
10503 structures, including duals, properties of bounds versus algebraic
10504 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10505 Theorem for complete lattices etc.; may also serve as a demonstration
10506 for abstract algebraic reasoning using axiomatic type classes, and
10507 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10509 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10512 * HOL/IMPP: extension of IMP with local variables and mutually
10513 recursive procedures, by David von Oheimb;
10515 * HOL/Lambda: converted into new-style theory and document;
10517 * HOL/ex/Multiquote: example of multiple nested quotations and
10518 anti-quotations -- basically a generalized version of de-Bruijn
10519 representation; very useful in avoiding lifting of operations;
10521 * HOL/record: added general record equality rule to simpset; fixed
10522 select-update simplification procedure to handle extended records as
10523 well; admit "r" as field name;
10525 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10526 other numeric types and also as the identity of groups, rings, etc.;
10528 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10529 Types nat and int belong to this axclass;
10531 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10532 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10533 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10534 two terms #m*u and #n*u are replaced by #(m+n)*u
10535 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10536 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10537 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10539 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10540 powerful prover for predicate logic but knows nothing of clasets; see
10541 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10543 * HOL: new version of "case_tac" subsumes both boolean case split and
10544 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10545 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10547 * HOL: simplification no longer dives into case-expressions: only the
10548 selector expression is simplified, but not the remaining arms; to
10549 enable full simplification of case-expressions for datatype t, you may
10550 remove t.weak_case_cong from the simpset, either globally (Delcongs
10551 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10553 * HOL/recdef: the recursion equations generated by 'recdef' for
10554 function 'f' are now called f.simps instead of f.rules; if all
10555 termination conditions are proved automatically, these simplification
10556 rules are added to the simpset, as in primrec; rules may be named
10557 individually as well, resulting in a separate list of theorems for
10560 * HOL/While is a new theory that provides a while-combinator. It
10561 permits the definition of tail-recursive functions without the
10562 provision of a termination measure. The latter is necessary once the
10563 invariant proof rule for while is applied.
10565 * HOL: new (overloaded) notation for the set of elements below/above
10566 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10568 * HOL: theorems impI, allI, ballI bound as "strip";
10570 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10571 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10572 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10574 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10576 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10577 main HOL, but was unused);
10579 * HOL: fewer consts declared as global (e.g. have to refer to
10580 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10582 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10583 in case of overlap with user translations (e.g. judgements over
10584 tuples); (note that the underlying logical represenation is still
10590 * ZF: simplification automatically cancels common terms in arithmetic
10591 expressions over nat and int;
10593 * ZF: new treatment of nat to minimize type-checking: all operators
10594 coerce their operands to a natural number using the function natify,
10595 making the algebraic laws unconditional;
10597 * ZF: as above, for int: operators coerce their operands to an integer
10598 using the function intify;
10600 * ZF: the integer library now contains many of the usual laws for the
10601 orderings, including $<=, and monotonicity laws for $+ and $*;
10603 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10606 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10607 to the simplifier and classical reasoner simultaneously;
10612 * Provers: blast_tac now handles actual object-logic rules as
10613 assumptions; note that auto_tac uses blast_tac internally as well;
10615 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10616 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10618 * Provers: delrules now handles destruct rules as well (no longer need
10619 explicit make_elim);
10621 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10622 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10623 use instead the strong form,
10624 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10625 in HOL, FOL and ZF the function cla_make_elim will create such rules
10626 from destruct-rules;
10628 * Provers: Simplifier.easy_setup provides a fast path to basic
10629 Simplifier setup for new object-logics;
10631 * Pure: AST translation rules no longer require constant head on LHS;
10633 * Pure: improved name spaces: ambiguous output is qualified; support
10634 for hiding of names;
10636 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10637 XSYMBOL_HOME; no longer need to do manual configuration in most
10640 * system: compression of ML heaps images may now be controlled via -c
10641 option of isabelle and isatool usedir (currently only observed by
10644 * system: isatool installfonts may handle X-Symbol fonts as well (very
10645 useful for remote X11);
10647 * system: provide TAGS file for Isabelle sources;
10649 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10652 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10653 timing flag supersedes proof_timing and Toplevel.trace;
10655 * ML: new combinators |>> and |>>> for incremental transformations
10656 with secondary results (e.g. certain theory extensions):
10658 * ML: PureThy.add_defs gets additional argument to indicate potential
10659 overloading (usually false);
10661 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10666 New in Isabelle99 (October 1999)
10667 --------------------------------
10669 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10671 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10672 are no longer simplified. (This allows the simplifier to unfold recursive
10673 functional programs.) To restore the old behaviour, declare
10675 Delcongs [if_weak_cong];
10677 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10680 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10682 * HOL/datatype: mutual_induct_tac no longer exists --
10683 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10685 * HOL/typedef: fixed type inference for representing set; type
10686 arguments now have to occur explicitly on the rhs as type constraints;
10688 * ZF: The con_defs part of an inductive definition may no longer refer
10689 to constants declared in the same theory;
10691 * HOL, ZF: the function mk_cases, generated by the inductive
10692 definition package, has lost an argument. To simplify its result, it
10693 uses the default simpset instead of a supplied list of theorems.
10695 * HOL/List: the constructors of type list are now Nil and Cons;
10697 * Simplifier: the type of the infix ML functions
10698 setSSolver addSSolver setSolver addSolver
10699 is now simpset * solver -> simpset where `solver' is a new abstract type
10700 for packaging solvers. A solver is created via
10701 mk_solver: string -> (thm list -> int -> tactic) -> solver
10702 where the string argument is only a comment.
10705 *** Proof tools ***
10707 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10708 decision procedure for linear arithmetic. Currently it is used for
10709 types `nat', `int', and `real' in HOL (see below); it can, should and
10710 will be instantiated for other types and logics as well.
10712 * The simplifier now accepts rewrite rules with flexible heads, eg
10713 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10714 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10720 * New Isabelle/Isar subsystem provides an alternative to traditional
10721 tactical theorem proving; together with the ProofGeneral/isar user
10722 interface it offers an interactive environment for developing human
10723 readable proof documents (Isar == Intelligible semi-automated
10724 reasoning); for further information see isatool doc isar-ref,
10725 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10727 * improved and simplified presentation of theories: better HTML markup
10728 (including colors), graph views in several sizes; isatool usedir now
10729 provides a proper interface for user theories (via -P option); actual
10730 document preparation based on (PDF)LaTeX is available as well (for
10731 new-style theories only); see isatool doc system for more information;
10733 * native support for Proof General, both for classic Isabelle and
10736 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10737 using the graph browser tool;
10739 * Isabelle manuals now also available as PDF;
10741 * theory loader rewritten from scratch (may not be fully
10742 bug-compatible); old loadpath variable has been replaced by show_path,
10743 add_path, del_path, reset_path functions; new operations such as
10744 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10747 * improved isatool install: option -k creates KDE application icon,
10748 option -p DIR installs standalone binaries;
10750 * added ML_PLATFORM setting (useful for cross-platform installations);
10751 more robust handling of platform specific ML images for SML/NJ;
10753 * the settings environment is now statically scoped, i.e. it is never
10754 created again in sub-processes invoked from isabelle, isatool, or
10757 * path element specification '~~' refers to '$ISABELLE_HOME';
10759 * in locales, the "assumes" and "defines" parts may be omitted if
10762 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10765 * new print_mode "HTML";
10767 * new flag show_tags controls display of tags of theorems (which are
10768 basically just comments that may be attached by some tools);
10770 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10771 mode and goal output format:
10773 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10775 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10777 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10778 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10780 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10782 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10784 * function bind_thms stores lists of theorems (cf. bind_thm);
10786 * new shorthand tactics ftac, eatac, datac, fatac;
10788 * qed (and friends) now accept "" as result name; in that case the
10789 theorem is not stored, but proper checks and presentation of the
10790 result still apply;
10792 * theorem database now also indexes constants "Trueprop", "all",
10793 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10798 ** HOL arithmetic **
10800 * There are now decision procedures for linear arithmetic over nat and
10803 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10804 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10805 are treated as atomic; subformulae not involving type `nat' or `int'
10806 are ignored; quantified subformulae are ignored unless they are
10807 positive universal or negative existential. The tactic has to be
10808 invoked by hand and can be a little bit slow. In particular, the
10809 running time is exponential in the number of occurrences of `min' and
10810 `max', and `-' on `nat'.
10812 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10813 (negated) (in)equalities among the premises and the conclusion into
10814 account (i.e. no compound formulae) and does not know about `min' and
10815 `max', and `-' on `nat'. It is fast and is used automatically by the
10818 NB: At the moment, these decision procedures do not cope with mixed
10819 nat/int formulae where the two parts interact, such as `m < n ==>
10822 * HOL/Numeral provides a generic theory of numerals (encoded
10823 efficiently as bit strings); setup for types nat/int/real is in place;
10824 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10825 int, existing theories and proof scripts may require a few additional
10828 * integer division and remainder can now be performed on constant
10831 * many properties of integer multiplication, division and remainder
10834 * An interface to the Stanford Validity Checker (SVC) is available through the
10835 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10836 are proved automatically. SVC must be installed separately, and its results
10837 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10838 invocation of the underlying oracle). For SVC see
10839 http://verify.stanford.edu/SVC
10841 * IsaMakefile: the HOL-Real target now builds an actual image;
10846 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10847 (in Isabelle/Isar) -- by Gertrud Bauer;
10849 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10850 analysis for assembly languages with subtypes;
10852 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10853 -- avoids syntactic ambiguities and treats state, transition, and
10854 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10855 changed syntax and (many) tactics;
10857 * HOL/inductive: Now also handles more general introduction rules such
10858 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10859 theorems are now maintained within the theory (maintained via the
10862 * HOL/datatype: Now also handles arbitrarily branching datatypes
10863 (using function types) such as
10865 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10867 * HOL/record: record_simproc (part of the default simpset) takes care
10868 of selectors applied to updated records; record_split_tac is no longer
10869 part of the default claset; update_defs may now be removed from the
10870 simpset in many cases; COMPATIBILITY: old behavior achieved by
10872 claset_ref () := claset() addSWrapper record_split_wrapper;
10873 Delsimprocs [record_simproc]
10875 * HOL/typedef: fixed type inference for representing set; type
10876 arguments now have to occur explicitly on the rhs as type constraints;
10878 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10879 names rather than an ML expression;
10881 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10882 supplied later. Program schemes can be defined, such as
10883 "While B C s = (if B s then While B C (C s) else s)"
10884 where the well-founded relation can be chosen after B and C have been given.
10886 * HOL/List: the constructors of type list are now Nil and Cons;
10887 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10888 course, ML tools referring to List.list.op # etc. have to be adapted;
10890 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10891 disabled by default; run isabelle with option -m HOL to get back to
10892 the original Gordon/HOL-style output;
10894 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10895 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10897 * HOL basic syntax simplified (more orthogonal): all variants of
10898 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10899 Eps operator is provided as well: "SOME x. P[x]";
10901 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10903 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10904 thus available for user theories;
10906 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10907 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10910 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10911 several times and then mp;
10916 * the notation <<...>> is now available as a notation for sequences of
10919 * the simplifier is now installed
10921 * the axiom system has been generalized (thanks to Soren Heilmann)
10923 * the classical reasoner now has a default rule database
10928 * new primrec section allows primitive recursive functions to be given
10929 directly (as in HOL) over datatypes and the natural numbers;
10931 * new tactics induct_tac and exhaust_tac for induction (or case
10932 analysis) over datatypes and the natural numbers;
10934 * the datatype declaration of type T now defines the recursor T_rec;
10936 * simplification automatically does freeness reasoning for datatype
10939 * automatic type-inference, with AddTCs command to insert new
10940 type-checking rules;
10942 * datatype introduction rules are now added as Safe Introduction rules
10945 * the syntax "if P then x else y" is now available in addition to
10949 *** Internal programming interfaces ***
10951 * tuned simplifier trace output; new flag debug_simp;
10953 * structures Vartab / Termtab (instances of TableFun) offer efficient
10954 tables indexed by indexname_ord / term_ord (compatible with aconv);
10956 * AxClass.axclass_tac lost the theory argument;
10958 * tuned current_goals_markers semantics: begin / end goal avoids
10959 printing empty lines;
10961 * removed prs and prs_fn hook, which was broken because it did not
10962 include \n in its semantics, forcing writeln to add one
10963 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10964 string -> unit if you really want to output text without newline;
10966 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10967 plain output, interface builders may have to enable 'isabelle_font'
10968 mode to get Isabelle font glyphs as before;
10970 * refined token_translation interface; INCOMPATIBILITY: output length
10971 now of type real instead of int;
10973 * theory loader actions may be traced via new ThyInfo.add_hook
10974 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10975 your own database of information attached to *whole* theories -- as
10976 opposed to intra-theory data slots offered via TheoryDataFun;
10978 * proper handling of dangling sort hypotheses (at last!);
10979 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10980 extra sort hypotheses that can be witnessed from the type signature;
10981 the force_strip_shyps flag is gone, any remaining shyps are simply
10982 left in the theorem (with a warning issued by strip_shyps_warning);
10986 New in Isabelle98-1 (October 1998)
10987 ----------------------------------
10989 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10991 * several changes of automated proof tools;
10993 * HOL: major changes to the inductive and datatype packages, including
10994 some minor incompatibilities of theory syntax;
10996 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10999 * HOL: removed duplicate thms in Arith:
11000 less_imp_add_less should be replaced by trans_less_add1
11001 le_imp_add_le should be replaced by trans_le_add1
11003 * HOL: unary minus is now overloaded (new type constraints may be
11006 * HOL and ZF: unary minus for integers is now #- instead of #~. In
11007 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
11008 now taken as an integer constant.
11010 * Pure: ML function 'theory_of' renamed to 'theory';
11013 *** Proof tools ***
11016 1. Asm_full_simp_tac is now more aggressive.
11017 1. It will sometimes reorient premises if that increases their power to
11019 2. It does no longer proceed strictly from left to right but may also
11020 rotate premises to achieve further simplification.
11021 For compatibility reasons there is now Asm_lr_simp_tac which is like the
11022 old Asm_full_simp_tac in that it does not rotate premises.
11023 2. The simplifier now knows a little bit about nat-arithmetic.
11025 * Classical reasoner: wrapper mechanism for the classical reasoner now
11026 allows for selected deletion of wrappers, by introduction of names for
11027 wrapper functionals. This implies that addbefore, addSbefore,
11028 addaltern, and addSaltern now take a pair (name, tactic) as argument,
11029 and that adding two tactics with the same name overwrites the first
11030 one (emitting a warning).
11031 type wrapper = (int -> tactic) -> (int -> tactic)
11032 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
11033 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
11034 delWrapper, delSWrapper: claset * string -> claset
11035 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
11037 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
11038 semantics; addbefore now affects only the unsafe part of step_tac
11039 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
11040 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
11043 * Classical reasoner: setwrapper to setWrapper and compwrapper to
11044 compWrapper; added safe wrapper (and access functions for it);
11046 * HOL/split_all_tac is now much faster and fails if there is nothing
11047 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
11048 and the names of the automatically generated variables have changed.
11049 split_all_tac has moved within claset() from unsafe wrappers to safe
11050 wrappers, which means that !!-bound variables are split much more
11051 aggressively, and safe_tac and clarify_tac now split such variables.
11052 If this splitting is not appropriate, use delSWrapper "split_all_tac".
11053 Note: the same holds for record_split_tac, which does the job of
11054 split_all_tac for record fields.
11056 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
11057 permanently to the default simpset using Addsplits just like
11058 Addsimps. They can be removed via Delsplits just like
11059 Delsimps. Lower-case versions are also available.
11061 * HOL/Simplifier: The rule split_if is now part of the default
11062 simpset. This means that the simplifier will eliminate all occurrences
11063 of if-then-else in the conclusion of a goal. To prevent this, you can
11064 either remove split_if completely from the default simpset by
11065 `Delsplits [split_if]' or remove it in a specific call of the
11066 simplifier using `... delsplits [split_if]'. You can also add/delete
11067 other case splitting rules to/from the default simpset: every datatype
11068 generates suitable rules `split_t_case' and `split_t_case_asm' (where
11069 t is the name of the datatype).
11071 * Classical reasoner / Simplifier combination: new force_tac (and
11072 derivatives Force_tac, force) combines rewriting and classical
11073 reasoning (and whatever other tools) similarly to auto_tac, but is
11074 aimed to solve the given subgoal completely.
11079 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
11080 and `goalw': the theory is no longer needed as an explicit argument -
11081 the current theory context is used; assumptions are no longer returned
11082 at the ML-level unless one of them starts with ==> or !!; it is
11083 recommended to convert to these new commands using isatool fixgoal
11084 (backup your sources first!);
11086 * new top-level commands 'thm' and 'thms' for retrieving theorems from
11087 the current theory context, and 'theory' to lookup stored theories;
11089 * new theory section 'locale' for declaring constants, assumptions and
11090 definitions that have local scope;
11092 * new theory section 'nonterminals' for purely syntactic types;
11094 * new theory section 'setup' for generic ML setup functions
11095 (e.g. package initialization);
11097 * the distribution now includes Isabelle icons: see
11098 lib/logo/isabelle-{small,tiny}.xpm;
11100 * isatool install - install binaries with absolute references to
11103 * isatool logo -- create instances of the Isabelle logo (as EPS);
11105 * print mode 'emacs' reserved for Isamode;
11107 * support multiple print (ast) translations per constant name;
11109 * theorems involving oracles are now printed with a suffixed [!];
11114 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
11116 * HOL/inductive package reorganized and improved: now supports mutual
11117 definitions such as
11122 oddI "n : EVEN ==> Suc n : ODD"
11123 evenI "n : ODD ==> Suc n : EVEN"
11125 new theorem list "elims" contains an elimination rule for each of the
11126 recursive sets; inductive definitions now handle disjunctive premises
11127 correctly (also ZF);
11129 INCOMPATIBILITIES: requires Inductive as an ancestor; component
11130 "mutual_induct" no longer exists - the induction rule is always
11131 contained in "induct";
11134 * HOL/datatype package re-implemented and greatly improved: now
11135 supports mutually recursive datatypes such as
11138 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
11139 | SUM ('a aexp) ('a aexp)
11140 | DIFF ('a aexp) ('a aexp)
11143 'a bexp = LESS ('a aexp) ('a aexp)
11144 | AND ('a bexp) ('a bexp)
11145 | OR ('a bexp) ('a bexp)
11147 as well as indirectly recursive datatypes such as
11150 ('a, 'b) term = Var 'a
11151 | App 'b ((('a, 'b) term) list)
11153 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
11154 induction on mutually / indirectly recursive datatypes.
11156 Primrec equations are now stored in theory and can be accessed via
11157 <function_name>.simps.
11161 - Theories using datatypes must now have theory Datatype as an
11163 - The specific <typename>.induct_tac no longer exists - use the
11164 generic induct_tac instead.
11165 - natE has been renamed to nat.exhaust - use exhaust_tac
11166 instead of res_inst_tac ... natE. Note that the variable
11167 names in nat.exhaust differ from the names in natE, this
11168 may cause some "fragile" proofs to fail.
11169 - The theorems split_<typename>_case and split_<typename>_case_asm
11170 have been renamed to <typename>.split and <typename>.split_asm.
11171 - Since default sorts of type variables are now handled correctly,
11172 some datatype definitions may have to be annotated with explicit
11174 - Primrec definitions no longer require function name and type
11175 of recursive argument.
11177 Consider using isatool fixdatatype to adapt your theories and proof
11178 scripts to the new package (backup your sources first!).
11181 * HOL/record package: considerably improved implementation; now
11182 includes concrete syntax for record types, terms, updates; theorems
11183 for surjective pairing and splitting !!-bound record variables; proof
11184 support is as follows:
11186 1) standard conversions (selectors or updates applied to record
11187 constructor terms) are part of the standard simpset;
11189 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
11190 made part of standard simpset and claset via addIffs;
11192 3) a tactic for record field splitting (record_split_tac) is part of
11193 the standard claset (addSWrapper);
11195 To get a better idea about these rules you may retrieve them via
11196 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
11197 the name of your record type.
11199 The split tactic 3) conceptually simplifies by the following rule:
11201 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
11203 Thus any record variable that is bound by meta-all will automatically
11204 blow up into some record constructor term, consequently the
11205 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
11206 solve record problems automatically.
11209 * reorganized the main HOL image: HOL/Integ and String loaded by
11210 default; theory Main includes everything;
11212 * automatic simplification of integer sums and comparisons, using cancellation;
11214 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
11216 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
11218 * many new identities for unions, intersections, set difference, etc.;
11220 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
11221 called split_if, split_split, split_sum_case and split_nat_case (to go
11222 with add/delsplits);
11224 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
11225 (?x::unit) = (); this is made part of the default simpset, which COULD
11226 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
11227 'Delsimprocs [unit_eq_proc];' as last resort); also note that
11228 unit_abs_eta_conv is added in order to counter the effect of
11229 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
11232 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
11235 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11236 It and 'sym RS equals0D' are now in the default claset, giving automatic
11237 disjointness reasoning but breaking a few old proofs.
11239 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
11240 to 'converse' from 'inverse' (for compatibility with ZF and some
11243 * HOL/recdef can now declare non-recursive functions, with {} supplied as
11244 the well-founded relation;
11246 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
11247 Compl A. The "Compl" syntax remains available as input syntax for this
11250 * HOL/Update: new theory of function updates:
11251 f(a:=b) == %x. if x=a then b else f x
11252 may also be iterated as in f(a:=b,c:=d,...);
11254 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
11257 - new function list_update written xs[i:=v] that updates the i-th
11258 list position. May also be iterated as in xs[i:=a,j:=b,...].
11259 - new function `upt' written [i..j(] which generates the list
11260 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
11261 bound write [i..j], which is a shorthand for [i..j+1(].
11262 - new lexicographic orderings and corresponding wellfoundedness theorems.
11265 - removed 'pred' (predecessor) function;
11266 - generalized some theorems about n-1;
11267 - many new laws about "div" and "mod";
11268 - new laws about greatest common divisors (see theory ex/Primes);
11270 * HOL/Relation: renamed the relational operator r^-1 "converse"
11271 instead of "inverse";
11273 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
11274 of the multiset ordering;
11276 * directory HOL/Real: a construction of the reals using Dedekind cuts
11277 (not included by default);
11279 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
11281 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
11282 programs, i.e. different program variables may have different types.
11284 * calling (stac rew i) now fails if "rew" has no effect on the goal
11285 [previously, this check worked only if the rewrite rule was unconditional]
11286 Now rew can involve either definitions or equalities (either == or =).
11291 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
11292 only the theorems proved on ZF.ML;
11294 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
11295 It and 'sym RS equals0D' are now in the default claset, giving automatic
11296 disjointness reasoning but breaking a few old proofs.
11298 * ZF/Update: new theory of function updates
11299 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
11300 may also be iterated as in f(a:=b,c:=d,...);
11302 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
11304 * calling (stac rew i) now fails if "rew" has no effect on the goal
11305 [previously, this check worked only if the rewrite rule was unconditional]
11306 Now rew can involve either definitions or equalities (either == or =).
11308 * case_tac provided for compatibility with HOL
11309 (like the old excluded_middle_tac, but with subgoals swapped)
11312 *** Internal programming interfaces ***
11314 * Pure: several new basic modules made available for general use, see
11315 also src/Pure/README;
11317 * improved the theory data mechanism to support encapsulation (data
11318 kind name replaced by private Object.kind, acting as authorization
11319 key); new type-safe user interface via functor TheoryDataFun; generic
11320 print_data function becomes basically useless;
11322 * removed global_names compatibility flag -- all theory declarations
11323 are qualified by default;
11325 * module Pure/Syntax now offers quote / antiquote translation
11326 functions (useful for Hoare logic etc. with implicit dependencies);
11327 see HOL/ex/Antiquote for an example use;
11329 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
11332 * new tactical CHANGED_GOAL for checking that a tactic modifies a
11335 * Display.print_goals function moved to Locale.print_goals;
11337 * standard print function for goals supports current_goals_markers
11338 variable for marking begin of proof, end of proof, start of goal; the
11339 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11340 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11345 New in Isabelle98 (January 1998)
11346 --------------------------------
11348 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11350 * changed lexical syntax of terms / types: dots made part of long
11351 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11353 * simpset (and claset) reference variable replaced by functions
11354 simpset / simpset_ref;
11356 * no longer supports theory aliases (via merge) and non-trivial
11357 implicit merge of thms' signatures;
11359 * most internal names of constants changed due to qualified names;
11361 * changed Pure/Sequence interface (see Pure/seq.ML);
11364 *** General Changes ***
11366 * hierachically structured name spaces (for consts, types, axms, thms
11367 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11368 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11369 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11370 long_names for fully qualified output names; NOTE: ML programs
11371 (special tactics, packages etc.) referring to internal names may have
11372 to be adapted to cope with fully qualified names; in case of severe
11373 backward campatibility problems try setting 'global_names' at compile
11374 time to have enrything declared within a flat name space; one may also
11375 fine tune name declarations in theories via the 'global' and 'local'
11378 * reimplemented the implicit simpset and claset using the new anytype
11379 data filed in signatures; references simpset:simpset ref etc. are
11380 replaced by functions simpset:unit->simpset and
11381 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11382 to patch your ML files accordingly;
11384 * HTML output now includes theory graph data for display with Java
11385 applet or isatool browser; data generated automatically via isatool
11386 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11388 * defs may now be conditional; improved rewrite_goals_tac to handle
11389 conditional equations;
11391 * defs now admits additional type arguments, using TYPE('a) syntax;
11393 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11394 creates a new theory node; implicit merge of thms' signatures is
11395 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11396 transfer:theory->thm->thm in (rare) cases;
11398 * improved handling of draft signatures / theories; draft thms (and
11399 ctyps, cterms) are automatically promoted to real ones;
11401 * slightly changed interfaces for oracles: admit many per theory, named
11402 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11404 * print_goals: optional output of const types (set show_consts and
11407 * improved output of warnings (###) and errors (***);
11409 * subgoal_tac displays a warning if the new subgoal has type variables;
11411 * removed old README and Makefiles;
11413 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11415 * removed obsolete init_pps and init_database;
11417 * deleted the obsolete tactical STATE, which was declared by
11418 fun STATE tacfun st = tacfun st st;
11420 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11421 (which abbreviates $HOME);
11423 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11424 use isatool fixseq to adapt your ML programs (this works for fully
11425 qualified references to the Sequence structure only!);
11427 * use_thy no longer requires writable current directory; it always
11428 reloads .ML *and* .thy file, if either one is out of date;
11431 *** Classical Reasoner ***
11433 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11434 tactics that use classical reasoning to simplify a subgoal without
11435 splitting it into several subgoals;
11437 * Safe_tac: like safe_tac but uses the default claset;
11442 * added simplification meta rules:
11443 (asm_)(full_)simplify: simpset -> thm -> thm;
11445 * simplifier.ML no longer part of Pure -- has to be loaded by object
11448 * added prems argument to simplification procedures;
11450 * HOL, FOL, ZF: added infix function `addsplits':
11451 instead of `<simpset> setloop (split_tac <thms>)'
11452 you can simply write `<simpset> addsplits <thms>'
11457 * TYPE('a) syntax for type reflection terms;
11459 * no longer handles consts with name "" -- declare as 'syntax' instead;
11461 * pretty printer: changed order of mixfix annotation preference (again!);
11463 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11468 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11469 with `addloop' of the simplifier to faciliate case splitting in premises.
11471 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11473 * HOL/Auth: new protocol proofs including some for the Internet
11476 * HOL/Map: new theory of `maps' a la VDM;
11478 * HOL/simplifier: simplification procedures nat_cancel_sums for
11479 cancelling out common nat summands from =, <, <= (in)equalities, or
11480 differences; simplification procedures nat_cancel_factor for
11481 cancelling common factor from =, <, <= (in)equalities over natural
11482 sums; nat_cancel contains both kinds of procedures, it is installed by
11483 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11485 * HOL/simplifier: terms of the form
11486 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11488 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11489 and those of the form
11490 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11492 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11495 Each datatype `t' now comes with a theorem `split_t_case' of the form
11497 P(t_case f1 ... fn x) =
11498 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11500 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11503 and a theorem `split_t_case_asm' of the form
11505 P(t_case f1 ... fn x) =
11506 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11508 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11510 which can be added to a simpset via `addsplits'. The existing theorems
11511 expand_list_case and expand_option_case have been renamed to
11512 split_list_case and split_option_case.
11515 - `pred n' is automatically converted to `n-1'.
11516 Users are strongly encouraged not to use `pred' any longer,
11517 because it will disappear altogether at some point.
11518 - Users are strongly encouraged to write "0 < n" rather than
11519 "n ~= 0". Theorems and proof tools have been modified towards this
11523 the function "set_of_list" has been renamed "set" (and its theorems too);
11524 the function "nth" now takes its arguments in the reverse order and
11525 has acquired the infix notation "!" as in "xs!n".
11527 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11529 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11530 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11532 * HOL/record: extensible records with schematic structural subtyping
11533 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11534 still lacks various theorems and concrete record syntax;
11539 * removed "axioms" and "generated by" sections;
11541 * replaced "ops" section by extended "consts" section, which is capable of
11542 handling the continuous function space "->" directly;
11545 . proves theorems immediately and stores them in the theory,
11546 . creates hierachical name space,
11547 . now uses normal mixfix annotations (instead of cinfix...),
11548 . minor changes to some names and values (for consistency),
11549 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11550 . separator between mutual domain defs: changed "," to "and",
11551 . improved handling of sort constraints; now they have to
11552 appear on the left-hand side of the equations only;
11554 * fixed LAM <x,y,zs>.b syntax;
11556 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11557 adm (%x. P (t x)), where P is chainfinite and t continuous;
11562 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11563 with `addloop' of the simplifier to faciliate case splitting in premises.
11565 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11566 in HOL, they strip ALL and --> from proved theorems;
11570 New in Isabelle94-8 (May 1997)
11571 ------------------------------
11573 *** General Changes ***
11575 * new utilities to build / run / maintain Isabelle etc. (in parts
11576 still somewhat experimental); old Makefiles etc. still functional;
11578 * new 'Isabelle System Manual';
11580 * INSTALL text, together with ./configure and ./build scripts;
11582 * reimplemented type inference for greater efficiency, better error
11583 messages and clean internal interface;
11585 * prlim command for dealing with lots of subgoals (an easier way of
11586 setting goals_limit);
11591 * supports alternative (named) syntax tables (parser and pretty
11592 printer); internal interface is provided by add_modesyntax(_i);
11594 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11595 be used in conjunction with the Isabelle symbol font; uses the
11596 "symbols" syntax table;
11598 * added token_translation interface (may translate name tokens in
11599 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11600 the current print_mode); IMPORTANT: user print translation functions
11601 are responsible for marking newly introduced bounds
11602 (Syntax.mark_boundT);
11604 * token translations for modes "xterm" and "xterm_color" that display
11605 names in bold, underline etc. or colors (which requires a color
11608 * infixes may now be declared with names independent of their syntax;
11610 * added typed_print_translation (like print_translation, but may
11611 access type of constant);
11614 *** Classical Reasoner ***
11616 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11617 some limitations. Blast_tac...
11618 + ignores addss, addbefore, addafter; this restriction is intrinsic
11619 + ignores elimination rules that don't have the correct format
11620 (the conclusion MUST be a formula variable)
11621 + ignores types, which can make HOL proofs fail
11622 + rules must not require higher-order unification, e.g. apply_type in ZF
11623 [message "Function Var's argument not a bound variable" relates to this]
11624 + its proof strategy is more general but can actually be slower
11626 * substitution with equality assumptions no longer permutes other
11629 * minor changes in semantics of addafter (now called addaltern); renamed
11630 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11631 (and access functions for it);
11633 * improved combination of classical reasoner and simplifier:
11634 + functions for handling clasimpsets
11635 + improvement of addss: now the simplifier is called _after_ the
11637 + safe variant of addss called addSss: uses safe simplifications
11638 _during_ the safe steps. It is more complete as it allows multiple
11639 instantiations of unknowns (e.g. with slow_tac).
11643 * added interface for simplification procedures (functions that
11644 produce *proven* rewrite rules on the fly, depending on current
11647 * ordering on terms as parameter (used for ordered rewriting);
11649 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11651 * the solver is now split into a safe and an unsafe part.
11652 This should be invisible for the normal user, except that the
11653 functions setsolver and addsolver have been renamed to setSolver and
11654 addSolver; added safe_asm_full_simp_tac;
11659 * a generic induction tactic `induct_tac' which works for all datatypes and
11660 also for type `nat';
11662 * a generic case distinction tactic `exhaust_tac' which works for all
11663 datatypes and also for type `nat';
11665 * each datatype comes with a function `size';
11667 * patterns in case expressions allow tuple patterns as arguments to
11668 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11670 * primrec now also works with type nat;
11672 * recdef: a new declaration form, allows general recursive functions to be
11673 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11675 * the constant for negation has been renamed from "not" to "Not" to
11676 harmonize with FOL, ZF, LK, etc.;
11678 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11681 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11683 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11684 problems in commutative rings, using axiomatic type classes for + and *;
11686 * more examples in HOL/MiniML and HOL/Auth;
11688 * more default rewrite rules for quantifiers, union/intersection;
11690 * a new constant `arbitrary == @x.False';
11692 * HOLCF/IOA replaces old HOL/IOA;
11694 * HOLCF changes: derived all rules and arities
11695 + axiomatic type classes instead of classes
11696 + typedef instead of faking type definitions
11697 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11698 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11699 + eliminated the types void, one, tr
11700 + use unit lift and bool lift (with translations) instead of one and tr
11701 + eliminated blift from Lift3.thy (use Def instead of blift)
11702 all eliminated rules are derived as theorems --> no visible changes ;
11707 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11708 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11709 as ZF_cs addSIs [equalityI];
11713 New in Isabelle94-7 (November 96)
11714 ---------------------------------
11716 * allowing negative levels (as offsets) in prlev and choplev;
11718 * super-linear speedup for large simplifications;
11720 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11721 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11722 FAIL); can suppress it using the command Delsimps (ex_simps @
11723 all_simps); De Morgan laws are also now included, by default;
11725 * improved printing of ==> : ~:
11727 * new object-logic "Sequents" adds linear logic, while replacing LK
11728 and Modal (thanks to Sara Kalvala);
11730 * HOL/Auth: correctness proofs for authentication protocols;
11732 * HOL: new auto_tac combines rewriting and classical reasoning (many
11733 examples on HOL/Auth);
11735 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11736 the rewriter and classical reasoner simultaneously;
11738 * function uresult no longer returns theorems in "standard" format;
11739 regain previous version by: val uresult = standard o uresult;
11743 New in Isabelle94-6
11744 -------------------
11746 * oracles -- these establish an interface between Isabelle and trusted
11747 external reasoners, which may deliver results as theorems;
11749 * proof objects (in particular record all uses of oracles);
11751 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11753 * "constdefs" section in theory files;
11755 * "primrec" section (HOL) no longer requires names;
11757 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11761 New in Isabelle94-5
11762 -------------------
11764 * reduced space requirements;
11766 * automatic HTML generation from theories;
11768 * theory files no longer require "..." (quotes) around most types;
11770 * new examples, including two proofs of the Church-Rosser theorem;
11772 * non-curried (1994) version of HOL is no longer distributed;
11776 New in Isabelle94-4
11777 -------------------
11779 * greatly reduced space requirements;
11781 * theory files (.thy) no longer require \...\ escapes at line breaks;
11783 * searchable theorem database (see the section "Retrieving theorems" on
11784 page 8 of the Reference Manual);
11786 * new examples, including Grabczewski's monumental case study of the
11789 * The previous version of HOL renamed to Old_HOL;
11791 * The new version of HOL (previously called CHOL) uses a curried syntax
11792 for functions. Application looks like f a b instead of f(a,b);
11794 * Mutually recursive inductive definitions finally work in HOL;
11796 * In ZF, pattern-matching on tuples is now available in all abstractions and
11797 translates to the operator "split";
11801 New in Isabelle94-3
11802 -------------------
11804 * new infix operator, addss, allowing the classical reasoner to
11805 perform simplification at each step of its search. Example:
11806 fast_tac (cs addss ss)
11808 * a new logic, CHOL, the same as HOL, but with a curried syntax
11809 for functions. Application looks like f a b instead of f(a,b). Also pairs
11810 look like (a,b) instead of <a,b>;
11812 * PLEASE NOTE: CHOL will eventually replace HOL!
11814 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11815 It translates to the operator "split". A new theory of integers is available;
11817 * In ZF, integer numerals now denote two's-complement binary integers.
11818 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11820 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11821 of the Axiom of Choice;
11825 New in Isabelle94-2
11826 -------------------
11828 * Significantly faster resolution;
11830 * the different sections in a .thy file can now be mixed and repeated
11833 * Database of theorems for FOL, HOL and ZF. New
11834 commands including qed, qed_goal and bind_thm store theorems in the database.
11836 * Simple database queries: return a named theorem (get_thm) or all theorems of
11837 a given theory (thms_of), or find out what theory a theorem was proved in
11840 * Bugs fixed in the inductive definition and datatype packages;
11842 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11843 and HOL_dup_cs obsolete;
11845 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11848 * Simpler definition of function space in ZF;
11850 * new results about cardinal and ordinal arithmetic in ZF;
11852 * 'subtype' facility in HOL for introducing new types as subsets of existing
11855 :mode=isabelle-news:wrap=hard:maxLineLen=72: