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 * Search field for all output panels ("Output", "Query", "Info" etc.)
121 to highlight text via regular expression.
123 * Option "jedit_print_mode" (see also "Plugin Options / Isabelle /
124 General") allows to specify additional print modes for the prover
125 process, without requiring old-fashioned command-line invocation of
126 "isabelle jedit -m MODE".
128 * New panel: Simplifier trace. Provides an interactive view of the
129 simplification process, enabled by the newly-introduced
130 "simplifier_trace" declaration.
132 * Support for Navigator plugin (with toolbar buttons).
134 * More support for remote files (e.g. http) using standard Java
135 networking operations instead of jEdit virtual file-systems.
137 * Improved Console/Scala plugin: more uniform scala.Console output,
138 more robust treatment of threads and interrupts.
143 * Basic constants of Pure use more conventional names and are always
144 qualified. Rare INCOMPATIBILITY, but with potentially serious
145 consequences, notably for tools in Isabelle/ML. The following
146 renaming needs to be applied:
152 dummy_pattern ~> Pure.dummy_pattern
154 Systematic porting works by using the following theory setup on a
155 *previous* Isabelle version to introduce the new name accesses for the
161 |> Sign.const_alias (Binding.qualify true "Pure" @{binding eq}) "=="
162 |> Sign.const_alias (Binding.qualify true "Pure" @{binding imp}) "==>"
163 |> Sign.const_alias (Binding.qualify true "Pure" @{binding all}) "all"
164 |> Sign.restore_naming thy
167 Thus ML antiquotations like @{const_name Pure.eq} may be used already.
168 Later the application is moved to the current Isabelle version, and
169 the auxiliary aliases are deleted.
171 * Low-level type-class commands 'classes', 'classrel', 'arities' have
172 been discontinued to avoid the danger of non-trivial axiomatization
173 that is not immediately visible. INCOMPATIBILITY, use regular
174 'instance' with proof. The required OFCLASS(...) theorem might be
175 postulated via 'axiomatization' beforehand, or the proof finished
176 trivially if the underlying class definition is made vacuous (without
177 any assumptions). See also Isabelle/ML operations
178 Axclass.axiomatize_class, Axclass.axiomatize_classrel,
179 Axclass.axiomatize_arity.
181 * Attributes "where" and "of" allow an optional context of local
182 variables ('for' declaration): these variables become schematic in the
183 instantiated theorem.
185 * Obsolete attribute "standard" has been discontinued (legacy since
186 Isabelle2012). Potential INCOMPATIBILITY, use explicit 'for' context
187 where instantiations with schematic variables are intended (for
188 declaration commands like 'lemmas' or attributes like "of"). The
189 following temporary definition may help to port old applications:
191 attribute_setup standard =
192 "Scan.succeed (Thm.rule_attribute (K Drule.export_without_context))"
194 * More thorough check of proof context for goal statements and
195 attributed fact expressions (concerning background theory, declared
196 hyps). Potential INCOMPATIBILITY, tools need to observe standard
197 context discipline. See also Assumption.add_assumes and the more
198 primitive Thm.assume_hyps.
200 * Inner syntax token language allows regular quoted strings "..."
201 (only makes sense in practice, if outer syntax is delimited
207 * Adjustion of INF and SUP operations:
208 * Elongated constants INFI and SUPR to INFIMUM and SUPREMUM.
209 * Consolidated theorem names containing INFI and SUPR: have INF
210 and SUP instead uniformly.
211 * More aggressive normalization of expressions involving INF and Inf
213 * INF_image and SUP_image do not unfold composition.
214 * Dropped facts INF_comp, SUP_comp.
215 * Default congruence rules strong_INF_cong and strong_SUP_cong,
216 with simplifier implication in premises. Generalize and replace
217 former INT_cong, SUP_cong
220 * Swapped orientation of facts image_comp and vimage_comp:
221 image_compose ~> image_comp [symmetric]
222 image_comp ~> image_comp [symmetric]
223 vimage_compose ~> vimage_comp [symmetric]
224 vimage_comp ~> vimage_comp [symmetric]
227 * Simplifier: Enhanced solver of preconditions of rewrite rules
228 can now deal with conjunctions.
229 For help with converting proofs, the old behaviour of the simplifier
230 can be restored like this: declare/using [[simp_legacy_precond]]
231 This configuration option will disappear again in the future.
234 * Abandoned fact collection "word_arith_alts", which is a
235 duplicate of "word_arith_wis".
236 * Dropped first (duplicated) element in fact collections
237 "sint_word_ariths", "word_arith_alts", "uint_word_ariths",
238 "uint_word_arith_bintrs".
240 * Code generator: enforce case of identifiers only for strict
241 target language requirements. INCOMPATIBILITY.
243 * Code generator: explicit proof contexts in many ML interfaces.
246 * Code generator: minimize exported identifiers by default.
247 Minor INCOMPATIBILITY.
249 * Code generation for SML and OCaml: dropped arcane "no_signatures" option.
250 Minor INCOMPATIBILITY.
252 * Simproc "finite_Collect" is no longer enabled by default, due to
253 spurious crashes and other surprises. Potential INCOMPATIBILITY.
255 * Moved new (co)datatype package and its dependencies from "HOL-BNF" to "HOL".
256 The "bnf", "wrap_free_constructors", "datatype_new", "codatatype",
257 "primcorec", and "primcorecursive" commands are now part of "Main".
259 FunDef.thy ~> Fun_Def.thy (and Fun_Def_Base.thy)
260 Library/Wfrec.thy ~> Wfrec.thy
261 Library/Zorn.thy ~> Zorn.thy
262 Cardinals/Order_Relation.thy ~> Order_Relation.thy
263 Library/Order_Union.thy ~> Cardinals/Order_Union.thy
264 Cardinals/Cardinal_Arithmetic_Base.thy ~> BNF_Cardinal_Arithmetic.thy
265 Cardinals/Cardinal_Order_Relation_Base.thy ~> BNF_Cardinal_Order_Relation.thy
266 Cardinals/Constructions_on_Wellorders_Base.thy ~> BNF_Constructions_on_Wellorders.thy
267 Cardinals/Wellorder_Embedding_Base.thy ~> BNF_Wellorder_Embedding.thy
268 Cardinals/Wellorder_Relation_Base.thy ~> BNF_Wellorder_Relation.thy
269 BNF/Ctr_Sugar.thy ~> Ctr_Sugar.thy
270 BNF/Basic_BNFs.thy ~> Basic_BNFs.thy
271 BNF/BNF_Comp.thy ~> BNF_Comp.thy
272 BNF/BNF_Def.thy ~> BNF_Def.thy
273 BNF/BNF_FP_Base.thy ~> BNF_FP_Base.thy
274 BNF/BNF_GFP.thy ~> BNF_GFP.thy
275 BNF/BNF_LFP.thy ~> BNF_LFP.thy
276 BNF/BNF_Util.thy ~> BNF_Util.thy
277 BNF/Coinduction.thy ~> Coinduction.thy
278 BNF/More_BNFs.thy ~> Library/More_BNFs.thy
279 BNF/Countable_Type.thy ~> Library/Countable_Set_Type.thy
280 BNF/Examples/* ~> BNF_Examples/*
282 Wellorder_Extension.thy (split from Zorn.thy)
283 Library/Cardinal_Notations.thy
285 BNF_Examples/Misc_Primcorec.thy
286 BNF_Examples/Stream_Processor.thy
287 Discontinued theories:
289 BNF/Equiv_Relations_More.thy
292 * New (co)datatype package:
293 * "primcorec" is fully implemented.
294 * "datatype_new" generates size functions ("size_xxx" and "size") as
296 * BNFs are integrated with the Lifting tool and new-style (co)datatypes
299 datatype_new_compat ~> datatype_compat
300 primrec_new ~> primrec
301 wrap_free_constructors ~> free_constructors
303 * The generated constants "xxx_case" and "xxx_rec" have been renamed
304 "case_xxx" and "rec_xxx" (e.g., "prod_case" ~> "case_prod").
306 * The constant "xxx_(un)fold" and related theorems are no longer generated.
307 Use "xxx_(co)rec" or define "xxx_(un)fold" manually using "prim(co)rec".
310 * Old datatype package:
311 * The generated theorems "xxx.cases" and "xxx.recs" have been renamed
312 "xxx.case" and "xxx.rec" (e.g., "sum.cases" -> "sum.case").
314 * The generated constants "xxx_case", "xxx_rec", and "xxx_size" have been
315 renamed "case_xxx", "rec_xxx", and "size_xxx" (e.g., "prod_case" ~>
319 * The types "'a list" and "'a option", their set and map functions, their
320 relators, and their selectors are now produced using the new BNF-based
323 Option.set ~> set_option
324 Option.map ~> map_option
325 option_rel ~> rel_option
327 set_def ~> set_rec[abs_def]
328 map_def ~> map_rec[abs_def]
329 Option.map_def ~> map_option_case[abs_def] (with "case_option" instead of "rec_option")
330 option.recs ~> option.rec
331 list_all2_def ~> list_all2_iff
332 set.simps ~> set_simps (or the slightly different "list.set")
333 map.simps ~> list.map
334 hd.simps ~> list.sel(1)
335 tl.simps ~> list.sel(2-3)
336 the.simps ~> option.sel
339 * The following map functions and relators have been renamed:
346 filter_rel ~> rel_filter
347 fset_rel ~> rel_fset (in "Library/FSet.thy")
348 cset_rel ~> rel_cset (in "Library/Countable_Set_Type.thy")
349 vset ~> rel_vset (in "Library/Quotient_Set.thy")
352 Cardinals/Ordinal_Arithmetic.thy
354 * Theory reorganizations:
355 * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
357 * New internal SAT solver "cdclite" that produces models and proof traces.
358 This solver replaces the internal SAT solvers "enumerate" and "dpll".
359 Applications that explicitly used one of these two SAT solvers should
360 use "cdclite" instead. In addition, "cdclite" is now the default SAT
361 solver for the "sat" and "satx" proof methods and corresponding tactics;
362 the old default can be restored using
363 "declare [[sat_solver = zchaff_with_proofs]]". Minor INCOMPATIBILITY.
366 * A new version of the SMT module, temporarily called "SMT2", uses SMT-LIB 2
367 and supports recent versions of Z3 (e.g., 4.3). The new proof method is
368 called "smt2", and the new Z3 is called "z3_new" in Sledgehammer and
372 - New prover "z3_new" with support for Isar proofs
376 isar_compress ~> compress_isar
377 isar_try0 ~> try0_isar
381 - Removed legacy proof method 'metisFT'. Use 'metis (full_types)' instead.
384 * Try0: Added 'algebra' and 'meson' to the set of proof methods.
386 * Command renaming: enriched_type ~> functor. INCOMPATIBILITY.
388 * The symbol "\<newline>" may be used within char or string literals
389 to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
391 * Activation of Z3 now works via "z3_non_commercial" system option
392 (without requiring restart), instead of former settings variable
393 "Z3_NON_COMMERCIAL". The option can be edited in Isabelle/jEdit menu
394 Plugin Options / Isabelle / General.
396 * "declare [[code abort: ...]]" replaces "code_abort ...".
399 * "declare [[code drop: ...]]" drops all code equations associated
400 with the given constants.
402 * Abolished slightly odd global lattice interpretation for min/max.
405 min_max.inf_assoc ~> min.assoc
406 min_max.inf_commute ~> min.commute
407 min_max.inf_left_commute ~> min.left_commute
408 min_max.inf_idem ~> min.idem
409 min_max.inf_left_idem ~> min.left_idem
410 min_max.inf_right_idem ~> min.right_idem
411 min_max.sup_assoc ~> max.assoc
412 min_max.sup_commute ~> max.commute
413 min_max.sup_left_commute ~> max.left_commute
414 min_max.sup_idem ~> max.idem
415 min_max.sup_left_idem ~> max.left_idem
416 min_max.sup_inf_distrib1 ~> max_min_distrib2
417 min_max.sup_inf_distrib2 ~> max_min_distrib1
418 min_max.inf_sup_distrib1 ~> min_max_distrib2
419 min_max.inf_sup_distrib2 ~> min_max_distrib1
420 min_max.distrib ~> min_max_distribs
421 min_max.inf_absorb1 ~> min.absorb1
422 min_max.inf_absorb2 ~> min.absorb2
423 min_max.sup_absorb1 ~> max.absorb1
424 min_max.sup_absorb2 ~> max.absorb2
425 min_max.le_iff_inf ~> min.absorb_iff1
426 min_max.le_iff_sup ~> max.absorb_iff2
427 min_max.inf_le1 ~> min.cobounded1
428 min_max.inf_le2 ~> min.cobounded2
429 le_maxI1, min_max.sup_ge1 ~> max.cobounded1
430 le_maxI2, min_max.sup_ge2 ~> max.cobounded2
431 min_max.le_infI1 ~> min.coboundedI1
432 min_max.le_infI2 ~> min.coboundedI2
433 min_max.le_supI1 ~> max.coboundedI1
434 min_max.le_supI2 ~> max.coboundedI2
435 min_max.less_infI1 ~> min.strict_coboundedI1
436 min_max.less_infI2 ~> min.strict_coboundedI2
437 min_max.less_supI1 ~> max.strict_coboundedI1
438 min_max.less_supI2 ~> max.strict_coboundedI2
439 min_max.inf_mono ~> min.mono
440 min_max.sup_mono ~> max.mono
441 min_max.le_infI, min_max.inf_greatest ~> min.boundedI
442 min_max.le_supI, min_max.sup_least ~> max.boundedI
443 min_max.le_inf_iff ~> min.bounded_iff
444 min_max.le_sup_iff ~> max.bounded_iff
446 For min_max.inf_sup_aci, prefer (one of) min.commute, min.assoc,
447 min.left_commute, min.left_idem, max.commute, max.assoc,
448 max.left_commute, max.left_idem directly.
450 For min_max.inf_sup_ord, prefer (one of) min.cobounded1, min.cobounded2,
451 max.cobounded1m max.cobounded2 directly.
453 For min_ac or max_ac, prefer more general collection ac_simps.
457 * Word library: bit representations prefer type bool over type bit.
460 * Theorem disambiguation Inf_le_Sup (on finite sets) ~> Inf_fin_le_Sup_fin.
463 * Code generations are provided for make, fields, extend and truncate
464 operations on records.
466 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
469 * Fact generalization and consolidation:
470 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
473 * Purely algebraic definition of even. Fact generalization and consolidation:
474 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
475 even_zero_(nat|int) ~> even_zero
478 * Abolished neg_numeral.
479 * Canonical representation for minus one is "- 1".
480 * Canonical representation for other negative numbers is "- (numeral _)".
481 * When devising rule sets for number calculation, consider the
482 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
483 * HOLogic.dest_number also recognizes numerals in non-canonical forms
484 like "numeral One", "- numeral One", "- 0" and even "- ... - _".
485 * Syntax for negative numerals is mere input syntax.
488 * Elimination of fact duplicates:
489 equals_zero_I ~> minus_unique
490 diff_eq_0_iff_eq ~> right_minus_eq
491 nat_infinite ~> infinite_UNIV_nat
492 int_infinite ~> infinite_UNIV_int
495 * Fact name consolidation:
496 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
497 minus_le_self_iff ~> neg_less_eq_nonneg
498 le_minus_self_iff ~> less_eq_neg_nonpos
499 neg_less_nonneg ~> neg_less_pos
500 less_minus_self_iff ~> less_neg_neg [simp]
503 * More simplification rules on unary and binary minus:
504 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
505 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
506 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
507 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
508 minus_add_cancel, uminus_add_conv_diff. These correspondingly
509 have been taken away from fact collections algebra_simps and
510 field_simps. INCOMPATIBILITY.
512 To restore proofs, the following patterns are helpful:
514 a) Arbitrary failing proof not involving "diff_def":
515 Consider simplification with algebra_simps or field_simps.
517 b) Lifting rules from addition to subtraction:
518 Try with "using <rule for addition> of [... "- _" ...]" by simp".
520 c) Simplification with "diff_def": just drop "diff_def".
521 Consider simplification with algebra_simps or field_simps;
522 or the brute way with
523 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
525 * SUP and INF generalized to conditionally_complete_lattice
527 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
528 Conditionally_Complete_Lattices. INCOMPATIBILITY.
530 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
531 instead of explicitly stating boundedness of sets.
533 * ccpo.admissible quantifies only over non-empty chains to allow
534 more syntax-directed proof rules; the case of the empty chain
535 shows up as additional case in fixpoint induction proofs.
538 * Removed and renamed theorems in Series:
539 summable_le ~> suminf_le
540 suminf_le ~> suminf_le_const
541 series_pos_le ~> setsum_le_suminf
542 series_pos_less ~> setsum_less_suminf
543 suminf_ge_zero ~> suminf_nonneg
544 suminf_gt_zero ~> suminf_pos
545 suminf_gt_zero_iff ~> suminf_pos_iff
546 summable_sumr_LIMSEQ_suminf ~> summable_LIMSEQ
547 suminf_0_le ~> suminf_nonneg [rotate]
548 pos_summable ~> summableI_nonneg_bounded
549 ratio_test ~> summable_ratio_test
551 removed series_zero, replaced by sums_finite
553 removed auxiliary lemmas:
554 sumr_offset, sumr_offset2, sumr_offset3, sumr_offset4, sumr_group,
555 half, le_Suc_ex_iff, lemma_realpow_diff_sumr, real_setsum_nat_ivl_bounded,
556 summable_le2, ratio_test_lemma2, sumr_minus_one_realpow_zerom,
557 sumr_one_lb_realpow_zero, summable_convergent_sumr_iff, sumr_diff_mult_const
560 * Replace (F)DERIV syntax by has_derivative:
561 - "(f has_derivative f') (at x within s)" replaces "FDERIV f x : s : f'"
563 - "(f has_field_derivative f') (at x within s)" replaces "DERIV f x : s : f'"
565 - "f differentiable at x within s" replaces "_ differentiable _ in _" syntax
567 - removed constant isDiff
569 - "DERIV f x : f'" and "FDERIV f x : f'" syntax is only available as input
572 - "DERIV f x : s : f'" and "FDERIV f x : s : f'" syntax removed
574 - Renamed FDERIV_... lemmas to has_derivative_...
576 - renamed deriv (the syntax constant used for "DERIV _ _ :> _") to DERIV
578 - removed DERIV_intros, has_derivative_eq_intros
580 - introduced derivative_intros and deriative_eq_intros which includes now rules for
581 DERIV, has_derivative and has_vector_derivative.
584 differentiable_def ~> real_differentiable_def
585 differentiableE ~> real_differentiableE
586 fderiv_def ~> has_derivative_at
587 field_fderiv_def ~> field_has_derivative_at
588 isDiff_der ~> differentiable_def
589 deriv_fderiv ~> has_field_derivative_def
590 deriv_def ~> DERIV_def
593 * Include more theorems in continuous_intros. Remove the continuous_on_intros,
594 isCont_intros collections, these facts are now in continuous_intros.
596 * Theorems about complex numbers are now stated only using Re and Im, the Complex
597 constructor is not used anymore. It is possible to use primcorec to defined the
598 behaviour of a complex-valued function.
600 Removed theorems about the Complex constructor from the simpset, they are
601 available as the lemma collection legacy_Complex_simps. This especially
603 i_complex_of_real: "ii * complex_of_real r = Complex 0 r".
605 Instead the reverse direction is supported with
606 Complex_eq: "Complex a b = a + \<i> * b"
608 Moved csqrt from Fundamental_Algebra_Theorem to Complex.
612 complex_Re/Im_zero ~> zero_complex.sel
613 complex_Re/Im_add ~> plus_complex.sel
614 complex_Re/Im_minus ~> uminus_complex.sel
615 complex_Re/Im_diff ~> minus_complex.sel
616 complex_Re/Im_one ~> one_complex.sel
617 complex_Re/Im_mult ~> times_complex.sel
618 complex_Re/Im_inverse ~> inverse_complex.sel
619 complex_Re/Im_scaleR ~> scaleR_complex.sel
620 complex_Re/Im_i ~> ii.sel
621 complex_Re/Im_cnj ~> cnj.sel
624 complex_divide_def ~> divide_complex_def
625 complex_norm_def ~> norm_complex_def
626 cmod_def ~> norm_complex_de
638 * Removed solvers remote_cvc3 and remote_z3. Use cvc3 and z3 instead.
641 - Fixed soundness bug whereby mutually recursive datatypes could take
643 - Fixed soundness bug with low-level number functions such as "Abs_Integ" and
645 - Removed "std" option.
646 - Renamed "show_datatypes" to "show_types" and "hide_datatypes" to
649 * HOL-Multivariate_Analysis:
650 - type class ordered_real_vector for ordered vector spaces
651 - changed order of ordered_euclidean_space to be compatible with
652 pointwise ordering on products. Therefore instance of
653 conditionally_complete_lattice and ordered_real_vector.
654 INCOMPATIBILITY: use box instead of greaterThanLessThan or
655 explicit set-comprehensions with eucl_less for other (half-) open
659 derivative_linear ~> has_derivative_bounded_linear
660 derivative_is_linear ~> has_derivative_linear
661 bounded_linear_imp_linear ~> bounded_linear.linear
666 * The signature and semantics of Document.Snapshot.cumulate_markup /
667 select_markup have been clarified. Markup is now traversed in the
668 order of reports given by the prover: later markup is usually more
669 specific and may override results accumulated so far. The elements
670 guard is mandatory and checked precisely. Subtle INCOMPATIBILITY.
675 * Moved ML_Compiler.exn_trace and other operations on exceptions to
676 structure Runtime. Minor INCOMPATIBILITY.
678 * Discontinued old Toplevel.debug in favour of system option
679 "ML_exception_trace", which may be also declared within the context via
680 "declare [[ML_exception_trace = true]]". Minor INCOMPATIBILITY.
682 * Renamed configuration option "ML_trace" to "ML_source_trace". Minor
685 * Configuration option "ML_print_depth" controls the pretty-printing
686 depth of the ML compiler within the context. The old print_depth in
687 ML is still available as default_print_depth, but rarely used. Minor
690 * Proper context discipline for read_instantiate and instantiate_tac:
691 variables that are meant to become schematic need to be given as
692 fixed, and are generalized by the explicit context of local variables.
693 This corresponds to Isar attributes "where" and "of" with 'for'
694 declaration. INCOMPATIBILITY, also due to potential change of indices
695 of schematic variables.
697 * Toplevel function "use" refers to raw ML bootstrap environment,
698 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
699 Note that 'ML_file' is the canonical command to load ML files into the
702 * Proper context for basic Simplifier operations: rewrite_rule,
703 rewrite_goals_rule, rewrite_goals_tac etc. INCOMPATIBILITY, need to
704 pass runtime Proof.context (and ensure that the simplified entity
705 actually belongs to it).
707 * Subtle change of semantics of Thm.eq_thm: theory stamps are not
708 compared (according to Thm.thm_ord), but assumed to be covered by the
709 current background theory. Thus equivalent data produced in different
710 branches of the theory graph usually coincides (e.g. relevant for
711 theory merge). Note that the softer Thm.eq_thm_prop is often more
712 appropriate than Thm.eq_thm.
714 * Simplified programming interface to define ML antiquotations, see
715 structure ML_Antiquotation. Minor INCOMPATIBILITY.
717 * ML antiquotation @{here} refers to its source position, which is
718 occasionally useful for experimentation and diagnostic purposes.
720 * ML antiquotation @{path} produces a Path.T value, similarly to
721 Path.explode, but with compile-time check against the file-system and
722 some PIDE markup. Note that unlike theory source, ML does not have a
723 well-defined master directory, so an absolute symbolic path
724 specification is usually required, e.g. "~~/src/HOL".
726 * ML antiquotation @{print} inlines a function to print an arbitrary
727 ML value, which is occasionally useful for diagnostic or demonstration
733 * Session ROOT specifications require explicit 'document_files' for
734 robust dependencies on LaTeX sources. Only these explicitly given
735 files are copied to the document output directory, before document
736 processing is started.
738 * Simplified "isabelle display" tool. Settings variables DVI_VIEWER
739 and PDF_VIEWER now refer to the actual programs, not shell
740 command-lines. Discontinued option -c: invocation may be asynchronous
741 via desktop environment, without any special precautions. Potential
742 INCOMPATIBILITY with ambitious private settings.
744 * Improved 'display_drafts' concerning desktop integration and
745 repeated invocation in PIDE front-end: re-use single file
746 $ISABELLE_HOME_USER/tmp/drafts.pdf and corresponding views.
748 * The raw Isabelle process executable has been renamed from
749 "isabelle-process" to "isabelle_process", which conforms to common
750 shell naming conventions, and allows to define a shell function within
751 the Isabelle environment to avoid dynamic path lookup. Rare
752 incompatibility for old tools that do not use the $ISABELLE_PROCESS
753 settings variable yet.
755 * Retired the now unused Isabelle tool "wwwfind". Similar functionality
756 may be integrated into PIDE/jEdit at a later point.
758 New in Isabelle2013-2 (December 2013)
759 -------------------------------------
761 *** Prover IDE -- Isabelle/Scala/jEdit ***
763 * More robust editing of running commands with internal forks,
764 e.g. non-terminating 'by' steps.
766 * More relaxed Sledgehammer panel: avoid repeated application of query
767 after edits surrounding the command location.
769 * More status information about commands that are interrupted
770 accidentally (via physical event or Poly/ML runtime system signal,
776 * More robust termination of external processes managed by
777 Isabelle/ML: support cancellation of tasks within the range of
778 milliseconds, as required for PIDE document editing with automatically
779 tried tools (e.g. Sledgehammer).
781 * Reactivated Isabelle/Scala kill command for external processes on
782 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
783 workaround for some Debian/Ubuntu Linux versions from 2013.
787 New in Isabelle2013-1 (November 2013)
788 -------------------------------------
792 * Discontinued obsolete 'uses' within theory header. Note that
793 commands like 'ML_file' work without separate declaration of file
794 dependencies. Minor INCOMPATIBILITY.
796 * Discontinued redundant 'use' command, which was superseded by
797 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
799 * Simplified subscripts within identifiers, using plain \<^sub>
800 instead of the second copy \<^isub> and \<^isup>. Superscripts are
801 only for literal tokens within notation; explicit mixfix annotations
802 for consts or fixed variables may be used as fall-back for unusual
803 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
804 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
805 standardize symbols as a starting point for further manual cleanup.
806 The ML reference variable "legacy_isub_isup" may be set as temporary
807 workaround, to make the prover accept a subset of the old identifier
810 * Document antiquotations: term style "isub" has been renamed to
811 "sub". Minor INCOMPATIBILITY.
813 * Uniform management of "quick_and_dirty" as system option (see also
814 "isabelle options"), configuration option within the context (see also
815 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
816 INCOMPATIBILITY, need to use more official Isabelle means to access
817 quick_and_dirty, instead of historical poking into mutable reference.
819 * Renamed command 'print_configs' to 'print_options'. Minor
822 * Proper diagnostic command 'print_state'. Old 'pr' (with its
823 implicit change of some global references) is retained for now as
824 control command, e.g. for ProofGeneral 3.7.x.
826 * Discontinued 'print_drafts' command with its old-fashioned PS output
827 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
828 'display_drafts' instead and print via the regular document viewer.
830 * Updated and extended "isar-ref" and "implementation" manual,
831 eliminated old "ref" manual.
834 *** Prover IDE -- Isabelle/Scala/jEdit ***
836 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
839 * Dockable window "Documentation" provides access to Isabelle
842 * Dockable window "Find" provides query operations for formal entities
843 (GUI front-end to 'find_theorems' command).
845 * Dockable window "Sledgehammer" manages asynchronous / parallel
846 sledgehammer runs over existing document sources, independently of
847 normal editing and checking process.
849 * Dockable window "Timing" provides an overview of relevant command
850 timing information, depending on option jedit_timing_threshold. The
851 same timing information is shown in the extended tooltip of the
852 command keyword, when hovering the mouse over it while the CONTROL or
853 COMMAND modifier is pressed.
855 * Improved dockable window "Theories": Continuous checking of proof
856 document (visible and required parts) may be controlled explicitly,
857 using check box or shortcut "C+e ENTER". Individual theory nodes may
858 be marked explicitly as required and checked in full, using check box
859 or shortcut "C+e SPACE".
861 * Improved completion mechanism, which is now managed by the
862 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
863 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
865 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
866 isabelle.complete for explicit completion in Isabelle sources.
867 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
870 * Improved support of various "minor modes" for Isabelle NEWS,
871 options, session ROOT etc., with completion and SideKick tree view.
873 * Strictly monotonic document update, without premature cancellation of
874 running transactions that are still needed: avoid reset/restart of
875 such command executions while editing.
877 * Support for asynchronous print functions, as overlay to existing
880 * Support for automatic tools in HOL, which try to prove or disprove
881 toplevel theorem statements.
883 * Action isabelle.reset-font-size resets main text area font size
884 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
885 also "Plugin Options / Isabelle / General"). It can be bound to some
886 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
888 * File specifications in jEdit (e.g. file browser) may refer to
889 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
890 obsolete $ISABELLE_HOME_WINDOWS variable.
892 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
893 / Global Options / Appearance".
895 * Improved support of native Mac OS X functionality via "MacOSX"
896 plugin, which is now enabled by default.
901 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
902 In particular, 'interpretation' allows for non-persistent
903 interpretation within "context ... begin ... end" blocks offering a
904 light-weight alternative to 'sublocale'. See "isar-ref" manual for
907 * Improved locales diagnostic command 'print_dependencies'.
909 * Discontinued obsolete 'axioms' command, which has been marked as
910 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
911 instead, while observing its uniform scope for polymorphism.
913 * Discontinued empty name bindings in 'axiomatization'.
916 * System option "proofs" has been discontinued. Instead the global
917 state of Proofterm.proofs is persistently compiled into logic images
918 as required, notably HOL-Proofs. Users no longer need to change
919 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
921 * Syntax translation functions (print_translation etc.) always depend
922 on Proof.context. Discontinued former "(advanced)" option -- this is
923 now the default. Minor INCOMPATIBILITY.
925 * Former global reference trace_unify_fail is now available as
926 configuration option "unify_trace_failure" (global context only).
928 * SELECT_GOAL now retains the syntactic context of the overall goal
929 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
935 * Stronger precedence of syntax for big intersection and union on
936 sets, in accordance with corresponding lattice operations.
939 * Notation "{p:A. P}" now allows tuple patterns as well.
941 * Nested case expressions are now translated in a separate check phase
942 rather than during parsing. The data for case combinators is separated
943 from the datatype package. The declaration attribute
944 "case_translation" can be used to register new case combinators:
946 declare [[case_translation case_combinator constructor1 ... constructorN]]
949 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
951 - 'code_identifier' declares name hints for arbitrary identifiers in
952 generated code, subsuming 'code_modulename'.
954 See the isar-ref manual for syntax diagrams, and the HOL theories for
957 * Attibute 'code': 'code' now declares concrete and abstract code
958 equations uniformly. Use explicit 'code equation' and 'code abstract'
959 to distinguish both when desired.
961 * Discontinued theories Code_Integer and Efficient_Nat by a more
962 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
963 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
964 generation for details. INCOMPATIBILITY.
966 * Numeric types are mapped by default to target language numerals:
967 natural (replaces former code_numeral) and integer (replaces former
968 code_int). Conversions are available as integer_of_natural /
969 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
970 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
971 ML). INCOMPATIBILITY.
973 * Function package: For mutually recursive functions f and g, separate
974 cases rules f.cases and g.cases are generated instead of unusable
975 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
976 in the case that the unusable rule was used nevertheless.
978 * Function package: For each function f, new rules f.elims are
979 generated, which eliminate equalities of the form "f x = t".
981 * New command 'fun_cases' derives ad-hoc elimination rules for
982 function equations as simplified instances of f.elims, analogous to
983 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
986 - parametrized correspondence relations are now supported:
987 + parametricity theorems for the raw term can be specified in
988 the command lift_definition, which allow us to generate stronger
990 + setup_lifting generates stronger transfer rules if parametric
991 correspondence relation can be generated
992 + various new properties of the relator must be specified to support
994 + parametricity theorem for the Quotient relation can be specified
995 - setup_lifting generates domain rules for the Transfer package
996 - stronger reflexivity prover of respectfulness theorems for type
998 - ===> and --> are now local. The symbols can be introduced
999 by interpreting the locale lifting_syntax (typically in an
1001 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
1002 Main. Potential INCOMPATIBILITY
1003 - new commands for restoring and deleting Lifting/Transfer context:
1004 lifting_forget, lifting_update
1005 - the command print_quotmaps was renamed to print_quot_maps.
1009 - better support for domains in Transfer: replace Domainp T
1010 by the actual invariant in a transferred goal
1011 - transfer rules can have as assumptions other transfer rules
1012 - Experimental support for transferring from the raw level to the
1013 abstract level: Transfer.transferred attribute
1014 - Attribute version of the transfer method: untransferred attribute
1016 * Reification and reflection:
1017 - Reification is now directly available in HOL-Main in structure
1019 - Reflection now handles multiple lists with variables also.
1020 - The whole reflection stack has been decomposed into conversions.
1023 * Revised devices for recursive definitions over finite sets:
1024 - Only one fundamental fold combinator on finite set remains:
1025 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
1026 This is now identity on infinite sets.
1027 - Locales ("mini packages") for fundamental definitions with
1028 Finite_Set.fold: folding, folding_idem.
1029 - Locales comm_monoid_set, semilattice_order_set and
1030 semilattice_neutr_order_set for big operators on sets.
1031 See theory Big_Operators for canonical examples.
1032 Note that foundational constants comm_monoid_set.F and
1033 semilattice_set.F correspond to former combinators fold_image
1034 and fold1 respectively. These are now gone. You may use
1035 those foundational constants as substitutes, but it is
1036 preferable to interpret the above locales accordingly.
1037 - Dropped class ab_semigroup_idem_mult (special case of lattice,
1038 no longer needed in connection with Finite_Set.fold etc.)
1040 card.union_inter ~> card_Un_Int [symmetric]
1041 card.union_disjoint ~> card_Un_disjoint
1044 * Locale hierarchy for abstract orderings and (semi)lattices.
1046 * Complete_Partial_Order.admissible is defined outside the type class
1047 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
1048 class predicate assumption or sort constraint when possible.
1051 * Introduce type class "conditionally_complete_lattice": Like a
1052 complete lattice but does not assume the existence of the top and
1053 bottom elements. Allows to generalize some lemmas about reals and
1054 extended reals. Removed SupInf and replaced it by the instantiation
1055 of conditionally_complete_lattice for real. Renamed lemmas about
1056 conditionally-complete lattice from Sup_... to cSup_... and from
1057 Inf_... to cInf_... to avoid hidding of similar complete lattice
1060 * Introduce type class linear_continuum as combination of
1061 conditionally-complete lattices and inner dense linorders which have
1062 more than one element. INCOMPATIBILITY.
1064 * Introduced type classes order_top and order_bot. The old classes top
1065 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
1066 Rename bot -> order_bot, top -> order_top
1068 * Introduce type classes "no_top" and "no_bot" for orderings without
1069 top and bottom elements.
1071 * Split dense_linorder into inner_dense_order and no_top, no_bot.
1073 * Complex_Main: Unify and move various concepts from
1074 HOL-Multivariate_Analysis to HOL-Complex_Main.
1076 - Introduce type class (lin)order_topology and
1077 linear_continuum_topology. Allows to generalize theorems about
1078 limits and order. Instances are reals and extended reals.
1080 - continuous and continuos_on from Multivariate_Analysis:
1081 "continuous" is the continuity of a function at a filter. "isCont"
1082 is now an abbrevitation: "isCont x f == continuous (at _) f".
1084 Generalized continuity lemmas from isCont to continuous on an
1087 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
1088 compactness of closed intervals on reals. Continuous functions
1089 attain infimum and supremum on compact sets. The inverse of a
1090 continuous function is continuous, when the function is continuous
1093 - connected from Multivariate_Analysis. Use it to prove the
1094 intermediate value theorem. Show connectedness of intervals on
1095 linear_continuum_topology).
1097 - first_countable_topology from Multivariate_Analysis. Is used to
1098 show equivalence of properties on the neighbourhood filter of x and
1099 on all sequences converging to x.
1101 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
1102 theorems from Library/FDERIV.thy to Deriv.thy and base the
1103 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
1104 which are restricted to sets, i.e. to represent derivatives from
1107 - Removed the within-filter. It is replaced by the principal filter:
1109 F within X = inf F (principal X)
1111 - Introduce "at x within U" as a single constant, "at x" is now an
1112 abbreviation for "at x within UNIV"
1114 - Introduce named theorem collections tendsto_intros,
1115 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
1116 in tendsto_intros (or FDERIV_intros) are also available as
1117 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
1118 is replaced by a congruence rule. This allows to apply them as
1119 intro rules and then proving equivalence by the simplifier.
1121 - Restructured theories in HOL-Complex_Main:
1123 + Moved RealDef and RComplete into Real
1125 + Introduced Topological_Spaces and moved theorems about
1126 topological spaces, filters, limits and continuity to it
1128 + Renamed RealVector to Real_Vector_Spaces
1130 + Split Lim, SEQ, Series into Topological_Spaces,
1131 Real_Vector_Spaces, and Limits
1133 + Moved Ln and Log to Transcendental
1135 + Moved theorems about continuity from Deriv to Topological_Spaces
1137 - Remove various auxiliary lemmas.
1142 - Added option "spy".
1143 - Reduce incidence of "too high arity" errors.
1147 isar_shrink ~> isar_compress
1149 - Added options "isar_try0", "spy".
1150 - Better support for "isar_proofs".
1151 - MaSh has been fined-tuned and now runs as a local server.
1153 * Improved support for ad hoc overloading of constants (see also
1154 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
1156 * Library/Polynomial.thy:
1157 - Use lifting for primitive definitions.
1158 - Explicit conversions from and to lists of coefficients, used for
1160 - Replaced recursion operator poly_rec by fold_coeffs.
1161 - Prefer pre-existing gcd operation for gcd.
1163 poly_eq_iff ~> poly_eq_poly_eq_iff
1164 poly_ext ~> poly_eqI
1165 expand_poly_eq ~> poly_eq_iff
1168 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
1169 case_of_simps to convert function definitions between a list of
1170 equations with patterns on the lhs and a single equation with case
1171 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
1173 * New Library/FSet.thy: type of finite sets defined as a subtype of
1174 sets defined by Lifting/Transfer.
1176 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
1178 * Consolidation of library theories on product orders:
1180 Product_Lattice ~> Product_Order -- pointwise order on products
1181 Product_ord ~> Product_Lexorder -- lexicographic order on products
1185 * Imperative-HOL: The MREC combinator is considered legacy and no
1186 longer included by default. INCOMPATIBILITY, use partial_function
1187 instead, or import theory Legacy_Mrec as a fallback.
1189 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
1190 ~~/src/HOL/Algebra/poly. Existing theories should be based on
1191 ~~/src/HOL/Library/Polynomial instead. The latter provides
1192 integration with HOL's type classes for rings. INCOMPATIBILITY.
1195 - Various improvements to BNF-based (co)datatype package, including
1196 new commands "primrec_new", "primcorec", and
1197 "datatype_new_compat", as well as documentation. See
1198 "datatypes.pdf" for details.
1199 - New "coinduction" method to avoid some boilerplate (compared to
1202 data ~> datatype_new
1203 codata ~> codatatype
1205 - Renamed many generated theorems, including
1207 map_comp' ~> map_comp
1217 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
1218 "check_property" allows to check specifications of the form "ALL x y
1219 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
1220 Examples.thy in particular.
1222 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
1223 tracing output in the command transaction context instead of physical
1224 stdout. See also Toplevel.debug, Toplevel.debugging and
1225 ML_Compiler.exn_trace.
1227 * ML type "theory" is now immutable, without any special treatment of
1228 drafts or linear updates (which could lead to "stale theory" errors in
1229 the past). Discontinued obsolete operations like Theory.copy,
1230 Theory.checkpoint, and the auxiliary type theory_ref. Minor
1233 * More uniform naming of goal functions for skipped proofs:
1235 Skip_Proof.prove ~> Goal.prove_sorry
1236 Skip_Proof.prove_global ~> Goal.prove_sorry_global
1238 Minor INCOMPATIBILITY.
1240 * Simplifier tactics and tools use proper Proof.context instead of
1241 historic type simpset. Old-style declarations like addsimps,
1242 addsimprocs etc. operate directly on Proof.context. Raw type simpset
1243 retains its use as snapshot of the main Simplifier context, using
1244 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
1245 old tools by making them depend on (ctxt : Proof.context) instead of
1246 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
1248 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
1249 operate on Proof.context instead of claset, for uniformity with addIs,
1250 addEs, addDs etc. Note that claset_of and put_claset allow to manage
1251 clasets separately from the context.
1253 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
1254 INCOMPATIBILITY, use @{context} instead.
1256 * Antiquotation @{theory_context A} is similar to @{theory A}, but
1257 presents the result as initial Proof.context.
1262 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
1263 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
1265 * Discontinued obsolete isabelle-process options -f and -u (former
1266 administrative aliases of option -e). Minor INCOMPATIBILITY.
1268 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
1271 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
1272 document formats: dvi.gz, ps, ps.gz -- the default document format is
1275 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
1276 specify global resources of the JVM process run by isabelle build.
1278 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
1279 to run Isabelle/Scala source files as standalone programs.
1281 * Improved "isabelle keywords" tool (for old-style ProofGeneral
1282 keyword tables): use Isabelle/Scala operations, which inspect outer
1283 syntax without requiring to build sessions first.
1285 * Sessions may be organized via 'chapter' specifications in the ROOT
1286 file, which determines a two-level hierarchy of browser info. The old
1287 tree-like organization via implicit sub-session relation (with its
1288 tendency towards erratic fluctuation of URLs) has been discontinued.
1289 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
1290 for HTML presentation of theories.
1294 New in Isabelle2013 (February 2013)
1295 -----------------------------------
1299 * Theorem status about oracles and unfinished/failed future proofs is
1300 no longer printed by default, since it is incompatible with
1301 incremental / parallel checking of the persistent document model. ML
1302 function Thm.peek_status may be used to inspect a snapshot of the
1303 ongoing evaluation process. Note that in batch mode --- notably
1304 isabelle build --- the system ensures that future proofs of all
1305 accessible theorems in the theory context are finished (as before).
1307 * Configuration option show_markup controls direct inlining of markup
1308 into the printed representation of formal entities --- notably type
1309 and sort constraints. This enables Prover IDE users to retrieve that
1310 information via tooltips in the output window, for example.
1312 * Command 'ML_file' evaluates ML text from a file directly within the
1313 theory, without any predeclaration via 'uses' in the theory header.
1315 * Old command 'use' command and corresponding keyword 'uses' in the
1316 theory header are legacy features and will be discontinued soon.
1317 Tools that load their additional source files may imitate the
1318 'ML_file' implementation, such that the system can take care of
1319 dependencies properly.
1321 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
1322 is called fastforce / fast_force_tac already since Isabelle2011-1.
1324 * Updated and extended "isar-ref" and "implementation" manual, reduced
1325 remaining material in old "ref" manual.
1327 * Improved support for auxiliary contexts that indicate block structure
1328 for specifications. Nesting of "context fixes ... context assumes ..."
1329 and "class ... context ...".
1331 * Attribute "consumes" allows a negative value as well, which is
1332 interpreted relatively to the total number of premises of the rule in
1333 the target context. This form of declaration is stable when exported
1334 from a nested 'context' with additional assumptions. It is the
1335 preferred form for definitional packages, notably cases/rules produced
1336 in HOL/inductive and HOL/function.
1338 * More informative error messages for Isar proof commands involving
1339 lazy enumerations (method applications etc.).
1341 * Refined 'help' command to retrieve outer syntax commands according
1342 to name patterns (with clickable results).
1345 *** Prover IDE -- Isabelle/Scala/jEdit ***
1347 * Parallel terminal proofs ('by') are enabled by default, likewise
1348 proofs that are built into packages like 'datatype', 'function'. This
1349 allows to "run ahead" checking the theory specifications on the
1350 surface, while the prover is still crunching on internal
1351 justifications. Unfinished / cancelled proofs are restarted as
1352 required to complete full proof checking eventually.
1354 * Improved output panel with tooltips, hyperlinks etc. based on the
1355 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
1356 tooltips leads to some window that supports the same recursively,
1357 which can lead to stacks of tooltips as the semantic document content
1358 is explored. ESCAPE closes the whole stack, individual windows may be
1359 closed separately, or detached to become independent jEdit dockables.
1361 * Improved support for commands that produce graph output: the text
1362 message contains a clickable area to open a new instance of the graph
1365 * More robust incremental parsing of outer syntax (partial comments,
1366 malformed symbols). Changing the balance of open/close quotes and
1367 comment delimiters works more conveniently with unfinished situations
1368 that frequently occur in user interaction.
1370 * More efficient painting and improved reactivity when editing large
1371 files. More scalable management of formal document content.
1373 * Smarter handling of tracing messages: prover process pauses after
1374 certain number of messages per command transaction, with some user
1375 dialog to stop or continue. This avoids swamping the front-end with
1376 potentially infinite message streams.
1378 * More plugin options and preferences, based on Isabelle/Scala. The
1379 jEdit plugin option panel provides access to some Isabelle/Scala
1380 options, including tuning parameters for editor reactivity and color
1383 * Dockable window "Symbols" provides some editing support for Isabelle
1386 * Dockable window "Monitor" shows ML runtime statistics. Note that
1387 continuous display of the chart slows down the system.
1389 * Improved editing support for control styles: subscript, superscript,
1390 bold, reset of style -- operating on single symbols or text
1391 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
1393 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
1394 adjust the main text area font size, and its derivatives for output,
1395 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
1396 need to be adapted to local keyboard layouts.
1398 * More reactive completion popup by default: use \t (TAB) instead of
1399 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
1400 also "Plugin Options / SideKick / General / Code Completion Options".
1402 * Implicit check and build dialog of the specified logic session
1403 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
1404 demand, without bundling big platform-dependent heap images in the
1405 Isabelle distribution.
1407 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
1408 from Oracle provide better multi-platform experience. This version is
1409 now bundled exclusively with Isabelle.
1414 * Code generation for Haskell: restrict unqualified imports from
1415 Haskell Prelude to a small set of fundamental operations.
1417 * Command 'export_code': relative file names are interpreted
1418 relatively to master directory of current theory rather than the
1419 rather arbitrary current working directory. INCOMPATIBILITY.
1421 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
1422 use regular rule composition via "OF" / "THEN", or explicit proof
1423 structure instead. Note that Isabelle/ML provides a variety of
1424 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
1425 with some care where this is really required.
1427 * Command 'typ' supports an additional variant with explicit sort
1428 constraint, to infer and check the most general type conforming to a
1429 given sort. Example (in HOL):
1431 typ "_ * _ * bool * unit" :: finite
1433 * Command 'locale_deps' visualizes all locales and their relations as
1441 - Added MaSh relevance filter based on machine-learning; see the
1442 Sledgehammer manual for details.
1443 - Polished Isar proofs generated with "isar_proofs" option.
1444 - Rationalized type encodings ("type_enc" option).
1445 - Renamed "kill_provers" subcommand to "kill_all".
1447 isar_proof ~> isar_proofs
1448 isar_shrink_factor ~> isar_shrink
1449 max_relevant ~> max_facts
1450 relevance_thresholds ~> fact_thresholds
1452 * Quickcheck: added an optimisation for equality premises. It is
1453 switched on by default, and can be switched off by setting the
1454 configuration quickcheck_optimise_equality to false.
1456 * Quotient: only one quotient can be defined by quotient_type
1460 - generation of an abstraction function equation in lift_definition
1461 - quot_del attribute
1462 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
1464 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
1467 * Preprocessing of the code generator rewrites set comprehensions into
1468 pointfree expressions.
1470 * The SMT solver Z3 has now by default a restricted set of directly
1471 supported features. For the full set of features (div/mod, nonlinear
1472 arithmetic, datatypes/records) with potential proof reconstruction
1473 failures, enable the configuration option "z3_with_extensions". Minor
1476 * Simplified 'typedef' specifications: historical options for implicit
1477 set definition and alternative name have been discontinued. The
1478 former behavior of "typedef (open) t = A" is now the default, but
1479 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
1482 * Removed constant "chars"; prefer "Enum.enum" on type "char"
1483 directly. INCOMPATIBILITY.
1485 * Moved operation product, sublists and n_lists from theory Enum to
1486 List. INCOMPATIBILITY.
1488 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
1490 * Class "comm_monoid_diff" formalises properties of bounded
1491 subtraction, with natural numbers and multisets as typical instances.
1493 * Added combinator "Option.these" with type "'a option set => 'a set".
1495 * Theory "Transitive_Closure": renamed lemmas
1497 reflcl_tranclp -> reflclp_tranclp
1498 rtranclp_reflcl -> rtranclp_reflclp
1502 * Theory "Rings": renamed lemmas (in class semiring)
1504 left_distrib ~> distrib_right
1505 right_distrib ~> distrib_left
1509 * Generalized the definition of limits:
1511 - Introduced the predicate filterlim (LIM x F. f x :> G) which
1512 expresses that when the input values x converge to F then the
1513 output f x converges to G.
1515 - Added filters for convergence to positive (at_top) and negative
1518 - Moved infinity in the norm (at_infinity) from
1519 Multivariate_Analysis to Complex_Main.
1521 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
1526 * Theory "Library/Option_ord" provides instantiation of option type to
1527 lattice type classes.
1529 * Theory "Library/Multiset": renamed
1531 constant fold_mset ~> Multiset.fold
1532 fact fold_mset_commute ~> fold_mset_comm
1536 * Renamed theory Library/List_Prefix to Library/Sublist, with related
1539 - Renamed constants (and related lemmas)
1542 strict_prefix ~> prefix
1544 - Replaced constant "postfix" by "suffixeq" with swapped argument
1545 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
1546 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
1547 Renamed lemmas accordingly.
1549 - Added constant "list_hembeq" for homeomorphic embedding on
1550 lists. Added abbreviation "sublisteq" for special case
1551 "list_hembeq (op =)".
1553 - Theory Library/Sublist no longer provides "order" and "bot" type
1554 class instances for the prefix order (merely corresponding locale
1555 interpretations). The type class instances are now in theory
1556 Library/Prefix_Order.
1558 - The sublist relation of theory Library/Sublist_Order is now based
1559 on "Sublist.sublisteq". Renamed lemmas accordingly:
1561 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
1562 le_list_append_mono ~> Sublist.list_hembeq_append_mono
1563 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
1564 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
1565 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
1566 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
1567 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
1568 le_list_drop_many ~> Sublist.sublisteq_drop_many
1569 le_list_filter_left ~> Sublist.sublisteq_filter_left
1570 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
1571 le_list_rev_take_iff ~> Sublist.sublisteq_append
1572 le_list_same_length ~> Sublist.sublisteq_same_length
1573 le_list_take_many_iff ~> Sublist.sublisteq_append'
1574 less_eq_list.drop ~> less_eq_list_drop
1575 less_eq_list.induct ~> less_eq_list_induct
1576 not_le_list_length ~> Sublist.not_sublisteq_length
1580 * New theory Library/Countable_Set.
1582 * Theory Library/Debug and Library/Parallel provide debugging and
1583 parallel execution for code generated towards Isabelle/ML.
1585 * Theory Library/FuncSet: Extended support for Pi and extensional and
1586 introduce the extensional dependent function space "PiE". Replaced
1587 extensional_funcset by an abbreviation, and renamed lemmas from
1588 extensional_funcset to PiE as follows:
1590 extensional_empty ~> PiE_empty
1591 extensional_funcset_empty_domain ~> PiE_empty_domain
1592 extensional_funcset_empty_range ~> PiE_empty_range
1593 extensional_funcset_arb ~> PiE_arb
1594 extensional_funcset_mem ~> PiE_mem
1595 extensional_funcset_extend_domainI ~> PiE_fun_upd
1596 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
1597 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
1598 card_extensional_funcset ~> card_PiE
1599 finite_extensional_funcset ~> finite_PiE
1603 * Theory Library/FinFun: theory of almost everywhere constant
1604 functions (supersedes the AFP entry "Code Generation for Functions as
1607 * Theory Library/Phantom: generic phantom type to make a type
1608 parameter appear in a constant's type. This alternative to adding
1609 TYPE('a) as another parameter avoids unnecessary closures in generated
1612 * Theory Library/RBT_Impl: efficient construction of red-black trees
1613 from sorted associative lists. Merging two trees with rbt_union may
1614 return a structurally different tree than before. Potential
1617 * Theory Library/IArray: immutable arrays with code generation.
1619 * Theory Library/Finite_Lattice: theory of finite lattices.
1621 * HOL/Multivariate_Analysis: replaced
1623 "basis :: 'a::euclidean_space => nat => real"
1624 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
1626 on euclidean spaces by using the inner product "_ \<bullet> _" with
1627 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
1628 "SUM i : Basis. f i * r i".
1630 With this change the following constants are also changed or removed:
1632 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
1633 a $$ i ~> inner a i (where i : Basis)
1635 \<pi>, \<pi>' removed
1637 Theorems about these constants where removed.
1641 component_le_norm ~> Basis_le_norm
1642 euclidean_eq ~> euclidean_eq_iff
1643 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
1644 euclidean_simps ~> inner_simps
1645 independent_basis ~> independent_Basis
1646 span_basis ~> span_Basis
1647 in_span_basis ~> in_span_Basis
1648 norm_bound_component_le ~> norm_boound_Basis_le
1649 norm_bound_component_lt ~> norm_boound_Basis_lt
1650 component_le_infnorm ~> Basis_le_infnorm
1656 - Added simproc "measurable" to automatically prove measurability.
1658 - Added induction rules for sigma sets with disjoint union
1659 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1660 (borel_measurable_induct).
1662 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1665 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1666 AFP entry "Ordinals_and_Cardinals").
1668 * HOL/BNF: New (co)datatype package based on bounded natural functors
1669 with support for mixed, nested recursion and interesting non-free
1672 * HOL/Finite_Set and Relation: added new set and relation operations
1673 expressed by Finite_Set.fold.
1675 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1676 trees for the code generator.
1678 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1680 possible INCOMPATIBILITY.
1682 * HOL/Set: renamed Set.project -> Set.filter
1686 *** Document preparation ***
1688 * Dropped legacy antiquotations "term_style" and "thm_style", since
1689 styles may be given as arguments to "term" and "thm" already.
1690 Discontinued legacy styles "prem1" .. "prem19".
1692 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1693 instead of slightly exotic babel/greek.
1695 * Document variant NAME may use different LaTeX entry point
1696 document/root_NAME.tex if that file exists, instead of the common
1699 * Simplified custom document/build script, instead of old-style
1700 document/IsaMakefile. Minor INCOMPATIBILITY.
1705 * The default limit for maximum number of worker threads is now 8,
1706 instead of 4, in correspondence to capabilities of contemporary
1707 hardware and Poly/ML runtime system.
1709 * Type Seq.results and related operations support embedded error
1710 messages within lazy enumerations, and thus allow to provide
1711 informative errors in the absence of any usable results.
1713 * Renamed Position.str_of to Position.here to emphasize that this is a
1714 formal device to inline positions into message text, but not
1715 necessarily printing visible text.
1720 * Advanced support for Isabelle sessions and build management, see
1721 "system" manual for the chapter of that name, especially the "isabelle
1722 build" tool and its examples. The "isabelle mkroot" tool prepares
1723 session root directories for use with "isabelle build", similar to
1724 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1725 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1726 mkdir / make are rendered obsolete.
1728 * Discontinued obsolete Isabelle/build script, it is superseded by the
1729 regular isabelle build tool. For example:
1731 isabelle build -s -b HOL
1733 * Discontinued obsolete "isabelle makeall".
1735 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1736 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1737 provides some traditional targets that invoke "isabelle build". Note
1738 that this is inefficient! Applications of Isabelle/HOL involving
1739 "isabelle make" should be upgraded to use "isabelle build" directly.
1741 * The "isabelle options" tool prints Isabelle system options, as
1742 required for "isabelle build", for example.
1744 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1745 Minor INCOMPATIBILITY in command-line options.
1747 * The "isabelle install" tool has now a simpler command-line. Minor
1750 * The "isabelle components" tool helps to resolve add-on components
1751 that are not bundled, or referenced from a bare-bones repository
1752 version of Isabelle.
1754 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1755 platform family: "linux", "macos", "windows".
1757 * The ML system is configured as regular component, and no longer
1758 picked up from some surrounding directory. Potential INCOMPATIBILITY
1759 for home-made settings.
1761 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1763 * Discontinued support for Poly/ML 5.2.1, which was the last version
1764 without exception positions and advanced ML compiler/toplevel
1767 * Discontinued special treatment of Proof General -- no longer guess
1768 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1769 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1770 settings manually, or use a Proof General version that has been
1771 bundled as Isabelle component.
1775 New in Isabelle2012 (May 2012)
1776 ------------------------------
1780 * Prover IDE (PIDE) improvements:
1782 - more robust Sledgehammer integration (as before the sledgehammer
1783 command-line needs to be typed into the source buffer)
1784 - markup for bound variables
1785 - markup for types of term variables (displayed as tooltips)
1786 - support for user-defined Isar commands within the running session
1787 - improved support for Unicode outside original 16bit range
1788 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1790 * Forward declaration of outer syntax keywords within the theory
1791 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1792 commands to be used in the same theory where defined.
1794 * Auxiliary contexts indicate block structure for specifications with
1795 additional parameters and assumptions. Such unnamed contexts may be
1796 nested within other targets, like 'theory', 'locale', 'class',
1797 'instantiation' etc. Results from the local context are generalized
1798 accordingly and applied to the enclosing target context. Example:
1802 assumes xy: "x = y" and yz: "y = z"
1805 lemma my_trans: "x = z" using xy yz by simp
1811 The most basic application is to factor-out context elements of
1812 several fixes/assumes/shows theorem statements, e.g. see
1813 ~~/src/HOL/Isar_Examples/Group_Context.thy
1815 Any other local theory specification element works within the "context
1816 ... begin ... end" block as well.
1818 * Bundled declarations associate attributed fact expressions with a
1819 given name in the context. These may be later included in other
1820 contexts. This allows to manage context extensions casually, without
1821 the logical dependencies of locales and locale interpretation. See
1822 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1824 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1825 declaration, and results are standardized before being stored. Thus
1826 old-style "standard" after instantiation or composition of facts
1827 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1828 indices of schematic variables.
1830 * Rule attributes in local theory declarations (e.g. locale or class)
1831 are now statically evaluated: the resulting theorem is stored instead
1832 of the original expression. INCOMPATIBILITY in rare situations, where
1833 the historic accident of dynamic re-evaluation in interpretations
1836 * New tutorial "Programming and Proving in Isabelle/HOL"
1837 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1838 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1839 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1840 Logic" as the recommended beginners tutorial, but does not cover all
1841 of the material of that old tutorial.
1843 * Updated and extended reference manuals: "isar-ref",
1844 "implementation", "system"; reduced remaining material in old "ref"
1850 * Command 'definition' no longer exports the foundational "raw_def"
1851 into the user context. Minor INCOMPATIBILITY, may use the regular
1852 "def" result with attribute "abs_def" to imitate the old version.
1854 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1855 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1856 expand it. This also works for object-logic equality. (Formerly
1857 undocumented feature.)
1859 * Sort constraints are now propagated in simultaneous statements, just
1860 like type constraints. INCOMPATIBILITY in rare situations, where
1861 distinct sorts used to be assigned accidentally. For example:
1863 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1865 lemma "P (x::'a)" and "Q (y::'a::bar)"
1866 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1868 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1869 tolerant against multiple unifiers, as long as the final result is
1870 unique. (As before, rules are composed in canonical right-to-left
1871 order to accommodate newly introduced premises.)
1873 * Renamed some inner syntax categories:
1879 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1880 "num_position" etc. are mainly used instead (which also include
1881 position information via constraints).
1883 * Simplified configuration options for syntax ambiguity: see
1884 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1885 manual. Minor INCOMPATIBILITY.
1887 * Discontinued configuration option "syntax_positions": atomic terms
1888 in parse trees are always annotated by position constraints.
1890 * Old code generator for SML and its commands 'code_module',
1891 'code_library', 'consts_code', 'types_code' have been discontinued.
1892 Use commands of the generic code generator instead. INCOMPATIBILITY.
1894 * Redundant attribute "code_inline" has been discontinued. Use
1895 "code_unfold" instead. INCOMPATIBILITY.
1897 * Dropped attribute "code_unfold_post" in favor of the its dual
1898 "code_abbrev", which yields a common pattern in definitions like
1900 definition [code_abbrev]: "f = t"
1904 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1905 instead. INCOMPATIBILITY.
1907 * Discontinued old "prems" fact, which used to refer to the accidental
1908 collection of foundational premises in the context (already marked as
1909 legacy since Isabelle2011).
1914 * Type 'a set is now a proper type constructor (just as before
1915 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1916 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1917 sets separate, it is often sufficient to rephrase some set S that has
1918 been accidentally used as predicates by "%x. x : S", and some
1919 predicate P that has been accidentally used as set by "{x. P x}".
1920 Corresponding proofs in a first step should be pruned from any
1921 tinkering with former theorems mem_def and Collect_def as far as
1924 For developments which deliberately mix predicates and sets, a
1925 planning step is necessary to determine what should become a predicate
1926 and what a set. It can be helpful to carry out that step in
1927 Isabelle2011-1 before jumping right into the current release.
1929 * Code generation by default implements sets as container type rather
1930 than predicates. INCOMPATIBILITY.
1932 * New type synonym 'a rel = ('a * 'a) set
1934 * The representation of numerals has changed. Datatype "num"
1935 represents strictly positive binary numerals, along with functions
1936 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1937 positive and negated numeric literals, respectively. See also
1938 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1939 user theories may require adaptations as follows:
1941 - Theorems with number_ring or number_semiring constraints: These
1942 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1944 - Theories defining numeric types: Remove number, number_semiring,
1945 and number_ring instances. Defer all theorems about numerals until
1946 after classes one and semigroup_add have been instantiated.
1948 - Numeral-only simp rules: Replace each rule having a "number_of v"
1949 pattern with two copies, one for numeral and one for neg_numeral.
1951 - Theorems about subclasses of semiring_1 or ring_1: These classes
1952 automatically support numerals now, so more simp rules and
1953 simprocs may now apply within the proof.
1955 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1956 Redefine using other integer operations.
1958 * Transfer: New package intended to generalize the existing
1959 "descending" method and related theorem attributes from the Quotient
1960 package. (Not all functionality is implemented yet, but future
1961 development will focus on Transfer as an eventual replacement for the
1962 corresponding parts of the Quotient package.)
1964 - transfer_rule attribute: Maintains a collection of transfer rules,
1965 which relate constants at two different types. Transfer rules may
1966 relate different type instances of the same polymorphic constant,
1967 or they may relate an operation on a raw type to a corresponding
1968 operation on an abstract type (quotient or subtype). For example:
1970 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1971 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1973 - transfer method: Replaces a subgoal on abstract types with an
1974 equivalent subgoal on the corresponding raw types. Constants are
1975 replaced with corresponding ones according to the transfer rules.
1976 Goals are generalized over all free variables by default; this is
1977 necessary for variables whose types change, but can be overridden
1978 for specific variables with e.g. "transfer fixing: x y z". The
1979 variant transfer' method allows replacing a subgoal with one that
1980 is logically stronger (rather than equivalent).
1982 - relator_eq attribute: Collects identity laws for relators of
1983 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1984 transfer method uses these lemmas to infer transfer rules for
1985 non-polymorphic constants on the fly.
1987 - transfer_prover method: Assists with proving a transfer rule for a
1988 new constant, provided the constant is defined in terms of other
1989 constants that already have transfer rules. It should be applied
1990 after unfolding the constant definitions.
1992 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1993 from type nat to type int.
1995 * Lifting: New package intended to generalize the quotient_definition
1996 facility of the Quotient package; designed to work with Transfer.
1998 - lift_definition command: Defines operations on an abstract type in
1999 terms of a corresponding operation on a representation
2000 type. Example syntax:
2002 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
2005 Users must discharge a respectfulness proof obligation when each
2006 constant is defined. (For a type copy, i.e. a typedef with UNIV,
2007 the proof is discharged automatically.) The obligation is
2008 presented in a user-friendly, readable form; a respectfulness
2009 theorem in the standard format and a transfer rule are generated
2012 - Integration with code_abstype: For typedefs (e.g. subtypes
2013 corresponding to a datatype invariant, such as dlist),
2014 lift_definition generates a code certificate theorem and sets up
2015 code generation for each constant.
2017 - setup_lifting command: Sets up the Lifting package to work with a
2018 user-defined type. The user must provide either a quotient theorem
2019 or a type_definition theorem. The package configures transfer
2020 rules for equality and quantifiers on the type, and sets up the
2021 lift_definition command to work with the type.
2023 - Usage examples: See Quotient_Examples/Lift_DList.thy,
2024 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
2025 Word/Word.thy and Library/Float.thy.
2029 - The 'quotient_type' command now supports a 'morphisms' option with
2030 rep and abs functions, similar to typedef.
2032 - 'quotient_type' sets up new types to work with the Lifting and
2033 Transfer packages, as with 'setup_lifting'.
2035 - The 'quotient_definition' command now requires the user to prove a
2036 respectfulness property at the point where the constant is
2037 defined, similar to lift_definition; INCOMPATIBILITY.
2039 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
2040 accordingly, INCOMPATIBILITY.
2042 * New diagnostic command 'find_unused_assms' to find potentially
2043 superfluous assumptions in theorems using Quickcheck.
2047 - Quickcheck returns variable assignments as counterexamples, which
2048 allows to reveal the underspecification of functions under test.
2049 For example, refuting "hd xs = x", it presents the variable
2050 assignment xs = [] and x = a1 as a counterexample, assuming that
2051 any property is false whenever "hd []" occurs in it.
2053 These counterexample are marked as potentially spurious, as
2054 Quickcheck also returns "xs = []" as a counterexample to the
2055 obvious theorem "hd xs = hd xs".
2057 After finding a potentially spurious counterexample, Quickcheck
2058 continues searching for genuine ones.
2060 By default, Quickcheck shows potentially spurious and genuine
2061 counterexamples. The option "genuine_only" sets quickcheck to only
2062 show genuine counterexamples.
2064 - The command 'quickcheck_generator' creates random and exhaustive
2065 value generators for a given type and operations.
2067 It generates values by using the operations as if they were
2068 constructors of that type.
2070 - Support for multisets.
2072 - Added "use_subtype" options.
2074 - Added "quickcheck_locale" configuration to specify how to process
2075 conjectures in a locale context.
2077 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
2078 and affecting 'rat' and 'real'.
2081 - Integrated more tightly with SPASS, as described in the ITP 2012
2082 paper "More SPASS with Isabelle".
2083 - Made it try "smt" as a fallback if "metis" fails or times out.
2084 - Added support for the following provers: Alt-Ergo (via Why3 and
2085 TFF1), iProver, iProver-Eq.
2086 - Sped up the minimizer.
2087 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
2088 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
2089 - Renamed "sound" option to "strict".
2091 * Metis: Added possibility to specify lambda translations scheme as a
2092 parenthesized argument (e.g., "by (metis (lifting) ...)").
2094 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
2096 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
2098 * New "case_product" attribute to generate a case rule doing multiple
2099 case distinctions at the same time. E.g.
2101 list.exhaust [case_product nat.exhaust]
2103 produces a rule which can be used to perform case distinction on both
2106 * New "eventually_elim" method as a generalized variant of the
2107 eventually_elim* rules. Supports structured proofs.
2109 * Typedef with implicit set definition is considered legacy. Use
2110 "typedef (open)" form instead, which will eventually become the
2113 * Record: code generation can be switched off manually with
2115 declare [[record_coden = false]] -- "default true"
2117 * Datatype: type parameters allow explicit sort constraints.
2119 * Concrete syntax for case expressions includes constraints for source
2120 positions, and thus produces Prover IDE markup for its bindings.
2121 INCOMPATIBILITY for old-style syntax translations that augment the
2122 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
2125 * Clarified attribute "mono_set": pure declaration without modifying
2126 the result of the fact expression.
2128 * More default pred/set conversions on a couple of relation operations
2129 and predicates. Added powers of predicate relations. Consolidation
2130 of some relation theorems:
2132 converse_def ~> converse_unfold
2133 rel_comp_def ~> relcomp_unfold
2134 symp_def ~> (modified, use symp_def and sym_def instead)
2135 transp_def ~> transp_trans
2136 Domain_def ~> Domain_unfold
2137 Range_def ~> Domain_converse [symmetric]
2139 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
2141 See theory "Relation" for examples for making use of pred/set
2142 conversions by means of attributes "to_set" and "to_pred".
2146 * Renamed facts about the power operation on relations, i.e., relpow
2147 to match the constant's name:
2149 rel_pow_1 ~> relpow_1
2150 rel_pow_0_I ~> relpow_0_I
2151 rel_pow_Suc_I ~> relpow_Suc_I
2152 rel_pow_Suc_I2 ~> relpow_Suc_I2
2153 rel_pow_0_E ~> relpow_0_E
2154 rel_pow_Suc_E ~> relpow_Suc_E
2155 rel_pow_E ~> relpow_E
2156 rel_pow_Suc_D2 ~> relpow_Suc_D2
2157 rel_pow_Suc_E2 ~> relpow_Suc_E2
2158 rel_pow_Suc_D2' ~> relpow_Suc_D2'
2159 rel_pow_E2 ~> relpow_E2
2160 rel_pow_add ~> relpow_add
2161 rel_pow_commute ~> relpow
2162 rel_pow_empty ~> relpow_empty:
2163 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
2164 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
2165 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
2166 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
2167 rel_pow_fun_conv ~> relpow_fun_conv
2168 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
2169 rel_pow_finite_bounded ~> relpow_finite_bounded
2170 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
2171 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
2172 single_valued_rel_pow ~> single_valued_relpow
2176 * Theory Relation: Consolidated constant name for relation composition
2177 and corresponding theorem names:
2179 - Renamed constant rel_comp to relcomp.
2181 - Dropped abbreviation pred_comp. Use relcompp instead.
2185 rel_compI ~> relcompI
2186 rel_compEpair ~> relcompEpair
2187 rel_compE ~> relcompE
2188 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
2189 rel_comp_empty1 ~> relcomp_empty1
2190 rel_comp_mono ~> relcomp_mono
2191 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
2192 rel_comp_distrib ~> relcomp_distrib
2193 rel_comp_distrib2 ~> relcomp_distrib2
2194 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
2195 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
2196 single_valued_rel_comp ~> single_valued_relcomp
2197 rel_comp_def ~> relcomp_unfold
2198 converse_rel_comp ~> converse_relcomp
2199 pred_compI ~> relcomppI
2200 pred_compE ~> relcomppE
2201 pred_comp_bot1 ~> relcompp_bot1
2202 pred_comp_bot2 ~> relcompp_bot2
2203 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
2204 pred_comp_mono ~> relcompp_mono
2205 pred_comp_distrib ~> relcompp_distrib
2206 pred_comp_distrib2 ~> relcompp_distrib2
2207 converse_pred_comp ~> converse_relcompp
2209 finite_rel_comp ~> finite_relcomp
2211 set_rel_comp ~> set_relcomp
2215 * Theory Divides: Discontinued redundant theorems about div and mod.
2216 INCOMPATIBILITY, use the corresponding generic theorems instead.
2218 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
2219 zdiv_self ~> div_self
2220 zmod_self ~> mod_self
2223 zdiv_zmod_equality ~> div_mod_equality2
2224 zdiv_zmod_equality2 ~> div_mod_equality
2225 zmod_zdiv_trivial ~> mod_div_trivial
2226 zdiv_zminus_zminus ~> div_minus_minus
2227 zmod_zminus_zminus ~> mod_minus_minus
2228 zdiv_zminus2 ~> div_minus_right
2229 zmod_zminus2 ~> mod_minus_right
2230 zdiv_minus1_right ~> div_minus1_right
2231 zmod_minus1_right ~> mod_minus1_right
2232 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
2233 zmod_zmult1_eq ~> mod_mult_right_eq
2234 zpower_zmod ~> power_mod
2235 zdvd_zmod ~> dvd_mod
2236 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
2237 mod_mult_distrib ~> mult_mod_left
2238 mod_mult_distrib2 ~> mult_mod_right
2240 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
2241 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
2243 * Finite_Set.fold now qualified. INCOMPATIBILITY.
2245 * Consolidated theorem names concerning fold combinators:
2247 inf_INFI_fold_inf ~> inf_INF_fold_inf
2248 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
2249 INFI_fold_inf ~> INF_fold_inf
2250 SUPR_fold_sup ~> SUP_fold_sup
2251 union_set ~> union_set_fold
2252 minus_set ~> minus_set_fold
2253 INFI_set_fold ~> INF_set_fold
2254 SUPR_set_fold ~> SUP_set_fold
2255 INF_code ~> INF_set_foldr
2256 SUP_code ~> SUP_set_foldr
2257 foldr.simps ~> foldr.simps (in point-free formulation)
2258 foldr_fold_rev ~> foldr_conv_fold
2259 foldl_fold ~> foldl_conv_fold
2260 foldr_foldr ~> foldr_conv_foldl
2261 foldl_foldr ~> foldl_conv_foldr
2262 fold_set_remdups ~> fold_set_fold_remdups
2263 fold_set ~> fold_set_fold
2264 fold1_set ~> fold1_set_fold
2268 * Dropped rarely useful theorems concerning fold combinators:
2269 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
2270 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
2271 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
2272 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
2273 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
2274 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
2275 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
2276 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
2277 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
2278 unfolding "foldr_conv_fold" and "foldl_conv_fold".
2280 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
2281 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
2282 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
2283 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
2284 lemmas over fold rather than foldr, or make use of lemmas
2285 fold_conv_foldr and fold_rev.
2287 * Congruence rules Option.map_cong and Option.bind_cong for recursion
2288 through option types.
2290 * "Transitive_Closure.ntrancl": bounded transitive closure on
2293 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
2295 * Theory Int: Discontinued many legacy theorems specific to type int.
2296 INCOMPATIBILITY, use the corresponding generic theorems instead.
2298 zminus_zminus ~> minus_minus
2299 zminus_0 ~> minus_zero
2300 zminus_zadd_distrib ~> minus_add_distrib
2301 zadd_commute ~> add_commute
2302 zadd_assoc ~> add_assoc
2303 zadd_left_commute ~> add_left_commute
2306 zadd_0 ~> add_0_left
2307 zadd_0_right ~> add_0_right
2308 zadd_zminus_inverse2 ~> left_minus
2309 zmult_zminus ~> mult_minus_left
2310 zmult_commute ~> mult_commute
2311 zmult_assoc ~> mult_assoc
2312 zadd_zmult_distrib ~> left_distrib
2313 zadd_zmult_distrib2 ~> right_distrib
2314 zdiff_zmult_distrib ~> left_diff_distrib
2315 zdiff_zmult_distrib2 ~> right_diff_distrib
2316 zmult_1 ~> mult_1_left
2317 zmult_1_right ~> mult_1_right
2318 zle_refl ~> order_refl
2319 zle_trans ~> order_trans
2320 zle_antisym ~> order_antisym
2321 zle_linear ~> linorder_linear
2322 zless_linear ~> linorder_less_linear
2323 zadd_left_mono ~> add_left_mono
2324 zadd_strict_right_mono ~> add_strict_right_mono
2325 zadd_zless_mono ~> add_less_le_mono
2326 int_0_less_1 ~> zero_less_one
2327 int_0_neq_1 ~> zero_neq_one
2329 zpower_zadd_distrib ~> power_add
2330 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
2331 zero_le_zpower_abs ~> zero_le_power_abs
2333 * Theory Deriv: Renamed
2335 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
2337 * Theory Library/Multiset: Improved code generation of multisets.
2339 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
2340 are expressed via type classes again. The special syntax
2341 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
2342 setsum_set, which is now subsumed by Big_Operators.setsum.
2345 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
2346 use theory HOL/Library/Nat_Bijection instead.
2348 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
2349 trees is now inside a type class context. Names of affected
2350 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
2351 theories working directly with raw red-black trees, adapt the names as
2355 bulkload -> rbt_bulkload
2356 del_from_left -> rbt_del_from_left
2357 del_from_right -> rbt_del_from_right
2359 delete -> rbt_delete
2361 insert -> rbt_insert
2362 insertw -> rbt_insert_with
2363 insert_with_key -> rbt_insert_with_key
2364 map_entry -> rbt_map_entry
2365 lookup -> rbt_lookup
2366 sorted -> rbt_sorted
2367 tree_greater -> rbt_greater
2368 tree_less -> rbt_less
2369 tree_less_symbol -> rbt_less_symbol
2371 union_with -> rbt_union_with
2372 union_with_key -> rbt_union_with_key
2375 balance_left_sorted -> balance_left_rbt_sorted
2376 balance_left_tree_greater -> balance_left_rbt_greater
2377 balance_left_tree_less -> balance_left_rbt_less
2378 balance_right_sorted -> balance_right_rbt_sorted
2379 balance_right_tree_greater -> balance_right_rbt_greater
2380 balance_right_tree_less -> balance_right_rbt_less
2381 balance_sorted -> balance_rbt_sorted
2382 balance_tree_greater -> balance_rbt_greater
2383 balance_tree_less -> balance_rbt_less
2384 bulkload_is_rbt -> rbt_bulkload_is_rbt
2385 combine_sorted -> combine_rbt_sorted
2386 combine_tree_greater -> combine_rbt_greater
2387 combine_tree_less -> combine_rbt_less
2388 delete_in_tree -> rbt_delete_in_tree
2389 delete_is_rbt -> rbt_delete_is_rbt
2390 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
2391 del_from_left_tree_less -> rbt_del_from_left_rbt_less
2392 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
2393 del_from_right_tree_less -> rbt_del_from_right_rbt_less
2394 del_in_tree -> rbt_del_in_tree
2395 del_inv1_inv2 -> rbt_del_inv1_inv2
2396 del_sorted -> rbt_del_rbt_sorted
2397 del_tree_greater -> rbt_del_rbt_greater
2398 del_tree_less -> rbt_del_rbt_less
2399 dom_lookup_Branch -> dom_rbt_lookup_Branch
2400 entries_lookup -> entries_rbt_lookup
2401 finite_dom_lookup -> finite_dom_rbt_lookup
2402 insert_sorted -> rbt_insert_rbt_sorted
2403 insertw_is_rbt -> rbt_insertw_is_rbt
2404 insertwk_is_rbt -> rbt_insertwk_is_rbt
2405 insertwk_sorted -> rbt_insertwk_rbt_sorted
2406 insertw_sorted -> rbt_insertw_rbt_sorted
2407 ins_sorted -> ins_rbt_sorted
2408 ins_tree_greater -> ins_rbt_greater
2409 ins_tree_less -> ins_rbt_less
2410 is_rbt_sorted -> is_rbt_rbt_sorted
2411 lookup_balance -> rbt_lookup_balance
2412 lookup_bulkload -> rbt_lookup_rbt_bulkload
2413 lookup_delete -> rbt_lookup_rbt_delete
2414 lookup_Empty -> rbt_lookup_Empty
2415 lookup_from_in_tree -> rbt_lookup_from_in_tree
2416 lookup_in_tree -> rbt_lookup_in_tree
2417 lookup_ins -> rbt_lookup_ins
2418 lookup_insert -> rbt_lookup_rbt_insert
2419 lookup_insertw -> rbt_lookup_rbt_insertw
2420 lookup_insertwk -> rbt_lookup_rbt_insertwk
2421 lookup_keys -> rbt_lookup_keys
2422 lookup_map -> rbt_lookup_map
2423 lookup_map_entry -> rbt_lookup_rbt_map_entry
2424 lookup_tree_greater -> rbt_lookup_rbt_greater
2425 lookup_tree_less -> rbt_lookup_rbt_less
2426 lookup_union -> rbt_lookup_rbt_union
2427 map_entry_color_of -> rbt_map_entry_color_of
2428 map_entry_inv1 -> rbt_map_entry_inv1
2429 map_entry_inv2 -> rbt_map_entry_inv2
2430 map_entry_is_rbt -> rbt_map_entry_is_rbt
2431 map_entry_sorted -> rbt_map_entry_rbt_sorted
2432 map_entry_tree_greater -> rbt_map_entry_rbt_greater
2433 map_entry_tree_less -> rbt_map_entry_rbt_less
2434 map_tree_greater -> map_rbt_greater
2435 map_tree_less -> map_rbt_less
2436 map_sorted -> map_rbt_sorted
2437 paint_sorted -> paint_rbt_sorted
2438 paint_lookup -> paint_rbt_lookup
2439 paint_tree_greater -> paint_rbt_greater
2440 paint_tree_less -> paint_rbt_less
2441 sorted_entries -> rbt_sorted_entries
2442 tree_greater_eq_trans -> rbt_greater_eq_trans
2443 tree_greater_nit -> rbt_greater_nit
2444 tree_greater_prop -> rbt_greater_prop
2445 tree_greater_simps -> rbt_greater_simps
2446 tree_greater_trans -> rbt_greater_trans
2447 tree_less_eq_trans -> rbt_less_eq_trans
2448 tree_less_nit -> rbt_less_nit
2449 tree_less_prop -> rbt_less_prop
2450 tree_less_simps -> rbt_less_simps
2451 tree_less_trans -> rbt_less_trans
2452 tree_ord_props -> rbt_ord_props
2453 union_Branch -> rbt_union_Branch
2454 union_is_rbt -> rbt_union_is_rbt
2455 unionw_is_rbt -> rbt_unionw_is_rbt
2456 unionwk_is_rbt -> rbt_unionwk_is_rbt
2457 unionwk_sorted -> rbt_unionwk_rbt_sorted
2459 * Theory HOL/Library/Float: Floating point numbers are now defined as
2460 a subset of the real numbers. All operations are defined using the
2461 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
2468 round_down -> float_round_down
2469 round_up -> float_round_up
2473 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
2476 abs_float_def -> Float.compute_float_abs
2477 bitlen_ge0 -> bitlen_nonneg
2478 bitlen.simps -> Float.compute_bitlen
2479 float_components -> Float_mantissa_exponent
2480 float_divl.simps -> Float.compute_float_divl
2481 float_divr.simps -> Float.compute_float_divr
2482 float_eq_odd -> mult_powr_eq_mult_powr_iff
2483 float_power -> real_of_float_power
2484 lapprox_posrat_def -> Float.compute_lapprox_posrat
2485 lapprox_rat.simps -> Float.compute_lapprox_rat
2486 le_float_def' -> Float.compute_float_le
2487 le_float_def -> less_eq_float.rep_eq
2488 less_float_def' -> Float.compute_float_less
2489 less_float_def -> less_float.rep_eq
2490 normfloat_def -> Float.compute_normfloat
2491 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
2492 normfloat -> normfloat_def
2493 normfloat_unique -> use normfloat_def
2494 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
2495 one_float_def -> Float.compute_float_one
2496 plus_float_def -> Float.compute_float_plus
2497 rapprox_posrat_def -> Float.compute_rapprox_posrat
2498 rapprox_rat.simps -> Float.compute_rapprox_rat
2499 real_of_float_0 -> zero_float.rep_eq
2500 real_of_float_1 -> one_float.rep_eq
2501 real_of_float_abs -> abs_float.rep_eq
2502 real_of_float_add -> plus_float.rep_eq
2503 real_of_float_minus -> uminus_float.rep_eq
2504 real_of_float_mult -> times_float.rep_eq
2505 real_of_float_simp -> Float.rep_eq
2506 real_of_float_sub -> minus_float.rep_eq
2507 round_down.simps -> Float.compute_float_round_down
2508 round_up.simps -> Float.compute_float_round_up
2509 times_float_def -> Float.compute_float_times
2510 uminus_float_def -> Float.compute_float_uminus
2511 zero_float_def -> Float.compute_float_zero
2513 Lemmas not necessary anymore, use the transfer method:
2514 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
2515 float_divr, float_le_simp, float_less1_mantissa_bound,
2516 float_less_simp, float_less_zero, float_le_zero,
2517 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
2518 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
2519 lapprox_rat_bottom, normalized_float, rapprox_posrat,
2520 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
2521 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
2522 round_up, zero_le_float, zero_less_float
2524 * New theory HOL/Library/DAList provides an abstract type for
2525 association lists with distinct keys.
2527 * Session HOL/IMP: Added new theory of abstract interpretation of
2530 * Session HOL-Import: Re-implementation from scratch is faster,
2531 simpler, and more scalable. Requires a proof bundle, which is
2532 available as an external component. Discontinued old (and mostly
2533 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
2535 * Session HOL-Word: Discontinued many redundant theorems specific to
2536 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
2539 word_sub_alt ~> word_sub_wi
2540 word_add_alt ~> word_add_def
2541 word_mult_alt ~> word_mult_def
2542 word_minus_alt ~> word_minus_def
2543 word_0_alt ~> word_0_wi
2544 word_1_alt ~> word_1_wi
2545 word_add_0 ~> add_0_left
2546 word_add_0_right ~> add_0_right
2547 word_mult_1 ~> mult_1_left
2548 word_mult_1_right ~> mult_1_right
2549 word_add_commute ~> add_commute
2550 word_add_assoc ~> add_assoc
2551 word_add_left_commute ~> add_left_commute
2552 word_mult_commute ~> mult_commute
2553 word_mult_assoc ~> mult_assoc
2554 word_mult_left_commute ~> mult_left_commute
2555 word_left_distrib ~> left_distrib
2556 word_right_distrib ~> right_distrib
2557 word_left_minus ~> left_minus
2558 word_diff_0_right ~> diff_0_right
2559 word_diff_self ~> diff_self
2560 word_sub_def ~> diff_minus
2561 word_diff_minus ~> diff_minus
2562 word_add_ac ~> add_ac
2563 word_mult_ac ~> mult_ac
2564 word_plus_ac0 ~> add_0_left add_0_right add_ac
2565 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
2566 word_order_trans ~> order_trans
2567 word_order_refl ~> order_refl
2568 word_order_antisym ~> order_antisym
2569 word_order_linear ~> linorder_linear
2570 lenw1_zero_neq_one ~> zero_neq_one
2571 word_number_of_eq ~> number_of_eq
2572 word_of_int_add_hom ~> wi_hom_add
2573 word_of_int_sub_hom ~> wi_hom_sub
2574 word_of_int_mult_hom ~> wi_hom_mult
2575 word_of_int_minus_hom ~> wi_hom_neg
2576 word_of_int_succ_hom ~> wi_hom_succ
2577 word_of_int_pred_hom ~> wi_hom_pred
2578 word_of_int_0_hom ~> word_0_wi
2579 word_of_int_1_hom ~> word_1_wi
2581 * Session HOL-Word: New proof method "word_bitwise" for splitting
2582 machine word equalities and inequalities into logical circuits,
2583 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
2584 multiplication, shifting by constants, bitwise operators and numeric
2585 constants. Requires fixed-length word types, not 'a word. Solves
2586 many standard word identities outright and converts more into first
2587 order problems amenable to blast or similar. See also examples in
2588 HOL/Word/Examples/WordExamples.thy.
2590 * Session HOL-Probability: Introduced the type "'a measure" to
2591 represent measures, this replaces the records 'a algebra and 'a
2592 measure_space. The locales based on subset_class now have two
2593 locale-parameters the space \<Omega> and the set of measurable sets M.
2594 The product of probability spaces uses now the same constant as the
2595 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
2596 measure". Most constants are defined now outside of locales and gain
2597 an additional parameter, like null_sets, almost_eventually or \<mu>'.
2598 Measure space constructions for distributions and densities now got
2599 their own constants distr and density. Instead of using locales to
2600 describe measure spaces with a finite space, the measure count_space
2601 and point_measure is introduced. INCOMPATIBILITY.
2605 finite_measure.\<mu>' -> measure
2606 product_algebra_generator -> prod_algebra
2607 product_prob_space.emb -> prod_emb
2608 product_prob_space.infprod_algebra -> PiM
2611 completeable_measure_space
2612 finite_measure_space
2614 finite_product_finite_prob_space
2615 finite_product_sigma_algebra
2616 finite_sigma_algebra
2618 pair_finite_prob_space
2619 pair_finite_sigma_algebra
2622 product_sigma_algebra
2626 distribution -> use distr measure, or distributed predicate
2628 joint_distribution -> use distr measure, or distributed predicate
2629 pair_measure_generator
2630 product_prob_space.infprod_algebra -> use PiM
2633 Replacement theorems:
2634 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
2635 finite_measure.empty_measure -> measure_empty
2636 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
2637 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
2638 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
2639 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
2640 finite_measure.finite_measure -> finite_measure.emeasure_finite
2641 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
2642 finite_measure.positive_measure' -> measure_nonneg
2643 finite_measure.real_measure -> finite_measure.emeasure_real
2644 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
2645 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
2646 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
2647 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
2648 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
2649 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
2650 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
2651 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
2652 information_space.entropy_commute -> information_space.entropy_commute_simple
2653 information_space.entropy_eq -> information_space.entropy_simple_distributed
2654 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
2655 information_space.entropy_positive -> information_space.entropy_nonneg_simple
2656 information_space.entropy_uniform_max -> information_space.entropy_uniform
2657 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2658 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2659 information_space.KL_ge_0 -> information_space.KL_nonneg
2660 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2661 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2662 Int_stable_cuboids -> Int_stable_atLeastAtMost
2663 Int_stable_product_algebra_generator -> positive_integral
2664 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2665 measure_space.additive -> emeasure_additive
2666 measure_space.AE_iff_null_set -> AE_iff_null
2667 measure_space.almost_everywhere_def -> eventually_ae_filter
2668 measure_space.almost_everywhere_vimage -> AE_distrD
2669 measure_space.continuity_from_above -> INF_emeasure_decseq
2670 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2671 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2672 measure_space.continuity_from_below -> SUP_emeasure_incseq
2673 measure_space_density -> emeasure_density
2674 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2675 measure_space.integrable_vimage -> integrable_distr
2676 measure_space.integral_translated_density -> integral_density
2677 measure_space.integral_vimage -> integral_distr
2678 measure_space.measure_additive -> plus_emeasure
2679 measure_space.measure_compl -> emeasure_compl
2680 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2681 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2682 measure_space.measure_decseq -> decseq_emeasure
2683 measure_space.measure_Diff -> emeasure_Diff
2684 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2685 measure_space.measure_eq_0 -> emeasure_eq_0
2686 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2687 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2688 measure_space.measure_incseq -> incseq_emeasure
2689 measure_space.measure_insert -> emeasure_insert
2690 measure_space.measure_mono -> emeasure_mono
2691 measure_space.measure_not_negative -> emeasure_not_MInf
2692 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2693 measure_space.measure_setsum -> setsum_emeasure
2694 measure_space.measure_setsum_split -> setsum_emeasure_cover
2695 measure_space.measure_space_vimage -> emeasure_distr
2696 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2697 measure_space.measure_subadditive -> subadditive
2698 measure_space.measure_top -> emeasure_space
2699 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2700 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2701 measure_space.positive_integral_translated_density -> positive_integral_density
2702 measure_space.positive_integral_vimage -> positive_integral_distr
2703 measure_space.real_continuity_from_above -> Lim_measure_decseq
2704 measure_space.real_continuity_from_below -> Lim_measure_incseq
2705 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2706 measure_space.real_measure_Diff -> measure_Diff
2707 measure_space.real_measure_finite_Union -> measure_finite_Union
2708 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2709 measure_space.real_measure_subadditive -> measure_subadditive
2710 measure_space.real_measure_Union -> measure_Union
2711 measure_space.real_measure_UNION -> measure_UNION
2712 measure_space.simple_function_vimage -> simple_function_comp
2713 measure_space.simple_integral_vimage -> simple_integral_distr
2714 measure_space.simple_integral_vimage -> simple_integral_distr
2715 measure_unique_Int_stable -> measure_eqI_generator_eq
2716 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2717 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2718 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2719 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2720 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2721 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2722 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2723 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2724 pair_sigma_algebra.sets_swap -> sets_pair_swap
2725 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2726 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2727 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2728 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2729 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2730 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2731 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2732 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2733 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2734 prob_space.prob_space_vimage -> prob_space_distr
2735 prob_space.random_variable_restrict -> measurable_restrict
2736 prob_space_unique_Int_stable -> measure_eqI_prob_space
2737 product_algebraE -> prod_algebraE_all
2738 product_algebra_generator_der -> prod_algebra_eq_finite
2739 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2740 product_algebraI -> sets_PiM_I_finite
2741 product_measure_exists -> product_sigma_finite.sigma_finite
2742 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2743 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2744 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2745 product_prob_space.measurable_component -> measurable_component_singleton
2746 product_prob_space.measurable_emb -> measurable_prod_emb
2747 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2748 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2749 product_prob_space.measure_emb -> emeasure_prod_emb
2750 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2751 product_sigma_algebra.product_algebra_into_space -> space_closed
2752 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2753 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2754 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2755 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2756 sets_product_algebra -> sets_PiM
2757 sigma_algebra.measurable_sigma -> measurable_measure_of
2758 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2759 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2760 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2761 space_product_algebra -> space_PiM
2763 * Session HOL-TPTP: support to parse and import TPTP problems (all
2764 languages) into Isabelle/HOL.
2769 * New "case_product" attribute (see HOL).
2774 * Greater support for structured proofs involving induction or case
2777 * Much greater use of mathematical symbols.
2779 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2784 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2785 from a minor keyword introduced via theory header declaration.
2787 * Antiquotation @{command_spec "name"} produces the
2788 Outer_Syntax.command_spec from a major keyword introduced via theory
2789 header declaration; it can be passed to Outer_Syntax.command etc.
2791 * Local_Theory.define no longer hard-wires default theorem name
2792 "foo_def", but retains the binding as given. If that is Binding.empty
2793 / Attrib.empty_binding, the result is not registered as user-level
2794 fact. The Local_Theory.define_internal variant allows to specify a
2795 non-empty name (used for the foundation in the background theory),
2796 while omitting the fact binding in the user-context. Potential
2797 INCOMPATIBILITY for derived definitional packages: need to specify
2798 naming policy for primitive definitions more explicitly.
2800 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2801 conformance with similar operations in structure Term and Logic.
2803 * Antiquotation @{attributes [...]} embeds attribute source
2804 representation into the ML text, which is particularly useful with
2805 declarations like Local_Theory.note.
2807 * Structure Proof_Context follows standard naming scheme. Old
2808 ProofContext has been discontinued. INCOMPATIBILITY.
2810 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2811 change of semantics: update is applied to auxiliary local theory
2814 * Modernized some old-style infix operations:
2816 addeqcongs ~> Simplifier.add_eqcong
2817 deleqcongs ~> Simplifier.del_eqcong
2818 addcongs ~> Simplifier.add_cong
2819 delcongs ~> Simplifier.del_cong
2820 setmksimps ~> Simplifier.set_mksimps
2821 setmkcong ~> Simplifier.set_mkcong
2822 setmksym ~> Simplifier.set_mksym
2823 setmkeqTrue ~> Simplifier.set_mkeqTrue
2824 settermless ~> Simplifier.set_termless
2825 setsubgoaler ~> Simplifier.set_subgoaler
2826 addsplits ~> Splitter.add_split
2827 delsplits ~> Splitter.del_split
2832 * USER_HOME settings variable points to cross-platform user home
2833 directory, which coincides with HOME on POSIX systems only. Likewise,
2834 the Isabelle path specification "~" now expands to $USER_HOME, instead
2835 of former $HOME. A different default for USER_HOME may be set
2836 explicitly in shell environment, before Isabelle settings are
2837 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2838 the generic user home was intended.
2840 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2841 notation, which is useful for the jEdit file browser, for example.
2843 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2848 New in Isabelle2011-1 (October 2011)
2849 ------------------------------------
2853 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2854 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2856 - Management of multiple theory files directly from the editor
2857 buffer store -- bypassing the file-system (no requirement to save
2858 files for checking).
2860 - Markup of formal entities within the text buffer, with semantic
2861 highlighting, tooltips and hyperlinks to jump to defining source
2864 - Improved text rendering, with sub/superscripts in the source
2865 buffer (including support for copy/paste wrt. output panel, HTML
2866 theory output and other non-Isabelle text boxes).
2868 - Refined scheduling of proof checking and printing of results,
2869 based on interactive editor view. (Note: jEdit folding and
2870 narrowing allows to restrict buffer perspectives explicitly.)
2872 - Reduced CPU performance requirements, usable on machines with few
2875 - Reduced memory requirements due to pruning of unused document
2876 versions (garbage collection).
2878 See also ~~/src/Tools/jEdit/README.html for further information,
2879 including some remaining limitations.
2881 * Theory loader: source files are exclusively located via the master
2882 directory of each theory node (where the .thy file itself resides).
2883 The global load path (such as src/HOL/Library) has been discontinued.
2884 Note that the path element ~~ may be used to reference theories in the
2885 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2888 * Theory loader: source files are identified by content via SHA1
2889 digests. Discontinued former path/modtime identification and optional
2890 ISABELLE_FILE_IDENT plugin scripts.
2892 * Parallelization of nested Isar proofs is subject to
2893 Goal.parallel_proofs_threshold (default 100). See also isabelle
2896 * Name space: former unsynchronized references are now proper
2897 configuration options, with more conventional names:
2899 long_names ~> names_long
2900 short_names ~> names_short
2901 unique_names ~> names_unique
2903 Minor INCOMPATIBILITY, need to declare options in context like this:
2905 declare [[names_unique = false]]
2907 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2908 that the result needs to be unique, which means fact specifications
2909 may have to be refined after enriching a proof context.
2911 * Attribute "case_names" has been refined: the assumptions in each case
2912 can be named now by following the case name with [name1 name2 ...].
2914 * Isabelle/Isar reference manual has been updated and extended:
2915 - "Synopsis" provides a catalog of main Isar language concepts.
2916 - Formal references in syntax diagrams, via @{rail} antiquotation.
2917 - Updated material from classic "ref" manual, notably about
2918 "Classical Reasoner".
2923 * Class bot and top require underlying partial order rather than
2924 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2926 * Class complete_lattice: generalized a couple of lemmas from sets;
2927 generalized theorems INF_cong and SUP_cong. New type classes for
2928 complete boolean algebras and complete linear orders. Lemmas
2929 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2930 class complete_linorder.
2932 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2933 Sup_fun_def, Inf_apply, Sup_apply.
2935 Removed redundant lemmas (the right hand side gives hints how to
2936 replace them for (metis ...), or (simp only: ...) proofs):
2938 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2939 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2940 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2941 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2942 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2943 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2944 Inter_def ~> INF_def, image_def
2945 Union_def ~> SUP_def, image_def
2946 INT_eq ~> INF_def, and image_def
2947 UN_eq ~> SUP_def, and image_def
2948 INF_subset ~> INF_superset_mono [OF _ order_refl]
2950 More consistent and comprehensive names:
2952 INTER_eq_Inter_image ~> INF_def
2953 UNION_eq_Union_image ~> SUP_def
2956 INF_leI ~> INF_lower
2957 INF_leI2 ~> INF_lower2
2958 le_INFI ~> INF_greatest
2959 le_SUPI ~> SUP_upper
2960 le_SUPI2 ~> SUP_upper2
2961 SUP_leI ~> SUP_least
2962 INFI_bool_eq ~> INF_bool_eq
2963 SUPR_bool_eq ~> SUP_bool_eq
2964 INFI_apply ~> INF_apply
2965 SUPR_apply ~> SUP_apply
2966 INTER_def ~> INTER_eq
2967 UNION_def ~> UNION_eq
2971 * Renamed theory Complete_Lattice to Complete_Lattices.
2974 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2975 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2976 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2977 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2979 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2980 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2981 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2984 * Added syntactic classes "inf" and "sup" for the respective
2985 constants. INCOMPATIBILITY: Changes in the argument order of the
2986 (mostly internal) locale predicates for some derived classes.
2988 * Theorem collections ball_simps and bex_simps do not contain theorems
2989 referring to UNION any longer; these have been moved to collection
2990 UN_ball_bex_simps. INCOMPATIBILITY.
2992 * Theory Archimedean_Field: floor now is defined as parameter of a
2993 separate type class floor_ceiling.
2995 * Theory Finite_Set: more coherent development of fold_set locales:
2997 locale fun_left_comm ~> locale comp_fun_commute
2998 locale fun_left_comm_idem ~> locale comp_fun_idem
3000 Both use point-free characterization; interpretation proofs may need
3001 adjustment. INCOMPATIBILITY.
3003 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
3004 accordance with standard mathematical terminology. INCOMPATIBILITY.
3006 * Theory Complex_Main: The locale interpretations for the
3007 bounded_linear and bounded_bilinear locales have been removed, in
3008 order to reduce the number of duplicate lemmas. Users must use the
3009 original names for distributivity theorems, potential INCOMPATIBILITY.
3011 divide.add ~> add_divide_distrib
3012 divide.diff ~> diff_divide_distrib
3013 divide.setsum ~> setsum_divide_distrib
3014 mult.add_right ~> right_distrib
3015 mult.diff_right ~> right_diff_distrib
3016 mult_right.setsum ~> setsum_right_distrib
3017 mult_left.diff ~> left_diff_distrib
3019 * Theory Complex_Main: Several redundant theorems have been removed or
3020 replaced by more general versions. INCOMPATIBILITY.
3022 real_diff_def ~> minus_real_def
3023 real_divide_def ~> divide_real_def
3024 real_less_def ~> less_le
3025 real_abs_def ~> abs_real_def
3026 real_sgn_def ~> sgn_real_def
3027 real_mult_commute ~> mult_commute
3028 real_mult_assoc ~> mult_assoc
3029 real_mult_1 ~> mult_1_left
3030 real_add_mult_distrib ~> left_distrib
3031 real_zero_not_eq_one ~> zero_neq_one
3032 real_mult_inverse_left ~> left_inverse
3033 INVERSE_ZERO ~> inverse_zero
3034 real_le_refl ~> order_refl
3035 real_le_antisym ~> order_antisym
3036 real_le_trans ~> order_trans
3037 real_le_linear ~> linear
3038 real_le_eq_diff ~> le_iff_diff_le_0
3039 real_add_left_mono ~> add_left_mono
3040 real_mult_order ~> mult_pos_pos
3041 real_mult_less_mono2 ~> mult_strict_left_mono
3042 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
3043 real_0_le_divide_iff ~> zero_le_divide_iff
3044 realpow_two_disj ~> power2_eq_iff
3045 real_squared_diff_one_factored ~> square_diff_one_factored
3046 realpow_two_diff ~> square_diff_square_factored
3047 reals_complete2 ~> complete_real
3048 real_sum_squared_expand ~> power2_sum
3049 exp_ln_eq ~> ln_unique
3051 expi_zero ~> exp_zero
3052 lemma_DERIV_subst ~> DERIV_cong
3053 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
3054 LIMSEQ_const ~> tendsto_const
3055 LIMSEQ_norm ~> tendsto_norm
3056 LIMSEQ_add ~> tendsto_add
3057 LIMSEQ_minus ~> tendsto_minus
3058 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
3059 LIMSEQ_diff ~> tendsto_diff
3060 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
3061 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
3062 LIMSEQ_mult ~> tendsto_mult
3063 LIMSEQ_inverse ~> tendsto_inverse
3064 LIMSEQ_divide ~> tendsto_divide
3065 LIMSEQ_pow ~> tendsto_power
3066 LIMSEQ_setsum ~> tendsto_setsum
3067 LIMSEQ_setprod ~> tendsto_setprod
3068 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
3069 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
3070 LIMSEQ_imp_rabs ~> tendsto_rabs
3071 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
3072 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
3073 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
3074 LIMSEQ_Complex ~> tendsto_Complex
3075 LIM_ident ~> tendsto_ident_at
3076 LIM_const ~> tendsto_const
3077 LIM_add ~> tendsto_add
3078 LIM_add_zero ~> tendsto_add_zero
3079 LIM_minus ~> tendsto_minus
3080 LIM_diff ~> tendsto_diff
3081 LIM_norm ~> tendsto_norm
3082 LIM_norm_zero ~> tendsto_norm_zero
3083 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
3084 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
3085 LIM_rabs ~> tendsto_rabs
3086 LIM_rabs_zero ~> tendsto_rabs_zero
3087 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
3088 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
3089 LIM_compose ~> tendsto_compose
3090 LIM_mult ~> tendsto_mult
3091 LIM_scaleR ~> tendsto_scaleR
3092 LIM_of_real ~> tendsto_of_real
3093 LIM_power ~> tendsto_power
3094 LIM_inverse ~> tendsto_inverse
3095 LIM_sgn ~> tendsto_sgn
3096 isCont_LIM_compose ~> isCont_tendsto_compose
3097 bounded_linear.LIM ~> bounded_linear.tendsto
3098 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
3099 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
3100 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
3101 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
3102 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
3103 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
3105 * Theory Complex_Main: The definition of infinite series was
3106 generalized. Now it is defined on the type class {topological_space,
3107 comm_monoid_add}. Hence it is useable also for extended real numbers.
3109 * Theory Complex_Main: The complex exponential function "expi" is now
3110 a type-constrained abbreviation for "exp :: complex => complex"; thus
3111 several polymorphic lemmas about "exp" are now applicable to "expi".
3115 - Theory Library/Code_Char_ord provides native ordering of
3116 characters in the target language.
3118 - Commands code_module and code_library are legacy, use export_code
3121 - Method "evaluation" is legacy, use method "eval" instead.
3123 - Legacy evaluator "SML" is deactivated by default. May be
3124 reactivated by the following theory command:
3126 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
3128 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
3130 * New proof method "induction" that gives induction hypotheses the
3131 name "IH", thus distinguishing them from further hypotheses that come
3132 from rule induction. The latter are still called "hyps". Method
3133 "induction" is a thin wrapper around "induct" and follows the same
3136 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
3137 still available as a legacy feature for some time.
3140 - Added "need" and "total_consts" options.
3141 - Reintroduced "show_skolems" option by popular demand.
3142 - Renamed attribute: nitpick_def ~> nitpick_unfold.
3146 - Use quasi-sound (and efficient) translations by default.
3147 - Added support for the following provers: E-ToFoF, LEO-II,
3148 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
3149 - Automatically preplay and minimize proofs before showing them if
3150 this can be done within reasonable time.
3151 - sledgehammer available_provers ~> sledgehammer supported_provers.
3153 - Added "preplay_timeout", "slicing", "type_enc", "sound",
3154 "max_mono_iters", and "max_new_mono_instances" options.
3155 - Removed "explicit_apply" and "full_types" options as well as "Full
3156 Types" Proof General menu item. INCOMPATIBILITY.
3159 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
3160 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
3164 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
3165 "elim:" options. INCOMPATIBILITY.
3166 - Introduced 'try' that not only runs 'try_methods' but also
3167 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
3170 - Added "eval" option to evaluate terms for the found counterexample
3171 (currently only supported by the default (exhaustive) tester).
3172 - Added post-processing of terms to obtain readable counterexamples
3173 (currently only supported by the default (exhaustive) tester).
3174 - New counterexample generator quickcheck[narrowing] enables
3175 narrowing-based testing. Requires the Glasgow Haskell compiler
3176 with its installation location defined in the Isabelle settings
3177 environment as ISABELLE_GHC.
3178 - Removed quickcheck tester "SML" based on the SML code generator
3179 (formly in HOL/Library).
3181 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
3182 use 'partial_function' instead.
3184 * Theory Library/Extended_Reals replaces now the positive extended
3185 reals found in probability theory. This file is extended by
3186 Multivariate_Analysis/Extended_Real_Limits.
3188 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
3189 from where it must be imported explicitly if it is really required.
3192 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
3193 been moved here. INCOMPATIBILITY.
3195 * Theory Library/Saturated provides type of numbers with saturated
3198 * Theory Library/Product_Lattice defines a pointwise ordering for the
3199 product type 'a * 'b, and provides instance proofs for various order
3200 and lattice type classes.
3202 * Theory Library/Countable now provides the "countable_datatype" proof
3203 method for proving "countable" class instances for datatypes.
3205 * Theory Library/Cset_Monad allows do notation for computable sets
3206 (cset) via the generic monad ad-hoc overloading facility.
3208 * Library: Theories of common data structures are split into theories
3209 for implementation, an invariant-ensuring type, and connection to an
3210 abstract type. INCOMPATIBILITY.
3212 - RBT is split into RBT and RBT_Mapping.
3213 - AssocList is split and renamed into AList and AList_Mapping.
3214 - DList is split into DList_Impl, DList, and DList_Cset.
3215 - Cset is split into Cset and List_Cset.
3217 * Theory Library/Nat_Infinity has been renamed to
3218 Library/Extended_Nat, with name changes of the following types and
3221 type inat ~> type enat
3223 Infty ~> infinity (overloaded)
3227 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
3228 been renamed accordingly. INCOMPATIBILITY.
3230 * Session Multivariate_Analysis: The euclidean_space type class now
3231 fixes a constant "Basis :: 'a set" consisting of the standard
3232 orthonormal basis for the type. Users now have the option of
3233 quantifying over this set instead of using the "basis" function, e.g.
3234 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
3236 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
3237 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
3238 "Cart_nth" and "Cart_lambda" have been respectively renamed to
3239 "vec_nth" and "vec_lambda"; theorems mentioning those names have
3240 changed to match. Definition theorems for overloaded constants now use
3241 the standard "foo_vec_def" naming scheme. A few other theorems have
3242 been renamed as follows (INCOMPATIBILITY):
3244 Cart_eq ~> vec_eq_iff
3245 dist_nth_le_cart ~> dist_vec_nth_le
3246 tendsto_vector ~> vec_tendstoI
3247 Cauchy_vector ~> vec_CauchyI
3249 * Session Multivariate_Analysis: Several duplicate theorems have been
3250 removed, and other theorems have been renamed or replaced with more
3251 general versions. INCOMPATIBILITY.
3253 finite_choice ~> finite_set_choice
3254 eventually_conjI ~> eventually_conj
3255 eventually_and ~> eventually_conj_iff
3256 eventually_false ~> eventually_False
3257 setsum_norm ~> norm_setsum
3258 Lim_sequentially ~> LIMSEQ_def
3259 Lim_ident_at ~> LIM_ident
3260 Lim_const ~> tendsto_const
3261 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
3262 Lim_neg ~> tendsto_minus
3263 Lim_add ~> tendsto_add
3264 Lim_sub ~> tendsto_diff
3265 Lim_mul ~> tendsto_scaleR
3266 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
3267 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
3268 Lim_linear ~> bounded_linear.tendsto
3269 Lim_component ~> tendsto_euclidean_component
3270 Lim_component_cart ~> tendsto_vec_nth
3271 Lim_inner ~> tendsto_inner [OF tendsto_const]
3272 dot_lsum ~> inner_setsum_left
3273 dot_rsum ~> inner_setsum_right
3274 continuous_cmul ~> continuous_scaleR [OF continuous_const]
3275 continuous_neg ~> continuous_minus
3276 continuous_sub ~> continuous_diff
3277 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
3278 continuous_mul ~> continuous_scaleR
3279 continuous_inv ~> continuous_inverse
3280 continuous_at_within_inv ~> continuous_at_within_inverse
3281 continuous_at_inv ~> continuous_at_inverse
3282 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
3283 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
3284 continuous_at_component ~> continuous_component [OF continuous_at_id]
3285 continuous_on_neg ~> continuous_on_minus
3286 continuous_on_sub ~> continuous_on_diff
3287 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
3288 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
3289 continuous_on_mul ~> continuous_on_scaleR
3290 continuous_on_mul_real ~> continuous_on_mult
3291 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
3292 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
3293 continuous_on_inverse ~> continuous_on_inv
3294 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
3295 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
3296 subset_interior ~> interior_mono
3297 subset_closure ~> closure_mono
3298 closure_univ ~> closure_UNIV
3299 real_arch_lt ~> reals_Archimedean2
3300 real_arch ~> reals_Archimedean3
3301 real_abs_norm ~> abs_norm_cancel
3302 real_abs_sub_norm ~> norm_triangle_ineq3
3303 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
3305 * Session HOL-Probability:
3306 - Caratheodory's extension lemma is now proved for ring_of_sets.
3307 - Infinite products of probability measures are now available.
3308 - Sigma closure is independent, if the generator is independent
3309 - Use extended reals instead of positive extended
3310 reals. INCOMPATIBILITY.
3312 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
3314 expand_fun_below ~> fun_below_iff
3315 below_fun_ext ~> fun_belowI
3316 expand_cfun_eq ~> cfun_eq_iff
3317 ext_cfun ~> cfun_eqI
3318 expand_cfun_below ~> cfun_below_iff
3319 below_cfun_ext ~> cfun_belowI
3320 monofun_fun_fun ~> fun_belowD
3321 monofun_fun_arg ~> monofunE
3322 monofun_lub_fun ~> adm_monofun [THEN admD]
3323 cont_lub_fun ~> adm_cont [THEN admD]
3324 cont2cont_Rep_CFun ~> cont2cont_APP
3325 cont_Rep_CFun_app ~> cont_APP_app
3326 cont_Rep_CFun_app_app ~> cont_APP_app_app
3327 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
3328 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
3329 contlub_cfun ~> lub_APP [symmetric]
3330 contlub_LAM ~> lub_LAM [symmetric]
3333 lift_distinct1 ~> lift.distinct(1)
3334 lift_distinct2 ~> lift.distinct(2)
3335 Def_not_UU ~> lift.distinct(2)
3336 Def_inject ~> lift.inject
3337 below_UU_iff ~> below_bottom_iff
3338 eq_UU_iff ~> eq_bottom_iff
3341 *** Document preparation ***
3343 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
3344 isar-ref manual, both for description and actual application of the
3347 * Antiquotation @{value} evaluates the given term and presents its
3350 * Antiquotations: term style "isub" provides ad-hoc conversion of
3351 variables x1, y23 into subscripted form x\<^isub>1,
3352 y\<^isub>2\<^isub>3.
3354 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
3355 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
3357 * Localized \isabellestyle switch can be used within blocks or groups
3360 \isabellestyle{it} %preferred default
3361 {\isabellestylett @{text "typewriter stuff"}}
3363 * Discontinued special treatment of hard tabulators. Implicit
3364 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
3370 * The inner syntax of sort/type/term/prop supports inlined YXML
3371 representations within quoted string tokens. By encoding logical
3372 entities via Term_XML (in ML or Scala) concrete syntax can be
3373 bypassed, which is particularly useful for producing bits of text
3374 under external program control.
3376 * Antiquotations for ML and document preparation are managed as theory
3377 data, which requires explicit setup.
3379 * Isabelle_Process.is_active allows tools to check if the official
3380 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
3381 (better known as Proof General).
3383 * Structure Proof_Context follows standard naming scheme. Old
3384 ProofContext is still available for some time as legacy alias.
3386 * Structure Timing provides various operations for timing; supersedes
3387 former start_timing/end_timing etc.
3389 * Path.print is the official way to show file-system paths to users
3390 (including quotes etc.).
3392 * Inner syntax: identifiers in parse trees of generic categories
3393 "logic", "aprop", "idt" etc. carry position information (disguised as
3394 type constraints). Occasional INCOMPATIBILITY with non-compliant
3395 translations that choke on unexpected type constraints. Positions can
3396 be stripped in ML translations via Syntax.strip_positions /
3397 Syntax.strip_positions_ast, or via the syntax constant
3398 "_strip_positions" within parse trees. As last resort, positions can
3399 be disabled via the configuration option Syntax.positions, which is
3400 called "syntax_positions" in Isar attribute syntax.
3402 * Discontinued special status of various ML structures that contribute
3403 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
3404 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
3405 refer directly to Ast.Constant, Lexicon.is_identifier,
3406 Syntax_Trans.mk_binder_tr etc.
3408 * Typed print translation: discontinued show_sorts argument, which is
3409 already available via context of "advanced" translation.
3411 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
3412 goal states; body tactic needs to address all subgoals uniformly.
3414 * Slightly more special eq_list/eq_set, with shortcut involving
3415 pointer equality (assumes that eq relation is reflexive).
3417 * Classical tactics use proper Proof.context instead of historic types
3418 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
3419 operate directly on Proof.context. Raw type claset retains its use as
3420 snapshot of the classical context, which can be recovered via
3421 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
3422 INCOMPATIBILITY, classical tactics and derived proof methods require
3423 proper Proof.context.
3428 * Discontinued support for Poly/ML 5.2, which was the last version
3429 without proper multithreading and TimeLimit implementation.
3431 * Discontinued old lib/scripts/polyml-platform, which has been
3432 obsolete since Isabelle2009-2.
3434 * Various optional external tools are referenced more robustly and
3435 uniformly by explicit Isabelle settings as follows:
3437 ISABELLE_CSDP (formerly CSDP_EXE)
3438 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
3439 ISABELLE_OCAML (formerly EXEC_OCAML)
3440 ISABELLE_SWIPL (formerly EXEC_SWIPL)
3441 ISABELLE_YAP (formerly EXEC_YAP)
3443 Note that automated detection from the file-system or search path has
3444 been discontinued. INCOMPATIBILITY.
3446 * Scala layer provides JVM method invocation service for static
3447 methods of type (String)String, see Invoke_Scala.method in ML. For
3450 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
3452 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
3453 this allows to pass structured values between ML and Scala.
3455 * The IsabelleText fonts includes some further glyphs to support the
3456 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
3457 installed a local copy (which is normally *not* required) need to
3458 delete or update it from ~~/lib/fonts/.
3462 New in Isabelle2011 (January 2011)
3463 ----------------------------------
3467 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
3468 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
3469 useful tooltips and hyperlinks produced from its static analysis. The
3470 bundled component provides an executable Isabelle tool that can be run
3473 Isabelle2011/bin/isabelle jedit
3475 * Significantly improved Isabelle/Isar implementation manual.
3477 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
3478 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
3479 while the default heap location within that directory lacks that extra
3480 suffix. This isolates multiple Isabelle installations from each
3481 other, avoiding problems with old settings in new versions.
3482 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
3484 * Source files are always encoded as UTF-8, instead of old-fashioned
3485 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
3486 the following package declarations:
3488 \usepackage[utf8]{inputenc}
3489 \usepackage{textcomp}
3491 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
3492 a Unicode character is treated as a single symbol, not a sequence of
3493 non-ASCII bytes as before. Since Isabelle/ML string literals may
3494 contain symbols without further backslash escapes, Unicode can now be
3495 used here as well. Recall that Symbol.explode in ML provides a
3496 consistent view on symbols, while raw explode (or String.explode)
3497 merely give a byte-oriented representation.
3499 * Theory loader: source files are primarily located via the master
3500 directory of each theory node (where the .thy file itself resides).
3501 The global load path is still partially available as legacy feature.
3502 Minor INCOMPATIBILITY due to subtle change in file lookup: use
3503 explicit paths, relatively to the theory.
3505 * Special treatment of ML file names has been discontinued.
3506 Historically, optional extensions .ML or .sml were added on demand --
3507 at the cost of clarity of file dependencies. Recall that Isabelle/ML
3508 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
3510 * Various options that affect pretty printing etc. are now properly
3511 handled within the context via configuration options, instead of
3512 unsynchronized references or print modes. There are both ML Config.T
3513 entities and Isar declaration attributes to access these.
3515 ML (Config.T) Isar (attribute)
3517 eta_contract eta_contract
3518 show_brackets show_brackets
3519 show_sorts show_sorts
3520 show_types show_types
3521 show_question_marks show_question_marks
3522 show_consts show_consts
3523 show_abbrevs show_abbrevs
3525 Syntax.ast_trace syntax_ast_trace
3526 Syntax.ast_stat syntax_ast_stat
3527 Syntax.ambiguity_level syntax_ambiguity_level
3529 Goal_Display.goals_limit goals_limit
3530 Goal_Display.show_main_goal show_main_goal
3532 Method.rule_trace rule_trace
3534 Thy_Output.display thy_output_display
3535 Thy_Output.quotes thy_output_quotes
3536 Thy_Output.indent thy_output_indent
3537 Thy_Output.source thy_output_source
3538 Thy_Output.break thy_output_break
3540 Note that corresponding "..._default" references in ML may only be
3541 changed globally at the ROOT session setup, but *not* within a theory.
3542 The option "show_abbrevs" supersedes the former print mode
3543 "no_abbrevs" with inverted meaning.
3545 * More systematic naming of some configuration options.
3548 trace_simp ~> simp_trace
3549 debug_simp ~> simp_debug
3551 * Support for real valued configuration options, using simplistic
3552 floating-point notation that coincides with the inner syntax for
3555 * Support for real valued preferences (with approximative PGIP type):
3556 front-ends need to accept "pgint" values in float notation.
3559 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
3562 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
3567 * Command 'type_synonym' (with single argument) replaces somewhat
3568 outdated 'types', which is still available as legacy feature for some
3571 * Command 'nonterminal' (with 'and' separated list of arguments)
3572 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
3574 * Command 'notepad' replaces former 'example_proof' for
3575 experimentation in Isar without any result. INCOMPATIBILITY.
3577 * Locale interpretation commands 'interpret' and 'sublocale' accept
3578 lists of equations to map definitions in a locale to appropriate
3579 entities in the context of the interpretation. The 'interpretation'
3580 command already provided this functionality.
3582 * Diagnostic command 'print_dependencies' prints the locale instances
3583 that would be activated if the specified expression was interpreted in
3584 the current context. Variant "print_dependencies!" assumes a context
3585 without interpretations.
3587 * Diagnostic command 'print_interps' prints interpretations in proofs
3588 in addition to interpretations in theories.
3590 * Discontinued obsolete 'global' and 'local' commands to manipulate
3591 the theory name space. Rare INCOMPATIBILITY. The ML functions
3592 Sign.root_path and Sign.local_path may be applied directly where this
3593 feature is still required for historical reasons.
3595 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
3596 'definition' instead.
3598 * The "prems" fact, which refers to the accidental collection of
3599 foundational premises in the context, is now explicitly marked as
3600 legacy feature and will be discontinued soon. Consider using "assms"
3601 of the head statement or reference facts by explicit names.
3603 * Document antiquotations @{class} and @{type} print classes and type
3606 * Document antiquotation @{file} checks file/directory entries within
3607 the local file system.
3612 * Coercive subtyping: functions can be declared as coercions and type
3613 inference will add them as necessary upon input of a term. Theory
3614 Complex_Main declares real :: nat => real and real :: int => real as
3615 coercions. A coercion function f is declared like this:
3617 declare [[coercion f]]
3619 To lift coercions through type constructors (e.g. from nat => real to
3620 nat list => real list), map functions can be declared, e.g.
3622 declare [[coercion_map map]]
3624 Currently coercion inference is activated only in theories including
3625 real numbers, i.e. descendants of Complex_Main. This is controlled by
3626 the configuration option "coercion_enabled", e.g. it can be enabled in
3627 other theories like this:
3629 declare [[coercion_enabled]]
3631 * Command 'partial_function' provides basic support for recursive
3632 function definitions over complete partial orders. Concrete instances
3633 are provided for i) the option type, ii) tail recursion on arbitrary
3634 types, and iii) the heap monad of Imperative_HOL. See
3635 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
3638 * Function package: f.psimps rules are no longer implicitly declared
3639 as [simp]. INCOMPATIBILITY.
3641 * Datatype package: theorems generated for executable equality (class
3642 "eq") carry proper names and are treated as default code equations.
3644 * Inductive package: now offers command 'inductive_simps' to
3645 automatically derive instantiated and simplified equations for
3646 inductive predicates, similar to 'inductive_cases'.
3648 * Command 'enriched_type' allows to register properties of the
3649 functorial structure of types.
3651 * Improved infrastructure for term evaluation using code generator
3652 techniques, in particular static evaluation conversions.
3654 * Code generator: Scala (2.8 or higher) has been added to the target
3657 * Code generator: globbing constant expressions "*" and "Theory.*"
3658 have been replaced by the more idiomatic "_" and "Theory._".
3661 * Code generator: export_code without explicit file declaration prints
3662 to standard output. INCOMPATIBILITY.
3664 * Code generator: do not print function definitions for case
3665 combinators any longer.
3667 * Code generator: simplification with rules determined with
3668 src/Tools/Code/code_simp.ML and method "code_simp".
3670 * Code generator for records: more idiomatic representation of record
3671 types. Warning: records are not covered by ancient SML code
3672 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3673 rep_datatype declaration helps to succeed then:
3677 rep_datatype foo_ext ...
3679 * Records: logical foundation type for records does not carry a
3680 '_type' suffix any longer (obsolete due to authentic syntax).
3683 * Quickcheck now by default uses exhaustive testing instead of random
3684 testing. Random testing can be invoked by "quickcheck [random]",
3685 exhaustive testing by "quickcheck [exhaustive]".
3687 * Quickcheck instantiates polymorphic types with small finite
3688 datatypes by default. This enables a simple execution mechanism to
3689 handle quantifiers and function equality over the finite datatypes.
3691 * Quickcheck random generator has been renamed from "code" to
3692 "random". INCOMPATIBILITY.
3694 * Quickcheck now has a configurable time limit which is set to 30
3695 seconds by default. This can be changed by adding [timeout = n] to the
3696 quickcheck command. The time limit for Auto Quickcheck is still set
3699 * Quickcheck in locales considers interpretations of that locale for
3700 counter example search.
3703 - Added "smt" and "remote_smt" provers based on the "smt" proof
3704 method. See the Sledgehammer manual for details ("isabelle doc
3707 sledgehammer atp_info ~> sledgehammer running_provers
3708 sledgehammer atp_kill ~> sledgehammer kill_provers
3709 sledgehammer available_atps ~> sledgehammer available_provers
3712 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3713 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3714 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3715 (and "ms" and "min" are no longer supported)
3720 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3721 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3723 - Added support for partial quotient types.
3724 - Added local versions of the "Nitpick.register_xxx" functions.
3725 - Added "whack" option.
3726 - Allow registration of quotient types as codatatypes.
3727 - Improved "merge_type_vars" option to merge more types.
3728 - Removed unsound "fast_descrs" option.
3729 - Added custom symmetry breaking for datatypes, making it possible to reach
3730 higher cardinalities.
3731 - Prevent the expansion of too large definitions.
3733 * Proof methods "metis" and "meson" now have configuration options
3734 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3735 to diagnose these tools. E.g.
3737 using [[metis_trace = true]]
3739 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3740 manually as command 'solve_direct'.
3742 * The default SMT solver Z3 must be enabled explicitly (due to
3743 licensing issues) by setting the environment variable
3744 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3745 commercial applications, the SMT solver CVC3 is provided as fall-back;
3746 changing the SMT solver is done via the configuration option
3749 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3750 i.e. "remote_cvc3" and "remote_z3".
3752 * Added basic SMT support for datatypes, records, and typedefs using
3753 the oracle mode (no proofs). Direct support of pairs has been dropped
3754 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3755 support for a similar behavior). Minor INCOMPATIBILITY.
3757 * Changed SMT configuration options:
3759 z3_proofs ~> smt_oracle (with inverted meaning)
3760 z3_trace_assms ~> smt_trace_used_facts
3773 * Boogie output files (.b2i files) need to be declared in the theory
3776 * Simplification procedure "list_to_set_comprehension" rewrites list
3777 comprehensions applied to List.set to set comprehensions. Occasional
3778 INCOMPATIBILITY, may be deactivated like this:
3780 declare [[simproc del: list_to_set_comprehension]]
3782 * Removed old version of primrec package. INCOMPATIBILITY.
3784 * Removed simplifier congruence rule of "prod_case", as has for long
3785 been the case with "split". INCOMPATIBILITY.
3787 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3789 * Removed [split_format ... and ... and ...] version of
3790 [split_format]. Potential INCOMPATIBILITY.
3792 * Predicate "sorted" now defined inductively, with nice induction
3793 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3795 * Constant "contents" renamed to "the_elem", to free the generic name
3796 contents for other uses. INCOMPATIBILITY.
3798 * Renamed class eq and constant eq (for code generation) to class
3799 equal and constant equal, plus renaming of related facts and various
3800 tuning. INCOMPATIBILITY.
3802 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3804 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3807 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3808 avoid confusion with finite sets. INCOMPATIBILITY.
3810 * Abandoned locales equiv, congruent and congruent2 for equivalence
3811 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3814 * Some previously unqualified names have been qualified:
3821 Trueprop ~> HOL.Trueprop
3826 op --> ~> HOL.implies
3838 Pair ~> Product_Type.Pair
3839 fst ~> Product_Type.fst
3840 snd ~> Product_Type.snd
3841 curry ~> Product_Type.curry
3843 Collect ~> Set.Collect
3847 * More canonical naming convention for some fundamental definitions:
3849 bot_bool_eq ~> bot_bool_def
3850 top_bool_eq ~> top_bool_def
3851 inf_bool_eq ~> inf_bool_def
3852 sup_bool_eq ~> sup_bool_def
3853 bot_fun_eq ~> bot_fun_def
3854 top_fun_eq ~> top_fun_def
3855 inf_fun_eq ~> inf_fun_def
3856 sup_fun_eq ~> sup_fun_def
3860 * More stylized fact names:
3862 expand_fun_eq ~> fun_eq_iff
3863 expand_set_eq ~> set_eq_iff
3865 nat_number ~> eval_nat_numeral
3869 * Refactoring of code-generation specific operations in theory List:
3875 mem_iff ~> member_def
3876 null_empty ~> null_def
3878 INCOMPATIBILITY. Note that these were not supposed to be used
3879 regularly unless for striking reasons; their main purpose was code
3882 Various operations from the Haskell prelude are used for generating
3885 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3886 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3887 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3889 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3890 "*" and "+" respectively. INCOMPATIBILITY.
3892 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3893 "Sum_Type.Plus" instead.
3895 * Constant "split" has been merged with constant "prod_case"; names of
3896 ML functions, facts etc. involving split have been retained so far,
3897 though. INCOMPATIBILITY.
3899 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3900 instead. INCOMPATIBILITY.
3902 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3905 * Former theory Library/Enum is now part of the HOL-Main image.
3906 INCOMPATIBILITY: all constants of the Enum theory now have to be
3907 referred to by its qualified name.
3910 nlists ~> Enum.nlists
3911 product ~> Enum.product
3913 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3914 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3917 * Theory Library/SetsAndFunctions has been split into
3918 Library/Function_Algebras and Library/Set_Algebras; canonical names
3919 for instance definitions for functions; various improvements.
3922 * Theory Library/Multiset provides stable quicksort implementation of
3925 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3928 * Session Multivariate_Analysis: introduced a type class for euclidean
3929 space. Most theorems are now stated in terms of euclidean spaces
3930 instead of finite cartesian products.
3933 real ^ 'n ~> 'a::real_vector
3934 ~> 'a::euclidean_space
3935 ~> 'a::ordered_euclidean_space
3936 (depends on your needs)
3940 \<chi> x. _ ~> \<chi>\<chi> x. _
3943 Also note that the indices are now natural numbers and not from some
3944 finite type. Finite cartesian products of euclidean spaces, products
3945 of euclidean spaces the real and complex numbers are instantiated to
3946 be euclidean_spaces. INCOMPATIBILITY.
3948 * Session Probability: introduced pextreal as positive extended real
3949 numbers. Use pextreal as value for measures. Introduce the
3950 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3951 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3952 the integral in Multivariate Analysis. INCOMPATIBILITY.
3954 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3957 * Session SPARK (with image HOL-SPARK) provides commands to load and
3958 prove verification conditions generated by the SPARK Ada program
3959 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3964 * Theorems for additive ring operations (locale abelian_monoid and
3965 descendants) are generated by interpretation from their multiplicative
3966 counterparts. Names (in particular theorem names) have the mandatory
3967 qualifier 'add'. Previous theorem names are redeclared for
3970 * Structure "int_ring" is now an abbreviation (previously a
3971 definition). This fits more natural with advanced interpretations.
3976 * The domain package now runs in definitional mode by default: The
3977 former command 'new_domain' is now called 'domain'. To use the domain
3978 package in its original axiomatic mode, use 'domain (unsafe)'.
3981 * The new class "domain" is now the default sort. Class "predomain"
3982 is an unpointed version of "domain". Theories can be updated by
3983 replacing sort annotations as shown below. INCOMPATIBILITY.
3985 'a::type ~> 'a::countable
3986 'a::cpo ~> 'a::predomain
3987 'a::pcpo ~> 'a::domain
3989 * The old type class "rep" has been superseded by class "domain".
3990 Accordingly, users of the definitional package must remove any
3991 "default_sort rep" declarations. INCOMPATIBILITY.
3993 * The domain package (definitional mode) now supports unpointed
3994 predomain argument types, as long as they are marked 'lazy'. (Strict
3995 arguments must be in class "domain".) For example, the following
3996 domain definition now works:
3998 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
4000 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
4001 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
4002 'a option, and 'a list. Additionally, it configures fixrec and the
4003 domain package to work with these types. For example:
4005 fixrec isInl :: "('a + 'b) u -> tr"
4006 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
4008 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
4010 * The "(permissive)" option of fixrec has been replaced with a
4011 per-equation "(unchecked)" option. See
4012 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
4014 * The "bifinite" class no longer fixes a constant "approx"; the class
4015 now just asserts that such a function exists. INCOMPATIBILITY.
4017 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
4018 defines an embedding of type 'a defl into udom by default; instances
4019 of "bifinite" and "domain" classes are available in
4020 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
4022 * The syntax "REP('a)" has been replaced with "DEFL('a)".
4024 * The predicate "directed" has been removed. INCOMPATIBILITY.
4026 * The type class "finite_po" has been removed. INCOMPATIBILITY.
4028 * The function "cprod_map" has been renamed to "prod_map".
4031 * The monadic bind operator on each powerdomain has new binder syntax
4032 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
4033 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
4035 * The infix syntax for binary union on each powerdomain has changed
4036 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
4037 syntax. INCOMPATIBILITY.
4039 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
4040 still supported as an input translation.
4042 * Renamed some theorems (the original names are also still available).
4044 expand_fun_below ~> fun_below_iff
4045 below_fun_ext ~> fun_belowI
4046 expand_cfun_eq ~> cfun_eq_iff
4047 ext_cfun ~> cfun_eqI
4048 expand_cfun_below ~> cfun_below_iff
4049 below_cfun_ext ~> cfun_belowI
4050 cont2cont_Rep_CFun ~> cont2cont_APP
4052 * The Abs and Rep functions for various types have changed names.
4053 Related theorem names have also changed to match. INCOMPATIBILITY.
4055 Rep_CFun ~> Rep_cfun
4056 Abs_CFun ~> Abs_cfun
4057 Rep_Sprod ~> Rep_sprod
4058 Abs_Sprod ~> Abs_sprod
4059 Rep_Ssum ~> Rep_ssum
4060 Abs_Ssum ~> Abs_ssum
4062 * Lemmas with names of the form *_defined_iff or *_strict_iff have
4063 been renamed to *_bottom_iff. INCOMPATIBILITY.
4065 * Various changes to bisimulation/coinduction with domain package:
4067 - Definitions of "bisim" constants no longer mention definedness.
4068 - With mutual recursion, "bisim" predicate is now curried.
4069 - With mutual recursion, each type gets a separate coind theorem.
4070 - Variable names in bisim_def and coinduct rules have changed.
4074 * Case combinators generated by the domain package for type "foo" are
4075 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
4077 * Several theorems have been renamed to more accurately reflect the
4078 names of constants and types involved. INCOMPATIBILITY.
4080 thelub_const ~> lub_const
4081 lub_const ~> is_lub_const
4083 is_lub_lub ~> is_lubD2
4085 unique_lub ~> is_lub_unique
4086 is_ub_lub ~> is_lub_rangeD1
4087 lub_bin_chain ~> is_lub_bin_chain
4088 lub_fun ~> is_lub_fun
4089 thelub_fun ~> lub_fun
4090 thelub_cfun ~> lub_cfun
4091 thelub_Pair ~> lub_Pair
4092 lub_cprod ~> is_lub_prod
4093 thelub_cprod ~> lub_prod
4094 minimal_cprod ~> minimal_prod
4095 inst_cprod_pcpo ~> inst_prod_pcpo
4097 compact_UU ~> compact_bottom
4098 deflation_UU ~> deflation_bottom
4099 finite_deflation_UU ~> finite_deflation_bottom
4101 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
4103 sq_ord_less_eq_trans ~> below_eq_trans
4104 sq_ord_eq_less_trans ~> eq_below_trans
4105 refl_less ~> below_refl
4106 trans_less ~> below_trans
4107 antisym_less ~> below_antisym
4108 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
4109 box_less ~> box_below
4110 rev_trans_less ~> rev_below_trans
4111 not_less2not_eq ~> not_below2not_eq
4112 less_UU_iff ~> below_UU_iff
4113 flat_less_iff ~> flat_below_iff
4114 adm_less ~> adm_below
4115 adm_not_less ~> adm_not_below
4116 adm_compact_not_less ~> adm_compact_not_below
4117 less_fun_def ~> below_fun_def
4118 expand_fun_less ~> fun_below_iff
4119 less_fun_ext ~> fun_belowI
4120 less_discr_def ~> below_discr_def
4121 discr_less_eq ~> discr_below_eq
4122 less_unit_def ~> below_unit_def
4123 less_cprod_def ~> below_prod_def
4124 prod_lessI ~> prod_belowI
4125 Pair_less_iff ~> Pair_below_iff
4126 fst_less_iff ~> fst_below_iff
4127 snd_less_iff ~> snd_below_iff
4128 expand_cfun_less ~> cfun_below_iff
4129 less_cfun_ext ~> cfun_belowI
4130 injection_less ~> injection_below
4131 less_up_def ~> below_up_def
4132 not_Iup_less ~> not_Iup_below
4133 Iup_less ~> Iup_below
4135 Def_inject_less_eq ~> Def_below_Def
4136 Def_less_is_eq ~> Def_below_iff
4137 spair_less_iff ~> spair_below_iff
4138 less_sprod ~> below_sprod
4139 spair_less ~> spair_below
4140 sfst_less_iff ~> sfst_below_iff
4141 ssnd_less_iff ~> ssnd_below_iff
4142 fix_least_less ~> fix_least_below
4143 dist_less_one ~> dist_below_one
4144 less_ONE ~> below_ONE
4145 ONE_less_iff ~> ONE_below_iff
4146 less_sinlD ~> below_sinlD
4147 less_sinrD ~> below_sinrD
4152 * All constant names are now qualified internally and use proper
4153 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
4158 * Antiquotation @{assert} inlines a function bool -> unit that raises
4159 Fail if the argument is false. Due to inlining the source position of
4160 failed assertions is included in the error output.
4162 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
4163 text is in practice always evaluated with a stable theory checkpoint.
4164 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
4166 * Antiquotation @{theory A} refers to theory A from the ancestry of
4167 the current context, not any accidental theory loader state as before.
4168 Potential INCOMPATIBILITY, subtle change in semantics.
4170 * Syntax.pretty_priority (default 0) configures the required priority
4171 of pretty-printed output and thus affects insertion of parentheses.
4173 * Syntax.default_root (default "any") configures the inner syntax
4174 category (nonterminal symbol) for parsing of terms.
4176 * Former exception Library.UnequalLengths now coincides with
4177 ListPair.UnequalLengths.
4179 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
4180 main functionality is provided by structure Simplifier.
4182 * Renamed raw "explode" function to "raw_explode" to emphasize its
4183 meaning. Note that internally to Isabelle, Symbol.explode is used in
4184 almost all situations.
4186 * Discontinued obsolete function sys_error and exception SYS_ERROR.
4187 See implementation manual for further details on exceptions in
4190 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
4193 * Renamed structure PureThy to Pure_Thy and moved most of its
4194 operations to structure Global_Theory, to emphasize that this is
4195 rarely-used global-only stuff.
4197 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
4198 instead (or tracing for high-volume output).
4200 * Configuration option show_question_marks only affects regular pretty
4201 printing of types and terms, not raw Term.string_of_vname.
4203 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
4204 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
4205 @{thms} for most purposes.
4207 * ML structure Unsynchronized is never opened, not even in Isar
4208 interaction mode as before. Old Unsynchronized.set etc. have been
4209 discontinued -- use plain := instead. This should be *rare* anyway,
4210 since modern tools always work via official context data, notably
4211 configuration options.
4213 * Parallel and asynchronous execution requires special care concerning
4214 interrupts. Structure Exn provides some convenience functions that
4215 avoid working directly with raw Interrupt. User code must not absorb
4216 interrupts -- intermediate handling (for cleanup etc.) needs to be
4217 followed by re-raising of the original exception. Another common
4218 source of mistakes are "handle _" patterns, which make the meaning of
4219 the program subject to physical effects of the environment.
4223 New in Isabelle2009-2 (June 2010)
4224 ---------------------------------
4228 * Authentic syntax for *all* logical entities (type classes, type
4229 constructors, term constants): provides simple and robust
4230 correspondence between formal entities and concrete syntax. Within
4231 the parse tree / AST representations, "constants" are decorated by
4232 their category (class, type, const) and spelled out explicitly with
4233 their full internal name.
4235 Substantial INCOMPATIBILITY concerning low-level syntax declarations
4236 and translations (translation rules and translation functions in ML).
4237 Some hints on upgrading:
4239 - Many existing uses of 'syntax' and 'translations' can be replaced
4240 by more modern 'type_notation', 'notation' and 'abbreviation',
4241 which are independent of this issue.
4243 - 'translations' require markup within the AST; the term syntax
4244 provides the following special forms:
4246 CONST c -- produces syntax version of constant c from context
4247 XCONST c -- literally c, checked as constant from context
4248 c -- literally c, if declared by 'syntax'
4250 Plain identifiers are treated as AST variables -- occasionally the
4251 system indicates accidental variables via the error "rhs contains
4254 Type classes and type constructors are marked according to their
4255 concrete syntax. Some old translations rules need to be written
4256 for the "type" category, using type constructor application
4257 instead of pseudo-term application of the default category
4260 - 'parse_translation' etc. in ML may use the following
4263 @{class_syntax c} -- type class c within parse tree / AST
4264 @{term_syntax c} -- type constructor c within parse tree / AST
4265 @{const_syntax c} -- ML version of "CONST c" above
4266 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
4268 - Literal types within 'typed_print_translations', i.e. those *not*
4269 represented as pseudo-terms are represented verbatim. Use @{class
4270 c} or @{type_name c} here instead of the above syntax
4273 Note that old non-authentic syntax was based on unqualified base
4274 names, so all of the above "constant" names would coincide. Recall
4275 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
4276 diagnose syntax problems.
4278 * Type constructors admit general mixfix syntax, not just infix.
4280 * Concrete syntax may be attached to local entities without a proof
4281 body, too. This works via regular mixfix annotations for 'fix',
4282 'def', 'obtain' etc. or via the explicit 'write' command, which is
4283 similar to the 'notation' command in theory specifications.
4285 * Discontinued unnamed infix syntax (legacy feature for many years) --
4286 need to specify constant name and syntax separately. Internal ML
4287 datatype constructors have been renamed from InfixName to Infix etc.
4288 Minor INCOMPATIBILITY.
4290 * Schematic theorem statements need to be explicitly markup as such,
4291 via commands 'schematic_lemma', 'schematic_theorem',
4292 'schematic_corollary'. Thus the relevance of the proof is made
4293 syntactically clear, which impacts performance in a parallel or
4294 asynchronous interactive environment. Minor INCOMPATIBILITY.
4296 * Use of cumulative prems via "!" in some proof methods has been
4297 discontinued (old legacy feature).
4299 * References 'trace_simp' and 'debug_simp' have been replaced by
4300 configuration options stored in the context. Enabling tracing (the
4301 case of debugging is similar) in proofs works via
4303 using [[trace_simp = true]]
4305 Tracing is then active for all invocations of the simplifier in
4306 subsequent goal refinement steps. Tracing may also still be enabled or
4307 disabled via the ProofGeneral settings menu.
4309 * Separate commands 'hide_class', 'hide_type', 'hide_const',
4310 'hide_fact' replace the former 'hide' KIND command. Minor
4313 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
4314 more efficient than combinations with -q1 or -q2.
4319 * Proofterms record type-class reasoning explicitly, using the
4320 "unconstrain" operation internally. This eliminates all sort
4321 constraints from a theorem and proof, introducing explicit
4322 OFCLASS-premises. On the proof term level, this operation is
4323 automatically applied at theorem boundaries, such that closed proofs
4324 are always free of sort constraints. INCOMPATIBILITY for tools that
4325 inspect proof terms.
4327 * Local theory specifications may depend on extra type variables that
4328 are not present in the result type -- arguments TYPE('a) :: 'a itself
4329 are added internally. For example:
4331 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
4333 * Predicates of locales introduced by classes carry a mandatory
4334 "class" prefix. INCOMPATIBILITY.
4336 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
4338 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
4341 * Command 'code_reflect' allows to incorporate generated ML code into
4342 runtime environment; replaces immature code_datatype antiquotation.
4345 * Code generator: simple concept for abstract datatypes obeying
4348 * Code generator: details of internal data cache have no impact on the
4349 user space functionality any longer.
4351 * Methods "unfold_locales" and "intro_locales" ignore non-locale
4352 subgoals. This is more appropriate for interpretations with 'where'.
4355 * Command 'example_proof' opens an empty proof body. This allows to
4356 experiment with Isar, without producing any persistent result.
4358 * Commands 'type_notation' and 'no_type_notation' declare type syntax
4359 within a local theory context, with explicit checking of the
4360 constructors involved (in contrast to the raw 'syntax' versions).
4362 * Commands 'types' and 'typedecl' now work within a local theory
4363 context -- without introducing dependencies on parameters or
4364 assumptions, which is not possible in Isabelle/Pure.
4366 * Command 'defaultsort' has been renamed to 'default_sort', it works
4367 within a local theory context. Minor INCOMPATIBILITY.
4372 * Command 'typedef' now works within a local theory context -- without
4373 introducing dependencies on parameters or assumptions, which is not
4374 possible in Isabelle/Pure/HOL. Note that the logical environment may
4375 contain multiple interpretations of local typedefs (with different
4376 non-emptiness proofs), even in a global theory context.
4378 * New package for quotient types. Commands 'quotient_type' and
4379 'quotient_definition' may be used for defining types and constants by
4380 quotient constructions. An example is the type of integers created by
4381 quotienting pairs of natural numbers:
4384 intrel :: "(nat * nat) => (nat * nat) => bool"
4386 "intrel (x, y) (u, v) = (x + v = u + y)"
4388 quotient_type int = "nat * nat" / intrel
4389 by (auto simp add: equivp_def expand_fun_eq)
4392 "0::int" is "(0::nat, 0::nat)"
4394 The method "lifting" can be used to lift of theorems from the
4395 underlying "raw" type to the quotient type. The example
4396 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
4397 construction and provides a reasoning infrastructure for finite sets.
4399 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
4400 clash with new theory Quotient in Main HOL.
4402 * Moved the SMT binding into the main HOL session, eliminating
4403 separate HOL-SMT session.
4405 * List membership infix mem operation is only an input abbreviation.
4408 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
4409 for future developements; former Library/Word.thy is still present in
4410 the AFP entry RSAPPS.
4412 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
4413 longer shadowed. INCOMPATIBILITY.
4415 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
4418 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
4421 * Dropped normalizing_semiring etc; use the facts in semiring classes
4422 instead. INCOMPATIBILITY.
4424 * Dropped several real-specific versions of lemmas about floor and
4425 ceiling; use the generic lemmas from theory "Archimedean_Field"
4426 instead. INCOMPATIBILITY.
4428 floor_number_of_eq ~> floor_number_of
4429 le_floor_eq_number_of ~> number_of_le_floor
4430 le_floor_eq_zero ~> zero_le_floor
4431 le_floor_eq_one ~> one_le_floor
4432 floor_less_eq_number_of ~> floor_less_number_of
4433 floor_less_eq_zero ~> floor_less_zero
4434 floor_less_eq_one ~> floor_less_one
4435 less_floor_eq_number_of ~> number_of_less_floor
4436 less_floor_eq_zero ~> zero_less_floor
4437 less_floor_eq_one ~> one_less_floor
4438 floor_le_eq_number_of ~> floor_le_number_of
4439 floor_le_eq_zero ~> floor_le_zero
4440 floor_le_eq_one ~> floor_le_one
4441 floor_subtract_number_of ~> floor_diff_number_of
4442 floor_subtract_one ~> floor_diff_one
4443 ceiling_number_of_eq ~> ceiling_number_of
4444 ceiling_le_eq_number_of ~> ceiling_le_number_of
4445 ceiling_le_zero_eq ~> ceiling_le_zero
4446 ceiling_le_eq_one ~> ceiling_le_one
4447 less_ceiling_eq_number_of ~> number_of_less_ceiling
4448 less_ceiling_eq_zero ~> zero_less_ceiling
4449 less_ceiling_eq_one ~> one_less_ceiling
4450 ceiling_less_eq_number_of ~> ceiling_less_number_of
4451 ceiling_less_eq_zero ~> ceiling_less_zero
4452 ceiling_less_eq_one ~> ceiling_less_one
4453 le_ceiling_eq_number_of ~> number_of_le_ceiling
4454 le_ceiling_eq_zero ~> zero_le_ceiling
4455 le_ceiling_eq_one ~> one_le_ceiling
4456 ceiling_subtract_number_of ~> ceiling_diff_number_of
4457 ceiling_subtract_one ~> ceiling_diff_one
4459 * Theory "Finite_Set": various folding_XXX locales facilitate the
4460 application of the various fold combinators on finite sets.
4462 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
4463 provides abstract red-black tree type which is backed by "RBT_Impl" as
4464 implementation. INCOMPATIBILTY.
4466 * Theory Library/Coinductive_List has been removed -- superseded by
4467 AFP/thys/Coinductive.
4469 * Theory PReal, including the type "preal" and related operations, has
4470 been removed. INCOMPATIBILITY.
4472 * Real: new development using Cauchy Sequences.
4474 * Split off theory "Big_Operators" containing setsum, setprod,
4475 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
4477 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
4478 "Int" etc. INCOMPATIBILITY.
4480 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
4482 * New set of rules "ac_simps" provides combined assoc / commute
4483 rewrites for all interpretations of the appropriate generic locales.
4485 * Renamed theory "OrderedGroup" to "Groups" and split theory
4486 "Ring_and_Field" into theories "Rings" and "Fields"; for more
4487 appropriate and more consistent names suitable for name prefixes
4488 within the HOL theories. INCOMPATIBILITY.
4490 * Some generic constants have been put to appropriate theories:
4491 - less_eq, less: Orderings
4492 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
4493 - inverse, divide: Rings
4496 * More consistent naming of type classes involving orderings (and
4499 lower_semilattice ~> semilattice_inf
4500 upper_semilattice ~> semilattice_sup
4502 dense_linear_order ~> dense_linorder
4504 pordered_ab_group_add ~> ordered_ab_group_add
4505 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
4506 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
4507 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
4508 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
4509 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
4510 pordered_cancel_semiring ~> ordered_cancel_semiring
4511 pordered_comm_monoid_add ~> ordered_comm_monoid_add
4512 pordered_comm_ring ~> ordered_comm_ring
4513 pordered_comm_semiring ~> ordered_comm_semiring
4514 pordered_ring ~> ordered_ring
4515 pordered_ring_abs ~> ordered_ring_abs
4516 pordered_semiring ~> ordered_semiring
4518 ordered_ab_group_add ~> linordered_ab_group_add
4519 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
4520 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
4521 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
4522 ordered_field ~> linordered_field
4523 ordered_field_no_lb ~> linordered_field_no_lb
4524 ordered_field_no_ub ~> linordered_field_no_ub
4525 ordered_field_dense_linear_order ~> dense_linordered_field
4526 ordered_idom ~> linordered_idom
4527 ordered_ring ~> linordered_ring
4528 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
4529 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
4530 ordered_ring_strict ~> linordered_ring_strict
4531 ordered_semidom ~> linordered_semidom
4532 ordered_semiring ~> linordered_semiring
4533 ordered_semiring_1 ~> linordered_semiring_1
4534 ordered_semiring_1_strict ~> linordered_semiring_1_strict
4535 ordered_semiring_strict ~> linordered_semiring_strict
4537 The following slightly odd type classes have been moved to a
4538 separate theory Library/Lattice_Algebras:
4540 lordered_ab_group_add ~> lattice_ab_group_add
4541 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
4542 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
4543 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
4544 lordered_ring ~> lattice_ring
4548 * Refined field classes:
4549 - classes division_ring_inverse_zero, field_inverse_zero,
4550 linordered_field_inverse_zero include rule inverse 0 = 0 --
4551 subsumes former division_by_zero class;
4552 - numerous lemmas have been ported from field to division_ring.
4555 * Refined algebra theorem collections:
4556 - dropped theorem group group_simps, use algebra_simps instead;
4557 - dropped theorem group ring_simps, use field_simps instead;
4558 - proper theorem collection field_simps subsumes former theorem
4559 groups field_eq_simps and field_simps;
4560 - dropped lemma eq_minus_self_iff which is a duplicate for
4564 * Theory Finite_Set and List: some lemmas have been generalized from
4567 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
4568 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
4569 inter_Inter_fold_inter ~> inf_Inf_fold_inf
4570 union_Union_fold_union ~> sup_Sup_fold_sup
4571 Inter_fold_inter ~> Inf_fold_inf
4572 Union_fold_union ~> Sup_fold_sup
4573 inter_INTER_fold_inter ~> inf_INFI_fold_inf
4574 union_UNION_fold_union ~> sup_SUPR_fold_sup
4575 INTER_fold_inter ~> INFI_fold_inf
4576 UNION_fold_union ~> SUPR_fold_sup
4578 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
4579 replaced by the more convenient lemmas Inf_empty and Sup_empty.
4580 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
4581 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
4582 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
4583 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
4585 * Reorganized theory Multiset: swapped notation of pointwise and
4588 - pointwise ordering is instance of class order with standard syntax
4590 - multiset ordering has syntax <=# and <#; partial order properties
4591 are provided by means of interpretation with prefix
4593 - less duplication, less historical organization of sections,
4594 conversion from associations lists to multisets, rudimentary code
4596 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
4601 multiset_eq_conv_count_eq ~> multiset_ext_iff
4602 multi_count_ext ~> multiset_ext
4603 diff_union_inverse2 ~> diff_union_cancelR
4607 * Theory Permutation: replaced local "remove" by List.remove1.
4609 * Code generation: ML and OCaml code is decorated with signatures.
4611 * Theory List: added transpose.
4613 * Library/Nat_Bijection.thy is a collection of bijective functions
4614 between nat and other types, which supersedes the older libraries
4615 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
4618 Nat_Int_Bij.nat2_to_nat ~> prod_encode
4619 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
4620 Nat_Int_Bij.int_to_nat_bij ~> int_encode
4621 Nat_Int_Bij.nat_to_int_bij ~> int_decode
4622 Countable.pair_encode ~> prod_encode
4623 NatIso.prod2nat ~> prod_encode
4624 NatIso.nat2prod ~> prod_decode
4625 NatIso.sum2nat ~> sum_encode
4626 NatIso.nat2sum ~> sum_decode
4627 NatIso.list2nat ~> list_encode
4628 NatIso.nat2list ~> list_decode
4629 NatIso.set2nat ~> set_encode
4630 NatIso.nat2set ~> set_decode
4633 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
4634 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
4635 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
4636 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
4637 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
4638 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
4639 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
4640 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
4641 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
4642 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
4643 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
4644 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
4645 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
4648 - Renamed ATP commands:
4649 atp_info ~> sledgehammer running_atps
4650 atp_kill ~> sledgehammer kill_atps
4651 atp_messages ~> sledgehammer messages
4652 atp_minimize ~> sledgehammer minimize
4653 print_atps ~> sledgehammer available_atps
4655 - Added user's manual ("isabelle doc sledgehammer").
4656 - Added option syntax and "sledgehammer_params" to customize
4657 Sledgehammer's behavior. See the manual for details.
4658 - Modified the Isar proof reconstruction code so that it produces
4659 direct proofs rather than proofs by contradiction. (This feature
4660 is still experimental.)
4661 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4663 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4666 - Added and implemented "binary_ints" and "bits" options.
4667 - Added "std" option and implemented support for nonstandard models.
4668 - Added and implemented "finitize" option to improve the precision
4669 of infinite datatypes based on a monotonicity analysis.
4670 - Added support for quotient types.
4671 - Added support for "specification" and "ax_specification"
4673 - Added support for local definitions (for "function" and
4674 "termination" proofs).
4675 - Added support for term postprocessors.
4676 - Optimized "Multiset.multiset" and "FinFun.finfun".
4677 - Improved efficiency of "destroy_constrs" optimization.
4678 - Fixed soundness bugs related to "destroy_constrs" optimization and
4680 - Fixed soundness bug related to higher-order constructors.
4681 - Fixed soundness bug when "full_descrs" is enabled.
4682 - Improved precision of set constructs.
4683 - Added "atoms" option.
4684 - Added cache to speed up repeated Kodkod invocations on the same
4686 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4687 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4688 "SAT4J_Light". INCOMPATIBILITY.
4689 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4690 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4691 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4693 * Method "induct" now takes instantiations of the form t, where t is not
4694 a variable, as a shorthand for "x == t", where x is a fresh variable.
4695 If this is not intended, t has to be enclosed in parentheses.
4696 By default, the equalities generated by definitional instantiations
4697 are pre-simplified, which may cause parameters of inductive cases
4698 to disappear, or may even delete some of the inductive cases.
4699 Use "induct (no_simp)" instead of "induct" to restore the old
4700 behaviour. The (no_simp) option is also understood by the "cases"
4701 and "nominal_induct" methods, which now perform pre-simplification, too.
4707 * Variable names in lemmas generated by the domain package have
4708 changed; the naming scheme is now consistent with the HOL datatype
4709 package. Some proof scripts may be affected, INCOMPATIBILITY.
4711 * The domain package no longer defines the function "foo_copy" for
4712 recursive domain "foo". The reach lemma is now stated directly in
4713 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4714 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4716 * Most definedness lemmas generated by the domain package (previously
4717 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4718 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4719 Proofs that used definedness lemmas as intro rules may break,
4720 potential INCOMPATIBILITY.
4722 * Induction and casedist rules generated by the domain package now
4723 declare proper case_names (one called "bottom", and one named for each
4724 constructor). INCOMPATIBILITY.
4726 * For mutually-recursive domains, separate "reach" and "take_lemma"
4727 rules are generated for each domain, INCOMPATIBILITY.
4729 foo_bar.reach ~> foo.reach bar.reach
4730 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4732 * Some lemmas generated by the domain package have been renamed for
4733 consistency with the datatype package, INCOMPATIBILITY.
4735 foo.ind ~> foo.induct
4736 foo.finite_ind ~> foo.finite_induct
4737 foo.coind ~> foo.coinduct
4738 foo.casedist ~> foo.exhaust
4739 foo.exhaust ~> foo.nchotomy
4741 * For consistency with other definition packages, the fixrec package
4742 now generates qualified theorem names, INCOMPATIBILITY.
4744 foo_simps ~> foo.simps
4745 foo_unfold ~> foo.unfold
4746 foo_induct ~> foo.induct
4748 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4749 method and internal fixrec proofs now use the default simpset instead.
4752 * The "contlub" predicate has been removed. Proof scripts should use
4753 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4755 * The "admw" predicate has been removed, INCOMPATIBILITY.
4757 * The constants cpair, cfst, and csnd have been removed in favor of
4758 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4763 * Antiquotations for basic formal entities:
4765 @{class NAME} -- type class
4766 @{class_syntax NAME} -- syntax representation of the above
4768 @{type_name NAME} -- logical type
4769 @{type_abbrev NAME} -- type abbreviation
4770 @{nonterminal NAME} -- type of concrete syntactic category
4771 @{type_syntax NAME} -- syntax representation of any of the above
4773 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4774 @{const_abbrev NAME} -- abbreviated constant
4775 @{const_syntax NAME} -- syntax representation of any of the above
4777 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4778 syntax constant (cf. 'syntax' command).
4780 * Antiquotation @{make_string} inlines a function to print arbitrary
4781 values similar to the ML toplevel. The result is compiler dependent
4782 and may fall back on "?" in certain situations.
4784 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4785 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4786 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4787 not work with the asynchronous Isar document model.
4789 * Configuration options now admit dynamic default values, depending on
4790 the context or even global references.
4792 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4793 uses an efficient external library if available (for Poly/ML).
4795 * Renamed some important ML structures, while keeping the old names
4796 for some time as aliases within the structure Legacy:
4798 OuterKeyword ~> Keyword
4801 OuterSyntax ~> Outer_Syntax
4802 PrintMode ~> Print_Mode
4803 SpecParse ~> Parse_Spec
4806 ThyOutput ~> Thy_Output
4807 TypeInfer ~> Type_Infer
4809 Note that "open Legacy" simplifies porting of sources, but forgetting
4810 to remove it again will complicate porting again in the future.
4812 * Most operations that refer to a global context are named
4813 accordingly, e.g. Simplifier.global_context or
4814 ProofContext.init_global. There are some situations where a global
4815 context actually works, but under normal circumstances one needs to
4816 pass the proper local context through the code!
4818 * Discontinued old TheoryDataFun with its copy/init operation -- data
4819 needs to be pure. Functor Theory_Data_PP retains the traditional
4820 Pretty.pp argument to merge, which is absent in the standard
4821 Theory_Data version.
4823 * Sorts.certify_sort and derived "cert" operations for types and terms
4824 no longer minimize sorts. Thus certification at the boundary of the
4825 inference kernel becomes invariant under addition of class relations,
4826 which is an important monotonicity principle. Sorts are now minimized
4827 in the syntax layer only, at the boundary between the end-user and the
4828 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4829 explicitly in rare situations.
4831 * Renamed old-style Drule.standard to Drule.export_without_context, to
4832 emphasize that this is in no way a standard operation.
4835 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4836 usual for resolution. Rare INCOMPATIBILITY.
4838 * Renamed varify/unvarify operations to varify_global/unvarify_global
4839 to emphasize that these only work in a global situation (which is
4842 * Curried take and drop in library.ML; negative length is interpreted
4843 as infinity (as in chop). Subtle INCOMPATIBILITY.
4845 * Proof terms: type substitutions on proof constants now use canonical
4846 order of type variables. INCOMPATIBILITY for tools working with proof
4849 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4850 may no longer carry premises. User-level specifications are
4851 transformed accordingly by Thm.add_axiom/add_def.
4856 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4857 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4858 proof terms are enabled unconditionally in the new HOL-Proofs image.
4860 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4861 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4864 * Old lib/scripts/polyml-platform is superseded by the
4865 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4866 variant, even on a 64 bit machine. The following example setting
4867 prefers 64 bit if available:
4869 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4871 * The preliminary Isabelle/jEdit application demonstrates the emerging
4872 Isabelle/Scala layer for advanced prover interaction and integration.
4873 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4876 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4877 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4878 similar to the default assignment of the document preparation system
4879 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4880 provides some operations for direct access to the font without asking
4881 the user for manual installation.
4885 New in Isabelle2009-1 (December 2009)
4886 -------------------------------------
4890 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4891 one backslash should be used, even in ML sources.
4896 * Locale interpretation propagates mixins along the locale hierarchy.
4897 The currently only available mixins are the equations used to map
4898 local definitions to terms of the target domain of an interpretation.
4900 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4901 loc" to print all interpretations of locale "loc" in the theory.
4902 Interpretations in proofs are not shown.
4904 * Thoroughly revised locales tutorial. New section on conditional
4907 * On instantiation of classes, remaining undefined class parameters
4908 are formally declared. INCOMPATIBILITY.
4911 *** Document preparation ***
4913 * New generalized style concept for printing terms: @{foo (style) ...}
4914 instead of @{foo_style style ...} (old form is still retained for
4915 backward compatibility). Styles can be also applied for
4916 antiquotations prop, term_type and typeof.
4921 * New proof method "smt" for a combination of first-order logic with
4922 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4923 fixed-size bitvectors; there is also basic support for higher-order
4924 features (esp. lambda abstractions). It is an incomplete decision
4925 procedure based on external SMT solvers using the oracle mechanism;
4926 for the SMT solver Z3, this method is proof-producing. Certificates
4927 are provided to avoid calling the external solvers solely for
4928 re-checking proofs. Due to a remote SMT service there is no need for
4929 installing SMT solvers locally. See src/HOL/SMT.
4931 * New commands to load and prove verification conditions generated by
4932 the Boogie program verifier or derived systems (e.g. the Verifying C
4933 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4935 * New counterexample generator tool 'nitpick' based on the Kodkod
4936 relational model finder. See src/HOL/Tools/Nitpick and
4937 src/HOL/Nitpick_Examples.
4939 * New commands 'code_pred' and 'values' to invoke the predicate
4940 compiler and to enumerate values of inductive predicates.
4942 * A tabled implementation of the reflexive transitive closure.
4944 * New implementation of quickcheck uses generic code generator;
4945 default generators are provided for all suitable HOL types, records
4946 and datatypes. Old quickcheck can be re-activated importing theory
4947 Library/SML_Quickcheck.
4949 * New testing tool Mirabelle for automated proof tools. Applies
4950 several tools and tactics like sledgehammer, metis, or quickcheck, to
4951 every proof step in a theory. To be used in batch mode via the
4952 "mirabelle" utility.
4954 * New proof method "sos" (sum of squares) for nonlinear real
4955 arithmetic (originally due to John Harison). It requires theory
4956 Library/Sum_Of_Squares. It is not a complete decision procedure but
4957 works well in practice on quantifier-free real arithmetic with +, -,
4958 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4959 inequalities between polynomials. It makes use of external
4960 semidefinite programming solvers. Method "sos" generates a
4961 certificate that can be pasted into the proof thus avoiding the need
4962 to call an external tool every time the proof is checked. See
4963 src/HOL/Library/Sum_Of_Squares.
4965 * New method "linarith" invokes existing linear arithmetic decision
4968 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4970 * New Sledgehammer option "Full Types" in Proof General settings menu.
4971 Causes full type information to be output to the ATPs. This slows
4972 ATPs down considerably but eliminates a source of unsound "proofs"
4975 * New method "metisFT": A version of metis that uses full type
4976 information in order to avoid failures of proof reconstruction.
4978 * New evaluator "approximate" approximates an real valued term using
4979 the same method as the approximation method.
4981 * Method "approximate" now supports arithmetic expressions as
4982 boundaries of intervals and implements interval splitting and Taylor
4985 * ML antiquotation @{code_datatype} inserts definition of a datatype
4986 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4988 * New theory SupInf of the supremum and infimum operators for sets of
4991 * New theory Probability, which contains a development of measure
4992 theory, eventually leading to Lebesgue integration and probability.
4994 * Extended Multivariate Analysis to include derivation and Brouwer's
4997 * Reorganization of number theory, INCOMPATIBILITY:
4998 - new number theory development for nat and int, in theories Divides
4999 and GCD as well as in new session Number_Theory
5000 - some constants and facts now suffixed with _nat and _int
5002 - former session NumberTheory now named Old_Number_Theory, including
5003 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
5004 - moved theory Pocklington from src/HOL/Library to
5005 src/HOL/Old_Number_Theory
5007 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
5008 lcm of finite and infinite sets. It is shown that they form a complete
5011 * Class semiring_div requires superclass no_zero_divisors and proof of
5012 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
5013 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
5014 generalized to class semiring_div, subsuming former theorems
5015 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
5016 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
5019 * Refinements to lattice classes and sets:
5020 - less default intro/elim rules in locale variant, more default
5021 intro/elim rules in class variant: more uniformity
5022 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
5024 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
5026 - renamed ACI to inf_sup_aci
5027 - new class "boolean_algebra"
5028 - class "complete_lattice" moved to separate theory
5029 "Complete_Lattice"; corresponding constants (and abbreviations)
5030 renamed and with authentic syntax:
5031 Set.Inf ~> Complete_Lattice.Inf
5032 Set.Sup ~> Complete_Lattice.Sup
5033 Set.INFI ~> Complete_Lattice.INFI
5034 Set.SUPR ~> Complete_Lattice.SUPR
5035 Set.Inter ~> Complete_Lattice.Inter
5036 Set.Union ~> Complete_Lattice.Union
5037 Set.INTER ~> Complete_Lattice.INTER
5038 Set.UNION ~> Complete_Lattice.UNION
5039 - authentic syntax for
5042 - mere abbreviations:
5045 Set.inter (for inf, formerly Set.Int)
5046 Set.union (for sup, formerly Set.Un)
5047 Complete_Lattice.Inter (for Inf)
5048 Complete_Lattice.Union (for Sup)
5049 Complete_Lattice.INTER (for INFI)
5050 Complete_Lattice.UNION (for SUPR)
5051 - object-logic definitions as far as appropriate
5053 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
5054 Un_subset_iff are explicitly deleted as default simp rules; then also
5055 their lattice counterparts le_inf_iff and le_sup_iff have to be
5056 deleted to achieve the desired effect.
5058 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
5059 rules by default any longer; the same applies to min_max.inf_absorb1
5060 etc. INCOMPATIBILITY.
5062 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
5063 pred_set_conv by default. INCOMPATIBILITY.
5065 * Power operations on relations and functions are now one dedicated
5066 constant "compow" with infix syntax "^^". Power operation on
5067 multiplicative monoids retains syntax "^" and is now defined generic
5068 in class power. INCOMPATIBILITY.
5070 * Relation composition "R O S" now has a more standard argument order:
5071 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
5072 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
5073 break, since the O_assoc rule was not rewritten like this. Fix using
5074 O_assoc[symmetric]. The same applies to the curried version "R OO S".
5076 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
5077 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
5080 * Most rules produced by inductive and datatype package have mandatory
5081 prefixes. INCOMPATIBILITY.
5083 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
5084 the attribute of the same name. Each of the theorems in the list
5085 DERIV_intros assumes composition with an additional function and
5086 matches a variable to the derivative, which has to be solved by the
5087 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
5088 of most elementary terms. Former Maclauren.DERIV_tac and
5089 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
5092 * Code generator attributes follow the usual underscore convention:
5093 code_unfold replaces code unfold
5094 code_post replaces code post
5099 sizechange -> size_change
5100 induct_scheme -> induction_schema
5103 * Discontinued abbreviation "arbitrary" of constant "undefined".
5104 INCOMPATIBILITY, use "undefined" directly.
5107 Suc_eq_add_numeral_1 -> Suc_eq_plus1
5108 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
5109 Suc_plus1 -> Suc_eq_plus1
5110 *anti_sym -> *antisym*
5111 vector_less_eq_def -> vector_le_def
5114 * Added theorem List.map_map as [simp]. Removed List.map_compose.
5117 * Removed predicate "M hassize n" (<--> card M = n & finite M).
5123 * Theory Representable defines a class "rep" of domains that are
5124 representable (via an ep-pair) in the universal domain type "udom".
5125 Instances are provided for all type constructors defined in HOLCF.
5127 * The 'new_domain' command is a purely definitional version of the
5128 domain package, for representable domains. Syntax is identical to the
5129 old domain package. The 'new_domain' package also supports indirect
5130 recursion using previously-defined type constructors. See
5131 src/HOLCF/ex/New_Domain.thy for examples.
5133 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
5134 on the left-hand side of an equation, and then performs
5135 simplification. Rewriting is done using rules declared with the
5136 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
5137 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
5139 * The pattern-match compiler in 'fixrec' can now handle constructors
5140 with HOL function types. Pattern-match combinators for the Pair
5141 constructor are pre-configured.
5143 * The 'fixrec' package now produces better fixed-point induction rules
5144 for mutually-recursive definitions: Induction rules have conclusions
5145 of the form "P foo bar" instead of "P <foo, bar>".
5147 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
5148 been renamed to "below". The name "below" now replaces "less" in many
5149 theorem names. (Legacy theorem names using "less" are still supported
5152 * The 'fixrec' package now supports "bottom patterns". Bottom
5153 patterns can be used to generate strictness rules, or to make
5154 functions more strict (much like the bang-patterns supported by the
5155 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
5161 * Support for Poly/ML 5.3.0, with improved reporting of compiler
5162 errors and run-time exceptions, including detailed source positions.
5164 * Structure Name_Space (formerly NameSpace) now manages uniquely
5165 identified entries, with some additional information such as source
5166 position, logical grouping etc.
5168 * Theory and context data is now introduced by the simplified and
5169 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
5170 to be pure, but the old TheoryDataFun for mutable data (with explicit
5171 copy operation) is still available for some time.
5173 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
5174 provides a high-level programming interface to synchronized state
5175 variables with atomic update. This works via pure function
5176 application within a critical section -- its runtime should be as
5177 short as possible; beware of deadlocks if critical code is nested,
5178 either directly or indirectly via other synchronized variables!
5180 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
5181 wraps raw ML references, explicitly indicating their non-thread-safe
5182 behaviour. The Isar toplevel keeps this structure open, to
5183 accommodate Proof General as well as quick and dirty interactive
5184 experiments with references.
5186 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
5187 parallel tactical reasoning.
5189 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
5190 are similar to SUBPROOF, but are slightly more flexible: only the
5191 specified parts of the subgoal are imported into the context, and the
5192 body tactic may introduce new subgoals and schematic variables.
5194 * Old tactical METAHYPS, which does not observe the proof context, has
5195 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
5196 or Subgoal.FOCUS etc.
5198 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
5199 functors have their own ML name space there is no point to mark them
5200 separately.) Minor INCOMPATIBILITY.
5202 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
5204 * Renamed several structures FooBar to Foo_Bar. Occasional,
5207 * Operations of structure Skip_Proof no longer require quick_and_dirty
5208 mode, which avoids critical setmp.
5210 * Eliminated old Attrib.add_attributes, Method.add_methods and related
5211 combinators for "args". INCOMPATIBILITY, need to use simplified
5212 Attrib/Method.setup introduced in Isabelle2009.
5214 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
5215 back on global_simpset_of, global_claset_of, global_clasimpset_of as
5216 last resort. INCOMPATIBILITY.
5218 * Display.pretty_thm now requires a proper context (cf. former
5219 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
5220 or even Display.pretty_thm_without_context as last resort.
5223 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
5224 Syntax.pretty_typ/term directly, preferably with proper context
5225 instead of global theory.
5230 * Further fine tuning of parallel proof checking, scales up to 8 cores
5231 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
5234 * Support for additional "Isabelle components" via etc/components, see
5235 also the system manual.
5237 * The isabelle makeall tool now operates on all components with
5238 IsaMakefile, not just hardwired "logics".
5240 * Removed "compress" option from isabelle-process and isabelle usedir;
5241 this is always enabled.
5243 * Discontinued support for Poly/ML 4.x versions.
5245 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
5246 on a given logic image. This requires the lighttpd webserver and is
5247 currently supported on Linux only.
5251 New in Isabelle2009 (April 2009)
5252 --------------------------------
5256 * Simplified main Isabelle executables, with less surprises on
5257 case-insensitive file-systems (such as Mac OS).
5259 - The main Isabelle tool wrapper is now called "isabelle" instead of
5262 - The former "isabelle" alias for "isabelle-process" has been
5263 removed (should rarely occur to regular users).
5265 - The former "isabelle-interface" and its alias "Isabelle" have been
5266 removed (interfaces are now regular Isabelle tools).
5268 Within scripts and make files, the Isabelle environment variables
5269 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
5270 respectively. (The latter are still available as legacy feature.)
5272 The old isabelle-interface wrapper could react in confusing ways if
5273 the interface was uninstalled or changed otherwise. Individual
5274 interface tool configuration is now more explicit, see also the
5275 Isabelle system manual. In particular, Proof General is now available
5276 via "isabelle emacs".
5278 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
5279 purge installed copies of Isabelle executables and re-run "isabelle
5280 install -p ...", or use symlinks.
5282 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
5283 old ~/isabelle, which was slightly non-standard and apt to cause
5284 surprises on case-insensitive file-systems (such as Mac OS).
5286 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
5287 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
5288 care is required when using older releases of Isabelle. Note that
5289 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
5290 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
5292 * Proofs of fully specified statements are run in parallel on
5293 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
5294 a regular 4-core machine, if the initial heap space is made reasonably
5295 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
5297 * The main reference manuals ("isar-ref", "implementation", and
5298 "system") have been updated and extended. Formally checked references
5299 as hyperlinks are now available uniformly.
5304 * Complete re-implementation of locales. INCOMPATIBILITY in several
5305 respects. The most important changes are listed below. See the
5306 Tutorial on Locales ("locales" manual) for details.
5308 - In locale expressions, instantiation replaces renaming. Parameters
5309 must be declared in a for clause. To aid compatibility with previous
5310 parameter inheritance, in locale declarations, parameters that are not
5311 'touched' (instantiation position "_" or omitted) are implicitly added
5312 with their syntax at the beginning of the for clause.
5314 - Syntax from abbreviations and definitions in locales is available in
5315 locale expressions and context elements. The latter is particularly
5316 useful in locale declarations.
5318 - More flexible mechanisms to qualify names generated by locale
5319 expressions. Qualifiers (prefixes) may be specified in locale
5320 expressions, and can be marked as mandatory (syntax: "name!:") or
5321 optional (syntax "name?:"). The default depends for plain "name:"
5322 depends on the situation where a locale expression is used: in
5323 commands 'locale' and 'sublocale' prefixes are optional, in
5324 'interpretation' and 'interpret' prefixes are mandatory. The old
5325 implicit qualifiers derived from the parameter names of a locale are
5326 no longer generated.
5328 - Command "sublocale l < e" replaces "interpretation l < e". The
5329 instantiation clause in "interpretation" and "interpret" (square
5330 brackets) is no longer available. Use locale expressions.
5332 - When converting proof scripts, mandatory qualifiers in
5333 'interpretation' and 'interpret' should be retained by default, even
5334 if this is an INCOMPATIBILITY compared to former behavior. In the
5335 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
5336 in locale expressions range over a single locale instance only.
5338 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
5339 In existing theorem specifications replace the includes element by the
5340 respective context elements of the included locale, omitting those
5341 that are already present in the theorem specification. Multiple
5342 assume elements of a locale should be replaced by a single one
5343 involving the locale predicate. In the proof body, declarations (most
5344 notably theorems) may be regained by interpreting the respective
5345 locales in the proof context as required (command "interpret").
5347 If using "includes" in replacement of a target solely because the
5348 parameter types in the theorem are not as general as in the target,
5349 consider declaring a new locale with additional type constraints on
5350 the parameters (context element "constrains").
5352 - Discontinued "locale (open)". INCOMPATIBILITY.
5354 - Locale interpretation commands no longer attempt to simplify goal.
5355 INCOMPATIBILITY: in rare situations the generated goal differs. Use
5356 methods intro_locales and unfold_locales to clarify.
5358 - Locale interpretation commands no longer accept interpretation
5359 attributes. INCOMPATIBILITY.
5361 * Class declaration: so-called "base sort" must not be given in import
5362 list any longer, but is inferred from the specification. Particularly
5369 class foo = type + ...
5371 * Class target: global versions of theorems stemming do not carry a
5372 parameter prefix any longer. INCOMPATIBILITY.
5374 * Class 'instance' command no longer accepts attached definitions.
5375 INCOMPATIBILITY, use proper 'instantiation' target instead.
5377 * Recovered hiding of consts, which was accidentally broken in
5378 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
5379 makes c inaccessible; consider using ``hide (open) const c'' instead.
5381 * Slightly more coherent Pure syntax, with updated documentation in
5382 isar-ref manual. Removed locales meta_term_syntax and
5383 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
5384 INCOMPATIBILITY in rare situations. Note that &&& should not be used
5385 directly in regular applications.
5387 * There is a new syntactic category "float_const" for signed decimal
5388 fractions (e.g. 123.45 or -123.45).
5390 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
5391 interface with 'setup' command instead.
5393 * Command 'local_setup' is similar to 'setup', but operates on a local
5396 * The 'axiomatization' command now only works within a global theory
5397 context. INCOMPATIBILITY.
5399 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
5400 hypotheses. Sorts required in the course of reasoning need to be
5401 covered by the constraints in the initial statement, completed by the
5402 type instance information of the background theory. Non-trivial sort
5403 hypotheses, which rarely occur in practice, may be specified via
5404 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
5406 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
5408 The result contains an implicit sort hypotheses as before --
5409 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
5412 * Generalized Isar history, with support for linear undo, direct state
5415 * Changed defaults for unify configuration options:
5417 unify_trace_bound = 50 (formerly 25)
5418 unify_search_bound = 60 (formerly 30)
5420 * Different bookkeeping for code equations (INCOMPATIBILITY):
5422 a) On theory merge, the last set of code equations for a particular
5423 constant is taken (in accordance with the policy applied by other
5424 parts of the code generator framework).
5426 b) Code equations stemming from explicit declarations (e.g. code
5427 attribute) gain priority over default code equations stemming
5428 from definition, primrec, fun etc.
5430 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
5432 * Unified theorem tables for both code generators. Thus [code
5433 func] has disappeared and only [code] remains. INCOMPATIBILITY.
5435 * Command 'find_consts' searches for constants based on type and name
5438 find_consts "_ => bool"
5440 By default, matching is against subtypes, but it may be restricted to
5441 the whole type. Searching by name is possible. Multiple queries are
5442 conjunctive and queries may be negated by prefixing them with a
5445 find_consts strict: "_ => bool" name: "Int" -"int => int"
5447 * New 'find_theorems' criterion "solves" matches theorems that
5448 directly solve the current goal (modulo higher-order unification).
5450 * Auto solve feature for main theorem statements: whenever a new goal
5451 is stated, "find_theorems solves" is called; any theorems that could
5452 solve the lemma directly are listed as part of the goal state.
5453 Cf. associated options in Proof General Isabelle settings menu,
5454 enabled by default, with reasonable timeout for pathological cases of
5455 higher-order unification.
5458 *** Document preparation ***
5460 * Antiquotation @{lemma} now imitates a regular terminal proof,
5461 demanding keyword 'by' and supporting the full method expression
5462 syntax just like the Isar command 'by'.
5467 * Integrated main parts of former image HOL-Complex with HOL. Entry
5468 points Main and Complex_Main remain as before.
5470 * Logic image HOL-Plain provides a minimal HOL with the most important
5471 tools available (inductive, datatype, primrec, ...). This facilitates
5472 experimentation and tool development. Note that user applications
5473 (and library theories) should never refer to anything below theory
5476 * Logic image HOL-Main stops at theory Main, and thus facilitates
5477 experimentation due to shorter build times.
5479 * Logic image HOL-NSA contains theories of nonstandard analysis which
5480 were previously part of former HOL-Complex. Entry point Hyperreal
5481 remains valid, but theories formerly using Complex_Main should now use
5482 new entry point Hypercomplex.
5484 * Generic ATP manager for Sledgehammer, based on ML threads instead of
5485 Posix processes. Avoids potentially expensive forking of the ML
5486 process. New thread-based implementation also works on non-Unix
5487 platforms (Cygwin). Provers are no longer hardwired, but defined
5488 within the theory via plain ML wrapper functions. Basic Sledgehammer
5489 commands are covered in the isar-ref manual.
5491 * Wrapper scripts for remote SystemOnTPTP service allows to use
5492 sledgehammer without local ATP installation (Vampire etc.). Other
5493 provers may be included via suitable ML wrappers, see also
5494 src/HOL/ATP_Linkup.thy.
5496 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
5499 * The metis method no longer fails because the theorem is too trivial
5500 (contains the empty clause).
5502 * The metis method now fails in the usual manner, rather than raising
5503 an exception, if it determines that it cannot prove the theorem.
5505 * Method "coherent" implements a prover for coherent logic (see also
5506 src/Tools/coherent.ML).
5508 * Constants "undefined" and "default" replace "arbitrary". Usually
5509 "undefined" is the right choice to replace "arbitrary", though
5510 logically there is no difference. INCOMPATIBILITY.
5512 * Command "value" now integrates different evaluation mechanisms. The
5513 result of the first successful evaluation mechanism is printed. In
5514 square brackets a particular named evaluation mechanisms may be
5515 specified (currently, [SML], [code] or [nbe]). See further
5516 src/HOL/ex/Eval_Examples.thy.
5518 * Normalization by evaluation now allows non-leftlinear equations.
5519 Declare with attribute [code nbe].
5521 * Methods "case_tac" and "induct_tac" now refer to the very same rules
5522 as the structured Isar versions "cases" and "induct", cf. the
5523 corresponding "cases" and "induct" attributes. Mutual induction rules
5524 are now presented as a list of individual projections
5525 (e.g. foo_bar.inducts for types foo and bar); the old format with
5526 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
5527 rare situations a different rule is selected --- notably nested tuple
5528 elimination instead of former prod.exhaust: use explicit (case_tac t
5529 rule: prod.exhaust) here.
5531 * Attributes "cases", "induct", "coinduct" support "del" option.
5533 * Removed fact "case_split_thm", which duplicates "case_split".
5535 * The option datatype has been moved to a new theory Option. Renamed
5536 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
5538 * New predicate "strict_mono" classifies strict functions on partial
5539 orders. With strict functions on linear orders, reasoning about
5540 (in)equalities is facilitated by theorems "strict_mono_eq",
5541 "strict_mono_less_eq" and "strict_mono_less".
5543 * Some set operations are now proper qualified constants with
5544 authentic syntax. INCOMPATIBILITY:
5555 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
5558 * Auxiliary class "itself" has disappeared -- classes without any
5559 parameter are treated as expected by the 'class' command.
5561 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
5563 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
5564 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
5566 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
5567 method "approximation". It proves formulas on real values by using
5568 interval arithmetic. In the formulas are also the transcendental
5569 functions sin, cos, tan, atan, ln, exp and the constant pi are
5570 allowed. For examples see
5571 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
5573 * Theory "Reflection" now resides in HOL/Library.
5575 * Entry point to Word library now simply named "Word".
5578 * Made source layout more coherent with logical distribution
5581 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
5582 src/HOL/Library/Code_Message.thy ~> src/HOL/
5583 src/HOL/Library/GCD.thy ~> src/HOL/
5584 src/HOL/Library/Order_Relation.thy ~> src/HOL/
5585 src/HOL/Library/Parity.thy ~> src/HOL/
5586 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
5587 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
5588 src/HOL/Real/Lubs.thy ~> src/HOL/
5589 src/HOL/Real/PReal.thy ~> src/HOL/
5590 src/HOL/Real/Rational.thy ~> src/HOL/
5591 src/HOL/Real/RComplete.thy ~> src/HOL/
5592 src/HOL/Real/RealDef.thy ~> src/HOL/
5593 src/HOL/Real/RealPow.thy ~> src/HOL/
5594 src/HOL/Real/Real.thy ~> src/HOL/
5595 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
5596 src/HOL/Complex/Complex.thy ~> src/HOL/
5597 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
5598 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
5599 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
5600 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
5601 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
5602 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
5603 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
5604 src/HOL/Hyperreal/Log.thy ~> src/HOL/
5605 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
5606 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
5607 src/HOL/Hyperreal/Series.thy ~> src/HOL/
5608 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
5609 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
5610 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
5611 src/HOL/Real/Float ~> src/HOL/Library/
5612 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
5613 src/HOL/Real/RealVector.thy ~> src/HOL/
5615 src/HOL/arith_data.ML ~> src/HOL/Tools
5616 src/HOL/hologic.ML ~> src/HOL/Tools
5617 src/HOL/simpdata.ML ~> src/HOL/Tools
5618 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
5619 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
5620 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
5621 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
5622 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
5623 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
5624 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
5626 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
5627 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
5628 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
5629 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
5630 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
5631 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
5633 * If methods "eval" and "evaluation" encounter a structured proof
5634 state with !!/==>, only the conclusion is evaluated to True (if
5635 possible), avoiding strange error messages.
5637 * Method "sizechange" automates termination proofs using (a
5638 modification of) the size-change principle. Requires SAT solver. See
5639 src/HOL/ex/Termination.thy for examples.
5641 * Simplifier: simproc for let expressions now unfolds if bound
5642 variable occurs at most once in let expression body. INCOMPATIBILITY.
5644 * Method "arith": Linear arithmetic now ignores all inequalities when
5645 fast_arith_neq_limit is exceeded, instead of giving up entirely.
5647 * New attribute "arith" for facts that should always be used
5648 automatically by arithmetic. It is intended to be used locally in
5651 assumes [arith]: "x > 0"
5653 Global usage is discouraged because of possible performance impact.
5655 * New classes "top" and "bot" with corresponding operations "top" and
5656 "bot" in theory Orderings; instantiation of class "complete_lattice"
5657 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5659 * Changed definition lemma "less_fun_def" in order to provide an
5660 instance for preorders on functions; use lemma "less_le" instead.
5663 * Theory Orderings: class "wellorder" moved here, with explicit
5664 induction rule "less_induct" as assumption. For instantiation of
5665 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5668 * Theory Orderings: added class "preorder" as superclass of "order".
5669 INCOMPATIBILITY: Instantiation proofs for order, linorder
5670 etc. slightly changed. Some theorems named order_class.* now named
5673 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5676 * Theory Finite_Set: added a new fold combinator of type
5678 ('a => 'b => 'b) => 'b => 'a set => 'b
5680 Occasionally this is more convenient than the old fold combinator
5681 which is now defined in terms of the new one and renamed to
5684 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5685 and "ring_simps" have been replaced by "algebra_simps" (which can be
5686 extended with further lemmas!). At the moment both still exist but
5687 the former will disappear at some point.
5689 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5690 class recpower. Type-specific simp rules for various recpower types
5691 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5693 rat_power_0 -> power_0
5694 rat_power_Suc -> power_Suc
5695 realpow_0 -> power_0
5696 realpow_Suc -> power_Suc
5697 complexpow_0 -> power_0
5698 complexpow_Suc -> power_Suc
5699 power_poly_0 -> power_0
5700 power_poly_Suc -> power_Suc
5702 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5703 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5704 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5705 of lemmas from Divides has been generalized from nat to class
5706 semiring_div. INCOMPATIBILITY. This involves the following theorem
5707 renames resulting from duplicate elimination:
5709 dvd_def_mod ~> dvd_eq_mod_eq_0
5710 zero_dvd_iff ~> dvd_0_left_iff
5711 dvd_0 ~> dvd_0_right
5712 DIVISION_BY_ZERO_DIV ~> div_by_0
5713 DIVISION_BY_ZERO_MOD ~> mod_by_0
5714 mult_div ~> div_mult_self2_is_id
5715 mult_mod ~> mod_mult_self2_is_0
5717 * Theory IntDiv: removed many lemmas that are instances of class-based
5718 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5719 rename old lemmas as follows:
5721 dvd_diff -> nat_dvd_diff
5722 dvd_zminus_iff -> dvd_minus_iff
5723 mod_add1_eq -> mod_add_eq
5724 mod_mult1_eq -> mod_mult_right_eq
5725 mod_mult1_eq' -> mod_mult_left_eq
5726 mod_mult_distrib_mod -> mod_mult_eq
5727 nat_mod_add_left_eq -> mod_add_left_eq
5728 nat_mod_add_right_eq -> mod_add_right_eq
5729 nat_mod_div_trivial -> mod_div_trivial
5730 nat_mod_mod_trivial -> mod_mod_trivial
5731 zdiv_zadd_self1 -> div_add_self1
5732 zdiv_zadd_self2 -> div_add_self2
5733 zdiv_zmult_self1 -> div_mult_self2_is_id
5734 zdiv_zmult_self2 -> div_mult_self1_is_id
5735 zdvd_triv_left -> dvd_triv_left
5736 zdvd_triv_right -> dvd_triv_right
5737 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5738 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5739 zmod_zadd_left_eq -> mod_add_left_eq
5740 zmod_zadd_right_eq -> mod_add_right_eq
5741 zmod_zadd_self1 -> mod_add_self1
5742 zmod_zadd_self2 -> mod_add_self2
5743 zmod_zadd1_eq -> mod_add_eq
5744 zmod_zdiff1_eq -> mod_diff_eq
5745 zmod_zdvd_zmod -> mod_mod_cancel
5746 zmod_zmod_cancel -> mod_mod_cancel
5747 zmod_zmult_self1 -> mod_mult_self2_is_0
5748 zmod_zmult_self2 -> mod_mult_self1_is_0
5751 zdvd_abs1 -> abs_dvd_iff
5752 zdvd_abs2 -> dvd_abs_iff
5753 zdvd_refl -> dvd_refl
5754 zdvd_trans -> dvd_trans
5755 zdvd_zadd -> dvd_add
5756 zdvd_zdiff -> dvd_diff
5757 zdvd_zminus_iff -> dvd_minus_iff
5758 zdvd_zminus2_iff -> minus_dvd_iff
5759 zdvd_zmultD -> dvd_mult_right
5760 zdvd_zmultD2 -> dvd_mult_left
5761 zdvd_zmult_mono -> mult_dvd_mono
5762 zdvd_0_right -> dvd_0_right
5763 zdvd_0_left -> dvd_0_left_iff
5764 zdvd_1_left -> one_dvd
5765 zminus_dvd_iff -> minus_dvd_iff
5767 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5769 * The real numbers offer decimal input syntax: 12.34 is translated
5770 into 1234/10^2. This translation is not reversed upon output.
5772 * Theory Library/Polynomial defines an abstract type 'a poly of
5773 univariate polynomials with coefficients of type 'a. In addition to
5774 the standard ring operations, it also supports div and mod. Code
5775 generation is also supported, using list-style constructors.
5777 * Theory Library/Inner_Product defines a class of real_inner for real
5778 inner product spaces, with an overloaded operation inner :: 'a => 'a
5779 => real. Class real_inner is a subclass of real_normed_vector from
5782 * Theory Library/Product_Vector provides instances for the product
5783 type 'a * 'b of several classes from RealVector and Inner_Product.
5784 Definitions of addition, subtraction, scalar multiplication, norms,
5785 and inner products are included.
5787 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5788 addition to the field operations, numerals and case syntax are also
5791 * Theory Library/Diagonalize provides constructive version of Cantor's
5792 first diagonalization argument.
5794 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5795 zlcm (for int); carried together from various gcd/lcm developements in
5796 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5797 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5798 may recover tupled syntax as follows:
5800 hide (open) const gcd
5801 abbreviation gcd where
5802 "gcd == (%(a, b). GCD.gcd a b)"
5804 GCD.gcd ("gcd '(_, _')")
5806 The same works for lcm, zgcd, zlcm.
5808 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5809 instantiations for algebraic structures. Removed some duplicate
5810 theorems. Changes in simp rules. INCOMPATIBILITY.
5812 * ML antiquotation @{code} takes a constant as argument and generates
5813 corresponding code in background and inserts name of the corresponding
5814 resulting ML value/function/datatype constructor binding in place.
5815 All occurrences of @{code} with a single ML block are generated
5816 simultaneously. Provides a generic and safe interface for
5817 instrumentalizing code generation. See
5818 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5819 In future you ought to refrain from ad-hoc compiling generated SML
5820 code on the ML toplevel. Note that (for technical reasons) @{code}
5821 cannot refer to constants for which user-defined serializations are
5822 set. Refer to the corresponding ML counterpart directly in that
5825 * Command 'rep_datatype': instead of theorem names the command now
5826 takes a list of terms denoting the constructors of the type to be
5827 represented as datatype. The characteristic theorems have to be
5828 proven. INCOMPATIBILITY. Also observe that the following theorems
5829 have disappeared in favour of existing ones:
5831 unit_induct ~> unit.induct
5832 prod_induct ~> prod.induct
5833 sum_induct ~> sum.induct
5834 Suc_Suc_eq ~> nat.inject
5835 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5840 * New locales for orders and lattices where the equivalence relation
5841 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5842 locales use a record structure with field eq for the equivalence.
5844 * New theory of factorial domains.
5846 * Units_l_inv and Units_r_inv are now simp rules by default.
5847 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5848 and/or r_inv will now also require deletion of these lemmas.
5850 * Renamed the following theorems, INCOMPATIBILITY:
5852 UpperD ~> Upper_memD
5853 LowerD ~> Lower_memD
5854 least_carrier ~> least_closed
5855 greatest_carrier ~> greatest_closed
5856 greatest_Lower_above ~> greatest_Lower_below
5857 one_zero ~> carrier_one_zero
5858 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5863 * Nominal datatypes can now contain type-variables.
5865 * Commands 'nominal_inductive' and 'equivariance' work with local
5868 * Nominal primrec can now works with local theory targets and its
5869 specification syntax now conforms to the general format as seen in
5872 * Method "perm_simp" honours the standard simplifier attributes
5873 (no_asm), (no_asm_use) etc.
5875 * The new predicate #* is defined like freshness, except that on the
5876 left hand side can be a set or list of atoms.
5878 * Experimental command 'nominal_inductive2' derives strong induction
5879 principles for inductive definitions. In contrast to
5880 'nominal_inductive', which can only deal with a fixed number of
5881 binders, it can deal with arbitrary expressions standing for sets of
5882 atoms to be avoided. The only inductive definition we have at the
5883 moment that needs this generalisation is the typing rule for Lets in
5886 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5887 -----------------------------------------------------------------
5888 Gamma |- Let x be t1 in t2 : T2
5890 In this rule one wants to avoid all the binders that are introduced by
5891 "close Gamma T1". We are looking for other examples where this
5892 feature might be useful. Please let us know.
5897 * Reimplemented the simplification procedure for proving continuity
5898 subgoals. The new simproc is extensible; users can declare additional
5899 continuity introduction rules with the attribute [cont2cont].
5901 * The continuity simproc now uses a different introduction rule for
5902 solving continuity subgoals on terms with lambda abstractions. In
5903 some rare cases the new simproc may fail to solve subgoals that the
5904 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5905 Potential INCOMPATIBILITY.
5907 * Command 'fixrec': specification syntax now conforms to the general
5908 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5909 examples. INCOMPATIBILITY.
5914 * Proof of Zorn's Lemma for partial orders.
5919 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5920 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5921 depends on multithreading, so timouts will not work before Poly/ML
5924 * High-level support for concurrent ML programming, see
5925 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5926 particularly convenient to organize independent functional
5927 computations. The concept of "synchronized variables" provides a
5928 higher-order interface for components with shared state, avoiding the
5929 delicate details of mutexes and condition variables. (Requires
5930 Poly/ML 5.2.1 or later.)
5932 * ML bindings produced via Isar commands are stored within the Isar
5933 context (theory or proof). Consequently, commands like 'use' and 'ML'
5934 become thread-safe and work with undo as expected (concerning
5935 top-level bindings, not side-effects on global references).
5936 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5937 compiler at runtime; really global bindings need to be given outside a
5938 theory. (Requires Poly/ML 5.2 or later.)
5940 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5941 context. Top-level ML bindings are stored within the proof context in
5942 a purely sequential fashion, disregarding the nested proof structure.
5943 ML bindings introduced by 'ML_prf' are discarded at the end of the
5944 proof. (Requires Poly/ML 5.2 or later.)
5946 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5947 and Method.setup, as well as Isar commands 'attribute_setup' and
5948 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5949 existing code accordingly, or use plain 'setup' together with old
5952 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5953 to 'a -> thm, while results are always tagged with an authentic oracle
5954 name. The Isar command 'oracle' is now polymorphic, no argument type
5955 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5956 accordingly. Note that extra performance may be gained by producing
5957 the cterm carefully, avoiding slow Thm.cterm_of.
5959 * Simplified interface for defining document antiquotations via
5960 ThyOutput.antiquotation, ThyOutput.output, and optionally
5961 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5962 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5965 * More systematic treatment of long names, abstract name bindings, and
5966 name space operations. Basic operations on qualified names have been
5967 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5968 Long_Name.append. Old type bstring has been mostly replaced by
5969 abstract type binding (see structure Binding), which supports precise
5970 qualification by packages and local theory targets, as well as proper
5971 tracking of source positions. INCOMPATIBILITY, need to wrap old
5972 bstring values into Binding.name, or better pass through abstract
5973 bindings everywhere. See further src/Pure/General/long_name.ML,
5974 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5976 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5977 LocalTheory.note etc.) now refer to the *full* internal name, not the
5978 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5980 * Disposed old type and term read functions (Sign.read_def_typ,
5981 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5982 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5983 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5984 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5985 resort for legacy applications.
5987 * Disposed old declarations, tactics, tactic combinators that refer to
5988 the simpset or claset of an implicit theory (such as Addsimps,
5989 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5990 embedded ML text, or local_simpset_of with a proper context passed as
5991 explicit runtime argument.
5993 * Rules and tactics that read instantiations (read_instantiate,
5994 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5995 context, which is required for parsing and type-checking. Moreover,
5996 the variables are specified as plain indexnames, not string encodings
5997 thereof. INCOMPATIBILITY.
5999 * Generic Toplevel.add_hook interface allows to analyze the result of
6000 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
6001 for theorem dependency output of transactions resulting in a new
6004 * ML antiquotations: block-structured compilation context indicated by
6005 \<lbrace> ... \<rbrace>; additional antiquotation forms:
6007 @{binding name} - basic name binding
6008 @{let ?pat = term} - term abbreviation (HO matching)
6009 @{note name = fact} - fact abbreviation
6010 @{thm fact} - singleton fact (with attributes)
6011 @{thms fact} - general fact (with attributes)
6012 @{lemma prop by method} - singleton goal
6013 @{lemma prop by meth1 meth2} - singleton goal
6014 @{lemma prop1 ... propN by method} - general goal
6015 @{lemma prop1 ... propN by meth1 meth2} - general goal
6016 @{lemma (open) ...} - open derivation
6021 * The Isabelle "emacs" tool provides a specific interface to invoke
6022 Proof General / Emacs, with more explicit failure if that is not
6023 installed (the old isabelle-interface script silently falls back on
6024 isabelle-process). The PROOFGENERAL_HOME setting determines the
6025 installation location of the Proof General distribution.
6027 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
6028 the Isabelle process into a JVM/Scala application. See
6029 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
6030 process wrapper has been discontinued.)
6032 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
6034 * Various status messages (with exact source position information) are
6035 emitted, if proper markup print mode is enabled. This allows
6036 user-interface components to provide detailed feedback on internal
6041 New in Isabelle2008 (June 2008)
6042 -------------------------------
6046 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
6047 and updated, with formally checked references as hyperlinks.
6049 * Theory loader: use_thy (and similar operations) no longer set the
6050 implicit ML context, which was occasionally hard to predict and in
6051 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
6052 provides a proper context already.
6054 * Theory loader: old-style ML proof scripts being *attached* to a thy
6055 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
6056 'use' within a theory file will do the job.
6058 * Name space merge now observes canonical order, i.e. the second space
6059 is inserted into the first one, while existing entries in the first
6060 space take precedence. INCOMPATIBILITY in rare situations, may try to
6061 swap theory imports.
6063 * Syntax: symbol \<chi> is now considered a letter. Potential
6064 INCOMPATIBILITY in identifier syntax etc.
6066 * Outer syntax: string tokens no longer admit escaped white space,
6067 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
6068 white space without escapes.
6070 * Outer syntax: string tokens may contain arbitrary character codes
6071 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
6077 * Context-dependent token translations. Default setup reverts locally
6078 fixed variables, and adds hilite markup for undeclared frees.
6080 * Unused theorems can be found using the new command 'unused_thms'.
6081 There are three ways of invoking it:
6084 Only finds unused theorems in the current theory.
6086 (2) unused_thms thy_1 ... thy_n -
6087 Finds unused theorems in the current theory and all of its ancestors,
6088 excluding the theories thy_1 ... thy_n and all of their ancestors.
6090 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
6091 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
6092 their ancestors, excluding the theories thy_1 ... thy_n and all of
6095 In order to increase the readability of the list produced by
6096 unused_thms, theorems that have been created by a particular instance
6097 of a theory command such as 'inductive' or 'function' are considered
6098 to belong to the same "group", meaning that if at least one theorem in
6099 this group is used, the other theorems in the same group are no longer
6100 reported as unused. Moreover, if all theorems in the group are
6101 unused, only one theorem in the group is displayed.
6103 Note that proof objects have to be switched on in order for
6104 unused_thms to work properly (i.e. !proofs must be >= 1, which is
6105 usually the case when using Proof General with the default settings).
6107 * Authentic naming of facts disallows ad-hoc overwriting of previous
6108 theorems within the same name space. INCOMPATIBILITY, need to remove
6109 duplicate fact bindings, or even accidental fact duplications. Note
6110 that tools may maintain dynamically scoped facts systematically, using
6111 PureThy.add_thms_dynamic.
6113 * Command 'hide' now allows to hide from "fact" name space as well.
6115 * Eliminated destructive theorem database, simpset, claset, and
6116 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
6117 update of theories within ML code.
6119 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
6120 INCOMPATIBILITY, object-logics depending on former Pure require
6121 additional setup PureThy.old_appl_syntax_setup; object-logics
6122 depending on former CPure need to refer to Pure.
6124 * Commands 'use' and 'ML' are now purely functional, operating on
6125 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
6126 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
6129 * Command 'setup': discontinued implicit version with ML reference.
6131 * Instantiation target allows for simultaneous specification of class
6132 instance operations together with an instantiation proof.
6133 Type-checking phase allows to refer to class operations uniformly.
6134 See src/HOL/Complex/Complex.thy for an Isar example and
6135 src/HOL/Library/Eval.thy for an ML example.
6137 * Indexing of literal facts: be more serious about including only
6138 facts from the visible specification/proof context, but not the
6139 background context (locale etc.). Affects `prop` notation and method
6140 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
6143 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
6144 "(open)" option, which used to expose internal bound variables to the
6147 * Isar statements: removed obsolete case "rule_context".
6148 INCOMPATIBILITY, better use explicit fixes/assumes.
6150 * Locale proofs: default proof step now includes 'unfold_locales';
6151 hence 'proof' without argument may be used to unfold locale
6155 *** Document preparation ***
6157 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
6158 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
6159 obsolete thumbpdf setup (contemporary PDF viewers do this on the
6160 spot); renamed link color from "darkblue" to "linkcolor" (default
6161 value unchanged, can be redefined via \definecolor); no longer sets
6162 "a4paper" option (unnecessary or even intrusive).
6164 * Antiquotation @{lemma A method} proves proposition A by the given
6165 method (either a method name or a method name plus (optional) method
6166 arguments in parentheses) and prints A just like @{prop A}.
6171 * New primrec package. Specification syntax conforms in style to
6172 definition/function/.... No separate induction rule is provided. The
6173 "primrec" command distinguishes old-style and new-style specifications
6174 by syntax. The former primrec package is now named OldPrimrecPackage.
6175 When adjusting theories, beware: constants stemming from new-style
6176 primrec specifications have authentic syntax.
6178 * Metis prover is now an order of magnitude faster, and also works
6179 with multithreading.
6181 * Metis: the maximum number of clauses that can be produced from a
6182 theorem is now given by the attribute max_clauses. Theorems that
6183 exceed this number are ignored, with a warning printed.
6185 * Sledgehammer no longer produces structured proofs by default. To
6186 enable, declare [[sledgehammer_full = true]]. Attributes
6187 reconstruction_modulus, reconstruction_sorts renamed
6188 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
6190 * Method "induct_scheme" derives user-specified induction rules
6191 from well-founded induction and completeness of patterns. This factors
6192 out some operations that are done internally by the function package
6193 and makes them available separately. See
6194 src/HOL/ex/Induction_Scheme.thy for examples.
6196 * More flexible generation of measure functions for termination
6197 proofs: Measure functions can be declared by proving a rule of the
6198 form "is_measure f" and giving it the [measure_function] attribute.
6199 The "is_measure" predicate is logically meaningless (always true), and
6200 just guides the heuristic. To find suitable measure functions, the
6201 termination prover sets up the goal "is_measure ?f" of the appropriate
6202 type and generates all solutions by Prolog-style backward proof using
6205 This setup also deals with rules like
6207 "is_measure f ==> is_measure (list_size f)"
6209 which accommodates nested datatypes that recurse through lists.
6210 Similar rules are predeclared for products and option types.
6212 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
6216 - Definitions of overloaded constants on sets have to be replaced by
6217 definitions on => and bool.
6219 - Some definitions of overloaded operators on sets can now be proved
6220 using the definitions of the operators on => and bool. Therefore,
6221 the following theorems have been renamed:
6223 subset_def -> subset_eq
6224 psubset_def -> psubset_eq
6225 set_diff_def -> set_diff_eq
6226 Compl_def -> Compl_eq
6227 Sup_set_def -> Sup_set_eq
6228 Inf_set_def -> Inf_set_eq
6229 sup_set_def -> sup_set_eq
6230 inf_set_def -> inf_set_eq
6232 - Due to the incompleteness of the HO unification algorithm, some
6233 rules such as subst may require manual instantiation, if some of
6234 the unknowns in the rule is a set.
6236 - Higher order unification and forward proofs:
6239 have "P (S::'a set)" <...>
6240 then have "EX S. P S" ..
6242 no longer works (due to the incompleteness of the HO unification
6243 algorithm) and must be replaced by the pattern
6250 - Calculational reasoning with subst (or similar rules):
6253 have "P (S::'a set)" <...>
6254 also have "S = T" <...>
6255 finally have "P T" .
6257 no longer works (for similar reasons as the previous example) and
6258 must be replaced by something like
6260 have "P (S::'a set)" <...>
6261 moreover have "S = T" <...>
6262 ultimately have "P T" by simp
6264 - Tactics or packages written in ML code:
6265 Code performing pattern matching on types via
6267 Type ("set", [T]) => ...
6269 must be rewritten. Moreover, functions like strip_type or
6270 binder_types no longer return the right value when applied to a
6273 T1 => ... => Tn => U => bool
6277 T1 => ... => Tn => U set
6279 * Merged theories Wellfounded_Recursion, Accessible_Part and
6280 Wellfounded_Relations to theory Wellfounded.
6282 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
6284 * Class finite no longer treats UNIV as class parameter. Use class
6285 enum from theory Library/Enum instead to achieve a similar effect.
6288 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
6289 and "Cons". INCOMPATIBILITY.
6291 * HOL (and FOL): renamed variables in rules imp_elim and swap.
6292 Potential INCOMPATIBILITY.
6294 * Theory Product_Type: duplicated lemmas split_Pair_apply and
6295 injective_fst_snd removed, use split_eta and prod_eqI instead.
6296 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
6298 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
6299 the same name in theory Orderings:
6309 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
6310 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
6311 and different variable names.
6313 * Library/Option_ord.thy: Canonical order on option type.
6315 * Library/RBT.thy: Red-black trees, an efficient implementation of
6318 * Library/Countable.thy: Type class for countable types.
6320 * Theory Int: The representation of numerals has changed. The infix
6321 operator BIT and the bit datatype with constructors B0 and B1 have
6322 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
6323 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
6324 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
6327 * Theory Nat: definition of <= and < on natural numbers no longer
6328 depend on well-founded relations. INCOMPATIBILITY. Definitions
6329 le_def and less_def have disappeared. Consider lemmas not_less
6330 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
6332 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
6333 (whose purpose mainly is for various fold_set functionals) have been
6334 abandoned in favor of the existing algebraic classes
6335 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
6336 lower_semilattice (resp. upper_semilattice) and linorder.
6339 * Theory Transitive_Closure: induct and cases rules now declare proper
6340 case_names ("base" and "step"). INCOMPATIBILITY.
6342 * Theorem Inductive.lfp_ordinal_induct generalized to complete
6343 lattices. The form set-specific version is available as
6344 Inductive.lfp_ordinal_induct_set.
6346 * Renamed theorems "power.simps" to "power_int.simps".
6349 * Class semiring_div provides basic abstract properties of semirings
6350 with division and modulo operations. Subsumes former class dvd_mod.
6352 * Merged theories IntDef, Numeral and IntArith into unified theory
6353 Int. INCOMPATIBILITY.
6355 * Theory Library/Code_Index: type "index" now represents natural
6356 numbers rather than integers. INCOMPATIBILITY.
6358 * New class "uminus" with operation "uminus" (split of from class
6359 "minus" which now only has operation "minus", binary).
6362 * Constants "card", "internal_split", "option_map" now with authentic
6363 syntax. INCOMPATIBILITY.
6365 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
6366 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
6367 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
6368 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
6369 Sup_set_def, le_def, less_def, option_map_def now with object
6370 equality. INCOMPATIBILITY.
6372 * Records. Removed K_record, and replaced it by pure lambda term
6373 %x. c. The simplifier setup is now more robust against eta expansion.
6374 INCOMPATIBILITY: in cases explicitly referring to K_record.
6376 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
6378 * Library/ListVector: new theory of arithmetic vector operations.
6380 * Library/Order_Relation: new theory of various orderings as sets of
6381 pairs. Defines preorders, partial orders, linear orders and
6382 well-orders on sets and on types.
6387 * Renamed some theories to allow to loading both ZF and HOL in the
6390 Datatype -> Datatype_ZF
6391 Inductive -> Inductive_ZF
6398 INCOMPATIBILITY: ZF theories that import individual theories below
6399 Main might need to be adapted. Regular theory Main is still
6400 available, as trivial extension of Main_ZF.
6405 * ML within Isar: antiquotation @{const name} or @{const
6406 name(typargs)} produces statically-checked Const term.
6408 * Functor NamedThmsFun: data is available to the user as dynamic fact
6409 (of the same name). Removed obsolete print command.
6411 * Removed obsolete "use_legacy_bindings" function.
6413 * The ``print mode'' is now a thread-local value derived from a global
6414 template (the former print_mode reference), thus access becomes
6415 non-critical. The global print_mode reference is for session
6416 management only; user-code should use print_mode_value,
6417 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
6419 * Functions system/system_out provide a robust way to invoke external
6420 shell commands, with propagation of interrupts (requires Poly/ML
6421 5.2.1). Do not use OS.Process.system etc. from the basis library!
6426 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
6427 in accordance with Proof General 3.7, which prefers GNU emacs.
6429 * isatool tty runs Isabelle process with plain tty interaction;
6430 optional line editor may be specified via ISABELLE_LINE_EDITOR
6431 setting, the default settings attempt to locate "ledit" and "rlwrap".
6433 * isatool browser now works with Cygwin as well, using general
6434 "javapath" function defined in Isabelle process environment.
6436 * YXML notation provides a simple and efficient alternative to
6437 standard XML transfer syntax. See src/Pure/General/yxml.ML and
6438 isatool yxml as described in the Isabelle system manual.
6440 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
6441 provides general wrapper for managing an Isabelle process in a robust
6442 fashion, with ``cooked'' output from stdin/stderr.
6444 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
6445 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
6447 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
6448 way of changing the user's settings is via
6449 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
6452 * Multithreading.max_threads := 0 refers to the number of actual CPU
6453 cores of the underlying machine, which is a good starting point for
6454 optimal performance tuning. The corresponding usedir option -M allows
6455 "max" as an alias for "0". WARNING: does not work on certain versions
6456 of Mac OS (with Poly/ML 5.1).
6458 * isabelle-process: non-ML sessions are run with "nice", to reduce the
6459 adverse effect of Isabelle flooding interactive front-ends (notably
6460 ProofGeneral / XEmacs).
6464 New in Isabelle2007 (November 2007)
6465 -----------------------------------
6469 * More uniform information about legacy features, notably a
6470 warning/error of "Legacy feature: ...", depending on the state of the
6471 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
6472 legacy features will disappear eventually.
6474 * Theory syntax: the header format ``theory A = B + C:'' has been
6475 discontinued in favour of ``theory A imports B C begin''. Use isatool
6476 fixheaders to convert existing theory files. INCOMPATIBILITY.
6478 * Theory syntax: the old non-Isar theory file format has been
6479 discontinued altogether. Note that ML proof scripts may still be used
6480 with Isar theories; migration is usually quite simple with the ML
6481 function use_legacy_bindings. INCOMPATIBILITY.
6483 * Theory syntax: some popular names (e.g. 'class', 'declaration',
6484 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
6487 * Theory loader: be more serious about observing the static theory
6488 header specifications (including optional directories), but not the
6489 accidental file locations of previously successful loads. The strict
6490 update policy of former update_thy is now already performed by
6491 use_thy, so the former has been removed; use_thys updates several
6492 theories simultaneously, just as 'imports' within a theory header
6493 specification, but without merging the results. Potential
6494 INCOMPATIBILITY: may need to refine theory headers and commands
6495 ROOT.ML which depend on load order.
6497 * Theory loader: optional support for content-based file
6498 identification, instead of the traditional scheme of full physical
6499 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
6500 (cf. the system manual). The new scheme allows to work with
6501 non-finished theories in persistent session images, such that source
6502 files may be moved later on without requiring reloads.
6504 * Theory loader: old-style ML proof scripts being *attached* to a thy
6505 file (with the same base name as the theory) are considered a legacy
6506 feature, which will disappear eventually. Even now, the theory loader
6507 no longer maintains dependencies on such files.
6509 * Syntax: the scope for resolving ambiguities via type-inference is
6510 now limited to individual terms, instead of whole simultaneous
6511 specifications as before. This greatly reduces the complexity of the
6512 syntax module and improves flexibility by separating parsing and
6513 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
6514 'fixes' etc.) are required in rare situations.
6516 * Syntax: constants introduced by new-style packages ('definition',
6517 'abbreviation' etc.) are passed through the syntax module in
6518 ``authentic mode''. This means that associated mixfix annotations
6519 really stick to such constants, independently of potential name space
6520 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
6521 trees are represented slightly differently, may need to adapt syntax
6522 translations accordingly. Use CONST marker in 'translations' and
6523 @{const_syntax} antiquotation in 'parse_translation' etc.
6525 * Legacy goal package: reduced interface to the bare minimum required
6526 to keep existing proof scripts running. Most other user-level
6527 functions are now part of the OldGoals structure, which is *not* open
6528 by default (consider isatool expandshort before open OldGoals).
6529 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
6530 these tend to cause confusion about the actual goal (!) context being
6531 used here, which is not necessarily the same as the_context().
6533 * Command 'find_theorems': supports "*" wild-card in "name:"
6534 criterion; "with_dups" option. Certain ProofGeneral versions might
6535 support a specific search form (see ProofGeneral/CHANGES).
6537 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
6538 by default, which means that "prems" (and also "fixed variables") are
6539 suppressed from proof state output. Note that the ProofGeneral
6540 settings mechanism allows to change and save options persistently, but
6541 older versions of Isabelle will fail to start up if a negative prems
6544 * Local theory targets may be specified by non-nested blocks of
6545 ``context/locale/class ... begin'' followed by ``end''. The body may
6546 contain definitions, theorems etc., including any derived mechanism
6547 that has been implemented on top of these primitives. This concept
6548 generalizes the existing ``theorem (in ...)'' towards more versatility
6551 * Proof General interface: proper undo of final 'end' command;
6552 discontinued Isabelle/classic mode (ML proof scripts).
6555 *** Document preparation ***
6557 * Added antiquotation @{theory name} which prints the given name,
6558 after checking that it refers to a valid ancestor theory in the
6561 * Added antiquotations @{ML_type text} and @{ML_struct text} which
6562 check the given source text as ML type/structure, printing verbatim.
6564 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
6565 "c args == rhs" given in the current context. (Any number of
6566 arguments may be given on the LHS.)
6571 * The 'class' package offers a combination of axclass and locale to
6572 achieve Haskell-like type classes in Isabelle. Definitions and
6573 theorems within a class context produce both relative results (with
6574 implicit parameters according to the locale context), and polymorphic
6575 constants with qualified polymorphism (according to the class
6576 context). Within the body context of a 'class' target, a separate
6577 syntax layer ("user space type system") takes care of converting
6578 between global polymorphic consts and internal locale representation.
6579 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
6580 "isatool doc classes" provides a tutorial.
6582 * Generic code generator framework allows to generate executable
6583 code for ML and Haskell (including Isabelle classes). A short usage
6586 internal compilation:
6587 export_code <list of constants (term syntax)> in SML
6588 writing SML code to a file:
6589 export_code <list of constants (term syntax)> in SML <filename>
6590 writing OCaml code to a file:
6591 export_code <list of constants (term syntax)> in OCaml <filename>
6592 writing Haskell code to a bunch of files:
6593 export_code <list of constants (term syntax)> in Haskell <filename>
6595 evaluating closed propositions to True/False using code generation:
6598 Reasonable default setup of framework in HOL.
6600 Theorem attributs for selecting and transforming function equations theorems:
6602 [code fun]: select a theorem as function equation for a specific constant
6603 [code fun del]: deselect a theorem as function equation for a specific constant
6604 [code inline]: select an equation theorem for unfolding (inlining) in place
6605 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
6607 User-defined serializations (target in {SML, OCaml, Haskell}):
6609 code_const <and-list of constants (term syntax)>
6610 {(target) <and-list of const target syntax>}+
6612 code_type <and-list of type constructors>
6613 {(target) <and-list of type target syntax>}+
6615 code_instance <and-list of instances>
6617 where instance ::= <type constructor> :: <class>
6619 code_class <and_list of classes>
6620 {(target) <and-list of class target syntax>}+
6621 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
6623 code_instance and code_class only are effective to target Haskell.
6625 For example usage see src/HOL/ex/Codegenerator.thy and
6626 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
6627 generation from Isabelle/HOL theories is available via "isatool doc
6630 * Code generator: consts in 'consts_code' Isar commands are now
6631 referred to by usual term syntax (including optional type
6634 * Command 'no_translations' removes translation rules from theory
6637 * Overloaded definitions are now actually checked for acyclic
6638 dependencies. The overloading scheme is slightly more general than
6639 that of Haskell98, although Isabelle does not demand an exact
6640 correspondence to type class and instance declarations.
6641 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
6642 exotic versions of overloading -- at the discretion of the user!
6644 Polymorphic constants are represented via type arguments, i.e. the
6645 instantiation that matches an instance against the most general
6646 declaration given in the signature. For example, with the declaration
6647 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
6648 as c(nat). Overloading is essentially simultaneous structural
6649 recursion over such type arguments. Incomplete specification patterns
6650 impose global constraints on all occurrences, e.g. c('a * 'a) on the
6651 LHS means that more general c('a * 'b) will be disallowed on any RHS.
6652 Command 'print_theory' outputs the normalized system of recursive
6653 equations, see section "definitions".
6655 * Configuration options are maintained within the theory or proof
6656 context (with name and type bool/int/string), providing a very simple
6657 interface to a poor-man's version of general context data. Tools may
6658 declare options in ML (e.g. using Attrib.config_int) and then refer to
6659 these values using Config.get etc. Users may change options via an
6660 associated attribute of the same name. This form of context
6661 declaration works particularly well with commands 'declare' or
6662 'using', for example ``declare [[foo = 42]]''. Thus it has become
6663 very easy to avoid global references, which would not observe Isar
6664 toplevel undo/redo and fail to work with multithreading.
6666 Various global ML references of Pure and HOL have been turned into
6667 configuration options:
6669 Unify.search_bound unify_search_bound
6670 Unify.trace_bound unify_trace_bound
6671 Unify.trace_simp unify_trace_simp
6672 Unify.trace_types unify_trace_types
6673 Simplifier.simp_depth_limit simp_depth_limit
6674 Blast.depth_limit blast_depth_limit
6675 DatatypeProp.dtK datatype_distinctness_limit
6676 fast_arith_neq_limit fast_arith_neq_limit
6677 fast_arith_split_limit fast_arith_split_limit
6679 * Named collections of theorems may be easily installed as context
6680 data using the functor NamedThmsFun (see also
6681 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6682 attributes; there is also a toplevel print command. This facility is
6683 just a common case of general context data, which is the preferred way
6684 for anything more complex than just a list of facts in canonical
6687 * Isar: command 'declaration' augments a local theory by generic
6688 declaration functions written in ML. This enables arbitrary content
6689 being added to the context, depending on a morphism that tells the
6690 difference of the original declaration context wrt. the application
6691 context encountered later on.
6693 * Isar: proper interfaces for simplification procedures. Command
6694 'simproc_setup' declares named simprocs (with match patterns, and body
6695 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6696 context. ML antiquotation @{simproc name} retrieves named simprocs.
6698 * Isar: an extra pair of brackets around attribute declarations
6699 abbreviates a theorem reference involving an internal dummy fact,
6700 which will be ignored later --- only the effect of the attribute on
6701 the background context will persist. This form of in-place
6702 declarations is particularly useful with commands like 'declare' and
6703 'using', for example ``have A using [[simproc a]] by simp''.
6705 * Isar: method "assumption" (and implicit closing of subproofs) now
6706 takes simple non-atomic goal assumptions into account: after applying
6707 an assumption as a rule the resulting subgoals are solved by atomic
6708 assumption steps. This is particularly useful to finish 'obtain'
6709 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6710 without referring to the original premise "!!x. P x ==> thesis" in the
6711 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6714 * Isar: implicit use of prems from the Isar proof context is
6715 considered a legacy feature. Common applications like ``have A .''
6716 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6717 referencing facts explicitly here improves readability and
6718 maintainability of proof texts.
6720 * Isar: improper proof element 'guess' is like 'obtain', but derives
6721 the obtained context from the course of reasoning! For example:
6723 assume "EX x y. A x & B y" -- "any previous fact"
6724 then guess x and y by clarify
6726 This technique is potentially adventurous, depending on the facts and
6727 proof tools being involved here.
6729 * Isar: known facts from the proof context may be specified as literal
6730 propositions, using ASCII back-quote syntax. This works wherever
6731 named facts used to be allowed so far, in proof commands, proof
6732 methods, attributes etc. Literal facts are retrieved from the context
6733 according to unification of type and term parameters. For example,
6734 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6735 theorems in the current context, then these are valid literal facts:
6736 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6738 There is also a proof method "fact" which does the same composition
6739 for explicit goal states, e.g. the following proof texts coincide with
6740 certain special cases of literal facts:
6742 have "A" by fact == note `A`
6743 have "A ==> B" by fact == note `A ==> B`
6744 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6745 have "P a ==> Q a" by fact == note `P a ==> Q a`
6747 * Isar: ":" (colon) is no longer a symbolic identifier character in
6748 outer syntax. Thus symbolic identifiers may be used without
6749 additional white space in declarations like this: ``assume *: A''.
6751 * Isar: 'print_facts' prints all local facts of the current context,
6752 both named and unnamed ones.
6754 * Isar: 'def' now admits simultaneous definitions, e.g.:
6756 def x == "t" and y == "u"
6758 * Isar: added command 'unfolding', which is structurally similar to
6759 'using', but affects both the goal state and facts by unfolding given
6760 rewrite rules. Thus many occurrences of the 'unfold' method or
6761 'unfolded' attribute may be replaced by first-class proof text.
6763 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6764 and command 'unfolding' now all support object-level equalities
6765 (potentially conditional). The underlying notion of rewrite rule is
6766 analogous to the 'rule_format' attribute, but *not* that of the
6767 Simplifier (which is usually more generous).
6769 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6770 premises of a theorem by n. Useful in conjunction with drule.
6772 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6773 method expression within a sandbox consisting of the first N
6774 sub-goals, which need to exist. For example, ``simp_all [3]''
6775 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6776 simplifies all new goals that emerge from applying rule foo to the
6777 originally first one.
6779 * Isar: schematic goals are no longer restricted to higher-order
6780 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6783 * Isar: the conclusion of a long theorem statement is now either
6784 'shows' (a simultaneous conjunction, as before), or 'obtains'
6785 (essentially a disjunction of cases with local parameters and
6786 assumptions). The latter allows to express general elimination rules
6787 adequately; in this notation common elimination rules look like this:
6789 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6791 obtains x where "P x"
6793 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6797 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6803 The subsequent classical rules even refer to the formal "thesis"
6806 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6809 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6810 obtains "thesis ==> something"
6812 The actual proof of an 'obtains' statement is analogous to that of the
6813 Isar proof element 'obtain', only that there may be several cases.
6814 Optional case names may be specified in parentheses; these will be
6815 available both in the present proof and as annotations in the
6816 resulting rule, for later use with the 'cases' method (cf. attribute
6819 * Isar: the assumptions of a long theorem statement are available as
6820 "assms" fact in the proof context. This is more appropriate than the
6821 (historical) "prems", which refers to all assumptions of the current
6822 context, including those from the target locale, proof body etc.
6824 * Isar: 'print_statement' prints theorems from the current theory or
6825 proof context in long statement form, according to the syntax of a
6828 * Isar: 'obtain' takes an optional case name for the local context
6829 introduction rule (default "that").
6831 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6832 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6835 * Pure: syntax "CONST name" produces a fully internalized constant
6836 according to the current context. This is particularly useful for
6837 syntax translations that should refer to internal constant
6838 representations independently of name spaces.
6840 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6841 instead of "FOO ". This allows multiple binder declarations to coexist
6842 in the same context. INCOMPATIBILITY.
6844 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6845 primitive that also works in a locale context (both for constants and
6846 fixed variables). Type declaration and internal syntactic representation
6847 of given constants retrieved from the context. Likewise, the
6848 'no_notation' command allows to remove given syntax annotations from the
6851 * Isar/locales: new derived specification elements 'axiomatization',
6852 'definition', 'abbreviation', which support type-inference, admit
6853 object-level specifications (equality, equivalence). See also the
6854 isar-ref manual. Examples:
6857 eq (infix "===" 50) where
6858 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6860 definition "f x y = x + y + 1"
6861 definition g where "g x = f x x"
6864 neq (infix "=!=" 50) where
6865 "x =!= y == ~ (x === y)"
6867 These specifications may be also used in a locale context. Then the
6868 constants being introduced depend on certain fixed parameters, and the
6869 constant name is qualified by the locale base name. An internal
6870 abbreviation takes care for convenient input and output, making the
6871 parameters implicit and using the original short name. See also
6872 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6873 entities from a monomorphic theory.
6875 Presently, abbreviations are only available 'in' a target locale, but
6876 not inherited by general import expressions. Also note that
6877 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6878 'translations' in common applications. The "no_abbrevs" print mode
6879 prevents folding of abbreviations in term output.
6881 Concrete syntax is attached to specified constants in internal form,
6882 independently of name spaces. The parse tree representation is
6883 slightly different -- use 'notation' instead of raw 'syntax', and
6884 'translations' with explicit "CONST" markup to accommodate this.
6886 * Pure/Isar: unified syntax for new-style specification mechanisms
6887 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6888 full type inference and dummy patterns ("_"). For example:
6890 definition "K x _ = x"
6892 inductive conj for A B
6893 where "A ==> B ==> conj A B"
6895 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6896 the current context. Print mode "no_abbrevs" prevents inversion of
6897 abbreviations on output.
6899 * Isar/locales: improved parameter handling: use of locales "var" and
6900 "struct" no longer necessary; - parameter renamings are no longer
6901 required to be injective. For example, this allows to define
6902 endomorphisms as locale endom = homom mult mult h.
6904 * Isar/locales: changed the way locales with predicates are defined.
6905 Instead of accumulating the specification, the imported expression is
6906 now an interpretation. INCOMPATIBILITY: different normal form of
6907 locale expressions. In particular, in interpretations of locales with
6908 predicates, goals repesenting already interpreted fragments are not
6909 removed automatically. Use methods `intro_locales' and
6910 `unfold_locales'; see below.
6912 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6913 provide backward reasoning on locales predicates. The methods are
6914 aware of interpretations and discharge corresponding goals.
6915 `intro_locales' is less aggressive then `unfold_locales' and does not
6916 unfold predicates to assumptions.
6918 * Isar/locales: the order in which locale fragments are accumulated
6919 has changed. This enables to override declarations from fragments due
6920 to interpretations -- for example, unwanted simp rules.
6922 * Isar/locales: interpretation in theories and proof contexts has been
6923 extended. One may now specify (and prove) equations, which are
6924 unfolded in interpreted theorems. This is useful for replacing
6925 defined concepts (constants depending on locale parameters) by
6926 concepts already existing in the target context. Example:
6928 interpretation partial_order ["op <= :: [int, int] => bool"]
6929 where "partial_order.less (op <=) (x::int) y = (x < y)"
6931 Typically, the constant `partial_order.less' is created by a
6932 definition specification element in the context of locale
6935 * Method "induct": improved internal context management to support
6936 local fixes and defines on-the-fly. Thus explicit meta-level
6937 connectives !! and ==> are rarely required anymore in inductive goals
6938 (using object-logic connectives for this purpose has been long
6939 obsolete anyway). Common proof patterns are explained in
6940 src/HOL/Induct/Common_Patterns.thy, see also
6941 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6944 * Method "induct": improved handling of simultaneous goals. Instead of
6945 introducing object-level conjunction, the statement is now split into
6946 several conclusions, while the corresponding symbolic cases are nested
6947 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6948 see src/HOL/Induct/Common_Patterns.thy, for example.
6950 * Method "induct": mutual induction rules are now specified as a list
6951 of rule sharing the same induction cases. HOL packages usually provide
6952 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6953 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6954 mutual induction rules differently, i.e. like this:
6956 (induct rule: foo_bar.inducts)
6957 (induct set: foo bar)
6958 (induct pred: foo bar)
6959 (induct type: foo bar)
6961 The ML function ProjectRule.projections turns old-style rules into the
6964 * Method "coinduct": dual of induction, see
6965 src/HOL/Library/Coinductive_List.thy for various examples.
6967 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6968 considered a legacy feature.
6970 * Attribute "symmetric" produces result with standardized schematic
6971 variables (index 0). Potential INCOMPATIBILITY.
6973 * Simplifier: by default the simplifier trace only shows top level
6974 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6975 default. Thus there is less danger of being flooded by the trace. The
6976 trace indicates where parts have been suppressed.
6978 * Provers/classical: removed obsolete classical version of elim_format
6979 attribute; classical elim/dest rules are now treated uniformly when
6980 manipulating the claset.
6982 * Provers/classical: stricter checks to ensure that supplied intro,
6983 dest and elim rules are well-formed; dest and elim rules must have at
6986 * Provers/classical: attributes dest/elim/intro take an optional
6987 weight argument for the rule (just as the Pure versions). Weights are
6988 ignored by automated tools, but determine the search order of single
6991 * Syntax: input syntax now supports dummy variable binding "%_. b",
6992 where the body does not mention the bound variable. Note that dummy
6993 patterns implicitly depend on their context of bounds, which makes
6994 "{_. _}" match any set comprehension as expected. Potential
6995 INCOMPATIBILITY -- parse translations need to cope with syntactic
6996 constant "_idtdummy" in the binding position.
6998 * Syntax: removed obsolete syntactic constant "_K" and its associated
6999 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
7000 for example "A -> B" => "Pi A (%_. B)".
7002 * Pure: 'class_deps' command visualizes the subclass relation, using
7003 the graph browser tool.
7005 * Pure: 'print_theory' now suppresses certain internal declarations by
7006 default; use '!' option for full details.
7011 * Method "metis" proves goals by applying the Metis general-purpose
7012 resolution prover (see also http://gilith.com/software/metis/).
7013 Examples are in the directory MetisExamples. WARNING: the
7014 Isabelle/HOL-Metis integration does not yet work properly with
7017 * Command 'sledgehammer' invokes external automatic theorem provers as
7018 background processes. It generates calls to the "metis" method if
7019 successful. These can be pasted into the proof. Users do not have to
7020 wait for the automatic provers to return. WARNING: does not really
7021 work with multi-threading.
7023 * New "auto_quickcheck" feature tests outermost goal statements for
7024 potential counter-examples. Controlled by ML references
7025 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
7026 5000 milliseconds). Fails silently if statements is outside of
7027 executable fragment, or any other codgenerator problem occurs.
7029 * New constant "undefined" with axiom "undefined x = undefined".
7031 * Added class "HOL.eq", allowing for code generation with polymorphic
7034 * Some renaming of class constants due to canonical name prefixing in
7035 the new 'class' package:
7037 HOL.abs ~> HOL.abs_class.abs
7038 HOL.divide ~> HOL.divide_class.divide
7039 0 ~> HOL.zero_class.zero
7040 1 ~> HOL.one_class.one
7041 op + ~> HOL.plus_class.plus
7042 op - ~> HOL.minus_class.minus
7043 uminus ~> HOL.minus_class.uminus
7044 op * ~> HOL.times_class.times
7045 op < ~> HOL.ord_class.less
7046 op <= > HOL.ord_class.less_eq
7047 Nat.power ~> Power.power_class.power
7048 Nat.size ~> Nat.size_class.size
7049 Numeral.number_of ~> Numeral.number_class.number_of
7050 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
7051 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
7052 Orderings.min ~> Orderings.ord_class.min
7053 Orderings.max ~> Orderings.ord_class.max
7054 Divides.op div ~> Divides.div_class.div
7055 Divides.op mod ~> Divides.div_class.mod
7056 Divides.op dvd ~> Divides.div_class.dvd
7058 INCOMPATIBILITY. Adaptions may be required in the following cases:
7060 a) User-defined constants using any of the names "plus", "minus",
7061 "times", "less" or "less_eq". The standard syntax translations for
7062 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
7065 b) Variables named "plus", "minus", "times", "less", "less_eq"
7066 INCOMPATIBILITY: use more specific names.
7068 c) Permutative equations (e.g. "a + b = b + a")
7069 Since the change of names also changes the order of terms, permutative
7070 rewrite rules may get applied in a different order. Experience shows
7071 that this is rarely the case (only two adaptions in the whole Isabelle
7072 distribution). INCOMPATIBILITY: rewrite proofs
7074 d) ML code directly refering to constant names
7075 This in general only affects hand-written proof tactics, simprocs and
7076 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
7077 Consider using @{const_name} antiquotation.
7079 * New class "default" with associated constant "default".
7081 * Function "sgn" is now overloaded and available on int, real, complex
7082 (and other numeric types), using class "sgn". Two possible defs of
7083 sgn are given as equational assumptions in the classes sgn_if and
7084 sgn_div_norm; ordered_idom now also inherits from sgn_if.
7087 * Locale "partial_order" now unified with class "order" (cf. theory
7088 Orderings), added parameter "less". INCOMPATIBILITY.
7090 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
7091 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
7092 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
7094 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
7095 changed order of proof goals in instance proofs.
7097 * The transitivity reasoner for partial and linear orders is set up
7098 for classes "order" and "linorder". Instances of the reasoner are available
7099 in all contexts importing or interpreting the corresponding locales.
7100 Method "order" invokes the reasoner separately; the reasoner
7101 is also integrated with the Simplifier as a solver. Diagnostic
7102 command 'print_orders' shows the available instances of the reasoner
7103 in the current context.
7105 * Localized monotonicity predicate in theory "Orderings"; integrated
7106 lemmas max_of_mono and min_of_mono with this predicate.
7109 * Formulation of theorem "dense" changed slightly due to integration
7110 with new class dense_linear_order.
7112 * Uniform lattice theory development in HOL.
7114 constants "meet" and "join" now named "inf" and "sup"
7115 constant "Meet" now named "Inf"
7117 classes "meet_semilorder" and "join_semilorder" now named
7118 "lower_semilattice" and "upper_semilattice"
7119 class "lorder" now named "lattice"
7120 class "comp_lat" now named "complete_lattice"
7122 Instantiation of lattice classes allows explicit definitions
7123 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
7125 INCOMPATIBILITY. Theorem renames:
7127 meet_left_le ~> inf_le1
7128 meet_right_le ~> inf_le2
7129 join_left_le ~> sup_ge1
7130 join_right_le ~> sup_ge2
7131 meet_join_le ~> inf_sup_ord
7134 le_meet ~> le_inf_iff
7135 le_join ~> ge_sup_conv
7136 meet_idempotent ~> inf_idem
7137 join_idempotent ~> sup_idem
7138 meet_comm ~> inf_commute
7139 join_comm ~> sup_commute
7140 meet_leI1 ~> le_infI1
7141 meet_leI2 ~> le_infI2
7142 le_joinI1 ~> le_supI1
7143 le_joinI2 ~> le_supI2
7144 meet_assoc ~> inf_assoc
7145 join_assoc ~> sup_assoc
7146 meet_left_comm ~> inf_left_commute
7147 meet_left_idempotent ~> inf_left_idem
7148 join_left_comm ~> sup_left_commute
7149 join_left_idempotent ~> sup_left_idem
7152 le_def_meet ~> le_iff_inf
7153 le_def_join ~> le_iff_sup
7154 join_absorp2 ~> sup_absorb2
7155 join_absorp1 ~> sup_absorb1
7156 meet_absorp1 ~> inf_absorb1
7157 meet_absorp2 ~> inf_absorb2
7158 meet_join_absorp ~> inf_sup_absorb
7159 join_meet_absorp ~> sup_inf_absorb
7160 distrib_join_le ~> distrib_sup_le
7161 distrib_meet_le ~> distrib_inf_le
7163 add_meet_distrib_left ~> add_inf_distrib_left
7164 add_join_distrib_left ~> add_sup_distrib_left
7165 is_join_neg_meet ~> is_join_neg_inf
7166 is_meet_neg_join ~> is_meet_neg_sup
7167 add_meet_distrib_right ~> add_inf_distrib_right
7168 add_join_distrib_right ~> add_sup_distrib_right
7169 add_meet_join_distribs ~> add_sup_inf_distribs
7170 join_eq_neg_meet ~> sup_eq_neg_inf
7171 meet_eq_neg_join ~> inf_eq_neg_sup
7172 add_eq_meet_join ~> add_eq_inf_sup
7173 meet_0_imp_0 ~> inf_0_imp_0
7174 join_0_imp_0 ~> sup_0_imp_0
7175 meet_0_eq_0 ~> inf_0_eq_0
7176 join_0_eq_0 ~> sup_0_eq_0
7177 neg_meet_eq_join ~> neg_inf_eq_sup
7178 neg_join_eq_meet ~> neg_sup_eq_inf
7179 join_eq_if ~> sup_eq_if
7181 mono_meet ~> mono_inf
7182 mono_join ~> mono_sup
7183 meet_bool_eq ~> inf_bool_eq
7184 join_bool_eq ~> sup_bool_eq
7185 meet_fun_eq ~> inf_fun_eq
7186 join_fun_eq ~> sup_fun_eq
7187 meet_set_eq ~> inf_set_eq
7188 join_set_eq ~> sup_set_eq
7189 meet1_iff ~> inf1_iff
7190 meet2_iff ~> inf2_iff
7199 join1_iff ~> sup1_iff
7200 join2_iff ~> sup2_iff
7210 is_meet_Meet ~> is_meet_Inf
7211 Meet_bool_def ~> Inf_bool_def
7212 Meet_fun_def ~> Inf_fun_def
7213 Meet_greatest ~> Inf_greatest
7214 Meet_lower ~> Inf_lower
7215 Meet_set_def ~> Inf_set_def
7218 Sup_bool_eq ~> Sup_bool_def
7219 Sup_fun_eq ~> Sup_fun_def
7220 Sup_set_eq ~> Sup_set_def
7222 listsp_meetI ~> listsp_infI
7223 listsp_meet_eq ~> listsp_inf_eq
7228 * Added syntactic class "size"; overloaded constant "size" now has
7229 type "'a::size ==> bool"
7231 * Internal reorganisation of `size' of datatypes: size theorems
7232 "foo.size" are no longer subsumed by "foo.simps" (but are still
7233 simplification rules by default!); theorems "prod.size" now named
7236 * Class "div" now inherits from class "times" rather than "type".
7239 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
7240 Linorder etc. have disappeared; operations defined in terms of
7241 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
7243 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
7245 * HOL-Word: New extensive library and type for generic, fixed size
7246 machine words, with arithmetic, bit-wise, shifting and rotating
7247 operations, reflection into int, nat, and bool lists, automation for
7248 linear arithmetic (by automatic reflection into nat or int), including
7249 lemmas on overflow and monotonicity. Instantiated to all appropriate
7250 arithmetic type classes, supporting automatic simplification of
7251 numerals on all operations.
7253 * Library/Boolean_Algebra: locales for abstract boolean algebras.
7255 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
7257 * Code generator library theories:
7258 - Code_Integer represents HOL integers by big integer literals in target
7260 - Code_Char represents HOL characters by character literals in target
7262 - Code_Char_chr like Code_Char, but also offers treatment of character
7263 codes; includes Code_Integer.
7264 - Executable_Set allows to generate code for finite sets using lists.
7265 - Executable_Rat implements rational numbers as triples (sign, enumerator,
7267 - Executable_Real implements a subset of real numbers, namly those
7268 representable by rational numbers.
7269 - Efficient_Nat implements natural numbers by integers, which in general will
7270 result in higher efficency; pattern matching with 0/Suc is eliminated;
7271 includes Code_Integer.
7272 - Code_Index provides an additional datatype index which is mapped to
7273 target-language built-in integers.
7274 - Code_Message provides an additional datatype message_string which is isomorphic to
7275 strings; messages are mapped to target-language strings.
7277 * New package for inductive predicates
7279 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
7282 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7283 for z_1 :: U_1 and ... and z_n :: U_m
7285 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7288 with full support for type-inference, rather than
7290 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7292 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7293 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7295 inductive "s z_1 ... z_m"
7297 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7300 For backward compatibility, there is a wrapper allowing inductive
7301 sets to be defined with the new package via
7304 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7305 for z_1 :: U_1 and ... and z_n :: U_m
7307 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
7313 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
7314 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
7315 for z_1 :: U_1 and ... and z_n :: U_m
7317 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
7318 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
7321 if the additional syntax "p ..." is required.
7323 Numerous examples can be found in the subdirectories src/HOL/Auth,
7324 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
7328 - Since declaration and definition of inductive sets or predicates
7329 is no longer separated, abbreviations involving the newly
7330 introduced sets or predicates must be specified together with the
7331 introduction rules after the 'where' keyword (see above), rather
7332 than before the actual inductive definition.
7334 - The variables in induction and elimination rules are now
7335 quantified in the order of their occurrence in the introduction
7336 rules, rather than in alphabetical order. Since this may break
7337 some proofs, these proofs either have to be repaired, e.g. by
7338 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
7339 statements of the form
7341 case (rule_i a_i_1 ... a_i_{k_i})
7343 or the old order of quantification has to be restored by explicitly adding
7344 meta-level quantifiers in the introduction rules, i.e.
7346 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
7348 - The format of the elimination rules is now
7350 p z_1 ... z_m x_1 ... x_n ==>
7351 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7356 (x_1, ..., x_n) : s z_1 ... z_m ==>
7357 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
7360 for sets rather than
7362 x : s z_1 ... z_m ==>
7363 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
7366 This may require terms in goals to be expanded to n-tuples
7367 (e.g. using case_tac or simplification with the split_paired_all
7368 rule) before the above elimination rule is applicable.
7370 - The elimination or case analysis rules for (mutually) inductive
7371 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
7372 list of rules "p_1_..._p_k.elims" is no longer available.
7374 * New package "function"/"fun" for general recursive functions,
7375 supporting mutual and nested recursion, definitions in local contexts,
7376 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
7377 for small examples, and the separate tutorial on the function
7378 package. The old recdef "package" is still available as before, but
7379 users are encouraged to use the new package.
7381 * Method "lexicographic_order" automatically synthesizes termination
7382 relations as lexicographic combinations of size measures.
7384 * Case-expressions allow arbitrary constructor-patterns (including
7385 "_") and take their order into account, like in functional
7386 programming. Internally, this is translated into nested
7387 case-expressions; missing cases are added and mapped to the predefined
7388 constant "undefined". In complicated cases printing may no longer show
7389 the original input but the internal form. Lambda-abstractions allow
7390 the same form of pattern matching: "% pat1 => e1 | ..." is an
7391 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
7394 * IntDef: The constant "int :: nat => int" has been removed; now "int"
7395 is an abbreviation for "of_nat :: nat => int". The simplification
7396 rules for "of_nat" have been changed to work like "int" did
7397 previously. Potential INCOMPATIBILITY:
7398 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
7399 - of_nat_diff and of_nat_mult are no longer default simp rules
7401 * Method "algebra" solves polynomial equations over (semi)rings using
7402 Groebner bases. The (semi)ring structure is defined by locales and the
7403 tool setup depends on that generic context. Installing the method for
7404 a specific type involves instantiating the locale and possibly adding
7405 declarations for computation on the coefficients. The method is
7406 already instantiated for natural numbers and for the axiomatic class
7407 of idoms with numerals. See also the paper by Chaieb and Wenzel at
7408 CALCULEMUS 2007 for the general principles underlying this
7409 architecture of context-aware proof-tools.
7411 * Method "ferrack" implements quantifier elimination over
7412 special-purpose dense linear orders using locales (analogous to
7413 "algebra"). The method is already installed for class
7414 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
7417 * Former constant "List.op @" now named "List.append". Use ML
7418 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
7419 circumvent possible incompatibilities when working on ML level.
7421 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
7423 * New function listsum :: 'a list => 'a for arbitrary monoids.
7424 Special syntax: "SUM x <- xs. f x" (and latex variants)
7426 * New syntax for Haskell-like list comprehension (input only), eg.
7427 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
7429 * The special syntax for function "filter" has changed from [x :
7430 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
7431 comprehension syntax, and for uniformity. INCOMPATIBILITY.
7433 * [a..b] is now defined for arbitrary linear orders. It used to be
7434 defined on nat only, as an abbreviation for [a..<Suc b]
7437 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
7439 * New functions "sorted" and "sort" in src/HOL/List.thy.
7441 * New lemma collection field_simps (an extension of ring_simps) for
7442 manipulating (in)equations involving division. Multiplies with all
7443 denominators that can be proved to be non-zero (in equations) or
7444 positive/negative (in inequations).
7446 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
7447 have been improved and renamed to ring_simps, group_simps and
7448 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
7449 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
7451 * Theory Library/Commutative_Ring: switched from recdef to function
7452 package; constants add, mul, pow now curried. Infix syntax for
7453 algebraic operations.
7455 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
7458 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
7461 * HOL/records: generalised field-update to take a function on the
7462 field rather than the new value: r(|A := x|) is translated to A_update
7463 (K x) r The K-combinator that is internally used is called K_record.
7464 INCOMPATIBILITY: Usage of the plain update functions has to be
7467 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
7468 * x = 0, which are required for a semiring. Richer structures do not
7469 inherit from semiring_0 anymore, because this property is a theorem
7470 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
7471 there is more to prove, but this is mostly trivial.
7473 * Class "recpower" is generalized to arbitrary monoids, not just
7474 commutative semirings. INCOMPATIBILITY: may need to incorporate
7475 commutativity or semiring properties additionally.
7477 * Constant "List.list_all2" in List.thy now uses authentic syntax.
7478 INCOMPATIBILITY: translations containing list_all2 may go wrong,
7479 better use 'abbreviation'.
7481 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
7483 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
7484 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
7485 significant changes for setting up numeral syntax for types:
7486 - New constants Numeral.pred and Numeral.succ instead
7487 of former Numeral.bin_pred and Numeral.bin_succ.
7488 - Use integer operations instead of bin_add, bin_mult and so on.
7489 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
7490 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
7492 See src/HOL/Integ/IntArith.thy for an example setup.
7494 * Command 'normal_form' computes the normal form of a term that may
7495 contain free variables. For example ``normal_form "rev [a, b, c]"''
7496 produces ``[b, c, a]'' (without proof). This command is suitable for
7497 heavy-duty computations because the functions are compiled to ML
7498 first. Correspondingly, a method "normalization" is provided. See
7499 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
7501 * Alternative iff syntax "A <-> B" for equality on bool (with priority
7502 25 like -->); output depends on the "iff" print_mode, the default is
7503 "A = B" (with priority 50).
7505 * Relations less (<) and less_eq (<=) are also available on type bool.
7506 Modified syntax to disallow nesting without explicit parentheses,
7507 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
7510 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
7512 * Relation composition operator "op O" now has precedence 75 and binds
7513 stronger than union and intersection. INCOMPATIBILITY.
7515 * The old set interval syntax "{m..n(}" (and relatives) has been
7516 removed. Use "{m..<n}" (and relatives) instead.
7518 * In the context of the assumption "~(s = t)" the Simplifier rewrites
7519 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
7520 ``declare [[simproc del: neq]]''.
7522 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
7525 * Theorem Cons_eq_map_conv no longer declared as "simp".
7527 * Theorem setsum_mult renamed to setsum_right_distrib.
7529 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
7532 * Reimplemented methods "sat" and "satx", with several improvements:
7533 goals no longer need to be stated as "<prems> ==> False", equivalences
7534 (i.e. "=" on type bool) are handled, variable names of the form
7535 "lit_<n>" are no longer reserved, significant speedup.
7537 * Methods "sat" and "satx" can now replay MiniSat proof traces.
7538 zChaff is still supported as well.
7540 * 'inductive' and 'datatype': provide projections of mutual rules,
7541 bundled as foo_bar.inducts;
7543 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
7546 * Library: moved theory Accessible_Part to main HOL.
7548 * Library: added theory Coinductive_List of potentially infinite lists
7549 as greatest fixed-point.
7551 * Library: added theory AssocList which implements (finite) maps as
7554 * Method "evaluation" solves goals (i.e. a boolean expression)
7555 efficiently by compiling it to ML. The goal is "proved" (via an
7556 oracle) if it evaluates to True.
7558 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
7559 also when invoked by the simplifier. This results in the Simplifier
7560 being more powerful on arithmetic goals. INCOMPATIBILITY.
7561 Configuration option fast_arith_split_limit=0 recovers the old
7564 * Support for hex (0x20) and binary (0b1001) numerals.
7566 * New method: reify eqs (t), where eqs are equations for an
7567 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
7568 parameter, computes a term s::'b and a list xs::'a list and proves the
7569 theorem I xs s = t. This is also known as reification or quoting. The
7570 resulting theorem is applied to the subgoal to substitute t with I xs
7571 s. If t is omitted, the subgoal itself is reified.
7573 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
7574 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
7575 where f is supposed to be a computable function (in the sense of code
7576 generattion). The method uses reify to compute s and xs as above then
7577 applies corr_thm and uses normalization by evaluation to "prove" f s =
7578 r and finally gets the theorem t = r, which is again applied to the
7579 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
7581 * Reflection: Automatic reification now handels binding, an example is
7582 available in src/HOL/ex/ReflectionEx.thy
7584 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
7585 command 'statespace' that is similar to 'record', but introduces an
7586 abstract specification based on the locale infrastructure instead of
7587 HOL types. This leads to extra flexibility in composing state spaces,
7588 in particular multiple inheritance and renaming of components.
7593 * Hyperreal: Functions root and sqrt are now defined on negative real
7594 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
7595 Nonnegativity side conditions have been removed from many lemmas, so
7596 that more subgoals may now be solved by simplification; potential
7599 * Real: new type classes formalize real normed vector spaces and
7600 algebras, using new overloaded constants scaleR :: real => 'a => 'a
7601 and norm :: 'a => real.
7603 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
7604 reals into other types. The overloaded constant Reals :: 'a set is now
7605 defined as range of_real; potential INCOMPATIBILITY.
7607 * Real: proper support for ML code generation, including 'quickcheck'.
7608 Reals are implemented as arbitrary precision rationals.
7610 * Hyperreal: Several constants that previously worked only for the
7611 reals have been generalized, so they now work over arbitrary vector
7612 spaces. Type annotations may need to be added in some cases; potential
7615 Infinitesimal :: ('a::real_normed_vector) star set
7616 HFinite :: ('a::real_normed_vector) star set
7617 HInfinite :: ('a::real_normed_vector) star set
7618 approx :: ('a::real_normed_vector) star => 'a star => bool
7619 monad :: ('a::real_normed_vector) star => 'a star set
7620 galaxy :: ('a::real_normed_vector) star => 'a star set
7621 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
7622 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
7623 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
7624 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
7625 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
7626 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
7627 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
7628 sgn :: 'a::real_normed_vector => 'a
7629 exp :: 'a::{recpower,real_normed_field,banach} => 'a
7631 * Complex: Some complex-specific constants are now abbreviations for
7632 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
7633 hnorm. Other constants have been entirely removed in favor of the
7634 polymorphic versions (INCOMPATIBILITY):
7638 HInfinite <-- CInfinite
7639 Infinitesimal <-- CInfinitesimal
7642 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
7643 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
7644 (ns)deriv <-- (ns)cderiv
7649 * Formalisation of ideals and the quotient construction over rings.
7651 * Order and lattice theory no longer based on records.
7654 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
7655 greatest_closed. INCOMPATIBILITY.
7657 * Method algebra is now set up via an attribute. For examples see
7658 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7659 of algebraic structures.
7661 * Renamed theory CRing to Ring.
7666 * Substantial, yet incomplete support for nominal datatypes (binding
7667 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7668 src/HOL/Nominal/Examples. Prospective users should consult
7669 http://isabelle.in.tum.de/nominal/
7674 * ML basics: just one true type int, which coincides with IntInf.int
7677 * ML within Isar: antiquotations allow to embed statically-checked
7678 formal entities in the source, referring to the context available at
7679 compile-time. For example:
7681 ML {* @{sort "{zero,one}"} *}
7682 ML {* @{typ "'a => 'b"} *}
7683 ML {* @{term "%x. x"} *}
7684 ML {* @{prop "x == y"} *}
7685 ML {* @{ctyp "'a => 'b"} *}
7686 ML {* @{cterm "%x. x"} *}
7687 ML {* @{cprop "x == y"} *}
7688 ML {* @{thm asm_rl} *}
7689 ML {* @{thms asm_rl} *}
7690 ML {* @{type_name c} *}
7691 ML {* @{type_syntax c} *}
7692 ML {* @{const_name c} *}
7693 ML {* @{const_syntax c} *}
7696 ML {* @{theory Pure} *}
7697 ML {* @{theory_ref} *}
7698 ML {* @{theory_ref Pure} *}
7701 ML {* @{clasimpset} *}
7703 The same works for sources being ``used'' within an Isar context.
7705 * ML in Isar: improved error reporting; extra verbosity with
7706 ML_Context.trace enabled.
7708 * Pure/General/table.ML: the join operations now works via exceptions
7709 DUP/SAME instead of type option. This is simpler in simple cases, and
7710 admits slightly more efficient complex applications.
7712 * Pure: 'advanced' translation functions (parse_translation etc.) now
7713 use Context.generic instead of just theory.
7715 * Pure: datatype Context.generic joins theory/Proof.context and
7716 provides some facilities for code that works in either kind of
7717 context, notably GenericDataFun for uniform theory and proof data.
7719 * Pure: simplified internal attribute type, which is now always
7720 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7721 local (Proof.context) attributes have been discontinued, while
7722 minimizing code duplication. Thm.rule_attribute and
7723 Thm.declaration_attribute build canonical attributes; see also structure
7724 Context for further operations on Context.generic, notably
7725 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7726 declarations and definitions.
7728 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7729 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7730 init only required for impure data. INCOMPATIBILITY: empty really need
7731 to be empty (no dependencies on theory content!)
7733 * Pure/kernel: consts certification ignores sort constraints given in
7734 signature declarations. (This information is not relevant to the
7735 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7736 potential INCOMPATIBILITY.
7738 * Pure: axiomatic type classes are now purely definitional, with
7739 explicit proofs of class axioms and super class relations performed
7740 internally. See Pure/axclass.ML for the main internal interfaces --
7741 notably AxClass.define_class supercedes AxClass.add_axclass, and
7742 AxClass.axiomatize_class/classrel/arity supersede
7743 Sign.add_classes/classrel/arities.
7745 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7746 global/local versions on theory vs. Proof.context have been
7747 discontinued; Attrib.syntax and Method.syntax have been adapted
7748 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7749 attributes, methods, etc.
7751 * Pure: several functions of signature "... -> theory -> theory * ..."
7752 have been reoriented to "... -> theory -> ... * theory" in order to
7753 allow natural usage in combination with the ||>, ||>>, |-> and
7754 fold_map combinators.
7756 * Pure: official theorem names (closed derivations) and additional
7757 comments (tags) are now strictly separate. Name hints -- which are
7758 maintained as tags -- may be attached any time without affecting the
7761 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7762 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7763 achieve the old behaviour.
7765 * Pure: the "Goal" constant is now called "prop", supporting a
7766 slightly more general idea of ``protecting'' meta-level rule
7769 * Pure: Logic.(un)varify only works in a global context, which is now
7770 enforced instead of silently assumed. INCOMPATIBILITY, may use
7771 Logic.legacy_(un)varify as temporary workaround.
7773 * Pure: structure Name provides scalable operations for generating
7774 internal variable names, notably Name.variants etc. This replaces
7775 some popular functions from term.ML:
7777 Term.variant -> Name.variant
7778 Term.variantlist -> Name.variant_list
7779 Term.invent_names -> Name.invent_list
7781 Note that low-level renaming rarely occurs in new code -- operations
7782 from structure Variable are used instead (see below).
7784 * Pure: structure Variable provides fundamental operations for proper
7785 treatment of fixed/schematic variables in a context. For example,
7786 Variable.import introduces fixes for schematics of given facts and
7787 Variable.export reverses the effect (up to renaming) -- this replaces
7788 various freeze_thaw operations.
7790 * Pure: structure Goal provides simple interfaces for
7791 init/conclude/finish and tactical prove operations (replacing former
7792 Tactic.prove). Goal.prove is the canonical way to prove results
7793 within a given context; Goal.prove_global is a degraded version for
7794 theory level goals, including a global Drule.standard. Note that
7795 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7796 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7797 in a locale context).
7799 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7800 and type checking (Syntax.check_term etc.), with common combinations
7801 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7802 which are considered legacy and await removal.
7804 * Pure/Syntax: generic interfaces for type unchecking
7805 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7806 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7807 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7808 available for convenience, but refer to the very same operations using
7809 a mere theory instead of a full context.
7811 * Isar: simplified treatment of user-level errors, using exception
7812 ERROR of string uniformly. Function error now merely raises ERROR,
7813 without any side effect on output channels. The Isar toplevel takes
7814 care of proper display of ERROR exceptions. ML code may use plain
7815 handle/can/try; cat_error may be used to concatenate errors like this:
7817 ... handle ERROR msg => cat_error msg "..."
7819 Toplevel ML code (run directly or through the Isar toplevel) may be
7820 embedded into the Isar toplevel with exception display/debug like
7823 Isar.toplevel (fn () => ...)
7825 INCOMPATIBILITY, removed special transform_error facilities, removed
7826 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7827 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7828 -- use plain ERROR instead.
7830 * Isar: theory setup now has type (theory -> theory), instead of a
7831 list. INCOMPATIBILITY, may use #> to compose setup functions.
7833 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7834 ProofContext.debug/verbose flags.
7836 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7837 theory before entering a proof state. Transactions now always see a
7838 quasi-functional intermediate checkpoint, both in interactive and
7841 * Isar: simplified interfaces for outer syntax. Renamed
7842 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7843 OuterSyntax.add_parsers -- this functionality is now included in
7844 OuterSyntax.command etc. INCOMPATIBILITY.
7846 * Simplifier: the simpset of a running simplification process now
7847 contains a proof context (cf. Simplifier.the_context), which is the
7848 very context that the initial simpset has been retrieved from (by
7849 simpset_of/local_simpset_of). Consequently, all plug-in components
7850 (solver, looper etc.) may depend on arbitrary proof data.
7852 * Simplifier.inherit_context inherits the proof context (plus the
7853 local bounds) of the current simplification process; any simproc
7854 etc. that calls the Simplifier recursively should do this! Removed
7855 former Simplifier.inherit_bounds, which is already included here --
7856 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7857 specify an explicit context using Simplifier.context/theory_context.
7859 * Simplifier/Classical Reasoner: more abstract interfaces
7860 change_simpset/claset for modifying the simpset/claset reference of a
7861 theory; raw versions simpset/claset_ref etc. have been discontinued --
7864 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7870 * settings: the default heap location within ISABELLE_HOME_USER now
7871 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7872 Isabelle installations.
7874 * isabelle-process: option -S (secure mode) disables some critical
7875 operations, notably runtime compilation and evaluation of ML source
7878 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7880 * Support for parallel execution, using native multicore support of
7881 Poly/ML 5.1. The theory loader exploits parallelism when processing
7882 independent theories, according to the given theory header
7883 specifications. The maximum number of worker threads is specified via
7884 usedir option -M or the "max-threads" setting in Proof General. A
7885 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7886 to 6 on a 8-core machine. User-code needs to observe certain
7887 guidelines for thread-safe programming, see appendix A in the Isar
7888 Implementation manual.
7892 New in Isabelle2005 (October 2005)
7893 ----------------------------------
7897 * Theory headers: the new header syntax for Isar theories is
7900 imports <theory1> ... <theoryN>
7901 uses <file1> ... <fileM>
7904 where the 'uses' part is optional. The previous syntax
7906 theory <name> = <theory1> + ... + <theoryN>:
7908 will disappear in the next release. Use isatool fixheaders to convert
7909 existing theory files. Note that there is no change in ancient
7910 non-Isar theories now, but these will disappear soon.
7912 * Theory loader: parent theories can now also be referred to via
7913 relative and absolute paths.
7915 * Command 'find_theorems' searches for a list of criteria instead of a
7916 list of constants. Known criteria are: intro, elim, dest, name:string,
7917 simp:term, and any term. Criteria can be preceded by '-' to select
7918 theorems that do not match. Intro, elim, dest select theorems that
7919 match the current goal, name:s selects theorems whose fully qualified
7920 name contain s, and simp:term selects all simplification rules whose
7921 lhs match term. Any other term is interpreted as pattern and selects
7922 all theorems matching the pattern. Available in ProofGeneral under
7923 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7925 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7927 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7928 matching the current goal as introduction rule and not having "HOL."
7929 in their name (i.e. not being defined in theory HOL).
7931 * Command 'thms_containing' has been discontinued in favour of
7932 'find_theorems'; INCOMPATIBILITY.
7934 * Communication with Proof General is now 8bit clean, which means that
7935 Unicode text in UTF-8 encoding may be used within theory texts (both
7936 formal and informal parts). Cf. option -U of the Isabelle Proof
7937 General interface. Here are some simple examples (cf. src/HOL/ex):
7939 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7940 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7942 * Improved efficiency of the Simplifier and, to a lesser degree, the
7943 Classical Reasoner. Typical big applications run around 2 times
7947 *** Document preparation ***
7949 * Commands 'display_drafts' and 'print_drafts' perform simple output
7950 of raw sources. Only those symbols that do not require additional
7951 LaTeX packages (depending on comments in isabellesym.sty) are
7952 displayed properly, everything else is left verbatim. isatool display
7953 and isatool print are used as front ends (these are subject to the
7954 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7956 * Command tags control specific markup of certain regions of text,
7957 notably folding and hiding. Predefined tags include "theory" (for
7958 theory begin and end), "proof" for proof commands, and "ML" for
7959 commands involving ML code; the additional tags "visible" and
7960 "invisible" are unused by default. Users may give explicit tag
7961 specifications in the text, e.g. ''by %invisible (auto)''. The
7962 interpretation of tags is determined by the LaTeX job during document
7963 preparation: see option -V of isatool usedir, or options -n and -t of
7964 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7967 Several document versions may be produced at the same time via isatool
7968 usedir (the generated index.html will link all of them). Typical
7969 specifications include ''-V document=theory,proof,ML'' to present
7970 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7971 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7972 these parts without any formal replacement text. The Isabelle site
7973 default settings produce ''document'' and ''outline'' versions as
7976 * Several new antiquotations:
7978 @{term_type term} prints a term with its type annotated;
7980 @{typeof term} prints the type of a term;
7982 @{const const} is the same as @{term const}, but checks that the
7983 argument is a known logical constant;
7985 @{term_style style term} and @{thm_style style thm} print a term or
7986 theorem applying a "style" to it
7990 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7991 definitions, equations, inequations etc., 'concl' printing only the
7992 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7993 to print the specified premise. TermStyle.add_style provides an ML
7994 interface for introducing further styles. See also the "LaTeX Sugar"
7995 document practical applications. The ML antiquotation prints
7996 type-checked ML expressions verbatim.
7998 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7999 and 'text' support optional locale specification '(in loc)', which
8000 specifies the default context for interpreting antiquotations. For
8001 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
8003 * Option 'locale=NAME' of antiquotations specifies an alternative
8004 context interpreting the subsequent argument. For example: @{thm
8005 [locale=lattice] inf_assoc}.
8007 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
8010 * Proper output of antiquotations for theory commands involving a
8011 proof context (such as 'locale' or 'theorem (in loc) ...').
8013 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
8014 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
8016 * isatool usedir: new option -C (default true) controls whether option
8017 -D should include a copy of the original document directory; -C false
8018 prevents unwanted effects such as copying of administrative CVS data.
8023 * Considerably improved version of 'constdefs' command. Now performs
8024 automatic type-inference of declared constants; additional support for
8025 local structure declarations (cf. locales and HOL records), see also
8026 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
8027 sequential dependencies of definitions within a single 'constdefs'
8028 section; moreover, the declared name needs to be an identifier. If
8029 all fails, consider to fall back on 'consts' and 'defs' separately.
8031 * Improved indexed syntax and implicit structures. First of all,
8032 indexed syntax provides a notational device for subscripted
8033 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
8034 expressions. Secondly, in a local context with structure
8035 declarations, number indexes \<^sub>n or the empty index (default
8036 number 1) refer to a certain fixed variable implicitly; option
8037 show_structs controls printing of implicit structures. Typical
8038 applications of these concepts involve record types and locales.
8040 * New command 'no_syntax' removes grammar declarations (and
8041 translations) resulting from the given syntax specification, which is
8042 interpreted in the same manner as for the 'syntax' command.
8044 * 'Advanced' translation functions (parse_translation etc.) may depend
8045 on the signature of the theory context being presently used for
8046 parsing/printing, see also isar-ref manual.
8048 * Improved 'oracle' command provides a type-safe interface to turn an
8049 ML expression of type theory -> T -> term into a primitive rule of
8050 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
8051 is already included here); see also FOL/ex/IffExample.thy;
8054 * axclass: name space prefix for class "c" is now "c_class" (was "c"
8055 before); "cI" is no longer bound, use "c.intro" instead.
8056 INCOMPATIBILITY. This change avoids clashes of fact bindings for
8057 axclasses vs. locales.
8059 * Improved internal renaming of symbolic identifiers -- attach primes
8060 instead of base 26 numbers.
8062 * New flag show_question_marks controls printing of leading question
8063 marks in schematic variable names.
8065 * In schematic variable names, *any* symbol following \<^isub> or
8066 \<^isup> is now treated as part of the base name. For example, the
8067 following works without printing of awkward ".0" indexes:
8069 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
8072 * Inner syntax includes (*(*nested*) comments*).
8074 * Pretty printer now supports unbreakable blocks, specified in mixfix
8075 annotations as "(00...)".
8077 * Clear separation of logical types and nonterminals, where the latter
8078 may only occur in 'syntax' specifications or type abbreviations.
8079 Before that distinction was only partially implemented via type class
8080 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
8081 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
8082 exotic syntax specifications may require further adaption
8083 (e.g. Cube/Cube.thy).
8085 * Removed obsolete type class "logic", use the top sort {} instead.
8086 Note that non-logical types should be declared as 'nonterminals'
8087 rather than 'types'. INCOMPATIBILITY for new object-logic
8090 * Attributes 'induct' and 'cases': type or set names may now be
8091 locally fixed variables as well.
8093 * Simplifier: can now control the depth to which conditional rewriting
8094 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
8097 * Simplifier: simplification procedures may now take the current
8098 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
8099 interface), which is very useful for calling the Simplifier
8100 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
8101 is gone -- use prems_of_ss on the simpset instead. Moreover, the
8102 low-level mk_simproc no longer applies Logic.varify internally, to
8103 allow for use in a context of fixed variables.
8105 * thin_tac now works even if the assumption being deleted contains !!
8106 or ==>. More generally, erule now works even if the major premise of
8107 the elimination rule contains !! or ==>.
8109 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
8111 * Reorganized bootstrapping of the Pure theories; CPure is now derived
8112 from Pure, which contains all common declarations already. Both
8113 theories are defined via plain Isabelle/Isar .thy files.
8114 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
8115 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
8116 use isatool fixcpure to adapt your theory and ML sources.
8118 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
8119 selections of theorems in named facts via index ranges.
8121 * 'print_theorems': in theory mode, really print the difference
8122 wrt. the last state (works for interactive theory development only),
8123 in proof mode print all local facts (cf. 'print_facts');
8125 * 'hide': option '(open)' hides only base names.
8127 * More efficient treatment of intermediate checkpoints in interactive
8130 * Code generator is now invoked via code_module (incremental code
8131 generation) and code_library (modular code generation, ML structures
8132 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
8133 must be quoted when used as identifiers.
8135 * New 'value' command for reading, evaluating and printing terms using
8136 the code generator. INCOMPATIBILITY: command keyword 'value' must be
8137 quoted when used as identifier.
8142 * New commands for the interpretation of locale expressions in
8143 theories (1), locales (2) and proof contexts (3). These generate
8144 proof obligations from the expression specification. After the
8145 obligations have been discharged, theorems of the expression are added
8146 to the theory, target locale or proof context. The synopsis of the
8147 commands is a follows:
8149 (1) interpretation expr inst
8150 (2) interpretation target < expr
8151 (3) interpret expr inst
8153 Interpretation in theories and proof contexts require a parameter
8154 instantiation of terms from the current context. This is applied to
8155 specifications and theorems of the interpreted expression.
8156 Interpretation in locales only permits parameter renaming through the
8157 locale expression. Interpretation is smart in that interpretations
8158 that are active already do not occur in proof obligations, neither are
8159 instantiated theorems stored in duplicate. Use 'print_interps' to
8160 inspect active interpretations of a particular locale. For details,
8161 see the Isar Reference manual. Examples can be found in
8162 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
8164 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
8165 'interpret' instead.
8167 * New context element 'constrains' for adding type constraints to
8170 * Context expressions: renaming of parameters with syntax
8173 * Locale declaration: 'includes' disallowed.
8175 * Proper static binding of attribute syntax -- i.e. types / terms /
8176 facts mentioned as arguments are always those of the locale definition
8177 context, independently of the context of later invocations. Moreover,
8178 locale operations (renaming and type / term instantiation) are applied
8179 to attribute arguments as expected.
8181 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
8182 actual attributes; rare situations may require Attrib.attribute to
8183 embed those attributes into Attrib.src that lack concrete syntax.
8184 Attribute implementations need to cooperate properly with the static
8185 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
8186 Attrib.XXX_thm etc. already do the right thing without further
8187 intervention. Only unusual applications -- such as "where" or "of"
8188 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
8189 on the context and the facts involved -- may have to assign parsed
8190 values to argument tokens explicitly.
8192 * Changed parameter management in theorem generation for long goal
8193 statements with 'includes'. INCOMPATIBILITY: produces a different
8194 theorem statement in rare situations.
8196 * Locale inspection command 'print_locale' omits notes elements. Use
8197 'print_locale!' to have them included in the output.
8202 * Provers/hypsubst.ML: improved version of the subst method, for
8203 single-step rewriting: it now works in bound variable contexts. New is
8204 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
8205 rewrite a different subterm than the original subst method, which is
8206 still available as 'simplesubst'.
8208 * Provers/quasi.ML: new transitivity reasoners for transitivity only
8211 * Provers/trancl.ML: new transitivity reasoner for transitive and
8212 reflexive-transitive closure of relations.
8214 * Provers/blast.ML: new reference depth_limit to make blast's depth
8215 limit (previously hard-coded with a value of 20) user-definable.
8217 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
8218 is peformed already. Object-logics merely need to finish their
8219 initial simpset configuration as before. INCOMPATIBILITY.
8224 * Symbolic syntax of Hilbert Choice Operator is now as follows:
8227 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
8229 The symbol \<some> is displayed as the alternative epsilon of LaTeX
8230 and x-symbol; use option '-m epsilon' to get it actually printed.
8231 Moreover, the mathematically important symbolic identifier \<epsilon>
8232 becomes available as variable, constant etc. INCOMPATIBILITY,
8234 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
8235 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
8236 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
8237 support corresponding Isar calculations.
8239 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
8242 * theory SetInterval: changed the syntax for open intervals:
8251 The old syntax is still supported but will disappear in the next
8252 release. For conversion use the following Emacs search and replace
8253 patterns (these are not perfect but work quite well):
8255 {)\([^\.]*\)\.\. -> {\1<\.\.}
8256 \.\.\([^(}]*\)(} -> \.\.<\1}
8258 * Theory Commutative_Ring (in Library): method comm_ring for proving
8259 equalities in commutative rings; method 'algebra' provides a generic
8262 * Theory Finite_Set: changed the syntax for 'setsum', summation over
8263 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
8264 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
8267 Some new syntax forms are available:
8269 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
8270 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
8271 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
8272 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
8274 The latter form "\<Sum>x < k. e" used to be based on a separate
8275 function "Summation", which has been discontinued.
8277 * theory Finite_Set: in structured induction proofs, the insert case
8278 is now 'case (insert x F)' instead of the old counterintuitive 'case
8281 * The 'refute' command has been extended to support a much larger
8282 fragment of HOL, including axiomatic type classes, constdefs and
8283 typedefs, inductive datatypes and recursion.
8285 * New tactics 'sat' and 'satx' to prove propositional tautologies.
8286 Requires zChaff with proof generation to be installed. See
8287 HOL/ex/SAT_Examples.thy for examples.
8289 * Datatype induction via method 'induct' now preserves the name of the
8290 induction variable. For example, when proving P(xs::'a list) by
8291 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
8292 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
8293 in unstructured proof scripts.
8295 * Reworked implementation of records. Improved scalability for
8296 records with many fields, avoiding performance problems for type
8297 inference. Records are no longer composed of nested field types, but
8298 of nested extension types. Therefore the record type only grows linear
8299 in the number of extensions and not in the number of fields. The
8300 top-level (users) view on records is preserved. Potential
8301 INCOMPATIBILITY only in strange cases, where the theory depends on the
8302 old record representation. The type generated for a record is called
8303 <record_name>_ext_type.
8305 Flag record_quick_and_dirty_sensitive can be enabled to skip the
8306 proofs triggered by a record definition or a simproc (if
8307 quick_and_dirty is enabled). Definitions of large records can take
8310 New simproc record_upd_simproc for simplification of multiple record
8311 updates enabled by default. Moreover, trivial updates are also
8312 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
8313 occasionally, since simplification is more powerful by default.
8315 * typedef: proper support for polymorphic sets, which contain extra
8316 type-variables in the term.
8318 * Simplifier: automatically reasons about transitivity chains
8319 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
8320 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
8321 old proofs break occasionally as simplification may now solve more
8322 goals than previously.
8324 * Simplifier: converts x <= y into x = y if assumption y <= x is
8325 present. Works for all partial orders (class "order"), in particular
8326 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
8329 * Simplifier: new simproc for "let x = a in f x". If a is a free or
8330 bound variable or a constant then the let is unfolded. Otherwise
8331 first a is simplified to b, and then f b is simplified to g. If
8332 possible we abstract b from g arriving at "let x = b in h x",
8333 otherwise we unfold the let and arrive at g. The simproc can be
8334 enabled/disabled by the reference use_let_simproc. Potential
8335 INCOMPATIBILITY since simplification is more powerful by default.
8337 * Classical reasoning: the meson method now accepts theorems as arguments.
8339 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
8340 jobs to provide advice on the provability of subgoals.
8342 * Theory OrderedGroup and Ring_and_Field: various additions and
8343 improvements to faciliate calculations involving equalities and
8346 The following theorems have been eliminated or modified
8349 abs_eq now named abs_of_nonneg
8350 abs_of_ge_0 now named abs_of_nonneg
8351 abs_minus_eq now named abs_of_nonpos
8352 imp_abs_id now named abs_of_nonneg
8353 imp_abs_neg_id now named abs_of_nonpos
8354 mult_pos now named mult_pos_pos
8355 mult_pos_le now named mult_nonneg_nonneg
8356 mult_pos_neg_le now named mult_nonneg_nonpos
8357 mult_pos_neg2_le now named mult_nonneg_nonpos2
8358 mult_neg now named mult_neg_neg
8359 mult_neg_le now named mult_nonpos_nonpos
8361 * The following lemmas in Ring_and_Field have been added to the simplifier:
8364 not_square_less_zero
8366 The following lemmas have been deleted from Real/RealPow:
8376 * Theory Parity: added rules for simplifying exponents.
8380 The following theorems have been eliminated or modified
8383 list_all_Nil now named list_all.simps(1)
8384 list_all_Cons now named list_all.simps(2)
8385 list_all_conv now named list_all_iff
8386 set_mem_eq now named mem_iff
8388 * Theories SetsAndFunctions and BigO (see HOL/Library) support
8389 asymptotic "big O" calculations. See the notes in BigO.thy.
8394 * Theory RealDef: better support for embedding natural numbers and
8395 integers in the reals.
8397 The following theorems have been eliminated or modified
8400 exp_ge_add_one_self now requires no hypotheses
8401 real_of_int_add reversed direction of equality (use [symmetric])
8402 real_of_int_minus reversed direction of equality (use [symmetric])
8403 real_of_int_diff reversed direction of equality (use [symmetric])
8404 real_of_int_mult reversed direction of equality (use [symmetric])
8406 * Theory RComplete: expanded support for floor and ceiling functions.
8408 * Theory Ln is new, with properties of the natural logarithm
8410 * Hyperreal: There is a new type constructor "star" for making
8411 nonstandard types. The old type names are now type synonyms:
8415 hcomplex = complex star
8417 * Hyperreal: Many groups of similarly-defined constants have been
8418 replaced by polymorphic versions (INCOMPATIBILITY):
8420 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
8422 starset <-- starsetNat, starsetC
8423 *s* <-- *sNat*, *sc*
8424 starset_n <-- starsetNat_n, starsetC_n
8425 *sn* <-- *sNatn*, *scn*
8426 InternalSets <-- InternalNatSets, InternalCSets
8428 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8429 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
8430 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
8431 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
8432 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
8434 * Hyperreal: Many type-specific theorems have been removed in favor of
8435 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
8437 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
8438 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
8439 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
8440 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
8441 right_minus <-- hypreal_add_minus
8442 left_minus <-- {hypreal,hcomplex}_add_minus_left
8443 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
8444 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
8445 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
8446 mult_1_right <-- hcomplex_mult_one_right
8447 mult_zero_left <-- hcomplex_mult_zero_left
8448 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
8449 right_distrib <-- hypnat_add_mult_distrib2
8450 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
8451 right_inverse <-- hypreal_mult_inverse
8452 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
8453 order_refl <-- {hypreal,hypnat}_le_refl
8454 order_trans <-- {hypreal,hypnat}_le_trans
8455 order_antisym <-- {hypreal,hypnat}_le_anti_sym
8456 order_less_le <-- {hypreal,hypnat}_less_le
8457 linorder_linear <-- {hypreal,hypnat}_le_linear
8458 add_left_mono <-- {hypreal,hypnat}_add_left_mono
8459 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
8460 add_nonneg_nonneg <-- hypreal_le_add_order
8462 * Hyperreal: Separate theorems having to do with type-specific
8463 versions of constants have been merged into theorems that apply to the
8464 new polymorphic constants (INCOMPATIBILITY):
8466 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
8467 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
8468 STAR_Un <-- {STAR,NatStar,STARC}_Un
8469 STAR_Int <-- {STAR,NatStar,STARC}_Int
8470 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
8471 STAR_subset <-- {STAR,NatStar,STARC}_subset
8472 STAR_mem <-- {STAR,NatStar,STARC}_mem
8473 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
8474 STAR_diff <-- {STAR,STARC}_diff
8475 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
8476 STARC_hcomplex_of_complex}_image_subset
8477 starset_n_Un <-- starset{Nat,C}_n_Un
8478 starset_n_Int <-- starset{Nat,C}_n_Int
8479 starset_n_Compl <-- starset{Nat,C}_n_Compl
8480 starset_n_diff <-- starset{Nat,C}_n_diff
8481 InternalSets_Un <-- Internal{Nat,C}Sets_Un
8482 InternalSets_Int <-- Internal{Nat,C}Sets_Int
8483 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
8484 InternalSets_diff <-- Internal{Nat,C}Sets_diff
8485 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
8486 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
8487 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
8488 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
8489 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
8490 starfun <-- starfun{Nat,Nat2,C,RC,CR}
8491 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
8492 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
8493 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
8494 starfun_diff <-- starfun{C,RC,CR}_diff
8495 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
8496 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
8497 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
8498 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
8499 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
8500 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
8501 starfun_Id <-- starfunC_Id
8502 starfun_approx <-- starfun{Nat,CR}_approx
8503 starfun_capprox <-- starfun{C,RC}_capprox
8504 starfun_abs <-- starfunNat_rabs
8505 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
8506 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
8507 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
8508 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
8509 starfun_add_capprox <-- starfun{C,RC}_add_capprox
8510 starfun_add_approx <-- starfunCR_add_approx
8511 starfun_inverse_inverse <-- starfunC_inverse_inverse
8512 starfun_divide <-- starfun{C,CR,RC}_divide
8513 starfun_n <-- starfun{Nat,C}_n
8514 starfun_n_mult <-- starfun{Nat,C}_n_mult
8515 starfun_n_add <-- starfun{Nat,C}_n_add
8516 starfun_n_add_minus <-- starfunNat_n_add_minus
8517 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
8518 starfun_n_minus <-- starfun{Nat,C}_n_minus
8519 starfun_n_eq <-- starfun{Nat,C}_n_eq
8521 star_n_add <-- {hypreal,hypnat,hcomplex}_add
8522 star_n_minus <-- {hypreal,hcomplex}_minus
8523 star_n_diff <-- {hypreal,hcomplex}_diff
8524 star_n_mult <-- {hypreal,hcomplex}_mult
8525 star_n_inverse <-- {hypreal,hcomplex}_inverse
8526 star_n_le <-- {hypreal,hypnat}_le
8527 star_n_less <-- {hypreal,hypnat}_less
8528 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
8529 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
8530 star_n_abs <-- hypreal_hrabs
8531 star_n_divide <-- hcomplex_divide
8533 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
8534 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
8535 star_of_diff <-- hypreal_of_real_diff
8536 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
8537 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
8538 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
8539 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
8540 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
8541 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
8542 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
8543 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
8544 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
8545 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
8546 star_of_number_of <-- {hypreal,hcomplex}_number_of
8547 star_of_number_less <-- number_of_less_hypreal_of_real_iff
8548 star_of_number_le <-- number_of_le_hypreal_of_real_iff
8549 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
8550 star_of_less_number <-- hypreal_of_real_less_number_of_iff
8551 star_of_le_number <-- hypreal_of_real_le_number_of_iff
8552 star_of_power <-- hypreal_of_real_power
8553 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
8555 * Hyperreal: new method "transfer" that implements the transfer
8556 principle of nonstandard analysis. With a subgoal that mentions
8557 nonstandard types like "'a star", the command "apply transfer"
8558 replaces it with an equivalent one that mentions only standard types.
8559 To be successful, all free variables must have standard types; non-
8560 standard variables must have explicit universal quantifiers.
8562 * Hyperreal: A theory of Taylor series.
8567 * Discontinued special version of 'constdefs' (which used to support
8568 continuous functions) in favor of the general Pure one with full
8571 * New simplification procedure for solving continuity conditions; it
8572 is much faster on terms with many nested lambda abstractions (cubic
8573 instead of exponential time).
8575 * New syntax for domain package: selector names are now optional.
8576 Parentheses should be omitted unless argument is lazy, for example:
8578 domain 'a stream = cons "'a" (lazy "'a stream")
8580 * New command 'fixrec' for defining recursive functions with pattern
8581 matching; defining multiple functions with mutual recursion is also
8582 supported. Patterns may include the constants cpair, spair, up, sinl,
8583 sinr, or any data constructor defined by the domain package. The given
8584 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
8585 syntax and examples.
8587 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
8588 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
8589 but the proof obligation additionally includes an admissibility
8590 requirement. The packages generate instances of class cpo or pcpo,
8591 with continuity and strictness theorems for Rep and Abs.
8593 * HOLCF: Many theorems have been renamed according to a more standard naming
8594 scheme (INCOMPATIBILITY):
8596 foo_inject: "foo$x = foo$y ==> x = y"
8597 foo_eq: "(foo$x = foo$y) = (x = y)"
8598 foo_less: "(foo$x << foo$y) = (x << y)"
8599 foo_strict: "foo$UU = UU"
8600 foo_defined: "... ==> foo$x ~= UU"
8601 foo_defined_iff: "(foo$x = UU) = (x = UU)"
8606 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
8607 including the First Isomorphism Theorem (on quotienting by the kernel
8610 * ZF/Simplifier: install second copy of type solver that actually
8611 makes use of TC rules declared to Isar proof contexts (or locales);
8612 the old version is still required for ML proof scripts.
8617 * Converted to Isar theory format; use locales instead of axiomatic
8623 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
8626 * Pure/library.ML no longer defines its own option datatype, but uses
8627 that of the SML basis, which has constructors NONE and SOME instead of
8628 None and Some, as well as exception Option.Option instead of OPTION.
8629 The functions the, if_none, is_some, is_none have been adapted
8630 accordingly, while Option.map replaces apsome.
8632 * Pure/library.ML: the exception LIST has been given up in favour of
8633 the standard exceptions Empty and Subscript, as well as
8634 Library.UnequalLengths. Function like Library.hd and Library.tl are
8635 superceded by the standard hd and tl functions etc.
8637 A number of basic list functions are no longer exported to the ML
8638 toplevel, as they are variants of predefined functions. The following
8639 suggests how one can translate existing code:
8641 rev_append xs ys = List.revAppend (xs, ys)
8642 nth_elem (i, xs) = List.nth (xs, i)
8643 last_elem xs = List.last xs
8644 flat xss = List.concat xss
8645 seq fs = List.app fs
8646 partition P xs = List.partition P xs
8647 mapfilter f xs = List.mapPartial f xs
8649 * Pure/library.ML: several combinators for linear functional
8650 transformations, notably reverse application and composition:
8653 (x, y) |-> f f #-> g
8655 * Pure/library.ML: introduced/changed precedence of infix operators:
8657 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8659 infix 3 o oo ooo oooo;
8660 infix 4 ~~ upto downto;
8662 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8665 * Pure/library.ML: natural list combinators fold, fold_rev, and
8666 fold_map support linear functional transformations and nesting. For
8669 fold f [x1, ..., xN] y =
8670 y |> f x1 |> ... |> f xN
8672 (fold o fold) f [xs1, ..., xsN] y =
8673 y |> fold f xs1 |> ... |> fold f xsN
8675 fold f [x1, ..., xN] =
8678 (fold o fold) f [xs1, ..., xsN] =
8679 fold f xs1 #> ... #> fold f xsN
8681 * Pure/library.ML: the following selectors on type 'a option are
8684 the: 'a option -> 'a (*partial*)
8685 these: 'a option -> 'a where 'a = 'b list
8686 the_default: 'a -> 'a option -> 'a
8687 the_list: 'a option -> 'a list
8689 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8690 basic operations for association lists, following natural argument
8691 order; moreover the explicit equality predicate passed here avoids
8692 potentially expensive polymorphic runtime equality checks.
8693 The old functions may be expressed as follows:
8695 assoc = uncurry (AList.lookup (op =))
8696 assocs = these oo AList.lookup (op =)
8697 overwrite = uncurry (AList.update (op =)) o swap
8699 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8701 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8702 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8704 replacing make_keylist and keyfilter (occassionally used)
8707 make_keylist = AList.make
8708 keyfilter = AList.find (op =)
8710 * eq_fst and eq_snd now take explicit equality parameter, thus
8711 avoiding eqtypes. Naive rewrites:
8713 eq_fst = eq_fst (op =)
8714 eq_snd = eq_snd (op =)
8716 * Removed deprecated apl and apr (rarely used).
8719 apl (n, op) =>>= curry op n
8720 apr (op, m) =>>= fn n => op (n, m)
8722 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8723 provides a reasonably efficient light-weight implementation of sets as
8726 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8727 few new operations; existing lookup and update are now curried to
8728 follow natural argument order (for use with fold etc.);
8729 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8731 * Pure/General: output via the Isabelle channels of
8732 writeln/warning/error etc. is now passed through Output.output, with a
8733 hook for arbitrary transformations depending on the print_mode
8734 (cf. Output.add_mode -- the first active mode that provides a output
8735 function wins). Already formatted output may be embedded into further
8736 text via Output.raw; the result of Pretty.string_of/str_of and derived
8737 functions (string_of_term/cterm/thm etc.) is already marked raw to
8738 accommodate easy composition of diagnostic messages etc. Programmers
8739 rarely need to care about Output.output or Output.raw at all, with
8740 some notable exceptions: Output.output is required when bypassing the
8741 standard channels (writeln etc.), or in token translations to produce
8742 properly formatted results; Output.raw is required when capturing
8743 already output material that will eventually be presented to the user
8744 a second time. For the default print mode, both Output.output and
8745 Output.raw have no effect.
8747 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8748 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8749 cumulative results are displayed at the end of a batch session.
8751 * Pure/General: File.sysify_path and File.quote_sysify path have been
8752 replaced by File.platform_path and File.shell_path (with appropriate
8753 hooks). This provides a clean interface for unusual systems where the
8754 internal and external process view of file names are different.
8756 * Pure: more efficient orders for basic syntactic entities: added
8757 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8758 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8759 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8760 orders now -- potential INCOMPATIBILITY for code that depends on a
8761 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8762 Library.sort_strings on result).
8764 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8765 fold_types traverse types/terms from left to right, observing natural
8766 argument order. Supercedes previous foldl_XXX versions, add_frees,
8767 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8769 * Pure: name spaces have been refined, with significant changes of the
8770 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8771 to extern(_table). The plain name entry path is superceded by a
8772 general 'naming' context, which also includes the 'policy' to produce
8773 a fully qualified name and external accesses of a fully qualified
8774 name; NameSpace.extend is superceded by context dependent
8775 Sign.declare_name. Several theory and proof context operations modify
8776 the naming context. Especially note Theory.restore_naming and
8777 ProofContext.restore_naming to get back to a sane state; note that
8778 Theory.add_path is no longer sufficient to recover from
8779 Theory.absolute_path in particular.
8781 * Pure: new flags short_names (default false) and unique_names
8782 (default true) for controlling output of qualified names. If
8783 short_names is set, names are printed unqualified. If unique_names is
8784 reset, the name prefix is reduced to the minimum required to achieve
8785 the original result when interning again, even if there is an overlap
8786 with earlier declarations.
8788 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8789 now 'extend', and 'merge' gets an additional Pretty.pp argument
8790 (useful for printing error messages). INCOMPATIBILITY.
8792 * Pure: major reorganization of the theory context. Type Sign.sg and
8793 Theory.theory are now identified, referring to the universal
8794 Context.theory (see Pure/context.ML). Actual signature and theory
8795 content is managed as theory data. The old code and interfaces were
8796 spread over many files and structures; the new arrangement introduces
8797 considerable INCOMPATIBILITY to gain more clarity:
8799 Context -- theory management operations (name, identity, inclusion,
8800 parents, ancestors, merge, etc.), plus generic theory data;
8802 Sign -- logical signature and syntax operations (declaring consts,
8803 types, etc.), plus certify/read for common entities;
8805 Theory -- logical theory operations (stating axioms, definitions,
8806 oracles), plus a copy of logical signature operations (consts,
8807 types, etc.); also a few basic management operations (Theory.copy,
8810 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8811 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8812 for convenience -- they merely return the theory.
8814 * Pure: type Type.tsig is superceded by theory in most interfaces.
8816 * Pure: the Isar proof context type is already defined early in Pure
8817 as Context.proof (note that ProofContext.context and Proof.context are
8818 aliases, where the latter is the preferred name). This enables other
8819 Isabelle components to refer to that type even before Isar is present.
8821 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8822 typeK, constK, axiomK, oracleK), but provide explicit operations for
8823 any of these kinds. For example, Sign.intern typeK is now
8824 Sign.intern_type, Theory.hide_space Sign.typeK is now
8825 Theory.hide_types. Also note that former
8826 Theory.hide_classes/types/consts are now
8827 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8828 internalize their arguments! INCOMPATIBILITY.
8830 * Pure: get_thm interface (of PureThy and ProofContext) expects
8831 datatype thmref (with constructors Name and NameSelection) instead of
8832 plain string -- INCOMPATIBILITY;
8834 * Pure: cases produced by proof methods specify options, where NONE
8835 means to remove case bindings -- INCOMPATIBILITY in
8838 * Pure: the following operations retrieve axioms or theorems from a
8839 theory node or theory hierarchy, respectively:
8841 Theory.axioms_of: theory -> (string * term) list
8842 Theory.all_axioms_of: theory -> (string * term) list
8843 PureThy.thms_of: theory -> (string * thm) list
8844 PureThy.all_thms_of: theory -> (string * thm) list
8846 * Pure: print_tac now outputs the goal through the trace channel.
8848 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8849 Reference Toplevel.debug (default false) controls detailed printing
8850 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8851 controls execution profiling -- set to 1 for time and 2 for space
8852 (both increase the runtime).
8854 * Isar session: The initial use of ROOT.ML is now always timed,
8855 i.e. the log will show the actual process times, in contrast to the
8856 elapsed wall-clock time that the outer shell wrapper produces.
8858 * Simplifier: improved handling of bound variables (nameless
8859 representation, avoid allocating new strings). Simprocs that invoke
8860 the Simplifier recursively should use Simplifier.inherit_bounds to
8861 avoid local name clashes. Failure to do so produces warnings
8862 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8863 for further details.
8865 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8866 bindings for all theorems stored within a given theory; this may help
8867 in porting non-Isar theories to Isar ones, while keeping ML proof
8868 scripts for the time being.
8870 * ML operator HTML.with_charset specifies the charset begin used for
8871 generated HTML files. For example:
8873 HTML.with_charset "utf-8" use_thy "Hebrew";
8874 HTML.with_charset "utf-8" use_thy "Chinese";
8879 * Allow symlinks to all proper Isabelle executables (Isabelle,
8880 isabelle, isatool etc.).
8882 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8883 isatool doc, isatool mkdir, display_drafts etc.).
8885 * isatool usedir: option -f allows specification of the ML file to be
8886 used by Isabelle; default is ROOT.ML.
8888 * New isatool version outputs the version identifier of the Isabelle
8889 distribution being used.
8891 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8892 (containing Boolean satisfiability problems) into Isabelle/HOL
8897 New in Isabelle2004 (April 2004)
8898 --------------------------------
8902 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8903 Replaces linorder.ML.
8905 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8906 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8907 (\<a>...\<z>), are now considered normal letters, and can therefore
8908 be used anywhere where an ASCII letter (a...zA...Z) has until
8909 now. COMPATIBILITY: This obviously changes the parsing of some
8910 terms, especially where a symbol has been used as a binder, say
8911 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8912 as an identifier. Fix it by inserting a space around former
8913 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8914 existing theory and ML files.
8916 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8918 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8919 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8920 a normal (but invisible) letter. For multiple letter subscripts repeat
8921 \<^isub> like this: x\<^isub>1\<^isub>2.
8923 * Pure: There are now sub-/superscripts that can span more than one
8924 character. Text between \<^bsub> and \<^esub> is set in subscript in
8925 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8926 superscript. The new control characters are not identifier parts.
8928 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8929 content of "..." to the latex file instead of \isacntrl... . The "..."
8930 may consist of any printable characters excluding the end bracket >.
8932 * Pure: Using new Isar command "finalconsts" (or the ML functions
8933 Theory.add_finals or Theory.add_finals_i) it is now possible to
8934 declare constants "final", which prevents their being given a definition
8935 later. It is useful for constants whose behaviour is fixed axiomatically
8936 rather than definitionally, such as the meta-logic connectives.
8938 * Pure: 'instance' now handles general arities with general sorts
8939 (i.e. intersections of classes),
8941 * Presentation: generated HTML now uses a CSS style sheet to make layout
8942 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8943 It can be changed to alter the colors/layout of generated pages.
8948 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8949 cut_tac, subgoal_tac and thin_tac:
8950 - Now understand static (Isar) contexts. As a consequence, users of Isar
8951 locales are no longer forced to write Isar proof scripts.
8952 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8954 - INCOMPATIBILITY: names of variables to be instantiated may no
8955 longer be enclosed in quotes. Instead, precede variable name with `?'.
8956 This is consistent with the instantiation attribute "where".
8958 * Attributes "where" and "of":
8959 - Now take type variables of instantiated theorem into account when reading
8960 the instantiation string. This fixes a bug that caused instantiated
8961 theorems to have too special types in some circumstances.
8962 - "where" permits explicit instantiations of type variables.
8964 * Calculation commands "moreover" and "also" no longer interfere with
8965 current facts ("this"), admitting arbitrary combinations with "then"
8969 - Goal statements involving the context element "includes" no longer
8970 generate theorems with internal delta predicates (those ending on
8971 "_axioms") in the premise.
8972 Resolve particular premise with <locale>.intro to obtain old form.
8973 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8974 specification and "includes" elements in goal statement.
8975 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8976 [intro?] and [elim?] (respectively) by default.
8977 - Experimental command for instantiation of locales in proof contexts:
8978 instantiate <label>[<attrs>]: <loc>
8979 Instantiates locale <loc> and adds all its theorems to the current context
8980 taking into account their attributes. Label and attrs are optional
8981 modifiers, like in theorem declarations. If present, names of
8982 instantiated theorems are qualified with <label>, and the attributes
8983 <attrs> are applied after any attributes these theorems might have already.
8984 If the locale has assumptions, a chained fact of the form
8985 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8986 are derived. The command does not support old-style locales declared
8987 with "locale (open)".
8988 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8990 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8996 * Proof import: new image HOL4 contains the imported library from
8997 the HOL4 system with about 2500 theorems. It is imported by
8998 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8999 can be used like any other Isabelle image. See
9000 HOL/Import/HOL/README for more information.
9003 - Much improved handling of linear and partial orders.
9004 Reasoners for linear and partial orders are set up for type classes
9005 "linorder" and "order" respectively, and are added to the default simpset
9006 as solvers. This means that the simplifier can build transitivity chains
9007 to solve goals from the assumptions.
9008 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
9009 of blast or auto after simplification become unnecessary because the goal
9010 is solved by simplification already.
9012 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
9013 all proved in axiomatic type classes for semirings, rings and fields.
9016 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
9017 now formalized using the Ring_and_Field theory mentioned above.
9018 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
9019 than before, because now they are set up once in a generic manner.
9020 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
9021 Look for the general versions in Ring_and_Field (and Power if they concern
9024 * Type "rat" of the rational numbers is now available in HOL-Complex.
9027 - Record types are now by default printed with their type abbreviation
9028 instead of the list of all field types. This can be configured via
9029 the reference "print_record_type_abbr".
9030 - Simproc "record_upd_simproc" for simplification of multiple updates added
9031 (not enabled by default).
9032 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
9033 EX x. x = sel r to True (not enabled by default).
9034 - Tactic "record_split_simp_tac" to split and simplify records added.
9036 * 'specification' command added, allowing for definition by
9037 specification. There is also an 'ax_specification' command that
9038 introduces the new constants axiomatically.
9040 * arith(_tac) is now able to generate counterexamples for reals as well.
9042 * HOL-Algebra: new locale "ring" for non-commutative rings.
9044 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
9045 definitions, thanks to Sava Krsti\'{c} and John Matthews.
9047 * HOL-Matrix: a first theory for matrices in HOL with an application of
9048 matrix theory to linear programming.
9050 * Unions and Intersections:
9051 The latex output syntax of UN and INT has been changed
9052 from "\Union x \in A. B" to "\Union_{x \in A} B"
9053 i.e. the index formulae has become a subscript.
9054 Similarly for "\Union x. B", and for \Inter instead of \Union.
9056 * Unions and Intersections over Intervals:
9057 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
9058 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
9059 like in normal math, and corresponding versions for < and for intersection.
9061 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
9062 lexicographic dictonary ordering has been added as "lexord".
9064 * ML: the legacy theory structures Int and List have been removed. They had
9065 conflicted with ML Basis Library structures having the same names.
9067 * 'refute' command added to search for (finite) countermodels. Only works
9068 for a fragment of HOL. The installation of an external SAT solver is
9069 highly recommended. See "HOL/Refute.thy" for details.
9071 * 'quickcheck' command: Allows to find counterexamples by evaluating
9072 formulae under an assignment of free variables to random values.
9073 In contrast to 'refute', it can deal with inductive datatypes,
9074 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
9080 * Streams now come with concatenation and are part of the HOLCF image
9084 New in Isabelle2003 (May 2003)
9085 ------------------------------
9089 * Provers/simplifier:
9091 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
9092 Assumptions are now subject to complete mutual simplification,
9093 not just from left to right. The simplifier now preserves
9094 the order of assumptions.
9096 Potential INCOMPATIBILITY:
9098 -- simp sometimes diverges where the old version did
9099 not, e.g. invoking simp on the goal
9101 [| P (f x); y = x; f x = f y |] ==> Q
9103 now gives rise to the infinite reduction sequence
9105 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
9107 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
9110 -- Tactics combining classical reasoner and simplification (such as auto)
9111 are also affected by this change, because many of them rely on
9112 simp. They may sometimes diverge as well or yield a different numbers
9113 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
9114 in case of problems. Sometimes subsequent calls to the classical
9115 reasoner will fail because a preceeding call to the simplifier too
9116 eagerly simplified the goal, e.g. deleted redundant premises.
9118 - The simplifier trace now shows the names of the applied rewrite rules
9120 - You can limit the number of recursive invocations of the simplifier
9121 during conditional rewriting (where the simplifie tries to solve the
9122 conditions before applying the rewrite rule):
9123 ML "simp_depth_limit := n"
9124 where n is an integer. Thus you can force termination where previously
9125 the simplifier would diverge.
9127 - Accepts free variables as head terms in congruence rules. Useful in Isar.
9129 - No longer aborts on failed congruence proof. Instead, the
9130 congruence is ignored.
9132 * Pure: New generic framework for extracting programs from constructive
9133 proofs. See HOL/Extraction.thy for an example instantiation, as well
9134 as HOL/Extraction for some case studies.
9136 * Pure: The main goal of the proof state is no longer shown by default, only
9137 the subgoals. This behaviour is controlled by a new flag.
9138 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
9139 (ML: Proof.show_main_goal).
9141 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
9142 rules whose conclusion matches subgoal 1:
9143 PG menu: Isabelle/Isar -> Show me -> matching rules
9144 The rules are ordered by how closely they match the subgoal.
9145 In particular, rules that solve a subgoal outright are displayed first
9146 (or rather last, the way they are printed).
9147 (ML: ProofGeneral.print_intros())
9149 * Pure: New flag trace_unify_fail causes unification to print
9150 diagnostic information (PG: in trace buffer) when it fails. This is
9151 useful for figuring out why single step proofs like rule, erule or
9154 * Pure: Locale specifications now produce predicate definitions
9155 according to the body of text (covering assumptions modulo local
9156 definitions); predicate "loc_axioms" covers newly introduced text,
9157 while "loc" is cumulative wrt. all included locale expressions; the
9158 latter view is presented only on export into the global theory
9159 context; potential INCOMPATIBILITY, use "(open)" option to fall back
9160 on the old view without predicates;
9162 * Pure: predefined locales "var" and "struct" are useful for sharing
9163 parameters (as in CASL, for example); just specify something like
9164 ``var x + var y + struct M'' as import;
9166 * Pure: improved thms_containing: proper indexing of facts instead of
9167 raw theorems; check validity of results wrt. current name space;
9168 include local facts of proof configuration (also covers active
9169 locales), cover fixed variables in index; may use "_" in term
9170 specification; an optional limit for the number of printed facts may
9171 be given (the default is 40);
9173 * Pure: disallow duplicate fact bindings within new-style theory files
9176 * Provers: improved induct method: assumptions introduced by case
9177 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
9178 the goal statement); "foo" still refers to all facts collectively;
9180 * Provers: the function blast.overloaded has been removed: all constants
9181 are regarded as potentially overloaded, which improves robustness in exchange
9182 for slight decrease in efficiency;
9184 * Provers/linorder: New generic prover for transitivity reasoning over
9185 linear orders. Note: this prover is not efficient!
9187 * Isar: preview of problems to finish 'show' now produce an error
9188 rather than just a warning (in interactive mode);
9195 - Produces a counter example if it cannot prove a goal.
9196 Note that the counter example may be spurious if the goal is not a formula
9197 of quantifier-free linear arithmetic.
9198 In ProofGeneral the counter example appears in the trace buffer.
9200 - Knows about div k and mod k where k is a numeral of type nat or int.
9202 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
9203 linear arithmetic fails. This takes account of quantifiers and divisibility.
9204 Presburger arithmetic can also be called explicitly via presburger(_tac).
9206 * simp's arithmetic capabilities have been enhanced a bit: it now
9207 takes ~= in premises into account (by performing a case split);
9209 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
9210 are distributed over a sum of terms;
9212 * New tactic "trans_tac" and method "trans" instantiate
9213 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
9216 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
9217 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
9219 * 'typedef' command has new option "open" to suppress the set
9222 * functions Min and Max on finite sets have been introduced (theory
9225 * attribute [symmetric] now works for relations as well; it turns
9226 (x,y) : R^-1 into (y,x) : R, and vice versa;
9228 * induct over a !!-quantified statement (say !!x1..xn):
9229 each "case" automatically performs "fix x1 .. xn" with exactly those names.
9231 * Map: `empty' is no longer a constant but a syntactic abbreviation for
9232 %x. None. Warning: empty_def now refers to the previously hidden definition
9235 * Algebra: formalization of classical algebra. Intended as base for
9236 any algebraic development in Isabelle. Currently covers group theory
9237 (up to Sylow's theorem) and ring theory (Universal Property of
9238 Univariate Polynomials). Contributions welcome;
9240 * GroupTheory: deleted, since its material has been moved to Algebra;
9242 * Complex: new directory of the complex numbers with numeric constants,
9243 nonstandard complex numbers, and some complex analysis, standard and
9244 nonstandard (Jacques Fleuriot);
9246 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
9248 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
9251 * Real/HahnBanach: updated and adapted to locales;
9253 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
9256 * UNITY: added the Meier-Sanders theory of progress sets;
9258 * MicroJava: bytecode verifier and lightweight bytecode verifier
9259 as abstract algorithms, instantiated to the JVM;
9261 * Bali: Java source language formalization. Type system, operational
9262 semantics, axiomatic semantics. Supported language features:
9263 classes, interfaces, objects,virtual methods, static methods,
9264 static/instance fields, arrays, access modifiers, definite
9265 assignment, exceptions.
9270 * ZF/Constructible: consistency proof for AC (Gdel's constructible
9273 * Main ZF: virtually all theories converted to new-style format;
9278 * Pure: Tactic.prove provides sane interface for internal proofs;
9279 omits the infamous "standard" operation, so this is more appropriate
9280 than prove_goalw_cterm in many situations (e.g. in simprocs);
9282 * Pure: improved error reporting of simprocs;
9284 * Provers: Simplifier.simproc(_i) provides sane interface for setting
9288 *** Document preparation ***
9290 * uses \par instead of \\ for line breaks in theory text. This may
9291 shift some page breaks in large documents. To get the old behaviour
9292 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
9294 * minimized dependencies of isabelle.sty and isabellesym.sty on
9297 * \<euro> now needs package babel/greek instead of marvosym (which
9300 * normal size for \<zero>...\<nine> (uses \mathbf instead of
9305 New in Isabelle2002 (March 2002)
9306 --------------------------------
9308 *** Document preparation ***
9310 * greatly simplified document preparation setup, including more
9311 graceful interpretation of isatool usedir -i/-d/-D options, and more
9312 instructive isatool mkdir; users should basically be able to get
9313 started with "isatool mkdir HOL Test && isatool make"; alternatively,
9314 users may run a separate document processing stage manually like this:
9315 "isatool usedir -D output HOL Test && isatool document Test/output";
9317 * theory dependency graph may now be incorporated into documents;
9318 isatool usedir -g true will produce session_graph.eps/.pdf for use
9319 with \includegraphics of LaTeX;
9321 * proper spacing of consecutive markup elements, especially text
9322 blocks after section headings;
9324 * support bold style (for single symbols only), input syntax is like
9325 this: "\<^bold>\<alpha>" or "\<^bold>A";
9327 * \<bullet> is now output as bold \cdot by default, which looks much
9328 better in printed text;
9330 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
9331 note that these symbols are currently unavailable in Proof General /
9332 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
9334 * isatool latex no longer depends on changed TEXINPUTS, instead
9335 isatool document copies the Isabelle style files to the target
9341 * Pure/Provers: improved proof by cases and induction;
9342 - 'case' command admits impromptu naming of parameters (such as
9344 - 'induct' method divinates rule instantiation from the inductive
9345 claim; no longer requires excessive ?P bindings for proper
9346 instantiation of cases;
9347 - 'induct' method properly enumerates all possibilities of set/type
9348 rules; as a consequence facts may be also passed through *type*
9349 rules without further ado;
9350 - 'induct' method now derives symbolic cases from the *rulified*
9351 rule (before it used to rulify cases stemming from the internal
9352 atomized version); this means that the context of a non-atomic
9353 statement becomes is included in the hypothesis, avoiding the
9354 slightly cumbersome show "PROP ?case" form;
9355 - 'induct' may now use elim-style induction rules without chaining
9356 facts, using ``missing'' premises from the goal state; this allows
9357 rules stemming from inductive sets to be applied in unstructured
9358 scripts, while still benefitting from proper handling of non-atomic
9359 statements; NB: major inductive premises need to be put first, all
9360 the rest of the goal is passed through the induction;
9361 - 'induct' proper support for mutual induction involving non-atomic
9362 rule statements (uses the new concept of simultaneous goals, see
9364 - append all possible rule selections, but only use the first
9365 success (no backtracking);
9366 - removed obsolete "(simplified)" and "(stripped)" options of methods;
9367 - undeclared rule case names default to numbers 1, 2, 3, ...;
9368 - added 'print_induct_rules' (covered by help item in recent Proof
9370 - moved induct/cases attributes to Pure, methods to Provers;
9371 - generic method setup instantiated for FOL and HOL;
9373 * Pure: support multiple simultaneous goal statements, for example
9374 "have a: A and b: B" (same for 'theorem' etc.); being a pure
9375 meta-level mechanism, this acts as if several individual goals had
9376 been stated separately; in particular common proof methods need to be
9377 repeated in order to cover all claims; note that a single elimination
9378 step is *not* sufficient to establish the two conjunctions, so this
9381 assume "A & B" then have A and B .. (*".." fails*)
9383 better use "obtain" in situations as above; alternative refer to
9384 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
9386 * Pure: proper integration with ``locales''; unlike the original
9387 version by Florian Kammller, Isar locales package high-level proof
9388 contexts rather than raw logical ones (e.g. we admit to include
9389 attributes everywhere); operations on locales include merge and
9390 rename; support for implicit arguments (``structures''); simultaneous
9391 type-inference over imports and text; see also HOL/ex/Locales.thy for
9394 * Pure: the following commands have been ``localized'', supporting a
9395 target locale specification "(in name)": 'lemma', 'theorem',
9396 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
9397 stored both within the locale and at the theory level (exported and
9398 qualified by the locale name);
9400 * Pure: theory goals may now be specified in ``long'' form, with
9401 ad-hoc contexts consisting of arbitrary locale elements. for example
9402 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
9403 definitions may be given, too); the result is a meta-level rule with
9404 the context elements being discharged in the obvious way;
9406 * Pure: new proof command 'using' allows to augment currently used
9407 facts after a goal statement ('using' is syntactically analogous to
9408 'apply', but acts on the goal's facts only); this allows chained facts
9409 to be separated into parts given before and after a claim, as in
9410 ``from a and b have C using d and e <proof>'';
9412 * Pure: renamed "antecedent" case to "rule_context";
9414 * Pure: new 'judgment' command records explicit information about the
9415 object-logic embedding (used by several tools internally); no longer
9416 use hard-wired "Trueprop";
9418 * Pure: added 'corollary' command;
9420 * Pure: fixed 'token_translation' command;
9422 * Pure: removed obsolete 'exported' attribute;
9424 * Pure: dummy pattern "_" in is/let is now automatically lifted over
9425 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
9426 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
9428 * Pure: method 'atomize' presents local goal premises as object-level
9429 statements (atomic meta-level propositions); setup controlled via
9430 rewrite rules declarations of 'atomize' attribute; example
9431 application: 'induct' method with proper rule statements in improper
9434 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
9435 now consider the syntactic context of assumptions, giving a better
9436 chance to get type-inference of the arguments right (this is
9437 especially important for locales);
9439 * Pure: "sorry" no longer requires quick_and_dirty in interactive
9442 * Pure/obtain: the formal conclusion "thesis", being marked as
9443 ``internal'', may no longer be reference directly in the text;
9444 potential INCOMPATIBILITY, may need to use "?thesis" in rare
9447 * Pure: generic 'sym' attribute which declares a rule both as pure
9448 'elim?' and for the 'symmetric' operation;
9450 * Pure: marginal comments ``--'' may now occur just anywhere in the
9451 text; the fixed correlation with particular command syntax has been
9454 * Pure: new method 'rules' is particularly well-suited for proof
9455 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
9456 but often produces more compact proof terms with less detours;
9458 * Pure/Provers/classical: simplified integration with pure rule
9459 attributes and methods; the classical "intro?/elim?/dest?"
9460 declarations coincide with the pure ones; the "rule" method no longer
9461 includes classically swapped intros; "intro" and "elim" methods no
9462 longer pick rules from the context; also got rid of ML declarations
9463 AddXIs/AddXEs/AddXDs; all of this has some potential for
9466 * Provers/classical: attribute 'swapped' produces classical inversions
9467 of introduction rules;
9469 * Provers/simplifier: 'simplified' attribute may refer to explicit
9470 rules instead of full simplifier context; 'iff' attribute handles
9473 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
9475 * HOL: 'recdef' now fails on unfinished automated proofs, use
9476 "(permissive)" option to recover old behavior;
9478 * HOL: 'inductive' no longer features separate (collective) attributes
9479 for 'intros' (was found too confusing);
9481 * HOL: properly declared induction rules less_induct and
9487 * HOL: moved over to sane numeral syntax; the new policy is as
9490 - 0 and 1 are polymorphic constants, which are defined on any
9491 numeric type (nat, int, real etc.);
9493 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
9494 binary representation internally;
9496 - type nat has special constructor Suc, and generally prefers Suc 0
9497 over 1::nat and Suc (Suc 0) over 2::nat;
9499 This change may cause significant problems of INCOMPATIBILITY; here
9500 are some hints on converting existing sources:
9502 - due to the new "num" token, "-0" and "-1" etc. are now atomic
9503 entities, so expressions involving "-" (unary or binary minus) need
9504 to be spaced properly;
9506 - existing occurrences of "1" may need to be constraint "1::nat" or
9507 even replaced by Suc 0; similar for old "2";
9509 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
9511 - remove all special provisions on numerals in proofs;
9513 * HOL: simp rules nat_number expand numerals on nat to Suc/0
9514 representation (depends on bin_arith_simps in the default context);
9516 * HOL: symbolic syntax for x^2 (numeral 2);
9518 * HOL: the class of all HOL types is now called "type" rather than
9519 "term"; INCOMPATIBILITY, need to adapt references to this type class
9520 in axclass/classes, instance/arities, and (usually rare) occurrences
9521 in typings (of consts etc.); internally the class is called
9522 "HOL.type", ML programs should refer to HOLogic.typeS;
9524 * HOL/record package improvements:
9525 - new derived operations "fields" to build a partial record section,
9526 "extend" to promote a fixed record to a record scheme, and
9527 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
9528 declared as simp by default;
9529 - shared operations ("more", "fields", etc.) now need to be always
9530 qualified) --- potential INCOMPATIBILITY;
9531 - removed "make_scheme" operations (use "make" with "extend") --
9533 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
9534 - provides cases/induct rules for use with corresponding Isar
9535 methods (for concrete records, record schemes, concrete more
9536 parts, and schematic more parts -- in that order);
9537 - internal definitions directly based on a light-weight abstract
9538 theory of product types over typedef rather than datatype;
9540 * HOL: generic code generator for generating executable ML code from
9541 specifications; specific support for HOL constructs such as inductive
9542 datatypes and sets, as well as recursive functions; can be invoked
9543 via 'generate_code' theory section;
9545 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
9547 * HOL: consolidated and renamed several theories. In particular:
9548 Ord.thy has been absorbed into HOL.thy
9549 String.thy has been absorbed into List.thy
9551 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
9552 (beware of argument permutation!);
9554 * HOL: linorder_less_split superseded by linorder_cases;
9556 * HOL/List: "nodups" renamed to "distinct";
9558 * HOL: added "The" definite description operator; move Hilbert's "Eps"
9559 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
9560 - Ex_def has changed, now need to use some_eq_ex
9562 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
9563 in this (rare) case use:
9565 delSWrapper "split_all_tac"
9566 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
9568 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
9571 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
9572 Isabelle's type classes, ^ on functions and relations has too general
9573 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
9574 necessary to attach explicit type constraints;
9576 * HOL/Relation: the prefix name of the infix "O" has been changed from
9577 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
9578 renamed accordingly (eg "compI" -> "rel_compI").
9580 * HOL: syntax translations now work properly with numerals and records
9583 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
9584 of "lam" -- INCOMPATIBILITY;
9586 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
9587 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
9588 renamed "Product_Type.unit";
9590 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
9592 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
9593 the "cases" method);
9595 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
9598 * HOL/IMP: updated and converted to new-style theory format; several
9599 parts turned into readable document, with proper Isar proof texts and
9600 some explanations (by Gerwin Klein);
9602 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
9604 * HOL-Hyperreal is now a logic image;
9609 * Isar: consts/constdefs supports mixfix syntax for continuous
9612 * Isar: domain package adapted to new-style theory format, e.g. see
9615 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
9616 potential INCOMPATIBILITY; now use plain induct_tac instead of former
9617 lift.induct_tac, always use UU instead of Undef;
9619 * HOLCF/IMP: updated and converted to new-style theory;
9624 * Isar: proper integration of logic-specific tools and packages,
9625 including theory commands '(co)inductive', '(co)datatype',
9626 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
9627 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
9629 * theory Main no longer includes AC; for the Axiom of Choice, base
9630 your theory on Main_ZFC;
9632 * the integer library now covers quotients and remainders, with many
9633 laws relating division to addition, multiplication, etc.;
9635 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
9636 typeless version of the formalism;
9638 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
9641 * ZF/Induct: new directory for examples of inductive definitions,
9642 including theory Multiset for multiset orderings; converted to
9643 new-style theory format;
9645 * ZF: many new theorems about lists, ordinals, etc.;
9650 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
9651 variable proof controls level of detail: 0 = no proofs (only oracle
9652 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
9653 also ref manual for further ML interfaces;
9655 * Pure/axclass: removed obsolete ML interface
9656 goal_subclass/goal_arity;
9658 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9659 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9660 separate tokens, so expressions involving minus need to be spaced
9663 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9664 rather than "infixl" or "infixr";
9666 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9667 sort constraint specifications in type inference; e.g. "x::_::foo"
9668 ensures that the type of "x" is of sort "foo" (but not necessarily a
9671 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9672 control output of nested => (types); the default behavior is
9675 * Pure/syntax: builtin parse translation for "_constify" turns valued
9676 tokens into AST constants;
9678 * Pure/syntax: prefer later declarations of translations and print
9679 translation functions; potential INCOMPATIBILITY: need to reverse
9680 multiple declarations for same syntax element constant;
9682 * Pure/show_hyps reset by default (in accordance to existing Isar
9685 * Provers/classical: renamed addaltern to addafter, addSaltern to
9688 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9691 * system: tested support for MacOS X; should be able to get Isabelle +
9692 Proof General to work in a plain Terminal after installing Poly/ML
9693 (e.g. from the Isabelle distribution area) and GNU bash alone
9694 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9695 support requires further installations, e.g. from
9696 http://fink.sourceforge.net/);
9698 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9700 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9701 of 40 MB), cf. ML_OPTIONS;
9703 * system: Proof General keywords specification is now part of the
9704 Isabelle distribution (see etc/isar-keywords.el);
9706 * system: support for persistent Proof General sessions (refrain from
9707 outdating all loaded theories on startup); user may create writable
9708 logic images like this: ``isabelle -q HOL Test'';
9710 * system: smart selection of Isabelle process versus Isabelle
9711 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9712 run both "isabelle" and "Isabelle" even if file names are badly
9713 damaged (executable inspects the case of the first letter of its own
9714 name); added separate "isabelle-process" and "isabelle-interface";
9716 * system: refrain from any attempt at filtering input streams; no
9717 longer support ``8bit'' encoding of old isabelle font, instead proper
9718 iso-latin characters may now be used; the related isatools
9719 "symbolinput" and "nonascii" have disappeared as well;
9721 * system: removed old "xterm" interface (the print modes "xterm" and
9722 "xterm_color" are still available for direct use in a suitable
9727 New in Isabelle99-2 (February 2001)
9728 -----------------------------------
9730 *** Overview of INCOMPATIBILITIES ***
9732 * HOL: please note that theories in the Library and elsewhere often use the
9733 new-style (Isar) format; to refer to their theorems in an ML script you must
9734 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9736 * HOL: inductive package no longer splits induction rule aggressively,
9737 but only as far as specified by the introductions given; the old
9738 format may be recovered via ML function complete_split_rule or attribute
9739 'split_rule (complete)';
9741 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9742 gfp_Tarski to gfp_unfold;
9744 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9746 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9747 relation); infix "^^" has been renamed "``"; infix "``" has been
9748 renamed "`"; "univalent" has been renamed "single_valued";
9750 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9753 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9755 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9757 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9758 consequence, it is no longer monotonic wrt. the local goal context
9759 (which is now passed through the inductive cases);
9761 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9762 \<gg> to \<ggreater>;
9765 *** Document preparation ***
9767 * \isabellestyle{NAME} selects version of Isabelle output (currently
9768 available: are "it" for near math-mode best-style output, "sl" for
9769 slanted text style, and "tt" for plain type-writer; if no
9770 \isabellestyle command is given, output is according to slanted
9773 * support sub/super scripts (for single symbols only), input syntax is
9774 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9776 * some more standard symbols; see Appendix A of the system manual for
9777 the complete list of symbols defined in isabellesym.sty;
9779 * improved isabelle style files; more abstract symbol implementation
9780 (should now use \isamath{...} and \isatext{...} in custom symbol
9783 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9784 state; Note that presentation of goal states does not conform to
9785 actual human-readable proof documents. Please do not include goal
9786 states into document output unless you really know what you are doing!
9788 * proper indentation of antiquoted output with proportional LaTeX
9791 * no_document ML operator temporarily disables LaTeX document
9794 * isatool unsymbolize tunes sources for plain ASCII communication;
9799 * Pure: Isar now suffers initial goal statements to contain unbound
9800 schematic variables (this does not conform to actual readable proof
9801 documents, due to unpredictable outcome and non-compositional proof
9802 checking); users who know what they are doing may use schematic goals
9803 for Prolog-style synthesis of proven results;
9805 * Pure: assumption method (an implicit finishing) now handles actual
9808 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9809 initial goal, declare "that" only as Pure intro (only for single
9810 steps); the "that" rule assumption may now be involved in implicit
9811 finishing, thus ".." becomes a feasible for trivial obtains;
9813 * Pure: default proof step now includes 'intro_classes'; thus trivial
9814 instance proofs may be performed by "..";
9816 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9819 * Pure: more robust selection of calculational rules;
9821 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9822 rule (as well as the assumption rule);
9824 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9825 lemmas, using the graph browser tool;
9827 * Pure: predict failure of "show" in interactive mode;
9829 * Pure: 'thms_containing' now takes actual terms as arguments;
9831 * HOL: improved method 'induct' --- now handles non-atomic goals
9832 (potential INCOMPATIBILITY); tuned error handling;
9834 * HOL: cases and induct rules now provide explicit hints about the
9835 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9836 any remaining facts are inserted into the goal verbatim;
9838 * HOL: local contexts (aka cases) may now contain term bindings as
9839 well; the 'cases' and 'induct' methods new provide a ?case binding for
9840 the result to be shown in each case;
9842 * HOL: added 'recdef_tc' command;
9844 * isatool convert assists in eliminating legacy ML scripts;
9849 * HOL/Library: a collection of generic theories to be used together
9850 with main HOL; the theory loader path already includes this directory
9851 by default; the following existing theories have been moved here:
9852 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9853 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9855 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9856 modelling and verification task performed in Isabelle/HOL +
9857 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9859 * HOL/Algebra: special summation operator SUM no longer exists, it has
9860 been replaced by setsum; infix 'assoc' now has priority 50 (like
9861 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9862 'domain', this makes the theory consistent with mathematical
9865 * HOL basics: added overloaded operations "inverse" and "divide"
9866 (infix "/"), syntax for generic "abs" operation, generic summation
9869 * HOL/typedef: simplified package, provide more useful rules (see also
9872 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9873 now expressed as a proper nested rule (old-style tactic scripts may
9874 require atomize_strip_tac to cope with non-atomic premises);
9876 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9877 to "split_conv" (old name still available for compatibility);
9879 * HOL: improved concrete syntax for strings (e.g. allows translation
9880 rules with string literals);
9882 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9883 and Fleuriot's mechanization of analysis, including the transcendental
9884 functions for the reals;
9886 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9891 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9892 "lam" is displayed as TWO lambda-symbols
9894 * CTT: theory Main now available, containing everything (that is, Bool
9900 * Pure: the Simplifier has been implemented properly as a derived rule
9901 outside of the actual kernel (at last!); the overall performance
9902 penalty in practical applications is about 50%, while reliability of
9903 the Isabelle inference kernel has been greatly improved;
9905 * print modes "brackets" and "no_brackets" control output of nested =>
9906 (types) and ==> (props); the default behaviour is "brackets";
9908 * Provers: fast_tac (and friends) now handle actual object-logic rules
9909 as assumptions as well;
9911 * system: support Poly/ML 4.0;
9913 * system: isatool install handles KDE version 1 or 2;
9917 New in Isabelle99-1 (October 2000)
9918 ----------------------------------
9920 *** Overview of INCOMPATIBILITIES ***
9922 * HOL: simplification of natural numbers is much changed; to partly
9923 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9924 issue the following ML commands:
9926 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9927 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9929 * HOL: simplification no longer dives into case-expressions; this is
9930 controlled by "t.weak_case_cong" for each datatype t;
9932 * HOL: nat_less_induct renamed to less_induct;
9934 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9935 fixsome to patch .thy and .ML sources automatically;
9937 select_equality -> some_equality
9938 select_eq_Ex -> some_eq_ex
9939 selectI2EX -> someI2_ex
9942 select1_equality -> some1_equality
9943 Eps_sym_eq -> some_sym_eq_trivial
9944 Eps_eq -> some_eq_trivial
9946 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9948 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9951 * HOL: the recursion equations generated by 'recdef' are now called
9952 f.simps instead of f.rules;
9954 * HOL: qed_spec_mp now also handles bounded ALL as well;
9956 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9957 sometimes be needed;
9959 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9961 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9963 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9964 product is now "<*>" instead of "Times"; the lexicographic product is
9965 now "<*lex*>" instead of "**";
9967 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9968 of main HOL, but was unused); better use HOL's datatype package;
9970 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9971 the old syntax may be recovered as follows:
9974 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9975 (infixl "\\<oplus>" 100)
9977 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9979 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9980 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9983 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9984 changed from A/r to A//r;
9986 * ZF: new treatment of arithmetic (nat & int) may break some old
9989 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9990 rulify -> rule_format, elimify -> elim_format, ...);
9992 * Isar/Provers: intro/elim/dest attributes changed; renamed
9993 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9994 should have to change intro!! to intro? only); replaced "delrule" by
9997 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9999 * Provers: strengthened force_tac by using new first_best_tac;
10001 * LaTeX document preparation: several changes of isabelle.sty (see
10005 *** Document preparation ***
10007 * formal comments (text blocks etc.) in new-style theories may now
10008 contain antiquotations of thm/prop/term/typ/text to be presented
10009 according to latex print mode; concrete syntax is like this:
10010 @{term[show_types] "f(x) = a + x"};
10012 * isatool mkdir provides easy setup of Isabelle session directories,
10013 including proper document sources;
10015 * generated LaTeX sources are now deleted after successful run
10016 (isatool document -c); may retain a copy somewhere else via -D option
10019 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
10020 style files, achieving self-contained LaTeX sources and simplifying
10023 * old-style theories now produce (crude) LaTeX output as well;
10025 * browser info session directories are now self-contained (may be put
10026 on WWW server seperately); improved graphs of nested sessions; removed
10027 graph for 'all sessions';
10029 * several improvements in isabelle style files; \isabellestyle{it}
10030 produces fake math mode output; \isamarkupheader is now \section by
10031 default; see lib/texinputs/isabelle.sty etc.;
10036 * Isar/Pure: local results and corresponding term bindings are now
10037 subject to Hindley-Milner polymorphism (similar to ML); this
10038 accommodates incremental type-inference very nicely;
10040 * Isar/Pure: new derived language element 'obtain' supports
10041 generalized existence reasoning;
10043 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
10044 support accumulation of results, without applying any rules yet;
10045 useful to collect intermediate results without explicit name
10046 references, and for use with transitivity rules with more than 2
10049 * Isar/Pure: scalable support for case-analysis type proofs: new
10050 'case' language element refers to local contexts symbolically, as
10051 produced by certain proof methods; internally, case names are attached
10052 to theorems as "tags";
10054 * Isar/Pure: theory command 'hide' removes declarations from
10055 class/type/const name spaces;
10057 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
10058 indicate potential overloading;
10060 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
10062 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
10063 "{a,b,c}" instead of {a,b,c};
10065 * Isar/Pure now provides its own version of intro/elim/dest
10066 attributes; useful for building new logics, but beware of confusion
10067 with the version in Provers/classical;
10069 * Isar/Pure: the local context of (non-atomic) goals is provided via
10070 case name 'antecedent';
10072 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
10073 to the current context is now done automatically);
10075 * Isar/Pure: theory command 'method_setup' provides a simple interface
10076 for definining proof methods in ML;
10078 * Isar/Provers: intro/elim/dest attributes changed; renamed
10079 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
10080 most cases, one should have to change intro!! to intro? only);
10081 replaced "delrule" by "rule del";
10083 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
10084 'symmetric' attribute (the latter supercedes [RS sym]);
10086 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
10087 method modifier); 'simp' method: 'only:' modifier removes loopers as
10088 well (including splits);
10090 * Isar/Provers: Simplifier and Classical methods now support all kind
10091 of modifiers used in the past, including 'cong', 'iff', etc.
10093 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
10094 of Simplifier and Classical reasoner);
10096 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
10097 now support named cases; major packages (inductive, datatype, primrec,
10098 recdef) support case names and properly name parameters;
10100 * Isar/HOL: new transitivity rules for substitution in inequalities --
10101 monotonicity conditions are extracted to be proven at end of
10104 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
10107 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
10108 split_if split_if_asm; datatype package provides theorems foo.splits =
10109 foo.split foo.split_asm for each datatype;
10111 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
10112 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
10113 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
10114 use "(cases (simplified))" method in proper proof texts);
10116 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
10118 * Isar: names of theorems etc. may be natural numbers as well;
10120 * Isar: 'pr' command: optional arguments for goals_limit and
10121 ProofContext.prems_limit; no longer prints theory contexts, but only
10124 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
10125 additional print modes to be specified; e.g. "pr(latex)" will print
10126 proof state according to the Isabelle LaTeX style;
10128 * Isar: improved support for emulating tactic scripts, including proof
10129 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
10130 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
10131 (for HOL datatypes);
10133 * Isar: simplified (more robust) goal selection of proof methods: 1st
10134 goal, all goals, or explicit goal specifier (tactic emulation); thus
10135 'proof method scripts' have to be in depth-first order;
10137 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
10139 * Isar: removed 'help' command, which hasn't been too helpful anyway;
10140 should instead use individual commands for printing items
10141 (print_commands, print_methods etc.);
10143 * Isar: added 'nothing' --- the empty list of theorems;
10148 * HOL/MicroJava: formalization of a fragment of Java, together with a
10149 corresponding virtual machine and a specification of its bytecode
10150 verifier and a lightweight bytecode verifier, including proofs of
10151 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
10152 Cornelia Pusch (see also the homepage of project Bali at
10153 http://isabelle.in.tum.de/Bali/);
10155 * HOL/Algebra: new theory of rings and univariate polynomials, by
10158 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
10159 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
10162 * HOL/Lattice: fundamental concepts of lattice theory and order
10163 structures, including duals, properties of bounds versus algebraic
10164 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
10165 Theorem for complete lattices etc.; may also serve as a demonstration
10166 for abstract algebraic reasoning using axiomatic type classes, and
10167 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
10169 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
10172 * HOL/IMPP: extension of IMP with local variables and mutually
10173 recursive procedures, by David von Oheimb;
10175 * HOL/Lambda: converted into new-style theory and document;
10177 * HOL/ex/Multiquote: example of multiple nested quotations and
10178 anti-quotations -- basically a generalized version of de-Bruijn
10179 representation; very useful in avoiding lifting of operations;
10181 * HOL/record: added general record equality rule to simpset; fixed
10182 select-update simplification procedure to handle extended records as
10183 well; admit "r" as field name;
10185 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
10186 other numeric types and also as the identity of groups, rings, etc.;
10188 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
10189 Types nat and int belong to this axclass;
10191 * HOL: greatly improved simplification involving numerals of type nat, int, real:
10192 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
10193 i*j + k + j*#3*i simplifies to #4*(i*j) + k
10194 two terms #m*u and #n*u are replaced by #(m+n)*u
10195 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
10196 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
10197 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
10199 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
10200 powerful prover for predicate logic but knows nothing of clasets; see
10201 ex/mesontest.ML and ex/mesontest2.ML for example applications;
10203 * HOL: new version of "case_tac" subsumes both boolean case split and
10204 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
10205 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
10207 * HOL: simplification no longer dives into case-expressions: only the
10208 selector expression is simplified, but not the remaining arms; to
10209 enable full simplification of case-expressions for datatype t, you may
10210 remove t.weak_case_cong from the simpset, either globally (Delcongs
10211 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
10213 * HOL/recdef: the recursion equations generated by 'recdef' for
10214 function 'f' are now called f.simps instead of f.rules; if all
10215 termination conditions are proved automatically, these simplification
10216 rules are added to the simpset, as in primrec; rules may be named
10217 individually as well, resulting in a separate list of theorems for
10220 * HOL/While is a new theory that provides a while-combinator. It
10221 permits the definition of tail-recursive functions without the
10222 provision of a termination measure. The latter is necessary once the
10223 invariant proof rule for while is applied.
10225 * HOL: new (overloaded) notation for the set of elements below/above
10226 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
10228 * HOL: theorems impI, allI, ballI bound as "strip";
10230 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
10231 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
10232 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
10234 * HOL/Real: "rabs" replaced by overloaded "abs" function;
10236 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
10237 main HOL, but was unused);
10239 * HOL: fewer consts declared as global (e.g. have to refer to
10240 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
10242 * HOL: tuned AST representation of nested pairs, avoiding bogus output
10243 in case of overlap with user translations (e.g. judgements over
10244 tuples); (note that the underlying logical represenation is still
10250 * ZF: simplification automatically cancels common terms in arithmetic
10251 expressions over nat and int;
10253 * ZF: new treatment of nat to minimize type-checking: all operators
10254 coerce their operands to a natural number using the function natify,
10255 making the algebraic laws unconditional;
10257 * ZF: as above, for int: operators coerce their operands to an integer
10258 using the function intify;
10260 * ZF: the integer library now contains many of the usual laws for the
10261 orderings, including $<=, and monotonicity laws for $+ and $*;
10263 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
10266 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
10267 to the simplifier and classical reasoner simultaneously;
10272 * Provers: blast_tac now handles actual object-logic rules as
10273 assumptions; note that auto_tac uses blast_tac internally as well;
10275 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
10276 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
10278 * Provers: delrules now handles destruct rules as well (no longer need
10279 explicit make_elim);
10281 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
10282 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10283 use instead the strong form,
10284 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
10285 in HOL, FOL and ZF the function cla_make_elim will create such rules
10286 from destruct-rules;
10288 * Provers: Simplifier.easy_setup provides a fast path to basic
10289 Simplifier setup for new object-logics;
10291 * Pure: AST translation rules no longer require constant head on LHS;
10293 * Pure: improved name spaces: ambiguous output is qualified; support
10294 for hiding of names;
10296 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
10297 XSYMBOL_HOME; no longer need to do manual configuration in most
10300 * system: compression of ML heaps images may now be controlled via -c
10301 option of isabelle and isatool usedir (currently only observed by
10304 * system: isatool installfonts may handle X-Symbol fonts as well (very
10305 useful for remote X11);
10307 * system: provide TAGS file for Isabelle sources;
10309 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
10312 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
10313 timing flag supersedes proof_timing and Toplevel.trace;
10315 * ML: new combinators |>> and |>>> for incremental transformations
10316 with secondary results (e.g. certain theory extensions):
10318 * ML: PureThy.add_defs gets additional argument to indicate potential
10319 overloading (usually false);
10321 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
10326 New in Isabelle99 (October 1999)
10327 --------------------------------
10329 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10331 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
10332 are no longer simplified. (This allows the simplifier to unfold recursive
10333 functional programs.) To restore the old behaviour, declare
10335 Delcongs [if_weak_cong];
10337 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
10340 * HOL: the predicate "inj" is now defined by translation to "inj_on";
10342 * HOL/datatype: mutual_induct_tac no longer exists --
10343 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
10345 * HOL/typedef: fixed type inference for representing set; type
10346 arguments now have to occur explicitly on the rhs as type constraints;
10348 * ZF: The con_defs part of an inductive definition may no longer refer
10349 to constants declared in the same theory;
10351 * HOL, ZF: the function mk_cases, generated by the inductive
10352 definition package, has lost an argument. To simplify its result, it
10353 uses the default simpset instead of a supplied list of theorems.
10355 * HOL/List: the constructors of type list are now Nil and Cons;
10357 * Simplifier: the type of the infix ML functions
10358 setSSolver addSSolver setSolver addSolver
10359 is now simpset * solver -> simpset where `solver' is a new abstract type
10360 for packaging solvers. A solver is created via
10361 mk_solver: string -> (thm list -> int -> tactic) -> solver
10362 where the string argument is only a comment.
10365 *** Proof tools ***
10367 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
10368 decision procedure for linear arithmetic. Currently it is used for
10369 types `nat', `int', and `real' in HOL (see below); it can, should and
10370 will be instantiated for other types and logics as well.
10372 * The simplifier now accepts rewrite rules with flexible heads, eg
10373 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
10374 They are applied like any rule with a non-pattern lhs, i.e. by first-order
10380 * New Isabelle/Isar subsystem provides an alternative to traditional
10381 tactical theorem proving; together with the ProofGeneral/isar user
10382 interface it offers an interactive environment for developing human
10383 readable proof documents (Isar == Intelligible semi-automated
10384 reasoning); for further information see isatool doc isar-ref,
10385 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
10387 * improved and simplified presentation of theories: better HTML markup
10388 (including colors), graph views in several sizes; isatool usedir now
10389 provides a proper interface for user theories (via -P option); actual
10390 document preparation based on (PDF)LaTeX is available as well (for
10391 new-style theories only); see isatool doc system for more information;
10393 * native support for Proof General, both for classic Isabelle and
10396 * ML function thm_deps visualizes dependencies of theorems and lemmas,
10397 using the graph browser tool;
10399 * Isabelle manuals now also available as PDF;
10401 * theory loader rewritten from scratch (may not be fully
10402 bug-compatible); old loadpath variable has been replaced by show_path,
10403 add_path, del_path, reset_path functions; new operations such as
10404 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
10407 * improved isatool install: option -k creates KDE application icon,
10408 option -p DIR installs standalone binaries;
10410 * added ML_PLATFORM setting (useful for cross-platform installations);
10411 more robust handling of platform specific ML images for SML/NJ;
10413 * the settings environment is now statically scoped, i.e. it is never
10414 created again in sub-processes invoked from isabelle, isatool, or
10417 * path element specification '~~' refers to '$ISABELLE_HOME';
10419 * in locales, the "assumes" and "defines" parts may be omitted if
10422 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
10425 * new print_mode "HTML";
10427 * new flag show_tags controls display of tags of theorems (which are
10428 basically just comments that may be attached by some tools);
10430 * Isamode 2.6 requires patch to accomodate change of Isabelle font
10431 mode and goal output format:
10433 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
10435 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
10437 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
10438 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
10440 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
10442 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
10444 * function bind_thms stores lists of theorems (cf. bind_thm);
10446 * new shorthand tactics ftac, eatac, datac, fatac;
10448 * qed (and friends) now accept "" as result name; in that case the
10449 theorem is not stored, but proper checks and presentation of the
10450 result still apply;
10452 * theorem database now also indexes constants "Trueprop", "all",
10453 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
10458 ** HOL arithmetic **
10460 * There are now decision procedures for linear arithmetic over nat and
10463 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
10464 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
10465 are treated as atomic; subformulae not involving type `nat' or `int'
10466 are ignored; quantified subformulae are ignored unless they are
10467 positive universal or negative existential. The tactic has to be
10468 invoked by hand and can be a little bit slow. In particular, the
10469 running time is exponential in the number of occurrences of `min' and
10470 `max', and `-' on `nat'.
10472 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
10473 (negated) (in)equalities among the premises and the conclusion into
10474 account (i.e. no compound formulae) and does not know about `min' and
10475 `max', and `-' on `nat'. It is fast and is used automatically by the
10478 NB: At the moment, these decision procedures do not cope with mixed
10479 nat/int formulae where the two parts interact, such as `m < n ==>
10482 * HOL/Numeral provides a generic theory of numerals (encoded
10483 efficiently as bit strings); setup for types nat/int/real is in place;
10484 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
10485 int, existing theories and proof scripts may require a few additional
10488 * integer division and remainder can now be performed on constant
10491 * many properties of integer multiplication, division and remainder
10494 * An interface to the Stanford Validity Checker (SVC) is available through the
10495 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
10496 are proved automatically. SVC must be installed separately, and its results
10497 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
10498 invocation of the underlying oracle). For SVC see
10499 http://verify.stanford.edu/SVC
10501 * IsaMakefile: the HOL-Real target now builds an actual image;
10506 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
10507 (in Isabelle/Isar) -- by Gertrud Bauer;
10509 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
10510 analysis for assembly languages with subtypes;
10512 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
10513 -- avoids syntactic ambiguities and treats state, transition, and
10514 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
10515 changed syntax and (many) tactics;
10517 * HOL/inductive: Now also handles more general introduction rules such
10518 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
10519 theorems are now maintained within the theory (maintained via the
10522 * HOL/datatype: Now also handles arbitrarily branching datatypes
10523 (using function types) such as
10525 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
10527 * HOL/record: record_simproc (part of the default simpset) takes care
10528 of selectors applied to updated records; record_split_tac is no longer
10529 part of the default claset; update_defs may now be removed from the
10530 simpset in many cases; COMPATIBILITY: old behavior achieved by
10532 claset_ref () := claset() addSWrapper record_split_wrapper;
10533 Delsimprocs [record_simproc]
10535 * HOL/typedef: fixed type inference for representing set; type
10536 arguments now have to occur explicitly on the rhs as type constraints;
10538 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
10539 names rather than an ML expression;
10541 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
10542 supplied later. Program schemes can be defined, such as
10543 "While B C s = (if B s then While B C (C s) else s)"
10544 where the well-founded relation can be chosen after B and C have been given.
10546 * HOL/List: the constructors of type list are now Nil and Cons;
10547 INCOMPATIBILITY: while [] and infix # syntax is still there, of
10548 course, ML tools referring to List.list.op # etc. have to be adapted;
10550 * HOL_quantifiers flag superseded by "HOL" print mode, which is
10551 disabled by default; run isabelle with option -m HOL to get back to
10552 the original Gordon/HOL-style output;
10554 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
10555 ALL x<=y. P, EX x<y. P, EX x<=y. P;
10557 * HOL basic syntax simplified (more orthogonal): all variants of
10558 All/Ex now support plain / symbolic / HOL notation; plain syntax for
10559 Eps operator is provided as well: "SOME x. P[x]";
10561 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
10563 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
10564 thus available for user theories;
10566 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
10567 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
10570 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
10571 several times and then mp;
10576 * the notation <<...>> is now available as a notation for sequences of
10579 * the simplifier is now installed
10581 * the axiom system has been generalized (thanks to Soren Heilmann)
10583 * the classical reasoner now has a default rule database
10588 * new primrec section allows primitive recursive functions to be given
10589 directly (as in HOL) over datatypes and the natural numbers;
10591 * new tactics induct_tac and exhaust_tac for induction (or case
10592 analysis) over datatypes and the natural numbers;
10594 * the datatype declaration of type T now defines the recursor T_rec;
10596 * simplification automatically does freeness reasoning for datatype
10599 * automatic type-inference, with AddTCs command to insert new
10600 type-checking rules;
10602 * datatype introduction rules are now added as Safe Introduction rules
10605 * the syntax "if P then x else y" is now available in addition to
10609 *** Internal programming interfaces ***
10611 * tuned simplifier trace output; new flag debug_simp;
10613 * structures Vartab / Termtab (instances of TableFun) offer efficient
10614 tables indexed by indexname_ord / term_ord (compatible with aconv);
10616 * AxClass.axclass_tac lost the theory argument;
10618 * tuned current_goals_markers semantics: begin / end goal avoids
10619 printing empty lines;
10621 * removed prs and prs_fn hook, which was broken because it did not
10622 include \n in its semantics, forcing writeln to add one
10623 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
10624 string -> unit if you really want to output text without newline;
10626 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
10627 plain output, interface builders may have to enable 'isabelle_font'
10628 mode to get Isabelle font glyphs as before;
10630 * refined token_translation interface; INCOMPATIBILITY: output length
10631 now of type real instead of int;
10633 * theory loader actions may be traced via new ThyInfo.add_hook
10634 interface (see src/Pure/Thy/thy_info.ML); example application: keep
10635 your own database of information attached to *whole* theories -- as
10636 opposed to intra-theory data slots offered via TheoryDataFun;
10638 * proper handling of dangling sort hypotheses (at last!);
10639 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
10640 extra sort hypotheses that can be witnessed from the type signature;
10641 the force_strip_shyps flag is gone, any remaining shyps are simply
10642 left in the theorem (with a warning issued by strip_shyps_warning);
10646 New in Isabelle98-1 (October 1998)
10647 ----------------------------------
10649 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10651 * several changes of automated proof tools;
10653 * HOL: major changes to the inductive and datatype packages, including
10654 some minor incompatibilities of theory syntax;
10656 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10659 * HOL: removed duplicate thms in Arith:
10660 less_imp_add_less should be replaced by trans_less_add1
10661 le_imp_add_le should be replaced by trans_le_add1
10663 * HOL: unary minus is now overloaded (new type constraints may be
10666 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10667 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10668 now taken as an integer constant.
10670 * Pure: ML function 'theory_of' renamed to 'theory';
10673 *** Proof tools ***
10676 1. Asm_full_simp_tac is now more aggressive.
10677 1. It will sometimes reorient premises if that increases their power to
10679 2. It does no longer proceed strictly from left to right but may also
10680 rotate premises to achieve further simplification.
10681 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10682 old Asm_full_simp_tac in that it does not rotate premises.
10683 2. The simplifier now knows a little bit about nat-arithmetic.
10685 * Classical reasoner: wrapper mechanism for the classical reasoner now
10686 allows for selected deletion of wrappers, by introduction of names for
10687 wrapper functionals. This implies that addbefore, addSbefore,
10688 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10689 and that adding two tactics with the same name overwrites the first
10690 one (emitting a warning).
10691 type wrapper = (int -> tactic) -> (int -> tactic)
10692 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10693 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10694 delWrapper, delSWrapper: claset * string -> claset
10695 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10697 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10698 semantics; addbefore now affects only the unsafe part of step_tac
10699 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10700 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10703 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10704 compWrapper; added safe wrapper (and access functions for it);
10706 * HOL/split_all_tac is now much faster and fails if there is nothing
10707 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10708 and the names of the automatically generated variables have changed.
10709 split_all_tac has moved within claset() from unsafe wrappers to safe
10710 wrappers, which means that !!-bound variables are split much more
10711 aggressively, and safe_tac and clarify_tac now split such variables.
10712 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10713 Note: the same holds for record_split_tac, which does the job of
10714 split_all_tac for record fields.
10716 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10717 permanently to the default simpset using Addsplits just like
10718 Addsimps. They can be removed via Delsplits just like
10719 Delsimps. Lower-case versions are also available.
10721 * HOL/Simplifier: The rule split_if is now part of the default
10722 simpset. This means that the simplifier will eliminate all occurrences
10723 of if-then-else in the conclusion of a goal. To prevent this, you can
10724 either remove split_if completely from the default simpset by
10725 `Delsplits [split_if]' or remove it in a specific call of the
10726 simplifier using `... delsplits [split_if]'. You can also add/delete
10727 other case splitting rules to/from the default simpset: every datatype
10728 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10729 t is the name of the datatype).
10731 * Classical reasoner / Simplifier combination: new force_tac (and
10732 derivatives Force_tac, force) combines rewriting and classical
10733 reasoning (and whatever other tools) similarly to auto_tac, but is
10734 aimed to solve the given subgoal completely.
10739 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10740 and `goalw': the theory is no longer needed as an explicit argument -
10741 the current theory context is used; assumptions are no longer returned
10742 at the ML-level unless one of them starts with ==> or !!; it is
10743 recommended to convert to these new commands using isatool fixgoal
10744 (backup your sources first!);
10746 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10747 the current theory context, and 'theory' to lookup stored theories;
10749 * new theory section 'locale' for declaring constants, assumptions and
10750 definitions that have local scope;
10752 * new theory section 'nonterminals' for purely syntactic types;
10754 * new theory section 'setup' for generic ML setup functions
10755 (e.g. package initialization);
10757 * the distribution now includes Isabelle icons: see
10758 lib/logo/isabelle-{small,tiny}.xpm;
10760 * isatool install - install binaries with absolute references to
10763 * isatool logo -- create instances of the Isabelle logo (as EPS);
10765 * print mode 'emacs' reserved for Isamode;
10767 * support multiple print (ast) translations per constant name;
10769 * theorems involving oracles are now printed with a suffixed [!];
10774 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10776 * HOL/inductive package reorganized and improved: now supports mutual
10777 definitions such as
10782 oddI "n : EVEN ==> Suc n : ODD"
10783 evenI "n : ODD ==> Suc n : EVEN"
10785 new theorem list "elims" contains an elimination rule for each of the
10786 recursive sets; inductive definitions now handle disjunctive premises
10787 correctly (also ZF);
10789 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10790 "mutual_induct" no longer exists - the induction rule is always
10791 contained in "induct";
10794 * HOL/datatype package re-implemented and greatly improved: now
10795 supports mutually recursive datatypes such as
10798 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10799 | SUM ('a aexp) ('a aexp)
10800 | DIFF ('a aexp) ('a aexp)
10803 'a bexp = LESS ('a aexp) ('a aexp)
10804 | AND ('a bexp) ('a bexp)
10805 | OR ('a bexp) ('a bexp)
10807 as well as indirectly recursive datatypes such as
10810 ('a, 'b) term = Var 'a
10811 | App 'b ((('a, 'b) term) list)
10813 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10814 induction on mutually / indirectly recursive datatypes.
10816 Primrec equations are now stored in theory and can be accessed via
10817 <function_name>.simps.
10821 - Theories using datatypes must now have theory Datatype as an
10823 - The specific <typename>.induct_tac no longer exists - use the
10824 generic induct_tac instead.
10825 - natE has been renamed to nat.exhaust - use exhaust_tac
10826 instead of res_inst_tac ... natE. Note that the variable
10827 names in nat.exhaust differ from the names in natE, this
10828 may cause some "fragile" proofs to fail.
10829 - The theorems split_<typename>_case and split_<typename>_case_asm
10830 have been renamed to <typename>.split and <typename>.split_asm.
10831 - Since default sorts of type variables are now handled correctly,
10832 some datatype definitions may have to be annotated with explicit
10834 - Primrec definitions no longer require function name and type
10835 of recursive argument.
10837 Consider using isatool fixdatatype to adapt your theories and proof
10838 scripts to the new package (backup your sources first!).
10841 * HOL/record package: considerably improved implementation; now
10842 includes concrete syntax for record types, terms, updates; theorems
10843 for surjective pairing and splitting !!-bound record variables; proof
10844 support is as follows:
10846 1) standard conversions (selectors or updates applied to record
10847 constructor terms) are part of the standard simpset;
10849 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10850 made part of standard simpset and claset via addIffs;
10852 3) a tactic for record field splitting (record_split_tac) is part of
10853 the standard claset (addSWrapper);
10855 To get a better idea about these rules you may retrieve them via
10856 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10857 the name of your record type.
10859 The split tactic 3) conceptually simplifies by the following rule:
10861 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10863 Thus any record variable that is bound by meta-all will automatically
10864 blow up into some record constructor term, consequently the
10865 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10866 solve record problems automatically.
10869 * reorganized the main HOL image: HOL/Integ and String loaded by
10870 default; theory Main includes everything;
10872 * automatic simplification of integer sums and comparisons, using cancellation;
10874 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10876 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10878 * many new identities for unions, intersections, set difference, etc.;
10880 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10881 called split_if, split_split, split_sum_case and split_nat_case (to go
10882 with add/delsplits);
10884 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10885 (?x::unit) = (); this is made part of the default simpset, which COULD
10886 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10887 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10888 unit_abs_eta_conv is added in order to counter the effect of
10889 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10892 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10895 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10896 It and 'sym RS equals0D' are now in the default claset, giving automatic
10897 disjointness reasoning but breaking a few old proofs.
10899 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10900 to 'converse' from 'inverse' (for compatibility with ZF and some
10903 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10904 the well-founded relation;
10906 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10907 Compl A. The "Compl" syntax remains available as input syntax for this
10910 * HOL/Update: new theory of function updates:
10911 f(a:=b) == %x. if x=a then b else f x
10912 may also be iterated as in f(a:=b,c:=d,...);
10914 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10917 - new function list_update written xs[i:=v] that updates the i-th
10918 list position. May also be iterated as in xs[i:=a,j:=b,...].
10919 - new function `upt' written [i..j(] which generates the list
10920 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10921 bound write [i..j], which is a shorthand for [i..j+1(].
10922 - new lexicographic orderings and corresponding wellfoundedness theorems.
10925 - removed 'pred' (predecessor) function;
10926 - generalized some theorems about n-1;
10927 - many new laws about "div" and "mod";
10928 - new laws about greatest common divisors (see theory ex/Primes);
10930 * HOL/Relation: renamed the relational operator r^-1 "converse"
10931 instead of "inverse";
10933 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10934 of the multiset ordering;
10936 * directory HOL/Real: a construction of the reals using Dedekind cuts
10937 (not included by default);
10939 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10941 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10942 programs, i.e. different program variables may have different types.
10944 * calling (stac rew i) now fails if "rew" has no effect on the goal
10945 [previously, this check worked only if the rewrite rule was unconditional]
10946 Now rew can involve either definitions or equalities (either == or =).
10951 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10952 only the theorems proved on ZF.ML;
10954 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10955 It and 'sym RS equals0D' are now in the default claset, giving automatic
10956 disjointness reasoning but breaking a few old proofs.
10958 * ZF/Update: new theory of function updates
10959 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10960 may also be iterated as in f(a:=b,c:=d,...);
10962 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10964 * calling (stac rew i) now fails if "rew" has no effect on the goal
10965 [previously, this check worked only if the rewrite rule was unconditional]
10966 Now rew can involve either definitions or equalities (either == or =).
10968 * case_tac provided for compatibility with HOL
10969 (like the old excluded_middle_tac, but with subgoals swapped)
10972 *** Internal programming interfaces ***
10974 * Pure: several new basic modules made available for general use, see
10975 also src/Pure/README;
10977 * improved the theory data mechanism to support encapsulation (data
10978 kind name replaced by private Object.kind, acting as authorization
10979 key); new type-safe user interface via functor TheoryDataFun; generic
10980 print_data function becomes basically useless;
10982 * removed global_names compatibility flag -- all theory declarations
10983 are qualified by default;
10985 * module Pure/Syntax now offers quote / antiquote translation
10986 functions (useful for Hoare logic etc. with implicit dependencies);
10987 see HOL/ex/Antiquote for an example use;
10989 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10992 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10995 * Display.print_goals function moved to Locale.print_goals;
10997 * standard print function for goals supports current_goals_markers
10998 variable for marking begin of proof, end of proof, start of goal; the
10999 default is ("", "", ""); setting current_goals_markers := ("<proof>",
11000 "</proof>", "<goal>") causes SGML like tagged proof state printing,
11005 New in Isabelle98 (January 1998)
11006 --------------------------------
11008 *** Overview of INCOMPATIBILITIES (see below for more details) ***
11010 * changed lexical syntax of terms / types: dots made part of long
11011 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
11013 * simpset (and claset) reference variable replaced by functions
11014 simpset / simpset_ref;
11016 * no longer supports theory aliases (via merge) and non-trivial
11017 implicit merge of thms' signatures;
11019 * most internal names of constants changed due to qualified names;
11021 * changed Pure/Sequence interface (see Pure/seq.ML);
11024 *** General Changes ***
11026 * hierachically structured name spaces (for consts, types, axms, thms
11027 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
11028 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
11029 isatool fixdots ensures space after dots (e.g. "%x. x"); set
11030 long_names for fully qualified output names; NOTE: ML programs
11031 (special tactics, packages etc.) referring to internal names may have
11032 to be adapted to cope with fully qualified names; in case of severe
11033 backward campatibility problems try setting 'global_names' at compile
11034 time to have enrything declared within a flat name space; one may also
11035 fine tune name declarations in theories via the 'global' and 'local'
11038 * reimplemented the implicit simpset and claset using the new anytype
11039 data filed in signatures; references simpset:simpset ref etc. are
11040 replaced by functions simpset:unit->simpset and
11041 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
11042 to patch your ML files accordingly;
11044 * HTML output now includes theory graph data for display with Java
11045 applet or isatool browser; data generated automatically via isatool
11046 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
11048 * defs may now be conditional; improved rewrite_goals_tac to handle
11049 conditional equations;
11051 * defs now admits additional type arguments, using TYPE('a) syntax;
11053 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
11054 creates a new theory node; implicit merge of thms' signatures is
11055 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
11056 transfer:theory->thm->thm in (rare) cases;
11058 * improved handling of draft signatures / theories; draft thms (and
11059 ctyps, cterms) are automatically promoted to real ones;
11061 * slightly changed interfaces for oracles: admit many per theory, named
11062 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
11064 * print_goals: optional output of const types (set show_consts and
11067 * improved output of warnings (###) and errors (***);
11069 * subgoal_tac displays a warning if the new subgoal has type variables;
11071 * removed old README and Makefiles;
11073 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
11075 * removed obsolete init_pps and init_database;
11077 * deleted the obsolete tactical STATE, which was declared by
11078 fun STATE tacfun st = tacfun st st;
11080 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
11081 (which abbreviates $HOME);
11083 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
11084 use isatool fixseq to adapt your ML programs (this works for fully
11085 qualified references to the Sequence structure only!);
11087 * use_thy no longer requires writable current directory; it always
11088 reloads .ML *and* .thy file, if either one is out of date;
11091 *** Classical Reasoner ***
11093 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
11094 tactics that use classical reasoning to simplify a subgoal without
11095 splitting it into several subgoals;
11097 * Safe_tac: like safe_tac but uses the default claset;
11102 * added simplification meta rules:
11103 (asm_)(full_)simplify: simpset -> thm -> thm;
11105 * simplifier.ML no longer part of Pure -- has to be loaded by object
11108 * added prems argument to simplification procedures;
11110 * HOL, FOL, ZF: added infix function `addsplits':
11111 instead of `<simpset> setloop (split_tac <thms>)'
11112 you can simply write `<simpset> addsplits <thms>'
11117 * TYPE('a) syntax for type reflection terms;
11119 * no longer handles consts with name "" -- declare as 'syntax' instead;
11121 * pretty printer: changed order of mixfix annotation preference (again!);
11123 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
11128 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
11129 with `addloop' of the simplifier to faciliate case splitting in premises.
11131 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
11133 * HOL/Auth: new protocol proofs including some for the Internet
11136 * HOL/Map: new theory of `maps' a la VDM;
11138 * HOL/simplifier: simplification procedures nat_cancel_sums for
11139 cancelling out common nat summands from =, <, <= (in)equalities, or
11140 differences; simplification procedures nat_cancel_factor for
11141 cancelling common factor from =, <, <= (in)equalities over natural
11142 sums; nat_cancel contains both kinds of procedures, it is installed by
11143 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
11145 * HOL/simplifier: terms of the form
11146 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
11148 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
11149 and those of the form
11150 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
11152 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
11155 Each datatype `t' now comes with a theorem `split_t_case' of the form
11157 P(t_case f1 ... fn x) =
11158 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
11160 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
11163 and a theorem `split_t_case_asm' of the form
11165 P(t_case f1 ... fn x) =
11166 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
11168 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
11170 which can be added to a simpset via `addsplits'. The existing theorems
11171 expand_list_case and expand_option_case have been renamed to
11172 split_list_case and split_option_case.
11175 - `pred n' is automatically converted to `n-1'.
11176 Users are strongly encouraged not to use `pred' any longer,
11177 because it will disappear altogether at some point.
11178 - Users are strongly encouraged to write "0 < n" rather than
11179 "n ~= 0". Theorems and proof tools have been modified towards this
11183 the function "set_of_list" has been renamed "set" (and its theorems too);
11184 the function "nth" now takes its arguments in the reverse order and
11185 has acquired the infix notation "!" as in "xs!n".
11187 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
11189 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
11190 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
11192 * HOL/record: extensible records with schematic structural subtyping
11193 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
11194 still lacks various theorems and concrete record syntax;
11199 * removed "axioms" and "generated by" sections;
11201 * replaced "ops" section by extended "consts" section, which is capable of
11202 handling the continuous function space "->" directly;
11205 . proves theorems immediately and stores them in the theory,
11206 . creates hierachical name space,
11207 . now uses normal mixfix annotations (instead of cinfix...),
11208 . minor changes to some names and values (for consistency),
11209 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
11210 . separator between mutual domain defs: changed "," to "and",
11211 . improved handling of sort constraints; now they have to
11212 appear on the left-hand side of the equations only;
11214 * fixed LAM <x,y,zs>.b syntax;
11216 * added extended adm_tac to simplifier in HOLCF -- can now discharge
11217 adm (%x. P (t x)), where P is chainfinite and t continuous;
11222 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
11223 with `addloop' of the simplifier to faciliate case splitting in premises.
11225 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
11226 in HOL, they strip ALL and --> from proved theorems;
11230 New in Isabelle94-8 (May 1997)
11231 ------------------------------
11233 *** General Changes ***
11235 * new utilities to build / run / maintain Isabelle etc. (in parts
11236 still somewhat experimental); old Makefiles etc. still functional;
11238 * new 'Isabelle System Manual';
11240 * INSTALL text, together with ./configure and ./build scripts;
11242 * reimplemented type inference for greater efficiency, better error
11243 messages and clean internal interface;
11245 * prlim command for dealing with lots of subgoals (an easier way of
11246 setting goals_limit);
11251 * supports alternative (named) syntax tables (parser and pretty
11252 printer); internal interface is provided by add_modesyntax(_i);
11254 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
11255 be used in conjunction with the Isabelle symbol font; uses the
11256 "symbols" syntax table;
11258 * added token_translation interface (may translate name tokens in
11259 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
11260 the current print_mode); IMPORTANT: user print translation functions
11261 are responsible for marking newly introduced bounds
11262 (Syntax.mark_boundT);
11264 * token translations for modes "xterm" and "xterm_color" that display
11265 names in bold, underline etc. or colors (which requires a color
11268 * infixes may now be declared with names independent of their syntax;
11270 * added typed_print_translation (like print_translation, but may
11271 access type of constant);
11274 *** Classical Reasoner ***
11276 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
11277 some limitations. Blast_tac...
11278 + ignores addss, addbefore, addafter; this restriction is intrinsic
11279 + ignores elimination rules that don't have the correct format
11280 (the conclusion MUST be a formula variable)
11281 + ignores types, which can make HOL proofs fail
11282 + rules must not require higher-order unification, e.g. apply_type in ZF
11283 [message "Function Var's argument not a bound variable" relates to this]
11284 + its proof strategy is more general but can actually be slower
11286 * substitution with equality assumptions no longer permutes other
11289 * minor changes in semantics of addafter (now called addaltern); renamed
11290 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
11291 (and access functions for it);
11293 * improved combination of classical reasoner and simplifier:
11294 + functions for handling clasimpsets
11295 + improvement of addss: now the simplifier is called _after_ the
11297 + safe variant of addss called addSss: uses safe simplifications
11298 _during_ the safe steps. It is more complete as it allows multiple
11299 instantiations of unknowns (e.g. with slow_tac).
11303 * added interface for simplification procedures (functions that
11304 produce *proven* rewrite rules on the fly, depending on current
11307 * ordering on terms as parameter (used for ordered rewriting);
11309 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
11311 * the solver is now split into a safe and an unsafe part.
11312 This should be invisible for the normal user, except that the
11313 functions setsolver and addsolver have been renamed to setSolver and
11314 addSolver; added safe_asm_full_simp_tac;
11319 * a generic induction tactic `induct_tac' which works for all datatypes and
11320 also for type `nat';
11322 * a generic case distinction tactic `exhaust_tac' which works for all
11323 datatypes and also for type `nat';
11325 * each datatype comes with a function `size';
11327 * patterns in case expressions allow tuple patterns as arguments to
11328 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
11330 * primrec now also works with type nat;
11332 * recdef: a new declaration form, allows general recursive functions to be
11333 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
11335 * the constant for negation has been renamed from "not" to "Not" to
11336 harmonize with FOL, ZF, LK, etc.;
11338 * HOL/ex/LFilter theory of a corecursive "filter" functional for
11341 * HOL/Modelcheck demonstrates invocation of model checker oracle;
11343 * HOL/ex/Ring.thy declares cring_simp, which solves equational
11344 problems in commutative rings, using axiomatic type classes for + and *;
11346 * more examples in HOL/MiniML and HOL/Auth;
11348 * more default rewrite rules for quantifiers, union/intersection;
11350 * a new constant `arbitrary == @x.False';
11352 * HOLCF/IOA replaces old HOL/IOA;
11354 * HOLCF changes: derived all rules and arities
11355 + axiomatic type classes instead of classes
11356 + typedef instead of faking type definitions
11357 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
11358 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
11359 + eliminated the types void, one, tr
11360 + use unit lift and bool lift (with translations) instead of one and tr
11361 + eliminated blift from Lift3.thy (use Def instead of blift)
11362 all eliminated rules are derived as theorems --> no visible changes ;
11367 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
11368 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
11369 as ZF_cs addSIs [equalityI];
11373 New in Isabelle94-7 (November 96)
11374 ---------------------------------
11376 * allowing negative levels (as offsets) in prlev and choplev;
11378 * super-linear speedup for large simplifications;
11380 * FOL, ZF and HOL now use miniscoping: rewriting pushes
11381 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
11382 FAIL); can suppress it using the command Delsimps (ex_simps @
11383 all_simps); De Morgan laws are also now included, by default;
11385 * improved printing of ==> : ~:
11387 * new object-logic "Sequents" adds linear logic, while replacing LK
11388 and Modal (thanks to Sara Kalvala);
11390 * HOL/Auth: correctness proofs for authentication protocols;
11392 * HOL: new auto_tac combines rewriting and classical reasoning (many
11393 examples on HOL/Auth);
11395 * HOL: new command AddIffs for declaring theorems of the form P=Q to
11396 the rewriter and classical reasoner simultaneously;
11398 * function uresult no longer returns theorems in "standard" format;
11399 regain previous version by: val uresult = standard o uresult;
11403 New in Isabelle94-6
11404 -------------------
11406 * oracles -- these establish an interface between Isabelle and trusted
11407 external reasoners, which may deliver results as theorems;
11409 * proof objects (in particular record all uses of oracles);
11411 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
11413 * "constdefs" section in theory files;
11415 * "primrec" section (HOL) no longer requires names;
11417 * internal type "tactic" now simply "thm -> thm Sequence.seq";
11421 New in Isabelle94-5
11422 -------------------
11424 * reduced space requirements;
11426 * automatic HTML generation from theories;
11428 * theory files no longer require "..." (quotes) around most types;
11430 * new examples, including two proofs of the Church-Rosser theorem;
11432 * non-curried (1994) version of HOL is no longer distributed;
11436 New in Isabelle94-4
11437 -------------------
11439 * greatly reduced space requirements;
11441 * theory files (.thy) no longer require \...\ escapes at line breaks;
11443 * searchable theorem database (see the section "Retrieving theorems" on
11444 page 8 of the Reference Manual);
11446 * new examples, including Grabczewski's monumental case study of the
11449 * The previous version of HOL renamed to Old_HOL;
11451 * The new version of HOL (previously called CHOL) uses a curried syntax
11452 for functions. Application looks like f a b instead of f(a,b);
11454 * Mutually recursive inductive definitions finally work in HOL;
11456 * In ZF, pattern-matching on tuples is now available in all abstractions and
11457 translates to the operator "split";
11461 New in Isabelle94-3
11462 -------------------
11464 * new infix operator, addss, allowing the classical reasoner to
11465 perform simplification at each step of its search. Example:
11466 fast_tac (cs addss ss)
11468 * a new logic, CHOL, the same as HOL, but with a curried syntax
11469 for functions. Application looks like f a b instead of f(a,b). Also pairs
11470 look like (a,b) instead of <a,b>;
11472 * PLEASE NOTE: CHOL will eventually replace HOL!
11474 * In CHOL, pattern-matching on tuples is now available in all abstractions.
11475 It translates to the operator "split". A new theory of integers is available;
11477 * In ZF, integer numerals now denote two's-complement binary integers.
11478 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
11480 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
11481 of the Axiom of Choice;
11485 New in Isabelle94-2
11486 -------------------
11488 * Significantly faster resolution;
11490 * the different sections in a .thy file can now be mixed and repeated
11493 * Database of theorems for FOL, HOL and ZF. New
11494 commands including qed, qed_goal and bind_thm store theorems in the database.
11496 * Simple database queries: return a named theorem (get_thm) or all theorems of
11497 a given theory (thms_of), or find out what theory a theorem was proved in
11500 * Bugs fixed in the inductive definition and datatype packages;
11502 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
11503 and HOL_dup_cs obsolete;
11505 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
11508 * Simpler definition of function space in ZF;
11510 * new results about cardinal and ordinal arithmetic in ZF;
11512 * 'subtype' facility in HOL for introducing new types as subsets of existing
11515 :mode=isabelle-news:wrap=hard:maxLineLen=72: