avoid the Complex constructor, use the more natural Re/Im view; moved csqrt to Complex.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Document antiquotation @{url} produces markup for the given URL,
10 which results in an active hyperlink within the text.
12 * Document antiquotation @{file_unchecked} is like @{file}, but does
13 not check existence within the file-system.
15 * Discontinued legacy_isub_isup, which was a temporary Isabelle/ML
16 workaround in Isabelle2013-1. The prover process no longer accepts
17 old identifier syntax with \<^isub> or \<^isup>.
19 * Syntax of document antiquotation @{rail} now uses \<newline> instead
20 of "\\", to avoid the optical illusion of escaped backslash within
21 string token. Minor INCOMPATIBILITY.
23 * Lexical syntax (inner and outer) supports text cartouches with
24 arbitrary nesting, and without escapes of quotes etc. The Prover IDE
25 supports input via ` (backquote).
27 * The outer syntax categories "text" (for formal comments and document
28 markup commands) and "altstring" (for literal fact references) allow
29 cartouches as well, in addition to the traditional mix of quotations.
31 * More static checking of proof methods, which allows the system to
32 form a closure over the concrete syntax. Method arguments should be
33 processed in the original proof context as far as possible, before
34 operating on the goal state. In any case, the standard discipline for
35 subgoal-addressing needs to be observed: no subgoals or a subgoal
36 number that is out of range produces an empty result sequence, not an
37 exception. Potential INCOMPATIBILITY for non-conformant tactical
40 * Support for official Standard ML within the Isabelle context.
41 Command 'SML_file' reads and evaluates the given Standard ML file.
42 Toplevel bindings are stored within the theory context; the initial
43 environment is restricted to the Standard ML implementation of
44 Poly/ML, without the add-ons of Isabelle/ML. Commands 'SML_import'
45 and 'SML_export' allow to exchange toplevel bindings between the two
46 separate environments. See also ~~/src/Tools/SML/Examples.thy for
50 *** Prover IDE -- Isabelle/Scala/jEdit ***
52 * Improved syntactic and semantic completion mechanism:
54 - No completion for Isar keywords that have already been recognized
55 by the prover, e.g. ":" within accepted Isar syntax looses its
56 meaning as abbreviation for symbol "\<in>".
58 - Completion context provides information about embedded languages
59 of Isabelle: keywords are only completed for outer syntax, symbols
60 or antiquotations for languages that support them. E.g. no symbol
61 completion for ML source, but within ML strings, comments,
64 - Support for semantic completion based on failed name space lookup.
65 The error produced by the prover contains information about
66 alternative names that are accessible in a particular position.
67 This may be used with explicit completion (C+b) or implicit
68 completion after some delay.
70 - Semantic completions may get extended by appending a suffix of
71 underscores to an already recognized name, e.g. "foo_" to complete
72 "foo" or "foobar" if these are known in the context. The special
73 identifier "__" serves as a wild-card in this respect: it
74 completes to the full collection of names from the name space
75 (truncated according to the system option "completion_limit").
77 - Syntax completion of the editor and semantic completion of the
78 prover are merged. Since the latter requires a full round-trip of
79 document update to arrive, the default for option
80 jedit_completion_delay has been changed to 0.5s to improve the
83 - Option jedit_completion_immediate may now get used with
84 jedit_completion_delay > 0, to complete symbol abbreviations
85 aggressively while benefiting from combined syntactic and semantic
88 - Support for simple completion templates (with single
89 place-holder), e.g. "`" for text cartouche, or "@{" for
92 - Support for path completion within the formal text, based on
95 - Improved treatment of completion vs. various forms of jEdit text
96 selection (multiple selections, rectangular selections,
97 rectangular selection as "tall caret").
99 - More reliable treatment of GUI events vs. completion popups: avoid
100 loosing keystrokes with slow / remote graphics displays.
102 * Integrated spell-checker for document text, comments etc. with
103 completion popup and context-menu. See also "Plugin Options /
104 Isabelle / General / Spell Checker" for some system options.
106 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
107 Open text buffers take precedence over copies within the file-system.
109 * Improved support for Isabelle/ML, with jEdit mode "isabelle-ml" for
112 * Document panel: simplied interaction where every single mouse click
113 (re)opens document via desktop environment or as jEdit buffer.
115 * More general "Query" panel supersedes "Find" panel, with GUI access
116 to commands 'find_theorems' and 'find_consts', as well as print
117 operations for the context. Minor incompatibility in keyboard
118 shortcuts etc.: replace action isabelle-find by isabelle-query.
120 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
121 General") allows to specify additional print modes for the prover
122 process, without requiring old-fashioned command-line invocation of
123 "isabelle jedit -m MODE".
125 * New panel: Simplifier trace. Provides an interactive view of the
126 simplification process, enabled by the newly-introduced
127 "simplifier_trace" declaration.
129 * Support for Navigator plugin (with toolbar buttons).
131 * More support for remote files (e.g. http) using standard Java
132 networking operations instead of jEdit virtual file-systems.
134 * Improved Console/Scala plugin: more uniform scala.Console output,
135 more robust treatment of threads and interrupts.
140 * Basic constants of Pure use more conventional names and are always
141 qualified. Rare INCOMPATIBILITY, but with potentially serious
142 consequences, notably for tools in Isabelle/ML. The following
143 renaming needs to be applied:
149 dummy_pattern ~> Pure.dummy_pattern
151 Systematic porting works by using the following theory setup on a
152 *previous* Isabelle version to introduce the new name accesses for the
158 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
159 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
160 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
161 |> Sign.restore_naming thy
164 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
165 Later the application is moved to the current Isabelle version, and
166 the auxiliary aliases are deleted.
168 * Low-level type-class commands 'classes', 'classrel', 'arities' have
169 been discontinued to avoid the danger of non-trivial axiomatization
170 that is not immediately visible. INCOMPATIBILITY, use regular
171 'instance' with proof. The required OFCLASS(...) theorem might be
172 postulated via 'axiomatization' beforehand, or the proof finished
173 trivially if the underlying class definition is made vacuous (without
174 any assumptions). See also Isabelle/ML operations
175 Axclass.axiomatize_class, Axclass.axiomatize_classrel,
176 Axclass.axiomatize_arity.
178 * Attributes "where" and "of" allow an optional context of local
179 variables ('for' declaration): these variables become schematic in the
180 instantiated theorem.
182 * Obsolete attribute "standard" has been discontinued (legacy since
183 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
184 where instantiations with schematic variables are intended (for
185 declaration commands like 'lemmas' or attributes like "of"). The
186 following temporary definition may help to port old applications:
188 attribute_setup standard =
189 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
191 * More thorough check of proof context for goal statements and
192 attributed fact expressions (concerning background theory, declared
193 hyps). Potential INCOMPATIBILITY, tools need to observe standard
194 context discipline. See also Assumption.add_assumes and the more
195 primitive Thm.assume_hyps.
197 * Inner syntax token language allows regular quoted strings "..."
198 (only makes sense in practice, if outer syntax is delimited
204 * Adjustion of INF and SUP operations:
205 * Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
206 * Consolidated theorem names containing INFI and SUPR: have INF
207 and SUP instead uniformly.
208 * More aggressive normalization of expressions involving INF and Inf
210 * INF_image and SUP_image do not unfold composition.
211 * Dropped facts INF_comp, SUP_comp.
212 * Default congruence rules strong_INF_cong and strong_SUP_cong,
213 with simplifier implication in premises. Generalize and replace
214 former INT_cong, SUP_cong
217 * Swapped orientation of facts image_comp and vimage_comp:
218 image_compose ~> image_comp [symmetric]
219 image_comp ~> image_comp [symmetric]
220 vimage_compose ~> vimage_comp [symmetric]
221 vimage_comp ~> vimage_comp [symmetric]
224 * Simplifier: Enhanced solver of preconditions of rewrite rules
225 can now deal with conjunctions.
226 For help with converting proofs, the old behaviour of the simplifier
227 can be restored like this: declare/using [[simp_legacy_precond]]
228 This configuration option will disappear again in the future.
231 * Abandoned fact collection "word_arith_alts", which is a
232 duplicate of "word_arith_wis".
233 * Dropped first (duplicated) element in fact collections
234 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
235 "uint_word_arith_bintrs".
237 * Code generator: enforce case of identifiers only for strict
238 target language requirements. INCOMPATIBILITY.
240 * Code generator: explicit proof contexts in many ML interfaces.
243 * Code generator: minimize exported identifiers by default.
244 Minor INCOMPATIBILITY.
246 * Code generation for SML and OCaml: dropped arcane "no_signatures" option.
247 Minor INCOMPATIBILITY.
249 * Simproc "finite_Collect" is no longer enabled by default, due to
250 spurious crashes and other surprises. Potential INCOMPATIBILITY.
252 * Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
253 The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
254 "primcorec", and "primcorecursive" commands are now part of "Main".
256 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
257 Library/Wfrec.thy ~> Wfrec.thy
258 Library/Zorn.thy ~> Zorn.thy
259 Cardinals/Order_Relation.thy ~> Order_Relation.thy
260 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
261 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
262 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
263 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
264 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
265 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
266 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
267 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
268 BNF/BNF_Comp.thy ~> BNF_Comp.thy
269 BNF/BNF_Def.thy ~> BNF_Def.thy
270 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
271 BNF/BNF_GFP.thy ~> BNF_GFP.thy
272 BNF/BNF_LFP.thy ~> BNF_LFP.thy
273 BNF/BNF_Util.thy ~> BNF_Util.thy
274 BNF/Coinduction.thy ~> Coinduction.thy
275 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
276 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
277 BNF/Examples/* ~> BNF_Examples/*
279 Wellorder_Extension.thy (split from Zorn.thy)
280 Library/Cardinal_Notations.thy
282 BNF_Examples/Misc_Primcorec.thy
283 BNF_Examples/Stream_Processor.thy
284 Discontinued theories:
286 BNF/Equiv_Relations_More.thy
289 * New (co)datatype package:
290 * "primcorec" is fully implemented.
291 * "datatype_new" generates size functions ("size_xxx" and "size") as
293 * BNFs are integrated with the Lifting tool and new-style (co)datatypes
296 datatype_new_compat ~> datatype_compat
297 primrec_new ~> primrec
298 wrap_free_constructors ~> free_constructors
300 * The generated constants "xxx_case" and "xxx_rec" have been renamed
301 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
303 * The constant "xxx_(un)fold" and related theorems are no longer generated.
304 Use "xxx_(co)rec" or define "xxx_(un)fold" manually using "prim(co)rec".
307 * Old datatype package:
308 * The generated theorems "xxx.cases" and "xxx.recs" have been renamed
309 "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> "sum.case").
311 * The generated constants "xxx_case", "xxx_rec", and "xxx_size" have been
312 renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g., "prod_case" ~>
316 * The types "'a list" and "'a option", their set and map functions, their
317 relators, and their selectors are now produced using the new BNF-based
320 Option.set ~> set_option
321 Option.map ~> map_option
322 option_rel ~> rel_option
324 set_def ~> set_rec[abs_def]
325 map_def ~> map_rec[abs_def]
326 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
327 option.recs ~> option.rec
328 list_all2_def ~> list_all2_iff
329 set.simps ~> set_simps (or the slightly different "list.set")
330 map.simps ~> list.map
331 hd.simps ~> list.sel(1)
332 tl.simps ~> list.sel(2-3)
333 the.simps ~> option.sel
336 * The following map functions and relators have been renamed:
343 filter_rel ~> rel_filter
344 fset_rel ~> rel_fset (in "Library/FSet.thy")
345 cset_rel ~> rel_cset (in "Library/Countable_Set_Type.thy")
346 vset ~> rel_vset (in "Library/Quotient_Set.thy")
349 Cardinals/Ordinal_Arithmetic.thy
351 * Theory reorganizations:
352 * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
354 * New internal SAT solver "cdclite" that produces models and proof traces.
355 This solver replaces the internal SAT solvers "enumerate" and "dpll".
356 Applications that explicitly used one of these two SAT solvers should
357 use "cdclite" instead. In addition, "cdclite" is now the default SAT
358 solver for the "sat" and "satx" proof methods and corresponding tactics;
359 the old default can be restored using
360 "declare [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
363 * A new version of the SMT module, temporarily called "SMT2", uses SMT-LIB 2
364 and supports recent versions of Z3 (e.g., 4.3). The new proof method is
365 called "smt2", and the new Z3 is called "z3_new" in Sledgehammer and
369 - New prover "z3_new" with support for Isar proofs
373 isar_compress ~> compress_isar
374 isar_try0 ~> try0_isar
378 - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
381 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
383 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
385 * The symbol "\<newline>" may be used within char or string literals
386 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
388 * Activation of Z3 now works via "z3_non_commercial" system option
389 (without requiring restart), instead of former settings variable
390 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
391 Plugin Options / Isabelle / General.
393 * "declare [[code abort: ...]]" replaces "code_abort ...".
396 * "declare [[code drop: ...]]" drops all code equations associated
397 with the given constants.
399 * Abolished slightly odd global lattice interpretation for min/max.
402 min_max.inf_assoc ~> min.assoc
403 min_max.inf_commute ~> min.commute
404 min_max.inf_left_commute ~> min.left_commute
405 min_max.inf_idem ~> min.idem
406 min_max.inf_left_idem ~> min.left_idem
407 min_max.inf_right_idem ~> min.right_idem
408 min_max.sup_assoc ~> max.assoc
409 min_max.sup_commute ~> max.commute
410 min_max.sup_left_commute ~> max.left_commute
411 min_max.sup_idem ~> max.idem
412 min_max.sup_left_idem ~> max.left_idem
413 min_max.sup_inf_distrib1 ~> max_min_distrib2
414 min_max.sup_inf_distrib2 ~> max_min_distrib1
415 min_max.inf_sup_distrib1 ~> min_max_distrib2
416 min_max.inf_sup_distrib2 ~> min_max_distrib1
417 min_max.distrib ~> min_max_distribs
418 min_max.inf_absorb1 ~> min.absorb1
419 min_max.inf_absorb2 ~> min.absorb2
420 min_max.sup_absorb1 ~> max.absorb1
421 min_max.sup_absorb2 ~> max.absorb2
422 min_max.le_iff_inf ~> min.absorb_iff1
423 min_max.le_iff_sup ~> max.absorb_iff2
424 min_max.inf_le1 ~> min.cobounded1
425 min_max.inf_le2 ~> min.cobounded2
426 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
427 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
428 min_max.le_infI1 ~> min.coboundedI1
429 min_max.le_infI2 ~> min.coboundedI2
430 min_max.le_supI1 ~> max.coboundedI1
431 min_max.le_supI2 ~> max.coboundedI2
432 min_max.less_infI1 ~> min.strict_coboundedI1
433 min_max.less_infI2 ~> min.strict_coboundedI2
434 min_max.less_supI1 ~> max.strict_coboundedI1
435 min_max.less_supI2 ~> max.strict_coboundedI2
436 min_max.inf_mono ~> min.mono
437 min_max.sup_mono ~> max.mono
438 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
439 min_max.le_supI, min_max.sup_least ~> max.boundedI
440 min_max.le_inf_iff ~> min.bounded_iff
441 min_max.le_sup_iff ~> max.bounded_iff
443 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
444 min.left_commute, min.left_idem, max.commute, max.assoc,
445 max.left_commute, max.left_idem directly.
447 For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
448 max.cobounded1m max.cobounded2 directly.
450 For min_ac or max_ac, prefer more general collection ac_simps.
454 * Word library: bit representations prefer type bool over type bit.
457 * Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
460 * Code generations are provided for make, fields, extend and truncate
461 operations on records.
463 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
466 * Fact generalization and consolidation:
467 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
470 * Purely algebraic definition of even. Fact generalization and consolidation:
471 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
472 even_zero_(nat|int) ~> even_zero
475 * Abolished neg_numeral.
476 * Canonical representation for minus one is "- 1".
477 * Canonical representation for other negative numbers is "- (numeral _)".
478 * When devising rule sets for number calculation, consider the
479 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
480 * HOLogic.dest_number also recognizes numerals in non-canonical forms
481 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
482 * Syntax for negative numerals is mere input syntax.
485 * Elimination of fact duplicates:
486 equals_zero_I ~> minus_unique
487 diff_eq_0_iff_eq ~> right_minus_eq
488 nat_infinite ~> infinite_UNIV_nat
489 int_infinite ~> infinite_UNIV_int
492 * Fact name consolidation:
493 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
494 minus_le_self_iff ~> neg_less_eq_nonneg
495 le_minus_self_iff ~> less_eq_neg_nonpos
496 neg_less_nonneg ~> neg_less_pos
497 less_minus_self_iff ~> less_neg_neg [simp]
500 * More simplification rules on unary and binary minus:
501 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
502 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
503 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
504 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
505 minus_add_cancel, uminus_add_conv_diff. These correspondingly
506 have been taken away from fact collections algebra_simps and
507 field_simps. INCOMPATIBILITY.
509 To restore proofs, the following patterns are helpful:
511 a) Arbitrary failing proof not involving "diff_def":
512 Consider simplification with algebra_simps or field_simps.
514 b) Lifting rules from addition to subtraction:
515 Try with "using <rule for addition> of [... "- _" ...]" by simp".
517 c) Simplification with "diff_def": just drop "diff_def".
518 Consider simplification with algebra_simps or field_simps;
519 or the brute way with
520 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
522 * SUP and INF generalized to conditionally_complete_lattice
524 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
525 Conditionally_Complete_Lattices. INCOMPATIBILITY.
527 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
528 instead of explicitly stating boundedness of sets.
530 * ccpo.admissible quantifies only over non-empty chains to allow
531 more syntax-directed proof rules; the case of the empty chain
532 shows up as additional case in fixpoint induction proofs.
535 * Removed and renamed theorems in Series:
536 summable_le ~> suminf_le
537 suminf_le ~> suminf_le_const
538 series_pos_le ~> setsum_le_suminf
539 series_pos_less ~> setsum_less_suminf
540 suminf_ge_zero ~> suminf_nonneg
541 suminf_gt_zero ~> suminf_pos
542 suminf_gt_zero_iff ~> suminf_pos_iff
543 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
544 suminf_0_le ~> suminf_nonneg [rotate]
545 pos_summable ~> summableI_nonneg_bounded
546 ratio_test ~> summable_ratio_test
548 removed series_zero, replaced by sums_finite
550 removed auxiliary lemmas:
551 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
552 half, le_Suc_ex_iff, lemma_realpow_diff_sumr, real_setsum_nat_ivl_bounded,
553 summable_le2, ratio_test_lemma2, sumr_minus_one_realpow_zerom,
554 sumr_one_lb_realpow_zero, summable_convergent_sumr_iff, sumr_diff_mult_const
557 * Replace (F)DERIV syntax by has_derivative:
558 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
560 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
562 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
564 - removed constant isDiff
566 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as input
569 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed
571 - Renamed FDERIV_... lemmas to has_derivative_...
573 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
575 - removed DERIV_intros, has_derivative_eq_intros
577 - introduced derivative_intros and deriative_eq_intros which includes now rules for
578 DERIV, has_derivative and has_vector_derivative.
581 differentiable_def ~> real_differentiable_def
582 differentiableE ~> real_differentiableE
583 fderiv_def ~> has_derivative_at
584 field_fderiv_def ~> field_has_derivative_at
585 isDiff_der ~> differentiable_def
586 deriv_fderiv ~> has_field_derivative_def
587 deriv_def ~> DERIV_def
590 * Include more theorems in continuous_intros. Remove the continuous_on_intros,
591 isCont_intros collections, these facts are now in continuous_intros.
593 * Theorems about complex numbers are now stated only using Re and Im, the Complex
594 constructor is not used anymore. It is possible to use primcorec to defined the
595 behaviour of a complex-valued function.
597 Removed theorems about the Complex constructor from the simpset, they are
598 available as the lemma collection legacy_Complex_simps. This especially
600 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
602 Instead the reverse direction is supported with
603 Complex_eq: "Complex a b = a + \<i> * b"
605 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
609 complex_Re/Im_zero ~> zero_complex.sel
610 complex_Re/Im_add ~> plus_complex.sel
611 complex_Re/Im_minus ~> uminus_complex.sel
612 complex_Re/Im_diff ~> minus_complex.sel
613 complex_Re/Im_one ~> one_complex.sel
614 complex_Re/Im_mult ~> times_complex.sel
615 complex_Re/Im_inverse ~> inverse_complex.sel
616 complex_Re/Im_scaleR ~> scaleR_complex.sel
617 complex_Re/Im_i ~> ii.sel
618 complex_Re/Im_cnj ~> cnj.sel
621 complex_divide_def ~> divide_complex_def
622 complex_norm_def ~> norm_complex_def
623 cmod_def ~> norm_complex_de
635 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
638 - Fixed soundness bug whereby mutually recursive datatypes could take
640 - Fixed soundness bug with low-level number functions such as "Abs_Integ" and
642 - Removed "std" option.
643 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
646 * HOL-Multivariate_Analysis:
647 - type class ordered_real_vector for ordered vector spaces
648 - changed order of ordered_euclidean_space to be compatible with
649 pointwise ordering on products. Therefore instance of
650 conditionally_complete_lattice and ordered_real_vector.
651 INCOMPATIBILITY: use box instead of greaterThanLessThan or
652 explicit set-comprehensions with eucl_less for other (half-) open
656 derivative_linear ~> has_derivative_bounded_linear
657 derivative_is_linear ~> has_derivative_linear
658 bounded_linear_imp_linear ~> bounded_linear.linear
663 * The signature and semantics of Document.Snapshot.cumulate_markup /
664 select_markup have been clarified. Markup is now traversed in the
665 order of reports given by the prover: later markup is usually more
666 specific and may override results accumulated so far. The elements
667 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
672 * Moved ML_Compiler.exn_trace and other operations on exceptions to
673 structure Runtime. Minor INCOMPATIBILITY.
675 * Discontinued old Toplevel.debug in favour of system option
676 "ML_exception_trace", which may be also declared within the context via
677 "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
679 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
682 * Configuration option "ML_print_depth" controls the pretty-printing
683 depth of the ML compiler within the context. The old print_depth in
684 ML is still available as default_print_depth, but rarely used. Minor
687 * Proper context discipline for read_instantiate and instantiate_tac:
688 variables that are meant to become schematic need to be given as
689 fixed, and are generalized by the explicit context of local variables.
690 This corresponds to Isar attributes "where" and "of" with 'for'
691 declaration. INCOMPATIBILITY, also due to potential change of indices
692 of schematic variables.
694 * Toplevel function "use" refers to raw ML bootstrap environment,
695 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
696 Note that 'ML_file' is the canonical command to load ML files into the
699 * Proper context for basic Simplifier operations: rewrite_rule,
700 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
701 pass runtime Proof.context (and ensure that the simplified entity
702 actually belongs to it).
704 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
705 compared (according to Thm.thm_ord), but assumed to be covered by the
706 current background theory. Thus equivalent data produced in different
707 branches of the theory graph usually coincides (e.g. relevant for
708 theory merge). Note that the softer Thm.eq_thm_prop is often more
709 appropriate than Thm.eq_thm.
711 * Simplified programming interface to define ML antiquotations, see
712 structure ML_Antiquotation. Minor INCOMPATIBILITY.
714 * ML antiquotation @{here} refers to its source position, which is
715 occasionally useful for experimentation and diagnostic purposes.
717 * ML antiquotation @{path} produces a Path.T value, similarly to
718 Path.explode, but with compile-time check against the file-system and
719 some PIDE markup. Note that unlike theory source, ML does not have a
720 well-defined master directory, so an absolute symbolic path
721 specification is usually required, e.g. "~~/src/HOL".
723 * ML antiquotation @{print} inlines a function to print an arbitrary
724 ML value, which is occasionally useful for diagnostic or demonstration
730 * Session ROOT specifications require explicit 'document_files' for
731 robust dependencies on LaTeX sources. Only these explicitly given
732 files are copied to the document output directory, before document
733 processing is started.
735 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
736 and PDF_VIEWER now refer to the actual programs, not shell
737 command-lines. Discontinued option -c: invocation may be asynchronous
738 via desktop environment, without any special precautions. Potential
739 INCOMPATIBILITY with ambitious private settings.
741 * Improved 'display_drafts' concerning desktop integration and
742 repeated invocation in PIDE front-end: re-use single file
743 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
745 * The raw Isabelle process executable has been renamed from
746 "isabelle-process" to "isabelle_process", which conforms to common
747 shell naming conventions, and allows to define a shell function within
748 the Isabelle environment to avoid dynamic path lookup. Rare
749 incompatibility for old tools that do not use the $ISABELLE_PROCESS
750 settings variable yet.
752 * Retired the now unused Isabelle tool "wwwfind". Similar functionality
753 may be integrated into PIDE/jEdit at a later point.
755 New in Isabelle2013-2 (December 2013)
756 -------------------------------------
758 *** Prover IDE -- Isabelle/Scala/jEdit ***
760 * More robust editing of running commands with internal forks,
761 e.g. non-terminating 'by' steps.
763 * More relaxed Sledgehammer panel: avoid repeated application of query
764 after edits surrounding the command location.
766 * More status information about commands that are interrupted
767 accidentally (via physical event or Poly/ML runtime system signal,
773 * More robust termination of external processes managed by
774 Isabelle/ML: support cancellation of tasks within the range of
775 milliseconds, as required for PIDE document editing with automatically
776 tried tools (e.g. Sledgehammer).
778 * Reactivated Isabelle/Scala kill command for external processes on
779 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
780 workaround for some Debian/Ubuntu Linux versions from 2013.
784 New in Isabelle2013-1 (November 2013)
785 -------------------------------------
789 * Discontinued obsolete 'uses' within theory header. Note that
790 commands like 'ML_file' work without separate declaration of file
791 dependencies. Minor INCOMPATIBILITY.
793 * Discontinued redundant 'use' command, which was superseded by
794 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
796 * Simplified subscripts within identifiers, using plain \<^sub>
797 instead of the second copy \<^isub> and \<^isup>. Superscripts are
798 only for literal tokens within notation; explicit mixfix annotations
799 for consts or fixed variables may be used as fall-back for unusual
800 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
801 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
802 standardize symbols as a starting point for further manual cleanup.
803 The ML reference variable "legacy_isub_isup" may be set as temporary
804 workaround, to make the prover accept a subset of the old identifier
807 * Document antiquotations: term style "isub" has been renamed to
808 "sub". Minor INCOMPATIBILITY.
810 * Uniform management of "quick_and_dirty" as system option (see also
811 "isabelle options"), configuration option within the context (see also
812 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
813 INCOMPATIBILITY, need to use more official Isabelle means to access
814 quick_and_dirty, instead of historical poking into mutable reference.
816 * Renamed command 'print_configs' to 'print_options'. Minor
819 * Proper diagnostic command 'print_state'. Old 'pr' (with its
820 implicit change of some global references) is retained for now as
821 control command, e.g. for ProofGeneral 3.7.x.
823 * Discontinued 'print_drafts' command with its old-fashioned PS output
824 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
825 'display_drafts' instead and print via the regular document viewer.
827 * Updated and extended "isar-ref" and "implementation" manual,
828 eliminated old "ref" manual.
831 *** Prover IDE -- Isabelle/Scala/jEdit ***
833 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
836 * Dockable window "Documentation" provides access to Isabelle
839 * Dockable window "Find" provides query operations for formal entities
840 (GUI front-end to 'find_theorems' command).
842 * Dockable window "Sledgehammer" manages asynchronous / parallel
843 sledgehammer runs over existing document sources, independently of
844 normal editing and checking process.
846 * Dockable window "Timing" provides an overview of relevant command
847 timing information, depending on option jedit_timing_threshold. The
848 same timing information is shown in the extended tooltip of the
849 command keyword, when hovering the mouse over it while the CONTROL or
850 COMMAND modifier is pressed.
852 * Improved dockable window "Theories": Continuous checking of proof
853 document (visible and required parts) may be controlled explicitly,
854 using check box or shortcut "C+e ENTER". Individual theory nodes may
855 be marked explicitly as required and checked in full, using check box
856 or shortcut "C+e SPACE".
858 * Improved completion mechanism, which is now managed by the
859 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
860 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
862 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
863 isabelle.complete for explicit completion in Isabelle sources.
864 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
867 * Improved support of various "minor modes" for Isabelle NEWS,
868 options, session ROOT etc., with completion and SideKick tree view.
870 * Strictly monotonic document update, without premature cancellation of
871 running transactions that are still needed: avoid reset/restart of
872 such command executions while editing.
874 * Support for asynchronous print functions, as overlay to existing
877 * Support for automatic tools in HOL, which try to prove or disprove
878 toplevel theorem statements.
880 * Action isabelle.reset-font-size resets main text area font size
881 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
882 also "Plugin Options / Isabelle / General"). It can be bound to some
883 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
885 * File specifications in jEdit (e.g. file browser) may refer to
886 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
887 obsolete $ISABELLE_HOME_WINDOWS variable.
889 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
890 / Global Options / Appearance".
892 * Improved support of native Mac OS X functionality via "MacOSX"
893 plugin, which is now enabled by default.
898 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
899 In particular, 'interpretation' allows for non-persistent
900 interpretation within "context ... begin ... end" blocks offering a
901 light-weight alternative to 'sublocale'. See "isar-ref" manual for
904 * Improved locales diagnostic command 'print_dependencies'.
906 * Discontinued obsolete 'axioms' command, which has been marked as
907 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
908 instead, while observing its uniform scope for polymorphism.
910 * Discontinued empty name bindings in 'axiomatization'.
913 * System option "proofs" has been discontinued. Instead the global
914 state of Proofterm.proofs is persistently compiled into logic images
915 as required, notably HOL-Proofs. Users no longer need to change
916 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
918 * Syntax translation functions (print_translation etc.) always depend
919 on Proof.context. Discontinued former "(advanced)" option -- this is
920 now the default. Minor INCOMPATIBILITY.
922 * Former global reference trace_unify_fail is now available as
923 configuration option "unify_trace_failure" (global context only).
925 * SELECT_GOAL now retains the syntactic context of the overall goal
926 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
932 * Stronger precedence of syntax for big intersection and union on
933 sets, in accordance with corresponding lattice operations.
936 * Notation "{p:A. P}" now allows tuple patterns as well.
938 * Nested case expressions are now translated in a separate check phase
939 rather than during parsing. The data for case combinators is separated
940 from the datatype package. The declaration attribute
941 "case_translation" can be used to register new case combinators:
943 declare [[case_translation case_combinator constructor1 ... constructorN]]
946 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
948 - 'code_identifier' declares name hints for arbitrary identifiers in
949 generated code, subsuming 'code_modulename'.
951 See the isar-ref manual for syntax diagrams, and the HOL theories for
954 * Attibute 'code': 'code' now declares concrete and abstract code
955 equations uniformly. Use explicit 'code equation' and 'code abstract'
956 to distinguish both when desired.
958 * Discontinued theories Code_Integer and Efficient_Nat by a more
959 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
960 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
961 generation for details. INCOMPATIBILITY.
963 * Numeric types are mapped by default to target language numerals:
964 natural (replaces former code_numeral) and integer (replaces former
965 code_int). Conversions are available as integer_of_natural /
966 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
967 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
968 ML). INCOMPATIBILITY.
970 * Function package: For mutually recursive functions f and g, separate
971 cases rules f.cases and g.cases are generated instead of unusable
972 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
973 in the case that the unusable rule was used nevertheless.
975 * Function package: For each function f, new rules f.elims are
976 generated, which eliminate equalities of the form "f x = t".
978 * New command 'fun_cases' derives ad-hoc elimination rules for
979 function equations as simplified instances of f.elims, analogous to
980 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
983 - parametrized correspondence relations are now supported:
984 + parametricity theorems for the raw term can be specified in
985 the command lift_definition, which allow us to generate stronger
987 + setup_lifting generates stronger transfer rules if parametric
988 correspondence relation can be generated
989 + various new properties of the relator must be specified to support
991 + parametricity theorem for the Quotient relation can be specified
992 - setup_lifting generates domain rules for the Transfer package
993 - stronger reflexivity prover of respectfulness theorems for type
995 - ===> and --> are now local. The symbols can be introduced
996 by interpreting the locale lifting_syntax (typically in an
998 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
999 Main. Potential INCOMPATIBILITY
1000 - new commands for restoring and deleting Lifting/Transfer context:
1001 lifting_forget, lifting_update
1002 - the command print_quotmaps was renamed to print_quot_maps.
1006 - better support for domains in Transfer: replace Domainp T
1007 by the actual invariant in a transferred goal
1008 - transfer rules can have as assumptions other transfer rules
1009 - Experimental support for transferring from the raw level to the
1010 abstract level: Transfer.transferred attribute
1011 - Attribute version of the transfer method: untransferred attribute
1013 * Reification and reflection:
1014 - Reification is now directly available in HOL-Main in structure
1016 - Reflection now handles multiple lists with variables also.
1017 - The whole reflection stack has been decomposed into conversions.
1020 * Revised devices for recursive definitions over finite sets:
1021 - Only one fundamental fold combinator on finite set remains:
1022 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1023 This is now identity on infinite sets.
1024 - Locales ("mini packages") for fundamental definitions with
1025 Finite_Set.fold: folding, folding_idem.
1026 - Locales comm_monoid_set, semilattice_order_set and
1027 semilattice_neutr_order_set for big operators on sets.
1028 See theory Big_Operators for canonical examples.
1029 Note that foundational constants comm_monoid_set.F and
1030 semilattice_set.F correspond to former combinators fold_image
1031 and fold1 respectively. These are now gone. You may use
1032 those foundational constants as substitutes, but it is
1033 preferable to interpret the above locales accordingly.
1034 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1035 no longer needed in connection with Finite_Set.fold etc.)
1037 card.union_inter ~> card_Un_Int [symmetric]
1038 card.union_disjoint ~> card_Un_disjoint
1041 * Locale hierarchy for abstract orderings and (semi)lattices.
1043 * Complete_Partial_Order.admissible is defined outside the type class
1044 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1045 class predicate assumption or sort constraint when possible.
1048 * Introduce type class "conditionally_complete_lattice": Like a
1049 complete lattice but does not assume the existence of the top and
1050 bottom elements. Allows to generalize some lemmas about reals and
1051 extended reals. Removed SupInf and replaced it by the instantiation
1052 of conditionally_complete_lattice for real. Renamed lemmas about
1053 conditionally-complete lattice from Sup_... to cSup_... and from
1054 Inf_... to cInf_... to avoid hidding of similar complete lattice
1057 * Introduce type class linear_continuum as combination of
1058 conditionally-complete lattices and inner dense linorders which have
1059 more than one element. INCOMPATIBILITY.
1061 * Introduced type classes order_top and order_bot. The old classes top
1062 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1063 Rename bot -> order_bot, top -> order_top
1065 * Introduce type classes "no_top" and "no_bot" for orderings without
1066 top and bottom elements.
1068 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1070 * Complex_Main: Unify and move various concepts from
1071 HOL-Multivariate_Analysis to HOL-Complex_Main.
1073 - Introduce type class (lin)order_topology and
1074 linear_continuum_topology. Allows to generalize theorems about
1075 limits and order. Instances are reals and extended reals.
1077 - continuous and continuos_on from Multivariate_Analysis:
1078 "continuous" is the continuity of a function at a filter. "isCont"
1079 is now an abbrevitation: "isCont x f == continuous (at _) f".
1081 Generalized continuity lemmas from isCont to continuous on an
1084 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1085 compactness of closed intervals on reals. Continuous functions
1086 attain infimum and supremum on compact sets. The inverse of a
1087 continuous function is continuous, when the function is continuous
1090 - connected from Multivariate_Analysis. Use it to prove the
1091 intermediate value theorem. Show connectedness of intervals on
1092 linear_continuum_topology).
1094 - first_countable_topology from Multivariate_Analysis. Is used to
1095 show equivalence of properties on the neighbourhood filter of x and
1096 on all sequences converging to x.
1098 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1099 theorems from Library/FDERIV.thy to Deriv.thy and base the
1100 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1101 which are restricted to sets, i.e. to represent derivatives from
1104 - Removed the within-filter. It is replaced by the principal filter:
1106 F within X = inf F (principal X)
1108 - Introduce "at x within U" as a single constant, "at x" is now an
1109 abbreviation for "at x within UNIV"
1111 - Introduce named theorem collections tendsto_intros,
1112 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1113 in tendsto_intros (or FDERIV_intros) are also available as
1114 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1115 is replaced by a congruence rule. This allows to apply them as
1116 intro rules and then proving equivalence by the simplifier.
1118 - Restructured theories in HOL-Complex_Main:
1120 + Moved RealDef and RComplete into Real
1122 + Introduced Topological_Spaces and moved theorems about
1123 topological spaces, filters, limits and continuity to it
1125 + Renamed RealVector to Real_Vector_Spaces
1127 + Split Lim, SEQ, Series into Topological_Spaces,
1128 Real_Vector_Spaces, and Limits
1130 + Moved Ln and Log to Transcendental
1132 + Moved theorems about continuity from Deriv to Topological_Spaces
1134 - Remove various auxiliary lemmas.
1139 - Added option "spy".
1140 - Reduce incidence of "too high arity" errors.
1144 isar_shrink ~> isar_compress
1146 - Added options "isar_try0", "spy".
1147 - Better support for "isar_proofs".
1148 - MaSh has been fined-tuned and now runs as a local server.
1150 * Improved support for ad hoc overloading of constants (see also
1151 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1153 * Library/Polynomial.thy:
1154 - Use lifting for primitive definitions.
1155 - Explicit conversions from and to lists of coefficients, used for
1157 - Replaced recursion operator poly_rec by fold_coeffs.
1158 - Prefer pre-existing gcd operation for gcd.
1160 poly_eq_iff ~> poly_eq_poly_eq_iff
1161 poly_ext ~> poly_eqI
1162 expand_poly_eq ~> poly_eq_iff
1165 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1166 case_of_simps to convert function definitions between a list of
1167 equations with patterns on the lhs and a single equation with case
1168 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1170 * New Library/FSet.thy: type of finite sets defined as a subtype of
1171 sets defined by Lifting/Transfer.
1173 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1175 * Consolidation of library theories on product orders:
1177 Product_Lattice ~> Product_Order -- pointwise order on products
1178 Product_ord ~> Product_Lexorder -- lexicographic order on products
1182 * Imperative-HOL: The MREC combinator is considered legacy and no
1183 longer included by default. INCOMPATIBILITY, use partial_function
1184 instead, or import theory Legacy_Mrec as a fallback.
1186 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1187 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1188 ~~/src/HOL/Library/Polynomial instead. The latter provides
1189 integration with HOL's type classes for rings. INCOMPATIBILITY.
1192 - Various improvements to BNF-based (co)datatype package, including
1193 new commands "primrec_new", "primcorec", and
1194 "datatype_new_compat", as well as documentation. See
1195 "datatypes.pdf" for details.
1196 - New "coinduction" method to avoid some boilerplate (compared to
1199 data ~> datatype_new
1200 codata ~> codatatype
1202 - Renamed many generated theorems, including
1204 map_comp' ~> map_comp
1214 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1215 "check_property" allows to check specifications of the form "ALL x y
1216 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1217 Examples.thy in particular.
1219 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1220 tracing output in the command transaction context instead of physical
1221 stdout. See also Toplevel.debug, Toplevel.debugging and
1222 ML_Compiler.exn_trace.
1224 * ML type "theory" is now immutable, without any special treatment of
1225 drafts or linear updates (which could lead to "stale theory" errors in
1226 the past). Discontinued obsolete operations like Theory.copy,
1227 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1230 * More uniform naming of goal functions for skipped proofs:
1232 Skip_Proof.prove ~> Goal.prove_sorry
1233 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1235 Minor INCOMPATIBILITY.
1237 * Simplifier tactics and tools use proper Proof.context instead of
1238 historic type simpset. Old-style declarations like addsimps,
1239 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1240 retains its use as snapshot of the main Simplifier context, using
1241 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1242 old tools by making them depend on (ctxt : Proof.context) instead of
1243 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1245 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1246 operate on Proof.context instead of claset, for uniformity with addIs,
1247 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1248 clasets separately from the context.
1250 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1251 INCOMPATIBILITY, use @{context} instead.
1253 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1254 presents the result as initial Proof.context.
1259 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1260 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1262 * Discontinued obsolete isabelle-process options -f and -u (former
1263 administrative aliases of option -e). Minor INCOMPATIBILITY.
1265 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1268 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1269 document formats: dvi.gz, ps, ps.gz -- the default document format is
1272 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1273 specify global resources of the JVM process run by isabelle build.
1275 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1276 to run Isabelle/Scala source files as standalone programs.
1278 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1279 keyword tables): use Isabelle/Scala operations, which inspect outer
1280 syntax without requiring to build sessions first.
1282 * Sessions may be organized via 'chapter' specifications in the ROOT
1283 file, which determines a two-level hierarchy of browser info. The old
1284 tree-like organization via implicit sub-session relation (with its
1285 tendency towards erratic fluctuation of URLs) has been discontinued.
1286 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1287 for HTML presentation of theories.
1291 New in Isabelle2013 (February 2013)
1292 -----------------------------------
1296 * Theorem status about oracles and unfinished/failed future proofs is
1297 no longer printed by default, since it is incompatible with
1298 incremental / parallel checking of the persistent document model. ML
1299 function Thm.peek_status may be used to inspect a snapshot of the
1300 ongoing evaluation process. Note that in batch mode --- notably
1301 isabelle build --- the system ensures that future proofs of all
1302 accessible theorems in the theory context are finished (as before).
1304 * Configuration option show_markup controls direct inlining of markup
1305 into the printed representation of formal entities --- notably type
1306 and sort constraints. This enables Prover IDE users to retrieve that
1307 information via tooltips in the output window, for example.
1309 * Command 'ML_file' evaluates ML text from a file directly within the
1310 theory, without any predeclaration via 'uses' in the theory header.
1312 * Old command 'use' command and corresponding keyword 'uses' in the
1313 theory header are legacy features and will be discontinued soon.
1314 Tools that load their additional source files may imitate the
1315 'ML_file' implementation, such that the system can take care of
1316 dependencies properly.
1318 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1319 is called fastforce / fast_force_tac already since Isabelle2011-1.
1321 * Updated and extended "isar-ref" and "implementation" manual, reduced
1322 remaining material in old "ref" manual.
1324 * Improved support for auxiliary contexts that indicate block structure
1325 for specifications. Nesting of "context fixes ... context assumes ..."
1326 and "class ... context ...".
1328 * Attribute "consumes" allows a negative value as well, which is
1329 interpreted relatively to the total number of premises of the rule in
1330 the target context. This form of declaration is stable when exported
1331 from a nested 'context' with additional assumptions. It is the
1332 preferred form for definitional packages, notably cases/rules produced
1333 in HOL/inductive and HOL/function.
1335 * More informative error messages for Isar proof commands involving
1336 lazy enumerations (method applications etc.).
1338 * Refined 'help' command to retrieve outer syntax commands according
1339 to name patterns (with clickable results).
1342 *** Prover IDE -- Isabelle/Scala/jEdit ***
1344 * Parallel terminal proofs ('by') are enabled by default, likewise
1345 proofs that are built into packages like 'datatype', 'function'. This
1346 allows to "run ahead" checking the theory specifications on the
1347 surface, while the prover is still crunching on internal
1348 justifications. Unfinished / cancelled proofs are restarted as
1349 required to complete full proof checking eventually.
1351 * Improved output panel with tooltips, hyperlinks etc. based on the
1352 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1353 tooltips leads to some window that supports the same recursively,
1354 which can lead to stacks of tooltips as the semantic document content
1355 is explored. ESCAPE closes the whole stack, individual windows may be
1356 closed separately, or detached to become independent jEdit dockables.
1358 * Improved support for commands that produce graph output: the text
1359 message contains a clickable area to open a new instance of the graph
1362 * More robust incremental parsing of outer syntax (partial comments,
1363 malformed symbols). Changing the balance of open/close quotes and
1364 comment delimiters works more conveniently with unfinished situations
1365 that frequently occur in user interaction.
1367 * More efficient painting and improved reactivity when editing large
1368 files. More scalable management of formal document content.
1370 * Smarter handling of tracing messages: prover process pauses after
1371 certain number of messages per command transaction, with some user
1372 dialog to stop or continue. This avoids swamping the front-end with
1373 potentially infinite message streams.
1375 * More plugin options and preferences, based on Isabelle/Scala. The
1376 jEdit plugin option panel provides access to some Isabelle/Scala
1377 options, including tuning parameters for editor reactivity and color
1380 * Dockable window "Symbols" provides some editing support for Isabelle
1383 * Dockable window "Monitor" shows ML runtime statistics. Note that
1384 continuous display of the chart slows down the system.
1386 * Improved editing support for control styles: subscript, superscript,
1387 bold, reset of style -- operating on single symbols or text
1388 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1390 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1391 adjust the main text area font size, and its derivatives for output,
1392 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1393 need to be adapted to local keyboard layouts.
1395 * More reactive completion popup by default: use \t (TAB) instead of
1396 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1397 also "Plugin Options / SideKick / General / Code Completion Options".
1399 * Implicit check and build dialog of the specified logic session
1400 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1401 demand, without bundling big platform-dependent heap images in the
1402 Isabelle distribution.
1404 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1405 from Oracle provide better multi-platform experience. This version is
1406 now bundled exclusively with Isabelle.
1411 * Code generation for Haskell: restrict unqualified imports from
1412 Haskell Prelude to a small set of fundamental operations.
1414 * Command 'export_code': relative file names are interpreted
1415 relatively to master directory of current theory rather than the
1416 rather arbitrary current working directory. INCOMPATIBILITY.
1418 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1419 use regular rule composition via "OF" / "THEN", or explicit proof
1420 structure instead. Note that Isabelle/ML provides a variety of
1421 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1422 with some care where this is really required.
1424 * Command 'typ' supports an additional variant with explicit sort
1425 constraint, to infer and check the most general type conforming to a
1426 given sort. Example (in HOL):
1428 typ "_ * _ * bool * unit" :: finite
1430 * Command 'locale_deps' visualizes all locales and their relations as
1438 - Added MaSh relevance filter based on machine-learning; see the
1439 Sledgehammer manual for details.
1440 - Polished Isar proofs generated with "isar_proofs" option.
1441 - Rationalized type encodings ("type_enc" option).
1442 - Renamed "kill_provers" subcommand to "kill_all".
1444 isar_proof ~> isar_proofs
1445 isar_shrink_factor ~> isar_shrink
1446 max_relevant ~> max_facts
1447 relevance_thresholds ~> fact_thresholds
1449 * Quickcheck: added an optimisation for equality premises. It is
1450 switched on by default, and can be switched off by setting the
1451 configuration quickcheck_optimise_equality to false.
1453 * Quotient: only one quotient can be defined by quotient_type
1457 - generation of an abstraction function equation in lift_definition
1458 - quot_del attribute
1459 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1461 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1464 * Preprocessing of the code generator rewrites set comprehensions into
1465 pointfree expressions.
1467 * The SMT solver Z3 has now by default a restricted set of directly
1468 supported features. For the full set of features (div/mod, nonlinear
1469 arithmetic, datatypes/records) with potential proof reconstruction
1470 failures, enable the configuration option "z3_with_extensions". Minor
1473 * Simplified 'typedef' specifications: historical options for implicit
1474 set definition and alternative name have been discontinued. The
1475 former behavior of "typedef (open) t = A" is now the default, but
1476 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1479 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1480 directly. INCOMPATIBILITY.
1482 * Moved operation product, sublists and n_lists from theory Enum to
1483 List. INCOMPATIBILITY.
1485 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1487 * Class "comm_monoid_diff" formalises properties of bounded
1488 subtraction, with natural numbers and multisets as typical instances.
1490 * Added combinator "Option.these" with type "'a option set => 'a set".
1492 * Theory "Transitive_Closure": renamed lemmas
1494 reflcl_tranclp -> reflclp_tranclp
1495 rtranclp_reflcl -> rtranclp_reflclp
1499 * Theory "Rings": renamed lemmas (in class semiring)
1501 left_distrib ~> distrib_right
1502 right_distrib ~> distrib_left
1506 * Generalized the definition of limits:
1508 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1509 expresses that when the input values x converge to F then the
1510 output f x converges to G.
1512 - Added filters for convergence to positive (at_top) and negative
1515 - Moved infinity in the norm (at_infinity) from
1516 Multivariate_Analysis to Complex_Main.
1518 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1523 * Theory "Library/Option_ord" provides instantiation of option type to
1524 lattice type classes.
1526 * Theory "Library/Multiset": renamed
1528 constant fold_mset ~> Multiset.fold
1529 fact fold_mset_commute ~> fold_mset_comm
1533 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1536 - Renamed constants (and related lemmas)
1539 strict_prefix ~> prefix
1541 - Replaced constant "postfix" by "suffixeq" with swapped argument
1542 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1543 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1544 Renamed lemmas accordingly.
1546 - Added constant "list_hembeq" for homeomorphic embedding on
1547 lists. Added abbreviation "sublisteq" for special case
1548 "list_hembeq (op =)".
1550 - Theory Library/Sublist no longer provides "order" and "bot" type
1551 class instances for the prefix order (merely corresponding locale
1552 interpretations). The type class instances are now in theory
1553 Library/Prefix_Order.
1555 - The sublist relation of theory Library/Sublist_Order is now based
1556 on "Sublist.sublisteq". Renamed lemmas accordingly:
1558 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1559 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1560 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1561 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1562 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1563 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1564 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1565 le_list_drop_many ~> Sublist.sublisteq_drop_many
1566 le_list_filter_left ~> Sublist.sublisteq_filter_left
1567 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1568 le_list_rev_take_iff ~> Sublist.sublisteq_append
1569 le_list_same_length ~> Sublist.sublisteq_same_length
1570 le_list_take_many_iff ~> Sublist.sublisteq_append'
1571 less_eq_list.drop ~> less_eq_list_drop
1572 less_eq_list.induct ~> less_eq_list_induct
1573 not_le_list_length ~> Sublist.not_sublisteq_length
1577 * New theory Library/Countable_Set.
1579 * Theory Library/Debug and Library/Parallel provide debugging and
1580 parallel execution for code generated towards Isabelle/ML.
1582 * Theory Library/FuncSet: Extended support for Pi and extensional and
1583 introduce the extensional dependent function space "PiE". Replaced
1584 extensional_funcset by an abbreviation, and renamed lemmas from
1585 extensional_funcset to PiE as follows:
1587 extensional_empty ~> PiE_empty
1588 extensional_funcset_empty_domain ~> PiE_empty_domain
1589 extensional_funcset_empty_range ~> PiE_empty_range
1590 extensional_funcset_arb ~> PiE_arb
1591 extensional_funcset_mem ~> PiE_mem
1592 extensional_funcset_extend_domainI ~> PiE_fun_upd
1593 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1594 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1595 card_extensional_funcset ~> card_PiE
1596 finite_extensional_funcset ~> finite_PiE
1600 * Theory Library/FinFun: theory of almost everywhere constant
1601 functions (supersedes the AFP entry "Code Generation for Functions as
1604 * Theory Library/Phantom: generic phantom type to make a type
1605 parameter appear in a constant's type. This alternative to adding
1606 TYPE('a) as another parameter avoids unnecessary closures in generated
1609 * Theory Library/RBT_Impl: efficient construction of red-black trees
1610 from sorted associative lists. Merging two trees with rbt_union may
1611 return a structurally different tree than before. Potential
1614 * Theory Library/IArray: immutable arrays with code generation.
1616 * Theory Library/Finite_Lattice: theory of finite lattices.
1618 * HOL/Multivariate_Analysis: replaced
1620 "basis :: 'a::euclidean_space => nat => real"
1621 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1623 on euclidean spaces by using the inner product "_ \<bullet> _" with
1624 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1625 "SUM i : Basis. f i * r i".
1627 With this change the following constants are also changed or removed:
1629 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1630 a $$ i ~> inner a i (where i : Basis)
1632 \<pi>, \<pi>' removed
1634 Theorems about these constants where removed.
1638 component_le_norm ~> Basis_le_norm
1639 euclidean_eq ~> euclidean_eq_iff
1640 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1641 euclidean_simps ~> inner_simps
1642 independent_basis ~> independent_Basis
1643 span_basis ~> span_Basis
1644 in_span_basis ~> in_span_Basis
1645 norm_bound_component_le ~> norm_boound_Basis_le
1646 norm_bound_component_lt ~> norm_boound_Basis_lt
1647 component_le_infnorm ~> Basis_le_infnorm
1653 - Added simproc "measurable" to automatically prove measurability.
1655 - Added induction rules for sigma sets with disjoint union
1656 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1657 (borel_measurable_induct).
1659 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1662 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1663 AFP entry "Ordinals_and_Cardinals").
1665 * HOL/BNF: New (co)datatype package based on bounded natural functors
1666 with support for mixed, nested recursion and interesting non-free
1669 * HOL/Finite_Set and Relation: added new set and relation operations
1670 expressed by Finite_Set.fold.
1672 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1673 trees for the code generator.
1675 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1677 possible INCOMPATIBILITY.
1679 * HOL/Set: renamed Set.project -> Set.filter
1683 *** Document preparation ***
1685 * Dropped legacy antiquotations "term_style" and "thm_style", since
1686 styles may be given as arguments to "term" and "thm" already.
1687 Discontinued legacy styles "prem1" .. "prem19".
1689 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1690 instead of slightly exotic babel/greek.
1692 * Document variant NAME may use different LaTeX entry point
1693 document/root_NAME.tex if that file exists, instead of the common
1696 * Simplified custom document/build script, instead of old-style
1697 document/IsaMakefile. Minor INCOMPATIBILITY.
1702 * The default limit for maximum number of worker threads is now 8,
1703 instead of 4, in correspondence to capabilities of contemporary
1704 hardware and Poly/ML runtime system.
1706 * Type Seq.results and related operations support embedded error
1707 messages within lazy enumerations, and thus allow to provide
1708 informative errors in the absence of any usable results.
1710 * Renamed Position.str_of to Position.here to emphasize that this is a
1711 formal device to inline positions into message text, but not
1712 necessarily printing visible text.
1717 * Advanced support for Isabelle sessions and build management, see
1718 "system" manual for the chapter of that name, especially the "isabelle
1719 build" tool and its examples. The "isabelle mkroot" tool prepares
1720 session root directories for use with "isabelle build", similar to
1721 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1722 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1723 mkdir / make are rendered obsolete.
1725 * Discontinued obsolete Isabelle/build script, it is superseded by the
1726 regular isabelle build tool. For example:
1728 isabelle build -s -b HOL
1730 * Discontinued obsolete "isabelle makeall".
1732 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1733 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1734 provides some traditional targets that invoke "isabelle build". Note
1735 that this is inefficient! Applications of Isabelle/HOL involving
1736 "isabelle make" should be upgraded to use "isabelle build" directly.
1738 * The "isabelle options" tool prints Isabelle system options, as
1739 required for "isabelle build", for example.
1741 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1742 Minor INCOMPATIBILITY in command-line options.
1744 * The "isabelle install" tool has now a simpler command-line. Minor
1747 * The "isabelle components" tool helps to resolve add-on components
1748 that are not bundled, or referenced from a bare-bones repository
1749 version of Isabelle.
1751 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1752 platform family: "linux", "macos", "windows".
1754 * The ML system is configured as regular component, and no longer
1755 picked up from some surrounding directory. Potential INCOMPATIBILITY
1756 for home-made settings.
1758 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1760 * Discontinued support for Poly/ML 5.2.1, which was the last version
1761 without exception positions and advanced ML compiler/toplevel
1764 * Discontinued special treatment of Proof General -- no longer guess
1765 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1766 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1767 settings manually, or use a Proof General version that has been
1768 bundled as Isabelle component.
1772 New in Isabelle2012 (May 2012)
1773 ------------------------------
1777 * Prover IDE (PIDE) improvements:
1779 - more robust Sledgehammer integration (as before the sledgehammer
1780 command-line needs to be typed into the source buffer)
1781 - markup for bound variables
1782 - markup for types of term variables (displayed as tooltips)
1783 - support for user-defined Isar commands within the running session
1784 - improved support for Unicode outside original 16bit range
1785 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1787 * Forward declaration of outer syntax keywords within the theory
1788 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1789 commands to be used in the same theory where defined.
1791 * Auxiliary contexts indicate block structure for specifications with
1792 additional parameters and assumptions. Such unnamed contexts may be
1793 nested within other targets, like 'theory', 'locale', 'class',
1794 'instantiation' etc. Results from the local context are generalized
1795 accordingly and applied to the enclosing target context. Example:
1799 assumes xy: "x = y" and yz: "y = z"
1802 lemma my_trans: "x = z" using xy yz by simp
1808 The most basic application is to factor-out context elements of
1809 several fixes/assumes/shows theorem statements, e.g. see
1810 ~~/src/HOL/Isar_Examples/Group_Context.thy
1812 Any other local theory specification element works within the "context
1813 ... begin ... end" block as well.
1815 * Bundled declarations associate attributed fact expressions with a
1816 given name in the context. These may be later included in other
1817 contexts. This allows to manage context extensions casually, without
1818 the logical dependencies of locales and locale interpretation. See
1819 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1821 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1822 declaration, and results are standardized before being stored. Thus
1823 old-style "standard" after instantiation or composition of facts
1824 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1825 indices of schematic variables.
1827 * Rule attributes in local theory declarations (e.g. locale or class)
1828 are now statically evaluated: the resulting theorem is stored instead
1829 of the original expression. INCOMPATIBILITY in rare situations, where
1830 the historic accident of dynamic re-evaluation in interpretations
1833 * New tutorial "Programming and Proving in Isabelle/HOL"
1834 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1835 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1836 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1837 Logic" as the recommended beginners tutorial, but does not cover all
1838 of the material of that old tutorial.
1840 * Updated and extended reference manuals: "isar-ref",
1841 "implementation", "system"; reduced remaining material in old "ref"
1847 * Command 'definition' no longer exports the foundational "raw_def"
1848 into the user context. Minor INCOMPATIBILITY, may use the regular
1849 "def" result with attribute "abs_def" to imitate the old version.
1851 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1852 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1853 expand it. This also works for object-logic equality. (Formerly
1854 undocumented feature.)
1856 * Sort constraints are now propagated in simultaneous statements, just
1857 like type constraints. INCOMPATIBILITY in rare situations, where
1858 distinct sorts used to be assigned accidentally. For example:
1860 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1862 lemma "P (x::'a)" and "Q (y::'a::bar)"
1863 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1865 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1866 tolerant against multiple unifiers, as long as the final result is
1867 unique. (As before, rules are composed in canonical right-to-left
1868 order to accommodate newly introduced premises.)
1870 * Renamed some inner syntax categories:
1876 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1877 "num_position" etc. are mainly used instead (which also include
1878 position information via constraints).
1880 * Simplified configuration options for syntax ambiguity: see
1881 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1882 manual. Minor INCOMPATIBILITY.
1884 * Discontinued configuration option "syntax_positions": atomic terms
1885 in parse trees are always annotated by position constraints.
1887 * Old code generator for SML and its commands 'code_module',
1888 'code_library', 'consts_code', 'types_code' have been discontinued.
1889 Use commands of the generic code generator instead. INCOMPATIBILITY.
1891 * Redundant attribute "code_inline" has been discontinued. Use
1892 "code_unfold" instead. INCOMPATIBILITY.
1894 * Dropped attribute "code_unfold_post" in favor of the its dual
1895 "code_abbrev", which yields a common pattern in definitions like
1897 definition [code_abbrev]: "f = t"
1901 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1902 instead. INCOMPATIBILITY.
1904 * Discontinued old "prems" fact, which used to refer to the accidental
1905 collection of foundational premises in the context (already marked as
1906 legacy since Isabelle2011).
1911 * Type 'a set is now a proper type constructor (just as before
1912 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1913 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1914 sets separate, it is often sufficient to rephrase some set S that has
1915 been accidentally used as predicates by "%x. x : S", and some
1916 predicate P that has been accidentally used as set by "{x. P x}".
1917 Corresponding proofs in a first step should be pruned from any
1918 tinkering with former theorems mem_def and Collect_def as far as
1921 For developments which deliberately mix predicates and sets, a
1922 planning step is necessary to determine what should become a predicate
1923 and what a set. It can be helpful to carry out that step in
1924 Isabelle2011-1 before jumping right into the current release.
1926 * Code generation by default implements sets as container type rather
1927 than predicates. INCOMPATIBILITY.
1929 * New type synonym 'a rel = ('a * 'a) set
1931 * The representation of numerals has changed. Datatype "num"
1932 represents strictly positive binary numerals, along with functions
1933 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1934 positive and negated numeric literals, respectively. See also
1935 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1936 user theories may require adaptations as follows:
1938 - Theorems with number_ring or number_semiring constraints: These
1939 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1941 - Theories defining numeric types: Remove number, number_semiring,
1942 and number_ring instances. Defer all theorems about numerals until
1943 after classes one and semigroup_add have been instantiated.
1945 - Numeral-only simp rules: Replace each rule having a "number_of v"
1946 pattern with two copies, one for numeral and one for neg_numeral.
1948 - Theorems about subclasses of semiring_1 or ring_1: These classes
1949 automatically support numerals now, so more simp rules and
1950 simprocs may now apply within the proof.
1952 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1953 Redefine using other integer operations.
1955 * Transfer: New package intended to generalize the existing
1956 "descending" method and related theorem attributes from the Quotient
1957 package. (Not all functionality is implemented yet, but future
1958 development will focus on Transfer as an eventual replacement for the
1959 corresponding parts of the Quotient package.)
1961 - transfer_rule attribute: Maintains a collection of transfer rules,
1962 which relate constants at two different types. Transfer rules may
1963 relate different type instances of the same polymorphic constant,
1964 or they may relate an operation on a raw type to a corresponding
1965 operation on an abstract type (quotient or subtype). For example:
1967 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1968 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1970 - transfer method: Replaces a subgoal on abstract types with an
1971 equivalent subgoal on the corresponding raw types. Constants are
1972 replaced with corresponding ones according to the transfer rules.
1973 Goals are generalized over all free variables by default; this is
1974 necessary for variables whose types change, but can be overridden
1975 for specific variables with e.g. "transfer fixing: x y z". The
1976 variant transfer' method allows replacing a subgoal with one that
1977 is logically stronger (rather than equivalent).
1979 - relator_eq attribute: Collects identity laws for relators of
1980 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1981 transfer method uses these lemmas to infer transfer rules for
1982 non-polymorphic constants on the fly.
1984 - transfer_prover method: Assists with proving a transfer rule for a
1985 new constant, provided the constant is defined in terms of other
1986 constants that already have transfer rules. It should be applied
1987 after unfolding the constant definitions.
1989 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1990 from type nat to type int.
1992 * Lifting: New package intended to generalize the quotient_definition
1993 facility of the Quotient package; designed to work with Transfer.
1995 - lift_definition command: Defines operations on an abstract type in
1996 terms of a corresponding operation on a representation
1997 type. Example syntax:
1999 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2002 Users must discharge a respectfulness proof obligation when each
2003 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2004 the proof is discharged automatically.) The obligation is
2005 presented in a user-friendly, readable form; a respectfulness
2006 theorem in the standard format and a transfer rule are generated
2009 - Integration with code_abstype: For typedefs (e.g. subtypes
2010 corresponding to a datatype invariant, such as dlist),
2011 lift_definition generates a code certificate theorem and sets up
2012 code generation for each constant.
2014 - setup_lifting command: Sets up the Lifting package to work with a
2015 user-defined type. The user must provide either a quotient theorem
2016 or a type_definition theorem. The package configures transfer
2017 rules for equality and quantifiers on the type, and sets up the
2018 lift_definition command to work with the type.
2020 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2021 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2022 Word/Word.thy and Library/Float.thy.
2026 - The 'quotient_type' command now supports a 'morphisms' option with
2027 rep and abs functions, similar to typedef.
2029 - 'quotient_type' sets up new types to work with the Lifting and
2030 Transfer packages, as with 'setup_lifting'.
2032 - The 'quotient_definition' command now requires the user to prove a
2033 respectfulness property at the point where the constant is
2034 defined, similar to lift_definition; INCOMPATIBILITY.
2036 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2037 accordingly, INCOMPATIBILITY.
2039 * New diagnostic command 'find_unused_assms' to find potentially
2040 superfluous assumptions in theorems using Quickcheck.
2044 - Quickcheck returns variable assignments as counterexamples, which
2045 allows to reveal the underspecification of functions under test.
2046 For example, refuting "hd xs = x", it presents the variable
2047 assignment xs = [] and x = a1 as a counterexample, assuming that
2048 any property is false whenever "hd []" occurs in it.
2050 These counterexample are marked as potentially spurious, as
2051 Quickcheck also returns "xs = []" as a counterexample to the
2052 obvious theorem "hd xs = hd xs".
2054 After finding a potentially spurious counterexample, Quickcheck
2055 continues searching for genuine ones.
2057 By default, Quickcheck shows potentially spurious and genuine
2058 counterexamples. The option "genuine_only" sets quickcheck to only
2059 show genuine counterexamples.
2061 - The command 'quickcheck_generator' creates random and exhaustive
2062 value generators for a given type and operations.
2064 It generates values by using the operations as if they were
2065 constructors of that type.
2067 - Support for multisets.
2069 - Added "use_subtype" options.
2071 - Added "quickcheck_locale" configuration to specify how to process
2072 conjectures in a locale context.
2074 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2075 and affecting 'rat' and 'real'.
2078 - Integrated more tightly with SPASS, as described in the ITP 2012
2079 paper "More SPASS with Isabelle".
2080 - Made it try "smt" as a fallback if "metis" fails or times out.
2081 - Added support for the following provers: Alt-Ergo (via Why3 and
2082 TFF1), iProver, iProver-Eq.
2083 - Sped up the minimizer.
2084 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2085 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2086 - Renamed "sound" option to "strict".
2088 * Metis: Added possibility to specify lambda translations scheme as a
2089 parenthesized argument (e.g., "by (metis (lifting) ...)").
2091 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2093 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2095 * New "case_product" attribute to generate a case rule doing multiple
2096 case distinctions at the same time. E.g.
2098 list.exhaust [case_product nat.exhaust]
2100 produces a rule which can be used to perform case distinction on both
2103 * New "eventually_elim" method as a generalized variant of the
2104 eventually_elim* rules. Supports structured proofs.
2106 * Typedef with implicit set definition is considered legacy. Use
2107 "typedef (open)" form instead, which will eventually become the
2110 * Record: code generation can be switched off manually with
2112 declare [[record_coden = false]] -- "default true"
2114 * Datatype: type parameters allow explicit sort constraints.
2116 * Concrete syntax for case expressions includes constraints for source
2117 positions, and thus produces Prover IDE markup for its bindings.
2118 INCOMPATIBILITY for old-style syntax translations that augment the
2119 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2122 * Clarified attribute "mono_set": pure declaration without modifying
2123 the result of the fact expression.
2125 * More default pred/set conversions on a couple of relation operations
2126 and predicates. Added powers of predicate relations. Consolidation
2127 of some relation theorems:
2129 converse_def ~> converse_unfold
2130 rel_comp_def ~> relcomp_unfold
2131 symp_def ~> (modified, use symp_def and sym_def instead)
2132 transp_def ~> transp_trans
2133 Domain_def ~> Domain_unfold
2134 Range_def ~> Domain_converse [symmetric]
2136 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2138 See theory "Relation" for examples for making use of pred/set
2139 conversions by means of attributes "to_set" and "to_pred".
2143 * Renamed facts about the power operation on relations, i.e., relpow
2144 to match the constant's name:
2146 rel_pow_1 ~> relpow_1
2147 rel_pow_0_I ~> relpow_0_I
2148 rel_pow_Suc_I ~> relpow_Suc_I
2149 rel_pow_Suc_I2 ~> relpow_Suc_I2
2150 rel_pow_0_E ~> relpow_0_E
2151 rel_pow_Suc_E ~> relpow_Suc_E
2152 rel_pow_E ~> relpow_E
2153 rel_pow_Suc_D2 ~> relpow_Suc_D2
2154 rel_pow_Suc_E2 ~> relpow_Suc_E2
2155 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2156 rel_pow_E2 ~> relpow_E2
2157 rel_pow_add ~> relpow_add
2158 rel_pow_commute ~> relpow
2159 rel_pow_empty ~> relpow_empty:
2160 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2161 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2162 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2163 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2164 rel_pow_fun_conv ~> relpow_fun_conv
2165 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2166 rel_pow_finite_bounded ~> relpow_finite_bounded
2167 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2168 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2169 single_valued_rel_pow ~> single_valued_relpow
2173 * Theory Relation: Consolidated constant name for relation composition
2174 and corresponding theorem names:
2176 - Renamed constant rel_comp to relcomp.
2178 - Dropped abbreviation pred_comp. Use relcompp instead.
2182 rel_compI ~> relcompI
2183 rel_compEpair ~> relcompEpair
2184 rel_compE ~> relcompE
2185 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2186 rel_comp_empty1 ~> relcomp_empty1
2187 rel_comp_mono ~> relcomp_mono
2188 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2189 rel_comp_distrib ~> relcomp_distrib
2190 rel_comp_distrib2 ~> relcomp_distrib2
2191 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2192 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2193 single_valued_rel_comp ~> single_valued_relcomp
2194 rel_comp_def ~> relcomp_unfold
2195 converse_rel_comp ~> converse_relcomp
2196 pred_compI ~> relcomppI
2197 pred_compE ~> relcomppE
2198 pred_comp_bot1 ~> relcompp_bot1
2199 pred_comp_bot2 ~> relcompp_bot2
2200 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2201 pred_comp_mono ~> relcompp_mono
2202 pred_comp_distrib ~> relcompp_distrib
2203 pred_comp_distrib2 ~> relcompp_distrib2
2204 converse_pred_comp ~> converse_relcompp
2206 finite_rel_comp ~> finite_relcomp
2208 set_rel_comp ~> set_relcomp
2212 * Theory Divides: Discontinued redundant theorems about div and mod.
2213 INCOMPATIBILITY, use the corresponding generic theorems instead.
2215 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2216 zdiv_self ~> div_self
2217 zmod_self ~> mod_self
2220 zdiv_zmod_equality ~> div_mod_equality2
2221 zdiv_zmod_equality2 ~> div_mod_equality
2222 zmod_zdiv_trivial ~> mod_div_trivial
2223 zdiv_zminus_zminus ~> div_minus_minus
2224 zmod_zminus_zminus ~> mod_minus_minus
2225 zdiv_zminus2 ~> div_minus_right
2226 zmod_zminus2 ~> mod_minus_right
2227 zdiv_minus1_right ~> div_minus1_right
2228 zmod_minus1_right ~> mod_minus1_right
2229 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2230 zmod_zmult1_eq ~> mod_mult_right_eq
2231 zpower_zmod ~> power_mod
2232 zdvd_zmod ~> dvd_mod
2233 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2234 mod_mult_distrib ~> mult_mod_left
2235 mod_mult_distrib2 ~> mult_mod_right
2237 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2238 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2240 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2242 * Consolidated theorem names concerning fold combinators:
2244 inf_INFI_fold_inf ~> inf_INF_fold_inf
2245 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2246 INFI_fold_inf ~> INF_fold_inf
2247 SUPR_fold_sup ~> SUP_fold_sup
2248 union_set ~> union_set_fold
2249 minus_set ~> minus_set_fold
2250 INFI_set_fold ~> INF_set_fold
2251 SUPR_set_fold ~> SUP_set_fold
2252 INF_code ~> INF_set_foldr
2253 SUP_code ~> SUP_set_foldr
2254 foldr.simps ~> foldr.simps (in point-free formulation)
2255 foldr_fold_rev ~> foldr_conv_fold
2256 foldl_fold ~> foldl_conv_fold
2257 foldr_foldr ~> foldr_conv_foldl
2258 foldl_foldr ~> foldl_conv_foldr
2259 fold_set_remdups ~> fold_set_fold_remdups
2260 fold_set ~> fold_set_fold
2261 fold1_set ~> fold1_set_fold
2265 * Dropped rarely useful theorems concerning fold combinators:
2266 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2267 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2268 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2269 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2270 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2271 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2272 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2273 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2274 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2275 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2277 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2278 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2279 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2280 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2281 lemmas over fold rather than foldr, or make use of lemmas
2282 fold_conv_foldr and fold_rev.
2284 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2285 through option types.
2287 * "Transitive_Closure.ntrancl": bounded transitive closure on
2290 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2292 * Theory Int: Discontinued many legacy theorems specific to type int.
2293 INCOMPATIBILITY, use the corresponding generic theorems instead.
2295 zminus_zminus ~> minus_minus
2296 zminus_0 ~> minus_zero
2297 zminus_zadd_distrib ~> minus_add_distrib
2298 zadd_commute ~> add_commute
2299 zadd_assoc ~> add_assoc
2300 zadd_left_commute ~> add_left_commute
2303 zadd_0 ~> add_0_left
2304 zadd_0_right ~> add_0_right
2305 zadd_zminus_inverse2 ~> left_minus
2306 zmult_zminus ~> mult_minus_left
2307 zmult_commute ~> mult_commute
2308 zmult_assoc ~> mult_assoc
2309 zadd_zmult_distrib ~> left_distrib
2310 zadd_zmult_distrib2 ~> right_distrib
2311 zdiff_zmult_distrib ~> left_diff_distrib
2312 zdiff_zmult_distrib2 ~> right_diff_distrib
2313 zmult_1 ~> mult_1_left
2314 zmult_1_right ~> mult_1_right
2315 zle_refl ~> order_refl
2316 zle_trans ~> order_trans
2317 zle_antisym ~> order_antisym
2318 zle_linear ~> linorder_linear
2319 zless_linear ~> linorder_less_linear
2320 zadd_left_mono ~> add_left_mono
2321 zadd_strict_right_mono ~> add_strict_right_mono
2322 zadd_zless_mono ~> add_less_le_mono
2323 int_0_less_1 ~> zero_less_one
2324 int_0_neq_1 ~> zero_neq_one
2326 zpower_zadd_distrib ~> power_add
2327 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2328 zero_le_zpower_abs ~> zero_le_power_abs
2330 * Theory Deriv: Renamed
2332 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2334 * Theory Library/Multiset: Improved code generation of multisets.
2336 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2337 are expressed via type classes again. The special syntax
2338 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2339 setsum_set, which is now subsumed by Big_Operators.setsum.
2342 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2343 use theory HOL/Library/Nat_Bijection instead.
2345 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2346 trees is now inside a type class context. Names of affected
2347 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2348 theories working directly with raw red-black trees, adapt the names as
2352 bulkload -> rbt_bulkload
2353 del_from_left -> rbt_del_from_left
2354 del_from_right -> rbt_del_from_right
2356 delete -> rbt_delete
2358 insert -> rbt_insert
2359 insertw -> rbt_insert_with
2360 insert_with_key -> rbt_insert_with_key
2361 map_entry -> rbt_map_entry
2362 lookup -> rbt_lookup
2363 sorted -> rbt_sorted
2364 tree_greater -> rbt_greater
2365 tree_less -> rbt_less
2366 tree_less_symbol -> rbt_less_symbol
2368 union_with -> rbt_union_with
2369 union_with_key -> rbt_union_with_key
2372 balance_left_sorted -> balance_left_rbt_sorted
2373 balance_left_tree_greater -> balance_left_rbt_greater
2374 balance_left_tree_less -> balance_left_rbt_less
2375 balance_right_sorted -> balance_right_rbt_sorted
2376 balance_right_tree_greater -> balance_right_rbt_greater
2377 balance_right_tree_less -> balance_right_rbt_less
2378 balance_sorted -> balance_rbt_sorted
2379 balance_tree_greater -> balance_rbt_greater
2380 balance_tree_less -> balance_rbt_less
2381 bulkload_is_rbt -> rbt_bulkload_is_rbt
2382 combine_sorted -> combine_rbt_sorted
2383 combine_tree_greater -> combine_rbt_greater
2384 combine_tree_less -> combine_rbt_less
2385 delete_in_tree -> rbt_delete_in_tree
2386 delete_is_rbt -> rbt_delete_is_rbt
2387 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2388 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2389 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2390 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2391 del_in_tree -> rbt_del_in_tree
2392 del_inv1_inv2 -> rbt_del_inv1_inv2
2393 del_sorted -> rbt_del_rbt_sorted
2394 del_tree_greater -> rbt_del_rbt_greater
2395 del_tree_less -> rbt_del_rbt_less
2396 dom_lookup_Branch -> dom_rbt_lookup_Branch
2397 entries_lookup -> entries_rbt_lookup
2398 finite_dom_lookup -> finite_dom_rbt_lookup
2399 insert_sorted -> rbt_insert_rbt_sorted
2400 insertw_is_rbt -> rbt_insertw_is_rbt
2401 insertwk_is_rbt -> rbt_insertwk_is_rbt
2402 insertwk_sorted -> rbt_insertwk_rbt_sorted
2403 insertw_sorted -> rbt_insertw_rbt_sorted
2404 ins_sorted -> ins_rbt_sorted
2405 ins_tree_greater -> ins_rbt_greater
2406 ins_tree_less -> ins_rbt_less
2407 is_rbt_sorted -> is_rbt_rbt_sorted
2408 lookup_balance -> rbt_lookup_balance
2409 lookup_bulkload -> rbt_lookup_rbt_bulkload
2410 lookup_delete -> rbt_lookup_rbt_delete
2411 lookup_Empty -> rbt_lookup_Empty
2412 lookup_from_in_tree -> rbt_lookup_from_in_tree
2413 lookup_in_tree -> rbt_lookup_in_tree
2414 lookup_ins -> rbt_lookup_ins
2415 lookup_insert -> rbt_lookup_rbt_insert
2416 lookup_insertw -> rbt_lookup_rbt_insertw
2417 lookup_insertwk -> rbt_lookup_rbt_insertwk
2418 lookup_keys -> rbt_lookup_keys
2419 lookup_map -> rbt_lookup_map
2420 lookup_map_entry -> rbt_lookup_rbt_map_entry
2421 lookup_tree_greater -> rbt_lookup_rbt_greater
2422 lookup_tree_less -> rbt_lookup_rbt_less
2423 lookup_union -> rbt_lookup_rbt_union
2424 map_entry_color_of -> rbt_map_entry_color_of
2425 map_entry_inv1 -> rbt_map_entry_inv1
2426 map_entry_inv2 -> rbt_map_entry_inv2
2427 map_entry_is_rbt -> rbt_map_entry_is_rbt
2428 map_entry_sorted -> rbt_map_entry_rbt_sorted
2429 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2430 map_entry_tree_less -> rbt_map_entry_rbt_less
2431 map_tree_greater -> map_rbt_greater
2432 map_tree_less -> map_rbt_less
2433 map_sorted -> map_rbt_sorted
2434 paint_sorted -> paint_rbt_sorted
2435 paint_lookup -> paint_rbt_lookup
2436 paint_tree_greater -> paint_rbt_greater
2437 paint_tree_less -> paint_rbt_less
2438 sorted_entries -> rbt_sorted_entries
2439 tree_greater_eq_trans -> rbt_greater_eq_trans
2440 tree_greater_nit -> rbt_greater_nit
2441 tree_greater_prop -> rbt_greater_prop
2442 tree_greater_simps -> rbt_greater_simps
2443 tree_greater_trans -> rbt_greater_trans
2444 tree_less_eq_trans -> rbt_less_eq_trans
2445 tree_less_nit -> rbt_less_nit
2446 tree_less_prop -> rbt_less_prop
2447 tree_less_simps -> rbt_less_simps
2448 tree_less_trans -> rbt_less_trans
2449 tree_ord_props -> rbt_ord_props
2450 union_Branch -> rbt_union_Branch
2451 union_is_rbt -> rbt_union_is_rbt
2452 unionw_is_rbt -> rbt_unionw_is_rbt
2453 unionwk_is_rbt -> rbt_unionwk_is_rbt
2454 unionwk_sorted -> rbt_unionwk_rbt_sorted
2456 * Theory HOL/Library/Float: Floating point numbers are now defined as
2457 a subset of the real numbers. All operations are defined using the
2458 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2465 round_down -> float_round_down
2466 round_up -> float_round_up
2470 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2473 abs_float_def -> Float.compute_float_abs
2474 bitlen_ge0 -> bitlen_nonneg
2475 bitlen.simps -> Float.compute_bitlen
2476 float_components -> Float_mantissa_exponent
2477 float_divl.simps -> Float.compute_float_divl
2478 float_divr.simps -> Float.compute_float_divr
2479 float_eq_odd -> mult_powr_eq_mult_powr_iff
2480 float_power -> real_of_float_power
2481 lapprox_posrat_def -> Float.compute_lapprox_posrat
2482 lapprox_rat.simps -> Float.compute_lapprox_rat
2483 le_float_def' -> Float.compute_float_le
2484 le_float_def -> less_eq_float.rep_eq
2485 less_float_def' -> Float.compute_float_less
2486 less_float_def -> less_float.rep_eq
2487 normfloat_def -> Float.compute_normfloat
2488 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2489 normfloat -> normfloat_def
2490 normfloat_unique -> use normfloat_def
2491 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2492 one_float_def -> Float.compute_float_one
2493 plus_float_def -> Float.compute_float_plus
2494 rapprox_posrat_def -> Float.compute_rapprox_posrat
2495 rapprox_rat.simps -> Float.compute_rapprox_rat
2496 real_of_float_0 -> zero_float.rep_eq
2497 real_of_float_1 -> one_float.rep_eq
2498 real_of_float_abs -> abs_float.rep_eq
2499 real_of_float_add -> plus_float.rep_eq
2500 real_of_float_minus -> uminus_float.rep_eq
2501 real_of_float_mult -> times_float.rep_eq
2502 real_of_float_simp -> Float.rep_eq
2503 real_of_float_sub -> minus_float.rep_eq
2504 round_down.simps -> Float.compute_float_round_down
2505 round_up.simps -> Float.compute_float_round_up
2506 times_float_def -> Float.compute_float_times
2507 uminus_float_def -> Float.compute_float_uminus
2508 zero_float_def -> Float.compute_float_zero
2510 Lemmas not necessary anymore, use the transfer method:
2511 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2512 float_divr, float_le_simp, float_less1_mantissa_bound,
2513 float_less_simp, float_less_zero, float_le_zero,
2514 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2515 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2516 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2517 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2518 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2519 round_up, zero_le_float, zero_less_float
2521 * New theory HOL/Library/DAList provides an abstract type for
2522 association lists with distinct keys.
2524 * Session HOL/IMP: Added new theory of abstract interpretation of
2527 * Session HOL-Import: Re-implementation from scratch is faster,
2528 simpler, and more scalable. Requires a proof bundle, which is
2529 available as an external component. Discontinued old (and mostly
2530 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2532 * Session HOL-Word: Discontinued many redundant theorems specific to
2533 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2536 word_sub_alt ~> word_sub_wi
2537 word_add_alt ~> word_add_def
2538 word_mult_alt ~> word_mult_def
2539 word_minus_alt ~> word_minus_def
2540 word_0_alt ~> word_0_wi
2541 word_1_alt ~> word_1_wi
2542 word_add_0 ~> add_0_left
2543 word_add_0_right ~> add_0_right
2544 word_mult_1 ~> mult_1_left
2545 word_mult_1_right ~> mult_1_right
2546 word_add_commute ~> add_commute
2547 word_add_assoc ~> add_assoc
2548 word_add_left_commute ~> add_left_commute
2549 word_mult_commute ~> mult_commute
2550 word_mult_assoc ~> mult_assoc
2551 word_mult_left_commute ~> mult_left_commute
2552 word_left_distrib ~> left_distrib
2553 word_right_distrib ~> right_distrib
2554 word_left_minus ~> left_minus
2555 word_diff_0_right ~> diff_0_right
2556 word_diff_self ~> diff_self
2557 word_sub_def ~> diff_minus
2558 word_diff_minus ~> diff_minus
2559 word_add_ac ~> add_ac
2560 word_mult_ac ~> mult_ac
2561 word_plus_ac0 ~> add_0_left add_0_right add_ac
2562 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2563 word_order_trans ~> order_trans
2564 word_order_refl ~> order_refl
2565 word_order_antisym ~> order_antisym
2566 word_order_linear ~> linorder_linear
2567 lenw1_zero_neq_one ~> zero_neq_one
2568 word_number_of_eq ~> number_of_eq
2569 word_of_int_add_hom ~> wi_hom_add
2570 word_of_int_sub_hom ~> wi_hom_sub
2571 word_of_int_mult_hom ~> wi_hom_mult
2572 word_of_int_minus_hom ~> wi_hom_neg
2573 word_of_int_succ_hom ~> wi_hom_succ
2574 word_of_int_pred_hom ~> wi_hom_pred
2575 word_of_int_0_hom ~> word_0_wi
2576 word_of_int_1_hom ~> word_1_wi
2578 * Session HOL-Word: New proof method "word_bitwise" for splitting
2579 machine word equalities and inequalities into logical circuits,
2580 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2581 multiplication, shifting by constants, bitwise operators and numeric
2582 constants. Requires fixed-length word types, not 'a word. Solves
2583 many standard word identities outright and converts more into first
2584 order problems amenable to blast or similar. See also examples in
2585 HOL/Word/Examples/WordExamples.thy.
2587 * Session HOL-Probability: Introduced the type "'a measure" to
2588 represent measures, this replaces the records 'a algebra and 'a
2589 measure_space. The locales based on subset_class now have two
2590 locale-parameters the space \<Omega> and the set of measurable sets M.
2591 The product of probability spaces uses now the same constant as the
2592 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2593 measure". Most constants are defined now outside of locales and gain
2594 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2595 Measure space constructions for distributions and densities now got
2596 their own constants distr and density. Instead of using locales to
2597 describe measure spaces with a finite space, the measure count_space
2598 and point_measure is introduced. INCOMPATIBILITY.
2602 finite_measure.\<mu>' -> measure
2603 product_algebra_generator -> prod_algebra
2604 product_prob_space.emb -> prod_emb
2605 product_prob_space.infprod_algebra -> PiM
2608 completeable_measure_space
2609 finite_measure_space
2611 finite_product_finite_prob_space
2612 finite_product_sigma_algebra
2613 finite_sigma_algebra
2615 pair_finite_prob_space
2616 pair_finite_sigma_algebra
2619 product_sigma_algebra
2623 distribution -> use distr measure, or distributed predicate
2625 joint_distribution -> use distr measure, or distributed predicate
2626 pair_measure_generator
2627 product_prob_space.infprod_algebra -> use PiM
2630 Replacement theorems:
2631 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2632 finite_measure.empty_measure -> measure_empty
2633 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2634 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2635 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2636 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2637 finite_measure.finite_measure -> finite_measure.emeasure_finite
2638 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2639 finite_measure.positive_measure' -> measure_nonneg
2640 finite_measure.real_measure -> finite_measure.emeasure_real
2641 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2642 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2643 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2644 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2645 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2646 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2647 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2648 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2649 information_space.entropy_commute -> information_space.entropy_commute_simple
2650 information_space.entropy_eq -> information_space.entropy_simple_distributed
2651 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2652 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2653 information_space.entropy_uniform_max -> information_space.entropy_uniform
2654 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2655 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2656 information_space.KL_ge_0 -> information_space.KL_nonneg
2657 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2658 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2659 Int_stable_cuboids -> Int_stable_atLeastAtMost
2660 Int_stable_product_algebra_generator -> positive_integral
2661 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2662 measure_space.additive -> emeasure_additive
2663 measure_space.AE_iff_null_set -> AE_iff_null
2664 measure_space.almost_everywhere_def -> eventually_ae_filter
2665 measure_space.almost_everywhere_vimage -> AE_distrD
2666 measure_space.continuity_from_above -> INF_emeasure_decseq
2667 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2668 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2669 measure_space.continuity_from_below -> SUP_emeasure_incseq
2670 measure_space_density -> emeasure_density
2671 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2672 measure_space.integrable_vimage -> integrable_distr
2673 measure_space.integral_translated_density -> integral_density
2674 measure_space.integral_vimage -> integral_distr
2675 measure_space.measure_additive -> plus_emeasure
2676 measure_space.measure_compl -> emeasure_compl
2677 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2678 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2679 measure_space.measure_decseq -> decseq_emeasure
2680 measure_space.measure_Diff -> emeasure_Diff
2681 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2682 measure_space.measure_eq_0 -> emeasure_eq_0
2683 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2684 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2685 measure_space.measure_incseq -> incseq_emeasure
2686 measure_space.measure_insert -> emeasure_insert
2687 measure_space.measure_mono -> emeasure_mono
2688 measure_space.measure_not_negative -> emeasure_not_MInf
2689 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2690 measure_space.measure_setsum -> setsum_emeasure
2691 measure_space.measure_setsum_split -> setsum_emeasure_cover
2692 measure_space.measure_space_vimage -> emeasure_distr
2693 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2694 measure_space.measure_subadditive -> subadditive
2695 measure_space.measure_top -> emeasure_space
2696 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2697 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2698 measure_space.positive_integral_translated_density -> positive_integral_density
2699 measure_space.positive_integral_vimage -> positive_integral_distr
2700 measure_space.real_continuity_from_above -> Lim_measure_decseq
2701 measure_space.real_continuity_from_below -> Lim_measure_incseq
2702 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2703 measure_space.real_measure_Diff -> measure_Diff
2704 measure_space.real_measure_finite_Union -> measure_finite_Union
2705 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2706 measure_space.real_measure_subadditive -> measure_subadditive
2707 measure_space.real_measure_Union -> measure_Union
2708 measure_space.real_measure_UNION -> measure_UNION
2709 measure_space.simple_function_vimage -> simple_function_comp
2710 measure_space.simple_integral_vimage -> simple_integral_distr
2711 measure_space.simple_integral_vimage -> simple_integral_distr
2712 measure_unique_Int_stable -> measure_eqI_generator_eq
2713 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2714 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2715 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2716 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2717 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2718 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2719 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2720 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2721 pair_sigma_algebra.sets_swap -> sets_pair_swap
2722 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2723 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2724 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2725 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2726 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2727 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2728 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2729 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2730 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2731 prob_space.prob_space_vimage -> prob_space_distr
2732 prob_space.random_variable_restrict -> measurable_restrict
2733 prob_space_unique_Int_stable -> measure_eqI_prob_space
2734 product_algebraE -> prod_algebraE_all
2735 product_algebra_generator_der -> prod_algebra_eq_finite
2736 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2737 product_algebraI -> sets_PiM_I_finite
2738 product_measure_exists -> product_sigma_finite.sigma_finite
2739 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2740 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2741 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2742 product_prob_space.measurable_component -> measurable_component_singleton
2743 product_prob_space.measurable_emb -> measurable_prod_emb
2744 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2745 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2746 product_prob_space.measure_emb -> emeasure_prod_emb
2747 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2748 product_sigma_algebra.product_algebra_into_space -> space_closed
2749 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2750 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2751 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2752 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2753 sets_product_algebra -> sets_PiM
2754 sigma_algebra.measurable_sigma -> measurable_measure_of
2755 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2756 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2757 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2758 space_product_algebra -> space_PiM
2760 * Session HOL-TPTP: support to parse and import TPTP problems (all
2761 languages) into Isabelle/HOL.
2766 * New "case_product" attribute (see HOL).
2771 * Greater support for structured proofs involving induction or case
2774 * Much greater use of mathematical symbols.
2776 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2781 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2782 from a minor keyword introduced via theory header declaration.
2784 * Antiquotation @{command_spec "name"} produces the
2785 Outer_Syntax.command_spec from a major keyword introduced via theory
2786 header declaration; it can be passed to Outer_Syntax.command etc.
2788 * Local_Theory.define no longer hard-wires default theorem name
2789 "foo_def", but retains the binding as given. If that is Binding.empty
2790 / Attrib.empty_binding, the result is not registered as user-level
2791 fact. The Local_Theory.define_internal variant allows to specify a
2792 non-empty name (used for the foundation in the background theory),
2793 while omitting the fact binding in the user-context. Potential
2794 INCOMPATIBILITY for derived definitional packages: need to specify
2795 naming policy for primitive definitions more explicitly.
2797 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2798 conformance with similar operations in structure Term and Logic.
2800 * Antiquotation @{attributes [...]} embeds attribute source
2801 representation into the ML text, which is particularly useful with
2802 declarations like Local_Theory.note.
2804 * Structure Proof_Context follows standard naming scheme. Old
2805 ProofContext has been discontinued. INCOMPATIBILITY.
2807 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2808 change of semantics: update is applied to auxiliary local theory
2811 * Modernized some old-style infix operations:
2813 addeqcongs ~> Simplifier.add_eqcong
2814 deleqcongs ~> Simplifier.del_eqcong
2815 addcongs ~> Simplifier.add_cong
2816 delcongs ~> Simplifier.del_cong
2817 setmksimps ~> Simplifier.set_mksimps
2818 setmkcong ~> Simplifier.set_mkcong
2819 setmksym ~> Simplifier.set_mksym
2820 setmkeqTrue ~> Simplifier.set_mkeqTrue
2821 settermless ~> Simplifier.set_termless
2822 setsubgoaler ~> Simplifier.set_subgoaler
2823 addsplits ~> Splitter.add_split
2824 delsplits ~> Splitter.del_split
2829 * USER_HOME settings variable points to cross-platform user home
2830 directory, which coincides with HOME on POSIX systems only. Likewise,
2831 the Isabelle path specification "~" now expands to $USER_HOME, instead
2832 of former $HOME. A different default for USER_HOME may be set
2833 explicitly in shell environment, before Isabelle settings are
2834 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2835 the generic user home was intended.
2837 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2838 notation, which is useful for the jEdit file browser, for example.
2840 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2845 New in Isabelle2011-1 (October 2011)
2846 ------------------------------------
2850 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2851 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2853 - Management of multiple theory files directly from the editor
2854 buffer store -- bypassing the file-system (no requirement to save
2855 files for checking).
2857 - Markup of formal entities within the text buffer, with semantic
2858 highlighting, tooltips and hyperlinks to jump to defining source
2861 - Improved text rendering, with sub/superscripts in the source
2862 buffer (including support for copy/paste wrt. output panel, HTML
2863 theory output and other non-Isabelle text boxes).
2865 - Refined scheduling of proof checking and printing of results,
2866 based on interactive editor view. (Note: jEdit folding and
2867 narrowing allows to restrict buffer perspectives explicitly.)
2869 - Reduced CPU performance requirements, usable on machines with few
2872 - Reduced memory requirements due to pruning of unused document
2873 versions (garbage collection).
2875 See also ~~/src/Tools/jEdit/README.html for further information,
2876 including some remaining limitations.
2878 * Theory loader: source files are exclusively located via the master
2879 directory of each theory node (where the .thy file itself resides).
2880 The global load path (such as src/HOL/Library) has been discontinued.
2881 Note that the path element ~~ may be used to reference theories in the
2882 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2885 * Theory loader: source files are identified by content via SHA1
2886 digests. Discontinued former path/modtime identification and optional
2887 ISABELLE_FILE_IDENT plugin scripts.
2889 * Parallelization of nested Isar proofs is subject to
2890 Goal.parallel_proofs_threshold (default 100). See also isabelle
2893 * Name space: former unsynchronized references are now proper
2894 configuration options, with more conventional names:
2896 long_names ~> names_long
2897 short_names ~> names_short
2898 unique_names ~> names_unique
2900 Minor INCOMPATIBILITY, need to declare options in context like this:
2902 declare [[names_unique = false]]
2904 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2905 that the result needs to be unique, which means fact specifications
2906 may have to be refined after enriching a proof context.
2908 * Attribute "case_names" has been refined: the assumptions in each case
2909 can be named now by following the case name with [name1 name2 ...].
2911 * Isabelle/Isar reference manual has been updated and extended:
2912 - "Synopsis" provides a catalog of main Isar language concepts.
2913 - Formal references in syntax diagrams, via @{rail} antiquotation.
2914 - Updated material from classic "ref" manual, notably about
2915 "Classical Reasoner".
2920 * Class bot and top require underlying partial order rather than
2921 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2923 * Class complete_lattice: generalized a couple of lemmas from sets;
2924 generalized theorems INF_cong and SUP_cong. New type classes for
2925 complete boolean algebras and complete linear orders. Lemmas
2926 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2927 class complete_linorder.
2929 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2930 Sup_fun_def, Inf_apply, Sup_apply.
2932 Removed redundant lemmas (the right hand side gives hints how to
2933 replace them for (metis ...), or (simp only: ...) proofs):
2935 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2936 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2937 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2938 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2939 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2940 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2941 Inter_def ~> INF_def, image_def
2942 Union_def ~> SUP_def, image_def
2943 INT_eq ~> INF_def, and image_def
2944 UN_eq ~> SUP_def, and image_def
2945 INF_subset ~> INF_superset_mono [OF _ order_refl]
2947 More consistent and comprehensive names:
2949 INTER_eq_Inter_image ~> INF_def
2950 UNION_eq_Union_image ~> SUP_def
2953 INF_leI ~> INF_lower
2954 INF_leI2 ~> INF_lower2
2955 le_INFI ~> INF_greatest
2956 le_SUPI ~> SUP_upper
2957 le_SUPI2 ~> SUP_upper2
2958 SUP_leI ~> SUP_least
2959 INFI_bool_eq ~> INF_bool_eq
2960 SUPR_bool_eq ~> SUP_bool_eq
2961 INFI_apply ~> INF_apply
2962 SUPR_apply ~> SUP_apply
2963 INTER_def ~> INTER_eq
2964 UNION_def ~> UNION_eq
2968 * Renamed theory Complete_Lattice to Complete_Lattices.
2971 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2972 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2973 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2974 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2976 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2977 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2978 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2981 * Added syntactic classes "inf" and "sup" for the respective
2982 constants. INCOMPATIBILITY: Changes in the argument order of the
2983 (mostly internal) locale predicates for some derived classes.
2985 * Theorem collections ball_simps and bex_simps do not contain theorems
2986 referring to UNION any longer; these have been moved to collection
2987 UN_ball_bex_simps. INCOMPATIBILITY.
2989 * Theory Archimedean_Field: floor now is defined as parameter of a
2990 separate type class floor_ceiling.
2992 * Theory Finite_Set: more coherent development of fold_set locales:
2994 locale fun_left_comm ~> locale comp_fun_commute
2995 locale fun_left_comm_idem ~> locale comp_fun_idem
2997 Both use point-free characterization; interpretation proofs may need
2998 adjustment. INCOMPATIBILITY.
3000 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3001 accordance with standard mathematical terminology. INCOMPATIBILITY.
3003 * Theory Complex_Main: The locale interpretations for the
3004 bounded_linear and bounded_bilinear locales have been removed, in
3005 order to reduce the number of duplicate lemmas. Users must use the
3006 original names for distributivity theorems, potential INCOMPATIBILITY.
3008 divide.add ~> add_divide_distrib
3009 divide.diff ~> diff_divide_distrib
3010 divide.setsum ~> setsum_divide_distrib
3011 mult.add_right ~> right_distrib
3012 mult.diff_right ~> right_diff_distrib
3013 mult_right.setsum ~> setsum_right_distrib
3014 mult_left.diff ~> left_diff_distrib
3016 * Theory Complex_Main: Several redundant theorems have been removed or
3017 replaced by more general versions. INCOMPATIBILITY.
3019 real_diff_def ~> minus_real_def
3020 real_divide_def ~> divide_real_def
3021 real_less_def ~> less_le
3022 real_abs_def ~> abs_real_def
3023 real_sgn_def ~> sgn_real_def
3024 real_mult_commute ~> mult_commute
3025 real_mult_assoc ~> mult_assoc
3026 real_mult_1 ~> mult_1_left
3027 real_add_mult_distrib ~> left_distrib
3028 real_zero_not_eq_one ~> zero_neq_one
3029 real_mult_inverse_left ~> left_inverse
3030 INVERSE_ZERO ~> inverse_zero
3031 real_le_refl ~> order_refl
3032 real_le_antisym ~> order_antisym
3033 real_le_trans ~> order_trans
3034 real_le_linear ~> linear
3035 real_le_eq_diff ~> le_iff_diff_le_0
3036 real_add_left_mono ~> add_left_mono
3037 real_mult_order ~> mult_pos_pos
3038 real_mult_less_mono2 ~> mult_strict_left_mono
3039 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3040 real_0_le_divide_iff ~> zero_le_divide_iff
3041 realpow_two_disj ~> power2_eq_iff
3042 real_squared_diff_one_factored ~> square_diff_one_factored
3043 realpow_two_diff ~> square_diff_square_factored
3044 reals_complete2 ~> complete_real
3045 real_sum_squared_expand ~> power2_sum
3046 exp_ln_eq ~> ln_unique
3048 expi_zero ~> exp_zero
3049 lemma_DERIV_subst ~> DERIV_cong
3050 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3051 LIMSEQ_const ~> tendsto_const
3052 LIMSEQ_norm ~> tendsto_norm
3053 LIMSEQ_add ~> tendsto_add
3054 LIMSEQ_minus ~> tendsto_minus
3055 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3056 LIMSEQ_diff ~> tendsto_diff
3057 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3058 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3059 LIMSEQ_mult ~> tendsto_mult
3060 LIMSEQ_inverse ~> tendsto_inverse
3061 LIMSEQ_divide ~> tendsto_divide
3062 LIMSEQ_pow ~> tendsto_power
3063 LIMSEQ_setsum ~> tendsto_setsum
3064 LIMSEQ_setprod ~> tendsto_setprod
3065 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3066 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3067 LIMSEQ_imp_rabs ~> tendsto_rabs
3068 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3069 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3070 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3071 LIMSEQ_Complex ~> tendsto_Complex
3072 LIM_ident ~> tendsto_ident_at
3073 LIM_const ~> tendsto_const
3074 LIM_add ~> tendsto_add
3075 LIM_add_zero ~> tendsto_add_zero
3076 LIM_minus ~> tendsto_minus
3077 LIM_diff ~> tendsto_diff
3078 LIM_norm ~> tendsto_norm
3079 LIM_norm_zero ~> tendsto_norm_zero
3080 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3081 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3082 LIM_rabs ~> tendsto_rabs
3083 LIM_rabs_zero ~> tendsto_rabs_zero
3084 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3085 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3086 LIM_compose ~> tendsto_compose
3087 LIM_mult ~> tendsto_mult
3088 LIM_scaleR ~> tendsto_scaleR
3089 LIM_of_real ~> tendsto_of_real
3090 LIM_power ~> tendsto_power
3091 LIM_inverse ~> tendsto_inverse
3092 LIM_sgn ~> tendsto_sgn
3093 isCont_LIM_compose ~> isCont_tendsto_compose
3094 bounded_linear.LIM ~> bounded_linear.tendsto
3095 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3096 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3097 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3098 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3099 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3100 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3102 * Theory Complex_Main: The definition of infinite series was
3103 generalized. Now it is defined on the type class {topological_space,
3104 comm_monoid_add}. Hence it is useable also for extended real numbers.
3106 * Theory Complex_Main: The complex exponential function "expi" is now
3107 a type-constrained abbreviation for "exp :: complex => complex"; thus
3108 several polymorphic lemmas about "exp" are now applicable to "expi".
3112 - Theory Library/Code_Char_ord provides native ordering of
3113 characters in the target language.
3115 - Commands code_module and code_library are legacy, use export_code
3118 - Method "evaluation" is legacy, use method "eval" instead.
3120 - Legacy evaluator "SML" is deactivated by default. May be
3121 reactivated by the following theory command:
3123 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3125 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3127 * New proof method "induction" that gives induction hypotheses the
3128 name "IH", thus distinguishing them from further hypotheses that come
3129 from rule induction. The latter are still called "hyps". Method
3130 "induction" is a thin wrapper around "induct" and follows the same
3133 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3134 still available as a legacy feature for some time.
3137 - Added "need" and "total_consts" options.
3138 - Reintroduced "show_skolems" option by popular demand.
3139 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3143 - Use quasi-sound (and efficient) translations by default.
3144 - Added support for the following provers: E-ToFoF, LEO-II,
3145 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3146 - Automatically preplay and minimize proofs before showing them if
3147 this can be done within reasonable time.
3148 - sledgehammer available_provers ~> sledgehammer supported_provers.
3150 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3151 "max_mono_iters", and "max_new_mono_instances" options.
3152 - Removed "explicit_apply" and "full_types" options as well as "Full
3153 Types" Proof General menu item. INCOMPATIBILITY.
3156 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3157 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3161 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3162 "elim:" options. INCOMPATIBILITY.
3163 - Introduced 'try' that not only runs 'try_methods' but also
3164 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3167 - Added "eval" option to evaluate terms for the found counterexample
3168 (currently only supported by the default (exhaustive) tester).
3169 - Added post-processing of terms to obtain readable counterexamples
3170 (currently only supported by the default (exhaustive) tester).
3171 - New counterexample generator quickcheck[narrowing] enables
3172 narrowing-based testing. Requires the Glasgow Haskell compiler
3173 with its installation location defined in the Isabelle settings
3174 environment as ISABELLE_GHC.
3175 - Removed quickcheck tester "SML" based on the SML code generator
3176 (formly in HOL/Library).
3178 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3179 use 'partial_function' instead.
3181 * Theory Library/Extended_Reals replaces now the positive extended
3182 reals found in probability theory. This file is extended by
3183 Multivariate_Analysis/Extended_Real_Limits.
3185 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3186 from where it must be imported explicitly if it is really required.
3189 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3190 been moved here. INCOMPATIBILITY.
3192 * Theory Library/Saturated provides type of numbers with saturated
3195 * Theory Library/Product_Lattice defines a pointwise ordering for the
3196 product type 'a * 'b, and provides instance proofs for various order
3197 and lattice type classes.
3199 * Theory Library/Countable now provides the "countable_datatype" proof
3200 method for proving "countable" class instances for datatypes.
3202 * Theory Library/Cset_Monad allows do notation for computable sets
3203 (cset) via the generic monad ad-hoc overloading facility.
3205 * Library: Theories of common data structures are split into theories
3206 for implementation, an invariant-ensuring type, and connection to an
3207 abstract type. INCOMPATIBILITY.
3209 - RBT is split into RBT and RBT_Mapping.
3210 - AssocList is split and renamed into AList and AList_Mapping.
3211 - DList is split into DList_Impl, DList, and DList_Cset.
3212 - Cset is split into Cset and List_Cset.
3214 * Theory Library/Nat_Infinity has been renamed to
3215 Library/Extended_Nat, with name changes of the following types and
3218 type inat ~> type enat
3220 Infty ~> infinity (overloaded)
3224 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3225 been renamed accordingly. INCOMPATIBILITY.
3227 * Session Multivariate_Analysis: The euclidean_space type class now
3228 fixes a constant "Basis :: 'a set" consisting of the standard
3229 orthonormal basis for the type. Users now have the option of
3230 quantifying over this set instead of using the "basis" function, e.g.
3231 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3233 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3234 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3235 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3236 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3237 changed to match. Definition theorems for overloaded constants now use
3238 the standard "foo_vec_def" naming scheme. A few other theorems have
3239 been renamed as follows (INCOMPATIBILITY):
3241 Cart_eq ~> vec_eq_iff
3242 dist_nth_le_cart ~> dist_vec_nth_le
3243 tendsto_vector ~> vec_tendstoI
3244 Cauchy_vector ~> vec_CauchyI
3246 * Session Multivariate_Analysis: Several duplicate theorems have been
3247 removed, and other theorems have been renamed or replaced with more
3248 general versions. INCOMPATIBILITY.
3250 finite_choice ~> finite_set_choice
3251 eventually_conjI ~> eventually_conj
3252 eventually_and ~> eventually_conj_iff
3253 eventually_false ~> eventually_False
3254 setsum_norm ~> norm_setsum
3255 Lim_sequentially ~> LIMSEQ_def
3256 Lim_ident_at ~> LIM_ident
3257 Lim_const ~> tendsto_const
3258 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3259 Lim_neg ~> tendsto_minus
3260 Lim_add ~> tendsto_add
3261 Lim_sub ~> tendsto_diff
3262 Lim_mul ~> tendsto_scaleR
3263 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3264 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3265 Lim_linear ~> bounded_linear.tendsto
3266 Lim_component ~> tendsto_euclidean_component
3267 Lim_component_cart ~> tendsto_vec_nth
3268 Lim_inner ~> tendsto_inner [OF tendsto_const]
3269 dot_lsum ~> inner_setsum_left
3270 dot_rsum ~> inner_setsum_right
3271 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3272 continuous_neg ~> continuous_minus
3273 continuous_sub ~> continuous_diff
3274 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3275 continuous_mul ~> continuous_scaleR
3276 continuous_inv ~> continuous_inverse
3277 continuous_at_within_inv ~> continuous_at_within_inverse
3278 continuous_at_inv ~> continuous_at_inverse
3279 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3280 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3281 continuous_at_component ~> continuous_component [OF continuous_at_id]
3282 continuous_on_neg ~> continuous_on_minus
3283 continuous_on_sub ~> continuous_on_diff
3284 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3285 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3286 continuous_on_mul ~> continuous_on_scaleR
3287 continuous_on_mul_real ~> continuous_on_mult
3288 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3289 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3290 continuous_on_inverse ~> continuous_on_inv
3291 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3292 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3293 subset_interior ~> interior_mono
3294 subset_closure ~> closure_mono
3295 closure_univ ~> closure_UNIV
3296 real_arch_lt ~> reals_Archimedean2
3297 real_arch ~> reals_Archimedean3
3298 real_abs_norm ~> abs_norm_cancel
3299 real_abs_sub_norm ~> norm_triangle_ineq3
3300 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3302 * Session HOL-Probability:
3303 - Caratheodory's extension lemma is now proved for ring_of_sets.
3304 - Infinite products of probability measures are now available.
3305 - Sigma closure is independent, if the generator is independent
3306 - Use extended reals instead of positive extended
3307 reals. INCOMPATIBILITY.
3309 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3311 expand_fun_below ~> fun_below_iff
3312 below_fun_ext ~> fun_belowI
3313 expand_cfun_eq ~> cfun_eq_iff
3314 ext_cfun ~> cfun_eqI
3315 expand_cfun_below ~> cfun_below_iff
3316 below_cfun_ext ~> cfun_belowI
3317 monofun_fun_fun ~> fun_belowD
3318 monofun_fun_arg ~> monofunE
3319 monofun_lub_fun ~> adm_monofun [THEN admD]
3320 cont_lub_fun ~> adm_cont [THEN admD]
3321 cont2cont_Rep_CFun ~> cont2cont_APP
3322 cont_Rep_CFun_app ~> cont_APP_app
3323 cont_Rep_CFun_app_app ~> cont_APP_app_app
3324 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3325 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3326 contlub_cfun ~> lub_APP [symmetric]
3327 contlub_LAM ~> lub_LAM [symmetric]
3330 lift_distinct1 ~> lift.distinct(1)
3331 lift_distinct2 ~> lift.distinct(2)
3332 Def_not_UU ~> lift.distinct(2)
3333 Def_inject ~> lift.inject
3334 below_UU_iff ~> below_bottom_iff
3335 eq_UU_iff ~> eq_bottom_iff
3338 *** Document preparation ***
3340 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3341 isar-ref manual, both for description and actual application of the
3344 * Antiquotation @{value} evaluates the given term and presents its
3347 * Antiquotations: term style "isub" provides ad-hoc conversion of
3348 variables x1, y23 into subscripted form x\<^isub>1,
3349 y\<^isub>2\<^isub>3.
3351 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3352 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3354 * Localized \isabellestyle switch can be used within blocks or groups
3357 \isabellestyle{it} %preferred default
3358 {\isabellestylett @{text "typewriter stuff"}}
3360 * Discontinued special treatment of hard tabulators. Implicit
3361 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3367 * The inner syntax of sort/type/term/prop supports inlined YXML
3368 representations within quoted string tokens. By encoding logical
3369 entities via Term_XML (in ML or Scala) concrete syntax can be
3370 bypassed, which is particularly useful for producing bits of text
3371 under external program control.
3373 * Antiquotations for ML and document preparation are managed as theory
3374 data, which requires explicit setup.
3376 * Isabelle_Process.is_active allows tools to check if the official
3377 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3378 (better known as Proof General).
3380 * Structure Proof_Context follows standard naming scheme. Old
3381 ProofContext is still available for some time as legacy alias.
3383 * Structure Timing provides various operations for timing; supersedes
3384 former start_timing/end_timing etc.
3386 * Path.print is the official way to show file-system paths to users
3387 (including quotes etc.).
3389 * Inner syntax: identifiers in parse trees of generic categories
3390 "logic", "aprop", "idt" etc. carry position information (disguised as
3391 type constraints). Occasional INCOMPATIBILITY with non-compliant
3392 translations that choke on unexpected type constraints. Positions can
3393 be stripped in ML translations via Syntax.strip_positions /
3394 Syntax.strip_positions_ast, or via the syntax constant
3395 "_strip_positions" within parse trees. As last resort, positions can
3396 be disabled via the configuration option Syntax.positions, which is
3397 called "syntax_positions" in Isar attribute syntax.
3399 * Discontinued special status of various ML structures that contribute
3400 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3401 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3402 refer directly to Ast.Constant, Lexicon.is_identifier,
3403 Syntax_Trans.mk_binder_tr etc.
3405 * Typed print translation: discontinued show_sorts argument, which is
3406 already available via context of "advanced" translation.
3408 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3409 goal states; body tactic needs to address all subgoals uniformly.
3411 * Slightly more special eq_list/eq_set, with shortcut involving
3412 pointer equality (assumes that eq relation is reflexive).
3414 * Classical tactics use proper Proof.context instead of historic types
3415 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3416 operate directly on Proof.context. Raw type claset retains its use as
3417 snapshot of the classical context, which can be recovered via
3418 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3419 INCOMPATIBILITY, classical tactics and derived proof methods require
3420 proper Proof.context.
3425 * Discontinued support for Poly/ML 5.2, which was the last version
3426 without proper multithreading and TimeLimit implementation.
3428 * Discontinued old lib/scripts/polyml-platform, which has been
3429 obsolete since Isabelle2009-2.
3431 * Various optional external tools are referenced more robustly and
3432 uniformly by explicit Isabelle settings as follows:
3434 ISABELLE_CSDP (formerly CSDP_EXE)
3435 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3436 ISABELLE_OCAML (formerly EXEC_OCAML)
3437 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3438 ISABELLE_YAP (formerly EXEC_YAP)
3440 Note that automated detection from the file-system or search path has
3441 been discontinued. INCOMPATIBILITY.
3443 * Scala layer provides JVM method invocation service for static
3444 methods of type (String)String, see Invoke_Scala.method in ML. For
3447 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3449 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3450 this allows to pass structured values between ML and Scala.
3452 * The IsabelleText fonts includes some further glyphs to support the
3453 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3454 installed a local copy (which is normally *not* required) need to
3455 delete or update it from ~~/lib/fonts/.
3459 New in Isabelle2011 (January 2011)
3460 ----------------------------------
3464 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3465 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3466 useful tooltips and hyperlinks produced from its static analysis. The
3467 bundled component provides an executable Isabelle tool that can be run
3470 Isabelle2011/bin/isabelle jedit
3472 * Significantly improved Isabelle/Isar implementation manual.
3474 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3475 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3476 while the default heap location within that directory lacks that extra
3477 suffix. This isolates multiple Isabelle installations from each
3478 other, avoiding problems with old settings in new versions.
3479 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3481 * Source files are always encoded as UTF-8, instead of old-fashioned
3482 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3483 the following package declarations:
3485 \usepackage[utf8]{inputenc}
3486 \usepackage{textcomp}
3488 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3489 a Unicode character is treated as a single symbol, not a sequence of
3490 non-ASCII bytes as before. Since Isabelle/ML string literals may
3491 contain symbols without further backslash escapes, Unicode can now be
3492 used here as well. Recall that Symbol.explode in ML provides a
3493 consistent view on symbols, while raw explode (or String.explode)
3494 merely give a byte-oriented representation.
3496 * Theory loader: source files are primarily located via the master
3497 directory of each theory node (where the .thy file itself resides).
3498 The global load path is still partially available as legacy feature.
3499 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3500 explicit paths, relatively to the theory.
3502 * Special treatment of ML file names has been discontinued.
3503 Historically, optional extensions .ML or .sml were added on demand --
3504 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3505 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3507 * Various options that affect pretty printing etc. are now properly
3508 handled within the context via configuration options, instead of
3509 unsynchronized references or print modes. There are both ML Config.T
3510 entities and Isar declaration attributes to access these.
3512 ML (Config.T) Isar (attribute)
3514 eta_contract eta_contract
3515 show_brackets show_brackets
3516 show_sorts show_sorts
3517 show_types show_types
3518 show_question_marks show_question_marks
3519 show_consts show_consts
3520 show_abbrevs show_abbrevs
3522 Syntax.ast_trace syntax_ast_trace
3523 Syntax.ast_stat syntax_ast_stat
3524 Syntax.ambiguity_level syntax_ambiguity_level
3526 Goal_Display.goals_limit goals_limit
3527 Goal_Display.show_main_goal show_main_goal
3529 Method.rule_trace rule_trace
3531 Thy_Output.display thy_output_display
3532 Thy_Output.quotes thy_output_quotes
3533 Thy_Output.indent thy_output_indent
3534 Thy_Output.source thy_output_source
3535 Thy_Output.break thy_output_break
3537 Note that corresponding "..._default" references in ML may only be
3538 changed globally at the ROOT session setup, but *not* within a theory.
3539 The option "show_abbrevs" supersedes the former print mode
3540 "no_abbrevs" with inverted meaning.
3542 * More systematic naming of some configuration options.
3545 trace_simp ~> simp_trace
3546 debug_simp ~> simp_debug
3548 * Support for real valued configuration options, using simplistic
3549 floating-point notation that coincides with the inner syntax for
3552 * Support for real valued preferences (with approximative PGIP type):
3553 front-ends need to accept "pgint" values in float notation.
3556 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3559 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3564 * Command 'type_synonym' (with single argument) replaces somewhat
3565 outdated 'types', which is still available as legacy feature for some
3568 * Command 'nonterminal' (with 'and' separated list of arguments)
3569 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3571 * Command 'notepad' replaces former 'example_proof' for
3572 experimentation in Isar without any result. INCOMPATIBILITY.
3574 * Locale interpretation commands 'interpret' and 'sublocale' accept
3575 lists of equations to map definitions in a locale to appropriate
3576 entities in the context of the interpretation. The 'interpretation'
3577 command already provided this functionality.
3579 * Diagnostic command 'print_dependencies' prints the locale instances
3580 that would be activated if the specified expression was interpreted in
3581 the current context. Variant "print_dependencies!" assumes a context
3582 without interpretations.
3584 * Diagnostic command 'print_interps' prints interpretations in proofs
3585 in addition to interpretations in theories.
3587 * Discontinued obsolete 'global' and 'local' commands to manipulate
3588 the theory name space. Rare INCOMPATIBILITY. The ML functions
3589 Sign.root_path and Sign.local_path may be applied directly where this
3590 feature is still required for historical reasons.
3592 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3593 'definition' instead.
3595 * The "prems" fact, which refers to the accidental collection of
3596 foundational premises in the context, is now explicitly marked as
3597 legacy feature and will be discontinued soon. Consider using "assms"
3598 of the head statement or reference facts by explicit names.
3600 * Document antiquotations @{class} and @{type} print classes and type
3603 * Document antiquotation @{file} checks file/directory entries within
3604 the local file system.
3609 * Coercive subtyping: functions can be declared as coercions and type
3610 inference will add them as necessary upon input of a term. Theory
3611 Complex_Main declares real :: nat => real and real :: int => real as
3612 coercions. A coercion function f is declared like this:
3614 declare [[coercion f]]
3616 To lift coercions through type constructors (e.g. from nat => real to
3617 nat list => real list), map functions can be declared, e.g.
3619 declare [[coercion_map map]]
3621 Currently coercion inference is activated only in theories including
3622 real numbers, i.e. descendants of Complex_Main. This is controlled by
3623 the configuration option "coercion_enabled", e.g. it can be enabled in
3624 other theories like this:
3626 declare [[coercion_enabled]]
3628 * Command 'partial_function' provides basic support for recursive
3629 function definitions over complete partial orders. Concrete instances
3630 are provided for i) the option type, ii) tail recursion on arbitrary
3631 types, and iii) the heap monad of Imperative_HOL. See
3632 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3635 * Function package: f.psimps rules are no longer implicitly declared
3636 as [simp]. INCOMPATIBILITY.
3638 * Datatype package: theorems generated for executable equality (class
3639 "eq") carry proper names and are treated as default code equations.
3641 * Inductive package: now offers command 'inductive_simps' to
3642 automatically derive instantiated and simplified equations for
3643 inductive predicates, similar to 'inductive_cases'.
3645 * Command 'enriched_type' allows to register properties of the
3646 functorial structure of types.
3648 * Improved infrastructure for term evaluation using code generator
3649 techniques, in particular static evaluation conversions.
3651 * Code generator: Scala (2.8 or higher) has been added to the target
3654 * Code generator: globbing constant expressions "*" and "Theory.*"
3655 have been replaced by the more idiomatic "_" and "Theory._".
3658 * Code generator: export_code without explicit file declaration prints
3659 to standard output. INCOMPATIBILITY.
3661 * Code generator: do not print function definitions for case
3662 combinators any longer.
3664 * Code generator: simplification with rules determined with
3665 src/Tools/Code/code_simp.ML and method "code_simp".
3667 * Code generator for records: more idiomatic representation of record
3668 types. Warning: records are not covered by ancient SML code
3669 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3670 rep_datatype declaration helps to succeed then:
3674 rep_datatype foo_ext ...
3676 * Records: logical foundation type for records does not carry a
3677 '_type' suffix any longer (obsolete due to authentic syntax).
3680 * Quickcheck now by default uses exhaustive testing instead of random
3681 testing. Random testing can be invoked by "quickcheck [random]",
3682 exhaustive testing by "quickcheck [exhaustive]".
3684 * Quickcheck instantiates polymorphic types with small finite
3685 datatypes by default. This enables a simple execution mechanism to
3686 handle quantifiers and function equality over the finite datatypes.
3688 * Quickcheck random generator has been renamed from "code" to
3689 "random". INCOMPATIBILITY.
3691 * Quickcheck now has a configurable time limit which is set to 30
3692 seconds by default. This can be changed by adding [timeout = n] to the
3693 quickcheck command. The time limit for Auto Quickcheck is still set
3696 * Quickcheck in locales considers interpretations of that locale for
3697 counter example search.
3700 - Added "smt" and "remote_smt" provers based on the "smt" proof
3701 method. See the Sledgehammer manual for details ("isabelle doc
3704 sledgehammer atp_info ~> sledgehammer running_provers
3705 sledgehammer atp_kill ~> sledgehammer kill_provers
3706 sledgehammer available_atps ~> sledgehammer available_provers
3709 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3710 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3711 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3712 (and "ms" and "min" are no longer supported)
3717 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3718 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3720 - Added support for partial quotient types.
3721 - Added local versions of the "Nitpick.register_xxx" functions.
3722 - Added "whack" option.
3723 - Allow registration of quotient types as codatatypes.
3724 - Improved "merge_type_vars" option to merge more types.
3725 - Removed unsound "fast_descrs" option.
3726 - Added custom symmetry breaking for datatypes, making it possible to reach
3727 higher cardinalities.
3728 - Prevent the expansion of too large definitions.
3730 * Proof methods "metis" and "meson" now have configuration options
3731 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3732 to diagnose these tools. E.g.
3734 using [[metis_trace = true]]
3736 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3737 manually as command 'solve_direct'.
3739 * The default SMT solver Z3 must be enabled explicitly (due to
3740 licensing issues) by setting the environment variable
3741 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3742 commercial applications, the SMT solver CVC3 is provided as fall-back;
3743 changing the SMT solver is done via the configuration option
3746 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3747 i.e. "remote_cvc3" and "remote_z3".
3749 * Added basic SMT support for datatypes, records, and typedefs using
3750 the oracle mode (no proofs). Direct support of pairs has been dropped
3751 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3752 support for a similar behavior). Minor INCOMPATIBILITY.
3754 * Changed SMT configuration options:
3756 z3_proofs ~> smt_oracle (with inverted meaning)
3757 z3_trace_assms ~> smt_trace_used_facts
3770 * Boogie output files (.b2i files) need to be declared in the theory
3773 * Simplification procedure "list_to_set_comprehension" rewrites list
3774 comprehensions applied to List.set to set comprehensions. Occasional
3775 INCOMPATIBILITY, may be deactivated like this:
3777 declare [[simproc del: list_to_set_comprehension]]
3779 * Removed old version of primrec package. INCOMPATIBILITY.
3781 * Removed simplifier congruence rule of "prod_case", as has for long
3782 been the case with "split". INCOMPATIBILITY.
3784 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3786 * Removed [split_format ... and ... and ...] version of
3787 [split_format]. Potential INCOMPATIBILITY.
3789 * Predicate "sorted" now defined inductively, with nice induction
3790 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3792 * Constant "contents" renamed to "the_elem", to free the generic name
3793 contents for other uses. INCOMPATIBILITY.
3795 * Renamed class eq and constant eq (for code generation) to class
3796 equal and constant equal, plus renaming of related facts and various
3797 tuning. INCOMPATIBILITY.
3799 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3801 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3804 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3805 avoid confusion with finite sets. INCOMPATIBILITY.
3807 * Abandoned locales equiv, congruent and congruent2 for equivalence
3808 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3811 * Some previously unqualified names have been qualified:
3818 Trueprop ~> HOL.Trueprop
3823 op --> ~> HOL.implies
3835 Pair ~> Product_Type.Pair
3836 fst ~> Product_Type.fst
3837 snd ~> Product_Type.snd
3838 curry ~> Product_Type.curry
3840 Collect ~> Set.Collect
3844 * More canonical naming convention for some fundamental definitions:
3846 bot_bool_eq ~> bot_bool_def
3847 top_bool_eq ~> top_bool_def
3848 inf_bool_eq ~> inf_bool_def
3849 sup_bool_eq ~> sup_bool_def
3850 bot_fun_eq ~> bot_fun_def
3851 top_fun_eq ~> top_fun_def
3852 inf_fun_eq ~> inf_fun_def
3853 sup_fun_eq ~> sup_fun_def
3857 * More stylized fact names:
3859 expand_fun_eq ~> fun_eq_iff
3860 expand_set_eq ~> set_eq_iff
3862 nat_number ~> eval_nat_numeral
3866 * Refactoring of code-generation specific operations in theory List:
3872 mem_iff ~> member_def
3873 null_empty ~> null_def
3875 INCOMPATIBILITY. Note that these were not supposed to be used
3876 regularly unless for striking reasons; their main purpose was code
3879 Various operations from the Haskell prelude are used for generating
3882 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3883 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3884 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3886 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3887 "*" and "+" respectively. INCOMPATIBILITY.
3889 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3890 "Sum_Type.Plus" instead.
3892 * Constant "split" has been merged with constant "prod_case"; names of
3893 ML functions, facts etc. involving split have been retained so far,
3894 though. INCOMPATIBILITY.
3896 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3897 instead. INCOMPATIBILITY.
3899 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3902 * Former theory Library/Enum is now part of the HOL-Main image.
3903 INCOMPATIBILITY: all constants of the Enum theory now have to be
3904 referred to by its qualified name.
3907 nlists ~> Enum.nlists
3908 product ~> Enum.product
3910 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3911 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3914 * Theory Library/SetsAndFunctions has been split into
3915 Library/Function_Algebras and Library/Set_Algebras; canonical names
3916 for instance definitions for functions; various improvements.
3919 * Theory Library/Multiset provides stable quicksort implementation of
3922 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3925 * Session Multivariate_Analysis: introduced a type class for euclidean
3926 space. Most theorems are now stated in terms of euclidean spaces
3927 instead of finite cartesian products.
3930 real ^ 'n ~> 'a::real_vector
3931 ~> 'a::euclidean_space
3932 ~> 'a::ordered_euclidean_space
3933 (depends on your needs)
3937 \<chi> x. _ ~> \<chi>\<chi> x. _
3940 Also note that the indices are now natural numbers and not from some
3941 finite type. Finite cartesian products of euclidean spaces, products
3942 of euclidean spaces the real and complex numbers are instantiated to
3943 be euclidean_spaces. INCOMPATIBILITY.
3945 * Session Probability: introduced pextreal as positive extended real
3946 numbers. Use pextreal as value for measures. Introduce the
3947 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3948 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3949 the integral in Multivariate Analysis. INCOMPATIBILITY.
3951 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3954 * Session SPARK (with image HOL-SPARK) provides commands to load and
3955 prove verification conditions generated by the SPARK Ada program
3956 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3961 * Theorems for additive ring operations (locale abelian_monoid and
3962 descendants) are generated by interpretation from their multiplicative
3963 counterparts. Names (in particular theorem names) have the mandatory
3964 qualifier 'add'. Previous theorem names are redeclared for
3967 * Structure "int_ring" is now an abbreviation (previously a
3968 definition). This fits more natural with advanced interpretations.
3973 * The domain package now runs in definitional mode by default: The
3974 former command 'new_domain' is now called 'domain'. To use the domain
3975 package in its original axiomatic mode, use 'domain (unsafe)'.
3978 * The new class "domain" is now the default sort. Class "predomain"
3979 is an unpointed version of "domain". Theories can be updated by
3980 replacing sort annotations as shown below. INCOMPATIBILITY.
3982 'a::type ~> 'a::countable
3983 'a::cpo ~> 'a::predomain
3984 'a::pcpo ~> 'a::domain
3986 * The old type class "rep" has been superseded by class "domain".
3987 Accordingly, users of the definitional package must remove any
3988 "default_sort rep" declarations. INCOMPATIBILITY.
3990 * The domain package (definitional mode) now supports unpointed
3991 predomain argument types, as long as they are marked 'lazy'. (Strict
3992 arguments must be in class "domain".) For example, the following
3993 domain definition now works:
3995 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3997 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3998 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3999 'a option, and 'a list. Additionally, it configures fixrec and the
4000 domain package to work with these types. For example:
4002 fixrec isInl :: "('a + 'b) u -> tr"
4003 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4005 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4007 * The "(permissive)" option of fixrec has been replaced with a
4008 per-equation "(unchecked)" option. See
4009 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4011 * The "bifinite" class no longer fixes a constant "approx"; the class
4012 now just asserts that such a function exists. INCOMPATIBILITY.
4014 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4015 defines an embedding of type 'a defl into udom by default; instances
4016 of "bifinite" and "domain" classes are available in
4017 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4019 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4021 * The predicate "directed" has been removed. INCOMPATIBILITY.
4023 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4025 * The function "cprod_map" has been renamed to "prod_map".
4028 * The monadic bind operator on each powerdomain has new binder syntax
4029 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4030 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4032 * The infix syntax for binary union on each powerdomain has changed
4033 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4034 syntax. INCOMPATIBILITY.
4036 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4037 still supported as an input translation.
4039 * Renamed some theorems (the original names are also still available).
4041 expand_fun_below ~> fun_below_iff
4042 below_fun_ext ~> fun_belowI
4043 expand_cfun_eq ~> cfun_eq_iff
4044 ext_cfun ~> cfun_eqI
4045 expand_cfun_below ~> cfun_below_iff
4046 below_cfun_ext ~> cfun_belowI
4047 cont2cont_Rep_CFun ~> cont2cont_APP
4049 * The Abs and Rep functions for various types have changed names.
4050 Related theorem names have also changed to match. INCOMPATIBILITY.
4052 Rep_CFun ~> Rep_cfun
4053 Abs_CFun ~> Abs_cfun
4054 Rep_Sprod ~> Rep_sprod
4055 Abs_Sprod ~> Abs_sprod
4056 Rep_Ssum ~> Rep_ssum
4057 Abs_Ssum ~> Abs_ssum
4059 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4060 been renamed to *_bottom_iff. INCOMPATIBILITY.
4062 * Various changes to bisimulation/coinduction with domain package:
4064 - Definitions of "bisim" constants no longer mention definedness.
4065 - With mutual recursion, "bisim" predicate is now curried.
4066 - With mutual recursion, each type gets a separate coind theorem.
4067 - Variable names in bisim_def and coinduct rules have changed.
4071 * Case combinators generated by the domain package for type "foo" are
4072 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4074 * Several theorems have been renamed to more accurately reflect the
4075 names of constants and types involved. INCOMPATIBILITY.
4077 thelub_const ~> lub_const
4078 lub_const ~> is_lub_const
4080 is_lub_lub ~> is_lubD2
4082 unique_lub ~> is_lub_unique
4083 is_ub_lub ~> is_lub_rangeD1
4084 lub_bin_chain ~> is_lub_bin_chain
4085 lub_fun ~> is_lub_fun
4086 thelub_fun ~> lub_fun
4087 thelub_cfun ~> lub_cfun
4088 thelub_Pair ~> lub_Pair
4089 lub_cprod ~> is_lub_prod
4090 thelub_cprod ~> lub_prod
4091 minimal_cprod ~> minimal_prod
4092 inst_cprod_pcpo ~> inst_prod_pcpo
4094 compact_UU ~> compact_bottom
4095 deflation_UU ~> deflation_bottom
4096 finite_deflation_UU ~> finite_deflation_bottom
4098 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4100 sq_ord_less_eq_trans ~> below_eq_trans
4101 sq_ord_eq_less_trans ~> eq_below_trans
4102 refl_less ~> below_refl
4103 trans_less ~> below_trans
4104 antisym_less ~> below_antisym
4105 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4106 box_less ~> box_below
4107 rev_trans_less ~> rev_below_trans
4108 not_less2not_eq ~> not_below2not_eq
4109 less_UU_iff ~> below_UU_iff
4110 flat_less_iff ~> flat_below_iff
4111 adm_less ~> adm_below
4112 adm_not_less ~> adm_not_below
4113 adm_compact_not_less ~> adm_compact_not_below
4114 less_fun_def ~> below_fun_def
4115 expand_fun_less ~> fun_below_iff
4116 less_fun_ext ~> fun_belowI
4117 less_discr_def ~> below_discr_def
4118 discr_less_eq ~> discr_below_eq
4119 less_unit_def ~> below_unit_def
4120 less_cprod_def ~> below_prod_def
4121 prod_lessI ~> prod_belowI
4122 Pair_less_iff ~> Pair_below_iff
4123 fst_less_iff ~> fst_below_iff
4124 snd_less_iff ~> snd_below_iff
4125 expand_cfun_less ~> cfun_below_iff
4126 less_cfun_ext ~> cfun_belowI
4127 injection_less ~> injection_below
4128 less_up_def ~> below_up_def
4129 not_Iup_less ~> not_Iup_below
4130 Iup_less ~> Iup_below
4132 Def_inject_less_eq ~> Def_below_Def
4133 Def_less_is_eq ~> Def_below_iff
4134 spair_less_iff ~> spair_below_iff
4135 less_sprod ~> below_sprod
4136 spair_less ~> spair_below
4137 sfst_less_iff ~> sfst_below_iff
4138 ssnd_less_iff ~> ssnd_below_iff
4139 fix_least_less ~> fix_least_below
4140 dist_less_one ~> dist_below_one
4141 less_ONE ~> below_ONE
4142 ONE_less_iff ~> ONE_below_iff
4143 less_sinlD ~> below_sinlD
4144 less_sinrD ~> below_sinrD
4149 * All constant names are now qualified internally and use proper
4150 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4155 * Antiquotation @{assert} inlines a function bool -> unit that raises
4156 Fail if the argument is false. Due to inlining the source position of
4157 failed assertions is included in the error output.
4159 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4160 text is in practice always evaluated with a stable theory checkpoint.
4161 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4163 * Antiquotation @{theory A} refers to theory A from the ancestry of
4164 the current context, not any accidental theory loader state as before.
4165 Potential INCOMPATIBILITY, subtle change in semantics.
4167 * Syntax.pretty_priority (default 0) configures the required priority
4168 of pretty-printed output and thus affects insertion of parentheses.
4170 * Syntax.default_root (default "any") configures the inner syntax
4171 category (nonterminal symbol) for parsing of terms.
4173 * Former exception Library.UnequalLengths now coincides with
4174 ListPair.UnequalLengths.
4176 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4177 main functionality is provided by structure Simplifier.
4179 * Renamed raw "explode" function to "raw_explode" to emphasize its
4180 meaning. Note that internally to Isabelle, Symbol.explode is used in
4181 almost all situations.
4183 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4184 See implementation manual for further details on exceptions in
4187 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4190 * Renamed structure PureThy to Pure_Thy and moved most of its
4191 operations to structure Global_Theory, to emphasize that this is
4192 rarely-used global-only stuff.
4194 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4195 instead (or tracing for high-volume output).
4197 * Configuration option show_question_marks only affects regular pretty
4198 printing of types and terms, not raw Term.string_of_vname.
4200 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4201 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4202 @{thms} for most purposes.
4204 * ML structure Unsynchronized is never opened, not even in Isar
4205 interaction mode as before. Old Unsynchronized.set etc. have been
4206 discontinued -- use plain := instead. This should be *rare* anyway,
4207 since modern tools always work via official context data, notably
4208 configuration options.
4210 * Parallel and asynchronous execution requires special care concerning
4211 interrupts. Structure Exn provides some convenience functions that
4212 avoid working directly with raw Interrupt. User code must not absorb
4213 interrupts -- intermediate handling (for cleanup etc.) needs to be
4214 followed by re-raising of the original exception. Another common
4215 source of mistakes are "handle _" patterns, which make the meaning of
4216 the program subject to physical effects of the environment.
4220 New in Isabelle2009-2 (June 2010)
4221 ---------------------------------
4225 * Authentic syntax for *all* logical entities (type classes, type
4226 constructors, term constants): provides simple and robust
4227 correspondence between formal entities and concrete syntax. Within
4228 the parse tree / AST representations, "constants" are decorated by
4229 their category (class, type, const) and spelled out explicitly with
4230 their full internal name.
4232 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4233 and translations (translation rules and translation functions in ML).
4234 Some hints on upgrading:
4236 - Many existing uses of 'syntax' and 'translations' can be replaced
4237 by more modern 'type_notation', 'notation' and 'abbreviation',
4238 which are independent of this issue.
4240 - 'translations' require markup within the AST; the term syntax
4241 provides the following special forms:
4243 CONST c -- produces syntax version of constant c from context
4244 XCONST c -- literally c, checked as constant from context
4245 c -- literally c, if declared by 'syntax'
4247 Plain identifiers are treated as AST variables -- occasionally the
4248 system indicates accidental variables via the error "rhs contains
4251 Type classes and type constructors are marked according to their
4252 concrete syntax. Some old translations rules need to be written
4253 for the "type" category, using type constructor application
4254 instead of pseudo-term application of the default category
4257 - 'parse_translation' etc. in ML may use the following
4260 @{class_syntax c} -- type class c within parse tree / AST
4261 @{term_syntax c} -- type constructor c within parse tree / AST
4262 @{const_syntax c} -- ML version of "CONST c" above
4263 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4265 - Literal types within 'typed_print_translations', i.e. those *not*
4266 represented as pseudo-terms are represented verbatim. Use @{class
4267 c} or @{type_name c} here instead of the above syntax
4270 Note that old non-authentic syntax was based on unqualified base
4271 names, so all of the above "constant" names would coincide. Recall
4272 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4273 diagnose syntax problems.
4275 * Type constructors admit general mixfix syntax, not just infix.
4277 * Concrete syntax may be attached to local entities without a proof
4278 body, too. This works via regular mixfix annotations for 'fix',
4279 'def', 'obtain' etc. or via the explicit 'write' command, which is
4280 similar to the 'notation' command in theory specifications.
4282 * Discontinued unnamed infix syntax (legacy feature for many years) --
4283 need to specify constant name and syntax separately. Internal ML
4284 datatype constructors have been renamed from InfixName to Infix etc.
4285 Minor INCOMPATIBILITY.
4287 * Schematic theorem statements need to be explicitly markup as such,
4288 via commands 'schematic_lemma', 'schematic_theorem',
4289 'schematic_corollary'. Thus the relevance of the proof is made
4290 syntactically clear, which impacts performance in a parallel or
4291 asynchronous interactive environment. Minor INCOMPATIBILITY.
4293 * Use of cumulative prems via "!" in some proof methods has been
4294 discontinued (old legacy feature).
4296 * References 'trace_simp' and 'debug_simp' have been replaced by
4297 configuration options stored in the context. Enabling tracing (the
4298 case of debugging is similar) in proofs works via
4300 using [[trace_simp = true]]
4302 Tracing is then active for all invocations of the simplifier in
4303 subsequent goal refinement steps. Tracing may also still be enabled or
4304 disabled via the ProofGeneral settings menu.
4306 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4307 'hide_fact' replace the former 'hide' KIND command. Minor
4310 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4311 more efficient than combinations with -q1 or -q2.
4316 * Proofterms record type-class reasoning explicitly, using the
4317 "unconstrain" operation internally. This eliminates all sort
4318 constraints from a theorem and proof, introducing explicit
4319 OFCLASS-premises. On the proof term level, this operation is
4320 automatically applied at theorem boundaries, such that closed proofs
4321 are always free of sort constraints. INCOMPATIBILITY for tools that
4322 inspect proof terms.
4324 * Local theory specifications may depend on extra type variables that
4325 are not present in the result type -- arguments TYPE('a) :: 'a itself
4326 are added internally. For example:
4328 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4330 * Predicates of locales introduced by classes carry a mandatory
4331 "class" prefix. INCOMPATIBILITY.
4333 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4335 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4338 * Command 'code_reflect' allows to incorporate generated ML code into
4339 runtime environment; replaces immature code_datatype antiquotation.
4342 * Code generator: simple concept for abstract datatypes obeying
4345 * Code generator: details of internal data cache have no impact on the
4346 user space functionality any longer.
4348 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4349 subgoals. This is more appropriate for interpretations with 'where'.
4352 * Command 'example_proof' opens an empty proof body. This allows to
4353 experiment with Isar, without producing any persistent result.
4355 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4356 within a local theory context, with explicit checking of the
4357 constructors involved (in contrast to the raw 'syntax' versions).
4359 * Commands 'types' and 'typedecl' now work within a local theory
4360 context -- without introducing dependencies on parameters or
4361 assumptions, which is not possible in Isabelle/Pure.
4363 * Command 'defaultsort' has been renamed to 'default_sort', it works
4364 within a local theory context. Minor INCOMPATIBILITY.
4369 * Command 'typedef' now works within a local theory context -- without
4370 introducing dependencies on parameters or assumptions, which is not
4371 possible in Isabelle/Pure/HOL. Note that the logical environment may
4372 contain multiple interpretations of local typedefs (with different
4373 non-emptiness proofs), even in a global theory context.
4375 * New package for quotient types. Commands 'quotient_type' and
4376 'quotient_definition' may be used for defining types and constants by
4377 quotient constructions. An example is the type of integers created by
4378 quotienting pairs of natural numbers:
4381 intrel :: "(nat * nat) => (nat * nat) => bool"
4383 "intrel (x, y) (u, v) = (x + v = u + y)"
4385 quotient_type int = "nat * nat" / intrel
4386 by (auto simp add: equivp_def expand_fun_eq)
4389 "0::int" is "(0::nat, 0::nat)"
4391 The method "lifting" can be used to lift of theorems from the
4392 underlying "raw" type to the quotient type. The example
4393 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4394 construction and provides a reasoning infrastructure for finite sets.
4396 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4397 clash with new theory Quotient in Main HOL.
4399 * Moved the SMT binding into the main HOL session, eliminating
4400 separate HOL-SMT session.
4402 * List membership infix mem operation is only an input abbreviation.
4405 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4406 for future developements; former Library/Word.thy is still present in
4407 the AFP entry RSAPPS.
4409 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4410 longer shadowed. INCOMPATIBILITY.
4412 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4415 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4418 * Dropped normalizing_semiring etc; use the facts in semiring classes
4419 instead. INCOMPATIBILITY.
4421 * Dropped several real-specific versions of lemmas about floor and
4422 ceiling; use the generic lemmas from theory "Archimedean_Field"
4423 instead. INCOMPATIBILITY.
4425 floor_number_of_eq ~> floor_number_of
4426 le_floor_eq_number_of ~> number_of_le_floor
4427 le_floor_eq_zero ~> zero_le_floor
4428 le_floor_eq_one ~> one_le_floor
4429 floor_less_eq_number_of ~> floor_less_number_of
4430 floor_less_eq_zero ~> floor_less_zero
4431 floor_less_eq_one ~> floor_less_one
4432 less_floor_eq_number_of ~> number_of_less_floor
4433 less_floor_eq_zero ~> zero_less_floor
4434 less_floor_eq_one ~> one_less_floor
4435 floor_le_eq_number_of ~> floor_le_number_of
4436 floor_le_eq_zero ~> floor_le_zero
4437 floor_le_eq_one ~> floor_le_one
4438 floor_subtract_number_of ~> floor_diff_number_of
4439 floor_subtract_one ~> floor_diff_one
4440 ceiling_number_of_eq ~> ceiling_number_of
4441 ceiling_le_eq_number_of ~> ceiling_le_number_of
4442 ceiling_le_zero_eq ~> ceiling_le_zero
4443 ceiling_le_eq_one ~> ceiling_le_one
4444 less_ceiling_eq_number_of ~> number_of_less_ceiling
4445 less_ceiling_eq_zero ~> zero_less_ceiling
4446 less_ceiling_eq_one ~> one_less_ceiling
4447 ceiling_less_eq_number_of ~> ceiling_less_number_of
4448 ceiling_less_eq_zero ~> ceiling_less_zero
4449 ceiling_less_eq_one ~> ceiling_less_one
4450 le_ceiling_eq_number_of ~> number_of_le_ceiling
4451 le_ceiling_eq_zero ~> zero_le_ceiling
4452 le_ceiling_eq_one ~> one_le_ceiling
4453 ceiling_subtract_number_of ~> ceiling_diff_number_of
4454 ceiling_subtract_one ~> ceiling_diff_one
4456 * Theory "Finite_Set": various folding_XXX locales facilitate the
4457 application of the various fold combinators on finite sets.
4459 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4460 provides abstract red-black tree type which is backed by "RBT_Impl" as
4461 implementation. INCOMPATIBILTY.
4463 * Theory Library/Coinductive_List has been removed -- superseded by
4464 AFP/thys/Coinductive.
4466 * Theory PReal, including the type "preal" and related operations, has
4467 been removed. INCOMPATIBILITY.
4469 * Real: new development using Cauchy Sequences.
4471 * Split off theory "Big_Operators" containing setsum, setprod,
4472 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4474 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4475 "Int" etc. INCOMPATIBILITY.
4477 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4479 * New set of rules "ac_simps" provides combined assoc / commute
4480 rewrites for all interpretations of the appropriate generic locales.
4482 * Renamed theory "OrderedGroup" to "Groups" and split theory
4483 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4484 appropriate and more consistent names suitable for name prefixes
4485 within the HOL theories. INCOMPATIBILITY.
4487 * Some generic constants have been put to appropriate theories:
4488 - less_eq, less: Orderings
4489 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4490 - inverse, divide: Rings
4493 * More consistent naming of type classes involving orderings (and
4496 lower_semilattice ~> semilattice_inf
4497 upper_semilattice ~> semilattice_sup
4499 dense_linear_order ~> dense_linorder
4501 pordered_ab_group_add ~> ordered_ab_group_add
4502 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4503 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4504 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4505 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4506 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4507 pordered_cancel_semiring ~> ordered_cancel_semiring
4508 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4509 pordered_comm_ring ~> ordered_comm_ring
4510 pordered_comm_semiring ~> ordered_comm_semiring
4511 pordered_ring ~> ordered_ring
4512 pordered_ring_abs ~> ordered_ring_abs
4513 pordered_semiring ~> ordered_semiring
4515 ordered_ab_group_add ~> linordered_ab_group_add
4516 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4517 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4518 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4519 ordered_field ~> linordered_field
4520 ordered_field_no_lb ~> linordered_field_no_lb
4521 ordered_field_no_ub ~> linordered_field_no_ub
4522 ordered_field_dense_linear_order ~> dense_linordered_field
4523 ordered_idom ~> linordered_idom
4524 ordered_ring ~> linordered_ring
4525 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4526 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4527 ordered_ring_strict ~> linordered_ring_strict
4528 ordered_semidom ~> linordered_semidom
4529 ordered_semiring ~> linordered_semiring
4530 ordered_semiring_1 ~> linordered_semiring_1
4531 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4532 ordered_semiring_strict ~> linordered_semiring_strict
4534 The following slightly odd type classes have been moved to a
4535 separate theory Library/Lattice_Algebras:
4537 lordered_ab_group_add ~> lattice_ab_group_add
4538 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4539 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4540 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4541 lordered_ring ~> lattice_ring
4545 * Refined field classes:
4546 - classes division_ring_inverse_zero, field_inverse_zero,
4547 linordered_field_inverse_zero include rule inverse 0 = 0 --
4548 subsumes former division_by_zero class;
4549 - numerous lemmas have been ported from field to division_ring.
4552 * Refined algebra theorem collections:
4553 - dropped theorem group group_simps, use algebra_simps instead;
4554 - dropped theorem group ring_simps, use field_simps instead;
4555 - proper theorem collection field_simps subsumes former theorem
4556 groups field_eq_simps and field_simps;
4557 - dropped lemma eq_minus_self_iff which is a duplicate for
4561 * Theory Finite_Set and List: some lemmas have been generalized from
4564 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4565 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4566 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4567 union_Union_fold_union ~> sup_Sup_fold_sup
4568 Inter_fold_inter ~> Inf_fold_inf
4569 Union_fold_union ~> Sup_fold_sup
4570 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4571 union_UNION_fold_union ~> sup_SUPR_fold_sup
4572 INTER_fold_inter ~> INFI_fold_inf
4573 UNION_fold_union ~> SUPR_fold_sup
4575 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4576 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4577 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4578 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4579 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4580 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4582 * Reorganized theory Multiset: swapped notation of pointwise and
4585 - pointwise ordering is instance of class order with standard syntax
4587 - multiset ordering has syntax <=# and <#; partial order properties
4588 are provided by means of interpretation with prefix
4590 - less duplication, less historical organization of sections,
4591 conversion from associations lists to multisets, rudimentary code
4593 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4598 multiset_eq_conv_count_eq ~> multiset_ext_iff
4599 multi_count_ext ~> multiset_ext
4600 diff_union_inverse2 ~> diff_union_cancelR
4604 * Theory Permutation: replaced local "remove" by List.remove1.
4606 * Code generation: ML and OCaml code is decorated with signatures.
4608 * Theory List: added transpose.
4610 * Library/Nat_Bijection.thy is a collection of bijective functions
4611 between nat and other types, which supersedes the older libraries
4612 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4615 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4616 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4617 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4618 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4619 Countable.pair_encode ~> prod_encode
4620 NatIso.prod2nat ~> prod_encode
4621 NatIso.nat2prod ~> prod_decode
4622 NatIso.sum2nat ~> sum_encode
4623 NatIso.nat2sum ~> sum_decode
4624 NatIso.list2nat ~> list_encode
4625 NatIso.nat2list ~> list_decode
4626 NatIso.set2nat ~> set_encode
4627 NatIso.nat2set ~> set_decode
4630 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4631 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4632 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4633 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4634 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4635 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4636 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4637 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4638 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4639 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4640 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4641 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4642 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4645 - Renamed ATP commands:
4646 atp_info ~> sledgehammer running_atps
4647 atp_kill ~> sledgehammer kill_atps
4648 atp_messages ~> sledgehammer messages
4649 atp_minimize ~> sledgehammer minimize
4650 print_atps ~> sledgehammer available_atps
4652 - Added user's manual ("isabelle doc sledgehammer").
4653 - Added option syntax and "sledgehammer_params" to customize
4654 Sledgehammer's behavior. See the manual for details.
4655 - Modified the Isar proof reconstruction code so that it produces
4656 direct proofs rather than proofs by contradiction. (This feature
4657 is still experimental.)
4658 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4660 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4663 - Added and implemented "binary_ints" and "bits" options.
4664 - Added "std" option and implemented support for nonstandard models.
4665 - Added and implemented "finitize" option to improve the precision
4666 of infinite datatypes based on a monotonicity analysis.
4667 - Added support for quotient types.
4668 - Added support for "specification" and "ax_specification"
4670 - Added support for local definitions (for "function" and
4671 "termination" proofs).
4672 - Added support for term postprocessors.
4673 - Optimized "Multiset.multiset" and "FinFun.finfun".
4674 - Improved efficiency of "destroy_constrs" optimization.
4675 - Fixed soundness bugs related to "destroy_constrs" optimization and
4677 - Fixed soundness bug related to higher-order constructors.
4678 - Fixed soundness bug when "full_descrs" is enabled.
4679 - Improved precision of set constructs.
4680 - Added "atoms" option.
4681 - Added cache to speed up repeated Kodkod invocations on the same
4683 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4684 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4685 "SAT4J_Light". INCOMPATIBILITY.
4686 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4687 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4688 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4690 * Method "induct" now takes instantiations of the form t, where t is not
4691 a variable, as a shorthand for "x == t", where x is a fresh variable.
4692 If this is not intended, t has to be enclosed in parentheses.
4693 By default, the equalities generated by definitional instantiations
4694 are pre-simplified, which may cause parameters of inductive cases
4695 to disappear, or may even delete some of the inductive cases.
4696 Use "induct (no_simp)" instead of "induct" to restore the old
4697 behaviour. The (no_simp) option is also understood by the "cases"
4698 and "nominal_induct" methods, which now perform pre-simplification, too.
4704 * Variable names in lemmas generated by the domain package have
4705 changed; the naming scheme is now consistent with the HOL datatype
4706 package. Some proof scripts may be affected, INCOMPATIBILITY.
4708 * The domain package no longer defines the function "foo_copy" for
4709 recursive domain "foo". The reach lemma is now stated directly in
4710 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4711 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4713 * Most definedness lemmas generated by the domain package (previously
4714 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4715 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4716 Proofs that used definedness lemmas as intro rules may break,
4717 potential INCOMPATIBILITY.
4719 * Induction and casedist rules generated by the domain package now
4720 declare proper case_names (one called "bottom", and one named for each
4721 constructor). INCOMPATIBILITY.
4723 * For mutually-recursive domains, separate "reach" and "take_lemma"
4724 rules are generated for each domain, INCOMPATIBILITY.
4726 foo_bar.reach ~> foo.reach bar.reach
4727 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4729 * Some lemmas generated by the domain package have been renamed for
4730 consistency with the datatype package, INCOMPATIBILITY.
4732 foo.ind ~> foo.induct
4733 foo.finite_ind ~> foo.finite_induct
4734 foo.coind ~> foo.coinduct
4735 foo.casedist ~> foo.exhaust
4736 foo.exhaust ~> foo.nchotomy
4738 * For consistency with other definition packages, the fixrec package
4739 now generates qualified theorem names, INCOMPATIBILITY.
4741 foo_simps ~> foo.simps
4742 foo_unfold ~> foo.unfold
4743 foo_induct ~> foo.induct
4745 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4746 method and internal fixrec proofs now use the default simpset instead.
4749 * The "contlub" predicate has been removed. Proof scripts should use
4750 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4752 * The "admw" predicate has been removed, INCOMPATIBILITY.
4754 * The constants cpair, cfst, and csnd have been removed in favor of
4755 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4760 * Antiquotations for basic formal entities:
4762 @{class NAME} -- type class
4763 @{class_syntax NAME} -- syntax representation of the above
4765 @{type_name NAME} -- logical type
4766 @{type_abbrev NAME} -- type abbreviation
4767 @{nonterminal NAME} -- type of concrete syntactic category
4768 @{type_syntax NAME} -- syntax representation of any of the above
4770 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4771 @{const_abbrev NAME} -- abbreviated constant
4772 @{const_syntax NAME} -- syntax representation of any of the above
4774 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4775 syntax constant (cf. 'syntax' command).
4777 * Antiquotation @{make_string} inlines a function to print arbitrary
4778 values similar to the ML toplevel. The result is compiler dependent
4779 and may fall back on "?" in certain situations.
4781 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4782 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4783 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4784 not work with the asynchronous Isar document model.
4786 * Configuration options now admit dynamic default values, depending on
4787 the context or even global references.
4789 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4790 uses an efficient external library if available (for Poly/ML).
4792 * Renamed some important ML structures, while keeping the old names
4793 for some time as aliases within the structure Legacy:
4795 OuterKeyword ~> Keyword
4798 OuterSyntax ~> Outer_Syntax
4799 PrintMode ~> Print_Mode
4800 SpecParse ~> Parse_Spec
4803 ThyOutput ~> Thy_Output
4804 TypeInfer ~> Type_Infer
4806 Note that "open Legacy" simplifies porting of sources, but forgetting
4807 to remove it again will complicate porting again in the future.
4809 * Most operations that refer to a global context are named
4810 accordingly, e.g. Simplifier.global_context or
4811 ProofContext.init_global. There are some situations where a global
4812 context actually works, but under normal circumstances one needs to
4813 pass the proper local context through the code!
4815 * Discontinued old TheoryDataFun with its copy/init operation -- data
4816 needs to be pure. Functor Theory_Data_PP retains the traditional
4817 Pretty.pp argument to merge, which is absent in the standard
4818 Theory_Data version.
4820 * Sorts.certify_sort and derived "cert" operations for types and terms
4821 no longer minimize sorts. Thus certification at the boundary of the
4822 inference kernel becomes invariant under addition of class relations,
4823 which is an important monotonicity principle. Sorts are now minimized
4824 in the syntax layer only, at the boundary between the end-user and the
4825 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4826 explicitly in rare situations.
4828 * Renamed old-style Drule.standard to Drule.export_without_context, to
4829 emphasize that this is in no way a standard operation.
4832 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4833 usual for resolution. Rare INCOMPATIBILITY.
4835 * Renamed varify/unvarify operations to varify_global/unvarify_global
4836 to emphasize that these only work in a global situation (which is
4839 * Curried take and drop in library.ML; negative length is interpreted
4840 as infinity (as in chop). Subtle INCOMPATIBILITY.
4842 * Proof terms: type substitutions on proof constants now use canonical
4843 order of type variables. INCOMPATIBILITY for tools working with proof
4846 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4847 may no longer carry premises. User-level specifications are
4848 transformed accordingly by Thm.add_axiom/add_def.
4853 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4854 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4855 proof terms are enabled unconditionally in the new HOL-Proofs image.
4857 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4858 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4861 * Old lib/scripts/polyml-platform is superseded by the
4862 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4863 variant, even on a 64 bit machine. The following example setting
4864 prefers 64 bit if available:
4866 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4868 * The preliminary Isabelle/jEdit application demonstrates the emerging
4869 Isabelle/Scala layer for advanced prover interaction and integration.
4870 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4873 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4874 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4875 similar to the default assignment of the document preparation system
4876 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4877 provides some operations for direct access to the font without asking
4878 the user for manual installation.
4882 New in Isabelle2009-1 (December 2009)
4883 -------------------------------------
4887 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4888 one backslash should be used, even in ML sources.
4893 * Locale interpretation propagates mixins along the locale hierarchy.
4894 The currently only available mixins are the equations used to map
4895 local definitions to terms of the target domain of an interpretation.
4897 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4898 loc" to print all interpretations of locale "loc" in the theory.
4899 Interpretations in proofs are not shown.
4901 * Thoroughly revised locales tutorial. New section on conditional
4904 * On instantiation of classes, remaining undefined class parameters
4905 are formally declared. INCOMPATIBILITY.
4908 *** Document preparation ***
4910 * New generalized style concept for printing terms: @{foo (style) ...}
4911 instead of @{foo_style style ...} (old form is still retained for
4912 backward compatibility). Styles can be also applied for
4913 antiquotations prop, term_type and typeof.
4918 * New proof method "smt" for a combination of first-order logic with
4919 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4920 fixed-size bitvectors; there is also basic support for higher-order
4921 features (esp. lambda abstractions). It is an incomplete decision
4922 procedure based on external SMT solvers using the oracle mechanism;
4923 for the SMT solver Z3, this method is proof-producing. Certificates
4924 are provided to avoid calling the external solvers solely for
4925 re-checking proofs. Due to a remote SMT service there is no need for
4926 installing SMT solvers locally. See src/HOL/SMT.
4928 * New commands to load and prove verification conditions generated by
4929 the Boogie program verifier or derived systems (e.g. the Verifying C
4930 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4932 * New counterexample generator tool 'nitpick' based on the Kodkod
4933 relational model finder. See src/HOL/Tools/Nitpick and
4934 src/HOL/Nitpick_Examples.
4936 * New commands 'code_pred' and 'values' to invoke the predicate
4937 compiler and to enumerate values of inductive predicates.
4939 * A tabled implementation of the reflexive transitive closure.
4941 * New implementation of quickcheck uses generic code generator;
4942 default generators are provided for all suitable HOL types, records
4943 and datatypes. Old quickcheck can be re-activated importing theory
4944 Library/SML_Quickcheck.
4946 * New testing tool Mirabelle for automated proof tools. Applies
4947 several tools and tactics like sledgehammer, metis, or quickcheck, to
4948 every proof step in a theory. To be used in batch mode via the
4949 "mirabelle" utility.
4951 * New proof method "sos" (sum of squares) for nonlinear real
4952 arithmetic (originally due to John Harison). It requires theory
4953 Library/Sum_Of_Squares. It is not a complete decision procedure but
4954 works well in practice on quantifier-free real arithmetic with +, -,
4955 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4956 inequalities between polynomials. It makes use of external
4957 semidefinite programming solvers. Method "sos" generates a
4958 certificate that can be pasted into the proof thus avoiding the need
4959 to call an external tool every time the proof is checked. See
4960 src/HOL/Library/Sum_Of_Squares.
4962 * New method "linarith" invokes existing linear arithmetic decision
4965 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4967 * New Sledgehammer option "Full Types" in Proof General settings menu.
4968 Causes full type information to be output to the ATPs. This slows
4969 ATPs down considerably but eliminates a source of unsound "proofs"
4972 * New method "metisFT": A version of metis that uses full type
4973 information in order to avoid failures of proof reconstruction.
4975 * New evaluator "approximate" approximates an real valued term using
4976 the same method as the approximation method.
4978 * Method "approximate" now supports arithmetic expressions as
4979 boundaries of intervals and implements interval splitting and Taylor
4982 * ML antiquotation @{code_datatype} inserts definition of a datatype
4983 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4985 * New theory SupInf of the supremum and infimum operators for sets of
4988 * New theory Probability, which contains a development of measure
4989 theory, eventually leading to Lebesgue integration and probability.
4991 * Extended Multivariate Analysis to include derivation and Brouwer's
4994 * Reorganization of number theory, INCOMPATIBILITY:
4995 - new number theory development for nat and int, in theories Divides
4996 and GCD as well as in new session Number_Theory
4997 - some constants and facts now suffixed with _nat and _int
4999 - former session NumberTheory now named Old_Number_Theory, including
5000 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5001 - moved theory Pocklington from src/HOL/Library to
5002 src/HOL/Old_Number_Theory
5004 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5005 lcm of finite and infinite sets. It is shown that they form a complete
5008 * Class semiring_div requires superclass no_zero_divisors and proof of
5009 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5010 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5011 generalized to class semiring_div, subsuming former theorems
5012 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5013 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5016 * Refinements to lattice classes and sets:
5017 - less default intro/elim rules in locale variant, more default
5018 intro/elim rules in class variant: more uniformity
5019 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5021 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5023 - renamed ACI to inf_sup_aci
5024 - new class "boolean_algebra"
5025 - class "complete_lattice" moved to separate theory
5026 "Complete_Lattice"; corresponding constants (and abbreviations)
5027 renamed and with authentic syntax:
5028 Set.Inf ~> Complete_Lattice.Inf
5029 Set.Sup ~> Complete_Lattice.Sup
5030 Set.INFI ~> Complete_Lattice.INFI
5031 Set.SUPR ~> Complete_Lattice.SUPR
5032 Set.Inter ~> Complete_Lattice.Inter
5033 Set.Union ~> Complete_Lattice.Union
5034 Set.INTER ~> Complete_Lattice.INTER
5035 Set.UNION ~> Complete_Lattice.UNION
5036 - authentic syntax for
5039 - mere abbreviations:
5042 Set.inter (for inf, formerly Set.Int)
5043 Set.union (for sup, formerly Set.Un)
5044 Complete_Lattice.Inter (for Inf)
5045 Complete_Lattice.Union (for Sup)
5046 Complete_Lattice.INTER (for INFI)
5047 Complete_Lattice.UNION (for SUPR)
5048 - object-logic definitions as far as appropriate
5050 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5051 Un_subset_iff are explicitly deleted as default simp rules; then also
5052 their lattice counterparts le_inf_iff and le_sup_iff have to be
5053 deleted to achieve the desired effect.
5055 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5056 rules by default any longer; the same applies to min_max.inf_absorb1
5057 etc. INCOMPATIBILITY.
5059 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5060 pred_set_conv by default. INCOMPATIBILITY.
5062 * Power operations on relations and functions are now one dedicated
5063 constant "compow" with infix syntax "^^". Power operation on
5064 multiplicative monoids retains syntax "^" and is now defined generic
5065 in class power. INCOMPATIBILITY.
5067 * Relation composition "R O S" now has a more standard argument order:
5068 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5069 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5070 break, since the O_assoc rule was not rewritten like this. Fix using
5071 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5073 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5074 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5077 * Most rules produced by inductive and datatype package have mandatory
5078 prefixes. INCOMPATIBILITY.
5080 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5081 the attribute of the same name. Each of the theorems in the list
5082 DERIV_intros assumes composition with an additional function and
5083 matches a variable to the derivative, which has to be solved by the
5084 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5085 of most elementary terms. Former Maclauren.DERIV_tac and
5086 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5089 * Code generator attributes follow the usual underscore convention:
5090 code_unfold replaces code unfold
5091 code_post replaces code post
5096 sizechange -> size_change
5097 induct_scheme -> induction_schema
5100 * Discontinued abbreviation "arbitrary" of constant "undefined".
5101 INCOMPATIBILITY, use "undefined" directly.
5104 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5105 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5106 Suc_plus1 -> Suc_eq_plus1
5107 *anti_sym -> *antisym*
5108 vector_less_eq_def -> vector_le_def
5111 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5114 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5120 * Theory Representable defines a class "rep" of domains that are
5121 representable (via an ep-pair) in the universal domain type "udom".
5122 Instances are provided for all type constructors defined in HOLCF.
5124 * The 'new_domain' command is a purely definitional version of the
5125 domain package, for representable domains. Syntax is identical to the
5126 old domain package. The 'new_domain' package also supports indirect
5127 recursion using previously-defined type constructors. See
5128 src/HOLCF/ex/New_Domain.thy for examples.
5130 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5131 on the left-hand side of an equation, and then performs
5132 simplification. Rewriting is done using rules declared with the
5133 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5134 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5136 * The pattern-match compiler in 'fixrec' can now handle constructors
5137 with HOL function types. Pattern-match combinators for the Pair
5138 constructor are pre-configured.
5140 * The 'fixrec' package now produces better fixed-point induction rules
5141 for mutually-recursive definitions: Induction rules have conclusions
5142 of the form "P foo bar" instead of "P <foo, bar>".
5144 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5145 been renamed to "below". The name "below" now replaces "less" in many
5146 theorem names. (Legacy theorem names using "less" are still supported
5149 * The 'fixrec' package now supports "bottom patterns". Bottom
5150 patterns can be used to generate strictness rules, or to make
5151 functions more strict (much like the bang-patterns supported by the
5152 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5158 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5159 errors and run-time exceptions, including detailed source positions.
5161 * Structure Name_Space (formerly NameSpace) now manages uniquely
5162 identified entries, with some additional information such as source
5163 position, logical grouping etc.
5165 * Theory and context data is now introduced by the simplified and
5166 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5167 to be pure, but the old TheoryDataFun for mutable data (with explicit
5168 copy operation) is still available for some time.
5170 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5171 provides a high-level programming interface to synchronized state
5172 variables with atomic update. This works via pure function
5173 application within a critical section -- its runtime should be as
5174 short as possible; beware of deadlocks if critical code is nested,
5175 either directly or indirectly via other synchronized variables!
5177 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5178 wraps raw ML references, explicitly indicating their non-thread-safe
5179 behaviour. The Isar toplevel keeps this structure open, to
5180 accommodate Proof General as well as quick and dirty interactive
5181 experiments with references.
5183 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5184 parallel tactical reasoning.
5186 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5187 are similar to SUBPROOF, but are slightly more flexible: only the
5188 specified parts of the subgoal are imported into the context, and the
5189 body tactic may introduce new subgoals and schematic variables.
5191 * Old tactical METAHYPS, which does not observe the proof context, has
5192 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5193 or Subgoal.FOCUS etc.
5195 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5196 functors have their own ML name space there is no point to mark them
5197 separately.) Minor INCOMPATIBILITY.
5199 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5201 * Renamed several structures FooBar to Foo_Bar. Occasional,
5204 * Operations of structure Skip_Proof no longer require quick_and_dirty
5205 mode, which avoids critical setmp.
5207 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5208 combinators for "args". INCOMPATIBILITY, need to use simplified
5209 Attrib/Method.setup introduced in Isabelle2009.
5211 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5212 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5213 last resort. INCOMPATIBILITY.
5215 * Display.pretty_thm now requires a proper context (cf. former
5216 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5217 or even Display.pretty_thm_without_context as last resort.
5220 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5221 Syntax.pretty_typ/term directly, preferably with proper context
5222 instead of global theory.
5227 * Further fine tuning of parallel proof checking, scales up to 8 cores
5228 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5231 * Support for additional "Isabelle components" via etc/components, see
5232 also the system manual.
5234 * The isabelle makeall tool now operates on all components with
5235 IsaMakefile, not just hardwired "logics".
5237 * Removed "compress" option from isabelle-process and isabelle usedir;
5238 this is always enabled.
5240 * Discontinued support for Poly/ML 4.x versions.
5242 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5243 on a given logic image. This requires the lighttpd webserver and is
5244 currently supported on Linux only.
5248 New in Isabelle2009 (April 2009)
5249 --------------------------------
5253 * Simplified main Isabelle executables, with less surprises on
5254 case-insensitive file-systems (such as Mac OS).
5256 - The main Isabelle tool wrapper is now called "isabelle" instead of
5259 - The former "isabelle" alias for "isabelle-process" has been
5260 removed (should rarely occur to regular users).
5262 - The former "isabelle-interface" and its alias "Isabelle" have been
5263 removed (interfaces are now regular Isabelle tools).
5265 Within scripts and make files, the Isabelle environment variables
5266 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5267 respectively. (The latter are still available as legacy feature.)
5269 The old isabelle-interface wrapper could react in confusing ways if
5270 the interface was uninstalled or changed otherwise. Individual
5271 interface tool configuration is now more explicit, see also the
5272 Isabelle system manual. In particular, Proof General is now available
5273 via "isabelle emacs".
5275 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5276 purge installed copies of Isabelle executables and re-run "isabelle
5277 install -p ...", or use symlinks.
5279 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5280 old ~/isabelle, which was slightly non-standard and apt to cause
5281 surprises on case-insensitive file-systems (such as Mac OS).
5283 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5284 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5285 care is required when using older releases of Isabelle. Note that
5286 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5287 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5289 * Proofs of fully specified statements are run in parallel on
5290 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5291 a regular 4-core machine, if the initial heap space is made reasonably
5292 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5294 * The main reference manuals ("isar-ref", "implementation", and
5295 "system") have been updated and extended. Formally checked references
5296 as hyperlinks are now available uniformly.
5301 * Complete re-implementation of locales. INCOMPATIBILITY in several
5302 respects. The most important changes are listed below. See the
5303 Tutorial on Locales ("locales" manual) for details.
5305 - In locale expressions, instantiation replaces renaming. Parameters
5306 must be declared in a for clause. To aid compatibility with previous
5307 parameter inheritance, in locale declarations, parameters that are not
5308 'touched' (instantiation position "_" or omitted) are implicitly added
5309 with their syntax at the beginning of the for clause.
5311 - Syntax from abbreviations and definitions in locales is available in
5312 locale expressions and context elements. The latter is particularly
5313 useful in locale declarations.
5315 - More flexible mechanisms to qualify names generated by locale
5316 expressions. Qualifiers (prefixes) may be specified in locale
5317 expressions, and can be marked as mandatory (syntax: "name!:") or
5318 optional (syntax "name?:"). The default depends for plain "name:"
5319 depends on the situation where a locale expression is used: in
5320 commands 'locale' and 'sublocale' prefixes are optional, in
5321 'interpretation' and 'interpret' prefixes are mandatory. The old
5322 implicit qualifiers derived from the parameter names of a locale are
5323 no longer generated.
5325 - Command "sublocale l < e" replaces "interpretation l < e". The
5326 instantiation clause in "interpretation" and "interpret" (square
5327 brackets) is no longer available. Use locale expressions.
5329 - When converting proof scripts, mandatory qualifiers in
5330 'interpretation' and 'interpret' should be retained by default, even
5331 if this is an INCOMPATIBILITY compared to former behavior. In the
5332 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5333 in locale expressions range over a single locale instance only.
5335 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5336 In existing theorem specifications replace the includes element by the
5337 respective context elements of the included locale, omitting those
5338 that are already present in the theorem specification. Multiple
5339 assume elements of a locale should be replaced by a single one
5340 involving the locale predicate. In the proof body, declarations (most
5341 notably theorems) may be regained by interpreting the respective
5342 locales in the proof context as required (command "interpret").
5344 If using "includes" in replacement of a target solely because the
5345 parameter types in the theorem are not as general as in the target,
5346 consider declaring a new locale with additional type constraints on
5347 the parameters (context element "constrains").
5349 - Discontinued "locale (open)". INCOMPATIBILITY.
5351 - Locale interpretation commands no longer attempt to simplify goal.
5352 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5353 methods intro_locales and unfold_locales to clarify.
5355 - Locale interpretation commands no longer accept interpretation
5356 attributes. INCOMPATIBILITY.
5358 * Class declaration: so-called "base sort" must not be given in import
5359 list any longer, but is inferred from the specification. Particularly
5366 class foo = type + ...
5368 * Class target: global versions of theorems stemming do not carry a
5369 parameter prefix any longer. INCOMPATIBILITY.
5371 * Class 'instance' command no longer accepts attached definitions.
5372 INCOMPATIBILITY, use proper 'instantiation' target instead.
5374 * Recovered hiding of consts, which was accidentally broken in
5375 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5376 makes c inaccessible; consider using ``hide (open) const c'' instead.
5378 * Slightly more coherent Pure syntax, with updated documentation in
5379 isar-ref manual. Removed locales meta_term_syntax and
5380 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5381 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5382 directly in regular applications.
5384 * There is a new syntactic category "float_const" for signed decimal
5385 fractions (e.g. 123.45 or -123.45).
5387 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5388 interface with 'setup' command instead.
5390 * Command 'local_setup' is similar to 'setup', but operates on a local
5393 * The 'axiomatization' command now only works within a global theory
5394 context. INCOMPATIBILITY.
5396 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5397 hypotheses. Sorts required in the course of reasoning need to be
5398 covered by the constraints in the initial statement, completed by the
5399 type instance information of the background theory. Non-trivial sort
5400 hypotheses, which rarely occur in practice, may be specified via
5401 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5403 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5405 The result contains an implicit sort hypotheses as before --
5406 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5409 * Generalized Isar history, with support for linear undo, direct state
5412 * Changed defaults for unify configuration options:
5414 unify_trace_bound = 50 (formerly 25)
5415 unify_search_bound = 60 (formerly 30)
5417 * Different bookkeeping for code equations (INCOMPATIBILITY):
5419 a) On theory merge, the last set of code equations for a particular
5420 constant is taken (in accordance with the policy applied by other
5421 parts of the code generator framework).
5423 b) Code equations stemming from explicit declarations (e.g. code
5424 attribute) gain priority over default code equations stemming
5425 from definition, primrec, fun etc.
5427 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5429 * Unified theorem tables for both code generators. Thus [code
5430 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5432 * Command 'find_consts' searches for constants based on type and name
5435 find_consts "_ => bool"
5437 By default, matching is against subtypes, but it may be restricted to
5438 the whole type. Searching by name is possible. Multiple queries are
5439 conjunctive and queries may be negated by prefixing them with a
5442 find_consts strict: "_ => bool" name: "Int" -"int => int"
5444 * New 'find_theorems' criterion "solves" matches theorems that
5445 directly solve the current goal (modulo higher-order unification).
5447 * Auto solve feature for main theorem statements: whenever a new goal
5448 is stated, "find_theorems solves" is called; any theorems that could
5449 solve the lemma directly are listed as part of the goal state.
5450 Cf. associated options in Proof General Isabelle settings menu,
5451 enabled by default, with reasonable timeout for pathological cases of
5452 higher-order unification.
5455 *** Document preparation ***
5457 * Antiquotation @{lemma} now imitates a regular terminal proof,
5458 demanding keyword 'by' and supporting the full method expression
5459 syntax just like the Isar command 'by'.
5464 * Integrated main parts of former image HOL-Complex with HOL. Entry
5465 points Main and Complex_Main remain as before.
5467 * Logic image HOL-Plain provides a minimal HOL with the most important
5468 tools available (inductive, datatype, primrec, ...). This facilitates
5469 experimentation and tool development. Note that user applications
5470 (and library theories) should never refer to anything below theory
5473 * Logic image HOL-Main stops at theory Main, and thus facilitates
5474 experimentation due to shorter build times.
5476 * Logic image HOL-NSA contains theories of nonstandard analysis which
5477 were previously part of former HOL-Complex. Entry point Hyperreal
5478 remains valid, but theories formerly using Complex_Main should now use
5479 new entry point Hypercomplex.
5481 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5482 Posix processes. Avoids potentially expensive forking of the ML
5483 process. New thread-based implementation also works on non-Unix
5484 platforms (Cygwin). Provers are no longer hardwired, but defined
5485 within the theory via plain ML wrapper functions. Basic Sledgehammer
5486 commands are covered in the isar-ref manual.
5488 * Wrapper scripts for remote SystemOnTPTP service allows to use
5489 sledgehammer without local ATP installation (Vampire etc.). Other
5490 provers may be included via suitable ML wrappers, see also
5491 src/HOL/ATP_Linkup.thy.
5493 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5496 * The metis method no longer fails because the theorem is too trivial
5497 (contains the empty clause).
5499 * The metis method now fails in the usual manner, rather than raising
5500 an exception, if it determines that it cannot prove the theorem.
5502 * Method "coherent" implements a prover for coherent logic (see also
5503 src/Tools/coherent.ML).
5505 * Constants "undefined" and "default" replace "arbitrary". Usually
5506 "undefined" is the right choice to replace "arbitrary", though
5507 logically there is no difference. INCOMPATIBILITY.
5509 * Command "value" now integrates different evaluation mechanisms. The
5510 result of the first successful evaluation mechanism is printed. In
5511 square brackets a particular named evaluation mechanisms may be
5512 specified (currently, [SML], [code] or [nbe]). See further
5513 src/HOL/ex/Eval_Examples.thy.
5515 * Normalization by evaluation now allows non-leftlinear equations.
5516 Declare with attribute [code nbe].
5518 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5519 as the structured Isar versions "cases" and "induct", cf. the
5520 corresponding "cases" and "induct" attributes. Mutual induction rules
5521 are now presented as a list of individual projections
5522 (e.g. foo_bar.inducts for types foo and bar); the old format with
5523 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5524 rare situations a different rule is selected --- notably nested tuple
5525 elimination instead of former prod.exhaust: use explicit (case_tac t
5526 rule: prod.exhaust) here.
5528 * Attributes "cases", "induct", "coinduct" support "del" option.
5530 * Removed fact "case_split_thm", which duplicates "case_split".
5532 * The option datatype has been moved to a new theory Option. Renamed
5533 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5535 * New predicate "strict_mono" classifies strict functions on partial
5536 orders. With strict functions on linear orders, reasoning about
5537 (in)equalities is facilitated by theorems "strict_mono_eq",
5538 "strict_mono_less_eq" and "strict_mono_less".
5540 * Some set operations are now proper qualified constants with
5541 authentic syntax. INCOMPATIBILITY:
5552 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5555 * Auxiliary class "itself" has disappeared -- classes without any
5556 parameter are treated as expected by the 'class' command.
5558 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5560 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5561 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5563 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5564 method "approximation". It proves formulas on real values by using
5565 interval arithmetic. In the formulas are also the transcendental
5566 functions sin, cos, tan, atan, ln, exp and the constant pi are
5567 allowed. For examples see
5568 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5570 * Theory "Reflection" now resides in HOL/Library.
5572 * Entry point to Word library now simply named "Word".
5575 * Made source layout more coherent with logical distribution
5578 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5579 src/HOL/Library/Code_Message.thy ~> src/HOL/
5580 src/HOL/Library/GCD.thy ~> src/HOL/
5581 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5582 src/HOL/Library/Parity.thy ~> src/HOL/
5583 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5584 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5585 src/HOL/Real/Lubs.thy ~> src/HOL/
5586 src/HOL/Real/PReal.thy ~> src/HOL/
5587 src/HOL/Real/Rational.thy ~> src/HOL/
5588 src/HOL/Real/RComplete.thy ~> src/HOL/
5589 src/HOL/Real/RealDef.thy ~> src/HOL/
5590 src/HOL/Real/RealPow.thy ~> src/HOL/
5591 src/HOL/Real/Real.thy ~> src/HOL/
5592 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5593 src/HOL/Complex/Complex.thy ~> src/HOL/
5594 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5595 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5596 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5597 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5598 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5599 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5600 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5601 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5602 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5603 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5604 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5605 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5606 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5607 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5608 src/HOL/Real/Float ~> src/HOL/Library/
5609 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5610 src/HOL/Real/RealVector.thy ~> src/HOL/
5612 src/HOL/arith_data.ML ~> src/HOL/Tools
5613 src/HOL/hologic.ML ~> src/HOL/Tools
5614 src/HOL/simpdata.ML ~> src/HOL/Tools
5615 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5616 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5617 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5618 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5619 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5620 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5621 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5623 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5624 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5625 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5626 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5627 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5628 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5630 * If methods "eval" and "evaluation" encounter a structured proof
5631 state with !!/==>, only the conclusion is evaluated to True (if
5632 possible), avoiding strange error messages.
5634 * Method "sizechange" automates termination proofs using (a
5635 modification of) the size-change principle. Requires SAT solver. See
5636 src/HOL/ex/Termination.thy for examples.
5638 * Simplifier: simproc for let expressions now unfolds if bound
5639 variable occurs at most once in let expression body. INCOMPATIBILITY.
5641 * Method "arith": Linear arithmetic now ignores all inequalities when
5642 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5644 * New attribute "arith" for facts that should always be used
5645 automatically by arithmetic. It is intended to be used locally in
5648 assumes [arith]: "x > 0"
5650 Global usage is discouraged because of possible performance impact.
5652 * New classes "top" and "bot" with corresponding operations "top" and
5653 "bot" in theory Orderings; instantiation of class "complete_lattice"
5654 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5656 * Changed definition lemma "less_fun_def" in order to provide an
5657 instance for preorders on functions; use lemma "less_le" instead.
5660 * Theory Orderings: class "wellorder" moved here, with explicit
5661 induction rule "less_induct" as assumption. For instantiation of
5662 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5665 * Theory Orderings: added class "preorder" as superclass of "order".
5666 INCOMPATIBILITY: Instantiation proofs for order, linorder
5667 etc. slightly changed. Some theorems named order_class.* now named
5670 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5673 * Theory Finite_Set: added a new fold combinator of type
5675 ('a => 'b => 'b) => 'b => 'a set => 'b
5677 Occasionally this is more convenient than the old fold combinator
5678 which is now defined in terms of the new one and renamed to
5681 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5682 and "ring_simps" have been replaced by "algebra_simps" (which can be
5683 extended with further lemmas!). At the moment both still exist but
5684 the former will disappear at some point.
5686 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5687 class recpower. Type-specific simp rules for various recpower types
5688 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5690 rat_power_0 -> power_0
5691 rat_power_Suc -> power_Suc
5692 realpow_0 -> power_0
5693 realpow_Suc -> power_Suc
5694 complexpow_0 -> power_0
5695 complexpow_Suc -> power_Suc
5696 power_poly_0 -> power_0
5697 power_poly_Suc -> power_Suc
5699 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5700 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5701 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5702 of lemmas from Divides has been generalized from nat to class
5703 semiring_div. INCOMPATIBILITY. This involves the following theorem
5704 renames resulting from duplicate elimination:
5706 dvd_def_mod ~> dvd_eq_mod_eq_0
5707 zero_dvd_iff ~> dvd_0_left_iff
5708 dvd_0 ~> dvd_0_right
5709 DIVISION_BY_ZERO_DIV ~> div_by_0
5710 DIVISION_BY_ZERO_MOD ~> mod_by_0
5711 mult_div ~> div_mult_self2_is_id
5712 mult_mod ~> mod_mult_self2_is_0
5714 * Theory IntDiv: removed many lemmas that are instances of class-based
5715 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5716 rename old lemmas as follows:
5718 dvd_diff -> nat_dvd_diff
5719 dvd_zminus_iff -> dvd_minus_iff
5720 mod_add1_eq -> mod_add_eq
5721 mod_mult1_eq -> mod_mult_right_eq
5722 mod_mult1_eq' -> mod_mult_left_eq
5723 mod_mult_distrib_mod -> mod_mult_eq
5724 nat_mod_add_left_eq -> mod_add_left_eq
5725 nat_mod_add_right_eq -> mod_add_right_eq
5726 nat_mod_div_trivial -> mod_div_trivial
5727 nat_mod_mod_trivial -> mod_mod_trivial
5728 zdiv_zadd_self1 -> div_add_self1
5729 zdiv_zadd_self2 -> div_add_self2
5730 zdiv_zmult_self1 -> div_mult_self2_is_id
5731 zdiv_zmult_self2 -> div_mult_self1_is_id
5732 zdvd_triv_left -> dvd_triv_left
5733 zdvd_triv_right -> dvd_triv_right
5734 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5735 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5736 zmod_zadd_left_eq -> mod_add_left_eq
5737 zmod_zadd_right_eq -> mod_add_right_eq
5738 zmod_zadd_self1 -> mod_add_self1
5739 zmod_zadd_self2 -> mod_add_self2
5740 zmod_zadd1_eq -> mod_add_eq
5741 zmod_zdiff1_eq -> mod_diff_eq
5742 zmod_zdvd_zmod -> mod_mod_cancel
5743 zmod_zmod_cancel -> mod_mod_cancel
5744 zmod_zmult_self1 -> mod_mult_self2_is_0
5745 zmod_zmult_self2 -> mod_mult_self1_is_0
5748 zdvd_abs1 -> abs_dvd_iff
5749 zdvd_abs2 -> dvd_abs_iff
5750 zdvd_refl -> dvd_refl
5751 zdvd_trans -> dvd_trans
5752 zdvd_zadd -> dvd_add
5753 zdvd_zdiff -> dvd_diff
5754 zdvd_zminus_iff -> dvd_minus_iff
5755 zdvd_zminus2_iff -> minus_dvd_iff
5756 zdvd_zmultD -> dvd_mult_right
5757 zdvd_zmultD2 -> dvd_mult_left
5758 zdvd_zmult_mono -> mult_dvd_mono
5759 zdvd_0_right -> dvd_0_right
5760 zdvd_0_left -> dvd_0_left_iff
5761 zdvd_1_left -> one_dvd
5762 zminus_dvd_iff -> minus_dvd_iff
5764 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5766 * The real numbers offer decimal input syntax: 12.34 is translated
5767 into 1234/10^2. This translation is not reversed upon output.
5769 * Theory Library/Polynomial defines an abstract type 'a poly of
5770 univariate polynomials with coefficients of type 'a. In addition to
5771 the standard ring operations, it also supports div and mod. Code
5772 generation is also supported, using list-style constructors.
5774 * Theory Library/Inner_Product defines a class of real_inner for real
5775 inner product spaces, with an overloaded operation inner :: 'a => 'a
5776 => real. Class real_inner is a subclass of real_normed_vector from
5779 * Theory Library/Product_Vector provides instances for the product
5780 type 'a * 'b of several classes from RealVector and Inner_Product.
5781 Definitions of addition, subtraction, scalar multiplication, norms,
5782 and inner products are included.
5784 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5785 addition to the field operations, numerals and case syntax are also
5788 * Theory Library/Diagonalize provides constructive version of Cantor's
5789 first diagonalization argument.
5791 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5792 zlcm (for int); carried together from various gcd/lcm developements in
5793 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5794 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5795 may recover tupled syntax as follows:
5797 hide (open) const gcd
5798 abbreviation gcd where
5799 "gcd == (%(a, b). GCD.gcd a b)"
5801 GCD.gcd ("gcd '(_, _')")
5803 The same works for lcm, zgcd, zlcm.
5805 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5806 instantiations for algebraic structures. Removed some duplicate
5807 theorems. Changes in simp rules. INCOMPATIBILITY.
5809 * ML antiquotation @{code} takes a constant as argument and generates
5810 corresponding code in background and inserts name of the corresponding
5811 resulting ML value/function/datatype constructor binding in place.
5812 All occurrences of @{code} with a single ML block are generated
5813 simultaneously. Provides a generic and safe interface for
5814 instrumentalizing code generation. See
5815 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5816 In future you ought to refrain from ad-hoc compiling generated SML
5817 code on the ML toplevel. Note that (for technical reasons) @{code}
5818 cannot refer to constants for which user-defined serializations are
5819 set. Refer to the corresponding ML counterpart directly in that
5822 * Command 'rep_datatype': instead of theorem names the command now
5823 takes a list of terms denoting the constructors of the type to be
5824 represented as datatype. The characteristic theorems have to be
5825 proven. INCOMPATIBILITY. Also observe that the following theorems
5826 have disappeared in favour of existing ones:
5828 unit_induct ~> unit.induct
5829 prod_induct ~> prod.induct
5830 sum_induct ~> sum.induct
5831 Suc_Suc_eq ~> nat.inject
5832 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5837 * New locales for orders and lattices where the equivalence relation
5838 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5839 locales use a record structure with field eq for the equivalence.
5841 * New theory of factorial domains.
5843 * Units_l_inv and Units_r_inv are now simp rules by default.
5844 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5845 and/or r_inv will now also require deletion of these lemmas.
5847 * Renamed the following theorems, INCOMPATIBILITY:
5849 UpperD ~> Upper_memD
5850 LowerD ~> Lower_memD
5851 least_carrier ~> least_closed
5852 greatest_carrier ~> greatest_closed
5853 greatest_Lower_above ~> greatest_Lower_below
5854 one_zero ~> carrier_one_zero
5855 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5860 * Nominal datatypes can now contain type-variables.
5862 * Commands 'nominal_inductive' and 'equivariance' work with local
5865 * Nominal primrec can now works with local theory targets and its
5866 specification syntax now conforms to the general format as seen in
5869 * Method "perm_simp" honours the standard simplifier attributes
5870 (no_asm), (no_asm_use) etc.
5872 * The new predicate #* is defined like freshness, except that on the
5873 left hand side can be a set or list of atoms.
5875 * Experimental command 'nominal_inductive2' derives strong induction
5876 principles for inductive definitions. In contrast to
5877 'nominal_inductive', which can only deal with a fixed number of
5878 binders, it can deal with arbitrary expressions standing for sets of
5879 atoms to be avoided. The only inductive definition we have at the
5880 moment that needs this generalisation is the typing rule for Lets in
5883 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5884 -----------------------------------------------------------------
5885 Gamma |- Let x be t1 in t2 : T2
5887 In this rule one wants to avoid all the binders that are introduced by
5888 "close Gamma T1". We are looking for other examples where this
5889 feature might be useful. Please let us know.
5894 * Reimplemented the simplification procedure for proving continuity
5895 subgoals. The new simproc is extensible; users can declare additional
5896 continuity introduction rules with the attribute [cont2cont].
5898 * The continuity simproc now uses a different introduction rule for
5899 solving continuity subgoals on terms with lambda abstractions. In
5900 some rare cases the new simproc may fail to solve subgoals that the
5901 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5902 Potential INCOMPATIBILITY.
5904 * Command 'fixrec': specification syntax now conforms to the general
5905 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5906 examples. INCOMPATIBILITY.
5911 * Proof of Zorn's Lemma for partial orders.
5916 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5917 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5918 depends on multithreading, so timouts will not work before Poly/ML
5921 * High-level support for concurrent ML programming, see
5922 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5923 particularly convenient to organize independent functional
5924 computations. The concept of "synchronized variables" provides a
5925 higher-order interface for components with shared state, avoiding the
5926 delicate details of mutexes and condition variables. (Requires
5927 Poly/ML 5.2.1 or later.)
5929 * ML bindings produced via Isar commands are stored within the Isar
5930 context (theory or proof). Consequently, commands like 'use' and 'ML'
5931 become thread-safe and work with undo as expected (concerning
5932 top-level bindings, not side-effects on global references).
5933 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5934 compiler at runtime; really global bindings need to be given outside a
5935 theory. (Requires Poly/ML 5.2 or later.)
5937 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5938 context. Top-level ML bindings are stored within the proof context in
5939 a purely sequential fashion, disregarding the nested proof structure.
5940 ML bindings introduced by 'ML_prf' are discarded at the end of the
5941 proof. (Requires Poly/ML 5.2 or later.)
5943 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5944 and Method.setup, as well as Isar commands 'attribute_setup' and
5945 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5946 existing code accordingly, or use plain 'setup' together with old
5949 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5950 to 'a -> thm, while results are always tagged with an authentic oracle
5951 name. The Isar command 'oracle' is now polymorphic, no argument type
5952 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5953 accordingly. Note that extra performance may be gained by producing
5954 the cterm carefully, avoiding slow Thm.cterm_of.
5956 * Simplified interface for defining document antiquotations via
5957 ThyOutput.antiquotation, ThyOutput.output, and optionally
5958 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5959 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5962 * More systematic treatment of long names, abstract name bindings, and
5963 name space operations. Basic operations on qualified names have been
5964 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5965 Long_Name.append. Old type bstring has been mostly replaced by
5966 abstract type binding (see structure Binding), which supports precise
5967 qualification by packages and local theory targets, as well as proper
5968 tracking of source positions. INCOMPATIBILITY, need to wrap old
5969 bstring values into Binding.name, or better pass through abstract
5970 bindings everywhere. See further src/Pure/General/long_name.ML,
5971 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5973 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5974 LocalTheory.note etc.) now refer to the *full* internal name, not the
5975 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5977 * Disposed old type and term read functions (Sign.read_def_typ,
5978 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5979 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5980 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5981 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5982 resort for legacy applications.
5984 * Disposed old declarations, tactics, tactic combinators that refer to
5985 the simpset or claset of an implicit theory (such as Addsimps,
5986 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5987 embedded ML text, or local_simpset_of with a proper context passed as
5988 explicit runtime argument.
5990 * Rules and tactics that read instantiations (read_instantiate,
5991 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5992 context, which is required for parsing and type-checking. Moreover,
5993 the variables are specified as plain indexnames, not string encodings
5994 thereof. INCOMPATIBILITY.
5996 * Generic Toplevel.add_hook interface allows to analyze the result of
5997 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5998 for theorem dependency output of transactions resulting in a new
6001 * ML antiquotations: block-structured compilation context indicated by
6002 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6004 @{binding name} - basic name binding
6005 @{let ?pat = term} - term abbreviation (HO matching)
6006 @{note name = fact} - fact abbreviation
6007 @{thm fact} - singleton fact (with attributes)
6008 @{thms fact} - general fact (with attributes)
6009 @{lemma prop by method} - singleton goal
6010 @{lemma prop by meth1 meth2} - singleton goal
6011 @{lemma prop1 ... propN by method} - general goal
6012 @{lemma prop1 ... propN by meth1 meth2} - general goal
6013 @{lemma (open) ...} - open derivation
6018 * The Isabelle "emacs" tool provides a specific interface to invoke
6019 Proof General / Emacs, with more explicit failure if that is not
6020 installed (the old isabelle-interface script silently falls back on
6021 isabelle-process). The PROOFGENERAL_HOME setting determines the
6022 installation location of the Proof General distribution.
6024 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6025 the Isabelle process into a JVM/Scala application. See
6026 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6027 process wrapper has been discontinued.)
6029 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6031 * Various status messages (with exact source position information) are
6032 emitted, if proper markup print mode is enabled. This allows
6033 user-interface components to provide detailed feedback on internal
6038 New in Isabelle2008 (June 2008)
6039 -------------------------------
6043 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6044 and updated, with formally checked references as hyperlinks.
6046 * Theory loader: use_thy (and similar operations) no longer set the
6047 implicit ML context, which was occasionally hard to predict and in
6048 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6049 provides a proper context already.
6051 * Theory loader: old-style ML proof scripts being *attached* to a thy
6052 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6053 'use' within a theory file will do the job.
6055 * Name space merge now observes canonical order, i.e. the second space
6056 is inserted into the first one, while existing entries in the first
6057 space take precedence. INCOMPATIBILITY in rare situations, may try to
6058 swap theory imports.
6060 * Syntax: symbol \<chi> is now considered a letter. Potential
6061 INCOMPATIBILITY in identifier syntax etc.
6063 * Outer syntax: string tokens no longer admit escaped white space,
6064 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6065 white space without escapes.
6067 * Outer syntax: string tokens may contain arbitrary character codes
6068 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6074 * Context-dependent token translations. Default setup reverts locally
6075 fixed variables, and adds hilite markup for undeclared frees.
6077 * Unused theorems can be found using the new command 'unused_thms'.
6078 There are three ways of invoking it:
6081 Only finds unused theorems in the current theory.
6083 (2) unused_thms thy_1 ... thy_n -
6084 Finds unused theorems in the current theory and all of its ancestors,
6085 excluding the theories thy_1 ... thy_n and all of their ancestors.
6087 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6088 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6089 their ancestors, excluding the theories thy_1 ... thy_n and all of
6092 In order to increase the readability of the list produced by
6093 unused_thms, theorems that have been created by a particular instance
6094 of a theory command such as 'inductive' or 'function' are considered
6095 to belong to the same "group", meaning that if at least one theorem in
6096 this group is used, the other theorems in the same group are no longer
6097 reported as unused. Moreover, if all theorems in the group are
6098 unused, only one theorem in the group is displayed.
6100 Note that proof objects have to be switched on in order for
6101 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6102 usually the case when using Proof General with the default settings).
6104 * Authentic naming of facts disallows ad-hoc overwriting of previous
6105 theorems within the same name space. INCOMPATIBILITY, need to remove
6106 duplicate fact bindings, or even accidental fact duplications. Note
6107 that tools may maintain dynamically scoped facts systematically, using
6108 PureThy.add_thms_dynamic.
6110 * Command 'hide' now allows to hide from "fact" name space as well.
6112 * Eliminated destructive theorem database, simpset, claset, and
6113 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6114 update of theories within ML code.
6116 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6117 INCOMPATIBILITY, object-logics depending on former Pure require
6118 additional setup PureThy.old_appl_syntax_setup; object-logics
6119 depending on former CPure need to refer to Pure.
6121 * Commands 'use' and 'ML' are now purely functional, operating on
6122 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6123 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6126 * Command 'setup': discontinued implicit version with ML reference.
6128 * Instantiation target allows for simultaneous specification of class
6129 instance operations together with an instantiation proof.
6130 Type-checking phase allows to refer to class operations uniformly.
6131 See src/HOL/Complex/Complex.thy for an Isar example and
6132 src/HOL/Library/Eval.thy for an ML example.
6134 * Indexing of literal facts: be more serious about including only
6135 facts from the visible specification/proof context, but not the
6136 background context (locale etc.). Affects `prop` notation and method
6137 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6140 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6141 "(open)" option, which used to expose internal bound variables to the
6144 * Isar statements: removed obsolete case "rule_context".
6145 INCOMPATIBILITY, better use explicit fixes/assumes.
6147 * Locale proofs: default proof step now includes 'unfold_locales';
6148 hence 'proof' without argument may be used to unfold locale
6152 *** Document preparation ***
6154 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6155 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6156 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6157 spot); renamed link color from "darkblue" to "linkcolor" (default
6158 value unchanged, can be redefined via \definecolor); no longer sets
6159 "a4paper" option (unnecessary or even intrusive).
6161 * Antiquotation @{lemma A method} proves proposition A by the given
6162 method (either a method name or a method name plus (optional) method
6163 arguments in parentheses) and prints A just like @{prop A}.
6168 * New primrec package. Specification syntax conforms in style to
6169 definition/function/.... No separate induction rule is provided. The
6170 "primrec" command distinguishes old-style and new-style specifications
6171 by syntax. The former primrec package is now named OldPrimrecPackage.
6172 When adjusting theories, beware: constants stemming from new-style
6173 primrec specifications have authentic syntax.
6175 * Metis prover is now an order of magnitude faster, and also works
6176 with multithreading.
6178 * Metis: the maximum number of clauses that can be produced from a
6179 theorem is now given by the attribute max_clauses. Theorems that
6180 exceed this number are ignored, with a warning printed.
6182 * Sledgehammer no longer produces structured proofs by default. To
6183 enable, declare [[sledgehammer_full = true]]. Attributes
6184 reconstruction_modulus, reconstruction_sorts renamed
6185 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6187 * Method "induct_scheme" derives user-specified induction rules
6188 from well-founded induction and completeness of patterns. This factors
6189 out some operations that are done internally by the function package
6190 and makes them available separately. See
6191 src/HOL/ex/Induction_Scheme.thy for examples.
6193 * More flexible generation of measure functions for termination
6194 proofs: Measure functions can be declared by proving a rule of the
6195 form "is_measure f" and giving it the [measure_function] attribute.
6196 The "is_measure" predicate is logically meaningless (always true), and
6197 just guides the heuristic. To find suitable measure functions, the
6198 termination prover sets up the goal "is_measure ?f" of the appropriate
6199 type and generates all solutions by Prolog-style backward proof using
6202 This setup also deals with rules like
6204 "is_measure f ==> is_measure (list_size f)"
6206 which accommodates nested datatypes that recurse through lists.
6207 Similar rules are predeclared for products and option types.
6209 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6213 - Definitions of overloaded constants on sets have to be replaced by
6214 definitions on => and bool.
6216 - Some definitions of overloaded operators on sets can now be proved
6217 using the definitions of the operators on => and bool. Therefore,
6218 the following theorems have been renamed:
6220 subset_def -> subset_eq
6221 psubset_def -> psubset_eq
6222 set_diff_def -> set_diff_eq
6223 Compl_def -> Compl_eq
6224 Sup_set_def -> Sup_set_eq
6225 Inf_set_def -> Inf_set_eq
6226 sup_set_def -> sup_set_eq
6227 inf_set_def -> inf_set_eq
6229 - Due to the incompleteness of the HO unification algorithm, some
6230 rules such as subst may require manual instantiation, if some of
6231 the unknowns in the rule is a set.
6233 - Higher order unification and forward proofs:
6236 have "P (S::'a set)" <...>
6237 then have "EX S. P S" ..
6239 no longer works (due to the incompleteness of the HO unification
6240 algorithm) and must be replaced by the pattern
6247 - Calculational reasoning with subst (or similar rules):
6250 have "P (S::'a set)" <...>
6251 also have "S = T" <...>
6252 finally have "P T" .
6254 no longer works (for similar reasons as the previous example) and
6255 must be replaced by something like
6257 have "P (S::'a set)" <...>
6258 moreover have "S = T" <...>
6259 ultimately have "P T" by simp
6261 - Tactics or packages written in ML code:
6262 Code performing pattern matching on types via
6264 Type ("set", [T]) => ...
6266 must be rewritten. Moreover, functions like strip_type or
6267 binder_types no longer return the right value when applied to a
6270 T1 => ... => Tn => U => bool
6274 T1 => ... => Tn => U set
6276 * Merged theories Wellfounded_Recursion, Accessible_Part and
6277 Wellfounded_Relations to theory Wellfounded.
6279 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6281 * Class finite no longer treats UNIV as class parameter. Use class
6282 enum from theory Library/Enum instead to achieve a similar effect.
6285 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6286 and "Cons". INCOMPATIBILITY.
6288 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6289 Potential INCOMPATIBILITY.
6291 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6292 injective_fst_snd removed, use split_eta and prod_eqI instead.
6293 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6295 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6296 the same name in theory Orderings:
6306 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6307 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6308 and different variable names.
6310 * Library/Option_ord.thy: Canonical order on option type.
6312 * Library/RBT.thy: Red-black trees, an efficient implementation of
6315 * Library/Countable.thy: Type class for countable types.
6317 * Theory Int: The representation of numerals has changed. The infix
6318 operator BIT and the bit datatype with constructors B0 and B1 have
6319 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6320 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6321 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6324 * Theory Nat: definition of <= and < on natural numbers no longer
6325 depend on well-founded relations. INCOMPATIBILITY. Definitions
6326 le_def and less_def have disappeared. Consider lemmas not_less
6327 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6329 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6330 (whose purpose mainly is for various fold_set functionals) have been
6331 abandoned in favor of the existing algebraic classes
6332 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6333 lower_semilattice (resp. upper_semilattice) and linorder.
6336 * Theory Transitive_Closure: induct and cases rules now declare proper
6337 case_names ("base" and "step"). INCOMPATIBILITY.
6339 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6340 lattices. The form set-specific version is available as
6341 Inductive.lfp_ordinal_induct_set.
6343 * Renamed theorems "power.simps" to "power_int.simps".
6346 * Class semiring_div provides basic abstract properties of semirings
6347 with division and modulo operations. Subsumes former class dvd_mod.
6349 * Merged theories IntDef, Numeral and IntArith into unified theory
6350 Int. INCOMPATIBILITY.
6352 * Theory Library/Code_Index: type "index" now represents natural
6353 numbers rather than integers. INCOMPATIBILITY.
6355 * New class "uminus" with operation "uminus" (split of from class
6356 "minus" which now only has operation "minus", binary).
6359 * Constants "card", "internal_split", "option_map" now with authentic
6360 syntax. INCOMPATIBILITY.
6362 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6363 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6364 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6365 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6366 Sup_set_def, le_def, less_def, option_map_def now with object
6367 equality. INCOMPATIBILITY.
6369 * Records. Removed K_record, and replaced it by pure lambda term
6370 %x. c. The simplifier setup is now more robust against eta expansion.
6371 INCOMPATIBILITY: in cases explicitly referring to K_record.
6373 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6375 * Library/ListVector: new theory of arithmetic vector operations.
6377 * Library/Order_Relation: new theory of various orderings as sets of
6378 pairs. Defines preorders, partial orders, linear orders and
6379 well-orders on sets and on types.
6384 * Renamed some theories to allow to loading both ZF and HOL in the
6387 Datatype -> Datatype_ZF
6388 Inductive -> Inductive_ZF
6395 INCOMPATIBILITY: ZF theories that import individual theories below
6396 Main might need to be adapted. Regular theory Main is still
6397 available, as trivial extension of Main_ZF.
6402 * ML within Isar: antiquotation @{const name} or @{const
6403 name(typargs)} produces statically-checked Const term.
6405 * Functor NamedThmsFun: data is available to the user as dynamic fact
6406 (of the same name). Removed obsolete print command.
6408 * Removed obsolete "use_legacy_bindings" function.
6410 * The ``print mode'' is now a thread-local value derived from a global
6411 template (the former print_mode reference), thus access becomes
6412 non-critical. The global print_mode reference is for session
6413 management only; user-code should use print_mode_value,
6414 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6416 * Functions system/system_out provide a robust way to invoke external
6417 shell commands, with propagation of interrupts (requires Poly/ML
6418 5.2.1). Do not use OS.Process.system etc. from the basis library!
6423 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6424 in accordance with Proof General 3.7, which prefers GNU emacs.
6426 * isatool tty runs Isabelle process with plain tty interaction;
6427 optional line editor may be specified via ISABELLE_LINE_EDITOR
6428 setting, the default settings attempt to locate "ledit" and "rlwrap".
6430 * isatool browser now works with Cygwin as well, using general
6431 "javapath" function defined in Isabelle process environment.
6433 * YXML notation provides a simple and efficient alternative to
6434 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6435 isatool yxml as described in the Isabelle system manual.
6437 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6438 provides general wrapper for managing an Isabelle process in a robust
6439 fashion, with ``cooked'' output from stdin/stderr.
6441 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6442 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6444 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6445 way of changing the user's settings is via
6446 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6449 * Multithreading.max_threads := 0 refers to the number of actual CPU
6450 cores of the underlying machine, which is a good starting point for
6451 optimal performance tuning. The corresponding usedir option -M allows
6452 "max" as an alias for "0". WARNING: does not work on certain versions
6453 of Mac OS (with Poly/ML 5.1).
6455 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6456 adverse effect of Isabelle flooding interactive front-ends (notably
6457 ProofGeneral / XEmacs).
6461 New in Isabelle2007 (November 2007)
6462 -----------------------------------
6466 * More uniform information about legacy features, notably a
6467 warning/error of "Legacy feature: ...", depending on the state of the
6468 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6469 legacy features will disappear eventually.
6471 * Theory syntax: the header format ``theory A = B + C:'' has been
6472 discontinued in favour of ``theory A imports B C begin''. Use isatool
6473 fixheaders to convert existing theory files. INCOMPATIBILITY.
6475 * Theory syntax: the old non-Isar theory file format has been
6476 discontinued altogether. Note that ML proof scripts may still be used
6477 with Isar theories; migration is usually quite simple with the ML
6478 function use_legacy_bindings. INCOMPATIBILITY.
6480 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6481 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6484 * Theory loader: be more serious about observing the static theory
6485 header specifications (including optional directories), but not the
6486 accidental file locations of previously successful loads. The strict
6487 update policy of former update_thy is now already performed by
6488 use_thy, so the former has been removed; use_thys updates several
6489 theories simultaneously, just as 'imports' within a theory header
6490 specification, but without merging the results. Potential
6491 INCOMPATIBILITY: may need to refine theory headers and commands
6492 ROOT.ML which depend on load order.
6494 * Theory loader: optional support for content-based file
6495 identification, instead of the traditional scheme of full physical
6496 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6497 (cf. the system manual). The new scheme allows to work with
6498 non-finished theories in persistent session images, such that source
6499 files may be moved later on without requiring reloads.
6501 * Theory loader: old-style ML proof scripts being *attached* to a thy
6502 file (with the same base name as the theory) are considered a legacy
6503 feature, which will disappear eventually. Even now, the theory loader
6504 no longer maintains dependencies on such files.
6506 * Syntax: the scope for resolving ambiguities via type-inference is
6507 now limited to individual terms, instead of whole simultaneous
6508 specifications as before. This greatly reduces the complexity of the
6509 syntax module and improves flexibility by separating parsing and
6510 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6511 'fixes' etc.) are required in rare situations.
6513 * Syntax: constants introduced by new-style packages ('definition',
6514 'abbreviation' etc.) are passed through the syntax module in
6515 ``authentic mode''. This means that associated mixfix annotations
6516 really stick to such constants, independently of potential name space
6517 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6518 trees are represented slightly differently, may need to adapt syntax
6519 translations accordingly. Use CONST marker in 'translations' and
6520 @{const_syntax} antiquotation in 'parse_translation' etc.
6522 * Legacy goal package: reduced interface to the bare minimum required
6523 to keep existing proof scripts running. Most other user-level
6524 functions are now part of the OldGoals structure, which is *not* open
6525 by default (consider isatool expandshort before open OldGoals).
6526 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6527 these tend to cause confusion about the actual goal (!) context being
6528 used here, which is not necessarily the same as the_context().
6530 * Command 'find_theorems': supports "*" wild-card in "name:"
6531 criterion; "with_dups" option. Certain ProofGeneral versions might
6532 support a specific search form (see ProofGeneral/CHANGES).
6534 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6535 by default, which means that "prems" (and also "fixed variables") are
6536 suppressed from proof state output. Note that the ProofGeneral
6537 settings mechanism allows to change and save options persistently, but
6538 older versions of Isabelle will fail to start up if a negative prems
6541 * Local theory targets may be specified by non-nested blocks of
6542 ``context/locale/class ... begin'' followed by ``end''. The body may
6543 contain definitions, theorems etc., including any derived mechanism
6544 that has been implemented on top of these primitives. This concept
6545 generalizes the existing ``theorem (in ...)'' towards more versatility
6548 * Proof General interface: proper undo of final 'end' command;
6549 discontinued Isabelle/classic mode (ML proof scripts).
6552 *** Document preparation ***
6554 * Added antiquotation @{theory name} which prints the given name,
6555 after checking that it refers to a valid ancestor theory in the
6558 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6559 check the given source text as ML type/structure, printing verbatim.
6561 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6562 "c args == rhs" given in the current context. (Any number of
6563 arguments may be given on the LHS.)
6568 * The 'class' package offers a combination of axclass and locale to
6569 achieve Haskell-like type classes in Isabelle. Definitions and
6570 theorems within a class context produce both relative results (with
6571 implicit parameters according to the locale context), and polymorphic
6572 constants with qualified polymorphism (according to the class
6573 context). Within the body context of a 'class' target, a separate
6574 syntax layer ("user space type system") takes care of converting
6575 between global polymorphic consts and internal locale representation.
6576 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6577 "isatool doc classes" provides a tutorial.
6579 * Generic code generator framework allows to generate executable
6580 code for ML and Haskell (including Isabelle classes). A short usage
6583 internal compilation:
6584 export_code <list of constants (term syntax)> in SML
6585 writing SML code to a file:
6586 export_code <list of constants (term syntax)> in SML <filename>
6587 writing OCaml code to a file:
6588 export_code <list of constants (term syntax)> in OCaml <filename>
6589 writing Haskell code to a bunch of files:
6590 export_code <list of constants (term syntax)> in Haskell <filename>
6592 evaluating closed propositions to True/False using code generation:
6595 Reasonable default setup of framework in HOL.
6597 Theorem attributs for selecting and transforming function equations theorems:
6599 [code fun]: select a theorem as function equation for a specific constant
6600 [code fun del]: deselect a theorem as function equation for a specific constant
6601 [code inline]: select an equation theorem for unfolding (inlining) in place
6602 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6604 User-defined serializations (target in {SML, OCaml, Haskell}):
6606 code_const <and-list of constants (term syntax)>
6607 {(target) <and-list of const target syntax>}+
6609 code_type <and-list of type constructors>
6610 {(target) <and-list of type target syntax>}+
6612 code_instance <and-list of instances>
6614 where instance ::= <type constructor> :: <class>
6616 code_class <and_list of classes>
6617 {(target) <and-list of class target syntax>}+
6618 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6620 code_instance and code_class only are effective to target Haskell.
6622 For example usage see src/HOL/ex/Codegenerator.thy and
6623 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6624 generation from Isabelle/HOL theories is available via "isatool doc
6627 * Code generator: consts in 'consts_code' Isar commands are now
6628 referred to by usual term syntax (including optional type
6631 * Command 'no_translations' removes translation rules from theory
6634 * Overloaded definitions are now actually checked for acyclic
6635 dependencies. The overloading scheme is slightly more general than
6636 that of Haskell98, although Isabelle does not demand an exact
6637 correspondence to type class and instance declarations.
6638 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6639 exotic versions of overloading -- at the discretion of the user!
6641 Polymorphic constants are represented via type arguments, i.e. the
6642 instantiation that matches an instance against the most general
6643 declaration given in the signature. For example, with the declaration
6644 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6645 as c(nat). Overloading is essentially simultaneous structural
6646 recursion over such type arguments. Incomplete specification patterns
6647 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6648 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6649 Command 'print_theory' outputs the normalized system of recursive
6650 equations, see section "definitions".
6652 * Configuration options are maintained within the theory or proof
6653 context (with name and type bool/int/string), providing a very simple
6654 interface to a poor-man's version of general context data. Tools may
6655 declare options in ML (e.g. using Attrib.config_int) and then refer to
6656 these values using Config.get etc. Users may change options via an
6657 associated attribute of the same name. This form of context
6658 declaration works particularly well with commands 'declare' or
6659 'using', for example ``declare [[foo = 42]]''. Thus it has become
6660 very easy to avoid global references, which would not observe Isar
6661 toplevel undo/redo and fail to work with multithreading.
6663 Various global ML references of Pure and HOL have been turned into
6664 configuration options:
6666 Unify.search_bound unify_search_bound
6667 Unify.trace_bound unify_trace_bound
6668 Unify.trace_simp unify_trace_simp
6669 Unify.trace_types unify_trace_types
6670 Simplifier.simp_depth_limit simp_depth_limit
6671 Blast.depth_limit blast_depth_limit
6672 DatatypeProp.dtK datatype_distinctness_limit
6673 fast_arith_neq_limit fast_arith_neq_limit
6674 fast_arith_split_limit fast_arith_split_limit
6676 * Named collections of theorems may be easily installed as context
6677 data using the functor NamedThmsFun (see also
6678 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6679 attributes; there is also a toplevel print command. This facility is
6680 just a common case of general context data, which is the preferred way
6681 for anything more complex than just a list of facts in canonical
6684 * Isar: command 'declaration' augments a local theory by generic
6685 declaration functions written in ML. This enables arbitrary content
6686 being added to the context, depending on a morphism that tells the
6687 difference of the original declaration context wrt. the application
6688 context encountered later on.
6690 * Isar: proper interfaces for simplification procedures. Command
6691 'simproc_setup' declares named simprocs (with match patterns, and body
6692 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6693 context. ML antiquotation @{simproc name} retrieves named simprocs.
6695 * Isar: an extra pair of brackets around attribute declarations
6696 abbreviates a theorem reference involving an internal dummy fact,
6697 which will be ignored later --- only the effect of the attribute on
6698 the background context will persist. This form of in-place
6699 declarations is particularly useful with commands like 'declare' and
6700 'using', for example ``have A using [[simproc a]] by simp''.
6702 * Isar: method "assumption" (and implicit closing of subproofs) now
6703 takes simple non-atomic goal assumptions into account: after applying
6704 an assumption as a rule the resulting subgoals are solved by atomic
6705 assumption steps. This is particularly useful to finish 'obtain'
6706 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6707 without referring to the original premise "!!x. P x ==> thesis" in the
6708 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6711 * Isar: implicit use of prems from the Isar proof context is
6712 considered a legacy feature. Common applications like ``have A .''
6713 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6714 referencing facts explicitly here improves readability and
6715 maintainability of proof texts.
6717 * Isar: improper proof element 'guess' is like 'obtain', but derives
6718 the obtained context from the course of reasoning! For example:
6720 assume "EX x y. A x & B y" -- "any previous fact"
6721 then guess x and y by clarify
6723 This technique is potentially adventurous, depending on the facts and
6724 proof tools being involved here.
6726 * Isar: known facts from the proof context may be specified as literal
6727 propositions, using ASCII back-quote syntax. This works wherever
6728 named facts used to be allowed so far, in proof commands, proof
6729 methods, attributes etc. Literal facts are retrieved from the context
6730 according to unification of type and term parameters. For example,
6731 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6732 theorems in the current context, then these are valid literal facts:
6733 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6735 There is also a proof method "fact" which does the same composition
6736 for explicit goal states, e.g. the following proof texts coincide with
6737 certain special cases of literal facts:
6739 have "A" by fact == note `A`
6740 have "A ==> B" by fact == note `A ==> B`
6741 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6742 have "P a ==> Q a" by fact == note `P a ==> Q a`
6744 * Isar: ":" (colon) is no longer a symbolic identifier character in
6745 outer syntax. Thus symbolic identifiers may be used without
6746 additional white space in declarations like this: ``assume *: A''.
6748 * Isar: 'print_facts' prints all local facts of the current context,
6749 both named and unnamed ones.
6751 * Isar: 'def' now admits simultaneous definitions, e.g.:
6753 def x == "t" and y == "u"
6755 * Isar: added command 'unfolding', which is structurally similar to
6756 'using', but affects both the goal state and facts by unfolding given
6757 rewrite rules. Thus many occurrences of the 'unfold' method or
6758 'unfolded' attribute may be replaced by first-class proof text.
6760 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6761 and command 'unfolding' now all support object-level equalities
6762 (potentially conditional). The underlying notion of rewrite rule is
6763 analogous to the 'rule_format' attribute, but *not* that of the
6764 Simplifier (which is usually more generous).
6766 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6767 premises of a theorem by n. Useful in conjunction with drule.
6769 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6770 method expression within a sandbox consisting of the first N
6771 sub-goals, which need to exist. For example, ``simp_all [3]''
6772 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6773 simplifies all new goals that emerge from applying rule foo to the
6774 originally first one.
6776 * Isar: schematic goals are no longer restricted to higher-order
6777 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6780 * Isar: the conclusion of a long theorem statement is now either
6781 'shows' (a simultaneous conjunction, as before), or 'obtains'
6782 (essentially a disjunction of cases with local parameters and
6783 assumptions). The latter allows to express general elimination rules
6784 adequately; in this notation common elimination rules look like this:
6786 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6788 obtains x where "P x"
6790 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6794 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6800 The subsequent classical rules even refer to the formal "thesis"
6803 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6806 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6807 obtains "thesis ==> something"
6809 The actual proof of an 'obtains' statement is analogous to that of the
6810 Isar proof element 'obtain', only that there may be several cases.
6811 Optional case names may be specified in parentheses; these will be
6812 available both in the present proof and as annotations in the
6813 resulting rule, for later use with the 'cases' method (cf. attribute
6816 * Isar: the assumptions of a long theorem statement are available as
6817 "assms" fact in the proof context. This is more appropriate than the
6818 (historical) "prems", which refers to all assumptions of the current
6819 context, including those from the target locale, proof body etc.
6821 * Isar: 'print_statement' prints theorems from the current theory or
6822 proof context in long statement form, according to the syntax of a
6825 * Isar: 'obtain' takes an optional case name for the local context
6826 introduction rule (default "that").
6828 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6829 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6832 * Pure: syntax "CONST name" produces a fully internalized constant
6833 according to the current context. This is particularly useful for
6834 syntax translations that should refer to internal constant
6835 representations independently of name spaces.
6837 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6838 instead of "FOO ". This allows multiple binder declarations to coexist
6839 in the same context. INCOMPATIBILITY.
6841 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6842 primitive that also works in a locale context (both for constants and
6843 fixed variables). Type declaration and internal syntactic representation
6844 of given constants retrieved from the context. Likewise, the
6845 'no_notation' command allows to remove given syntax annotations from the
6848 * Isar/locales: new derived specification elements 'axiomatization',
6849 'definition', 'abbreviation', which support type-inference, admit
6850 object-level specifications (equality, equivalence). See also the
6851 isar-ref manual. Examples:
6854 eq (infix "===" 50) where
6855 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6857 definition "f x y = x + y + 1"
6858 definition g where "g x = f x x"
6861 neq (infix "=!=" 50) where
6862 "x =!= y == ~ (x === y)"
6864 These specifications may be also used in a locale context. Then the
6865 constants being introduced depend on certain fixed parameters, and the
6866 constant name is qualified by the locale base name. An internal
6867 abbreviation takes care for convenient input and output, making the
6868 parameters implicit and using the original short name. See also
6869 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6870 entities from a monomorphic theory.
6872 Presently, abbreviations are only available 'in' a target locale, but
6873 not inherited by general import expressions. Also note that
6874 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6875 'translations' in common applications. The "no_abbrevs" print mode
6876 prevents folding of abbreviations in term output.
6878 Concrete syntax is attached to specified constants in internal form,
6879 independently of name spaces. The parse tree representation is
6880 slightly different -- use 'notation' instead of raw 'syntax', and
6881 'translations' with explicit "CONST" markup to accommodate this.
6883 * Pure/Isar: unified syntax for new-style specification mechanisms
6884 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6885 full type inference and dummy patterns ("_"). For example:
6887 definition "K x _ = x"
6889 inductive conj for A B
6890 where "A ==> B ==> conj A B"
6892 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6893 the current context. Print mode "no_abbrevs" prevents inversion of
6894 abbreviations on output.
6896 * Isar/locales: improved parameter handling: use of locales "var" and
6897 "struct" no longer necessary; - parameter renamings are no longer
6898 required to be injective. For example, this allows to define
6899 endomorphisms as locale endom = homom mult mult h.
6901 * Isar/locales: changed the way locales with predicates are defined.
6902 Instead of accumulating the specification, the imported expression is
6903 now an interpretation. INCOMPATIBILITY: different normal form of
6904 locale expressions. In particular, in interpretations of locales with
6905 predicates, goals repesenting already interpreted fragments are not
6906 removed automatically. Use methods `intro_locales' and
6907 `unfold_locales'; see below.
6909 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6910 provide backward reasoning on locales predicates. The methods are
6911 aware of interpretations and discharge corresponding goals.
6912 `intro_locales' is less aggressive then `unfold_locales' and does not
6913 unfold predicates to assumptions.
6915 * Isar/locales: the order in which locale fragments are accumulated
6916 has changed. This enables to override declarations from fragments due
6917 to interpretations -- for example, unwanted simp rules.
6919 * Isar/locales: interpretation in theories and proof contexts has been
6920 extended. One may now specify (and prove) equations, which are
6921 unfolded in interpreted theorems. This is useful for replacing
6922 defined concepts (constants depending on locale parameters) by
6923 concepts already existing in the target context. Example:
6925 interpretation partial_order ["op <= :: [int, int] => bool"]
6926 where "partial_order.less (op <=) (x::int) y = (x < y)"
6928 Typically, the constant `partial_order.less' is created by a
6929 definition specification element in the context of locale
6932 * Method "induct": improved internal context management to support
6933 local fixes and defines on-the-fly. Thus explicit meta-level
6934 connectives !! and ==> are rarely required anymore in inductive goals
6935 (using object-logic connectives for this purpose has been long
6936 obsolete anyway). Common proof patterns are explained in
6937 src/HOL/Induct/Common_Patterns.thy, see also
6938 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6941 * Method "induct": improved handling of simultaneous goals. Instead of
6942 introducing object-level conjunction, the statement is now split into
6943 several conclusions, while the corresponding symbolic cases are nested
6944 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6945 see src/HOL/Induct/Common_Patterns.thy, for example.
6947 * Method "induct": mutual induction rules are now specified as a list
6948 of rule sharing the same induction cases. HOL packages usually provide
6949 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6950 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6951 mutual induction rules differently, i.e. like this:
6953 (induct rule: foo_bar.inducts)
6954 (induct set: foo bar)
6955 (induct pred: foo bar)
6956 (induct type: foo bar)
6958 The ML function ProjectRule.projections turns old-style rules into the
6961 * Method "coinduct": dual of induction, see
6962 src/HOL/Library/Coinductive_List.thy for various examples.
6964 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6965 considered a legacy feature.
6967 * Attribute "symmetric" produces result with standardized schematic
6968 variables (index 0). Potential INCOMPATIBILITY.
6970 * Simplifier: by default the simplifier trace only shows top level
6971 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6972 default. Thus there is less danger of being flooded by the trace. The
6973 trace indicates where parts have been suppressed.
6975 * Provers/classical: removed obsolete classical version of elim_format
6976 attribute; classical elim/dest rules are now treated uniformly when
6977 manipulating the claset.
6979 * Provers/classical: stricter checks to ensure that supplied intro,
6980 dest and elim rules are well-formed; dest and elim rules must have at
6983 * Provers/classical: attributes dest/elim/intro take an optional
6984 weight argument for the rule (just as the Pure versions). Weights are
6985 ignored by automated tools, but determine the search order of single
6988 * Syntax: input syntax now supports dummy variable binding "%_. b",
6989 where the body does not mention the bound variable. Note that dummy
6990 patterns implicitly depend on their context of bounds, which makes
6991 "{_. _}" match any set comprehension as expected. Potential
6992 INCOMPATIBILITY -- parse translations need to cope with syntactic
6993 constant "_idtdummy" in the binding position.
6995 * Syntax: removed obsolete syntactic constant "_K" and its associated
6996 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6997 for example "A -> B" => "Pi A (%_. B)".
6999 * Pure: 'class_deps' command visualizes the subclass relation, using
7000 the graph browser tool.
7002 * Pure: 'print_theory' now suppresses certain internal declarations by
7003 default; use '!' option for full details.
7008 * Method "metis" proves goals by applying the Metis general-purpose
7009 resolution prover (see also http://gilith.com/software/metis/).
7010 Examples are in the directory MetisExamples. WARNING: the
7011 Isabelle/HOL-Metis integration does not yet work properly with
7014 * Command 'sledgehammer' invokes external automatic theorem provers as
7015 background processes. It generates calls to the "metis" method if
7016 successful. These can be pasted into the proof. Users do not have to
7017 wait for the automatic provers to return. WARNING: does not really
7018 work with multi-threading.
7020 * New "auto_quickcheck" feature tests outermost goal statements for
7021 potential counter-examples. Controlled by ML references
7022 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7023 5000 milliseconds). Fails silently if statements is outside of
7024 executable fragment, or any other codgenerator problem occurs.
7026 * New constant "undefined" with axiom "undefined x = undefined".
7028 * Added class "HOL.eq", allowing for code generation with polymorphic
7031 * Some renaming of class constants due to canonical name prefixing in
7032 the new 'class' package:
7034 HOL.abs ~> HOL.abs_class.abs
7035 HOL.divide ~> HOL.divide_class.divide
7036 0 ~> HOL.zero_class.zero
7037 1 ~> HOL.one_class.one
7038 op + ~> HOL.plus_class.plus
7039 op - ~> HOL.minus_class.minus
7040 uminus ~> HOL.minus_class.uminus
7041 op * ~> HOL.times_class.times
7042 op < ~> HOL.ord_class.less
7043 op <= > HOL.ord_class.less_eq
7044 Nat.power ~> Power.power_class.power
7045 Nat.size ~> Nat.size_class.size
7046 Numeral.number_of ~> Numeral.number_class.number_of
7047 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7048 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7049 Orderings.min ~> Orderings.ord_class.min
7050 Orderings.max ~> Orderings.ord_class.max
7051 Divides.op div ~> Divides.div_class.div
7052 Divides.op mod ~> Divides.div_class.mod
7053 Divides.op dvd ~> Divides.div_class.dvd
7055 INCOMPATIBILITY. Adaptions may be required in the following cases:
7057 a) User-defined constants using any of the names "plus", "minus",
7058 "times", "less" or "less_eq". The standard syntax translations for
7059 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7062 b) Variables named "plus", "minus", "times", "less", "less_eq"
7063 INCOMPATIBILITY: use more specific names.
7065 c) Permutative equations (e.g. "a + b = b + a")
7066 Since the change of names also changes the order of terms, permutative
7067 rewrite rules may get applied in a different order. Experience shows
7068 that this is rarely the case (only two adaptions in the whole Isabelle
7069 distribution). INCOMPATIBILITY: rewrite proofs
7071 d) ML code directly refering to constant names
7072 This in general only affects hand-written proof tactics, simprocs and
7073 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7074 Consider using @{const_name} antiquotation.
7076 * New class "default" with associated constant "default".
7078 * Function "sgn" is now overloaded and available on int, real, complex
7079 (and other numeric types), using class "sgn". Two possible defs of
7080 sgn are given as equational assumptions in the classes sgn_if and
7081 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7084 * Locale "partial_order" now unified with class "order" (cf. theory
7085 Orderings), added parameter "less". INCOMPATIBILITY.
7087 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7088 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7089 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7091 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7092 changed order of proof goals in instance proofs.
7094 * The transitivity reasoner for partial and linear orders is set up
7095 for classes "order" and "linorder". Instances of the reasoner are available
7096 in all contexts importing or interpreting the corresponding locales.
7097 Method "order" invokes the reasoner separately; the reasoner
7098 is also integrated with the Simplifier as a solver. Diagnostic
7099 command 'print_orders' shows the available instances of the reasoner
7100 in the current context.
7102 * Localized monotonicity predicate in theory "Orderings"; integrated
7103 lemmas max_of_mono and min_of_mono with this predicate.
7106 * Formulation of theorem "dense" changed slightly due to integration
7107 with new class dense_linear_order.
7109 * Uniform lattice theory development in HOL.
7111 constants "meet" and "join" now named "inf" and "sup"
7112 constant "Meet" now named "Inf"
7114 classes "meet_semilorder" and "join_semilorder" now named
7115 "lower_semilattice" and "upper_semilattice"
7116 class "lorder" now named "lattice"
7117 class "comp_lat" now named "complete_lattice"
7119 Instantiation of lattice classes allows explicit definitions
7120 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7122 INCOMPATIBILITY. Theorem renames:
7124 meet_left_le ~> inf_le1
7125 meet_right_le ~> inf_le2
7126 join_left_le ~> sup_ge1
7127 join_right_le ~> sup_ge2
7128 meet_join_le ~> inf_sup_ord
7131 le_meet ~> le_inf_iff
7132 le_join ~> ge_sup_conv
7133 meet_idempotent ~> inf_idem
7134 join_idempotent ~> sup_idem
7135 meet_comm ~> inf_commute
7136 join_comm ~> sup_commute
7137 meet_leI1 ~> le_infI1
7138 meet_leI2 ~> le_infI2
7139 le_joinI1 ~> le_supI1
7140 le_joinI2 ~> le_supI2
7141 meet_assoc ~> inf_assoc
7142 join_assoc ~> sup_assoc
7143 meet_left_comm ~> inf_left_commute
7144 meet_left_idempotent ~> inf_left_idem
7145 join_left_comm ~> sup_left_commute
7146 join_left_idempotent ~> sup_left_idem
7149 le_def_meet ~> le_iff_inf
7150 le_def_join ~> le_iff_sup
7151 join_absorp2 ~> sup_absorb2
7152 join_absorp1 ~> sup_absorb1
7153 meet_absorp1 ~> inf_absorb1
7154 meet_absorp2 ~> inf_absorb2
7155 meet_join_absorp ~> inf_sup_absorb
7156 join_meet_absorp ~> sup_inf_absorb
7157 distrib_join_le ~> distrib_sup_le
7158 distrib_meet_le ~> distrib_inf_le
7160 add_meet_distrib_left ~> add_inf_distrib_left
7161 add_join_distrib_left ~> add_sup_distrib_left
7162 is_join_neg_meet ~> is_join_neg_inf
7163 is_meet_neg_join ~> is_meet_neg_sup
7164 add_meet_distrib_right ~> add_inf_distrib_right
7165 add_join_distrib_right ~> add_sup_distrib_right
7166 add_meet_join_distribs ~> add_sup_inf_distribs
7167 join_eq_neg_meet ~> sup_eq_neg_inf
7168 meet_eq_neg_join ~> inf_eq_neg_sup
7169 add_eq_meet_join ~> add_eq_inf_sup
7170 meet_0_imp_0 ~> inf_0_imp_0
7171 join_0_imp_0 ~> sup_0_imp_0
7172 meet_0_eq_0 ~> inf_0_eq_0
7173 join_0_eq_0 ~> sup_0_eq_0
7174 neg_meet_eq_join ~> neg_inf_eq_sup
7175 neg_join_eq_meet ~> neg_sup_eq_inf
7176 join_eq_if ~> sup_eq_if
7178 mono_meet ~> mono_inf
7179 mono_join ~> mono_sup
7180 meet_bool_eq ~> inf_bool_eq
7181 join_bool_eq ~> sup_bool_eq
7182 meet_fun_eq ~> inf_fun_eq
7183 join_fun_eq ~> sup_fun_eq
7184 meet_set_eq ~> inf_set_eq
7185 join_set_eq ~> sup_set_eq
7186 meet1_iff ~> inf1_iff
7187 meet2_iff ~> inf2_iff
7196 join1_iff ~> sup1_iff
7197 join2_iff ~> sup2_iff
7207 is_meet_Meet ~> is_meet_Inf
7208 Meet_bool_def ~> Inf_bool_def
7209 Meet_fun_def ~> Inf_fun_def
7210 Meet_greatest ~> Inf_greatest
7211 Meet_lower ~> Inf_lower
7212 Meet_set_def ~> Inf_set_def
7215 Sup_bool_eq ~> Sup_bool_def
7216 Sup_fun_eq ~> Sup_fun_def
7217 Sup_set_eq ~> Sup_set_def
7219 listsp_meetI ~> listsp_infI
7220 listsp_meet_eq ~> listsp_inf_eq
7225 * Added syntactic class "size"; overloaded constant "size" now has
7226 type "'a::size ==> bool"
7228 * Internal reorganisation of `size' of datatypes: size theorems
7229 "foo.size" are no longer subsumed by "foo.simps" (but are still
7230 simplification rules by default!); theorems "prod.size" now named
7233 * Class "div" now inherits from class "times" rather than "type".
7236 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7237 Linorder etc. have disappeared; operations defined in terms of
7238 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7240 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7242 * HOL-Word: New extensive library and type for generic, fixed size
7243 machine words, with arithmetic, bit-wise, shifting and rotating
7244 operations, reflection into int, nat, and bool lists, automation for
7245 linear arithmetic (by automatic reflection into nat or int), including
7246 lemmas on overflow and monotonicity. Instantiated to all appropriate
7247 arithmetic type classes, supporting automatic simplification of
7248 numerals on all operations.
7250 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7252 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7254 * Code generator library theories:
7255 - Code_Integer represents HOL integers by big integer literals in target
7257 - Code_Char represents HOL characters by character literals in target
7259 - Code_Char_chr like Code_Char, but also offers treatment of character
7260 codes; includes Code_Integer.
7261 - Executable_Set allows to generate code for finite sets using lists.
7262 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7264 - Executable_Real implements a subset of real numbers, namly those
7265 representable by rational numbers.
7266 - Efficient_Nat implements natural numbers by integers, which in general will
7267 result in higher efficency; pattern matching with 0/Suc is eliminated;
7268 includes Code_Integer.
7269 - Code_Index provides an additional datatype index which is mapped to
7270 target-language built-in integers.
7271 - Code_Message provides an additional datatype message_string which is isomorphic to
7272 strings; messages are mapped to target-language strings.
7274 * New package for inductive predicates
7276 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7279 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7280 for z_1 :: U_1 and ... and z_n :: U_m
7282 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7285 with full support for type-inference, rather than
7287 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7289 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7290 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7292 inductive "s z_1 ... z_m"
7294 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7297 For backward compatibility, there is a wrapper allowing inductive
7298 sets to be defined with the new package via
7301 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7302 for z_1 :: U_1 and ... and z_n :: U_m
7304 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7310 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7311 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7312 for z_1 :: U_1 and ... and z_n :: U_m
7314 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7315 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7318 if the additional syntax "p ..." is required.
7320 Numerous examples can be found in the subdirectories src/HOL/Auth,
7321 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7325 - Since declaration and definition of inductive sets or predicates
7326 is no longer separated, abbreviations involving the newly
7327 introduced sets or predicates must be specified together with the
7328 introduction rules after the 'where' keyword (see above), rather
7329 than before the actual inductive definition.
7331 - The variables in induction and elimination rules are now
7332 quantified in the order of their occurrence in the introduction
7333 rules, rather than in alphabetical order. Since this may break
7334 some proofs, these proofs either have to be repaired, e.g. by
7335 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7336 statements of the form
7338 case (rule_i a_i_1 ... a_i_{k_i})
7340 or the old order of quantification has to be restored by explicitly adding
7341 meta-level quantifiers in the introduction rules, i.e.
7343 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7345 - The format of the elimination rules is now
7347 p z_1 ... z_m x_1 ... x_n ==>
7348 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7353 (x_1, ..., x_n) : s z_1 ... z_m ==>
7354 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7357 for sets rather than
7359 x : s z_1 ... z_m ==>
7360 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7363 This may require terms in goals to be expanded to n-tuples
7364 (e.g. using case_tac or simplification with the split_paired_all
7365 rule) before the above elimination rule is applicable.
7367 - The elimination or case analysis rules for (mutually) inductive
7368 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7369 list of rules "p_1_..._p_k.elims" is no longer available.
7371 * New package "function"/"fun" for general recursive functions,
7372 supporting mutual and nested recursion, definitions in local contexts,
7373 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7374 for small examples, and the separate tutorial on the function
7375 package. The old recdef "package" is still available as before, but
7376 users are encouraged to use the new package.
7378 * Method "lexicographic_order" automatically synthesizes termination
7379 relations as lexicographic combinations of size measures.
7381 * Case-expressions allow arbitrary constructor-patterns (including
7382 "_") and take their order into account, like in functional
7383 programming. Internally, this is translated into nested
7384 case-expressions; missing cases are added and mapped to the predefined
7385 constant "undefined". In complicated cases printing may no longer show
7386 the original input but the internal form. Lambda-abstractions allow
7387 the same form of pattern matching: "% pat1 => e1 | ..." is an
7388 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7391 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7392 is an abbreviation for "of_nat :: nat => int". The simplification
7393 rules for "of_nat" have been changed to work like "int" did
7394 previously. Potential INCOMPATIBILITY:
7395 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7396 - of_nat_diff and of_nat_mult are no longer default simp rules
7398 * Method "algebra" solves polynomial equations over (semi)rings using
7399 Groebner bases. The (semi)ring structure is defined by locales and the
7400 tool setup depends on that generic context. Installing the method for
7401 a specific type involves instantiating the locale and possibly adding
7402 declarations for computation on the coefficients. The method is
7403 already instantiated for natural numbers and for the axiomatic class
7404 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7405 CALCULEMUS 2007 for the general principles underlying this
7406 architecture of context-aware proof-tools.
7408 * Method "ferrack" implements quantifier elimination over
7409 special-purpose dense linear orders using locales (analogous to
7410 "algebra"). The method is already installed for class
7411 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7414 * Former constant "List.op @" now named "List.append". Use ML
7415 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7416 circumvent possible incompatibilities when working on ML level.
7418 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7420 * New function listsum :: 'a list => 'a for arbitrary monoids.
7421 Special syntax: "SUM x <- xs. f x" (and latex variants)
7423 * New syntax for Haskell-like list comprehension (input only), eg.
7424 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7426 * The special syntax for function "filter" has changed from [x :
7427 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7428 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7430 * [a..b] is now defined for arbitrary linear orders. It used to be
7431 defined on nat only, as an abbreviation for [a..<Suc b]
7434 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7436 * New functions "sorted" and "sort" in src/HOL/List.thy.
7438 * New lemma collection field_simps (an extension of ring_simps) for
7439 manipulating (in)equations involving division. Multiplies with all
7440 denominators that can be proved to be non-zero (in equations) or
7441 positive/negative (in inequations).
7443 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7444 have been improved and renamed to ring_simps, group_simps and
7445 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7446 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7448 * Theory Library/Commutative_Ring: switched from recdef to function
7449 package; constants add, mul, pow now curried. Infix syntax for
7450 algebraic operations.
7452 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7455 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7458 * HOL/records: generalised field-update to take a function on the
7459 field rather than the new value: r(|A := x|) is translated to A_update
7460 (K x) r The K-combinator that is internally used is called K_record.
7461 INCOMPATIBILITY: Usage of the plain update functions has to be
7464 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7465 * x = 0, which are required for a semiring. Richer structures do not
7466 inherit from semiring_0 anymore, because this property is a theorem
7467 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7468 there is more to prove, but this is mostly trivial.
7470 * Class "recpower" is generalized to arbitrary monoids, not just
7471 commutative semirings. INCOMPATIBILITY: may need to incorporate
7472 commutativity or semiring properties additionally.
7474 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7475 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7476 better use 'abbreviation'.
7478 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7480 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7481 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7482 significant changes for setting up numeral syntax for types:
7483 - New constants Numeral.pred and Numeral.succ instead
7484 of former Numeral.bin_pred and Numeral.bin_succ.
7485 - Use integer operations instead of bin_add, bin_mult and so on.
7486 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7487 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7489 See src/HOL/Integ/IntArith.thy for an example setup.
7491 * Command 'normal_form' computes the normal form of a term that may
7492 contain free variables. For example ``normal_form "rev [a, b, c]"''
7493 produces ``[b, c, a]'' (without proof). This command is suitable for
7494 heavy-duty computations because the functions are compiled to ML
7495 first. Correspondingly, a method "normalization" is provided. See
7496 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7498 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7499 25 like -->); output depends on the "iff" print_mode, the default is
7500 "A = B" (with priority 50).
7502 * Relations less (<) and less_eq (<=) are also available on type bool.
7503 Modified syntax to disallow nesting without explicit parentheses,
7504 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7507 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7509 * Relation composition operator "op O" now has precedence 75 and binds
7510 stronger than union and intersection. INCOMPATIBILITY.
7512 * The old set interval syntax "{m..n(}" (and relatives) has been
7513 removed. Use "{m..<n}" (and relatives) instead.
7515 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7516 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7517 ``declare [[simproc del: neq]]''.
7519 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7522 * Theorem Cons_eq_map_conv no longer declared as "simp".
7524 * Theorem setsum_mult renamed to setsum_right_distrib.
7526 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7529 * Reimplemented methods "sat" and "satx", with several improvements:
7530 goals no longer need to be stated as "<prems> ==> False", equivalences
7531 (i.e. "=" on type bool) are handled, variable names of the form
7532 "lit_<n>" are no longer reserved, significant speedup.
7534 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7535 zChaff is still supported as well.
7537 * 'inductive' and 'datatype': provide projections of mutual rules,
7538 bundled as foo_bar.inducts;
7540 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7543 * Library: moved theory Accessible_Part to main HOL.
7545 * Library: added theory Coinductive_List of potentially infinite lists
7546 as greatest fixed-point.
7548 * Library: added theory AssocList which implements (finite) maps as
7551 * Method "evaluation" solves goals (i.e. a boolean expression)
7552 efficiently by compiling it to ML. The goal is "proved" (via an
7553 oracle) if it evaluates to True.
7555 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7556 also when invoked by the simplifier. This results in the Simplifier
7557 being more powerful on arithmetic goals. INCOMPATIBILITY.
7558 Configuration option fast_arith_split_limit=0 recovers the old
7561 * Support for hex (0x20) and binary (0b1001) numerals.
7563 * New method: reify eqs (t), where eqs are equations for an
7564 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7565 parameter, computes a term s::'b and a list xs::'a list and proves the
7566 theorem I xs s = t. This is also known as reification or quoting. The
7567 resulting theorem is applied to the subgoal to substitute t with I xs
7568 s. If t is omitted, the subgoal itself is reified.
7570 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7571 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7572 where f is supposed to be a computable function (in the sense of code
7573 generattion). The method uses reify to compute s and xs as above then
7574 applies corr_thm and uses normalization by evaluation to "prove" f s =
7575 r and finally gets the theorem t = r, which is again applied to the
7576 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7578 * Reflection: Automatic reification now handels binding, an example is
7579 available in src/HOL/ex/ReflectionEx.thy
7581 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7582 command 'statespace' that is similar to 'record', but introduces an
7583 abstract specification based on the locale infrastructure instead of
7584 HOL types. This leads to extra flexibility in composing state spaces,
7585 in particular multiple inheritance and renaming of components.
7590 * Hyperreal: Functions root and sqrt are now defined on negative real
7591 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7592 Nonnegativity side conditions have been removed from many lemmas, so
7593 that more subgoals may now be solved by simplification; potential
7596 * Real: new type classes formalize real normed vector spaces and
7597 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7598 and norm :: 'a => real.
7600 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7601 reals into other types. The overloaded constant Reals :: 'a set is now
7602 defined as range of_real; potential INCOMPATIBILITY.
7604 * Real: proper support for ML code generation, including 'quickcheck'.
7605 Reals are implemented as arbitrary precision rationals.
7607 * Hyperreal: Several constants that previously worked only for the
7608 reals have been generalized, so they now work over arbitrary vector
7609 spaces. Type annotations may need to be added in some cases; potential
7612 Infinitesimal :: ('a::real_normed_vector) star set
7613 HFinite :: ('a::real_normed_vector) star set
7614 HInfinite :: ('a::real_normed_vector) star set
7615 approx :: ('a::real_normed_vector) star => 'a star => bool
7616 monad :: ('a::real_normed_vector) star => 'a star set
7617 galaxy :: ('a::real_normed_vector) star => 'a star set
7618 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7619 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7620 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7621 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7622 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7623 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7624 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7625 sgn :: 'a::real_normed_vector => 'a
7626 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7628 * Complex: Some complex-specific constants are now abbreviations for
7629 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7630 hnorm. Other constants have been entirely removed in favor of the
7631 polymorphic versions (INCOMPATIBILITY):
7635 HInfinite <-- CInfinite
7636 Infinitesimal <-- CInfinitesimal
7639 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7640 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7641 (ns)deriv <-- (ns)cderiv
7646 * Formalisation of ideals and the quotient construction over rings.
7648 * Order and lattice theory no longer based on records.
7651 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7652 greatest_closed. INCOMPATIBILITY.
7654 * Method algebra is now set up via an attribute. For examples see
7655 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7656 of algebraic structures.
7658 * Renamed theory CRing to Ring.
7663 * Substantial, yet incomplete support for nominal datatypes (binding
7664 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7665 src/HOL/Nominal/Examples. Prospective users should consult
7666 http://isabelle.in.tum.de/nominal/
7671 * ML basics: just one true type int, which coincides with IntInf.int
7674 * ML within Isar: antiquotations allow to embed statically-checked
7675 formal entities in the source, referring to the context available at
7676 compile-time. For example:
7678 ML {* @{sort "{zero,one}"} *}
7679 ML {* @{typ "'a => 'b"} *}
7680 ML {* @{term "%x. x"} *}
7681 ML {* @{prop "x == y"} *}
7682 ML {* @{ctyp "'a => 'b"} *}
7683 ML {* @{cterm "%x. x"} *}
7684 ML {* @{cprop "x == y"} *}
7685 ML {* @{thm asm_rl} *}
7686 ML {* @{thms asm_rl} *}
7687 ML {* @{type_name c} *}
7688 ML {* @{type_syntax c} *}
7689 ML {* @{const_name c} *}
7690 ML {* @{const_syntax c} *}
7693 ML {* @{theory Pure} *}
7694 ML {* @{theory_ref} *}
7695 ML {* @{theory_ref Pure} *}
7698 ML {* @{clasimpset} *}
7700 The same works for sources being ``used'' within an Isar context.
7702 * ML in Isar: improved error reporting; extra verbosity with
7703 ML_Context.trace enabled.
7705 * Pure/General/table.ML: the join operations now works via exceptions
7706 DUP/SAME instead of type option. This is simpler in simple cases, and
7707 admits slightly more efficient complex applications.
7709 * Pure: 'advanced' translation functions (parse_translation etc.) now
7710 use Context.generic instead of just theory.
7712 * Pure: datatype Context.generic joins theory/Proof.context and
7713 provides some facilities for code that works in either kind of
7714 context, notably GenericDataFun for uniform theory and proof data.
7716 * Pure: simplified internal attribute type, which is now always
7717 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7718 local (Proof.context) attributes have been discontinued, while
7719 minimizing code duplication. Thm.rule_attribute and
7720 Thm.declaration_attribute build canonical attributes; see also structure
7721 Context for further operations on Context.generic, notably
7722 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7723 declarations and definitions.
7725 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7726 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7727 init only required for impure data. INCOMPATIBILITY: empty really need
7728 to be empty (no dependencies on theory content!)
7730 * Pure/kernel: consts certification ignores sort constraints given in
7731 signature declarations. (This information is not relevant to the
7732 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7733 potential INCOMPATIBILITY.
7735 * Pure: axiomatic type classes are now purely definitional, with
7736 explicit proofs of class axioms and super class relations performed
7737 internally. See Pure/axclass.ML for the main internal interfaces --
7738 notably AxClass.define_class supercedes AxClass.add_axclass, and
7739 AxClass.axiomatize_class/classrel/arity supersede
7740 Sign.add_classes/classrel/arities.
7742 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7743 global/local versions on theory vs. Proof.context have been
7744 discontinued; Attrib.syntax and Method.syntax have been adapted
7745 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7746 attributes, methods, etc.
7748 * Pure: several functions of signature "... -> theory -> theory * ..."
7749 have been reoriented to "... -> theory -> ... * theory" in order to
7750 allow natural usage in combination with the ||>, ||>>, |-> and
7751 fold_map combinators.
7753 * Pure: official theorem names (closed derivations) and additional
7754 comments (tags) are now strictly separate. Name hints -- which are
7755 maintained as tags -- may be attached any time without affecting the
7758 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7759 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7760 achieve the old behaviour.
7762 * Pure: the "Goal" constant is now called "prop", supporting a
7763 slightly more general idea of ``protecting'' meta-level rule
7766 * Pure: Logic.(un)varify only works in a global context, which is now
7767 enforced instead of silently assumed. INCOMPATIBILITY, may use
7768 Logic.legacy_(un)varify as temporary workaround.
7770 * Pure: structure Name provides scalable operations for generating
7771 internal variable names, notably Name.variants etc. This replaces
7772 some popular functions from term.ML:
7774 Term.variant -> Name.variant
7775 Term.variantlist -> Name.variant_list
7776 Term.invent_names -> Name.invent_list
7778 Note that low-level renaming rarely occurs in new code -- operations
7779 from structure Variable are used instead (see below).
7781 * Pure: structure Variable provides fundamental operations for proper
7782 treatment of fixed/schematic variables in a context. For example,
7783 Variable.import introduces fixes for schematics of given facts and
7784 Variable.export reverses the effect (up to renaming) -- this replaces
7785 various freeze_thaw operations.
7787 * Pure: structure Goal provides simple interfaces for
7788 init/conclude/finish and tactical prove operations (replacing former
7789 Tactic.prove). Goal.prove is the canonical way to prove results
7790 within a given context; Goal.prove_global is a degraded version for
7791 theory level goals, including a global Drule.standard. Note that
7792 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7793 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7794 in a locale context).
7796 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7797 and type checking (Syntax.check_term etc.), with common combinations
7798 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7799 which are considered legacy and await removal.
7801 * Pure/Syntax: generic interfaces for type unchecking
7802 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7803 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7804 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7805 available for convenience, but refer to the very same operations using
7806 a mere theory instead of a full context.
7808 * Isar: simplified treatment of user-level errors, using exception
7809 ERROR of string uniformly. Function error now merely raises ERROR,
7810 without any side effect on output channels. The Isar toplevel takes
7811 care of proper display of ERROR exceptions. ML code may use plain
7812 handle/can/try; cat_error may be used to concatenate errors like this:
7814 ... handle ERROR msg => cat_error msg "..."
7816 Toplevel ML code (run directly or through the Isar toplevel) may be
7817 embedded into the Isar toplevel with exception display/debug like
7820 Isar.toplevel (fn () => ...)
7822 INCOMPATIBILITY, removed special transform_error facilities, removed
7823 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7824 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7825 -- use plain ERROR instead.
7827 * Isar: theory setup now has type (theory -> theory), instead of a
7828 list. INCOMPATIBILITY, may use #> to compose setup functions.
7830 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7831 ProofContext.debug/verbose flags.
7833 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7834 theory before entering a proof state. Transactions now always see a
7835 quasi-functional intermediate checkpoint, both in interactive and
7838 * Isar: simplified interfaces for outer syntax. Renamed
7839 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7840 OuterSyntax.add_parsers -- this functionality is now included in
7841 OuterSyntax.command etc. INCOMPATIBILITY.
7843 * Simplifier: the simpset of a running simplification process now
7844 contains a proof context (cf. Simplifier.the_context), which is the
7845 very context that the initial simpset has been retrieved from (by
7846 simpset_of/local_simpset_of). Consequently, all plug-in components
7847 (solver, looper etc.) may depend on arbitrary proof data.
7849 * Simplifier.inherit_context inherits the proof context (plus the
7850 local bounds) of the current simplification process; any simproc
7851 etc. that calls the Simplifier recursively should do this! Removed
7852 former Simplifier.inherit_bounds, which is already included here --
7853 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7854 specify an explicit context using Simplifier.context/theory_context.
7856 * Simplifier/Classical Reasoner: more abstract interfaces
7857 change_simpset/claset for modifying the simpset/claset reference of a
7858 theory; raw versions simpset/claset_ref etc. have been discontinued --
7861 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7867 * settings: the default heap location within ISABELLE_HOME_USER now
7868 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7869 Isabelle installations.
7871 * isabelle-process: option -S (secure mode) disables some critical
7872 operations, notably runtime compilation and evaluation of ML source
7875 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7877 * Support for parallel execution, using native multicore support of
7878 Poly/ML 5.1. The theory loader exploits parallelism when processing
7879 independent theories, according to the given theory header
7880 specifications. The maximum number of worker threads is specified via
7881 usedir option -M or the "max-threads" setting in Proof General. A
7882 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7883 to 6 on a 8-core machine. User-code needs to observe certain
7884 guidelines for thread-safe programming, see appendix A in the Isar
7885 Implementation manual.
7889 New in Isabelle2005 (October 2005)
7890 ----------------------------------
7894 * Theory headers: the new header syntax for Isar theories is
7897 imports <theory1> ... <theoryN>
7898 uses <file1> ... <fileM>
7901 where the 'uses' part is optional. The previous syntax
7903 theory <name> = <theory1> + ... + <theoryN>:
7905 will disappear in the next release. Use isatool fixheaders to convert
7906 existing theory files. Note that there is no change in ancient
7907 non-Isar theories now, but these will disappear soon.
7909 * Theory loader: parent theories can now also be referred to via
7910 relative and absolute paths.
7912 * Command 'find_theorems' searches for a list of criteria instead of a
7913 list of constants. Known criteria are: intro, elim, dest, name:string,
7914 simp:term, and any term. Criteria can be preceded by '-' to select
7915 theorems that do not match. Intro, elim, dest select theorems that
7916 match the current goal, name:s selects theorems whose fully qualified
7917 name contain s, and simp:term selects all simplification rules whose
7918 lhs match term. Any other term is interpreted as pattern and selects
7919 all theorems matching the pattern. Available in ProofGeneral under
7920 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7922 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7924 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7925 matching the current goal as introduction rule and not having "HOL."
7926 in their name (i.e. not being defined in theory HOL).
7928 * Command 'thms_containing' has been discontinued in favour of
7929 'find_theorems'; INCOMPATIBILITY.
7931 * Communication with Proof General is now 8bit clean, which means that
7932 Unicode text in UTF-8 encoding may be used within theory texts (both
7933 formal and informal parts). Cf. option -U of the Isabelle Proof
7934 General interface. Here are some simple examples (cf. src/HOL/ex):
7936 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7937 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7939 * Improved efficiency of the Simplifier and, to a lesser degree, the
7940 Classical Reasoner. Typical big applications run around 2 times
7944 *** Document preparation ***
7946 * Commands 'display_drafts' and 'print_drafts' perform simple output
7947 of raw sources. Only those symbols that do not require additional
7948 LaTeX packages (depending on comments in isabellesym.sty) are
7949 displayed properly, everything else is left verbatim. isatool display
7950 and isatool print are used as front ends (these are subject to the
7951 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7953 * Command tags control specific markup of certain regions of text,
7954 notably folding and hiding. Predefined tags include "theory" (for
7955 theory begin and end), "proof" for proof commands, and "ML" for
7956 commands involving ML code; the additional tags "visible" and
7957 "invisible" are unused by default. Users may give explicit tag
7958 specifications in the text, e.g. ''by %invisible (auto)''. The
7959 interpretation of tags is determined by the LaTeX job during document
7960 preparation: see option -V of isatool usedir, or options -n and -t of
7961 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7964 Several document versions may be produced at the same time via isatool
7965 usedir (the generated index.html will link all of them). Typical
7966 specifications include ''-V document=theory,proof,ML'' to present
7967 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7968 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7969 these parts without any formal replacement text. The Isabelle site
7970 default settings produce ''document'' and ''outline'' versions as
7973 * Several new antiquotations:
7975 @{term_type term} prints a term with its type annotated;
7977 @{typeof term} prints the type of a term;
7979 @{const const} is the same as @{term const}, but checks that the
7980 argument is a known logical constant;
7982 @{term_style style term} and @{thm_style style thm} print a term or
7983 theorem applying a "style" to it
7987 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7988 definitions, equations, inequations etc., 'concl' printing only the
7989 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7990 to print the specified premise. TermStyle.add_style provides an ML
7991 interface for introducing further styles. See also the "LaTeX Sugar"
7992 document practical applications. The ML antiquotation prints
7993 type-checked ML expressions verbatim.
7995 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7996 and 'text' support optional locale specification '(in loc)', which
7997 specifies the default context for interpreting antiquotations. For
7998 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8000 * Option 'locale=NAME' of antiquotations specifies an alternative
8001 context interpreting the subsequent argument. For example: @{thm
8002 [locale=lattice] inf_assoc}.
8004 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8007 * Proper output of antiquotations for theory commands involving a
8008 proof context (such as 'locale' or 'theorem (in loc) ...').
8010 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8011 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8013 * isatool usedir: new option -C (default true) controls whether option
8014 -D should include a copy of the original document directory; -C false
8015 prevents unwanted effects such as copying of administrative CVS data.
8020 * Considerably improved version of 'constdefs' command. Now performs
8021 automatic type-inference of declared constants; additional support for
8022 local structure declarations (cf. locales and HOL records), see also
8023 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8024 sequential dependencies of definitions within a single 'constdefs'
8025 section; moreover, the declared name needs to be an identifier. If
8026 all fails, consider to fall back on 'consts' and 'defs' separately.
8028 * Improved indexed syntax and implicit structures. First of all,
8029 indexed syntax provides a notational device for subscripted
8030 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8031 expressions. Secondly, in a local context with structure
8032 declarations, number indexes \<^sub>n or the empty index (default
8033 number 1) refer to a certain fixed variable implicitly; option
8034 show_structs controls printing of implicit structures. Typical
8035 applications of these concepts involve record types and locales.
8037 * New command 'no_syntax' removes grammar declarations (and
8038 translations) resulting from the given syntax specification, which is
8039 interpreted in the same manner as for the 'syntax' command.
8041 * 'Advanced' translation functions (parse_translation etc.) may depend
8042 on the signature of the theory context being presently used for
8043 parsing/printing, see also isar-ref manual.
8045 * Improved 'oracle' command provides a type-safe interface to turn an
8046 ML expression of type theory -> T -> term into a primitive rule of
8047 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8048 is already included here); see also FOL/ex/IffExample.thy;
8051 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8052 before); "cI" is no longer bound, use "c.intro" instead.
8053 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8054 axclasses vs. locales.
8056 * Improved internal renaming of symbolic identifiers -- attach primes
8057 instead of base 26 numbers.
8059 * New flag show_question_marks controls printing of leading question
8060 marks in schematic variable names.
8062 * In schematic variable names, *any* symbol following \<^isub> or
8063 \<^isup> is now treated as part of the base name. For example, the
8064 following works without printing of awkward ".0" indexes:
8066 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8069 * Inner syntax includes (*(*nested*) comments*).
8071 * Pretty printer now supports unbreakable blocks, specified in mixfix
8072 annotations as "(00...)".
8074 * Clear separation of logical types and nonterminals, where the latter
8075 may only occur in 'syntax' specifications or type abbreviations.
8076 Before that distinction was only partially implemented via type class
8077 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8078 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8079 exotic syntax specifications may require further adaption
8080 (e.g. Cube/Cube.thy).
8082 * Removed obsolete type class "logic", use the top sort {} instead.
8083 Note that non-logical types should be declared as 'nonterminals'
8084 rather than 'types'. INCOMPATIBILITY for new object-logic
8087 * Attributes 'induct' and 'cases': type or set names may now be
8088 locally fixed variables as well.
8090 * Simplifier: can now control the depth to which conditional rewriting
8091 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8094 * Simplifier: simplification procedures may now take the current
8095 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8096 interface), which is very useful for calling the Simplifier
8097 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8098 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8099 low-level mk_simproc no longer applies Logic.varify internally, to
8100 allow for use in a context of fixed variables.
8102 * thin_tac now works even if the assumption being deleted contains !!
8103 or ==>. More generally, erule now works even if the major premise of
8104 the elimination rule contains !! or ==>.
8106 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8108 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8109 from Pure, which contains all common declarations already. Both
8110 theories are defined via plain Isabelle/Isar .thy files.
8111 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8112 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8113 use isatool fixcpure to adapt your theory and ML sources.
8115 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8116 selections of theorems in named facts via index ranges.
8118 * 'print_theorems': in theory mode, really print the difference
8119 wrt. the last state (works for interactive theory development only),
8120 in proof mode print all local facts (cf. 'print_facts');
8122 * 'hide': option '(open)' hides only base names.
8124 * More efficient treatment of intermediate checkpoints in interactive
8127 * Code generator is now invoked via code_module (incremental code
8128 generation) and code_library (modular code generation, ML structures
8129 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8130 must be quoted when used as identifiers.
8132 * New 'value' command for reading, evaluating and printing terms using
8133 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8134 quoted when used as identifier.
8139 * New commands for the interpretation of locale expressions in
8140 theories (1), locales (2) and proof contexts (3). These generate
8141 proof obligations from the expression specification. After the
8142 obligations have been discharged, theorems of the expression are added
8143 to the theory, target locale or proof context. The synopsis of the
8144 commands is a follows:
8146 (1) interpretation expr inst
8147 (2) interpretation target < expr
8148 (3) interpret expr inst
8150 Interpretation in theories and proof contexts require a parameter
8151 instantiation of terms from the current context. This is applied to
8152 specifications and theorems of the interpreted expression.
8153 Interpretation in locales only permits parameter renaming through the
8154 locale expression. Interpretation is smart in that interpretations
8155 that are active already do not occur in proof obligations, neither are
8156 instantiated theorems stored in duplicate. Use 'print_interps' to
8157 inspect active interpretations of a particular locale. For details,
8158 see the Isar Reference manual. Examples can be found in
8159 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8161 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8162 'interpret' instead.
8164 * New context element 'constrains' for adding type constraints to
8167 * Context expressions: renaming of parameters with syntax
8170 * Locale declaration: 'includes' disallowed.
8172 * Proper static binding of attribute syntax -- i.e. types / terms /
8173 facts mentioned as arguments are always those of the locale definition
8174 context, independently of the context of later invocations. Moreover,
8175 locale operations (renaming and type / term instantiation) are applied
8176 to attribute arguments as expected.
8178 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8179 actual attributes; rare situations may require Attrib.attribute to
8180 embed those attributes into Attrib.src that lack concrete syntax.
8181 Attribute implementations need to cooperate properly with the static
8182 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8183 Attrib.XXX_thm etc. already do the right thing without further
8184 intervention. Only unusual applications -- such as "where" or "of"
8185 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8186 on the context and the facts involved -- may have to assign parsed
8187 values to argument tokens explicitly.
8189 * Changed parameter management in theorem generation for long goal
8190 statements with 'includes'. INCOMPATIBILITY: produces a different
8191 theorem statement in rare situations.
8193 * Locale inspection command 'print_locale' omits notes elements. Use
8194 'print_locale!' to have them included in the output.
8199 * Provers/hypsubst.ML: improved version of the subst method, for
8200 single-step rewriting: it now works in bound variable contexts. New is
8201 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8202 rewrite a different subterm than the original subst method, which is
8203 still available as 'simplesubst'.
8205 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8208 * Provers/trancl.ML: new transitivity reasoner for transitive and
8209 reflexive-transitive closure of relations.
8211 * Provers/blast.ML: new reference depth_limit to make blast's depth
8212 limit (previously hard-coded with a value of 20) user-definable.
8214 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8215 is peformed already. Object-logics merely need to finish their
8216 initial simpset configuration as before. INCOMPATIBILITY.
8221 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8224 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8226 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8227 and x-symbol; use option '-m epsilon' to get it actually printed.
8228 Moreover, the mathematically important symbolic identifier \<epsilon>
8229 becomes available as variable, constant etc. INCOMPATIBILITY,
8231 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8232 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8233 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8234 support corresponding Isar calculations.
8236 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8239 * theory SetInterval: changed the syntax for open intervals:
8248 The old syntax is still supported but will disappear in the next
8249 release. For conversion use the following Emacs search and replace
8250 patterns (these are not perfect but work quite well):
8252 {)\([^\.]*\)\.\. -> {\1<\.\.}
8253 \.\.\([^(}]*\)(} -> \.\.<\1}
8255 * Theory Commutative_Ring (in Library): method comm_ring for proving
8256 equalities in commutative rings; method 'algebra' provides a generic
8259 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8260 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8261 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8264 Some new syntax forms are available:
8266 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8267 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8268 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8269 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8271 The latter form "\<Sum>x < k. e" used to be based on a separate
8272 function "Summation", which has been discontinued.
8274 * theory Finite_Set: in structured induction proofs, the insert case
8275 is now 'case (insert x F)' instead of the old counterintuitive 'case
8278 * The 'refute' command has been extended to support a much larger
8279 fragment of HOL, including axiomatic type classes, constdefs and
8280 typedefs, inductive datatypes and recursion.
8282 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8283 Requires zChaff with proof generation to be installed. See
8284 HOL/ex/SAT_Examples.thy for examples.
8286 * Datatype induction via method 'induct' now preserves the name of the
8287 induction variable. For example, when proving P(xs::'a list) by
8288 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8289 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8290 in unstructured proof scripts.
8292 * Reworked implementation of records. Improved scalability for
8293 records with many fields, avoiding performance problems for type
8294 inference. Records are no longer composed of nested field types, but
8295 of nested extension types. Therefore the record type only grows linear
8296 in the number of extensions and not in the number of fields. The
8297 top-level (users) view on records is preserved. Potential
8298 INCOMPATIBILITY only in strange cases, where the theory depends on the
8299 old record representation. The type generated for a record is called
8300 <record_name>_ext_type.
8302 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8303 proofs triggered by a record definition or a simproc (if
8304 quick_and_dirty is enabled). Definitions of large records can take
8307 New simproc record_upd_simproc for simplification of multiple record
8308 updates enabled by default. Moreover, trivial updates are also
8309 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8310 occasionally, since simplification is more powerful by default.
8312 * typedef: proper support for polymorphic sets, which contain extra
8313 type-variables in the term.
8315 * Simplifier: automatically reasons about transitivity chains
8316 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8317 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8318 old proofs break occasionally as simplification may now solve more
8319 goals than previously.
8321 * Simplifier: converts x <= y into x = y if assumption y <= x is
8322 present. Works for all partial orders (class "order"), in particular
8323 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8326 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8327 bound variable or a constant then the let is unfolded. Otherwise
8328 first a is simplified to b, and then f b is simplified to g. If
8329 possible we abstract b from g arriving at "let x = b in h x",
8330 otherwise we unfold the let and arrive at g. The simproc can be
8331 enabled/disabled by the reference use_let_simproc. Potential
8332 INCOMPATIBILITY since simplification is more powerful by default.
8334 * Classical reasoning: the meson method now accepts theorems as arguments.
8336 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8337 jobs to provide advice on the provability of subgoals.
8339 * Theory OrderedGroup and Ring_and_Field: various additions and
8340 improvements to faciliate calculations involving equalities and
8343 The following theorems have been eliminated or modified
8346 abs_eq now named abs_of_nonneg
8347 abs_of_ge_0 now named abs_of_nonneg
8348 abs_minus_eq now named abs_of_nonpos
8349 imp_abs_id now named abs_of_nonneg
8350 imp_abs_neg_id now named abs_of_nonpos
8351 mult_pos now named mult_pos_pos
8352 mult_pos_le now named mult_nonneg_nonneg
8353 mult_pos_neg_le now named mult_nonneg_nonpos
8354 mult_pos_neg2_le now named mult_nonneg_nonpos2
8355 mult_neg now named mult_neg_neg
8356 mult_neg_le now named mult_nonpos_nonpos
8358 * The following lemmas in Ring_and_Field have been added to the simplifier:
8361 not_square_less_zero
8363 The following lemmas have been deleted from Real/RealPow:
8373 * Theory Parity: added rules for simplifying exponents.
8377 The following theorems have been eliminated or modified
8380 list_all_Nil now named list_all.simps(1)
8381 list_all_Cons now named list_all.simps(2)
8382 list_all_conv now named list_all_iff
8383 set_mem_eq now named mem_iff
8385 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8386 asymptotic "big O" calculations. See the notes in BigO.thy.
8391 * Theory RealDef: better support for embedding natural numbers and
8392 integers in the reals.
8394 The following theorems have been eliminated or modified
8397 exp_ge_add_one_self now requires no hypotheses
8398 real_of_int_add reversed direction of equality (use [symmetric])
8399 real_of_int_minus reversed direction of equality (use [symmetric])
8400 real_of_int_diff reversed direction of equality (use [symmetric])
8401 real_of_int_mult reversed direction of equality (use [symmetric])
8403 * Theory RComplete: expanded support for floor and ceiling functions.
8405 * Theory Ln is new, with properties of the natural logarithm
8407 * Hyperreal: There is a new type constructor "star" for making
8408 nonstandard types. The old type names are now type synonyms:
8412 hcomplex = complex star
8414 * Hyperreal: Many groups of similarly-defined constants have been
8415 replaced by polymorphic versions (INCOMPATIBILITY):
8417 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8419 starset <-- starsetNat, starsetC
8420 *s* <-- *sNat*, *sc*
8421 starset_n <-- starsetNat_n, starsetC_n
8422 *sn* <-- *sNatn*, *scn*
8423 InternalSets <-- InternalNatSets, InternalCSets
8425 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8426 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8427 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8428 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8429 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8431 * Hyperreal: Many type-specific theorems have been removed in favor of
8432 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8434 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8435 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8436 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8437 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8438 right_minus <-- hypreal_add_minus
8439 left_minus <-- {hypreal,hcomplex}_add_minus_left
8440 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8441 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8442 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8443 mult_1_right <-- hcomplex_mult_one_right
8444 mult_zero_left <-- hcomplex_mult_zero_left
8445 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8446 right_distrib <-- hypnat_add_mult_distrib2
8447 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8448 right_inverse <-- hypreal_mult_inverse
8449 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8450 order_refl <-- {hypreal,hypnat}_le_refl
8451 order_trans <-- {hypreal,hypnat}_le_trans
8452 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8453 order_less_le <-- {hypreal,hypnat}_less_le
8454 linorder_linear <-- {hypreal,hypnat}_le_linear
8455 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8456 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8457 add_nonneg_nonneg <-- hypreal_le_add_order
8459 * Hyperreal: Separate theorems having to do with type-specific
8460 versions of constants have been merged into theorems that apply to the
8461 new polymorphic constants (INCOMPATIBILITY):
8463 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8464 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8465 STAR_Un <-- {STAR,NatStar,STARC}_Un
8466 STAR_Int <-- {STAR,NatStar,STARC}_Int
8467 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8468 STAR_subset <-- {STAR,NatStar,STARC}_subset
8469 STAR_mem <-- {STAR,NatStar,STARC}_mem
8470 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8471 STAR_diff <-- {STAR,STARC}_diff
8472 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8473 STARC_hcomplex_of_complex}_image_subset
8474 starset_n_Un <-- starset{Nat,C}_n_Un
8475 starset_n_Int <-- starset{Nat,C}_n_Int
8476 starset_n_Compl <-- starset{Nat,C}_n_Compl
8477 starset_n_diff <-- starset{Nat,C}_n_diff
8478 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8479 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8480 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8481 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8482 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8483 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8484 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8485 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8486 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8487 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8488 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8489 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8490 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8491 starfun_diff <-- starfun{C,RC,CR}_diff
8492 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8493 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8494 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8495 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8496 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8497 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8498 starfun_Id <-- starfunC_Id
8499 starfun_approx <-- starfun{Nat,CR}_approx
8500 starfun_capprox <-- starfun{C,RC}_capprox
8501 starfun_abs <-- starfunNat_rabs
8502 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8503 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8504 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8505 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8506 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8507 starfun_add_approx <-- starfunCR_add_approx
8508 starfun_inverse_inverse <-- starfunC_inverse_inverse
8509 starfun_divide <-- starfun{C,CR,RC}_divide
8510 starfun_n <-- starfun{Nat,C}_n
8511 starfun_n_mult <-- starfun{Nat,C}_n_mult
8512 starfun_n_add <-- starfun{Nat,C}_n_add
8513 starfun_n_add_minus <-- starfunNat_n_add_minus
8514 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8515 starfun_n_minus <-- starfun{Nat,C}_n_minus
8516 starfun_n_eq <-- starfun{Nat,C}_n_eq
8518 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8519 star_n_minus <-- {hypreal,hcomplex}_minus
8520 star_n_diff <-- {hypreal,hcomplex}_diff
8521 star_n_mult <-- {hypreal,hcomplex}_mult
8522 star_n_inverse <-- {hypreal,hcomplex}_inverse
8523 star_n_le <-- {hypreal,hypnat}_le
8524 star_n_less <-- {hypreal,hypnat}_less
8525 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8526 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8527 star_n_abs <-- hypreal_hrabs
8528 star_n_divide <-- hcomplex_divide
8530 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8531 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8532 star_of_diff <-- hypreal_of_real_diff
8533 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8534 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8535 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8536 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8537 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8538 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8539 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8540 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8541 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8542 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8543 star_of_number_of <-- {hypreal,hcomplex}_number_of
8544 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8545 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8546 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8547 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8548 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8549 star_of_power <-- hypreal_of_real_power
8550 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8552 * Hyperreal: new method "transfer" that implements the transfer
8553 principle of nonstandard analysis. With a subgoal that mentions
8554 nonstandard types like "'a star", the command "apply transfer"
8555 replaces it with an equivalent one that mentions only standard types.
8556 To be successful, all free variables must have standard types; non-
8557 standard variables must have explicit universal quantifiers.
8559 * Hyperreal: A theory of Taylor series.
8564 * Discontinued special version of 'constdefs' (which used to support
8565 continuous functions) in favor of the general Pure one with full
8568 * New simplification procedure for solving continuity conditions; it
8569 is much faster on terms with many nested lambda abstractions (cubic
8570 instead of exponential time).
8572 * New syntax for domain package: selector names are now optional.
8573 Parentheses should be omitted unless argument is lazy, for example:
8575 domain 'a stream = cons "'a" (lazy "'a stream")
8577 * New command 'fixrec' for defining recursive functions with pattern
8578 matching; defining multiple functions with mutual recursion is also
8579 supported. Patterns may include the constants cpair, spair, up, sinl,
8580 sinr, or any data constructor defined by the domain package. The given
8581 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8582 syntax and examples.
8584 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8585 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8586 but the proof obligation additionally includes an admissibility
8587 requirement. The packages generate instances of class cpo or pcpo,
8588 with continuity and strictness theorems for Rep and Abs.
8590 * HOLCF: Many theorems have been renamed according to a more standard naming
8591 scheme (INCOMPATIBILITY):
8593 foo_inject: "foo$x = foo$y ==> x = y"
8594 foo_eq: "(foo$x = foo$y) = (x = y)"
8595 foo_less: "(foo$x << foo$y) = (x << y)"
8596 foo_strict: "foo$UU = UU"
8597 foo_defined: "... ==> foo$x ~= UU"
8598 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8603 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8604 including the First Isomorphism Theorem (on quotienting by the kernel
8607 * ZF/Simplifier: install second copy of type solver that actually
8608 makes use of TC rules declared to Isar proof contexts (or locales);
8609 the old version is still required for ML proof scripts.
8614 * Converted to Isar theory format; use locales instead of axiomatic
8620 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8623 * Pure/library.ML no longer defines its own option datatype, but uses
8624 that of the SML basis, which has constructors NONE and SOME instead of
8625 None and Some, as well as exception Option.Option instead of OPTION.
8626 The functions the, if_none, is_some, is_none have been adapted
8627 accordingly, while Option.map replaces apsome.
8629 * Pure/library.ML: the exception LIST has been given up in favour of
8630 the standard exceptions Empty and Subscript, as well as
8631 Library.UnequalLengths. Function like Library.hd and Library.tl are
8632 superceded by the standard hd and tl functions etc.
8634 A number of basic list functions are no longer exported to the ML
8635 toplevel, as they are variants of predefined functions. The following
8636 suggests how one can translate existing code:
8638 rev_append xs ys = List.revAppend (xs, ys)
8639 nth_elem (i, xs) = List.nth (xs, i)
8640 last_elem xs = List.last xs
8641 flat xss = List.concat xss
8642 seq fs = List.app fs
8643 partition P xs = List.partition P xs
8644 mapfilter f xs = List.mapPartial f xs
8646 * Pure/library.ML: several combinators for linear functional
8647 transformations, notably reverse application and composition:
8650 (x, y) |-> f f #-> g
8652 * Pure/library.ML: introduced/changed precedence of infix operators:
8654 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8656 infix 3 o oo ooo oooo;
8657 infix 4 ~~ upto downto;
8659 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8662 * Pure/library.ML: natural list combinators fold, fold_rev, and
8663 fold_map support linear functional transformations and nesting. For
8666 fold f [x1, ..., xN] y =
8667 y |> f x1 |> ... |> f xN
8669 (fold o fold) f [xs1, ..., xsN] y =
8670 y |> fold f xs1 |> ... |> fold f xsN
8672 fold f [x1, ..., xN] =
8675 (fold o fold) f [xs1, ..., xsN] =
8676 fold f xs1 #> ... #> fold f xsN
8678 * Pure/library.ML: the following selectors on type 'a option are
8681 the: 'a option -> 'a (*partial*)
8682 these: 'a option -> 'a where 'a = 'b list
8683 the_default: 'a -> 'a option -> 'a
8684 the_list: 'a option -> 'a list
8686 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8687 basic operations for association lists, following natural argument
8688 order; moreover the explicit equality predicate passed here avoids
8689 potentially expensive polymorphic runtime equality checks.
8690 The old functions may be expressed as follows:
8692 assoc = uncurry (AList.lookup (op =))
8693 assocs = these oo AList.lookup (op =)
8694 overwrite = uncurry (AList.update (op =)) o swap
8696 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8698 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8699 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8701 replacing make_keylist and keyfilter (occassionally used)
8704 make_keylist = AList.make
8705 keyfilter = AList.find (op =)
8707 * eq_fst and eq_snd now take explicit equality parameter, thus
8708 avoiding eqtypes. Naive rewrites:
8710 eq_fst = eq_fst (op =)
8711 eq_snd = eq_snd (op =)
8713 * Removed deprecated apl and apr (rarely used).
8716 apl (n, op) =>>= curry op n
8717 apr (op, m) =>>= fn n => op (n, m)
8719 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8720 provides a reasonably efficient light-weight implementation of sets as
8723 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8724 few new operations; existing lookup and update are now curried to
8725 follow natural argument order (for use with fold etc.);
8726 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8728 * Pure/General: output via the Isabelle channels of
8729 writeln/warning/error etc. is now passed through Output.output, with a
8730 hook for arbitrary transformations depending on the print_mode
8731 (cf. Output.add_mode -- the first active mode that provides a output
8732 function wins). Already formatted output may be embedded into further
8733 text via Output.raw; the result of Pretty.string_of/str_of and derived
8734 functions (string_of_term/cterm/thm etc.) is already marked raw to
8735 accommodate easy composition of diagnostic messages etc. Programmers
8736 rarely need to care about Output.output or Output.raw at all, with
8737 some notable exceptions: Output.output is required when bypassing the
8738 standard channels (writeln etc.), or in token translations to produce
8739 properly formatted results; Output.raw is required when capturing
8740 already output material that will eventually be presented to the user
8741 a second time. For the default print mode, both Output.output and
8742 Output.raw have no effect.
8744 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8745 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8746 cumulative results are displayed at the end of a batch session.
8748 * Pure/General: File.sysify_path and File.quote_sysify path have been
8749 replaced by File.platform_path and File.shell_path (with appropriate
8750 hooks). This provides a clean interface for unusual systems where the
8751 internal and external process view of file names are different.
8753 * Pure: more efficient orders for basic syntactic entities: added
8754 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8755 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8756 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8757 orders now -- potential INCOMPATIBILITY for code that depends on a
8758 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8759 Library.sort_strings on result).
8761 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8762 fold_types traverse types/terms from left to right, observing natural
8763 argument order. Supercedes previous foldl_XXX versions, add_frees,
8764 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8766 * Pure: name spaces have been refined, with significant changes of the
8767 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8768 to extern(_table). The plain name entry path is superceded by a
8769 general 'naming' context, which also includes the 'policy' to produce
8770 a fully qualified name and external accesses of a fully qualified
8771 name; NameSpace.extend is superceded by context dependent
8772 Sign.declare_name. Several theory and proof context operations modify
8773 the naming context. Especially note Theory.restore_naming and
8774 ProofContext.restore_naming to get back to a sane state; note that
8775 Theory.add_path is no longer sufficient to recover from
8776 Theory.absolute_path in particular.
8778 * Pure: new flags short_names (default false) and unique_names
8779 (default true) for controlling output of qualified names. If
8780 short_names is set, names are printed unqualified. If unique_names is
8781 reset, the name prefix is reduced to the minimum required to achieve
8782 the original result when interning again, even if there is an overlap
8783 with earlier declarations.
8785 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8786 now 'extend', and 'merge' gets an additional Pretty.pp argument
8787 (useful for printing error messages). INCOMPATIBILITY.
8789 * Pure: major reorganization of the theory context. Type Sign.sg and
8790 Theory.theory are now identified, referring to the universal
8791 Context.theory (see Pure/context.ML). Actual signature and theory
8792 content is managed as theory data. The old code and interfaces were
8793 spread over many files and structures; the new arrangement introduces
8794 considerable INCOMPATIBILITY to gain more clarity:
8796 Context -- theory management operations (name, identity, inclusion,
8797 parents, ancestors, merge, etc.), plus generic theory data;
8799 Sign -- logical signature and syntax operations (declaring consts,
8800 types, etc.), plus certify/read for common entities;
8802 Theory -- logical theory operations (stating axioms, definitions,
8803 oracles), plus a copy of logical signature operations (consts,
8804 types, etc.); also a few basic management operations (Theory.copy,
8807 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8808 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8809 for convenience -- they merely return the theory.
8811 * Pure: type Type.tsig is superceded by theory in most interfaces.
8813 * Pure: the Isar proof context type is already defined early in Pure
8814 as Context.proof (note that ProofContext.context and Proof.context are
8815 aliases, where the latter is the preferred name). This enables other
8816 Isabelle components to refer to that type even before Isar is present.
8818 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8819 typeK, constK, axiomK, oracleK), but provide explicit operations for
8820 any of these kinds. For example, Sign.intern typeK is now
8821 Sign.intern_type, Theory.hide_space Sign.typeK is now
8822 Theory.hide_types. Also note that former
8823 Theory.hide_classes/types/consts are now
8824 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8825 internalize their arguments! INCOMPATIBILITY.
8827 * Pure: get_thm interface (of PureThy and ProofContext) expects
8828 datatype thmref (with constructors Name and NameSelection) instead of
8829 plain string -- INCOMPATIBILITY;
8831 * Pure: cases produced by proof methods specify options, where NONE
8832 means to remove case bindings -- INCOMPATIBILITY in
8835 * Pure: the following operations retrieve axioms or theorems from a
8836 theory node or theory hierarchy, respectively:
8838 Theory.axioms_of: theory -> (string * term) list
8839 Theory.all_axioms_of: theory -> (string * term) list
8840 PureThy.thms_of: theory -> (string * thm) list
8841 PureThy.all_thms_of: theory -> (string * thm) list
8843 * Pure: print_tac now outputs the goal through the trace channel.
8845 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8846 Reference Toplevel.debug (default false) controls detailed printing
8847 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8848 controls execution profiling -- set to 1 for time and 2 for space
8849 (both increase the runtime).
8851 * Isar session: The initial use of ROOT.ML is now always timed,
8852 i.e. the log will show the actual process times, in contrast to the
8853 elapsed wall-clock time that the outer shell wrapper produces.
8855 * Simplifier: improved handling of bound variables (nameless
8856 representation, avoid allocating new strings). Simprocs that invoke
8857 the Simplifier recursively should use Simplifier.inherit_bounds to
8858 avoid local name clashes. Failure to do so produces warnings
8859 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8860 for further details.
8862 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8863 bindings for all theorems stored within a given theory; this may help
8864 in porting non-Isar theories to Isar ones, while keeping ML proof
8865 scripts for the time being.
8867 * ML operator HTML.with_charset specifies the charset begin used for
8868 generated HTML files. For example:
8870 HTML.with_charset "utf-8" use_thy "Hebrew";
8871 HTML.with_charset "utf-8" use_thy "Chinese";
8876 * Allow symlinks to all proper Isabelle executables (Isabelle,
8877 isabelle, isatool etc.).
8879 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8880 isatool doc, isatool mkdir, display_drafts etc.).
8882 * isatool usedir: option -f allows specification of the ML file to be
8883 used by Isabelle; default is ROOT.ML.
8885 * New isatool version outputs the version identifier of the Isabelle
8886 distribution being used.
8888 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8889 (containing Boolean satisfiability problems) into Isabelle/HOL
8894 New in Isabelle2004 (April 2004)
8895 --------------------------------
8899 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8900 Replaces linorder.ML.
8902 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8903 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8904 (\<a>...\<z>), are now considered normal letters, and can therefore
8905 be used anywhere where an ASCII letter (a...zA...Z) has until
8906 now. COMPATIBILITY: This obviously changes the parsing of some
8907 terms, especially where a symbol has been used as a binder, say
8908 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8909 as an identifier. Fix it by inserting a space around former
8910 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8911 existing theory and ML files.
8913 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8915 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8916 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8917 a normal (but invisible) letter. For multiple letter subscripts repeat
8918 \<^isub> like this: x\<^isub>1\<^isub>2.
8920 * Pure: There are now sub-/superscripts that can span more than one
8921 character. Text between \<^bsub> and \<^esub> is set in subscript in
8922 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8923 superscript. The new control characters are not identifier parts.
8925 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8926 content of "..." to the latex file instead of \isacntrl... . The "..."
8927 may consist of any printable characters excluding the end bracket >.
8929 * Pure: Using new Isar command "finalconsts" (or the ML functions
8930 Theory.add_finals or Theory.add_finals_i) it is now possible to
8931 declare constants "final", which prevents their being given a definition
8932 later. It is useful for constants whose behaviour is fixed axiomatically
8933 rather than definitionally, such as the meta-logic connectives.
8935 * Pure: 'instance' now handles general arities with general sorts
8936 (i.e. intersections of classes),
8938 * Presentation: generated HTML now uses a CSS style sheet to make layout
8939 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8940 It can be changed to alter the colors/layout of generated pages.
8945 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8946 cut_tac, subgoal_tac and thin_tac:
8947 - Now understand static (Isar) contexts. As a consequence, users of Isar
8948 locales are no longer forced to write Isar proof scripts.
8949 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8951 - INCOMPATIBILITY: names of variables to be instantiated may no
8952 longer be enclosed in quotes. Instead, precede variable name with `?'.
8953 This is consistent with the instantiation attribute "where".
8955 * Attributes "where" and "of":
8956 - Now take type variables of instantiated theorem into account when reading
8957 the instantiation string. This fixes a bug that caused instantiated
8958 theorems to have too special types in some circumstances.
8959 - "where" permits explicit instantiations of type variables.
8961 * Calculation commands "moreover" and "also" no longer interfere with
8962 current facts ("this"), admitting arbitrary combinations with "then"
8966 - Goal statements involving the context element "includes" no longer
8967 generate theorems with internal delta predicates (those ending on
8968 "_axioms") in the premise.
8969 Resolve particular premise with <locale>.intro to obtain old form.
8970 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8971 specification and "includes" elements in goal statement.
8972 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8973 [intro?] and [elim?] (respectively) by default.
8974 - Experimental command for instantiation of locales in proof contexts:
8975 instantiate <label>[<attrs>]: <loc>
8976 Instantiates locale <loc> and adds all its theorems to the current context
8977 taking into account their attributes. Label and attrs are optional
8978 modifiers, like in theorem declarations. If present, names of
8979 instantiated theorems are qualified with <label>, and the attributes
8980 <attrs> are applied after any attributes these theorems might have already.
8981 If the locale has assumptions, a chained fact of the form
8982 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8983 are derived. The command does not support old-style locales declared
8984 with "locale (open)".
8985 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8987 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8993 * Proof import: new image HOL4 contains the imported library from
8994 the HOL4 system with about 2500 theorems. It is imported by
8995 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8996 can be used like any other Isabelle image. See
8997 HOL/Import/HOL/README for more information.
9000 - Much improved handling of linear and partial orders.
9001 Reasoners for linear and partial orders are set up for type classes
9002 "linorder" and "order" respectively, and are added to the default simpset
9003 as solvers. This means that the simplifier can build transitivity chains
9004 to solve goals from the assumptions.
9005 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9006 of blast or auto after simplification become unnecessary because the goal
9007 is solved by simplification already.
9009 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9010 all proved in axiomatic type classes for semirings, rings and fields.
9013 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9014 now formalized using the Ring_and_Field theory mentioned above.
9015 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9016 than before, because now they are set up once in a generic manner.
9017 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9018 Look for the general versions in Ring_and_Field (and Power if they concern
9021 * Type "rat" of the rational numbers is now available in HOL-Complex.
9024 - Record types are now by default printed with their type abbreviation
9025 instead of the list of all field types. This can be configured via
9026 the reference "print_record_type_abbr".
9027 - Simproc "record_upd_simproc" for simplification of multiple updates added
9028 (not enabled by default).
9029 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9030 EX x. x = sel r to True (not enabled by default).
9031 - Tactic "record_split_simp_tac" to split and simplify records added.
9033 * 'specification' command added, allowing for definition by
9034 specification. There is also an 'ax_specification' command that
9035 introduces the new constants axiomatically.
9037 * arith(_tac) is now able to generate counterexamples for reals as well.
9039 * HOL-Algebra: new locale "ring" for non-commutative rings.
9041 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9042 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9044 * HOL-Matrix: a first theory for matrices in HOL with an application of
9045 matrix theory to linear programming.
9047 * Unions and Intersections:
9048 The latex output syntax of UN and INT has been changed
9049 from "\Union x \in A. B" to "\Union_{x \in A} B"
9050 i.e. the index formulae has become a subscript.
9051 Similarly for "\Union x. B", and for \Inter instead of \Union.
9053 * Unions and Intersections over Intervals:
9054 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9055 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9056 like in normal math, and corresponding versions for < and for intersection.
9058 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9059 lexicographic dictonary ordering has been added as "lexord".
9061 * ML: the legacy theory structures Int and List have been removed. They had
9062 conflicted with ML Basis Library structures having the same names.
9064 * 'refute' command added to search for (finite) countermodels. Only works
9065 for a fragment of HOL. The installation of an external SAT solver is
9066 highly recommended. See "HOL/Refute.thy" for details.
9068 * 'quickcheck' command: Allows to find counterexamples by evaluating
9069 formulae under an assignment of free variables to random values.
9070 In contrast to 'refute', it can deal with inductive datatypes,
9071 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9077 * Streams now come with concatenation and are part of the HOLCF image
9081 New in Isabelle2003 (May 2003)
9082 ------------------------------
9086 * Provers/simplifier:
9088 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9089 Assumptions are now subject to complete mutual simplification,
9090 not just from left to right. The simplifier now preserves
9091 the order of assumptions.
9093 Potential INCOMPATIBILITY:
9095 -- simp sometimes diverges where the old version did
9096 not, e.g. invoking simp on the goal
9098 [| P (f x); y = x; f x = f y |] ==> Q
9100 now gives rise to the infinite reduction sequence
9102 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9104 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9107 -- Tactics combining classical reasoner and simplification (such as auto)
9108 are also affected by this change, because many of them rely on
9109 simp. They may sometimes diverge as well or yield a different numbers
9110 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9111 in case of problems. Sometimes subsequent calls to the classical
9112 reasoner will fail because a preceeding call to the simplifier too
9113 eagerly simplified the goal, e.g. deleted redundant premises.
9115 - The simplifier trace now shows the names of the applied rewrite rules
9117 - You can limit the number of recursive invocations of the simplifier
9118 during conditional rewriting (where the simplifie tries to solve the
9119 conditions before applying the rewrite rule):
9120 ML "simp_depth_limit := n"
9121 where n is an integer. Thus you can force termination where previously
9122 the simplifier would diverge.
9124 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9126 - No longer aborts on failed congruence proof. Instead, the
9127 congruence is ignored.
9129 * Pure: New generic framework for extracting programs from constructive
9130 proofs. See HOL/Extraction.thy for an example instantiation, as well
9131 as HOL/Extraction for some case studies.
9133 * Pure: The main goal of the proof state is no longer shown by default, only
9134 the subgoals. This behaviour is controlled by a new flag.
9135 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9136 (ML: Proof.show_main_goal).
9138 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9139 rules whose conclusion matches subgoal 1:
9140 PG menu: Isabelle/Isar -> Show me -> matching rules
9141 The rules are ordered by how closely they match the subgoal.
9142 In particular, rules that solve a subgoal outright are displayed first
9143 (or rather last, the way they are printed).
9144 (ML: ProofGeneral.print_intros())
9146 * Pure: New flag trace_unify_fail causes unification to print
9147 diagnostic information (PG: in trace buffer) when it fails. This is
9148 useful for figuring out why single step proofs like rule, erule or
9151 * Pure: Locale specifications now produce predicate definitions
9152 according to the body of text (covering assumptions modulo local
9153 definitions); predicate "loc_axioms" covers newly introduced text,
9154 while "loc" is cumulative wrt. all included locale expressions; the
9155 latter view is presented only on export into the global theory
9156 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9157 on the old view without predicates;
9159 * Pure: predefined locales "var" and "struct" are useful for sharing
9160 parameters (as in CASL, for example); just specify something like
9161 ``var x + var y + struct M'' as import;
9163 * Pure: improved thms_containing: proper indexing of facts instead of
9164 raw theorems; check validity of results wrt. current name space;
9165 include local facts of proof configuration (also covers active
9166 locales), cover fixed variables in index; may use "_" in term
9167 specification; an optional limit for the number of printed facts may
9168 be given (the default is 40);
9170 * Pure: disallow duplicate fact bindings within new-style theory files
9173 * Provers: improved induct method: assumptions introduced by case
9174 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9175 the goal statement); "foo" still refers to all facts collectively;
9177 * Provers: the function blast.overloaded has been removed: all constants
9178 are regarded as potentially overloaded, which improves robustness in exchange
9179 for slight decrease in efficiency;
9181 * Provers/linorder: New generic prover for transitivity reasoning over
9182 linear orders. Note: this prover is not efficient!
9184 * Isar: preview of problems to finish 'show' now produce an error
9185 rather than just a warning (in interactive mode);
9192 - Produces a counter example if it cannot prove a goal.
9193 Note that the counter example may be spurious if the goal is not a formula
9194 of quantifier-free linear arithmetic.
9195 In ProofGeneral the counter example appears in the trace buffer.
9197 - Knows about div k and mod k where k is a numeral of type nat or int.
9199 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9200 linear arithmetic fails. This takes account of quantifiers and divisibility.
9201 Presburger arithmetic can also be called explicitly via presburger(_tac).
9203 * simp's arithmetic capabilities have been enhanced a bit: it now
9204 takes ~= in premises into account (by performing a case split);
9206 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9207 are distributed over a sum of terms;
9209 * New tactic "trans_tac" and method "trans" instantiate
9210 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9213 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9214 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9216 * 'typedef' command has new option "open" to suppress the set
9219 * functions Min and Max on finite sets have been introduced (theory
9222 * attribute [symmetric] now works for relations as well; it turns
9223 (x,y) : R^-1 into (y,x) : R, and vice versa;
9225 * induct over a !!-quantified statement (say !!x1..xn):
9226 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9228 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9229 %x. None. Warning: empty_def now refers to the previously hidden definition
9232 * Algebra: formalization of classical algebra. Intended as base for
9233 any algebraic development in Isabelle. Currently covers group theory
9234 (up to Sylow's theorem) and ring theory (Universal Property of
9235 Univariate Polynomials). Contributions welcome;
9237 * GroupTheory: deleted, since its material has been moved to Algebra;
9239 * Complex: new directory of the complex numbers with numeric constants,
9240 nonstandard complex numbers, and some complex analysis, standard and
9241 nonstandard (Jacques Fleuriot);
9243 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9245 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9248 * Real/HahnBanach: updated and adapted to locales;
9250 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9253 * UNITY: added the Meier-Sanders theory of progress sets;
9255 * MicroJava: bytecode verifier and lightweight bytecode verifier
9256 as abstract algorithms, instantiated to the JVM;
9258 * Bali: Java source language formalization. Type system, operational
9259 semantics, axiomatic semantics. Supported language features:
9260 classes, interfaces, objects,virtual methods, static methods,
9261 static/instance fields, arrays, access modifiers, definite
9262 assignment, exceptions.
9267 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9270 * Main ZF: virtually all theories converted to new-style format;
9275 * Pure: Tactic.prove provides sane interface for internal proofs;
9276 omits the infamous "standard" operation, so this is more appropriate
9277 than prove_goalw_cterm in many situations (e.g. in simprocs);
9279 * Pure: improved error reporting of simprocs;
9281 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9285 *** Document preparation ***
9287 * uses \par instead of \\ for line breaks in theory text. This may
9288 shift some page breaks in large documents. To get the old behaviour
9289 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9291 * minimized dependencies of isabelle.sty and isabellesym.sty on
9294 * \<euro> now needs package babel/greek instead of marvosym (which
9297 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9302 New in Isabelle2002 (March 2002)
9303 --------------------------------
9305 *** Document preparation ***
9307 * greatly simplified document preparation setup, including more
9308 graceful interpretation of isatool usedir -i/-d/-D options, and more
9309 instructive isatool mkdir; users should basically be able to get
9310 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9311 users may run a separate document processing stage manually like this:
9312 "isatool usedir -D output HOL Test && isatool document Test/output";
9314 * theory dependency graph may now be incorporated into documents;
9315 isatool usedir -g true will produce session_graph.eps/.pdf for use
9316 with \includegraphics of LaTeX;
9318 * proper spacing of consecutive markup elements, especially text
9319 blocks after section headings;
9321 * support bold style (for single symbols only), input syntax is like
9322 this: "\<^bold>\<alpha>" or "\<^bold>A";
9324 * \<bullet> is now output as bold \cdot by default, which looks much
9325 better in printed text;
9327 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9328 note that these symbols are currently unavailable in Proof General /
9329 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9331 * isatool latex no longer depends on changed TEXINPUTS, instead
9332 isatool document copies the Isabelle style files to the target
9338 * Pure/Provers: improved proof by cases and induction;
9339 - 'case' command admits impromptu naming of parameters (such as
9341 - 'induct' method divinates rule instantiation from the inductive
9342 claim; no longer requires excessive ?P bindings for proper
9343 instantiation of cases;
9344 - 'induct' method properly enumerates all possibilities of set/type
9345 rules; as a consequence facts may be also passed through *type*
9346 rules without further ado;
9347 - 'induct' method now derives symbolic cases from the *rulified*
9348 rule (before it used to rulify cases stemming from the internal
9349 atomized version); this means that the context of a non-atomic
9350 statement becomes is included in the hypothesis, avoiding the
9351 slightly cumbersome show "PROP ?case" form;
9352 - 'induct' may now use elim-style induction rules without chaining
9353 facts, using ``missing'' premises from the goal state; this allows
9354 rules stemming from inductive sets to be applied in unstructured
9355 scripts, while still benefitting from proper handling of non-atomic
9356 statements; NB: major inductive premises need to be put first, all
9357 the rest of the goal is passed through the induction;
9358 - 'induct' proper support for mutual induction involving non-atomic
9359 rule statements (uses the new concept of simultaneous goals, see
9361 - append all possible rule selections, but only use the first
9362 success (no backtracking);
9363 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9364 - undeclared rule case names default to numbers 1, 2, 3, ...;
9365 - added 'print_induct_rules' (covered by help item in recent Proof
9367 - moved induct/cases attributes to Pure, methods to Provers;
9368 - generic method setup instantiated for FOL and HOL;
9370 * Pure: support multiple simultaneous goal statements, for example
9371 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9372 meta-level mechanism, this acts as if several individual goals had
9373 been stated separately; in particular common proof methods need to be
9374 repeated in order to cover all claims; note that a single elimination
9375 step is *not* sufficient to establish the two conjunctions, so this
9378 assume "A & B" then have A and B .. (*".." fails*)
9380 better use "obtain" in situations as above; alternative refer to
9381 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9383 * Pure: proper integration with ``locales''; unlike the original
9384 version by Florian Kammller, Isar locales package high-level proof
9385 contexts rather than raw logical ones (e.g. we admit to include
9386 attributes everywhere); operations on locales include merge and
9387 rename; support for implicit arguments (``structures''); simultaneous
9388 type-inference over imports and text; see also HOL/ex/Locales.thy for
9391 * Pure: the following commands have been ``localized'', supporting a
9392 target locale specification "(in name)": 'lemma', 'theorem',
9393 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9394 stored both within the locale and at the theory level (exported and
9395 qualified by the locale name);
9397 * Pure: theory goals may now be specified in ``long'' form, with
9398 ad-hoc contexts consisting of arbitrary locale elements. for example
9399 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9400 definitions may be given, too); the result is a meta-level rule with
9401 the context elements being discharged in the obvious way;
9403 * Pure: new proof command 'using' allows to augment currently used
9404 facts after a goal statement ('using' is syntactically analogous to
9405 'apply', but acts on the goal's facts only); this allows chained facts
9406 to be separated into parts given before and after a claim, as in
9407 ``from a and b have C using d and e <proof>'';
9409 * Pure: renamed "antecedent" case to "rule_context";
9411 * Pure: new 'judgment' command records explicit information about the
9412 object-logic embedding (used by several tools internally); no longer
9413 use hard-wired "Trueprop";
9415 * Pure: added 'corollary' command;
9417 * Pure: fixed 'token_translation' command;
9419 * Pure: removed obsolete 'exported' attribute;
9421 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9422 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9423 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9425 * Pure: method 'atomize' presents local goal premises as object-level
9426 statements (atomic meta-level propositions); setup controlled via
9427 rewrite rules declarations of 'atomize' attribute; example
9428 application: 'induct' method with proper rule statements in improper
9431 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9432 now consider the syntactic context of assumptions, giving a better
9433 chance to get type-inference of the arguments right (this is
9434 especially important for locales);
9436 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9439 * Pure/obtain: the formal conclusion "thesis", being marked as
9440 ``internal'', may no longer be reference directly in the text;
9441 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9444 * Pure: generic 'sym' attribute which declares a rule both as pure
9445 'elim?' and for the 'symmetric' operation;
9447 * Pure: marginal comments ``--'' may now occur just anywhere in the
9448 text; the fixed correlation with particular command syntax has been
9451 * Pure: new method 'rules' is particularly well-suited for proof
9452 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9453 but often produces more compact proof terms with less detours;
9455 * Pure/Provers/classical: simplified integration with pure rule
9456 attributes and methods; the classical "intro?/elim?/dest?"
9457 declarations coincide with the pure ones; the "rule" method no longer
9458 includes classically swapped intros; "intro" and "elim" methods no
9459 longer pick rules from the context; also got rid of ML declarations
9460 AddXIs/AddXEs/AddXDs; all of this has some potential for
9463 * Provers/classical: attribute 'swapped' produces classical inversions
9464 of introduction rules;
9466 * Provers/simplifier: 'simplified' attribute may refer to explicit
9467 rules instead of full simplifier context; 'iff' attribute handles
9470 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9472 * HOL: 'recdef' now fails on unfinished automated proofs, use
9473 "(permissive)" option to recover old behavior;
9475 * HOL: 'inductive' no longer features separate (collective) attributes
9476 for 'intros' (was found too confusing);
9478 * HOL: properly declared induction rules less_induct and
9484 * HOL: moved over to sane numeral syntax; the new policy is as
9487 - 0 and 1 are polymorphic constants, which are defined on any
9488 numeric type (nat, int, real etc.);
9490 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9491 binary representation internally;
9493 - type nat has special constructor Suc, and generally prefers Suc 0
9494 over 1::nat and Suc (Suc 0) over 2::nat;
9496 This change may cause significant problems of INCOMPATIBILITY; here
9497 are some hints on converting existing sources:
9499 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9500 entities, so expressions involving "-" (unary or binary minus) need
9501 to be spaced properly;
9503 - existing occurrences of "1" may need to be constraint "1::nat" or
9504 even replaced by Suc 0; similar for old "2";
9506 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9508 - remove all special provisions on numerals in proofs;
9510 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9511 representation (depends on bin_arith_simps in the default context);
9513 * HOL: symbolic syntax for x^2 (numeral 2);
9515 * HOL: the class of all HOL types is now called "type" rather than
9516 "term"; INCOMPATIBILITY, need to adapt references to this type class
9517 in axclass/classes, instance/arities, and (usually rare) occurrences
9518 in typings (of consts etc.); internally the class is called
9519 "HOL.type", ML programs should refer to HOLogic.typeS;
9521 * HOL/record package improvements:
9522 - new derived operations "fields" to build a partial record section,
9523 "extend" to promote a fixed record to a record scheme, and
9524 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9525 declared as simp by default;
9526 - shared operations ("more", "fields", etc.) now need to be always
9527 qualified) --- potential INCOMPATIBILITY;
9528 - removed "make_scheme" operations (use "make" with "extend") --
9530 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9531 - provides cases/induct rules for use with corresponding Isar
9532 methods (for concrete records, record schemes, concrete more
9533 parts, and schematic more parts -- in that order);
9534 - internal definitions directly based on a light-weight abstract
9535 theory of product types over typedef rather than datatype;
9537 * HOL: generic code generator for generating executable ML code from
9538 specifications; specific support for HOL constructs such as inductive
9539 datatypes and sets, as well as recursive functions; can be invoked
9540 via 'generate_code' theory section;
9542 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9544 * HOL: consolidated and renamed several theories. In particular:
9545 Ord.thy has been absorbed into HOL.thy
9546 String.thy has been absorbed into List.thy
9548 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9549 (beware of argument permutation!);
9551 * HOL: linorder_less_split superseded by linorder_cases;
9553 * HOL/List: "nodups" renamed to "distinct";
9555 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9556 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9557 - Ex_def has changed, now need to use some_eq_ex
9559 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9560 in this (rare) case use:
9562 delSWrapper "split_all_tac"
9563 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9565 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9568 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9569 Isabelle's type classes, ^ on functions and relations has too general
9570 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9571 necessary to attach explicit type constraints;
9573 * HOL/Relation: the prefix name of the infix "O" has been changed from
9574 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9575 renamed accordingly (eg "compI" -> "rel_compI").
9577 * HOL: syntax translations now work properly with numerals and records
9580 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9581 of "lam" -- INCOMPATIBILITY;
9583 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9584 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9585 renamed "Product_Type.unit";
9587 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9589 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9590 the "cases" method);
9592 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9595 * HOL/IMP: updated and converted to new-style theory format; several
9596 parts turned into readable document, with proper Isar proof texts and
9597 some explanations (by Gerwin Klein);
9599 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9601 * HOL-Hyperreal is now a logic image;
9606 * Isar: consts/constdefs supports mixfix syntax for continuous
9609 * Isar: domain package adapted to new-style theory format, e.g. see
9612 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9613 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9614 lift.induct_tac, always use UU instead of Undef;
9616 * HOLCF/IMP: updated and converted to new-style theory;
9621 * Isar: proper integration of logic-specific tools and packages,
9622 including theory commands '(co)inductive', '(co)datatype',
9623 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9624 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9626 * theory Main no longer includes AC; for the Axiom of Choice, base
9627 your theory on Main_ZFC;
9629 * the integer library now covers quotients and remainders, with many
9630 laws relating division to addition, multiplication, etc.;
9632 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9633 typeless version of the formalism;
9635 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9638 * ZF/Induct: new directory for examples of inductive definitions,
9639 including theory Multiset for multiset orderings; converted to
9640 new-style theory format;
9642 * ZF: many new theorems about lists, ordinals, etc.;
9647 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9648 variable proof controls level of detail: 0 = no proofs (only oracle
9649 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9650 also ref manual for further ML interfaces;
9652 * Pure/axclass: removed obsolete ML interface
9653 goal_subclass/goal_arity;
9655 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9656 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9657 separate tokens, so expressions involving minus need to be spaced
9660 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9661 rather than "infixl" or "infixr";
9663 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9664 sort constraint specifications in type inference; e.g. "x::_::foo"
9665 ensures that the type of "x" is of sort "foo" (but not necessarily a
9668 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9669 control output of nested => (types); the default behavior is
9672 * Pure/syntax: builtin parse translation for "_constify" turns valued
9673 tokens into AST constants;
9675 * Pure/syntax: prefer later declarations of translations and print
9676 translation functions; potential INCOMPATIBILITY: need to reverse
9677 multiple declarations for same syntax element constant;
9679 * Pure/show_hyps reset by default (in accordance to existing Isar
9682 * Provers/classical: renamed addaltern to addafter, addSaltern to
9685 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9688 * system: tested support for MacOS X; should be able to get Isabelle +
9689 Proof General to work in a plain Terminal after installing Poly/ML
9690 (e.g. from the Isabelle distribution area) and GNU bash alone
9691 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9692 support requires further installations, e.g. from
9693 http://fink.sourceforge.net/);
9695 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9697 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9698 of 40 MB), cf. ML_OPTIONS;
9700 * system: Proof General keywords specification is now part of the
9701 Isabelle distribution (see etc/isar-keywords.el);
9703 * system: support for persistent Proof General sessions (refrain from
9704 outdating all loaded theories on startup); user may create writable
9705 logic images like this: ``isabelle -q HOL Test'';
9707 * system: smart selection of Isabelle process versus Isabelle
9708 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9709 run both "isabelle" and "Isabelle" even if file names are badly
9710 damaged (executable inspects the case of the first letter of its own
9711 name); added separate "isabelle-process" and "isabelle-interface";
9713 * system: refrain from any attempt at filtering input streams; no
9714 longer support ``8bit'' encoding of old isabelle font, instead proper
9715 iso-latin characters may now be used; the related isatools
9716 "symbolinput" and "nonascii" have disappeared as well;
9718 * system: removed old "xterm" interface (the print modes "xterm" and
9719 "xterm_color" are still available for direct use in a suitable
9724 New in Isabelle99-2 (February 2001)
9725 -----------------------------------
9727 *** Overview of INCOMPATIBILITIES ***
9729 * HOL: please note that theories in the Library and elsewhere often use the
9730 new-style (Isar) format; to refer to their theorems in an ML script you must
9731 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9733 * HOL: inductive package no longer splits induction rule aggressively,
9734 but only as far as specified by the introductions given; the old
9735 format may be recovered via ML function complete_split_rule or attribute
9736 'split_rule (complete)';
9738 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9739 gfp_Tarski to gfp_unfold;
9741 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9743 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9744 relation); infix "^^" has been renamed "``"; infix "``" has been
9745 renamed "`"; "univalent" has been renamed "single_valued";
9747 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9750 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9752 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9754 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9755 consequence, it is no longer monotonic wrt. the local goal context
9756 (which is now passed through the inductive cases);
9758 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9759 \<gg> to \<ggreater>;
9762 *** Document preparation ***
9764 * \isabellestyle{NAME} selects version of Isabelle output (currently
9765 available: are "it" for near math-mode best-style output, "sl" for
9766 slanted text style, and "tt" for plain type-writer; if no
9767 \isabellestyle command is given, output is according to slanted
9770 * support sub/super scripts (for single symbols only), input syntax is
9771 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9773 * some more standard symbols; see Appendix A of the system manual for
9774 the complete list of symbols defined in isabellesym.sty;
9776 * improved isabelle style files; more abstract symbol implementation
9777 (should now use \isamath{...} and \isatext{...} in custom symbol
9780 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9781 state; Note that presentation of goal states does not conform to
9782 actual human-readable proof documents. Please do not include goal
9783 states into document output unless you really know what you are doing!
9785 * proper indentation of antiquoted output with proportional LaTeX
9788 * no_document ML operator temporarily disables LaTeX document
9791 * isatool unsymbolize tunes sources for plain ASCII communication;
9796 * Pure: Isar now suffers initial goal statements to contain unbound
9797 schematic variables (this does not conform to actual readable proof
9798 documents, due to unpredictable outcome and non-compositional proof
9799 checking); users who know what they are doing may use schematic goals
9800 for Prolog-style synthesis of proven results;
9802 * Pure: assumption method (an implicit finishing) now handles actual
9805 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9806 initial goal, declare "that" only as Pure intro (only for single
9807 steps); the "that" rule assumption may now be involved in implicit
9808 finishing, thus ".." becomes a feasible for trivial obtains;
9810 * Pure: default proof step now includes 'intro_classes'; thus trivial
9811 instance proofs may be performed by "..";
9813 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9816 * Pure: more robust selection of calculational rules;
9818 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9819 rule (as well as the assumption rule);
9821 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9822 lemmas, using the graph browser tool;
9824 * Pure: predict failure of "show" in interactive mode;
9826 * Pure: 'thms_containing' now takes actual terms as arguments;
9828 * HOL: improved method 'induct' --- now handles non-atomic goals
9829 (potential INCOMPATIBILITY); tuned error handling;
9831 * HOL: cases and induct rules now provide explicit hints about the
9832 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9833 any remaining facts are inserted into the goal verbatim;
9835 * HOL: local contexts (aka cases) may now contain term bindings as
9836 well; the 'cases' and 'induct' methods new provide a ?case binding for
9837 the result to be shown in each case;
9839 * HOL: added 'recdef_tc' command;
9841 * isatool convert assists in eliminating legacy ML scripts;
9846 * HOL/Library: a collection of generic theories to be used together
9847 with main HOL; the theory loader path already includes this directory
9848 by default; the following existing theories have been moved here:
9849 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9850 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9852 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9853 modelling and verification task performed in Isabelle/HOL +
9854 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9856 * HOL/Algebra: special summation operator SUM no longer exists, it has
9857 been replaced by setsum; infix 'assoc' now has priority 50 (like
9858 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9859 'domain', this makes the theory consistent with mathematical
9862 * HOL basics: added overloaded operations "inverse" and "divide"
9863 (infix "/"), syntax for generic "abs" operation, generic summation
9866 * HOL/typedef: simplified package, provide more useful rules (see also
9869 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9870 now expressed as a proper nested rule (old-style tactic scripts may
9871 require atomize_strip_tac to cope with non-atomic premises);
9873 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9874 to "split_conv" (old name still available for compatibility);
9876 * HOL: improved concrete syntax for strings (e.g. allows translation
9877 rules with string literals);
9879 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9880 and Fleuriot's mechanization of analysis, including the transcendental
9881 functions for the reals;
9883 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9888 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9889 "lam" is displayed as TWO lambda-symbols
9891 * CTT: theory Main now available, containing everything (that is, Bool
9897 * Pure: the Simplifier has been implemented properly as a derived rule
9898 outside of the actual kernel (at last!); the overall performance
9899 penalty in practical applications is about 50%, while reliability of
9900 the Isabelle inference kernel has been greatly improved;
9902 * print modes "brackets" and "no_brackets" control output of nested =>
9903 (types) and ==> (props); the default behaviour is "brackets";
9905 * Provers: fast_tac (and friends) now handle actual object-logic rules
9906 as assumptions as well;
9908 * system: support Poly/ML 4.0;
9910 * system: isatool install handles KDE version 1 or 2;
9914 New in Isabelle99-1 (October 2000)
9915 ----------------------------------
9917 *** Overview of INCOMPATIBILITIES ***
9919 * HOL: simplification of natural numbers is much changed; to partly
9920 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9921 issue the following ML commands:
9923 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9924 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9926 * HOL: simplification no longer dives into case-expressions; this is
9927 controlled by "t.weak_case_cong" for each datatype t;
9929 * HOL: nat_less_induct renamed to less_induct;
9931 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9932 fixsome to patch .thy and .ML sources automatically;
9934 select_equality -> some_equality
9935 select_eq_Ex -> some_eq_ex
9936 selectI2EX -> someI2_ex
9939 select1_equality -> some1_equality
9940 Eps_sym_eq -> some_sym_eq_trivial
9941 Eps_eq -> some_eq_trivial
9943 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9945 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9948 * HOL: the recursion equations generated by 'recdef' are now called
9949 f.simps instead of f.rules;
9951 * HOL: qed_spec_mp now also handles bounded ALL as well;
9953 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9954 sometimes be needed;
9956 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9958 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9960 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9961 product is now "<*>" instead of "Times"; the lexicographic product is
9962 now "<*lex*>" instead of "**";
9964 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9965 of main HOL, but was unused); better use HOL's datatype package;
9967 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9968 the old syntax may be recovered as follows:
9971 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9972 (infixl "\\<oplus>" 100)
9974 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9976 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9977 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9980 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9981 changed from A/r to A//r;
9983 * ZF: new treatment of arithmetic (nat & int) may break some old
9986 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9987 rulify -> rule_format, elimify -> elim_format, ...);
9989 * Isar/Provers: intro/elim/dest attributes changed; renamed
9990 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9991 should have to change intro!! to intro? only); replaced "delrule" by
9994 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9996 * Provers: strengthened force_tac by using new first_best_tac;
9998 * LaTeX document preparation: several changes of isabelle.sty (see
10002 *** Document preparation ***
10004 * formal comments (text blocks etc.) in new-style theories may now
10005 contain antiquotations of thm/prop/term/typ/text to be presented
10006 according to latex print mode; concrete syntax is like this:
10007 @{term[show_types] "f(x) = a + x"};
10009 * isatool mkdir provides easy setup of Isabelle session directories,
10010 including proper document sources;
10012 * generated LaTeX sources are now deleted after successful run
10013 (isatool document -c); may retain a copy somewhere else via -D option
10016 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10017 style files, achieving self-contained LaTeX sources and simplifying
10020 * old-style theories now produce (crude) LaTeX output as well;
10022 * browser info session directories are now self-contained (may be put
10023 on WWW server seperately); improved graphs of nested sessions; removed
10024 graph for 'all sessions';
10026 * several improvements in isabelle style files; \isabellestyle{it}
10027 produces fake math mode output; \isamarkupheader is now \section by
10028 default; see lib/texinputs/isabelle.sty etc.;
10033 * Isar/Pure: local results and corresponding term bindings are now
10034 subject to Hindley-Milner polymorphism (similar to ML); this
10035 accommodates incremental type-inference very nicely;
10037 * Isar/Pure: new derived language element 'obtain' supports
10038 generalized existence reasoning;
10040 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10041 support accumulation of results, without applying any rules yet;
10042 useful to collect intermediate results without explicit name
10043 references, and for use with transitivity rules with more than 2
10046 * Isar/Pure: scalable support for case-analysis type proofs: new
10047 'case' language element refers to local contexts symbolically, as
10048 produced by certain proof methods; internally, case names are attached
10049 to theorems as "tags";
10051 * Isar/Pure: theory command 'hide' removes declarations from
10052 class/type/const name spaces;
10054 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10055 indicate potential overloading;
10057 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10059 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10060 "{a,b,c}" instead of {a,b,c};
10062 * Isar/Pure now provides its own version of intro/elim/dest
10063 attributes; useful for building new logics, but beware of confusion
10064 with the version in Provers/classical;
10066 * Isar/Pure: the local context of (non-atomic) goals is provided via
10067 case name 'antecedent';
10069 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10070 to the current context is now done automatically);
10072 * Isar/Pure: theory command 'method_setup' provides a simple interface
10073 for definining proof methods in ML;
10075 * Isar/Provers: intro/elim/dest attributes changed; renamed
10076 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10077 most cases, one should have to change intro!! to intro? only);
10078 replaced "delrule" by "rule del";
10080 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10081 'symmetric' attribute (the latter supercedes [RS sym]);
10083 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10084 method modifier); 'simp' method: 'only:' modifier removes loopers as
10085 well (including splits);
10087 * Isar/Provers: Simplifier and Classical methods now support all kind
10088 of modifiers used in the past, including 'cong', 'iff', etc.
10090 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10091 of Simplifier and Classical reasoner);
10093 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10094 now support named cases; major packages (inductive, datatype, primrec,
10095 recdef) support case names and properly name parameters;
10097 * Isar/HOL: new transitivity rules for substitution in inequalities --
10098 monotonicity conditions are extracted to be proven at end of
10101 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10104 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10105 split_if split_if_asm; datatype package provides theorems foo.splits =
10106 foo.split foo.split_asm for each datatype;
10108 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10109 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10110 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10111 use "(cases (simplified))" method in proper proof texts);
10113 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10115 * Isar: names of theorems etc. may be natural numbers as well;
10117 * Isar: 'pr' command: optional arguments for goals_limit and
10118 ProofContext.prems_limit; no longer prints theory contexts, but only
10121 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10122 additional print modes to be specified; e.g. "pr(latex)" will print
10123 proof state according to the Isabelle LaTeX style;
10125 * Isar: improved support for emulating tactic scripts, including proof
10126 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10127 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10128 (for HOL datatypes);
10130 * Isar: simplified (more robust) goal selection of proof methods: 1st
10131 goal, all goals, or explicit goal specifier (tactic emulation); thus
10132 'proof method scripts' have to be in depth-first order;
10134 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10136 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10137 should instead use individual commands for printing items
10138 (print_commands, print_methods etc.);
10140 * Isar: added 'nothing' --- the empty list of theorems;
10145 * HOL/MicroJava: formalization of a fragment of Java, together with a
10146 corresponding virtual machine and a specification of its bytecode
10147 verifier and a lightweight bytecode verifier, including proofs of
10148 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10149 Cornelia Pusch (see also the homepage of project Bali at
10150 http://isabelle.in.tum.de/Bali/);
10152 * HOL/Algebra: new theory of rings and univariate polynomials, by
10155 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10156 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10159 * HOL/Lattice: fundamental concepts of lattice theory and order
10160 structures, including duals, properties of bounds versus algebraic
10161 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10162 Theorem for complete lattices etc.; may also serve as a demonstration
10163 for abstract algebraic reasoning using axiomatic type classes, and
10164 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10166 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10169 * HOL/IMPP: extension of IMP with local variables and mutually
10170 recursive procedures, by David von Oheimb;
10172 * HOL/Lambda: converted into new-style theory and document;
10174 * HOL/ex/Multiquote: example of multiple nested quotations and
10175 anti-quotations -- basically a generalized version of de-Bruijn
10176 representation; very useful in avoiding lifting of operations;
10178 * HOL/record: added general record equality rule to simpset; fixed
10179 select-update simplification procedure to handle extended records as
10180 well; admit "r" as field name;
10182 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10183 other numeric types and also as the identity of groups, rings, etc.;
10185 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10186 Types nat and int belong to this axclass;
10188 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10189 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10190 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10191 two terms #m*u and #n*u are replaced by #(m+n)*u
10192 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10193 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10194 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10196 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10197 powerful prover for predicate logic but knows nothing of clasets; see
10198 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10200 * HOL: new version of "case_tac" subsumes both boolean case split and
10201 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10202 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10204 * HOL: simplification no longer dives into case-expressions: only the
10205 selector expression is simplified, but not the remaining arms; to
10206 enable full simplification of case-expressions for datatype t, you may
10207 remove t.weak_case_cong from the simpset, either globally (Delcongs
10208 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10210 * HOL/recdef: the recursion equations generated by 'recdef' for
10211 function 'f' are now called f.simps instead of f.rules; if all
10212 termination conditions are proved automatically, these simplification
10213 rules are added to the simpset, as in primrec; rules may be named
10214 individually as well, resulting in a separate list of theorems for
10217 * HOL/While is a new theory that provides a while-combinator. It
10218 permits the definition of tail-recursive functions without the
10219 provision of a termination measure. The latter is necessary once the
10220 invariant proof rule for while is applied.
10222 * HOL: new (overloaded) notation for the set of elements below/above
10223 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10225 * HOL: theorems impI, allI, ballI bound as "strip";
10227 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10228 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10229 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10231 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10233 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10234 main HOL, but was unused);
10236 * HOL: fewer consts declared as global (e.g. have to refer to
10237 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10239 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10240 in case of overlap with user translations (e.g. judgements over
10241 tuples); (note that the underlying logical represenation is still
10247 * ZF: simplification automatically cancels common terms in arithmetic
10248 expressions over nat and int;
10250 * ZF: new treatment of nat to minimize type-checking: all operators
10251 coerce their operands to a natural number using the function natify,
10252 making the algebraic laws unconditional;
10254 * ZF: as above, for int: operators coerce their operands to an integer
10255 using the function intify;
10257 * ZF: the integer library now contains many of the usual laws for the
10258 orderings, including $<=, and monotonicity laws for $+ and $*;
10260 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10263 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10264 to the simplifier and classical reasoner simultaneously;
10269 * Provers: blast_tac now handles actual object-logic rules as
10270 assumptions; note that auto_tac uses blast_tac internally as well;
10272 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10273 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10275 * Provers: delrules now handles destruct rules as well (no longer need
10276 explicit make_elim);
10278 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10279 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10280 use instead the strong form,
10281 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10282 in HOL, FOL and ZF the function cla_make_elim will create such rules
10283 from destruct-rules;
10285 * Provers: Simplifier.easy_setup provides a fast path to basic
10286 Simplifier setup for new object-logics;
10288 * Pure: AST translation rules no longer require constant head on LHS;
10290 * Pure: improved name spaces: ambiguous output is qualified; support
10291 for hiding of names;
10293 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10294 XSYMBOL_HOME; no longer need to do manual configuration in most
10297 * system: compression of ML heaps images may now be controlled via -c
10298 option of isabelle and isatool usedir (currently only observed by
10301 * system: isatool installfonts may handle X-Symbol fonts as well (very
10302 useful for remote X11);
10304 * system: provide TAGS file for Isabelle sources;
10306 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10309 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10310 timing flag supersedes proof_timing and Toplevel.trace;
10312 * ML: new combinators |>> and |>>> for incremental transformations
10313 with secondary results (e.g. certain theory extensions):
10315 * ML: PureThy.add_defs gets additional argument to indicate potential
10316 overloading (usually false);
10318 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10323 New in Isabelle99 (October 1999)
10324 --------------------------------
10326 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10328 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10329 are no longer simplified. (This allows the simplifier to unfold recursive
10330 functional programs.) To restore the old behaviour, declare
10332 Delcongs [if_weak_cong];
10334 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10337 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10339 * HOL/datatype: mutual_induct_tac no longer exists --
10340 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10342 * HOL/typedef: fixed type inference for representing set; type
10343 arguments now have to occur explicitly on the rhs as type constraints;
10345 * ZF: The con_defs part of an inductive definition may no longer refer
10346 to constants declared in the same theory;
10348 * HOL, ZF: the function mk_cases, generated by the inductive
10349 definition package, has lost an argument. To simplify its result, it
10350 uses the default simpset instead of a supplied list of theorems.
10352 * HOL/List: the constructors of type list are now Nil and Cons;
10354 * Simplifier: the type of the infix ML functions
10355 setSSolver addSSolver setSolver addSolver
10356 is now simpset * solver -> simpset where `solver' is a new abstract type
10357 for packaging solvers. A solver is created via
10358 mk_solver: string -> (thm list -> int -> tactic) -> solver
10359 where the string argument is only a comment.
10362 *** Proof tools ***
10364 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10365 decision procedure for linear arithmetic. Currently it is used for
10366 types `nat', `int', and `real' in HOL (see below); it can, should and
10367 will be instantiated for other types and logics as well.
10369 * The simplifier now accepts rewrite rules with flexible heads, eg
10370 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10371 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10377 * New Isabelle/Isar subsystem provides an alternative to traditional
10378 tactical theorem proving; together with the ProofGeneral/isar user
10379 interface it offers an interactive environment for developing human
10380 readable proof documents (Isar == Intelligible semi-automated
10381 reasoning); for further information see isatool doc isar-ref,
10382 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10384 * improved and simplified presentation of theories: better HTML markup
10385 (including colors), graph views in several sizes; isatool usedir now
10386 provides a proper interface for user theories (via -P option); actual
10387 document preparation based on (PDF)LaTeX is available as well (for
10388 new-style theories only); see isatool doc system for more information;
10390 * native support for Proof General, both for classic Isabelle and
10393 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10394 using the graph browser tool;
10396 * Isabelle manuals now also available as PDF;
10398 * theory loader rewritten from scratch (may not be fully
10399 bug-compatible); old loadpath variable has been replaced by show_path,
10400 add_path, del_path, reset_path functions; new operations such as
10401 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10404 * improved isatool install: option -k creates KDE application icon,
10405 option -p DIR installs standalone binaries;
10407 * added ML_PLATFORM setting (useful for cross-platform installations);
10408 more robust handling of platform specific ML images for SML/NJ;
10410 * the settings environment is now statically scoped, i.e. it is never
10411 created again in sub-processes invoked from isabelle, isatool, or
10414 * path element specification '~~' refers to '$ISABELLE_HOME';
10416 * in locales, the "assumes" and "defines" parts may be omitted if
10419 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10422 * new print_mode "HTML";
10424 * new flag show_tags controls display of tags of theorems (which are
10425 basically just comments that may be attached by some tools);
10427 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10428 mode and goal output format:
10430 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10432 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10434 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10435 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10437 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10439 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10441 * function bind_thms stores lists of theorems (cf. bind_thm);
10443 * new shorthand tactics ftac, eatac, datac, fatac;
10445 * qed (and friends) now accept "" as result name; in that case the
10446 theorem is not stored, but proper checks and presentation of the
10447 result still apply;
10449 * theorem database now also indexes constants "Trueprop", "all",
10450 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10455 ** HOL arithmetic **
10457 * There are now decision procedures for linear arithmetic over nat and
10460 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10461 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10462 are treated as atomic; subformulae not involving type `nat' or `int'
10463 are ignored; quantified subformulae are ignored unless they are
10464 positive universal or negative existential. The tactic has to be
10465 invoked by hand and can be a little bit slow. In particular, the
10466 running time is exponential in the number of occurrences of `min' and
10467 `max', and `-' on `nat'.
10469 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10470 (negated) (in)equalities among the premises and the conclusion into
10471 account (i.e. no compound formulae) and does not know about `min' and
10472 `max', and `-' on `nat'. It is fast and is used automatically by the
10475 NB: At the moment, these decision procedures do not cope with mixed
10476 nat/int formulae where the two parts interact, such as `m < n ==>
10479 * HOL/Numeral provides a generic theory of numerals (encoded
10480 efficiently as bit strings); setup for types nat/int/real is in place;
10481 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10482 int, existing theories and proof scripts may require a few additional
10485 * integer division and remainder can now be performed on constant
10488 * many properties of integer multiplication, division and remainder
10491 * An interface to the Stanford Validity Checker (SVC) is available through the
10492 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10493 are proved automatically. SVC must be installed separately, and its results
10494 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10495 invocation of the underlying oracle). For SVC see
10496 http://verify.stanford.edu/SVC
10498 * IsaMakefile: the HOL-Real target now builds an actual image;
10503 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10504 (in Isabelle/Isar) -- by Gertrud Bauer;
10506 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10507 analysis for assembly languages with subtypes;
10509 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10510 -- avoids syntactic ambiguities and treats state, transition, and
10511 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10512 changed syntax and (many) tactics;
10514 * HOL/inductive: Now also handles more general introduction rules such
10515 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10516 theorems are now maintained within the theory (maintained via the
10519 * HOL/datatype: Now also handles arbitrarily branching datatypes
10520 (using function types) such as
10522 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10524 * HOL/record: record_simproc (part of the default simpset) takes care
10525 of selectors applied to updated records; record_split_tac is no longer
10526 part of the default claset; update_defs may now be removed from the
10527 simpset in many cases; COMPATIBILITY: old behavior achieved by
10529 claset_ref () := claset() addSWrapper record_split_wrapper;
10530 Delsimprocs [record_simproc]
10532 * HOL/typedef: fixed type inference for representing set; type
10533 arguments now have to occur explicitly on the rhs as type constraints;
10535 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10536 names rather than an ML expression;
10538 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10539 supplied later. Program schemes can be defined, such as
10540 "While B C s = (if B s then While B C (C s) else s)"
10541 where the well-founded relation can be chosen after B and C have been given.
10543 * HOL/List: the constructors of type list are now Nil and Cons;
10544 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10545 course, ML tools referring to List.list.op # etc. have to be adapted;
10547 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10548 disabled by default; run isabelle with option -m HOL to get back to
10549 the original Gordon/HOL-style output;
10551 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10552 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10554 * HOL basic syntax simplified (more orthogonal): all variants of
10555 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10556 Eps operator is provided as well: "SOME x. P[x]";
10558 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10560 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10561 thus available for user theories;
10563 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10564 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10567 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10568 several times and then mp;
10573 * the notation <<...>> is now available as a notation for sequences of
10576 * the simplifier is now installed
10578 * the axiom system has been generalized (thanks to Soren Heilmann)
10580 * the classical reasoner now has a default rule database
10585 * new primrec section allows primitive recursive functions to be given
10586 directly (as in HOL) over datatypes and the natural numbers;
10588 * new tactics induct_tac and exhaust_tac for induction (or case
10589 analysis) over datatypes and the natural numbers;
10591 * the datatype declaration of type T now defines the recursor T_rec;
10593 * simplification automatically does freeness reasoning for datatype
10596 * automatic type-inference, with AddTCs command to insert new
10597 type-checking rules;
10599 * datatype introduction rules are now added as Safe Introduction rules
10602 * the syntax "if P then x else y" is now available in addition to
10606 *** Internal programming interfaces ***
10608 * tuned simplifier trace output; new flag debug_simp;
10610 * structures Vartab / Termtab (instances of TableFun) offer efficient
10611 tables indexed by indexname_ord / term_ord (compatible with aconv);
10613 * AxClass.axclass_tac lost the theory argument;
10615 * tuned current_goals_markers semantics: begin / end goal avoids
10616 printing empty lines;
10618 * removed prs and prs_fn hook, which was broken because it did not
10619 include \n in its semantics, forcing writeln to add one
10620 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10621 string -> unit if you really want to output text without newline;
10623 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10624 plain output, interface builders may have to enable 'isabelle_font'
10625 mode to get Isabelle font glyphs as before;
10627 * refined token_translation interface; INCOMPATIBILITY: output length
10628 now of type real instead of int;
10630 * theory loader actions may be traced via new ThyInfo.add_hook
10631 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10632 your own database of information attached to *whole* theories -- as
10633 opposed to intra-theory data slots offered via TheoryDataFun;
10635 * proper handling of dangling sort hypotheses (at last!);
10636 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10637 extra sort hypotheses that can be witnessed from the type signature;
10638 the force_strip_shyps flag is gone, any remaining shyps are simply
10639 left in the theorem (with a warning issued by strip_shyps_warning);
10643 New in Isabelle98-1 (October 1998)
10644 ----------------------------------
10646 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10648 * several changes of automated proof tools;
10650 * HOL: major changes to the inductive and datatype packages, including
10651 some minor incompatibilities of theory syntax;
10653 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10656 * HOL: removed duplicate thms in Arith:
10657 less_imp_add_less should be replaced by trans_less_add1
10658 le_imp_add_le should be replaced by trans_le_add1
10660 * HOL: unary minus is now overloaded (new type constraints may be
10663 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10664 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10665 now taken as an integer constant.
10667 * Pure: ML function 'theory_of' renamed to 'theory';
10670 *** Proof tools ***
10673 1. Asm_full_simp_tac is now more aggressive.
10674 1. It will sometimes reorient premises if that increases their power to
10676 2. It does no longer proceed strictly from left to right but may also
10677 rotate premises to achieve further simplification.
10678 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10679 old Asm_full_simp_tac in that it does not rotate premises.
10680 2. The simplifier now knows a little bit about nat-arithmetic.
10682 * Classical reasoner: wrapper mechanism for the classical reasoner now
10683 allows for selected deletion of wrappers, by introduction of names for
10684 wrapper functionals. This implies that addbefore, addSbefore,
10685 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10686 and that adding two tactics with the same name overwrites the first
10687 one (emitting a warning).
10688 type wrapper = (int -> tactic) -> (int -> tactic)
10689 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10690 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10691 delWrapper, delSWrapper: claset * string -> claset
10692 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10694 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10695 semantics; addbefore now affects only the unsafe part of step_tac
10696 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10697 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10700 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10701 compWrapper; added safe wrapper (and access functions for it);
10703 * HOL/split_all_tac is now much faster and fails if there is nothing
10704 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10705 and the names of the automatically generated variables have changed.
10706 split_all_tac has moved within claset() from unsafe wrappers to safe
10707 wrappers, which means that !!-bound variables are split much more
10708 aggressively, and safe_tac and clarify_tac now split such variables.
10709 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10710 Note: the same holds for record_split_tac, which does the job of
10711 split_all_tac for record fields.
10713 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10714 permanently to the default simpset using Addsplits just like
10715 Addsimps. They can be removed via Delsplits just like
10716 Delsimps. Lower-case versions are also available.
10718 * HOL/Simplifier: The rule split_if is now part of the default
10719 simpset. This means that the simplifier will eliminate all occurrences
10720 of if-then-else in the conclusion of a goal. To prevent this, you can
10721 either remove split_if completely from the default simpset by
10722 `Delsplits [split_if]' or remove it in a specific call of the
10723 simplifier using `... delsplits [split_if]'. You can also add/delete
10724 other case splitting rules to/from the default simpset: every datatype
10725 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10726 t is the name of the datatype).
10728 * Classical reasoner / Simplifier combination: new force_tac (and
10729 derivatives Force_tac, force) combines rewriting and classical
10730 reasoning (and whatever other tools) similarly to auto_tac, but is
10731 aimed to solve the given subgoal completely.
10736 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10737 and `goalw': the theory is no longer needed as an explicit argument -
10738 the current theory context is used; assumptions are no longer returned
10739 at the ML-level unless one of them starts with ==> or !!; it is
10740 recommended to convert to these new commands using isatool fixgoal
10741 (backup your sources first!);
10743 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10744 the current theory context, and 'theory' to lookup stored theories;
10746 * new theory section 'locale' for declaring constants, assumptions and
10747 definitions that have local scope;
10749 * new theory section 'nonterminals' for purely syntactic types;
10751 * new theory section 'setup' for generic ML setup functions
10752 (e.g. package initialization);
10754 * the distribution now includes Isabelle icons: see
10755 lib/logo/isabelle-{small,tiny}.xpm;
10757 * isatool install - install binaries with absolute references to
10760 * isatool logo -- create instances of the Isabelle logo (as EPS);
10762 * print mode 'emacs' reserved for Isamode;
10764 * support multiple print (ast) translations per constant name;
10766 * theorems involving oracles are now printed with a suffixed [!];
10771 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10773 * HOL/inductive package reorganized and improved: now supports mutual
10774 definitions such as
10779 oddI "n : EVEN ==> Suc n : ODD"
10780 evenI "n : ODD ==> Suc n : EVEN"
10782 new theorem list "elims" contains an elimination rule for each of the
10783 recursive sets; inductive definitions now handle disjunctive premises
10784 correctly (also ZF);
10786 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10787 "mutual_induct" no longer exists - the induction rule is always
10788 contained in "induct";
10791 * HOL/datatype package re-implemented and greatly improved: now
10792 supports mutually recursive datatypes such as
10795 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10796 | SUM ('a aexp) ('a aexp)
10797 | DIFF ('a aexp) ('a aexp)
10800 'a bexp = LESS ('a aexp) ('a aexp)
10801 | AND ('a bexp) ('a bexp)
10802 | OR ('a bexp) ('a bexp)
10804 as well as indirectly recursive datatypes such as
10807 ('a, 'b) term = Var 'a
10808 | App 'b ((('a, 'b) term) list)
10810 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10811 induction on mutually / indirectly recursive datatypes.
10813 Primrec equations are now stored in theory and can be accessed via
10814 <function_name>.simps.
10818 - Theories using datatypes must now have theory Datatype as an
10820 - The specific <typename>.induct_tac no longer exists - use the
10821 generic induct_tac instead.
10822 - natE has been renamed to nat.exhaust - use exhaust_tac
10823 instead of res_inst_tac ... natE. Note that the variable
10824 names in nat.exhaust differ from the names in natE, this
10825 may cause some "fragile" proofs to fail.
10826 - The theorems split_<typename>_case and split_<typename>_case_asm
10827 have been renamed to <typename>.split and <typename>.split_asm.
10828 - Since default sorts of type variables are now handled correctly,
10829 some datatype definitions may have to be annotated with explicit
10831 - Primrec definitions no longer require function name and type
10832 of recursive argument.
10834 Consider using isatool fixdatatype to adapt your theories and proof
10835 scripts to the new package (backup your sources first!).
10838 * HOL/record package: considerably improved implementation; now
10839 includes concrete syntax for record types, terms, updates; theorems
10840 for surjective pairing and splitting !!-bound record variables; proof
10841 support is as follows:
10843 1) standard conversions (selectors or updates applied to record
10844 constructor terms) are part of the standard simpset;
10846 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10847 made part of standard simpset and claset via addIffs;
10849 3) a tactic for record field splitting (record_split_tac) is part of
10850 the standard claset (addSWrapper);
10852 To get a better idea about these rules you may retrieve them via
10853 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10854 the name of your record type.
10856 The split tactic 3) conceptually simplifies by the following rule:
10858 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10860 Thus any record variable that is bound by meta-all will automatically
10861 blow up into some record constructor term, consequently the
10862 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10863 solve record problems automatically.
10866 * reorganized the main HOL image: HOL/Integ and String loaded by
10867 default; theory Main includes everything;
10869 * automatic simplification of integer sums and comparisons, using cancellation;
10871 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10873 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10875 * many new identities for unions, intersections, set difference, etc.;
10877 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10878 called split_if, split_split, split_sum_case and split_nat_case (to go
10879 with add/delsplits);
10881 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10882 (?x::unit) = (); this is made part of the default simpset, which COULD
10883 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10884 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10885 unit_abs_eta_conv is added in order to counter the effect of
10886 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10889 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10892 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10893 It and 'sym RS equals0D' are now in the default claset, giving automatic
10894 disjointness reasoning but breaking a few old proofs.
10896 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10897 to 'converse' from 'inverse' (for compatibility with ZF and some
10900 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10901 the well-founded relation;
10903 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10904 Compl A. The "Compl" syntax remains available as input syntax for this
10907 * HOL/Update: new theory of function updates:
10908 f(a:=b) == %x. if x=a then b else f x
10909 may also be iterated as in f(a:=b,c:=d,...);
10911 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10914 - new function list_update written xs[i:=v] that updates the i-th
10915 list position. May also be iterated as in xs[i:=a,j:=b,...].
10916 - new function `upt' written [i..j(] which generates the list
10917 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10918 bound write [i..j], which is a shorthand for [i..j+1(].
10919 - new lexicographic orderings and corresponding wellfoundedness theorems.
10922 - removed 'pred' (predecessor) function;
10923 - generalized some theorems about n-1;
10924 - many new laws about "div" and "mod";
10925 - new laws about greatest common divisors (see theory ex/Primes);
10927 * HOL/Relation: renamed the relational operator r^-1 "converse"
10928 instead of "inverse";
10930 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10931 of the multiset ordering;
10933 * directory HOL/Real: a construction of the reals using Dedekind cuts
10934 (not included by default);
10936 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10938 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10939 programs, i.e. different program variables may have different types.
10941 * calling (stac rew i) now fails if "rew" has no effect on the goal
10942 [previously, this check worked only if the rewrite rule was unconditional]
10943 Now rew can involve either definitions or equalities (either == or =).
10948 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10949 only the theorems proved on ZF.ML;
10951 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10952 It and 'sym RS equals0D' are now in the default claset, giving automatic
10953 disjointness reasoning but breaking a few old proofs.
10955 * ZF/Update: new theory of function updates
10956 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10957 may also be iterated as in f(a:=b,c:=d,...);
10959 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10961 * calling (stac rew i) now fails if "rew" has no effect on the goal
10962 [previously, this check worked only if the rewrite rule was unconditional]
10963 Now rew can involve either definitions or equalities (either == or =).
10965 * case_tac provided for compatibility with HOL
10966 (like the old excluded_middle_tac, but with subgoals swapped)
10969 *** Internal programming interfaces ***
10971 * Pure: several new basic modules made available for general use, see
10972 also src/Pure/README;
10974 * improved the theory data mechanism to support encapsulation (data
10975 kind name replaced by private Object.kind, acting as authorization
10976 key); new type-safe user interface via functor TheoryDataFun; generic
10977 print_data function becomes basically useless;
10979 * removed global_names compatibility flag -- all theory declarations
10980 are qualified by default;
10982 * module Pure/Syntax now offers quote / antiquote translation
10983 functions (useful for Hoare logic etc. with implicit dependencies);
10984 see HOL/ex/Antiquote for an example use;
10986 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10989 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10992 * Display.print_goals function moved to Locale.print_goals;
10994 * standard print function for goals supports current_goals_markers
10995 variable for marking begin of proof, end of proof, start of goal; the
10996 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10997 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11002 New in Isabelle98 (January 1998)
11003 --------------------------------
11005 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11007 * changed lexical syntax of terms / types: dots made part of long
11008 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11010 * simpset (and claset) reference variable replaced by functions
11011 simpset / simpset_ref;
11013 * no longer supports theory aliases (via merge) and non-trivial
11014 implicit merge of thms' signatures;
11016 * most internal names of constants changed due to qualified names;
11018 * changed Pure/Sequence interface (see Pure/seq.ML);
11021 *** General Changes ***
11023 * hierachically structured name spaces (for consts, types, axms, thms
11024 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11025 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11026 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11027 long_names for fully qualified output names; NOTE: ML programs
11028 (special tactics, packages etc.) referring to internal names may have
11029 to be adapted to cope with fully qualified names; in case of severe
11030 backward campatibility problems try setting 'global_names' at compile
11031 time to have enrything declared within a flat name space; one may also
11032 fine tune name declarations in theories via the 'global' and 'local'
11035 * reimplemented the implicit simpset and claset using the new anytype
11036 data filed in signatures; references simpset:simpset ref etc. are
11037 replaced by functions simpset:unit->simpset and
11038 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11039 to patch your ML files accordingly;
11041 * HTML output now includes theory graph data for display with Java
11042 applet or isatool browser; data generated automatically via isatool
11043 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11045 * defs may now be conditional; improved rewrite_goals_tac to handle
11046 conditional equations;
11048 * defs now admits additional type arguments, using TYPE('a) syntax;
11050 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11051 creates a new theory node; implicit merge of thms' signatures is
11052 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11053 transfer:theory->thm->thm in (rare) cases;
11055 * improved handling of draft signatures / theories; draft thms (and
11056 ctyps, cterms) are automatically promoted to real ones;
11058 * slightly changed interfaces for oracles: admit many per theory, named
11059 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11061 * print_goals: optional output of const types (set show_consts and
11064 * improved output of warnings (###) and errors (***);
11066 * subgoal_tac displays a warning if the new subgoal has type variables;
11068 * removed old README and Makefiles;
11070 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11072 * removed obsolete init_pps and init_database;
11074 * deleted the obsolete tactical STATE, which was declared by
11075 fun STATE tacfun st = tacfun st st;
11077 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11078 (which abbreviates $HOME);
11080 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11081 use isatool fixseq to adapt your ML programs (this works for fully
11082 qualified references to the Sequence structure only!);
11084 * use_thy no longer requires writable current directory; it always
11085 reloads .ML *and* .thy file, if either one is out of date;
11088 *** Classical Reasoner ***
11090 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11091 tactics that use classical reasoning to simplify a subgoal without
11092 splitting it into several subgoals;
11094 * Safe_tac: like safe_tac but uses the default claset;
11099 * added simplification meta rules:
11100 (asm_)(full_)simplify: simpset -> thm -> thm;
11102 * simplifier.ML no longer part of Pure -- has to be loaded by object
11105 * added prems argument to simplification procedures;
11107 * HOL, FOL, ZF: added infix function `addsplits':
11108 instead of `<simpset> setloop (split_tac <thms>)'
11109 you can simply write `<simpset> addsplits <thms>'
11114 * TYPE('a) syntax for type reflection terms;
11116 * no longer handles consts with name "" -- declare as 'syntax' instead;
11118 * pretty printer: changed order of mixfix annotation preference (again!);
11120 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11125 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11126 with `addloop' of the simplifier to faciliate case splitting in premises.
11128 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11130 * HOL/Auth: new protocol proofs including some for the Internet
11133 * HOL/Map: new theory of `maps' a la VDM;
11135 * HOL/simplifier: simplification procedures nat_cancel_sums for
11136 cancelling out common nat summands from =, <, <= (in)equalities, or
11137 differences; simplification procedures nat_cancel_factor for
11138 cancelling common factor from =, <, <= (in)equalities over natural
11139 sums; nat_cancel contains both kinds of procedures, it is installed by
11140 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11142 * HOL/simplifier: terms of the form
11143 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11145 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11146 and those of the form
11147 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11149 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11152 Each datatype `t' now comes with a theorem `split_t_case' of the form
11154 P(t_case f1 ... fn x) =
11155 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11157 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11160 and a theorem `split_t_case_asm' of the form
11162 P(t_case f1 ... fn x) =
11163 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11165 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11167 which can be added to a simpset via `addsplits'. The existing theorems
11168 expand_list_case and expand_option_case have been renamed to
11169 split_list_case and split_option_case.
11172 - `pred n' is automatically converted to `n-1'.
11173 Users are strongly encouraged not to use `pred' any longer,
11174 because it will disappear altogether at some point.
11175 - Users are strongly encouraged to write "0 < n" rather than
11176 "n ~= 0". Theorems and proof tools have been modified towards this
11180 the function "set_of_list" has been renamed "set" (and its theorems too);
11181 the function "nth" now takes its arguments in the reverse order and
11182 has acquired the infix notation "!" as in "xs!n".
11184 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11186 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11187 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11189 * HOL/record: extensible records with schematic structural subtyping
11190 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11191 still lacks various theorems and concrete record syntax;
11196 * removed "axioms" and "generated by" sections;
11198 * replaced "ops" section by extended "consts" section, which is capable of
11199 handling the continuous function space "->" directly;
11202 . proves theorems immediately and stores them in the theory,
11203 . creates hierachical name space,
11204 . now uses normal mixfix annotations (instead of cinfix...),
11205 . minor changes to some names and values (for consistency),
11206 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11207 . separator between mutual domain defs: changed "," to "and",
11208 . improved handling of sort constraints; now they have to
11209 appear on the left-hand side of the equations only;
11211 * fixed LAM <x,y,zs>.b syntax;
11213 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11214 adm (%x. P (t x)), where P is chainfinite and t continuous;
11219 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11220 with `addloop' of the simplifier to faciliate case splitting in premises.
11222 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11223 in HOL, they strip ALL and --> from proved theorems;
11227 New in Isabelle94-8 (May 1997)
11228 ------------------------------
11230 *** General Changes ***
11232 * new utilities to build / run / maintain Isabelle etc. (in parts
11233 still somewhat experimental); old Makefiles etc. still functional;
11235 * new 'Isabelle System Manual';
11237 * INSTALL text, together with ./configure and ./build scripts;
11239 * reimplemented type inference for greater efficiency, better error
11240 messages and clean internal interface;
11242 * prlim command for dealing with lots of subgoals (an easier way of
11243 setting goals_limit);
11248 * supports alternative (named) syntax tables (parser and pretty
11249 printer); internal interface is provided by add_modesyntax(_i);
11251 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11252 be used in conjunction with the Isabelle symbol font; uses the
11253 "symbols" syntax table;
11255 * added token_translation interface (may translate name tokens in
11256 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11257 the current print_mode); IMPORTANT: user print translation functions
11258 are responsible for marking newly introduced bounds
11259 (Syntax.mark_boundT);
11261 * token translations for modes "xterm" and "xterm_color" that display
11262 names in bold, underline etc. or colors (which requires a color
11265 * infixes may now be declared with names independent of their syntax;
11267 * added typed_print_translation (like print_translation, but may
11268 access type of constant);
11271 *** Classical Reasoner ***
11273 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11274 some limitations. Blast_tac...
11275 + ignores addss, addbefore, addafter; this restriction is intrinsic
11276 + ignores elimination rules that don't have the correct format
11277 (the conclusion MUST be a formula variable)
11278 + ignores types, which can make HOL proofs fail
11279 + rules must not require higher-order unification, e.g. apply_type in ZF
11280 [message "Function Var's argument not a bound variable" relates to this]
11281 + its proof strategy is more general but can actually be slower
11283 * substitution with equality assumptions no longer permutes other
11286 * minor changes in semantics of addafter (now called addaltern); renamed
11287 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11288 (and access functions for it);
11290 * improved combination of classical reasoner and simplifier:
11291 + functions for handling clasimpsets
11292 + improvement of addss: now the simplifier is called _after_ the
11294 + safe variant of addss called addSss: uses safe simplifications
11295 _during_ the safe steps. It is more complete as it allows multiple
11296 instantiations of unknowns (e.g. with slow_tac).
11300 * added interface for simplification procedures (functions that
11301 produce *proven* rewrite rules on the fly, depending on current
11304 * ordering on terms as parameter (used for ordered rewriting);
11306 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11308 * the solver is now split into a safe and an unsafe part.
11309 This should be invisible for the normal user, except that the
11310 functions setsolver and addsolver have been renamed to setSolver and
11311 addSolver; added safe_asm_full_simp_tac;
11316 * a generic induction tactic `induct_tac' which works for all datatypes and
11317 also for type `nat';
11319 * a generic case distinction tactic `exhaust_tac' which works for all
11320 datatypes and also for type `nat';
11322 * each datatype comes with a function `size';
11324 * patterns in case expressions allow tuple patterns as arguments to
11325 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11327 * primrec now also works with type nat;
11329 * recdef: a new declaration form, allows general recursive functions to be
11330 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11332 * the constant for negation has been renamed from "not" to "Not" to
11333 harmonize with FOL, ZF, LK, etc.;
11335 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11338 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11340 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11341 problems in commutative rings, using axiomatic type classes for + and *;
11343 * more examples in HOL/MiniML and HOL/Auth;
11345 * more default rewrite rules for quantifiers, union/intersection;
11347 * a new constant `arbitrary == @x.False';
11349 * HOLCF/IOA replaces old HOL/IOA;
11351 * HOLCF changes: derived all rules and arities
11352 + axiomatic type classes instead of classes
11353 + typedef instead of faking type definitions
11354 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11355 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11356 + eliminated the types void, one, tr
11357 + use unit lift and bool lift (with translations) instead of one and tr
11358 + eliminated blift from Lift3.thy (use Def instead of blift)
11359 all eliminated rules are derived as theorems --> no visible changes ;
11364 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11365 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11366 as ZF_cs addSIs [equalityI];
11370 New in Isabelle94-7 (November 96)
11371 ---------------------------------
11373 * allowing negative levels (as offsets) in prlev and choplev;
11375 * super-linear speedup for large simplifications;
11377 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11378 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11379 FAIL); can suppress it using the command Delsimps (ex_simps @
11380 all_simps); De Morgan laws are also now included, by default;
11382 * improved printing of ==> : ~:
11384 * new object-logic "Sequents" adds linear logic, while replacing LK
11385 and Modal (thanks to Sara Kalvala);
11387 * HOL/Auth: correctness proofs for authentication protocols;
11389 * HOL: new auto_tac combines rewriting and classical reasoning (many
11390 examples on HOL/Auth);
11392 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11393 the rewriter and classical reasoner simultaneously;
11395 * function uresult no longer returns theorems in "standard" format;
11396 regain previous version by: val uresult = standard o uresult;
11400 New in Isabelle94-6
11401 -------------------
11403 * oracles -- these establish an interface between Isabelle and trusted
11404 external reasoners, which may deliver results as theorems;
11406 * proof objects (in particular record all uses of oracles);
11408 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11410 * "constdefs" section in theory files;
11412 * "primrec" section (HOL) no longer requires names;
11414 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11418 New in Isabelle94-5
11419 -------------------
11421 * reduced space requirements;
11423 * automatic HTML generation from theories;
11425 * theory files no longer require "..." (quotes) around most types;
11427 * new examples, including two proofs of the Church-Rosser theorem;
11429 * non-curried (1994) version of HOL is no longer distributed;
11433 New in Isabelle94-4
11434 -------------------
11436 * greatly reduced space requirements;
11438 * theory files (.thy) no longer require \...\ escapes at line breaks;
11440 * searchable theorem database (see the section "Retrieving theorems" on
11441 page 8 of the Reference Manual);
11443 * new examples, including Grabczewski's monumental case study of the
11446 * The previous version of HOL renamed to Old_HOL;
11448 * The new version of HOL (previously called CHOL) uses a curried syntax
11449 for functions. Application looks like f a b instead of f(a,b);
11451 * Mutually recursive inductive definitions finally work in HOL;
11453 * In ZF, pattern-matching on tuples is now available in all abstractions and
11454 translates to the operator "split";
11458 New in Isabelle94-3
11459 -------------------
11461 * new infix operator, addss, allowing the classical reasoner to
11462 perform simplification at each step of its search. Example:
11463 fast_tac (cs addss ss)
11465 * a new logic, CHOL, the same as HOL, but with a curried syntax
11466 for functions. Application looks like f a b instead of f(a,b). Also pairs
11467 look like (a,b) instead of <a,b>;
11469 * PLEASE NOTE: CHOL will eventually replace HOL!
11471 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11472 It translates to the operator "split". A new theory of integers is available;
11474 * In ZF, integer numerals now denote two's-complement binary integers.
11475 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11477 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11478 of the Axiom of Choice;
11482 New in Isabelle94-2
11483 -------------------
11485 * Significantly faster resolution;
11487 * the different sections in a .thy file can now be mixed and repeated
11490 * Database of theorems for FOL, HOL and ZF. New
11491 commands including qed, qed_goal and bind_thm store theorems in the database.
11493 * Simple database queries: return a named theorem (get_thm) or all theorems of
11494 a given theory (thms_of), or find out what theory a theorem was proved in
11497 * Bugs fixed in the inductive definition and datatype packages;
11499 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11500 and HOL_dup_cs obsolete;
11502 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11505 * Simpler definition of function space in ZF;
11507 * new results about cardinal and ordinal arithmetic in ZF;
11509 * 'subtype' facility in HOL for introducing new types as subsets of existing
11512 :mode=isabelle-news:wrap=hard:maxLineLen=72: