1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2011-1 (October 2011)
5 ------------------------------------
9 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
10 "isabelle jedit" on the command line.
12 - Management of multiple theory files directly from the editor
13 buffer store -- bypassing the file-system (no requirement to save
16 - Markup of formal entities within the text buffer, with semantic
17 highlighting, tooltips and hyperlinks to jump to defining source
20 - Improved text rendering, with sub/superscripts in the source
21 buffer (including support for copy/paste wrt. output panel, HTML
22 theory output and other non-Isabelle text boxes).
24 - Refined scheduling of proof checking and printing of results,
25 based on interactive editor view. (Note: jEdit folding and
26 narrowing allows to restrict buffer perspectives explicitly.)
28 - Reduced CPU performance requirements, usable on machines with few
31 - Reduced memory requirements due to pruning of unused document
32 versions (garbage collection).
34 See also ~~/src/Tools/jEdit/README.html for further information,
35 including some remaining limitations.
37 * Theory loader: source files are exclusively located via the master
38 directory of each theory node (where the .thy file itself resides).
39 The global load path (such as src/HOL/Library) has been discontinued.
40 Note that the path element ~~ may be used to reference theories in the
41 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
44 * Theory loader: source files are identified by content via SHA1
45 digests. Discontinued former path/modtime identification and optional
46 ISABELLE_FILE_IDENT plugin scripts.
48 * Parallelization of nested Isar proofs is subject to
49 Goal.parallel_proofs_threshold (default 100). See also isabelle
52 * Discontinued support for Poly/ML 5.2, which was the last version
53 without proper multithreading and TimeLimit implementation.
55 * Discontinued old lib/scripts/polyml-platform, which has been
56 obsolete since Isabelle2009-2.
58 * Various optional external tools are referenced more robustly and
59 uniformly by explicit Isabelle settings as follows:
61 ISABELLE_CSDP (formerly CSDP_EXE)
62 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
63 ISABELLE_OCAML (formerly EXEC_OCAML)
64 ISABELLE_SWIPL (formerly EXEC_SWIPL)
65 ISABELLE_YAP (formerly EXEC_YAP)
67 Note that automated detection from the file-system or search path has
68 been discontinued. INCOMPATIBILITY.
70 * Name space: former unsynchronized references are now proper
71 configuration options, with more conventional names:
73 long_names ~> names_long
74 short_names ~> names_short
75 unique_names ~> names_unique
77 Minor INCOMPATIBILITY, need to declare options in context like this:
79 declare [[names_unique = false]]
81 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
82 that the result needs to be unique, which means fact specifications
83 may have to be refined after enriching a proof context.
85 * Attribute "case_names" has been refined: the assumptions in each case
86 can be named now by following the case name with [name1 name2 ...].
88 * Isabelle/Isar reference manual provides more formal references in
94 * Theory Library/Saturated provides type of numbers with saturated
97 * Theory Library/Product_Lattice defines a pointwise ordering for the
98 product type 'a * 'b, and provides instance proofs for various order
99 and lattice type classes.
101 * Theory Library/Countable now provides the "countable_datatype" proof
102 method for proving "countable" class instances for datatypes.
104 * Classes bot and top require underlying partial order rather than
105 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
107 * Class complete_lattice: generalized a couple of lemmas from sets;
108 generalized theorems INF_cong and SUP_cong. New type classes for
109 complete boolean algebras and complete linear orders. Lemmas
110 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
111 class complete_linorder.
113 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
114 Sup_fun_def, Inf_apply, Sup_apply.
116 Redundant lemmas Inf_singleton, Sup_singleton, Inf_binary, Sup_binary,
117 INF_eq, SUP_eq, INF_UNIV_range, SUP_UNIV_range, Int_eq_Inter,
118 INTER_eq_Inter_image, Inter_def, INT_eq, Un_eq_Union,
119 UNION_eq_Union_image, Union_def, UN_singleton, UN_eq have been
122 More consistent and comprehensive names:
127 INF_leI2 ~> INF_lower2
128 le_INFI ~> INF_greatest
130 le_SUPI2 ~> SUP_upper2
132 INFI_bool_eq ~> INF_bool_eq
133 SUPR_bool_eq ~> SUP_bool_eq
134 INFI_apply ~> INF_apply
135 SUPR_apply ~> SUP_apply
136 INTER_def ~> INTER_eq
137 UNION_def ~> UNION_eq
141 * Added syntactic classes "inf" and "sup" for the respective
142 constants. INCOMPATIBILITY: Changes in the argument order of the
143 (mostly internal) locale predicates for some derived classes.
145 * Theorem collections ball_simps and bex_simps do not contain theorems
146 referring to UNION any longer; these have been moved to collection
147 UN_ball_bex_simps. INCOMPATIBILITY.
149 * Theory Archimedean_Field: floor now is defined as parameter of a
150 separate type class floor_ceiling.
152 * Theory Finite_Set: more coherent development of fold_set locales:
154 locale fun_left_comm ~> locale comp_fun_commute
155 locale fun_left_comm_idem ~> locale comp_fun_idem
157 Both use point-free characterization; interpretation proofs may need
158 adjustment. INCOMPATIBILITY.
162 - Theory Library/Code_Char_ord provides native ordering of
163 characters in the target language.
165 - Commands code_module and code_library are legacy, use export_code instead.
167 - Method "evaluation" is legacy, use method "eval" instead.
169 - Legacy evaluator "SML" is deactivated by default. May be
170 reactivated by the following theory command:
172 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
174 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
176 * The misleading name fastsimp has been renamed to fastforce,
177 but fastsimp is still available as a legacy feature.
180 - Added "need" and "total_consts" options.
181 - Reintroduced "show_skolems" option by popular demand.
182 - Renamed attribute: nitpick_def ~> nitpick_unfold.
186 - Use quasi-sound (and efficient) translations by default.
187 - Added support for the following provers: E-ToFoF, LEO-II, Satallax, SNARK,
188 Waldmeister, and Z3 with TPTP syntax.
189 - Automatically preplay and minimize proofs before showing them if this can be
190 done within reasonable time.
191 - sledgehammer available_provers ~> sledgehammer supported_provers.
193 - Added "preplay_timeout", "slicing", "type_enc", "sound", "max_mono_iters",
194 and "max_new_mono_instances" options.
195 - Removed "explicit_apply" and "full_types" options as well as "Full Types"
196 Proof General menu item. INCOMPATIBILITY.
199 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
200 - Obsoleted "metisFT" -- use "metis (full_types)" instead. INCOMPATIBILITY.
203 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
204 "elim:" options. INCOMPATIBILITY.
205 - Introduced 'try' that not only runs 'try_methods' but also
206 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
210 - Added "eval" option to evaluate terms for the found counterexample
211 (currently only supported by the default (exhaustive) tester).
213 - Added post-processing of terms to obtain readable counterexamples
214 (currently only supported by the default (exhaustive) tester).
216 - New counterexample generator quickcheck[narrowing] enables
217 narrowing-based testing. Requires the Glasgow Haskell compiler
218 with its installation location defined in the Isabelle settings
219 environment as ISABELLE_GHC.
221 - Removed quickcheck tester "SML" based on the SML code generator
222 (formly in HOL/Library).
224 * Function package: discontinued option "tailrec".
225 INCOMPATIBILITY. Use 'partial_function' instead.
227 * Session HOL-Probability:
228 - Caratheodory's extension lemma is now proved for ring_of_sets.
229 - Infinite products of probability measures are now available.
230 - Sigma closure is independent, if the generator is independent
231 - Use extended reals instead of positive extended
232 reals. INCOMPATIBILITY.
234 * Theory Library/Extended_Reals replaces now the positive extended reals
235 found in probability theory. This file is extended by
236 Multivariate_Analysis/Extended_Real_Limits.
238 * Old 'recdef' package has been moved to theory Library/Old_Recdef,
239 from where it must be imported explicitly. INCOMPATIBILITY.
241 * Well-founded recursion combinator "wfrec" has been moved to theory
242 Library/Wfrec. INCOMPATIBILITY.
244 * Theory HOL/Library/Cset_Monad allows do notation for computable
245 sets (cset) via the generic monad ad-hoc overloading facility.
247 * Theories of common data structures are split into theories for
248 implementation, an invariant-ensuring type, and connection to
249 an abstract type. INCOMPATIBILITY.
251 - RBT is split into RBT and RBT_Mapping.
252 - AssocList is split and renamed into AList and AList_Mapping.
253 - DList is split into DList_Impl, DList, and DList_Cset.
254 - Cset is split into Cset and List_Cset.
256 * Theory Library/Nat_Infinity has been renamed to
257 Library/Extended_Nat, with name changes of the following types and
260 type inat ~> type enat
262 Infty ~> infinity (overloaded)
266 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
267 been renamed accordingly. INCOMPATIBILITY.
269 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
270 accordance with standard mathematical terminology. INCOMPATIBILITY.
272 * Session Multivariate_Analysis: The euclidean_space type class now
273 fixes a constant "Basis :: 'a set" consisting of the standard
274 orthonormal basis for the type. Users now have the option of
275 quantifying over this set instead of using the "basis" function, e.g.
276 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
278 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
279 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
280 "Cart_nth" and "Cart_lambda" have been respectively renamed to
281 "vec_nth" and "vec_lambda"; theorems mentioning those names have
282 changed to match. Definition theorems for overloaded constants now use
283 the standard "foo_vec_def" naming scheme. A few other theorems have
284 been renamed as follows (INCOMPATIBILITY):
286 Cart_eq ~> vec_eq_iff
287 dist_nth_le_cart ~> dist_vec_nth_le
288 tendsto_vector ~> vec_tendstoI
289 Cauchy_vector ~> vec_CauchyI
291 * Session Multivariate_Analysis: Several duplicate theorems have been
292 removed, and other theorems have been renamed or replaced with more
293 general versions. INCOMPATIBILITY.
295 finite_choice ~> finite_set_choice
296 eventually_conjI ~> eventually_conj
297 eventually_and ~> eventually_conj_iff
298 eventually_false ~> eventually_False
299 setsum_norm ~> norm_setsum
300 Lim_sequentially ~> LIMSEQ_def
301 Lim_ident_at ~> LIM_ident
302 Lim_const ~> tendsto_const
303 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
304 Lim_neg ~> tendsto_minus
305 Lim_add ~> tendsto_add
306 Lim_sub ~> tendsto_diff
307 Lim_mul ~> tendsto_scaleR
308 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
309 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
310 Lim_linear ~> bounded_linear.tendsto
311 Lim_component ~> tendsto_euclidean_component
312 Lim_component_cart ~> tendsto_vec_nth
313 Lim_inner ~> tendsto_inner [OF tendsto_const]
314 dot_lsum ~> inner_setsum_left
315 dot_rsum ~> inner_setsum_right
316 continuous_cmul ~> continuous_scaleR [OF continuous_const]
317 continuous_neg ~> continuous_minus
318 continuous_sub ~> continuous_diff
319 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
320 continuous_mul ~> continuous_scaleR
321 continuous_inv ~> continuous_inverse
322 continuous_at_within_inv ~> continuous_at_within_inverse
323 continuous_at_inv ~> continuous_at_inverse
324 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
325 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
326 continuous_at_component ~> continuous_component [OF continuous_at_id]
327 continuous_on_neg ~> continuous_on_minus
328 continuous_on_sub ~> continuous_on_diff
329 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
330 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
331 continuous_on_mul ~> continuous_on_scaleR
332 continuous_on_mul_real ~> continuous_on_mult
333 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
334 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
335 continuous_on_inverse ~> continuous_on_inv
336 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
337 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
338 subset_interior ~> interior_mono
339 subset_closure ~> closure_mono
340 closure_univ ~> closure_UNIV
341 real_arch_lt ~> reals_Archimedean2
342 real_arch ~> reals_Archimedean3
343 real_abs_norm ~> abs_norm_cancel
344 real_abs_sub_norm ~> norm_triangle_ineq3
345 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
347 * Theory Complex_Main: The locale interpretations for the
348 bounded_linear and bounded_bilinear locales have been removed, in
349 order to reduce the number of duplicate lemmas. Users must use the
350 original names for distributivity theorems, potential INCOMPATIBILITY.
352 divide.add ~> add_divide_distrib
353 divide.diff ~> diff_divide_distrib
354 divide.setsum ~> setsum_divide_distrib
355 mult.add_right ~> right_distrib
356 mult.diff_right ~> right_diff_distrib
357 mult_right.setsum ~> setsum_right_distrib
358 mult_left.diff ~> left_diff_distrib
360 * Theory Complex_Main: Several redundant theorems have been removed or
361 replaced by more general versions. INCOMPATIBILITY.
363 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
364 real_0_le_divide_iff ~> zero_le_divide_iff
365 realpow_two_disj ~> power2_eq_iff
366 real_squared_diff_one_factored ~> square_diff_one_factored
367 realpow_two_diff ~> square_diff_square_factored
368 reals_complete2 ~> complete_real
369 real_sum_squared_expand ~> power2_sum
370 exp_ln_eq ~> ln_unique
372 expi_zero ~> exp_zero
373 lemma_DERIV_subst ~> DERIV_cong
374 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
375 LIMSEQ_const ~> tendsto_const
376 LIMSEQ_norm ~> tendsto_norm
377 LIMSEQ_add ~> tendsto_add
378 LIMSEQ_minus ~> tendsto_minus
379 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
380 LIMSEQ_diff ~> tendsto_diff
381 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
382 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
383 LIMSEQ_mult ~> tendsto_mult
384 LIMSEQ_inverse ~> tendsto_inverse
385 LIMSEQ_divide ~> tendsto_divide
386 LIMSEQ_pow ~> tendsto_power
387 LIMSEQ_setsum ~> tendsto_setsum
388 LIMSEQ_setprod ~> tendsto_setprod
389 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
390 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
391 LIMSEQ_imp_rabs ~> tendsto_rabs
392 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
393 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
394 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
395 LIMSEQ_Complex ~> tendsto_Complex
396 LIM_ident ~> tendsto_ident_at
397 LIM_const ~> tendsto_const
398 LIM_add ~> tendsto_add
399 LIM_add_zero ~> tendsto_add_zero
400 LIM_minus ~> tendsto_minus
401 LIM_diff ~> tendsto_diff
402 LIM_norm ~> tendsto_norm
403 LIM_norm_zero ~> tendsto_norm_zero
404 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
405 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
406 LIM_rabs ~> tendsto_rabs
407 LIM_rabs_zero ~> tendsto_rabs_zero
408 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
409 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
410 LIM_compose ~> tendsto_compose
411 LIM_mult ~> tendsto_mult
412 LIM_scaleR ~> tendsto_scaleR
413 LIM_of_real ~> tendsto_of_real
414 LIM_power ~> tendsto_power
415 LIM_inverse ~> tendsto_inverse
416 LIM_sgn ~> tendsto_sgn
417 isCont_LIM_compose ~> isCont_tendsto_compose
418 bounded_linear.LIM ~> bounded_linear.tendsto
419 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
420 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
421 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
422 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
423 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
424 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
426 * Theory Complex_Main: The definition of infinite series was generalized.
427 Now it is defined on the type class {topological_space, comm_monoid_add}.
428 Hence it is useable also for extended real numbers.
430 * Theory Complex_Main: The complex exponential function "expi" is now
431 a type-constrained abbreviation for "exp :: complex => complex"; thus
432 several polymorphic lemmas about "exp" are now applicable to "expi".
435 *** Document preparation ***
437 * Localized \isabellestyle switch can be used within blocks or groups
440 \isabellestyle{it} %preferred default
441 {\isabellestylett @{text "typewriter stuff"}}
443 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
444 isar-ref manual, both for description and actual application of the
447 * Antiquotation @{value} evaluates the given term and presents its
450 * Antiquotations: term style "isub" provides ad-hoc conversion of
451 variables x1, y23 into subscripted form x\<^isub>1,
454 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
455 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
457 * Discontinued special treatment of hard tabulators, which are better
458 avoided in the first place (no universally agreed standard expansion).
459 Implicit tab-width is now 1.
464 * The inner syntax of sort/type/term/prop supports inlined YXML
465 representations within quoted string tokens. By encoding logical
466 entities via Term_XML (in ML or Scala) concrete syntax can be
467 bypassed, which is particularly useful for producing bits of text
468 under external program control.
470 * Antiquotations for ML and document preparation are managed as theory
471 data, which requires explicit setup.
473 * Isabelle_Process.is_active allows tools to check if the official
474 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
475 (better known as Proof General).
477 * Structure Proof_Context follows standard naming scheme. Old
478 ProofContext is still available for some time as legacy alias.
480 * Structure Timing provides various operations for timing; supersedes
481 former start_timing/end_timing etc.
483 * Path.print is the official way to show file-system paths to users
484 (including quotes etc.).
486 * Inner syntax: identifiers in parse trees of generic categories
487 "logic", "aprop", "idt" etc. carry position information (disguised as
488 type constraints). Occasional INCOMPATIBILITY with non-compliant
489 translations that choke on unexpected type constraints. Positions can
490 be stripped in ML translations via Syntax.strip_positions /
491 Syntax.strip_positions_ast, or via the syntax constant
492 "_strip_positions" within parse trees. As last resort, positions can
493 be disabled via the configuration option Syntax.positions, which is
494 called "syntax_positions" in Isar attribute syntax.
496 * Discontinued special status of various ML structures that contribute
497 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
498 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
499 refer directly to Ast.Constant, Lexicon.is_identifier,
500 Syntax_Trans.mk_binder_tr etc.
502 * Typed print translation: discontinued show_sorts argument, which is
503 already available via context of "advanced" translation.
505 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
506 goal states; body tactic needs to address all subgoals uniformly.
508 * Slightly more special eq_list/eq_set, with shortcut involving
509 pointer equality (assumes that eq relation is reflexive).
511 * Classical tactics use proper Proof.context instead of historic types
512 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
513 operate directly on Proof.context. Raw type claset retains its use as
514 snapshot of the classical context, which can be recovered via
515 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
516 INCOMPATIBILITY, classical tactics and derived proof methods require
517 proper Proof.context.
522 * Scala layer provides JVM method invocation service for static
523 methods of type (String)String, see Invoke_Scala.method in ML. For
526 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
528 Togeter with YXML.string_of_body/parse_body and XML.Encode/Decode this
529 allows to pass structured values between ML and Scala.
531 * The IsabelleText fonts includes some further glyphs to support the
532 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
533 installed a local copy (which is normally *not* required) need to
534 delete or update it from ~~/lib/fonts/.
537 New in Isabelle2011 (January 2011)
538 ----------------------------------
542 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
543 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
544 useful tooltips and hyperlinks produced from its static analysis. The
545 bundled component provides an executable Isabelle tool that can be run
548 Isabelle2011/bin/isabelle jedit
550 * Significantly improved Isabelle/Isar implementation manual.
552 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
553 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
554 while the default heap location within that directory lacks that extra
555 suffix. This isolates multiple Isabelle installations from each
556 other, avoiding problems with old settings in new versions.
557 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
559 * Source files are always encoded as UTF-8, instead of old-fashioned
560 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
561 the following package declarations:
563 \usepackage[utf8]{inputenc}
564 \usepackage{textcomp}
566 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
567 a Unicode character is treated as a single symbol, not a sequence of
568 non-ASCII bytes as before. Since Isabelle/ML string literals may
569 contain symbols without further backslash escapes, Unicode can now be
570 used here as well. Recall that Symbol.explode in ML provides a
571 consistent view on symbols, while raw explode (or String.explode)
572 merely give a byte-oriented representation.
574 * Theory loader: source files are primarily located via the master
575 directory of each theory node (where the .thy file itself resides).
576 The global load path is still partially available as legacy feature.
577 Minor INCOMPATIBILITY due to subtle change in file lookup: use
578 explicit paths, relatively to the theory.
580 * Special treatment of ML file names has been discontinued.
581 Historically, optional extensions .ML or .sml were added on demand --
582 at the cost of clarity of file dependencies. Recall that Isabelle/ML
583 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
585 * Various options that affect pretty printing etc. are now properly
586 handled within the context via configuration options, instead of
587 unsynchronized references or print modes. There are both ML Config.T
588 entities and Isar declaration attributes to access these.
590 ML (Config.T) Isar (attribute)
592 eta_contract eta_contract
593 show_brackets show_brackets
594 show_sorts show_sorts
595 show_types show_types
596 show_question_marks show_question_marks
597 show_consts show_consts
598 show_abbrevs show_abbrevs
600 Syntax.ast_trace syntax_ast_trace
601 Syntax.ast_stat syntax_ast_stat
602 Syntax.ambiguity_level syntax_ambiguity_level
604 Goal_Display.goals_limit goals_limit
605 Goal_Display.show_main_goal show_main_goal
607 Method.rule_trace rule_trace
609 Thy_Output.display thy_output_display
610 Thy_Output.quotes thy_output_quotes
611 Thy_Output.indent thy_output_indent
612 Thy_Output.source thy_output_source
613 Thy_Output.break thy_output_break
615 Note that corresponding "..._default" references in ML may only be
616 changed globally at the ROOT session setup, but *not* within a theory.
617 The option "show_abbrevs" supersedes the former print mode
618 "no_abbrevs" with inverted meaning.
620 * More systematic naming of some configuration options.
623 trace_simp ~> simp_trace
624 debug_simp ~> simp_debug
626 * Support for real valued configuration options, using simplistic
627 floating-point notation that coincides with the inner syntax for
630 * Support for real valued preferences (with approximative PGIP type):
631 front-ends need to accept "pgint" values in float notation.
634 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
637 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
642 * Command 'type_synonym' (with single argument) replaces somewhat
643 outdated 'types', which is still available as legacy feature for some
646 * Command 'nonterminal' (with 'and' separated list of arguments)
647 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
649 * Command 'notepad' replaces former 'example_proof' for
650 experimentation in Isar without any result. INCOMPATIBILITY.
652 * Locale interpretation commands 'interpret' and 'sublocale' accept
653 lists of equations to map definitions in a locale to appropriate
654 entities in the context of the interpretation. The 'interpretation'
655 command already provided this functionality.
657 * Diagnostic command 'print_dependencies' prints the locale instances
658 that would be activated if the specified expression was interpreted in
659 the current context. Variant "print_dependencies!" assumes a context
660 without interpretations.
662 * Diagnostic command 'print_interps' prints interpretations in proofs
663 in addition to interpretations in theories.
665 * Discontinued obsolete 'global' and 'local' commands to manipulate
666 the theory name space. Rare INCOMPATIBILITY. The ML functions
667 Sign.root_path and Sign.local_path may be applied directly where this
668 feature is still required for historical reasons.
670 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
671 'definition' instead.
673 * The "prems" fact, which refers to the accidental collection of
674 foundational premises in the context, is now explicitly marked as
675 legacy feature and will be discontinued soon. Consider using "assms"
676 of the head statement or reference facts by explicit names.
678 * Document antiquotations @{class} and @{type} print classes and type
681 * Document antiquotation @{file} checks file/directory entries within
682 the local file system.
687 * Coercive subtyping: functions can be declared as coercions and type
688 inference will add them as necessary upon input of a term. Theory
689 Complex_Main declares real :: nat => real and real :: int => real as
690 coercions. A coercion function f is declared like this:
692 declare [[coercion f]]
694 To lift coercions through type constructors (e.g. from nat => real to
695 nat list => real list), map functions can be declared, e.g.
697 declare [[coercion_map map]]
699 Currently coercion inference is activated only in theories including
700 real numbers, i.e. descendants of Complex_Main. This is controlled by
701 the configuration option "coercion_enabled", e.g. it can be enabled in
702 other theories like this:
704 declare [[coercion_enabled]]
706 * Command 'partial_function' provides basic support for recursive
707 function definitions over complete partial orders. Concrete instances
708 are provided for i) the option type, ii) tail recursion on arbitrary
709 types, and iii) the heap monad of Imperative_HOL. See
710 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
713 * Function package: f.psimps rules are no longer implicitly declared
714 as [simp]. INCOMPATIBILITY.
716 * Datatype package: theorems generated for executable equality (class
717 "eq") carry proper names and are treated as default code equations.
719 * Inductive package: now offers command 'inductive_simps' to
720 automatically derive instantiated and simplified equations for
721 inductive predicates, similar to 'inductive_cases'.
723 * Command 'enriched_type' allows to register properties of the
724 functorial structure of types.
726 * Improved infrastructure for term evaluation using code generator
727 techniques, in particular static evaluation conversions.
729 * Code generator: Scala (2.8 or higher) has been added to the target
732 * Code generator: globbing constant expressions "*" and "Theory.*"
733 have been replaced by the more idiomatic "_" and "Theory._".
736 * Code generator: export_code without explicit file declaration prints
737 to standard output. INCOMPATIBILITY.
739 * Code generator: do not print function definitions for case
740 combinators any longer.
742 * Code generator: simplification with rules determined with
743 src/Tools/Code/code_simp.ML and method "code_simp".
745 * Code generator for records: more idiomatic representation of record
746 types. Warning: records are not covered by ancient SML code
747 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
748 rep_datatype declaration helps to succeed then:
752 rep_datatype foo_ext ...
754 * Records: logical foundation type for records does not carry a
755 '_type' suffix any longer (obsolete due to authentic syntax).
758 * Quickcheck now by default uses exhaustive testing instead of random
759 testing. Random testing can be invoked by "quickcheck [random]",
760 exhaustive testing by "quickcheck [exhaustive]".
762 * Quickcheck instantiates polymorphic types with small finite
763 datatypes by default. This enables a simple execution mechanism to
764 handle quantifiers and function equality over the finite datatypes.
766 * Quickcheck random generator has been renamed from "code" to
767 "random". INCOMPATIBILITY.
769 * Quickcheck now has a configurable time limit which is set to 30
770 seconds by default. This can be changed by adding [timeout = n] to the
771 quickcheck command. The time limit for Auto Quickcheck is still set
774 * Quickcheck in locales considers interpretations of that locale for
775 counter example search.
778 - Added "smt" and "remote_smt" provers based on the "smt" proof
779 method. See the Sledgehammer manual for details ("isabelle doc
782 sledgehammer atp_info ~> sledgehammer running_provers
783 sledgehammer atp_kill ~> sledgehammer kill_provers
784 sledgehammer available_atps ~> sledgehammer available_provers
787 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
788 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
789 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
790 (and "ms" and "min" are no longer supported)
795 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
796 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
798 - Added support for partial quotient types.
799 - Added local versions of the "Nitpick.register_xxx" functions.
800 - Added "whack" option.
801 - Allow registration of quotient types as codatatypes.
802 - Improved "merge_type_vars" option to merge more types.
803 - Removed unsound "fast_descrs" option.
804 - Added custom symmetry breaking for datatypes, making it possible to reach
805 higher cardinalities.
806 - Prevent the expansion of too large definitions.
808 * Proof methods "metis" and "meson" now have configuration options
809 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
810 to diagnose these tools. E.g.
812 using [[metis_trace = true]]
814 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
815 manually as command 'solve_direct'.
817 * The default SMT solver Z3 must be enabled explicitly (due to
818 licensing issues) by setting the environment variable
819 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
820 commercial applications, the SMT solver CVC3 is provided as fall-back;
821 changing the SMT solver is done via the configuration option
824 * Remote SMT solvers need to be referred to by the "remote_" prefix,
825 i.e. "remote_cvc3" and "remote_z3".
827 * Added basic SMT support for datatypes, records, and typedefs using
828 the oracle mode (no proofs). Direct support of pairs has been dropped
829 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
830 support for a similar behavior). Minor INCOMPATIBILITY.
832 * Changed SMT configuration options:
834 z3_proofs ~> smt_oracle (with inverted meaning)
835 z3_trace_assms ~> smt_trace_used_facts
848 * Boogie output files (.b2i files) need to be declared in the theory
851 * Simplification procedure "list_to_set_comprehension" rewrites list
852 comprehensions applied to List.set to set comprehensions. Occasional
853 INCOMPATIBILITY, may be deactivated like this:
855 declare [[simproc del: list_to_set_comprehension]]
857 * Removed old version of primrec package. INCOMPATIBILITY.
859 * Removed simplifier congruence rule of "prod_case", as has for long
860 been the case with "split". INCOMPATIBILITY.
862 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
864 * Removed [split_format ... and ... and ...] version of
865 [split_format]. Potential INCOMPATIBILITY.
867 * Predicate "sorted" now defined inductively, with nice induction
868 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
870 * Constant "contents" renamed to "the_elem", to free the generic name
871 contents for other uses. INCOMPATIBILITY.
873 * Renamed class eq and constant eq (for code generation) to class
874 equal and constant equal, plus renaming of related facts and various
875 tuning. INCOMPATIBILITY.
877 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
879 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
882 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
883 avoid confusion with finite sets. INCOMPATIBILITY.
885 * Abandoned locales equiv, congruent and congruent2 for equivalence
886 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
889 * Some previously unqualified names have been qualified:
896 Trueprop ~> HOL.Trueprop
901 op --> ~> HOL.implies
913 Pair ~> Product_Type.Pair
914 fst ~> Product_Type.fst
915 snd ~> Product_Type.snd
916 curry ~> Product_Type.curry
918 Collect ~> Set.Collect
922 * More canonical naming convention for some fundamental definitions:
924 bot_bool_eq ~> bot_bool_def
925 top_bool_eq ~> top_bool_def
926 inf_bool_eq ~> inf_bool_def
927 sup_bool_eq ~> sup_bool_def
928 bot_fun_eq ~> bot_fun_def
929 top_fun_eq ~> top_fun_def
930 inf_fun_eq ~> inf_fun_def
931 sup_fun_eq ~> sup_fun_def
935 * More stylized fact names:
937 expand_fun_eq ~> fun_eq_iff
938 expand_set_eq ~> set_eq_iff
940 nat_number ~> eval_nat_numeral
944 * Refactoring of code-generation specific operations in theory List:
950 mem_iff ~> member_def
951 null_empty ~> null_def
953 INCOMPATIBILITY. Note that these were not supposed to be used
954 regularly unless for striking reasons; their main purpose was code
957 Various operations from the Haskell prelude are used for generating
960 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
961 "surj f" is now an abbreviation of "range f = UNIV". The theorems
962 bij_def and surj_def are unchanged. INCOMPATIBILITY.
964 * Abolished some non-alphabetic type names: "prod" and "sum" replace
965 "*" and "+" respectively. INCOMPATIBILITY.
967 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
968 "Sum_Type.Plus" instead.
970 * Constant "split" has been merged with constant "prod_case"; names of
971 ML functions, facts etc. involving split have been retained so far,
972 though. INCOMPATIBILITY.
974 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
975 instead. INCOMPATIBILITY.
977 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
980 * Former theory Library/Enum is now part of the HOL-Main image.
981 INCOMPATIBILITY: all constants of the Enum theory now have to be
982 referred to by its qualified name.
985 nlists ~> Enum.nlists
986 product ~> Enum.product
988 * Theory Library/Monad_Syntax provides do-syntax for monad types.
989 Syntax in Library/State_Monad has been changed to avoid ambiguities.
992 * Theory Library/SetsAndFunctions has been split into
993 Library/Function_Algebras and Library/Set_Algebras; canonical names
994 for instance definitions for functions; various improvements.
997 * Theory Library/Multiset provides stable quicksort implementation of
1000 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
1003 * Session Multivariate_Analysis: introduced a type class for euclidean
1004 space. Most theorems are now stated in terms of euclidean spaces
1005 instead of finite cartesian products.
1008 real ^ 'n ~> 'a::real_vector
1009 ~> 'a::euclidean_space
1010 ~> 'a::ordered_euclidean_space
1011 (depends on your needs)
1015 \<chi> x. _ ~> \<chi>\<chi> x. _
1018 Also note that the indices are now natural numbers and not from some
1019 finite type. Finite cartesian products of euclidean spaces, products
1020 of euclidean spaces the real and complex numbers are instantiated to
1021 be euclidean_spaces. INCOMPATIBILITY.
1023 * Session Probability: introduced pextreal as positive extended real
1024 numbers. Use pextreal as value for measures. Introduce the
1025 Radon-Nikodym derivative, product spaces and Fubini's theorem for
1026 arbitrary sigma finite measures. Introduces Lebesgue measure based on
1027 the integral in Multivariate Analysis. INCOMPATIBILITY.
1029 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
1032 * Session SPARK (with image HOL-SPARK) provides commands to load and
1033 prove verification conditions generated by the SPARK Ada program
1034 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
1039 * Theorems for additive ring operations (locale abelian_monoid and
1040 descendants) are generated by interpretation from their multiplicative
1041 counterparts. Names (in particular theorem names) have the mandatory
1042 qualifier 'add'. Previous theorem names are redeclared for
1045 * Structure "int_ring" is now an abbreviation (previously a
1046 definition). This fits more natural with advanced interpretations.
1051 * The domain package now runs in definitional mode by default: The
1052 former command 'new_domain' is now called 'domain'. To use the domain
1053 package in its original axiomatic mode, use 'domain (unsafe)'.
1056 * The new class "domain" is now the default sort. Class "predomain"
1057 is an unpointed version of "domain". Theories can be updated by
1058 replacing sort annotations as shown below. INCOMPATIBILITY.
1060 'a::type ~> 'a::countable
1061 'a::cpo ~> 'a::predomain
1062 'a::pcpo ~> 'a::domain
1064 * The old type class "rep" has been superseded by class "domain".
1065 Accordingly, users of the definitional package must remove any
1066 "default_sort rep" declarations. INCOMPATIBILITY.
1068 * The domain package (definitional mode) now supports unpointed
1069 predomain argument types, as long as they are marked 'lazy'. (Strict
1070 arguments must be in class "domain".) For example, the following
1071 domain definition now works:
1073 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
1075 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
1076 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
1077 'a option, and 'a list. Additionally, it configures fixrec and the
1078 domain package to work with these types. For example:
1080 fixrec isInl :: "('a + 'b) u -> tr"
1081 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
1083 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
1085 * The "(permissive)" option of fixrec has been replaced with a
1086 per-equation "(unchecked)" option. See
1087 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
1089 * The "bifinite" class no longer fixes a constant "approx"; the class
1090 now just asserts that such a function exists. INCOMPATIBILITY.
1092 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
1093 defines an embedding of type 'a defl into udom by default; instances
1094 of "bifinite" and "domain" classes are available in
1095 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
1097 * The syntax "REP('a)" has been replaced with "DEFL('a)".
1099 * The predicate "directed" has been removed. INCOMPATIBILITY.
1101 * The type class "finite_po" has been removed. INCOMPATIBILITY.
1103 * The function "cprod_map" has been renamed to "prod_map".
1106 * The monadic bind operator on each powerdomain has new binder syntax
1107 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
1108 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
1110 * The infix syntax for binary union on each powerdomain has changed
1111 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
1112 syntax. INCOMPATIBILITY.
1114 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
1115 still supported as an input translation.
1117 * Renamed some theorems (the original names are also still available).
1119 expand_fun_below ~> fun_below_iff
1120 below_fun_ext ~> fun_belowI
1121 expand_cfun_eq ~> cfun_eq_iff
1122 ext_cfun ~> cfun_eqI
1123 expand_cfun_below ~> cfun_below_iff
1124 below_cfun_ext ~> cfun_belowI
1125 cont2cont_Rep_CFun ~> cont2cont_APP
1127 * The Abs and Rep functions for various types have changed names.
1128 Related theorem names have also changed to match. INCOMPATIBILITY.
1130 Rep_CFun ~> Rep_cfun
1131 Abs_CFun ~> Abs_cfun
1132 Rep_Sprod ~> Rep_sprod
1133 Abs_Sprod ~> Abs_sprod
1134 Rep_Ssum ~> Rep_ssum
1135 Abs_Ssum ~> Abs_ssum
1137 * Lemmas with names of the form *_defined_iff or *_strict_iff have
1138 been renamed to *_bottom_iff. INCOMPATIBILITY.
1140 * Various changes to bisimulation/coinduction with domain package:
1142 - Definitions of "bisim" constants no longer mention definedness.
1143 - With mutual recursion, "bisim" predicate is now curried.
1144 - With mutual recursion, each type gets a separate coind theorem.
1145 - Variable names in bisim_def and coinduct rules have changed.
1149 * Case combinators generated by the domain package for type "foo" are
1150 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
1152 * Several theorems have been renamed to more accurately reflect the
1153 names of constants and types involved. INCOMPATIBILITY.
1155 thelub_const ~> lub_const
1156 lub_const ~> is_lub_const
1158 is_lub_lub ~> is_lubD2
1160 unique_lub ~> is_lub_unique
1161 is_ub_lub ~> is_lub_rangeD1
1162 lub_bin_chain ~> is_lub_bin_chain
1163 lub_fun ~> is_lub_fun
1164 thelub_fun ~> lub_fun
1165 thelub_cfun ~> lub_cfun
1166 thelub_Pair ~> lub_Pair
1167 lub_cprod ~> is_lub_prod
1168 thelub_cprod ~> lub_prod
1169 minimal_cprod ~> minimal_prod
1170 inst_cprod_pcpo ~> inst_prod_pcpo
1172 compact_UU ~> compact_bottom
1173 deflation_UU ~> deflation_bottom
1174 finite_deflation_UU ~> finite_deflation_bottom
1176 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
1178 sq_ord_less_eq_trans ~> below_eq_trans
1179 sq_ord_eq_less_trans ~> eq_below_trans
1180 refl_less ~> below_refl
1181 trans_less ~> below_trans
1182 antisym_less ~> below_antisym
1183 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
1184 box_less ~> box_below
1185 rev_trans_less ~> rev_below_trans
1186 not_less2not_eq ~> not_below2not_eq
1187 less_UU_iff ~> below_UU_iff
1188 flat_less_iff ~> flat_below_iff
1189 adm_less ~> adm_below
1190 adm_not_less ~> adm_not_below
1191 adm_compact_not_less ~> adm_compact_not_below
1192 less_fun_def ~> below_fun_def
1193 expand_fun_less ~> fun_below_iff
1194 less_fun_ext ~> fun_belowI
1195 less_discr_def ~> below_discr_def
1196 discr_less_eq ~> discr_below_eq
1197 less_unit_def ~> below_unit_def
1198 less_cprod_def ~> below_prod_def
1199 prod_lessI ~> prod_belowI
1200 Pair_less_iff ~> Pair_below_iff
1201 fst_less_iff ~> fst_below_iff
1202 snd_less_iff ~> snd_below_iff
1203 expand_cfun_less ~> cfun_below_iff
1204 less_cfun_ext ~> cfun_belowI
1205 injection_less ~> injection_below
1206 less_up_def ~> below_up_def
1207 not_Iup_less ~> not_Iup_below
1208 Iup_less ~> Iup_below
1210 Def_inject_less_eq ~> Def_below_Def
1211 Def_less_is_eq ~> Def_below_iff
1212 spair_less_iff ~> spair_below_iff
1213 less_sprod ~> below_sprod
1214 spair_less ~> spair_below
1215 sfst_less_iff ~> sfst_below_iff
1216 ssnd_less_iff ~> ssnd_below_iff
1217 fix_least_less ~> fix_least_below
1218 dist_less_one ~> dist_below_one
1219 less_ONE ~> below_ONE
1220 ONE_less_iff ~> ONE_below_iff
1221 less_sinlD ~> below_sinlD
1222 less_sinrD ~> below_sinrD
1227 * All constant names are now qualified internally and use proper
1228 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
1233 * Antiquotation @{assert} inlines a function bool -> unit that raises
1234 Fail if the argument is false. Due to inlining the source position of
1235 failed assertions is included in the error output.
1237 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
1238 text is in practice always evaluated with a stable theory checkpoint.
1239 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
1241 * Antiquotation @{theory A} refers to theory A from the ancestry of
1242 the current context, not any accidental theory loader state as before.
1243 Potential INCOMPATIBILITY, subtle change in semantics.
1245 * Syntax.pretty_priority (default 0) configures the required priority
1246 of pretty-printed output and thus affects insertion of parentheses.
1248 * Syntax.default_root (default "any") configures the inner syntax
1249 category (nonterminal symbol) for parsing of terms.
1251 * Former exception Library.UnequalLengths now coincides with
1252 ListPair.UnequalLengths.
1254 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
1255 main functionality is provided by structure Simplifier.
1257 * Renamed raw "explode" function to "raw_explode" to emphasize its
1258 meaning. Note that internally to Isabelle, Symbol.explode is used in
1259 almost all situations.
1261 * Discontinued obsolete function sys_error and exception SYS_ERROR.
1262 See implementation manual for further details on exceptions in
1265 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
1268 * Renamed structure PureThy to Pure_Thy and moved most of its
1269 operations to structure Global_Theory, to emphasize that this is
1270 rarely-used global-only stuff.
1272 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
1273 instead (or tracing for high-volume output).
1275 * Configuration option show_question_marks only affects regular pretty
1276 printing of types and terms, not raw Term.string_of_vname.
1278 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
1279 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
1280 @{thms} for most purposes.
1282 * ML structure Unsynchronized is never opened, not even in Isar
1283 interaction mode as before. Old Unsynchronized.set etc. have been
1284 discontinued -- use plain := instead. This should be *rare* anyway,
1285 since modern tools always work via official context data, notably
1286 configuration options.
1288 * Parallel and asynchronous execution requires special care concerning
1289 interrupts. Structure Exn provides some convenience functions that
1290 avoid working directly with raw Interrupt. User code must not absorb
1291 interrupts -- intermediate handling (for cleanup etc.) needs to be
1292 followed by re-raising of the original exception. Another common
1293 source of mistakes are "handle _" patterns, which make the meaning of
1294 the program subject to physical effects of the environment.
1298 New in Isabelle2009-2 (June 2010)
1299 ---------------------------------
1303 * Authentic syntax for *all* logical entities (type classes, type
1304 constructors, term constants): provides simple and robust
1305 correspondence between formal entities and concrete syntax. Within
1306 the parse tree / AST representations, "constants" are decorated by
1307 their category (class, type, const) and spelled out explicitly with
1308 their full internal name.
1310 Substantial INCOMPATIBILITY concerning low-level syntax declarations
1311 and translations (translation rules and translation functions in ML).
1312 Some hints on upgrading:
1314 - Many existing uses of 'syntax' and 'translations' can be replaced
1315 by more modern 'type_notation', 'notation' and 'abbreviation',
1316 which are independent of this issue.
1318 - 'translations' require markup within the AST; the term syntax
1319 provides the following special forms:
1321 CONST c -- produces syntax version of constant c from context
1322 XCONST c -- literally c, checked as constant from context
1323 c -- literally c, if declared by 'syntax'
1325 Plain identifiers are treated as AST variables -- occasionally the
1326 system indicates accidental variables via the error "rhs contains
1329 Type classes and type constructors are marked according to their
1330 concrete syntax. Some old translations rules need to be written
1331 for the "type" category, using type constructor application
1332 instead of pseudo-term application of the default category
1335 - 'parse_translation' etc. in ML may use the following
1338 @{class_syntax c} -- type class c within parse tree / AST
1339 @{term_syntax c} -- type constructor c within parse tree / AST
1340 @{const_syntax c} -- ML version of "CONST c" above
1341 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
1343 - Literal types within 'typed_print_translations', i.e. those *not*
1344 represented as pseudo-terms are represented verbatim. Use @{class
1345 c} or @{type_name c} here instead of the above syntax
1348 Note that old non-authentic syntax was based on unqualified base
1349 names, so all of the above "constant" names would coincide. Recall
1350 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
1351 diagnose syntax problems.
1353 * Type constructors admit general mixfix syntax, not just infix.
1355 * Concrete syntax may be attached to local entities without a proof
1356 body, too. This works via regular mixfix annotations for 'fix',
1357 'def', 'obtain' etc. or via the explicit 'write' command, which is
1358 similar to the 'notation' command in theory specifications.
1360 * Discontinued unnamed infix syntax (legacy feature for many years) --
1361 need to specify constant name and syntax separately. Internal ML
1362 datatype constructors have been renamed from InfixName to Infix etc.
1363 Minor INCOMPATIBILITY.
1365 * Schematic theorem statements need to be explicitly markup as such,
1366 via commands 'schematic_lemma', 'schematic_theorem',
1367 'schematic_corollary'. Thus the relevance of the proof is made
1368 syntactically clear, which impacts performance in a parallel or
1369 asynchronous interactive environment. Minor INCOMPATIBILITY.
1371 * Use of cumulative prems via "!" in some proof methods has been
1372 discontinued (old legacy feature).
1374 * References 'trace_simp' and 'debug_simp' have been replaced by
1375 configuration options stored in the context. Enabling tracing (the
1376 case of debugging is similar) in proofs works via
1378 using [[trace_simp = true]]
1380 Tracing is then active for all invocations of the simplifier in
1381 subsequent goal refinement steps. Tracing may also still be enabled or
1382 disabled via the ProofGeneral settings menu.
1384 * Separate commands 'hide_class', 'hide_type', 'hide_const',
1385 'hide_fact' replace the former 'hide' KIND command. Minor
1388 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
1389 more efficient than combinations with -q1 or -q2.
1394 * Proofterms record type-class reasoning explicitly, using the
1395 "unconstrain" operation internally. This eliminates all sort
1396 constraints from a theorem and proof, introducing explicit
1397 OFCLASS-premises. On the proof term level, this operation is
1398 automatically applied at theorem boundaries, such that closed proofs
1399 are always free of sort constraints. INCOMPATIBILITY for tools that
1400 inspect proof terms.
1402 * Local theory specifications may depend on extra type variables that
1403 are not present in the result type -- arguments TYPE('a) :: 'a itself
1404 are added internally. For example:
1406 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
1408 * Predicates of locales introduced by classes carry a mandatory
1409 "class" prefix. INCOMPATIBILITY.
1411 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
1413 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
1416 * Command 'code_reflect' allows to incorporate generated ML code into
1417 runtime environment; replaces immature code_datatype antiquotation.
1420 * Code generator: simple concept for abstract datatypes obeying
1423 * Code generator: details of internal data cache have no impact on the
1424 user space functionality any longer.
1426 * Methods "unfold_locales" and "intro_locales" ignore non-locale
1427 subgoals. This is more appropriate for interpretations with 'where'.
1430 * Command 'example_proof' opens an empty proof body. This allows to
1431 experiment with Isar, without producing any persistent result.
1433 * Commands 'type_notation' and 'no_type_notation' declare type syntax
1434 within a local theory context, with explicit checking of the
1435 constructors involved (in contrast to the raw 'syntax' versions).
1437 * Commands 'types' and 'typedecl' now work within a local theory
1438 context -- without introducing dependencies on parameters or
1439 assumptions, which is not possible in Isabelle/Pure.
1441 * Command 'defaultsort' has been renamed to 'default_sort', it works
1442 within a local theory context. Minor INCOMPATIBILITY.
1447 * Command 'typedef' now works within a local theory context -- without
1448 introducing dependencies on parameters or assumptions, which is not
1449 possible in Isabelle/Pure/HOL. Note that the logical environment may
1450 contain multiple interpretations of local typedefs (with different
1451 non-emptiness proofs), even in a global theory context.
1453 * New package for quotient types. Commands 'quotient_type' and
1454 'quotient_definition' may be used for defining types and constants by
1455 quotient constructions. An example is the type of integers created by
1456 quotienting pairs of natural numbers:
1459 intrel :: "(nat * nat) => (nat * nat) => bool"
1461 "intrel (x, y) (u, v) = (x + v = u + y)"
1463 quotient_type int = "nat * nat" / intrel
1464 by (auto simp add: equivp_def expand_fun_eq)
1467 "0::int" is "(0::nat, 0::nat)"
1469 The method "lifting" can be used to lift of theorems from the
1470 underlying "raw" type to the quotient type. The example
1471 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
1472 construction and provides a reasoning infrastructure for finite sets.
1474 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
1475 clash with new theory Quotient in Main HOL.
1477 * Moved the SMT binding into the main HOL session, eliminating
1478 separate HOL-SMT session.
1480 * List membership infix mem operation is only an input abbreviation.
1483 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
1484 for future developements; former Library/Word.thy is still present in
1485 the AFP entry RSAPPS.
1487 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
1488 longer shadowed. INCOMPATIBILITY.
1490 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
1493 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
1496 * Dropped normalizing_semiring etc; use the facts in semiring classes
1497 instead. INCOMPATIBILITY.
1499 * Dropped several real-specific versions of lemmas about floor and
1500 ceiling; use the generic lemmas from theory "Archimedean_Field"
1501 instead. INCOMPATIBILITY.
1503 floor_number_of_eq ~> floor_number_of
1504 le_floor_eq_number_of ~> number_of_le_floor
1505 le_floor_eq_zero ~> zero_le_floor
1506 le_floor_eq_one ~> one_le_floor
1507 floor_less_eq_number_of ~> floor_less_number_of
1508 floor_less_eq_zero ~> floor_less_zero
1509 floor_less_eq_one ~> floor_less_one
1510 less_floor_eq_number_of ~> number_of_less_floor
1511 less_floor_eq_zero ~> zero_less_floor
1512 less_floor_eq_one ~> one_less_floor
1513 floor_le_eq_number_of ~> floor_le_number_of
1514 floor_le_eq_zero ~> floor_le_zero
1515 floor_le_eq_one ~> floor_le_one
1516 floor_subtract_number_of ~> floor_diff_number_of
1517 floor_subtract_one ~> floor_diff_one
1518 ceiling_number_of_eq ~> ceiling_number_of
1519 ceiling_le_eq_number_of ~> ceiling_le_number_of
1520 ceiling_le_zero_eq ~> ceiling_le_zero
1521 ceiling_le_eq_one ~> ceiling_le_one
1522 less_ceiling_eq_number_of ~> number_of_less_ceiling
1523 less_ceiling_eq_zero ~> zero_less_ceiling
1524 less_ceiling_eq_one ~> one_less_ceiling
1525 ceiling_less_eq_number_of ~> ceiling_less_number_of
1526 ceiling_less_eq_zero ~> ceiling_less_zero
1527 ceiling_less_eq_one ~> ceiling_less_one
1528 le_ceiling_eq_number_of ~> number_of_le_ceiling
1529 le_ceiling_eq_zero ~> zero_le_ceiling
1530 le_ceiling_eq_one ~> one_le_ceiling
1531 ceiling_subtract_number_of ~> ceiling_diff_number_of
1532 ceiling_subtract_one ~> ceiling_diff_one
1534 * Theory "Finite_Set": various folding_XXX locales facilitate the
1535 application of the various fold combinators on finite sets.
1537 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
1538 provides abstract red-black tree type which is backed by "RBT_Impl" as
1539 implementation. INCOMPATIBILTY.
1541 * Theory Library/Coinductive_List has been removed -- superseded by
1542 AFP/thys/Coinductive.
1544 * Theory PReal, including the type "preal" and related operations, has
1545 been removed. INCOMPATIBILITY.
1547 * Real: new development using Cauchy Sequences.
1549 * Split off theory "Big_Operators" containing setsum, setprod,
1550 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
1552 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
1553 "Int" etc. INCOMPATIBILITY.
1555 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
1557 * New set of rules "ac_simps" provides combined assoc / commute
1558 rewrites for all interpretations of the appropriate generic locales.
1560 * Renamed theory "OrderedGroup" to "Groups" and split theory
1561 "Ring_and_Field" into theories "Rings" and "Fields"; for more
1562 appropriate and more consistent names suitable for name prefixes
1563 within the HOL theories. INCOMPATIBILITY.
1565 * Some generic constants have been put to appropriate theories:
1566 - less_eq, less: Orderings
1567 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
1568 - inverse, divide: Rings
1571 * More consistent naming of type classes involving orderings (and
1574 lower_semilattice ~> semilattice_inf
1575 upper_semilattice ~> semilattice_sup
1577 dense_linear_order ~> dense_linorder
1579 pordered_ab_group_add ~> ordered_ab_group_add
1580 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
1581 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
1582 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
1583 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
1584 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
1585 pordered_cancel_semiring ~> ordered_cancel_semiring
1586 pordered_comm_monoid_add ~> ordered_comm_monoid_add
1587 pordered_comm_ring ~> ordered_comm_ring
1588 pordered_comm_semiring ~> ordered_comm_semiring
1589 pordered_ring ~> ordered_ring
1590 pordered_ring_abs ~> ordered_ring_abs
1591 pordered_semiring ~> ordered_semiring
1593 ordered_ab_group_add ~> linordered_ab_group_add
1594 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
1595 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
1596 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
1597 ordered_field ~> linordered_field
1598 ordered_field_no_lb ~> linordered_field_no_lb
1599 ordered_field_no_ub ~> linordered_field_no_ub
1600 ordered_field_dense_linear_order ~> dense_linordered_field
1601 ordered_idom ~> linordered_idom
1602 ordered_ring ~> linordered_ring
1603 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
1604 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
1605 ordered_ring_strict ~> linordered_ring_strict
1606 ordered_semidom ~> linordered_semidom
1607 ordered_semiring ~> linordered_semiring
1608 ordered_semiring_1 ~> linordered_semiring_1
1609 ordered_semiring_1_strict ~> linordered_semiring_1_strict
1610 ordered_semiring_strict ~> linordered_semiring_strict
1612 The following slightly odd type classes have been moved to a
1613 separate theory Library/Lattice_Algebras:
1615 lordered_ab_group_add ~> lattice_ab_group_add
1616 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
1617 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
1618 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
1619 lordered_ring ~> lattice_ring
1623 * Refined field classes:
1624 - classes division_ring_inverse_zero, field_inverse_zero,
1625 linordered_field_inverse_zero include rule inverse 0 = 0 --
1626 subsumes former division_by_zero class;
1627 - numerous lemmas have been ported from field to division_ring.
1630 * Refined algebra theorem collections:
1631 - dropped theorem group group_simps, use algebra_simps instead;
1632 - dropped theorem group ring_simps, use field_simps instead;
1633 - proper theorem collection field_simps subsumes former theorem
1634 groups field_eq_simps and field_simps;
1635 - dropped lemma eq_minus_self_iff which is a duplicate for
1639 * Theory Finite_Set and List: some lemmas have been generalized from
1642 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
1643 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
1644 inter_Inter_fold_inter ~> inf_Inf_fold_inf
1645 union_Union_fold_union ~> sup_Sup_fold_sup
1646 Inter_fold_inter ~> Inf_fold_inf
1647 Union_fold_union ~> Sup_fold_sup
1648 inter_INTER_fold_inter ~> inf_INFI_fold_inf
1649 union_UNION_fold_union ~> sup_SUPR_fold_sup
1650 INTER_fold_inter ~> INFI_fold_inf
1651 UNION_fold_union ~> SUPR_fold_sup
1653 * Theory "Complete_Lattice":
1655 - renamed to "Complete_Lattices". minor INCOMPATIBILITY.
1657 - lemmas top_def and bot_def have been replaced by the more convenient
1658 lemmas Inf_empty and Sup_empty. Dropped lemmas Inf_insert_simp and
1659 Sup_insert_simp, which are subsumed by Inf_insert and Sup_insert.
1660 Lemmas Inf_UNIV and Sup_UNIV replace former Inf_Univ and Sup_Univ.
1661 Lemmas inf_top_right and sup_bot_right subsume inf_top and sup_bot
1662 respectively. INCOMPATIBILITY.
1664 - lemmas Inf_eq_top_iff, INF_eq_top_iff, INF_image, Inf_insert, INF_top,
1665 Inf_top_conv, INF_top_conv, SUP_bot, Sup_bot_conv, SUP_bot_conv,
1666 Sup_eq_top_iff, SUP_eq_top_iff, SUP_image, Sup_insert are now declared
1667 as [simp]. minor INCOMPATIBILITY.
1669 * Theory "Lattice": lemmas compl_inf_bot, compl_le_comp_iff, compl_sup_top,
1670 inf_idem, inf_left_idem, inf_sup_absorb, sup_idem, sup_inf_absob,
1671 sup_left_idem are now declared as [simp]. minor INCOMPATIBILITY.
1674 * Reorganized theory Multiset: swapped notation of pointwise and
1677 - pointwise ordering is instance of class order with standard syntax
1679 - multiset ordering has syntax <=# and <#; partial order properties
1680 are provided by means of interpretation with prefix
1682 - less duplication, less historical organization of sections,
1683 conversion from associations lists to multisets, rudimentary code
1685 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
1690 multiset_eq_conv_count_eq ~> multiset_ext_iff
1691 multi_count_ext ~> multiset_ext
1692 diff_union_inverse2 ~> diff_union_cancelR
1696 * Theory Permutation: replaced local "remove" by List.remove1.
1698 * Code generation: ML and OCaml code is decorated with signatures.
1700 * Theory List: added transpose.
1702 * Library/Nat_Bijection.thy is a collection of bijective functions
1703 between nat and other types, which supersedes the older libraries
1704 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
1707 Nat_Int_Bij.nat2_to_nat ~> prod_encode
1708 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
1709 Nat_Int_Bij.int_to_nat_bij ~> int_encode
1710 Nat_Int_Bij.nat_to_int_bij ~> int_decode
1711 Countable.pair_encode ~> prod_encode
1712 NatIso.prod2nat ~> prod_encode
1713 NatIso.nat2prod ~> prod_decode
1714 NatIso.sum2nat ~> sum_encode
1715 NatIso.nat2sum ~> sum_decode
1716 NatIso.list2nat ~> list_encode
1717 NatIso.nat2list ~> list_decode
1718 NatIso.set2nat ~> set_encode
1719 NatIso.nat2set ~> set_decode
1722 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
1723 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
1724 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
1725 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
1726 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
1727 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
1728 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
1729 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
1730 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
1731 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
1732 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
1733 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
1734 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
1737 - Renamed ATP commands:
1738 atp_info ~> sledgehammer running_atps
1739 atp_kill ~> sledgehammer kill_atps
1740 atp_messages ~> sledgehammer messages
1741 atp_minimize ~> sledgehammer minimize
1742 print_atps ~> sledgehammer available_atps
1744 - Added user's manual ("isabelle doc sledgehammer").
1745 - Added option syntax and "sledgehammer_params" to customize
1746 Sledgehammer's behavior. See the manual for details.
1747 - Modified the Isar proof reconstruction code so that it produces
1748 direct proofs rather than proofs by contradiction. (This feature
1749 is still experimental.)
1750 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
1752 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
1755 - Added and implemented "binary_ints" and "bits" options.
1756 - Added "std" option and implemented support for nonstandard models.
1757 - Added and implemented "finitize" option to improve the precision
1758 of infinite datatypes based on a monotonicity analysis.
1759 - Added support for quotient types.
1760 - Added support for "specification" and "ax_specification"
1762 - Added support for local definitions (for "function" and
1763 "termination" proofs).
1764 - Added support for term postprocessors.
1765 - Optimized "Multiset.multiset" and "FinFun.finfun".
1766 - Improved efficiency of "destroy_constrs" optimization.
1767 - Fixed soundness bugs related to "destroy_constrs" optimization and
1769 - Fixed soundness bug related to higher-order constructors.
1770 - Fixed soundness bug when "full_descrs" is enabled.
1771 - Improved precision of set constructs.
1772 - Added "atoms" option.
1773 - Added cache to speed up repeated Kodkod invocations on the same
1775 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
1776 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
1777 "SAT4J_Light". INCOMPATIBILITY.
1778 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
1779 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
1780 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
1782 * Method "induct" now takes instantiations of the form t, where t is not
1783 a variable, as a shorthand for "x == t", where x is a fresh variable.
1784 If this is not intended, t has to be enclosed in parentheses.
1785 By default, the equalities generated by definitional instantiations
1786 are pre-simplified, which may cause parameters of inductive cases
1787 to disappear, or may even delete some of the inductive cases.
1788 Use "induct (no_simp)" instead of "induct" to restore the old
1789 behaviour. The (no_simp) option is also understood by the "cases"
1790 and "nominal_induct" methods, which now perform pre-simplification, too.
1796 * Variable names in lemmas generated by the domain package have
1797 changed; the naming scheme is now consistent with the HOL datatype
1798 package. Some proof scripts may be affected, INCOMPATIBILITY.
1800 * The domain package no longer defines the function "foo_copy" for
1801 recursive domain "foo". The reach lemma is now stated directly in
1802 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
1803 be reformulated in terms of "foo_take", INCOMPATIBILITY.
1805 * Most definedness lemmas generated by the domain package (previously
1806 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
1807 like "foo$x = UU <-> x = UU", which works better as a simp rule.
1808 Proofs that used definedness lemmas as intro rules may break,
1809 potential INCOMPATIBILITY.
1811 * Induction and casedist rules generated by the domain package now
1812 declare proper case_names (one called "bottom", and one named for each
1813 constructor). INCOMPATIBILITY.
1815 * For mutually-recursive domains, separate "reach" and "take_lemma"
1816 rules are generated for each domain, INCOMPATIBILITY.
1818 foo_bar.reach ~> foo.reach bar.reach
1819 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
1821 * Some lemmas generated by the domain package have been renamed for
1822 consistency with the datatype package, INCOMPATIBILITY.
1824 foo.ind ~> foo.induct
1825 foo.finite_ind ~> foo.finite_induct
1826 foo.coind ~> foo.coinduct
1827 foo.casedist ~> foo.exhaust
1828 foo.exhaust ~> foo.nchotomy
1830 * For consistency with other definition packages, the fixrec package
1831 now generates qualified theorem names, INCOMPATIBILITY.
1833 foo_simps ~> foo.simps
1834 foo_unfold ~> foo.unfold
1835 foo_induct ~> foo.induct
1837 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
1838 method and internal fixrec proofs now use the default simpset instead.
1841 * The "contlub" predicate has been removed. Proof scripts should use
1842 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
1844 * The "admw" predicate has been removed, INCOMPATIBILITY.
1846 * The constants cpair, cfst, and csnd have been removed in favor of
1847 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
1852 * Antiquotations for basic formal entities:
1854 @{class NAME} -- type class
1855 @{class_syntax NAME} -- syntax representation of the above
1857 @{type_name NAME} -- logical type
1858 @{type_abbrev NAME} -- type abbreviation
1859 @{nonterminal NAME} -- type of concrete syntactic category
1860 @{type_syntax NAME} -- syntax representation of any of the above
1862 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
1863 @{const_abbrev NAME} -- abbreviated constant
1864 @{const_syntax NAME} -- syntax representation of any of the above
1866 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
1867 syntax constant (cf. 'syntax' command).
1869 * Antiquotation @{make_string} inlines a function to print arbitrary
1870 values similar to the ML toplevel. The result is compiler dependent
1871 and may fall back on "?" in certain situations.
1873 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
1874 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
1875 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
1876 not work with the asynchronous Isar document model.
1878 * Configuration options now admit dynamic default values, depending on
1879 the context or even global references.
1881 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
1882 uses an efficient external library if available (for Poly/ML).
1884 * Renamed some important ML structures, while keeping the old names
1885 for some time as aliases within the structure Legacy:
1887 OuterKeyword ~> Keyword
1890 OuterSyntax ~> Outer_Syntax
1891 PrintMode ~> Print_Mode
1892 SpecParse ~> Parse_Spec
1895 ThyOutput ~> Thy_Output
1896 TypeInfer ~> Type_Infer
1898 Note that "open Legacy" simplifies porting of sources, but forgetting
1899 to remove it again will complicate porting again in the future.
1901 * Most operations that refer to a global context are named
1902 accordingly, e.g. Simplifier.global_context or
1903 ProofContext.init_global. There are some situations where a global
1904 context actually works, but under normal circumstances one needs to
1905 pass the proper local context through the code!
1907 * Discontinued old TheoryDataFun with its copy/init operation -- data
1908 needs to be pure. Functor Theory_Data_PP retains the traditional
1909 Pretty.pp argument to merge, which is absent in the standard
1910 Theory_Data version.
1912 * Sorts.certify_sort and derived "cert" operations for types and terms
1913 no longer minimize sorts. Thus certification at the boundary of the
1914 inference kernel becomes invariant under addition of class relations,
1915 which is an important monotonicity principle. Sorts are now minimized
1916 in the syntax layer only, at the boundary between the end-user and the
1917 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
1918 explicitly in rare situations.
1920 * Renamed old-style Drule.standard to Drule.export_without_context, to
1921 emphasize that this is in no way a standard operation.
1924 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
1925 usual for resolution. Rare INCOMPATIBILITY.
1927 * Renamed varify/unvarify operations to varify_global/unvarify_global
1928 to emphasize that these only work in a global situation (which is
1931 * Curried take and drop in library.ML; negative length is interpreted
1932 as infinity (as in chop). Subtle INCOMPATIBILITY.
1934 * Proof terms: type substitutions on proof constants now use canonical
1935 order of type variables. INCOMPATIBILITY for tools working with proof
1938 * Raw axioms/defs may no longer carry sort constraints, and raw defs
1939 may no longer carry premises. User-level specifications are
1940 transformed accordingly by Thm.add_axiom/add_def.
1945 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
1946 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
1947 proof terms are enabled unconditionally in the new HOL-Proofs image.
1949 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
1950 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
1953 * Old lib/scripts/polyml-platform is superseded by the
1954 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
1955 variant, even on a 64 bit machine. The following example setting
1956 prefers 64 bit if available:
1958 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
1960 * The preliminary Isabelle/jEdit application demonstrates the emerging
1961 Isabelle/Scala layer for advanced prover interaction and integration.
1962 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
1965 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
1966 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
1967 similar to the default assignment of the document preparation system
1968 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
1969 provides some operations for direct access to the font without asking
1970 the user for manual installation.
1974 New in Isabelle2009-1 (December 2009)
1975 -------------------------------------
1979 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
1980 one backslash should be used, even in ML sources.
1985 * Locale interpretation propagates mixins along the locale hierarchy.
1986 The currently only available mixins are the equations used to map
1987 local definitions to terms of the target domain of an interpretation.
1989 * Reactivated diagnostic command 'print_interps'. Use "print_interps
1990 loc" to print all interpretations of locale "loc" in the theory.
1991 Interpretations in proofs are not shown.
1993 * Thoroughly revised locales tutorial. New section on conditional
1996 * On instantiation of classes, remaining undefined class parameters
1997 are formally declared. INCOMPATIBILITY.
2000 *** Document preparation ***
2002 * New generalized style concept for printing terms: @{foo (style) ...}
2003 instead of @{foo_style style ...} (old form is still retained for
2004 backward compatibility). Styles can be also applied for
2005 antiquotations prop, term_type and typeof.
2010 * New proof method "smt" for a combination of first-order logic with
2011 equality, linear and nonlinear (natural/integer/real) arithmetic, and
2012 fixed-size bitvectors; there is also basic support for higher-order
2013 features (esp. lambda abstractions). It is an incomplete decision
2014 procedure based on external SMT solvers using the oracle mechanism;
2015 for the SMT solver Z3, this method is proof-producing. Certificates
2016 are provided to avoid calling the external solvers solely for
2017 re-checking proofs. Due to a remote SMT service there is no need for
2018 installing SMT solvers locally. See src/HOL/SMT.
2020 * New commands to load and prove verification conditions generated by
2021 the Boogie program verifier or derived systems (e.g. the Verifying C
2022 Compiler (VCC) or Spec#). See src/HOL/Boogie.
2024 * New counterexample generator tool 'nitpick' based on the Kodkod
2025 relational model finder. See src/HOL/Tools/Nitpick and
2026 src/HOL/Nitpick_Examples.
2028 * New commands 'code_pred' and 'values' to invoke the predicate
2029 compiler and to enumerate values of inductive predicates.
2031 * A tabled implementation of the reflexive transitive closure.
2033 * New implementation of quickcheck uses generic code generator;
2034 default generators are provided for all suitable HOL types, records
2035 and datatypes. Old quickcheck can be re-activated importing theory
2036 Library/SML_Quickcheck.
2038 * New testing tool Mirabelle for automated proof tools. Applies
2039 several tools and tactics like sledgehammer, metis, or quickcheck, to
2040 every proof step in a theory. To be used in batch mode via the
2041 "mirabelle" utility.
2043 * New proof method "sos" (sum of squares) for nonlinear real
2044 arithmetic (originally due to John Harison). It requires theory
2045 Library/Sum_Of_Squares. It is not a complete decision procedure but
2046 works well in practice on quantifier-free real arithmetic with +, -,
2047 *, ^, =, <= and <, i.e. boolean combinations of equalities and
2048 inequalities between polynomials. It makes use of external
2049 semidefinite programming solvers. Method "sos" generates a
2050 certificate that can be pasted into the proof thus avoiding the need
2051 to call an external tool every time the proof is checked. See
2052 src/HOL/Library/Sum_Of_Squares.
2054 * New method "linarith" invokes existing linear arithmetic decision
2057 * New command 'atp_minimal' reduces result produced by Sledgehammer.
2059 * New Sledgehammer option "Full Types" in Proof General settings menu.
2060 Causes full type information to be output to the ATPs. This slows
2061 ATPs down considerably but eliminates a source of unsound "proofs"
2064 * New method "metisFT": A version of metis that uses full type
2065 information in order to avoid failures of proof reconstruction.
2067 * New evaluator "approximate" approximates an real valued term using
2068 the same method as the approximation method.
2070 * Method "approximate" now supports arithmetic expressions as
2071 boundaries of intervals and implements interval splitting and Taylor
2074 * ML antiquotation @{code_datatype} inserts definition of a datatype
2075 generated by the code generator; e.g. see src/HOL/Predicate.thy.
2077 * New theory SupInf of the supremum and infimum operators for sets of
2080 * New theory Probability, which contains a development of measure
2081 theory, eventually leading to Lebesgue integration and probability.
2083 * Extended Multivariate Analysis to include derivation and Brouwer's
2086 * Reorganization of number theory, INCOMPATIBILITY:
2087 - new number theory development for nat and int, in theories Divides
2088 and GCD as well as in new session Number_Theory
2089 - some constants and facts now suffixed with _nat and _int
2091 - former session NumberTheory now named Old_Number_Theory, including
2092 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
2093 - moved theory Pocklington from src/HOL/Library to
2094 src/HOL/Old_Number_Theory
2096 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
2097 lcm of finite and infinite sets. It is shown that they form a complete
2100 * Class semiring_div requires superclass no_zero_divisors and proof of
2101 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
2102 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
2103 generalized to class semiring_div, subsuming former theorems
2104 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
2105 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
2108 * Refinements to lattice classes and sets:
2109 - less default intro/elim rules in locale variant, more default
2110 intro/elim rules in class variant: more uniformity
2111 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
2113 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
2115 - renamed ACI to inf_sup_aci
2116 - new class "boolean_algebra"
2117 - class "complete_lattice" moved to separate theory
2118 "Complete_Lattice"; corresponding constants (and abbreviations)
2119 renamed and with authentic syntax:
2120 Set.Inf ~> Complete_Lattice.Inf
2121 Set.Sup ~> Complete_Lattice.Sup
2122 Set.INFI ~> Complete_Lattice.INFI
2123 Set.SUPR ~> Complete_Lattice.SUPR
2124 Set.Inter ~> Complete_Lattice.Inter
2125 Set.Union ~> Complete_Lattice.Union
2126 Set.INTER ~> Complete_Lattice.INTER
2127 Set.UNION ~> Complete_Lattice.UNION
2128 - authentic syntax for
2131 - mere abbreviations:
2134 Set.inter (for inf, formerly Set.Int)
2135 Set.union (for sup, formerly Set.Un)
2136 Complete_Lattice.Inter (for Inf)
2137 Complete_Lattice.Union (for Sup)
2138 Complete_Lattice.INTER (for INFI)
2139 Complete_Lattice.UNION (for SUPR)
2140 - object-logic definitions as far as appropriate
2142 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
2143 Un_subset_iff are explicitly deleted as default simp rules; then also
2144 their lattice counterparts le_inf_iff and le_sup_iff have to be
2145 deleted to achieve the desired effect.
2147 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
2148 rules by default any longer; the same applies to min_max.inf_absorb1
2149 etc. INCOMPATIBILITY.
2151 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
2152 pred_set_conv by default. INCOMPATIBILITY.
2154 * Power operations on relations and functions are now one dedicated
2155 constant "compow" with infix syntax "^^". Power operation on
2156 multiplicative monoids retains syntax "^" and is now defined generic
2157 in class power. INCOMPATIBILITY.
2159 * Relation composition "R O S" now has a more standard argument order:
2160 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
2161 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
2162 break, since the O_assoc rule was not rewritten like this. Fix using
2163 O_assoc[symmetric]. The same applies to the curried version "R OO S".
2165 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
2166 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
2169 * Most rules produced by inductive and datatype package have mandatory
2170 prefixes. INCOMPATIBILITY.
2172 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
2173 the attribute of the same name. Each of the theorems in the list
2174 DERIV_intros assumes composition with an additional function and
2175 matches a variable to the derivative, which has to be solved by the
2176 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
2177 of most elementary terms. Former Maclauren.DERIV_tac and
2178 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
2181 * Code generator attributes follow the usual underscore convention:
2182 code_unfold replaces code unfold
2183 code_post replaces code post
2188 sizechange -> size_change
2189 induct_scheme -> induction_schema
2192 * Discontinued abbreviation "arbitrary" of constant "undefined".
2193 INCOMPATIBILITY, use "undefined" directly.
2196 Suc_eq_add_numeral_1 -> Suc_eq_plus1
2197 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
2198 Suc_plus1 -> Suc_eq_plus1
2199 *anti_sym -> *antisym*
2200 vector_less_eq_def -> vector_le_def
2203 * Added theorem List.map_map as [simp]. Removed List.map_compose.
2206 * Removed predicate "M hassize n" (<--> card M = n & finite M).
2212 * Theory Representable defines a class "rep" of domains that are
2213 representable (via an ep-pair) in the universal domain type "udom".
2214 Instances are provided for all type constructors defined in HOLCF.
2216 * The 'new_domain' command is a purely definitional version of the
2217 domain package, for representable domains. Syntax is identical to the
2218 old domain package. The 'new_domain' package also supports indirect
2219 recursion using previously-defined type constructors. See
2220 src/HOLCF/ex/New_Domain.thy for examples.
2222 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
2223 on the left-hand side of an equation, and then performs
2224 simplification. Rewriting is done using rules declared with the
2225 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
2226 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
2228 * The pattern-match compiler in 'fixrec' can now handle constructors
2229 with HOL function types. Pattern-match combinators for the Pair
2230 constructor are pre-configured.
2232 * The 'fixrec' package now produces better fixed-point induction rules
2233 for mutually-recursive definitions: Induction rules have conclusions
2234 of the form "P foo bar" instead of "P <foo, bar>".
2236 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
2237 been renamed to "below". The name "below" now replaces "less" in many
2238 theorem names. (Legacy theorem names using "less" are still supported
2241 * The 'fixrec' package now supports "bottom patterns". Bottom
2242 patterns can be used to generate strictness rules, or to make
2243 functions more strict (much like the bang-patterns supported by the
2244 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
2250 * Support for Poly/ML 5.3.0, with improved reporting of compiler
2251 errors and run-time exceptions, including detailed source positions.
2253 * Structure Name_Space (formerly NameSpace) now manages uniquely
2254 identified entries, with some additional information such as source
2255 position, logical grouping etc.
2257 * Theory and context data is now introduced by the simplified and
2258 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
2259 to be pure, but the old TheoryDataFun for mutable data (with explicit
2260 copy operation) is still available for some time.
2262 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
2263 provides a high-level programming interface to synchronized state
2264 variables with atomic update. This works via pure function
2265 application within a critical section -- its runtime should be as
2266 short as possible; beware of deadlocks if critical code is nested,
2267 either directly or indirectly via other synchronized variables!
2269 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
2270 wraps raw ML references, explicitly indicating their non-thread-safe
2271 behaviour. The Isar toplevel keeps this structure open, to
2272 accommodate Proof General as well as quick and dirty interactive
2273 experiments with references.
2275 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
2276 parallel tactical reasoning.
2278 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
2279 are similar to SUBPROOF, but are slightly more flexible: only the
2280 specified parts of the subgoal are imported into the context, and the
2281 body tactic may introduce new subgoals and schematic variables.
2283 * Old tactical METAHYPS, which does not observe the proof context, has
2284 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
2285 or Subgoal.FOCUS etc.
2287 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
2288 functors have their own ML name space there is no point to mark them
2289 separately.) Minor INCOMPATIBILITY.
2291 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
2293 * Renamed several structures FooBar to Foo_Bar. Occasional,
2296 * Operations of structure Skip_Proof no longer require quick_and_dirty
2297 mode, which avoids critical setmp.
2299 * Eliminated old Attrib.add_attributes, Method.add_methods and related
2300 combinators for "args". INCOMPATIBILITY, need to use simplified
2301 Attrib/Method.setup introduced in Isabelle2009.
2303 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
2304 back on global_simpset_of, global_claset_of, global_clasimpset_of as
2305 last resort. INCOMPATIBILITY.
2307 * Display.pretty_thm now requires a proper context (cf. former
2308 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
2309 or even Display.pretty_thm_without_context as last resort.
2312 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
2313 Syntax.pretty_typ/term directly, preferably with proper context
2314 instead of global theory.
2319 * Further fine tuning of parallel proof checking, scales up to 8 cores
2320 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
2323 * Support for additional "Isabelle components" via etc/components, see
2324 also the system manual.
2326 * The isabelle makeall tool now operates on all components with
2327 IsaMakefile, not just hardwired "logics".
2329 * Removed "compress" option from isabelle-process and isabelle usedir;
2330 this is always enabled.
2332 * Discontinued support for Poly/ML 4.x versions.
2334 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
2335 on a given logic image. This requires the lighttpd webserver and is
2336 currently supported on Linux only.
2340 New in Isabelle2009 (April 2009)
2341 --------------------------------
2345 * Simplified main Isabelle executables, with less surprises on
2346 case-insensitive file-systems (such as Mac OS).
2348 - The main Isabelle tool wrapper is now called "isabelle" instead of
2351 - The former "isabelle" alias for "isabelle-process" has been
2352 removed (should rarely occur to regular users).
2354 - The former "isabelle-interface" and its alias "Isabelle" have been
2355 removed (interfaces are now regular Isabelle tools).
2357 Within scripts and make files, the Isabelle environment variables
2358 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
2359 respectively. (The latter are still available as legacy feature.)
2361 The old isabelle-interface wrapper could react in confusing ways if
2362 the interface was uninstalled or changed otherwise. Individual
2363 interface tool configuration is now more explicit, see also the
2364 Isabelle system manual. In particular, Proof General is now available
2365 via "isabelle emacs".
2367 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
2368 purge installed copies of Isabelle executables and re-run "isabelle
2369 install -p ...", or use symlinks.
2371 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
2372 old ~/isabelle, which was slightly non-standard and apt to cause
2373 surprises on case-insensitive file-systems (such as Mac OS).
2375 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
2376 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
2377 care is required when using older releases of Isabelle. Note that
2378 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
2379 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
2381 * Proofs of fully specified statements are run in parallel on
2382 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
2383 a regular 4-core machine, if the initial heap space is made reasonably
2384 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
2386 * The main reference manuals ("isar-ref", "implementation", and
2387 "system") have been updated and extended. Formally checked references
2388 as hyperlinks are now available uniformly.
2393 * Complete re-implementation of locales. INCOMPATIBILITY in several
2394 respects. The most important changes are listed below. See the
2395 Tutorial on Locales ("locales" manual) for details.
2397 - In locale expressions, instantiation replaces renaming. Parameters
2398 must be declared in a for clause. To aid compatibility with previous
2399 parameter inheritance, in locale declarations, parameters that are not
2400 'touched' (instantiation position "_" or omitted) are implicitly added
2401 with their syntax at the beginning of the for clause.
2403 - Syntax from abbreviations and definitions in locales is available in
2404 locale expressions and context elements. The latter is particularly
2405 useful in locale declarations.
2407 - More flexible mechanisms to qualify names generated by locale
2408 expressions. Qualifiers (prefixes) may be specified in locale
2409 expressions, and can be marked as mandatory (syntax: "name!:") or
2410 optional (syntax "name?:"). The default depends for plain "name:"
2411 depends on the situation where a locale expression is used: in
2412 commands 'locale' and 'sublocale' prefixes are optional, in
2413 'interpretation' and 'interpret' prefixes are mandatory. The old
2414 implicit qualifiers derived from the parameter names of a locale are
2415 no longer generated.
2417 - Command "sublocale l < e" replaces "interpretation l < e". The
2418 instantiation clause in "interpretation" and "interpret" (square
2419 brackets) is no longer available. Use locale expressions.
2421 - When converting proof scripts, mandatory qualifiers in
2422 'interpretation' and 'interpret' should be retained by default, even
2423 if this is an INCOMPATIBILITY compared to former behavior. In the
2424 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
2425 in locale expressions range over a single locale instance only.
2427 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
2428 In existing theorem specifications replace the includes element by the
2429 respective context elements of the included locale, omitting those
2430 that are already present in the theorem specification. Multiple
2431 assume elements of a locale should be replaced by a single one
2432 involving the locale predicate. In the proof body, declarations (most
2433 notably theorems) may be regained by interpreting the respective
2434 locales in the proof context as required (command "interpret").
2436 If using "includes" in replacement of a target solely because the
2437 parameter types in the theorem are not as general as in the target,
2438 consider declaring a new locale with additional type constraints on
2439 the parameters (context element "constrains").
2441 - Discontinued "locale (open)". INCOMPATIBILITY.
2443 - Locale interpretation commands no longer attempt to simplify goal.
2444 INCOMPATIBILITY: in rare situations the generated goal differs. Use
2445 methods intro_locales and unfold_locales to clarify.
2447 - Locale interpretation commands no longer accept interpretation
2448 attributes. INCOMPATIBILITY.
2450 * Class declaration: so-called "base sort" must not be given in import
2451 list any longer, but is inferred from the specification. Particularly
2458 class foo = type + ...
2460 * Class target: global versions of theorems stemming do not carry a
2461 parameter prefix any longer. INCOMPATIBILITY.
2463 * Class 'instance' command no longer accepts attached definitions.
2464 INCOMPATIBILITY, use proper 'instantiation' target instead.
2466 * Recovered hiding of consts, which was accidentally broken in
2467 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
2468 makes c inaccessible; consider using ``hide (open) const c'' instead.
2470 * Slightly more coherent Pure syntax, with updated documentation in
2471 isar-ref manual. Removed locales meta_term_syntax and
2472 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
2473 INCOMPATIBILITY in rare situations. Note that &&& should not be used
2474 directly in regular applications.
2476 * There is a new syntactic category "float_const" for signed decimal
2477 fractions (e.g. 123.45 or -123.45).
2479 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
2480 interface with 'setup' command instead.
2482 * Command 'local_setup' is similar to 'setup', but operates on a local
2485 * The 'axiomatization' command now only works within a global theory
2486 context. INCOMPATIBILITY.
2488 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
2489 hypotheses. Sorts required in the course of reasoning need to be
2490 covered by the constraints in the initial statement, completed by the
2491 type instance information of the background theory. Non-trivial sort
2492 hypotheses, which rarely occur in practice, may be specified via
2493 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
2495 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
2497 The result contains an implicit sort hypotheses as before --
2498 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
2501 * Generalized Isar history, with support for linear undo, direct state
2504 * Changed defaults for unify configuration options:
2506 unify_trace_bound = 50 (formerly 25)
2507 unify_search_bound = 60 (formerly 30)
2509 * Different bookkeeping for code equations (INCOMPATIBILITY):
2511 a) On theory merge, the last set of code equations for a particular
2512 constant is taken (in accordance with the policy applied by other
2513 parts of the code generator framework).
2515 b) Code equations stemming from explicit declarations (e.g. code
2516 attribute) gain priority over default code equations stemming
2517 from definition, primrec, fun etc.
2519 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
2521 * Unified theorem tables for both code generators. Thus [code
2522 func] has disappeared and only [code] remains. INCOMPATIBILITY.
2524 * Command 'find_consts' searches for constants based on type and name
2527 find_consts "_ => bool"
2529 By default, matching is against subtypes, but it may be restricted to
2530 the whole type. Searching by name is possible. Multiple queries are
2531 conjunctive and queries may be negated by prefixing them with a
2534 find_consts strict: "_ => bool" name: "Int" -"int => int"
2536 * New 'find_theorems' criterion "solves" matches theorems that
2537 directly solve the current goal (modulo higher-order unification).
2539 * Auto solve feature for main theorem statements: whenever a new goal
2540 is stated, "find_theorems solves" is called; any theorems that could
2541 solve the lemma directly are listed as part of the goal state.
2542 Cf. associated options in Proof General Isabelle settings menu,
2543 enabled by default, with reasonable timeout for pathological cases of
2544 higher-order unification.
2547 *** Document preparation ***
2549 * Antiquotation @{lemma} now imitates a regular terminal proof,
2550 demanding keyword 'by' and supporting the full method expression
2551 syntax just like the Isar command 'by'.
2556 * Integrated main parts of former image HOL-Complex with HOL. Entry
2557 points Main and Complex_Main remain as before.
2559 * Logic image HOL-Plain provides a minimal HOL with the most important
2560 tools available (inductive, datatype, primrec, ...). This facilitates
2561 experimentation and tool development. Note that user applications
2562 (and library theories) should never refer to anything below theory
2565 * Logic image HOL-Main stops at theory Main, and thus facilitates
2566 experimentation due to shorter build times.
2568 * Logic image HOL-NSA contains theories of nonstandard analysis which
2569 were previously part of former HOL-Complex. Entry point Hyperreal
2570 remains valid, but theories formerly using Complex_Main should now use
2571 new entry point Hypercomplex.
2573 * Generic ATP manager for Sledgehammer, based on ML threads instead of
2574 Posix processes. Avoids potentially expensive forking of the ML
2575 process. New thread-based implementation also works on non-Unix
2576 platforms (Cygwin). Provers are no longer hardwired, but defined
2577 within the theory via plain ML wrapper functions. Basic Sledgehammer
2578 commands are covered in the isar-ref manual.
2580 * Wrapper scripts for remote SystemOnTPTP service allows to use
2581 sledgehammer without local ATP installation (Vampire etc.). Other
2582 provers may be included via suitable ML wrappers, see also
2583 src/HOL/ATP_Linkup.thy.
2585 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
2588 * The metis method no longer fails because the theorem is too trivial
2589 (contains the empty clause).
2591 * The metis method now fails in the usual manner, rather than raising
2592 an exception, if it determines that it cannot prove the theorem.
2594 * Method "coherent" implements a prover for coherent logic (see also
2595 src/Tools/coherent.ML).
2597 * Constants "undefined" and "default" replace "arbitrary". Usually
2598 "undefined" is the right choice to replace "arbitrary", though
2599 logically there is no difference. INCOMPATIBILITY.
2601 * Command "value" now integrates different evaluation mechanisms. The
2602 result of the first successful evaluation mechanism is printed. In
2603 square brackets a particular named evaluation mechanisms may be
2604 specified (currently, [SML], [code] or [nbe]). See further
2605 src/HOL/ex/Eval_Examples.thy.
2607 * Normalization by evaluation now allows non-leftlinear equations.
2608 Declare with attribute [code nbe].
2610 * Methods "case_tac" and "induct_tac" now refer to the very same rules
2611 as the structured Isar versions "cases" and "induct", cf. the
2612 corresponding "cases" and "induct" attributes. Mutual induction rules
2613 are now presented as a list of individual projections
2614 (e.g. foo_bar.inducts for types foo and bar); the old format with
2615 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
2616 rare situations a different rule is selected --- notably nested tuple
2617 elimination instead of former prod.exhaust: use explicit (case_tac t
2618 rule: prod.exhaust) here.
2620 * Attributes "cases", "induct", "coinduct" support "del" option.
2622 * Removed fact "case_split_thm", which duplicates "case_split".
2624 * The option datatype has been moved to a new theory Option. Renamed
2625 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
2627 * New predicate "strict_mono" classifies strict functions on partial
2628 orders. With strict functions on linear orders, reasoning about
2629 (in)equalities is facilitated by theorems "strict_mono_eq",
2630 "strict_mono_less_eq" and "strict_mono_less".
2632 * Some set operations are now proper qualified constants with
2633 authentic syntax. INCOMPATIBILITY:
2644 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
2647 * Auxiliary class "itself" has disappeared -- classes without any
2648 parameter are treated as expected by the 'class' command.
2650 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
2652 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
2653 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
2655 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
2656 method "approximation". It proves formulas on real values by using
2657 interval arithmetic. In the formulas are also the transcendental
2658 functions sin, cos, tan, atan, ln, exp and the constant pi are
2659 allowed. For examples see
2660 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
2662 * Theory "Reflection" now resides in HOL/Library.
2664 * Entry point to Word library now simply named "Word".
2667 * Made source layout more coherent with logical distribution
2670 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
2671 src/HOL/Library/Code_Message.thy ~> src/HOL/
2672 src/HOL/Library/GCD.thy ~> src/HOL/
2673 src/HOL/Library/Order_Relation.thy ~> src/HOL/
2674 src/HOL/Library/Parity.thy ~> src/HOL/
2675 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
2676 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
2677 src/HOL/Real/Lubs.thy ~> src/HOL/
2678 src/HOL/Real/PReal.thy ~> src/HOL/
2679 src/HOL/Real/Rational.thy ~> src/HOL/
2680 src/HOL/Real/RComplete.thy ~> src/HOL/
2681 src/HOL/Real/RealDef.thy ~> src/HOL/
2682 src/HOL/Real/RealPow.thy ~> src/HOL/
2683 src/HOL/Real/Real.thy ~> src/HOL/
2684 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
2685 src/HOL/Complex/Complex.thy ~> src/HOL/
2686 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
2687 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
2688 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
2689 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
2690 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
2691 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
2692 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
2693 src/HOL/Hyperreal/Log.thy ~> src/HOL/
2694 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
2695 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
2696 src/HOL/Hyperreal/Series.thy ~> src/HOL/
2697 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
2698 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
2699 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
2700 src/HOL/Real/Float ~> src/HOL/Library/
2701 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
2702 src/HOL/Real/RealVector.thy ~> src/HOL/
2704 src/HOL/arith_data.ML ~> src/HOL/Tools
2705 src/HOL/hologic.ML ~> src/HOL/Tools
2706 src/HOL/simpdata.ML ~> src/HOL/Tools
2707 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
2708 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
2709 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
2710 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
2711 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
2712 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
2713 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
2715 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
2716 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
2717 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
2718 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
2719 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
2720 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
2722 * If methods "eval" and "evaluation" encounter a structured proof
2723 state with !!/==>, only the conclusion is evaluated to True (if
2724 possible), avoiding strange error messages.
2726 * Method "sizechange" automates termination proofs using (a
2727 modification of) the size-change principle. Requires SAT solver. See
2728 src/HOL/ex/Termination.thy for examples.
2730 * Simplifier: simproc for let expressions now unfolds if bound
2731 variable occurs at most once in let expression body. INCOMPATIBILITY.
2733 * Method "arith": Linear arithmetic now ignores all inequalities when
2734 fast_arith_neq_limit is exceeded, instead of giving up entirely.
2736 * New attribute "arith" for facts that should always be used
2737 automatically by arithmetic. It is intended to be used locally in
2740 assumes [arith]: "x > 0"
2742 Global usage is discouraged because of possible performance impact.
2744 * New classes "top" and "bot" with corresponding operations "top" and
2745 "bot" in theory Orderings; instantiation of class "complete_lattice"
2746 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
2748 * Changed definition lemma "less_fun_def" in order to provide an
2749 instance for preorders on functions; use lemma "less_le" instead.
2752 * Theory Orderings: class "wellorder" moved here, with explicit
2753 induction rule "less_induct" as assumption. For instantiation of
2754 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
2757 * Theory Orderings: added class "preorder" as superclass of "order".
2758 INCOMPATIBILITY: Instantiation proofs for order, linorder
2759 etc. slightly changed. Some theorems named order_class.* now named
2762 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
2765 * Theory Finite_Set: added a new fold combinator of type
2767 ('a => 'b => 'b) => 'b => 'a set => 'b
2769 Occasionally this is more convenient than the old fold combinator
2770 which is now defined in terms of the new one and renamed to
2773 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
2774 and "ring_simps" have been replaced by "algebra_simps" (which can be
2775 extended with further lemmas!). At the moment both still exist but
2776 the former will disappear at some point.
2778 * Theory Power: Lemma power_Suc is now declared as a simp rule in
2779 class recpower. Type-specific simp rules for various recpower types
2780 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
2782 rat_power_0 -> power_0
2783 rat_power_Suc -> power_Suc
2784 realpow_0 -> power_0
2785 realpow_Suc -> power_Suc
2786 complexpow_0 -> power_0
2787 complexpow_Suc -> power_Suc
2788 power_poly_0 -> power_0
2789 power_poly_Suc -> power_Suc
2791 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
2792 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
2793 dvd has been generalized to class comm_semiring_1. Likewise a bunch
2794 of lemmas from Divides has been generalized from nat to class
2795 semiring_div. INCOMPATIBILITY. This involves the following theorem
2796 renames resulting from duplicate elimination:
2798 dvd_def_mod ~> dvd_eq_mod_eq_0
2799 zero_dvd_iff ~> dvd_0_left_iff
2800 dvd_0 ~> dvd_0_right
2801 DIVISION_BY_ZERO_DIV ~> div_by_0
2802 DIVISION_BY_ZERO_MOD ~> mod_by_0
2803 mult_div ~> div_mult_self2_is_id
2804 mult_mod ~> mod_mult_self2_is_0
2806 * Theory IntDiv: removed many lemmas that are instances of class-based
2807 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
2808 rename old lemmas as follows:
2810 dvd_diff -> nat_dvd_diff
2811 dvd_zminus_iff -> dvd_minus_iff
2812 mod_add1_eq -> mod_add_eq
2813 mod_mult1_eq -> mod_mult_right_eq
2814 mod_mult1_eq' -> mod_mult_left_eq
2815 mod_mult_distrib_mod -> mod_mult_eq
2816 nat_mod_add_left_eq -> mod_add_left_eq
2817 nat_mod_add_right_eq -> mod_add_right_eq
2818 nat_mod_div_trivial -> mod_div_trivial
2819 nat_mod_mod_trivial -> mod_mod_trivial
2820 zdiv_zadd_self1 -> div_add_self1
2821 zdiv_zadd_self2 -> div_add_self2
2822 zdiv_zmult_self1 -> div_mult_self2_is_id
2823 zdiv_zmult_self2 -> div_mult_self1_is_id
2824 zdvd_triv_left -> dvd_triv_left
2825 zdvd_triv_right -> dvd_triv_right
2826 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
2827 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
2828 zmod_zadd_left_eq -> mod_add_left_eq
2829 zmod_zadd_right_eq -> mod_add_right_eq
2830 zmod_zadd_self1 -> mod_add_self1
2831 zmod_zadd_self2 -> mod_add_self2
2832 zmod_zadd1_eq -> mod_add_eq
2833 zmod_zdiff1_eq -> mod_diff_eq
2834 zmod_zdvd_zmod -> mod_mod_cancel
2835 zmod_zmod_cancel -> mod_mod_cancel
2836 zmod_zmult_self1 -> mod_mult_self2_is_0
2837 zmod_zmult_self2 -> mod_mult_self1_is_0
2840 zdvd_abs1 -> abs_dvd_iff
2841 zdvd_abs2 -> dvd_abs_iff
2842 zdvd_refl -> dvd_refl
2843 zdvd_trans -> dvd_trans
2844 zdvd_zadd -> dvd_add
2845 zdvd_zdiff -> dvd_diff
2846 zdvd_zminus_iff -> dvd_minus_iff
2847 zdvd_zminus2_iff -> minus_dvd_iff
2848 zdvd_zmultD -> dvd_mult_right
2849 zdvd_zmultD2 -> dvd_mult_left
2850 zdvd_zmult_mono -> mult_dvd_mono
2851 zdvd_0_right -> dvd_0_right
2852 zdvd_0_left -> dvd_0_left_iff
2853 zdvd_1_left -> one_dvd
2854 zminus_dvd_iff -> minus_dvd_iff
2856 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
2858 * The real numbers offer decimal input syntax: 12.34 is translated
2859 into 1234/10^2. This translation is not reversed upon output.
2861 * Theory Library/Polynomial defines an abstract type 'a poly of
2862 univariate polynomials with coefficients of type 'a. In addition to
2863 the standard ring operations, it also supports div and mod. Code
2864 generation is also supported, using list-style constructors.
2866 * Theory Library/Inner_Product defines a class of real_inner for real
2867 inner product spaces, with an overloaded operation inner :: 'a => 'a
2868 => real. Class real_inner is a subclass of real_normed_vector from
2871 * Theory Library/Product_Vector provides instances for the product
2872 type 'a * 'b of several classes from RealVector and Inner_Product.
2873 Definitions of addition, subtraction, scalar multiplication, norms,
2874 and inner products are included.
2876 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
2877 addition to the field operations, numerals and case syntax are also
2880 * Theory Library/Diagonalize provides constructive version of Cantor's
2881 first diagonalization argument.
2883 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
2884 zlcm (for int); carried together from various gcd/lcm developements in
2885 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
2886 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
2887 may recover tupled syntax as follows:
2889 hide (open) const gcd
2890 abbreviation gcd where
2891 "gcd == (%(a, b). GCD.gcd a b)"
2893 GCD.gcd ("gcd '(_, _')")
2895 The same works for lcm, zgcd, zlcm.
2897 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
2898 instantiations for algebraic structures. Removed some duplicate
2899 theorems. Changes in simp rules. INCOMPATIBILITY.
2901 * ML antiquotation @{code} takes a constant as argument and generates
2902 corresponding code in background and inserts name of the corresponding
2903 resulting ML value/function/datatype constructor binding in place.
2904 All occurrences of @{code} with a single ML block are generated
2905 simultaneously. Provides a generic and safe interface for
2906 instrumentalizing code generation. See
2907 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
2908 In future you ought to refrain from ad-hoc compiling generated SML
2909 code on the ML toplevel. Note that (for technical reasons) @{code}
2910 cannot refer to constants for which user-defined serializations are
2911 set. Refer to the corresponding ML counterpart directly in that
2914 * Command 'rep_datatype': instead of theorem names the command now
2915 takes a list of terms denoting the constructors of the type to be
2916 represented as datatype. The characteristic theorems have to be
2917 proven. INCOMPATIBILITY. Also observe that the following theorems
2918 have disappeared in favour of existing ones:
2920 unit_induct ~> unit.induct
2921 prod_induct ~> prod.induct
2922 sum_induct ~> sum.induct
2923 Suc_Suc_eq ~> nat.inject
2924 Suc_not_Zero Zero_not_Suc ~> nat.distinct
2929 * New locales for orders and lattices where the equivalence relation
2930 is not restricted to equality. INCOMPATIBILITY: all order and lattice
2931 locales use a record structure with field eq for the equivalence.
2933 * New theory of factorial domains.
2935 * Units_l_inv and Units_r_inv are now simp rules by default.
2936 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
2937 and/or r_inv will now also require deletion of these lemmas.
2939 * Renamed the following theorems, INCOMPATIBILITY:
2941 UpperD ~> Upper_memD
2942 LowerD ~> Lower_memD
2943 least_carrier ~> least_closed
2944 greatest_carrier ~> greatest_closed
2945 greatest_Lower_above ~> greatest_Lower_below
2946 one_zero ~> carrier_one_zero
2947 one_not_zero ~> carrier_one_not_zero (collision with assumption)
2952 * Nominal datatypes can now contain type-variables.
2954 * Commands 'nominal_inductive' and 'equivariance' work with local
2957 * Nominal primrec can now works with local theory targets and its
2958 specification syntax now conforms to the general format as seen in
2961 * Method "perm_simp" honours the standard simplifier attributes
2962 (no_asm), (no_asm_use) etc.
2964 * The new predicate #* is defined like freshness, except that on the
2965 left hand side can be a set or list of atoms.
2967 * Experimental command 'nominal_inductive2' derives strong induction
2968 principles for inductive definitions. In contrast to
2969 'nominal_inductive', which can only deal with a fixed number of
2970 binders, it can deal with arbitrary expressions standing for sets of
2971 atoms to be avoided. The only inductive definition we have at the
2972 moment that needs this generalisation is the typing rule for Lets in
2975 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
2976 -----------------------------------------------------------------
2977 Gamma |- Let x be t1 in t2 : T2
2979 In this rule one wants to avoid all the binders that are introduced by
2980 "close Gamma T1". We are looking for other examples where this
2981 feature might be useful. Please let us know.
2986 * Reimplemented the simplification procedure for proving continuity
2987 subgoals. The new simproc is extensible; users can declare additional
2988 continuity introduction rules with the attribute [cont2cont].
2990 * The continuity simproc now uses a different introduction rule for
2991 solving continuity subgoals on terms with lambda abstractions. In
2992 some rare cases the new simproc may fail to solve subgoals that the
2993 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
2994 Potential INCOMPATIBILITY.
2996 * Command 'fixrec': specification syntax now conforms to the general
2997 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
2998 examples. INCOMPATIBILITY.
3003 * Proof of Zorn's Lemma for partial orders.
3008 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
3009 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
3010 depends on multithreading, so timouts will not work before Poly/ML
3013 * High-level support for concurrent ML programming, see
3014 src/Pure/Cuncurrent. The data-oriented model of "future values" is
3015 particularly convenient to organize independent functional
3016 computations. The concept of "synchronized variables" provides a
3017 higher-order interface for components with shared state, avoiding the
3018 delicate details of mutexes and condition variables. (Requires
3019 Poly/ML 5.2.1 or later.)
3021 * ML bindings produced via Isar commands are stored within the Isar
3022 context (theory or proof). Consequently, commands like 'use' and 'ML'
3023 become thread-safe and work with undo as expected (concerning
3024 top-level bindings, not side-effects on global references).
3025 INCOMPATIBILITY, need to provide proper Isar context when invoking the
3026 compiler at runtime; really global bindings need to be given outside a
3027 theory. (Requires Poly/ML 5.2 or later.)
3029 * Command 'ML_prf' is analogous to 'ML' but works within a proof
3030 context. Top-level ML bindings are stored within the proof context in
3031 a purely sequential fashion, disregarding the nested proof structure.
3032 ML bindings introduced by 'ML_prf' are discarded at the end of the
3033 proof. (Requires Poly/ML 5.2 or later.)
3035 * Simplified ML attribute and method setup, cf. functions Attrib.setup
3036 and Method.setup, as well as Isar commands 'attribute_setup' and
3037 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
3038 existing code accordingly, or use plain 'setup' together with old
3041 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
3042 to 'a -> thm, while results are always tagged with an authentic oracle
3043 name. The Isar command 'oracle' is now polymorphic, no argument type
3044 is specified. INCOMPATIBILITY, need to simplify existing oracle code
3045 accordingly. Note that extra performance may be gained by producing
3046 the cterm carefully, avoiding slow Thm.cterm_of.
3048 * Simplified interface for defining document antiquotations via
3049 ThyOutput.antiquotation, ThyOutput.output, and optionally
3050 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
3051 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
3054 * More systematic treatment of long names, abstract name bindings, and
3055 name space operations. Basic operations on qualified names have been
3056 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
3057 Long_Name.append. Old type bstring has been mostly replaced by
3058 abstract type binding (see structure Binding), which supports precise
3059 qualification by packages and local theory targets, as well as proper
3060 tracking of source positions. INCOMPATIBILITY, need to wrap old
3061 bstring values into Binding.name, or better pass through abstract
3062 bindings everywhere. See further src/Pure/General/long_name.ML,
3063 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
3065 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
3066 LocalTheory.note etc.) now refer to the *full* internal name, not the
3067 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
3069 * Disposed old type and term read functions (Sign.read_def_typ,
3070 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
3071 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
3072 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
3073 Syntax.read_term_global etc.; see also OldGoals.read_term as last
3074 resort for legacy applications.
3076 * Disposed old declarations, tactics, tactic combinators that refer to
3077 the simpset or claset of an implicit theory (such as Addsimps,
3078 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
3079 embedded ML text, or local_simpset_of with a proper context passed as
3080 explicit runtime argument.
3082 * Rules and tactics that read instantiations (read_instantiate,
3083 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
3084 context, which is required for parsing and type-checking. Moreover,
3085 the variables are specified as plain indexnames, not string encodings
3086 thereof. INCOMPATIBILITY.
3088 * Generic Toplevel.add_hook interface allows to analyze the result of
3089 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
3090 for theorem dependency output of transactions resulting in a new
3093 * ML antiquotations: block-structured compilation context indicated by
3094 \<lbrace> ... \<rbrace>; additional antiquotation forms:
3096 @{binding name} - basic name binding
3097 @{let ?pat = term} - term abbreviation (HO matching)
3098 @{note name = fact} - fact abbreviation
3099 @{thm fact} - singleton fact (with attributes)
3100 @{thms fact} - general fact (with attributes)
3101 @{lemma prop by method} - singleton goal
3102 @{lemma prop by meth1 meth2} - singleton goal
3103 @{lemma prop1 ... propN by method} - general goal
3104 @{lemma prop1 ... propN by meth1 meth2} - general goal
3105 @{lemma (open) ...} - open derivation
3110 * The Isabelle "emacs" tool provides a specific interface to invoke
3111 Proof General / Emacs, with more explicit failure if that is not
3112 installed (the old isabelle-interface script silently falls back on
3113 isabelle-process). The PROOFGENERAL_HOME setting determines the
3114 installation location of the Proof General distribution.
3116 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
3117 the Isabelle process into a JVM/Scala application. See
3118 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
3119 process wrapper has been discontinued.)
3121 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
3123 * Various status messages (with exact source position information) are
3124 emitted, if proper markup print mode is enabled. This allows
3125 user-interface components to provide detailed feedback on internal
3130 New in Isabelle2008 (June 2008)
3131 -------------------------------
3135 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
3136 and updated, with formally checked references as hyperlinks.
3138 * Theory loader: use_thy (and similar operations) no longer set the
3139 implicit ML context, which was occasionally hard to predict and in
3140 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
3141 provides a proper context already.
3143 * Theory loader: old-style ML proof scripts being *attached* to a thy
3144 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
3145 'use' within a theory file will do the job.
3147 * Name space merge now observes canonical order, i.e. the second space
3148 is inserted into the first one, while existing entries in the first
3149 space take precedence. INCOMPATIBILITY in rare situations, may try to
3150 swap theory imports.
3152 * Syntax: symbol \<chi> is now considered a letter. Potential
3153 INCOMPATIBILITY in identifier syntax etc.
3155 * Outer syntax: string tokens no longer admit escaped white space,
3156 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
3157 white space without escapes.
3159 * Outer syntax: string tokens may contain arbitrary character codes
3160 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
3166 * Context-dependent token translations. Default setup reverts locally
3167 fixed variables, and adds hilite markup for undeclared frees.
3169 * Unused theorems can be found using the new command 'unused_thms'.
3170 There are three ways of invoking it:
3173 Only finds unused theorems in the current theory.
3175 (2) unused_thms thy_1 ... thy_n -
3176 Finds unused theorems in the current theory and all of its ancestors,
3177 excluding the theories thy_1 ... thy_n and all of their ancestors.
3179 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
3180 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
3181 their ancestors, excluding the theories thy_1 ... thy_n and all of
3184 In order to increase the readability of the list produced by
3185 unused_thms, theorems that have been created by a particular instance
3186 of a theory command such as 'inductive' or 'function' are considered
3187 to belong to the same "group", meaning that if at least one theorem in
3188 this group is used, the other theorems in the same group are no longer
3189 reported as unused. Moreover, if all theorems in the group are
3190 unused, only one theorem in the group is displayed.
3192 Note that proof objects have to be switched on in order for
3193 unused_thms to work properly (i.e. !proofs must be >= 1, which is
3194 usually the case when using Proof General with the default settings).
3196 * Authentic naming of facts disallows ad-hoc overwriting of previous
3197 theorems within the same name space. INCOMPATIBILITY, need to remove
3198 duplicate fact bindings, or even accidental fact duplications. Note
3199 that tools may maintain dynamically scoped facts systematically, using
3200 PureThy.add_thms_dynamic.
3202 * Command 'hide' now allows to hide from "fact" name space as well.
3204 * Eliminated destructive theorem database, simpset, claset, and
3205 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
3206 update of theories within ML code.
3208 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
3209 INCOMPATIBILITY, object-logics depending on former Pure require
3210 additional setup PureThy.old_appl_syntax_setup; object-logics
3211 depending on former CPure need to refer to Pure.
3213 * Commands 'use' and 'ML' are now purely functional, operating on
3214 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
3215 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
3218 * Command 'setup': discontinued implicit version with ML reference.
3220 * Instantiation target allows for simultaneous specification of class
3221 instance operations together with an instantiation proof.
3222 Type-checking phase allows to refer to class operations uniformly.
3223 See src/HOL/Complex/Complex.thy for an Isar example and
3224 src/HOL/Library/Eval.thy for an ML example.
3226 * Indexing of literal facts: be more serious about including only
3227 facts from the visible specification/proof context, but not the
3228 background context (locale etc.). Affects `prop` notation and method
3229 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
3232 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
3233 "(open)" option, which used to expose internal bound variables to the
3236 * Isar statements: removed obsolete case "rule_context".
3237 INCOMPATIBILITY, better use explicit fixes/assumes.
3239 * Locale proofs: default proof step now includes 'unfold_locales';
3240 hence 'proof' without argument may be used to unfold locale
3244 *** Document preparation ***
3246 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
3247 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
3248 obsolete thumbpdf setup (contemporary PDF viewers do this on the
3249 spot); renamed link color from "darkblue" to "linkcolor" (default
3250 value unchanged, can be redefined via \definecolor); no longer sets
3251 "a4paper" option (unnecessary or even intrusive).
3253 * Antiquotation @{lemma A method} proves proposition A by the given
3254 method (either a method name or a method name plus (optional) method
3255 arguments in parentheses) and prints A just like @{prop A}.
3260 * New primrec package. Specification syntax conforms in style to
3261 definition/function/.... No separate induction rule is provided. The
3262 "primrec" command distinguishes old-style and new-style specifications
3263 by syntax. The former primrec package is now named OldPrimrecPackage.
3264 When adjusting theories, beware: constants stemming from new-style
3265 primrec specifications have authentic syntax.
3267 * Metis prover is now an order of magnitude faster, and also works
3268 with multithreading.
3270 * Metis: the maximum number of clauses that can be produced from a
3271 theorem is now given by the attribute max_clauses. Theorems that
3272 exceed this number are ignored, with a warning printed.
3274 * Sledgehammer no longer produces structured proofs by default. To
3275 enable, declare [[sledgehammer_full = true]]. Attributes
3276 reconstruction_modulus, reconstruction_sorts renamed
3277 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
3279 * Method "induct_scheme" derives user-specified induction rules
3280 from well-founded induction and completeness of patterns. This factors
3281 out some operations that are done internally by the function package
3282 and makes them available separately. See
3283 src/HOL/ex/Induction_Scheme.thy for examples.
3285 * More flexible generation of measure functions for termination
3286 proofs: Measure functions can be declared by proving a rule of the
3287 form "is_measure f" and giving it the [measure_function] attribute.
3288 The "is_measure" predicate is logically meaningless (always true), and
3289 just guides the heuristic. To find suitable measure functions, the
3290 termination prover sets up the goal "is_measure ?f" of the appropriate
3291 type and generates all solutions by prolog-style backwards proof using
3294 This setup also deals with rules like
3296 "is_measure f ==> is_measure (list_size f)"
3298 which accommodates nested datatypes that recurse through lists.
3299 Similar rules are predeclared for products and option types.
3301 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
3305 - Definitions of overloaded constants on sets have to be replaced by
3306 definitions on => and bool.
3308 - Some definitions of overloaded operators on sets can now be proved
3309 using the definitions of the operators on => and bool. Therefore,
3310 the following theorems have been renamed:
3312 subset_def -> subset_eq
3313 psubset_def -> psubset_eq
3314 set_diff_def -> set_diff_eq
3315 Compl_def -> Compl_eq
3316 Sup_set_def -> Sup_set_eq
3317 Inf_set_def -> Inf_set_eq
3318 sup_set_def -> sup_set_eq
3319 inf_set_def -> inf_set_eq
3321 - Due to the incompleteness of the HO unification algorithm, some
3322 rules such as subst may require manual instantiation, if some of
3323 the unknowns in the rule is a set.
3325 - Higher order unification and forward proofs:
3328 have "P (S::'a set)" <...>
3329 then have "EX S. P S" ..
3331 no longer works (due to the incompleteness of the HO unification
3332 algorithm) and must be replaced by the pattern
3339 - Calculational reasoning with subst (or similar rules):
3342 have "P (S::'a set)" <...>
3343 also have "S = T" <...>
3344 finally have "P T" .
3346 no longer works (for similar reasons as the previous example) and
3347 must be replaced by something like
3349 have "P (S::'a set)" <...>
3350 moreover have "S = T" <...>
3351 ultimately have "P T" by simp
3353 - Tactics or packages written in ML code:
3354 Code performing pattern matching on types via
3356 Type ("set", [T]) => ...
3358 must be rewritten. Moreover, functions like strip_type or
3359 binder_types no longer return the right value when applied to a
3362 T1 => ... => Tn => U => bool
3366 T1 => ... => Tn => U set
3368 * Merged theories Wellfounded_Recursion, Accessible_Part and
3369 Wellfounded_Relations to theory Wellfounded.
3371 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
3373 * Class finite no longer treats UNIV as class parameter. Use class
3374 enum from theory Library/Enum instead to achieve a similar effect.
3377 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
3378 and "Cons". INCOMPATIBILITY.
3380 * HOL (and FOL): renamed variables in rules imp_elim and swap.
3381 Potential INCOMPATIBILITY.
3383 * Theory Product_Type: duplicated lemmas split_Pair_apply and
3384 injective_fst_snd removed, use split_eta and prod_eqI instead.
3385 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
3387 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
3388 the same name in theory Orderings:
3398 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
3399 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
3400 and different variable names.
3402 * Library/Option_ord.thy: Canonical order on option type.
3404 * Library/RBT.thy: Red-black trees, an efficient implementation of
3407 * Library/Countable.thy: Type class for countable types.
3409 * Theory Int: The representation of numerals has changed. The infix
3410 operator BIT and the bit datatype with constructors B0 and B1 have
3411 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
3412 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
3413 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
3416 * Theory Nat: definition of <= and < on natural numbers no longer
3417 depend on well-founded relations. INCOMPATIBILITY. Definitions
3418 le_def and less_def have disappeared. Consider lemmas not_less
3419 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
3421 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
3422 (whose purpose mainly is for various fold_set functionals) have been
3423 abandoned in favor of the existing algebraic classes
3424 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
3425 lower_semilattice (resp. upper_semilattice) and linorder.
3428 * Theory Transitive_Closure: induct and cases rules now declare proper
3429 case_names ("base" and "step"). INCOMPATIBILITY.
3431 * Theorem Inductive.lfp_ordinal_induct generalized to complete
3432 lattices. The form set-specific version is available as
3433 Inductive.lfp_ordinal_induct_set.
3435 * Renamed theorems "power.simps" to "power_int.simps".
3438 * Class semiring_div provides basic abstract properties of semirings
3439 with division and modulo operations. Subsumes former class dvd_mod.
3441 * Merged theories IntDef, Numeral and IntArith into unified theory
3442 Int. INCOMPATIBILITY.
3444 * Theory Library/Code_Index: type "index" now represents natural
3445 numbers rather than integers. INCOMPATIBILITY.
3447 * New class "uminus" with operation "uminus" (split of from class
3448 "minus" which now only has operation "minus", binary).
3451 * Constants "card", "internal_split", "option_map" now with authentic
3452 syntax. INCOMPATIBILITY.
3454 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
3455 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
3456 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
3457 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
3458 Sup_set_def, le_def, less_def, option_map_def now with object
3459 equality. INCOMPATIBILITY.
3461 * Records. Removed K_record, and replaced it by pure lambda term
3462 %x. c. The simplifier setup is now more robust against eta expansion.
3463 INCOMPATIBILITY: in cases explicitly referring to K_record.
3465 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
3467 * Library/ListVector: new theory of arithmetic vector operations.
3469 * Library/Order_Relation: new theory of various orderings as sets of
3470 pairs. Defines preorders, partial orders, linear orders and
3471 well-orders on sets and on types.
3476 * Renamed some theories to allow to loading both ZF and HOL in the
3479 Datatype -> Datatype_ZF
3480 Inductive -> Inductive_ZF
3487 INCOMPATIBILITY: ZF theories that import individual theories below
3488 Main might need to be adapted. Regular theory Main is still
3489 available, as trivial extension of Main_ZF.
3494 * ML within Isar: antiquotation @{const name} or @{const
3495 name(typargs)} produces statically-checked Const term.
3497 * Functor NamedThmsFun: data is available to the user as dynamic fact
3498 (of the same name). Removed obsolete print command.
3500 * Removed obsolete "use_legacy_bindings" function.
3502 * The ``print mode'' is now a thread-local value derived from a global
3503 template (the former print_mode reference), thus access becomes
3504 non-critical. The global print_mode reference is for session
3505 management only; user-code should use print_mode_value,
3506 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
3508 * Functions system/system_out provide a robust way to invoke external
3509 shell commands, with propagation of interrupts (requires Poly/ML
3510 5.2.1). Do not use OS.Process.system etc. from the basis library!
3515 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
3516 in accordance with Proof General 3.7, which prefers GNU emacs.
3518 * isatool tty runs Isabelle process with plain tty interaction;
3519 optional line editor may be specified via ISABELLE_LINE_EDITOR
3520 setting, the default settings attempt to locate "ledit" and "rlwrap".
3522 * isatool browser now works with Cygwin as well, using general
3523 "javapath" function defined in Isabelle process environment.
3525 * YXML notation provides a simple and efficient alternative to
3526 standard XML transfer syntax. See src/Pure/General/yxml.ML and
3527 isatool yxml as described in the Isabelle system manual.
3529 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
3530 provides general wrapper for managing an Isabelle process in a robust
3531 fashion, with ``cooked'' output from stdin/stderr.
3533 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
3534 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
3536 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
3537 way of changing the user's settings is via
3538 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
3541 * Multithreading.max_threads := 0 refers to the number of actual CPU
3542 cores of the underlying machine, which is a good starting point for
3543 optimal performance tuning. The corresponding usedir option -M allows
3544 "max" as an alias for "0". WARNING: does not work on certain versions
3545 of Mac OS (with Poly/ML 5.1).
3547 * isabelle-process: non-ML sessions are run with "nice", to reduce the
3548 adverse effect of Isabelle flooding interactive front-ends (notably
3549 ProofGeneral / XEmacs).
3553 New in Isabelle2007 (November 2007)
3554 -----------------------------------
3558 * More uniform information about legacy features, notably a
3559 warning/error of "Legacy feature: ...", depending on the state of the
3560 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
3561 legacy features will disappear eventually.
3563 * Theory syntax: the header format ``theory A = B + C:'' has been
3564 discontinued in favour of ``theory A imports B C begin''. Use isatool
3565 fixheaders to convert existing theory files. INCOMPATIBILITY.
3567 * Theory syntax: the old non-Isar theory file format has been
3568 discontinued altogether. Note that ML proof scripts may still be used
3569 with Isar theories; migration is usually quite simple with the ML
3570 function use_legacy_bindings. INCOMPATIBILITY.
3572 * Theory syntax: some popular names (e.g. 'class', 'declaration',
3573 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
3576 * Theory loader: be more serious about observing the static theory
3577 header specifications (including optional directories), but not the
3578 accidental file locations of previously successful loads. The strict
3579 update policy of former update_thy is now already performed by
3580 use_thy, so the former has been removed; use_thys updates several
3581 theories simultaneously, just as 'imports' within a theory header
3582 specification, but without merging the results. Potential
3583 INCOMPATIBILITY: may need to refine theory headers and commands
3584 ROOT.ML which depend on load order.
3586 * Theory loader: optional support for content-based file
3587 identification, instead of the traditional scheme of full physical
3588 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
3589 (cf. the system manual). The new scheme allows to work with
3590 non-finished theories in persistent session images, such that source
3591 files may be moved later on without requiring reloads.
3593 * Theory loader: old-style ML proof scripts being *attached* to a thy
3594 file (with the same base name as the theory) are considered a legacy
3595 feature, which will disappear eventually. Even now, the theory loader
3596 no longer maintains dependencies on such files.
3598 * Syntax: the scope for resolving ambiguities via type-inference is
3599 now limited to individual terms, instead of whole simultaneous
3600 specifications as before. This greatly reduces the complexity of the
3601 syntax module and improves flexibility by separating parsing and
3602 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
3603 'fixes' etc.) are required in rare situations.
3605 * Syntax: constants introduced by new-style packages ('definition',
3606 'abbreviation' etc.) are passed through the syntax module in
3607 ``authentic mode''. This means that associated mixfix annotations
3608 really stick to such constants, independently of potential name space
3609 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
3610 trees are represented slightly differently, may need to adapt syntax
3611 translations accordingly. Use CONST marker in 'translations' and
3612 @{const_syntax} antiquotation in 'parse_translation' etc.
3614 * Legacy goal package: reduced interface to the bare minimum required
3615 to keep existing proof scripts running. Most other user-level
3616 functions are now part of the OldGoals structure, which is *not* open
3617 by default (consider isatool expandshort before open OldGoals).
3618 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
3619 these tend to cause confusion about the actual goal (!) context being
3620 used here, which is not necessarily the same as the_context().
3622 * Command 'find_theorems': supports "*" wild-card in "name:"
3623 criterion; "with_dups" option. Certain ProofGeneral versions might
3624 support a specific search form (see ProofGeneral/CHANGES).
3626 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
3627 by default, which means that "prems" (and also "fixed variables") are
3628 suppressed from proof state output. Note that the ProofGeneral
3629 settings mechanism allows to change and save options persistently, but
3630 older versions of Isabelle will fail to start up if a negative prems
3633 * Local theory targets may be specified by non-nested blocks of
3634 ``context/locale/class ... begin'' followed by ``end''. The body may
3635 contain definitions, theorems etc., including any derived mechanism
3636 that has been implemented on top of these primitives. This concept
3637 generalizes the existing ``theorem (in ...)'' towards more versatility
3640 * Proof General interface: proper undo of final 'end' command;
3641 discontinued Isabelle/classic mode (ML proof scripts).
3644 *** Document preparation ***
3646 * Added antiquotation @{theory name} which prints the given name,
3647 after checking that it refers to a valid ancestor theory in the
3650 * Added antiquotations @{ML_type text} and @{ML_struct text} which
3651 check the given source text as ML type/structure, printing verbatim.
3653 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
3654 "c args == rhs" given in the current context. (Any number of
3655 arguments may be given on the LHS.)
3660 * The 'class' package offers a combination of axclass and locale to
3661 achieve Haskell-like type classes in Isabelle. Definitions and
3662 theorems within a class context produce both relative results (with
3663 implicit parameters according to the locale context), and polymorphic
3664 constants with qualified polymorphism (according to the class
3665 context). Within the body context of a 'class' target, a separate
3666 syntax layer ("user space type system") takes care of converting
3667 between global polymorphic consts and internal locale representation.
3668 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
3669 "isatool doc classes" provides a tutorial.
3671 * Generic code generator framework allows to generate executable
3672 code for ML and Haskell (including Isabelle classes). A short usage
3675 internal compilation:
3676 export_code <list of constants (term syntax)> in SML
3677 writing SML code to a file:
3678 export_code <list of constants (term syntax)> in SML <filename>
3679 writing OCaml code to a file:
3680 export_code <list of constants (term syntax)> in OCaml <filename>
3681 writing Haskell code to a bunch of files:
3682 export_code <list of constants (term syntax)> in Haskell <filename>
3684 evaluating closed propositions to True/False using code generation:
3687 Reasonable default setup of framework in HOL.
3689 Theorem attributs for selecting and transforming function equations theorems:
3691 [code fun]: select a theorem as function equation for a specific constant
3692 [code fun del]: deselect a theorem as function equation for a specific constant
3693 [code inline]: select an equation theorem for unfolding (inlining) in place
3694 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
3696 User-defined serializations (target in {SML, OCaml, Haskell}):
3698 code_const <and-list of constants (term syntax)>
3699 {(target) <and-list of const target syntax>}+
3701 code_type <and-list of type constructors>
3702 {(target) <and-list of type target syntax>}+
3704 code_instance <and-list of instances>
3706 where instance ::= <type constructor> :: <class>
3708 code_class <and_list of classes>
3709 {(target) <and-list of class target syntax>}+
3710 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
3712 code_instance and code_class only are effective to target Haskell.
3714 For example usage see src/HOL/ex/Codegenerator.thy and
3715 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
3716 generation from Isabelle/HOL theories is available via "isatool doc
3719 * Code generator: consts in 'consts_code' Isar commands are now
3720 referred to by usual term syntax (including optional type
3723 * Command 'no_translations' removes translation rules from theory
3726 * Overloaded definitions are now actually checked for acyclic
3727 dependencies. The overloading scheme is slightly more general than
3728 that of Haskell98, although Isabelle does not demand an exact
3729 correspondence to type class and instance declarations.
3730 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
3731 exotic versions of overloading -- at the discretion of the user!
3733 Polymorphic constants are represented via type arguments, i.e. the
3734 instantiation that matches an instance against the most general
3735 declaration given in the signature. For example, with the declaration
3736 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
3737 as c(nat). Overloading is essentially simultaneous structural
3738 recursion over such type arguments. Incomplete specification patterns
3739 impose global constraints on all occurrences, e.g. c('a * 'a) on the
3740 LHS means that more general c('a * 'b) will be disallowed on any RHS.
3741 Command 'print_theory' outputs the normalized system of recursive
3742 equations, see section "definitions".
3744 * Configuration options are maintained within the theory or proof
3745 context (with name and type bool/int/string), providing a very simple
3746 interface to a poor-man's version of general context data. Tools may
3747 declare options in ML (e.g. using Attrib.config_int) and then refer to
3748 these values using Config.get etc. Users may change options via an
3749 associated attribute of the same name. This form of context
3750 declaration works particularly well with commands 'declare' or
3751 'using', for example ``declare [[foo = 42]]''. Thus it has become
3752 very easy to avoid global references, which would not observe Isar
3753 toplevel undo/redo and fail to work with multithreading.
3755 Various global ML references of Pure and HOL have been turned into
3756 configuration options:
3758 Unify.search_bound unify_search_bound
3759 Unify.trace_bound unify_trace_bound
3760 Unify.trace_simp unify_trace_simp
3761 Unify.trace_types unify_trace_types
3762 Simplifier.simp_depth_limit simp_depth_limit
3763 Blast.depth_limit blast_depth_limit
3764 DatatypeProp.dtK datatype_distinctness_limit
3765 fast_arith_neq_limit fast_arith_neq_limit
3766 fast_arith_split_limit fast_arith_split_limit
3768 * Named collections of theorems may be easily installed as context
3769 data using the functor NamedThmsFun (see also
3770 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
3771 attributes; there is also a toplevel print command. This facility is
3772 just a common case of general context data, which is the preferred way
3773 for anything more complex than just a list of facts in canonical
3776 * Isar: command 'declaration' augments a local theory by generic
3777 declaration functions written in ML. This enables arbitrary content
3778 being added to the context, depending on a morphism that tells the
3779 difference of the original declaration context wrt. the application
3780 context encountered later on.
3782 * Isar: proper interfaces for simplification procedures. Command
3783 'simproc_setup' declares named simprocs (with match patterns, and body
3784 text in ML). Attribute "simproc" adds/deletes simprocs in the current
3785 context. ML antiquotation @{simproc name} retrieves named simprocs.
3787 * Isar: an extra pair of brackets around attribute declarations
3788 abbreviates a theorem reference involving an internal dummy fact,
3789 which will be ignored later --- only the effect of the attribute on
3790 the background context will persist. This form of in-place
3791 declarations is particularly useful with commands like 'declare' and
3792 'using', for example ``have A using [[simproc a]] by simp''.
3794 * Isar: method "assumption" (and implicit closing of subproofs) now
3795 takes simple non-atomic goal assumptions into account: after applying
3796 an assumption as a rule the resulting subgoals are solved by atomic
3797 assumption steps. This is particularly useful to finish 'obtain'
3798 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
3799 without referring to the original premise "!!x. P x ==> thesis" in the
3800 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
3803 * Isar: implicit use of prems from the Isar proof context is
3804 considered a legacy feature. Common applications like ``have A .''
3805 may be replaced by ``have A by fact'' or ``note `A`''. In general,
3806 referencing facts explicitly here improves readability and
3807 maintainability of proof texts.
3809 * Isar: improper proof element 'guess' is like 'obtain', but derives
3810 the obtained context from the course of reasoning! For example:
3812 assume "EX x y. A x & B y" -- "any previous fact"
3813 then guess x and y by clarify
3815 This technique is potentially adventurous, depending on the facts and
3816 proof tools being involved here.
3818 * Isar: known facts from the proof context may be specified as literal
3819 propositions, using ASCII back-quote syntax. This works wherever
3820 named facts used to be allowed so far, in proof commands, proof
3821 methods, attributes etc. Literal facts are retrieved from the context
3822 according to unification of type and term parameters. For example,
3823 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
3824 theorems in the current context, then these are valid literal facts:
3825 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
3827 There is also a proof method "fact" which does the same composition
3828 for explicit goal states, e.g. the following proof texts coincide with
3829 certain special cases of literal facts:
3831 have "A" by fact == note `A`
3832 have "A ==> B" by fact == note `A ==> B`
3833 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
3834 have "P a ==> Q a" by fact == note `P a ==> Q a`
3836 * Isar: ":" (colon) is no longer a symbolic identifier character in
3837 outer syntax. Thus symbolic identifiers may be used without
3838 additional white space in declarations like this: ``assume *: A''.
3840 * Isar: 'print_facts' prints all local facts of the current context,
3841 both named and unnamed ones.
3843 * Isar: 'def' now admits simultaneous definitions, e.g.:
3845 def x == "t" and y == "u"
3847 * Isar: added command 'unfolding', which is structurally similar to
3848 'using', but affects both the goal state and facts by unfolding given
3849 rewrite rules. Thus many occurrences of the 'unfold' method or
3850 'unfolded' attribute may be replaced by first-class proof text.
3852 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
3853 and command 'unfolding' now all support object-level equalities
3854 (potentially conditional). The underlying notion of rewrite rule is
3855 analogous to the 'rule_format' attribute, but *not* that of the
3856 Simplifier (which is usually more generous).
3858 * Isar: the new attribute [rotated n] (default n = 1) rotates the
3859 premises of a theorem by n. Useful in conjunction with drule.
3861 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
3862 method expression within a sandbox consisting of the first N
3863 sub-goals, which need to exist. For example, ``simp_all [3]''
3864 simplifies the first three sub-goals, while (rule foo, simp_all)[]
3865 simplifies all new goals that emerge from applying rule foo to the
3866 originally first one.
3868 * Isar: schematic goals are no longer restricted to higher-order
3869 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
3872 * Isar: the conclusion of a long theorem statement is now either
3873 'shows' (a simultaneous conjunction, as before), or 'obtains'
3874 (essentially a disjunction of cases with local parameters and
3875 assumptions). The latter allows to express general elimination rules
3876 adequately; in this notation common elimination rules look like this:
3878 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
3880 obtains x where "P x"
3882 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
3886 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
3892 The subsequent classical rules even refer to the formal "thesis"
3895 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
3898 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
3899 obtains "thesis ==> something"
3901 The actual proof of an 'obtains' statement is analogous to that of the
3902 Isar proof element 'obtain', only that there may be several cases.
3903 Optional case names may be specified in parentheses; these will be
3904 available both in the present proof and as annotations in the
3905 resulting rule, for later use with the 'cases' method (cf. attribute
3908 * Isar: the assumptions of a long theorem statement are available as
3909 "assms" fact in the proof context. This is more appropriate than the
3910 (historical) "prems", which refers to all assumptions of the current
3911 context, including those from the target locale, proof body etc.
3913 * Isar: 'print_statement' prints theorems from the current theory or
3914 proof context in long statement form, according to the syntax of a
3917 * Isar: 'obtain' takes an optional case name for the local context
3918 introduction rule (default "that").
3920 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
3921 explicit (is "_ ==> ?foo") in the rare cases where this still happens
3924 * Pure: syntax "CONST name" produces a fully internalized constant
3925 according to the current context. This is particularly useful for
3926 syntax translations that should refer to internal constant
3927 representations independently of name spaces.
3929 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
3930 instead of "FOO ". This allows multiple binder declarations to coexist
3931 in the same context. INCOMPATIBILITY.
3933 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
3934 primitive that also works in a locale context (both for constants and
3935 fixed variables). Type declaration and internal syntactic representation
3936 of given constants retrieved from the context. Likewise, the
3937 'no_notation' command allows to remove given syntax annotations from the
3940 * Isar/locales: new derived specification elements 'axiomatization',
3941 'definition', 'abbreviation', which support type-inference, admit
3942 object-level specifications (equality, equivalence). See also the
3943 isar-ref manual. Examples:
3946 eq (infix "===" 50) where
3947 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
3949 definition "f x y = x + y + 1"
3950 definition g where "g x = f x x"
3953 neq (infix "=!=" 50) where
3954 "x =!= y == ~ (x === y)"
3956 These specifications may be also used in a locale context. Then the
3957 constants being introduced depend on certain fixed parameters, and the
3958 constant name is qualified by the locale base name. An internal
3959 abbreviation takes care for convenient input and output, making the
3960 parameters implicit and using the original short name. See also
3961 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
3962 entities from a monomorphic theory.
3964 Presently, abbreviations are only available 'in' a target locale, but
3965 not inherited by general import expressions. Also note that
3966 'abbreviation' may be used as a type-safe replacement for 'syntax' +
3967 'translations' in common applications. The "no_abbrevs" print mode
3968 prevents folding of abbreviations in term output.
3970 Concrete syntax is attached to specified constants in internal form,
3971 independently of name spaces. The parse tree representation is
3972 slightly different -- use 'notation' instead of raw 'syntax', and
3973 'translations' with explicit "CONST" markup to accommodate this.
3975 * Pure/Isar: unified syntax for new-style specification mechanisms
3976 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
3977 full type inference and dummy patterns ("_"). For example:
3979 definition "K x _ = x"
3981 inductive conj for A B
3982 where "A ==> B ==> conj A B"
3984 * Pure: command 'print_abbrevs' prints all constant abbreviations of
3985 the current context. Print mode "no_abbrevs" prevents inversion of
3986 abbreviations on output.
3988 * Isar/locales: improved parameter handling: use of locales "var" and
3989 "struct" no longer necessary; - parameter renamings are no longer
3990 required to be injective. For example, this allows to define
3991 endomorphisms as locale endom = homom mult mult h.
3993 * Isar/locales: changed the way locales with predicates are defined.
3994 Instead of accumulating the specification, the imported expression is
3995 now an interpretation. INCOMPATIBILITY: different normal form of
3996 locale expressions. In particular, in interpretations of locales with
3997 predicates, goals repesenting already interpreted fragments are not
3998 removed automatically. Use methods `intro_locales' and
3999 `unfold_locales'; see below.
4001 * Isar/locales: new methods `intro_locales' and `unfold_locales'
4002 provide backward reasoning on locales predicates. The methods are
4003 aware of interpretations and discharge corresponding goals.
4004 `intro_locales' is less aggressive then `unfold_locales' and does not
4005 unfold predicates to assumptions.
4007 * Isar/locales: the order in which locale fragments are accumulated
4008 has changed. This enables to override declarations from fragments due
4009 to interpretations -- for example, unwanted simp rules.
4011 * Isar/locales: interpretation in theories and proof contexts has been
4012 extended. One may now specify (and prove) equations, which are
4013 unfolded in interpreted theorems. This is useful for replacing
4014 defined concepts (constants depending on locale parameters) by
4015 concepts already existing in the target context. Example:
4017 interpretation partial_order ["op <= :: [int, int] => bool"]
4018 where "partial_order.less (op <=) (x::int) y = (x < y)"
4020 Typically, the constant `partial_order.less' is created by a
4021 definition specification element in the context of locale
4024 * Method "induct": improved internal context management to support
4025 local fixes and defines on-the-fly. Thus explicit meta-level
4026 connectives !! and ==> are rarely required anymore in inductive goals
4027 (using object-logic connectives for this purpose has been long
4028 obsolete anyway). Common proof patterns are explained in
4029 src/HOL/Induct/Common_Patterns.thy, see also
4030 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
4033 * Method "induct": improved handling of simultaneous goals. Instead of
4034 introducing object-level conjunction, the statement is now split into
4035 several conclusions, while the corresponding symbolic cases are nested
4036 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
4037 see src/HOL/Induct/Common_Patterns.thy, for example.
4039 * Method "induct": mutual induction rules are now specified as a list
4040 of rule sharing the same induction cases. HOL packages usually provide
4041 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
4042 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
4043 mutual induction rules differently, i.e. like this:
4045 (induct rule: foo_bar.inducts)
4046 (induct set: foo bar)
4047 (induct pred: foo bar)
4048 (induct type: foo bar)
4050 The ML function ProjectRule.projections turns old-style rules into the
4053 * Method "coinduct": dual of induction, see
4054 src/HOL/Library/Coinductive_List.thy for various examples.
4056 * Method "cases", "induct", "coinduct": the ``(open)'' option is
4057 considered a legacy feature.
4059 * Attribute "symmetric" produces result with standardized schematic
4060 variables (index 0). Potential INCOMPATIBILITY.
4062 * Simplifier: by default the simplifier trace only shows top level
4063 rewrites now. That is, trace_simp_depth_limit is set to 1 by
4064 default. Thus there is less danger of being flooded by the trace. The
4065 trace indicates where parts have been suppressed.
4067 * Provers/classical: removed obsolete classical version of elim_format
4068 attribute; classical elim/dest rules are now treated uniformly when
4069 manipulating the claset.
4071 * Provers/classical: stricter checks to ensure that supplied intro,
4072 dest and elim rules are well-formed; dest and elim rules must have at
4075 * Provers/classical: attributes dest/elim/intro take an optional
4076 weight argument for the rule (just as the Pure versions). Weights are
4077 ignored by automated tools, but determine the search order of single
4080 * Syntax: input syntax now supports dummy variable binding "%_. b",
4081 where the body does not mention the bound variable. Note that dummy
4082 patterns implicitly depend on their context of bounds, which makes
4083 "{_. _}" match any set comprehension as expected. Potential
4084 INCOMPATIBILITY -- parse translations need to cope with syntactic
4085 constant "_idtdummy" in the binding position.
4087 * Syntax: removed obsolete syntactic constant "_K" and its associated
4088 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
4089 for example "A -> B" => "Pi A (%_. B)".
4091 * Pure: 'class_deps' command visualizes the subclass relation, using
4092 the graph browser tool.
4094 * Pure: 'print_theory' now suppresses certain internal declarations by
4095 default; use '!' option for full details.
4100 * Method "metis" proves goals by applying the Metis general-purpose
4101 resolution prover (see also http://gilith.com/software/metis/).
4102 Examples are in the directory MetisExamples. WARNING: the
4103 Isabelle/HOL-Metis integration does not yet work properly with
4106 * Command 'sledgehammer' invokes external automatic theorem provers as
4107 background processes. It generates calls to the "metis" method if
4108 successful. These can be pasted into the proof. Users do not have to
4109 wait for the automatic provers to return. WARNING: does not really
4110 work with multi-threading.
4112 * New "auto_quickcheck" feature tests outermost goal statements for
4113 potential counter-examples. Controlled by ML references
4114 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
4115 5000 milliseconds). Fails silently if statements is outside of
4116 executable fragment, or any other codgenerator problem occurs.
4118 * New constant "undefined" with axiom "undefined x = undefined".
4120 * Added class "HOL.eq", allowing for code generation with polymorphic
4123 * Some renaming of class constants due to canonical name prefixing in
4124 the new 'class' package:
4126 HOL.abs ~> HOL.abs_class.abs
4127 HOL.divide ~> HOL.divide_class.divide
4128 0 ~> HOL.zero_class.zero
4129 1 ~> HOL.one_class.one
4130 op + ~> HOL.plus_class.plus
4131 op - ~> HOL.minus_class.minus
4132 uminus ~> HOL.minus_class.uminus
4133 op * ~> HOL.times_class.times
4134 op < ~> HOL.ord_class.less
4135 op <= > HOL.ord_class.less_eq
4136 Nat.power ~> Power.power_class.power
4137 Nat.size ~> Nat.size_class.size
4138 Numeral.number_of ~> Numeral.number_class.number_of
4139 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
4140 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
4141 Orderings.min ~> Orderings.ord_class.min
4142 Orderings.max ~> Orderings.ord_class.max
4143 Divides.op div ~> Divides.div_class.div
4144 Divides.op mod ~> Divides.div_class.mod
4145 Divides.op dvd ~> Divides.div_class.dvd
4147 INCOMPATIBILITY. Adaptions may be required in the following cases:
4149 a) User-defined constants using any of the names "plus", "minus",
4150 "times", "less" or "less_eq". The standard syntax translations for
4151 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
4154 b) Variables named "plus", "minus", "times", "less", "less_eq"
4155 INCOMPATIBILITY: use more specific names.
4157 c) Permutative equations (e.g. "a + b = b + a")
4158 Since the change of names also changes the order of terms, permutative
4159 rewrite rules may get applied in a different order. Experience shows
4160 that this is rarely the case (only two adaptions in the whole Isabelle
4161 distribution). INCOMPATIBILITY: rewrite proofs
4163 d) ML code directly refering to constant names
4164 This in general only affects hand-written proof tactics, simprocs and
4165 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
4166 Consider using @{const_name} antiquotation.
4168 * New class "default" with associated constant "default".
4170 * Function "sgn" is now overloaded and available on int, real, complex
4171 (and other numeric types), using class "sgn". Two possible defs of
4172 sgn are given as equational assumptions in the classes sgn_if and
4173 sgn_div_norm; ordered_idom now also inherits from sgn_if.
4176 * Locale "partial_order" now unified with class "order" (cf. theory
4177 Orderings), added parameter "less". INCOMPATIBILITY.
4179 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
4180 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
4181 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
4183 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
4184 changed order of proof goals in instance proofs.
4186 * The transitivity reasoner for partial and linear orders is set up
4187 for classes "order" and "linorder". Instances of the reasoner are available
4188 in all contexts importing or interpreting the corresponding locales.
4189 Method "order" invokes the reasoner separately; the reasoner
4190 is also integrated with the Simplifier as a solver. Diagnostic
4191 command 'print_orders' shows the available instances of the reasoner
4192 in the current context.
4194 * Localized monotonicity predicate in theory "Orderings"; integrated
4195 lemmas max_of_mono and min_of_mono with this predicate.
4198 * Formulation of theorem "dense" changed slightly due to integration
4199 with new class dense_linear_order.
4201 * Uniform lattice theory development in HOL.
4203 constants "meet" and "join" now named "inf" and "sup"
4204 constant "Meet" now named "Inf"
4206 classes "meet_semilorder" and "join_semilorder" now named
4207 "lower_semilattice" and "upper_semilattice"
4208 class "lorder" now named "lattice"
4209 class "comp_lat" now named "complete_lattice"
4211 Instantiation of lattice classes allows explicit definitions
4212 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
4214 INCOMPATIBILITY. Theorem renames:
4216 meet_left_le ~> inf_le1
4217 meet_right_le ~> inf_le2
4218 join_left_le ~> sup_ge1
4219 join_right_le ~> sup_ge2
4220 meet_join_le ~> inf_sup_ord
4223 le_meet ~> le_inf_iff
4224 le_join ~> ge_sup_conv
4225 meet_idempotent ~> inf_idem
4226 join_idempotent ~> sup_idem
4227 meet_comm ~> inf_commute
4228 join_comm ~> sup_commute
4229 meet_leI1 ~> le_infI1
4230 meet_leI2 ~> le_infI2
4231 le_joinI1 ~> le_supI1
4232 le_joinI2 ~> le_supI2
4233 meet_assoc ~> inf_assoc
4234 join_assoc ~> sup_assoc
4235 meet_left_comm ~> inf_left_commute
4236 meet_left_idempotent ~> inf_left_idem
4237 join_left_comm ~> sup_left_commute
4238 join_left_idempotent ~> sup_left_idem
4241 le_def_meet ~> le_iff_inf
4242 le_def_join ~> le_iff_sup
4243 join_absorp2 ~> sup_absorb2
4244 join_absorp1 ~> sup_absorb1
4245 meet_absorp1 ~> inf_absorb1
4246 meet_absorp2 ~> inf_absorb2
4247 meet_join_absorp ~> inf_sup_absorb
4248 join_meet_absorp ~> sup_inf_absorb
4249 distrib_join_le ~> distrib_sup_le
4250 distrib_meet_le ~> distrib_inf_le
4252 add_meet_distrib_left ~> add_inf_distrib_left
4253 add_join_distrib_left ~> add_sup_distrib_left
4254 is_join_neg_meet ~> is_join_neg_inf
4255 is_meet_neg_join ~> is_meet_neg_sup
4256 add_meet_distrib_right ~> add_inf_distrib_right
4257 add_join_distrib_right ~> add_sup_distrib_right
4258 add_meet_join_distribs ~> add_sup_inf_distribs
4259 join_eq_neg_meet ~> sup_eq_neg_inf
4260 meet_eq_neg_join ~> inf_eq_neg_sup
4261 add_eq_meet_join ~> add_eq_inf_sup
4262 meet_0_imp_0 ~> inf_0_imp_0
4263 join_0_imp_0 ~> sup_0_imp_0
4264 meet_0_eq_0 ~> inf_0_eq_0
4265 join_0_eq_0 ~> sup_0_eq_0
4266 neg_meet_eq_join ~> neg_inf_eq_sup
4267 neg_join_eq_meet ~> neg_sup_eq_inf
4268 join_eq_if ~> sup_eq_if
4270 mono_meet ~> mono_inf
4271 mono_join ~> mono_sup
4272 meet_bool_eq ~> inf_bool_eq
4273 join_bool_eq ~> sup_bool_eq
4274 meet_fun_eq ~> inf_fun_eq
4275 join_fun_eq ~> sup_fun_eq
4276 meet_set_eq ~> inf_set_eq
4277 join_set_eq ~> sup_set_eq
4278 meet1_iff ~> inf1_iff
4279 meet2_iff ~> inf2_iff
4288 join1_iff ~> sup1_iff
4289 join2_iff ~> sup2_iff
4299 is_meet_Meet ~> is_meet_Inf
4300 Meet_bool_def ~> Inf_bool_def
4301 Meet_fun_def ~> Inf_fun_def
4302 Meet_greatest ~> Inf_greatest
4303 Meet_lower ~> Inf_lower
4304 Meet_set_def ~> Inf_set_def
4307 Sup_bool_eq ~> Sup_bool_def
4308 Sup_fun_eq ~> Sup_fun_def
4309 Sup_set_eq ~> Sup_set_def
4311 listsp_meetI ~> listsp_infI
4312 listsp_meet_eq ~> listsp_inf_eq
4317 * Added syntactic class "size"; overloaded constant "size" now has
4318 type "'a::size ==> bool"
4320 * Internal reorganisation of `size' of datatypes: size theorems
4321 "foo.size" are no longer subsumed by "foo.simps" (but are still
4322 simplification rules by default!); theorems "prod.size" now named
4325 * Class "div" now inherits from class "times" rather than "type".
4328 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
4329 Linorder etc. have disappeared; operations defined in terms of
4330 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
4332 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
4334 * HOL-Word: New extensive library and type for generic, fixed size
4335 machine words, with arithemtic, bit-wise, shifting and rotating
4336 operations, reflection into int, nat, and bool lists, automation for
4337 linear arithmetic (by automatic reflection into nat or int), including
4338 lemmas on overflow and monotonicity. Instantiated to all appropriate
4339 arithmetic type classes, supporting automatic simplification of
4340 numerals on all operations.
4342 * Library/Boolean_Algebra: locales for abstract boolean algebras.
4344 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
4346 * Code generator library theories:
4347 - Code_Integer represents HOL integers by big integer literals in target
4349 - Code_Char represents HOL characters by character literals in target
4351 - Code_Char_chr like Code_Char, but also offers treatment of character
4352 codes; includes Code_Integer.
4353 - Executable_Set allows to generate code for finite sets using lists.
4354 - Executable_Rat implements rational numbers as triples (sign, enumerator,
4356 - Executable_Real implements a subset of real numbers, namly those
4357 representable by rational numbers.
4358 - Efficient_Nat implements natural numbers by integers, which in general will
4359 result in higher efficency; pattern matching with 0/Suc is eliminated;
4360 includes Code_Integer.
4361 - Code_Index provides an additional datatype index which is mapped to
4362 target-language built-in integers.
4363 - Code_Message provides an additional datatype message_string which is isomorphic to
4364 strings; messages are mapped to target-language strings.
4366 * New package for inductive predicates
4368 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
4371 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4372 for z_1 :: U_1 and ... and z_n :: U_m
4374 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4377 with full support for type-inference, rather than
4379 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4381 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4382 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4384 inductive "s z_1 ... z_m"
4386 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4389 For backward compatibility, there is a wrapper allowing inductive
4390 sets to be defined with the new package via
4393 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4394 for z_1 :: U_1 and ... and z_n :: U_m
4396 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
4402 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
4403 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
4404 for z_1 :: U_1 and ... and z_n :: U_m
4406 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
4407 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
4410 if the additional syntax "p ..." is required.
4412 Numerous examples can be found in the subdirectories src/HOL/Auth,
4413 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
4417 - Since declaration and definition of inductive sets or predicates
4418 is no longer separated, abbreviations involving the newly
4419 introduced sets or predicates must be specified together with the
4420 introduction rules after the 'where' keyword (see above), rather
4421 than before the actual inductive definition.
4423 - The variables in induction and elimination rules are now
4424 quantified in the order of their occurrence in the introduction
4425 rules, rather than in alphabetical order. Since this may break
4426 some proofs, these proofs either have to be repaired, e.g. by
4427 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
4428 statements of the form
4430 case (rule_i a_i_1 ... a_i_{k_i})
4432 or the old order of quantification has to be restored by explicitly adding
4433 meta-level quantifiers in the introduction rules, i.e.
4435 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
4437 - The format of the elimination rules is now
4439 p z_1 ... z_m x_1 ... x_n ==>
4440 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4445 (x_1, ..., x_n) : s z_1 ... z_m ==>
4446 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
4449 for sets rather than
4451 x : s z_1 ... z_m ==>
4452 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
4455 This may require terms in goals to be expanded to n-tuples
4456 (e.g. using case_tac or simplification with the split_paired_all
4457 rule) before the above elimination rule is applicable.
4459 - The elimination or case analysis rules for (mutually) inductive
4460 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
4461 list of rules "p_1_..._p_k.elims" is no longer available.
4463 * New package "function"/"fun" for general recursive functions,
4464 supporting mutual and nested recursion, definitions in local contexts,
4465 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
4466 for small examples, and the separate tutorial on the function
4467 package. The old recdef "package" is still available as before, but
4468 users are encouraged to use the new package.
4470 * Method "lexicographic_order" automatically synthesizes termination
4471 relations as lexicographic combinations of size measures.
4473 * Case-expressions allow arbitrary constructor-patterns (including
4474 "_") and take their order into account, like in functional
4475 programming. Internally, this is translated into nested
4476 case-expressions; missing cases are added and mapped to the predefined
4477 constant "undefined". In complicated cases printing may no longer show
4478 the original input but the internal form. Lambda-abstractions allow
4479 the same form of pattern matching: "% pat1 => e1 | ..." is an
4480 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
4483 * IntDef: The constant "int :: nat => int" has been removed; now "int"
4484 is an abbreviation for "of_nat :: nat => int". The simplification
4485 rules for "of_nat" have been changed to work like "int" did
4486 previously. Potential INCOMPATIBILITY:
4487 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
4488 - of_nat_diff and of_nat_mult are no longer default simp rules
4490 * Method "algebra" solves polynomial equations over (semi)rings using
4491 Groebner bases. The (semi)ring structure is defined by locales and the
4492 tool setup depends on that generic context. Installing the method for
4493 a specific type involves instantiating the locale and possibly adding
4494 declarations for computation on the coefficients. The method is
4495 already instantiated for natural numbers and for the axiomatic class
4496 of idoms with numerals. See also the paper by Chaieb and Wenzel at
4497 CALCULEMUS 2007 for the general principles underlying this
4498 architecture of context-aware proof-tools.
4500 * Method "ferrack" implements quantifier elimination over
4501 special-purpose dense linear orders using locales (analogous to
4502 "algebra"). The method is already installed for class
4503 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
4506 * Former constant "List.op @" now named "List.append". Use ML
4507 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
4508 circumvent possible incompatibilities when working on ML level.
4510 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
4512 * New function listsum :: 'a list => 'a for arbitrary monoids.
4513 Special syntax: "SUM x <- xs. f x" (and latex variants)
4515 * New syntax for Haskell-like list comprehension (input only), eg.
4516 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
4518 * The special syntax for function "filter" has changed from [x :
4519 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
4520 comprehension syntax, and for uniformity. INCOMPATIBILITY.
4522 * [a..b] is now defined for arbitrary linear orders. It used to be
4523 defined on nat only, as an abbreviation for [a..<Suc b]
4526 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
4528 * New functions "sorted" and "sort" in src/HOL/List.thy.
4530 * New lemma collection field_simps (an extension of ring_simps) for
4531 manipulating (in)equations involving division. Multiplies with all
4532 denominators that can be proved to be non-zero (in equations) or
4533 positive/negative (in inequations).
4535 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
4536 have been improved and renamed to ring_simps, group_simps and
4537 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
4538 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
4540 * Theory Library/Commutative_Ring: switched from recdef to function
4541 package; constants add, mul, pow now curried. Infix syntax for
4542 algebraic operations.
4544 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
4547 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
4550 * HOL/records: generalised field-update to take a function on the
4551 field rather than the new value: r(|A := x|) is translated to A_update
4552 (K x) r The K-combinator that is internally used is called K_record.
4553 INCOMPATIBILITY: Usage of the plain update functions has to be
4556 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
4557 * x = 0, which are required for a semiring. Richer structures do not
4558 inherit from semiring_0 anymore, because this property is a theorem
4559 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
4560 there is more to prove, but this is mostly trivial.
4562 * Class "recpower" is generalized to arbitrary monoids, not just
4563 commutative semirings. INCOMPATIBILITY: may need to incorporate
4564 commutativity or semiring properties additionally.
4566 * Constant "List.list_all2" in List.thy now uses authentic syntax.
4567 INCOMPATIBILITY: translations containing list_all2 may go wrong,
4568 better use 'abbreviation'.
4570 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
4572 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
4573 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
4574 significant changes for setting up numeral syntax for types:
4575 - New constants Numeral.pred and Numeral.succ instead
4576 of former Numeral.bin_pred and Numeral.bin_succ.
4577 - Use integer operations instead of bin_add, bin_mult and so on.
4578 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
4579 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
4581 See src/HOL/Integ/IntArith.thy for an example setup.
4583 * Command 'normal_form' computes the normal form of a term that may
4584 contain free variables. For example ``normal_form "rev [a, b, c]"''
4585 produces ``[b, c, a]'' (without proof). This command is suitable for
4586 heavy-duty computations because the functions are compiled to ML
4587 first. Correspondingly, a method "normalization" is provided. See
4588 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
4590 * Alternative iff syntax "A <-> B" for equality on bool (with priority
4591 25 like -->); output depends on the "iff" print_mode, the default is
4592 "A = B" (with priority 50).
4594 * Relations less (<) and less_eq (<=) are also available on type bool.
4595 Modified syntax to disallow nesting without explicit parentheses,
4596 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
4599 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
4601 * Relation composition operator "op O" now has precedence 75 and binds
4602 stronger than union and intersection. INCOMPATIBILITY.
4604 * The old set interval syntax "{m..n(}" (and relatives) has been
4605 removed. Use "{m..<n}" (and relatives) instead.
4607 * In the context of the assumption "~(s = t)" the Simplifier rewrites
4608 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
4609 ``declare [[simproc del: neq]]''.
4611 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
4614 * Theorem Cons_eq_map_conv no longer declared as "simp".
4616 * Theorem setsum_mult renamed to setsum_right_distrib.
4618 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
4621 * Reimplemented methods "sat" and "satx", with several improvements:
4622 goals no longer need to be stated as "<prems> ==> False", equivalences
4623 (i.e. "=" on type bool) are handled, variable names of the form
4624 "lit_<n>" are no longer reserved, significant speedup.
4626 * Methods "sat" and "satx" can now replay MiniSat proof traces.
4627 zChaff is still supported as well.
4629 * 'inductive' and 'datatype': provide projections of mutual rules,
4630 bundled as foo_bar.inducts;
4632 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
4635 * Library: moved theory Accessible_Part to main HOL.
4637 * Library: added theory Coinductive_List of potentially infinite lists
4638 as greatest fixed-point.
4640 * Library: added theory AssocList which implements (finite) maps as
4643 * Method "evaluation" solves goals (i.e. a boolean expression)
4644 efficiently by compiling it to ML. The goal is "proved" (via an
4645 oracle) if it evaluates to True.
4647 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
4648 also when invoked by the simplifier. This results in the Simplifier
4649 being more powerful on arithmetic goals. INCOMPATIBILITY.
4650 Configuration option fast_arith_split_limit=0 recovers the old
4653 * Support for hex (0x20) and binary (0b1001) numerals.
4655 * New method: reify eqs (t), where eqs are equations for an
4656 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
4657 parameter, computes a term s::'b and a list xs::'a list and proves the
4658 theorem I xs s = t. This is also known as reification or quoting. The
4659 resulting theorem is applied to the subgoal to substitute t with I xs
4660 s. If t is omitted, the subgoal itself is reified.
4662 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
4663 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
4664 where f is supposed to be a computable function (in the sense of code
4665 generattion). The method uses reify to compute s and xs as above then
4666 applies corr_thm and uses normalization by evaluation to "prove" f s =
4667 r and finally gets the theorem t = r, which is again applied to the
4668 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
4670 * Reflection: Automatic reification now handels binding, an example is
4671 available in src/HOL/ex/ReflectionEx.thy
4673 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
4674 command 'statespace' that is similar to 'record', but introduces an
4675 abstract specification based on the locale infrastructure instead of
4676 HOL types. This leads to extra flexibility in composing state spaces,
4677 in particular multiple inheritance and renaming of components.
4682 * Hyperreal: Functions root and sqrt are now defined on negative real
4683 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
4684 Nonnegativity side conditions have been removed from many lemmas, so
4685 that more subgoals may now be solved by simplification; potential
4688 * Real: new type classes formalize real normed vector spaces and
4689 algebras, using new overloaded constants scaleR :: real => 'a => 'a
4690 and norm :: 'a => real.
4692 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
4693 reals into other types. The overloaded constant Reals :: 'a set is now
4694 defined as range of_real; potential INCOMPATIBILITY.
4696 * Real: proper support for ML code generation, including 'quickcheck'.
4697 Reals are implemented as arbitrary precision rationals.
4699 * Hyperreal: Several constants that previously worked only for the
4700 reals have been generalized, so they now work over arbitrary vector
4701 spaces. Type annotations may need to be added in some cases; potential
4704 Infinitesimal :: ('a::real_normed_vector) star set
4705 HFinite :: ('a::real_normed_vector) star set
4706 HInfinite :: ('a::real_normed_vector) star set
4707 approx :: ('a::real_normed_vector) star => 'a star => bool
4708 monad :: ('a::real_normed_vector) star => 'a star set
4709 galaxy :: ('a::real_normed_vector) star => 'a star set
4710 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
4711 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
4712 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
4713 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
4714 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
4715 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
4716 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
4717 sgn :: 'a::real_normed_vector => 'a
4718 exp :: 'a::{recpower,real_normed_field,banach} => 'a
4720 * Complex: Some complex-specific constants are now abbreviations for
4721 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
4722 hnorm. Other constants have been entirely removed in favor of the
4723 polymorphic versions (INCOMPATIBILITY):
4727 HInfinite <-- CInfinite
4728 Infinitesimal <-- CInfinitesimal
4731 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
4732 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
4733 (ns)deriv <-- (ns)cderiv
4738 * Formalisation of ideals and the quotient construction over rings.
4740 * Order and lattice theory no longer based on records.
4743 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
4744 greatest_closed. INCOMPATIBILITY.
4746 * Method algebra is now set up via an attribute. For examples see
4747 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
4748 of algebraic structures.
4750 * Renamed theory CRing to Ring.
4755 * Substantial, yet incomplete support for nominal datatypes (binding
4756 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
4757 src/HOL/Nominal/Examples. Prospective users should consult
4758 http://isabelle.in.tum.de/nominal/
4763 * ML basics: just one true type int, which coincides with IntInf.int
4766 * ML within Isar: antiquotations allow to embed statically-checked
4767 formal entities in the source, referring to the context available at
4768 compile-time. For example:
4770 ML {* @{sort "{zero,one}"} *}
4771 ML {* @{typ "'a => 'b"} *}
4772 ML {* @{term "%x. x"} *}
4773 ML {* @{prop "x == y"} *}
4774 ML {* @{ctyp "'a => 'b"} *}
4775 ML {* @{cterm "%x. x"} *}
4776 ML {* @{cprop "x == y"} *}
4777 ML {* @{thm asm_rl} *}
4778 ML {* @{thms asm_rl} *}
4779 ML {* @{type_name c} *}
4780 ML {* @{type_syntax c} *}
4781 ML {* @{const_name c} *}
4782 ML {* @{const_syntax c} *}
4785 ML {* @{theory Pure} *}
4786 ML {* @{theory_ref} *}
4787 ML {* @{theory_ref Pure} *}
4790 ML {* @{clasimpset} *}
4792 The same works for sources being ``used'' within an Isar context.
4794 * ML in Isar: improved error reporting; extra verbosity with
4795 ML_Context.trace enabled.
4797 * Pure/General/table.ML: the join operations now works via exceptions
4798 DUP/SAME instead of type option. This is simpler in simple cases, and
4799 admits slightly more efficient complex applications.
4801 * Pure: 'advanced' translation functions (parse_translation etc.) now
4802 use Context.generic instead of just theory.
4804 * Pure: datatype Context.generic joins theory/Proof.context and
4805 provides some facilities for code that works in either kind of
4806 context, notably GenericDataFun for uniform theory and proof data.
4808 * Pure: simplified internal attribute type, which is now always
4809 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
4810 local (Proof.context) attributes have been discontinued, while
4811 minimizing code duplication. Thm.rule_attribute and
4812 Thm.declaration_attribute build canonical attributes; see also structure
4813 Context for further operations on Context.generic, notably
4814 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
4815 declarations and definitions.
4817 * Context data interfaces (Theory/Proof/GenericDataFun): removed
4818 name/print, uninitialized data defaults to ad-hoc copy of empty value,
4819 init only required for impure data. INCOMPATIBILITY: empty really need
4820 to be empty (no dependencies on theory content!)
4822 * Pure/kernel: consts certification ignores sort constraints given in
4823 signature declarations. (This information is not relevant to the
4824 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
4825 potential INCOMPATIBILITY.
4827 * Pure: axiomatic type classes are now purely definitional, with
4828 explicit proofs of class axioms and super class relations performed
4829 internally. See Pure/axclass.ML for the main internal interfaces --
4830 notably AxClass.define_class supercedes AxClass.add_axclass, and
4831 AxClass.axiomatize_class/classrel/arity supersede
4832 Sign.add_classes/classrel/arities.
4834 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
4835 global/local versions on theory vs. Proof.context have been
4836 discontinued; Attrib.syntax and Method.syntax have been adapted
4837 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
4838 attributes, methods, etc.
4840 * Pure: several functions of signature "... -> theory -> theory * ..."
4841 have been reoriented to "... -> theory -> ... * theory" in order to
4842 allow natural usage in combination with the ||>, ||>>, |-> and
4843 fold_map combinators.
4845 * Pure: official theorem names (closed derivations) and additional
4846 comments (tags) are now strictly separate. Name hints -- which are
4847 maintained as tags -- may be attached any time without affecting the
4850 * Pure: primitive rule lift_rule now takes goal cterm instead of an
4851 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
4852 achieve the old behaviour.
4854 * Pure: the "Goal" constant is now called "prop", supporting a
4855 slightly more general idea of ``protecting'' meta-level rule
4858 * Pure: Logic.(un)varify only works in a global context, which is now
4859 enforced instead of silently assumed. INCOMPATIBILITY, may use
4860 Logic.legacy_(un)varify as temporary workaround.
4862 * Pure: structure Name provides scalable operations for generating
4863 internal variable names, notably Name.variants etc. This replaces
4864 some popular functions from term.ML:
4866 Term.variant -> Name.variant
4867 Term.variantlist -> Name.variant_list
4868 Term.invent_names -> Name.invent_list
4870 Note that low-level renaming rarely occurs in new code -- operations
4871 from structure Variable are used instead (see below).
4873 * Pure: structure Variable provides fundamental operations for proper
4874 treatment of fixed/schematic variables in a context. For example,
4875 Variable.import introduces fixes for schematics of given facts and
4876 Variable.export reverses the effect (up to renaming) -- this replaces
4877 various freeze_thaw operations.
4879 * Pure: structure Goal provides simple interfaces for
4880 init/conclude/finish and tactical prove operations (replacing former
4881 Tactic.prove). Goal.prove is the canonical way to prove results
4882 within a given context; Goal.prove_global is a degraded version for
4883 theory level goals, including a global Drule.standard. Note that
4884 OldGoals.prove_goalw_cterm has long been obsolete, since it is
4885 ill-behaved in a local proof context (e.g. with local fixes/assumes or
4886 in a locale context).
4888 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
4889 and type checking (Syntax.check_term etc.), with common combinations
4890 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
4891 which are considered legacy and await removal.
4893 * Pure/Syntax: generic interfaces for type unchecking
4894 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
4895 with common combinations (Syntax.pretty_term, Syntax.string_of_term
4896 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
4897 available for convenience, but refer to the very same operations using
4898 a mere theory instead of a full context.
4900 * Isar: simplified treatment of user-level errors, using exception
4901 ERROR of string uniformly. Function error now merely raises ERROR,
4902 without any side effect on output channels. The Isar toplevel takes
4903 care of proper display of ERROR exceptions. ML code may use plain
4904 handle/can/try; cat_error may be used to concatenate errors like this:
4906 ... handle ERROR msg => cat_error msg "..."
4908 Toplevel ML code (run directly or through the Isar toplevel) may be
4909 embedded into the Isar toplevel with exception display/debug like
4912 Isar.toplevel (fn () => ...)
4914 INCOMPATIBILITY, removed special transform_error facilities, removed
4915 obsolete variants of user-level exceptions (ERROR_MESSAGE,
4916 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
4917 -- use plain ERROR instead.
4919 * Isar: theory setup now has type (theory -> theory), instead of a
4920 list. INCOMPATIBILITY, may use #> to compose setup functions.
4922 * Isar: ML toplevel pretty printer for type Proof.context, subject to
4923 ProofContext.debug/verbose flags.
4925 * Isar: Toplevel.theory_to_proof admits transactions that modify the
4926 theory before entering a proof state. Transactions now always see a
4927 quasi-functional intermediate checkpoint, both in interactive and
4930 * Isar: simplified interfaces for outer syntax. Renamed
4931 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
4932 OuterSyntax.add_parsers -- this functionality is now included in
4933 OuterSyntax.command etc. INCOMPATIBILITY.
4935 * Simplifier: the simpset of a running simplification process now
4936 contains a proof context (cf. Simplifier.the_context), which is the
4937 very context that the initial simpset has been retrieved from (by
4938 simpset_of/local_simpset_of). Consequently, all plug-in components
4939 (solver, looper etc.) may depend on arbitrary proof data.
4941 * Simplifier.inherit_context inherits the proof context (plus the
4942 local bounds) of the current simplification process; any simproc
4943 etc. that calls the Simplifier recursively should do this! Removed
4944 former Simplifier.inherit_bounds, which is already included here --
4945 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
4946 specify an explicit context using Simplifier.context/theory_context.
4948 * Simplifier/Classical Reasoner: more abstract interfaces
4949 change_simpset/claset for modifying the simpset/claset reference of a
4950 theory; raw versions simpset/claset_ref etc. have been discontinued --
4953 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
4959 * settings: the default heap location within ISABELLE_HOME_USER now
4960 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
4961 Isabelle installations.
4963 * isabelle-process: option -S (secure mode) disables some critical
4964 operations, notably runtime compilation and evaluation of ML source
4967 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
4969 * Support for parallel execution, using native multicore support of
4970 Poly/ML 5.1. The theory loader exploits parallelism when processing
4971 independent theories, according to the given theory header
4972 specifications. The maximum number of worker threads is specified via
4973 usedir option -M or the "max-threads" setting in Proof General. A
4974 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
4975 to 6 on a 8-core machine. User-code needs to observe certain
4976 guidelines for thread-safe programming, see appendix A in the Isar
4977 Implementation manual.
4981 New in Isabelle2005 (October 2005)
4982 ----------------------------------
4986 * Theory headers: the new header syntax for Isar theories is
4989 imports <theory1> ... <theoryN>
4990 uses <file1> ... <fileM>
4993 where the 'uses' part is optional. The previous syntax
4995 theory <name> = <theory1> + ... + <theoryN>:
4997 will disappear in the next release. Use isatool fixheaders to convert
4998 existing theory files. Note that there is no change in ancient
4999 non-Isar theories now, but these will disappear soon.
5001 * Theory loader: parent theories can now also be referred to via
5002 relative and absolute paths.
5004 * Command 'find_theorems' searches for a list of criteria instead of a
5005 list of constants. Known criteria are: intro, elim, dest, name:string,
5006 simp:term, and any term. Criteria can be preceded by '-' to select
5007 theorems that do not match. Intro, elim, dest select theorems that
5008 match the current goal, name:s selects theorems whose fully qualified
5009 name contain s, and simp:term selects all simplification rules whose
5010 lhs match term. Any other term is interpreted as pattern and selects
5011 all theorems matching the pattern. Available in ProofGeneral under
5012 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
5014 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
5016 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
5017 matching the current goal as introduction rule and not having "HOL."
5018 in their name (i.e. not being defined in theory HOL).
5020 * Command 'thms_containing' has been discontinued in favour of
5021 'find_theorems'; INCOMPATIBILITY.
5023 * Communication with Proof General is now 8bit clean, which means that
5024 Unicode text in UTF-8 encoding may be used within theory texts (both
5025 formal and informal parts). Cf. option -U of the Isabelle Proof
5026 General interface. Here are some simple examples (cf. src/HOL/ex):
5028 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
5029 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
5031 * Improved efficiency of the Simplifier and, to a lesser degree, the
5032 Classical Reasoner. Typical big applications run around 2 times
5036 *** Document preparation ***
5038 * Commands 'display_drafts' and 'print_drafts' perform simple output
5039 of raw sources. Only those symbols that do not require additional
5040 LaTeX packages (depending on comments in isabellesym.sty) are
5041 displayed properly, everything else is left verbatim. isatool display
5042 and isatool print are used as front ends (these are subject to the
5043 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
5045 * Command tags control specific markup of certain regions of text,
5046 notably folding and hiding. Predefined tags include "theory" (for
5047 theory begin and end), "proof" for proof commands, and "ML" for
5048 commands involving ML code; the additional tags "visible" and
5049 "invisible" are unused by default. Users may give explicit tag
5050 specifications in the text, e.g. ''by %invisible (auto)''. The
5051 interpretation of tags is determined by the LaTeX job during document
5052 preparation: see option -V of isatool usedir, or options -n and -t of
5053 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
5056 Several document versions may be produced at the same time via isatool
5057 usedir (the generated index.html will link all of them). Typical
5058 specifications include ''-V document=theory,proof,ML'' to present
5059 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
5060 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
5061 these parts without any formal replacement text. The Isabelle site
5062 default settings produce ''document'' and ''outline'' versions as
5065 * Several new antiquotations:
5067 @{term_type term} prints a term with its type annotated;
5069 @{typeof term} prints the type of a term;
5071 @{const const} is the same as @{term const}, but checks that the
5072 argument is a known logical constant;
5074 @{term_style style term} and @{thm_style style thm} print a term or
5075 theorem applying a "style" to it
5079 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
5080 definitions, equations, inequations etc., 'concl' printing only the
5081 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
5082 to print the specified premise. TermStyle.add_style provides an ML
5083 interface for introducing further styles. See also the "LaTeX Sugar"
5084 document practical applications. The ML antiquotation prints
5085 type-checked ML expressions verbatim.
5087 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
5088 and 'text' support optional locale specification '(in loc)', which
5089 specifies the default context for interpreting antiquotations. For
5090 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
5092 * Option 'locale=NAME' of antiquotations specifies an alternative
5093 context interpreting the subsequent argument. For example: @{thm
5094 [locale=lattice] inf_assoc}.
5096 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
5099 * Proper output of antiquotations for theory commands involving a
5100 proof context (such as 'locale' or 'theorem (in loc) ...').
5102 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
5103 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
5105 * isatool usedir: new option -C (default true) controls whether option
5106 -D should include a copy of the original document directory; -C false
5107 prevents unwanted effects such as copying of administrative CVS data.
5112 * Considerably improved version of 'constdefs' command. Now performs
5113 automatic type-inference of declared constants; additional support for
5114 local structure declarations (cf. locales and HOL records), see also
5115 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
5116 sequential dependencies of definitions within a single 'constdefs'
5117 section; moreover, the declared name needs to be an identifier. If
5118 all fails, consider to fall back on 'consts' and 'defs' separately.
5120 * Improved indexed syntax and implicit structures. First of all,
5121 indexed syntax provides a notational device for subscripted
5122 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
5123 expressions. Secondly, in a local context with structure
5124 declarations, number indexes \<^sub>n or the empty index (default
5125 number 1) refer to a certain fixed variable implicitly; option
5126 show_structs controls printing of implicit structures. Typical
5127 applications of these concepts involve record types and locales.
5129 * New command 'no_syntax' removes grammar declarations (and
5130 translations) resulting from the given syntax specification, which is
5131 interpreted in the same manner as for the 'syntax' command.
5133 * 'Advanced' translation functions (parse_translation etc.) may depend
5134 on the signature of the theory context being presently used for
5135 parsing/printing, see also isar-ref manual.
5137 * Improved 'oracle' command provides a type-safe interface to turn an
5138 ML expression of type theory -> T -> term into a primitive rule of
5139 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
5140 is already included here); see also FOL/ex/IffExample.thy;
5143 * axclass: name space prefix for class "c" is now "c_class" (was "c"
5144 before); "cI" is no longer bound, use "c.intro" instead.
5145 INCOMPATIBILITY. This change avoids clashes of fact bindings for
5146 axclasses vs. locales.
5148 * Improved internal renaming of symbolic identifiers -- attach primes
5149 instead of base 26 numbers.
5151 * New flag show_question_marks controls printing of leading question
5152 marks in schematic variable names.
5154 * In schematic variable names, *any* symbol following \<^isub> or
5155 \<^isup> is now treated as part of the base name. For example, the
5156 following works without printing of awkward ".0" indexes:
5158 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
5161 * Inner syntax includes (*(*nested*) comments*).
5163 * Pretty printer now supports unbreakable blocks, specified in mixfix
5164 annotations as "(00...)".
5166 * Clear separation of logical types and nonterminals, where the latter
5167 may only occur in 'syntax' specifications or type abbreviations.
5168 Before that distinction was only partially implemented via type class
5169 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
5170 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
5171 exotic syntax specifications may require further adaption
5172 (e.g. Cube/Cube.thy).
5174 * Removed obsolete type class "logic", use the top sort {} instead.
5175 Note that non-logical types should be declared as 'nonterminals'
5176 rather than 'types'. INCOMPATIBILITY for new object-logic
5179 * Attributes 'induct' and 'cases': type or set names may now be
5180 locally fixed variables as well.
5182 * Simplifier: can now control the depth to which conditional rewriting
5183 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
5186 * Simplifier: simplification procedures may now take the current
5187 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
5188 interface), which is very useful for calling the Simplifier
5189 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
5190 is gone -- use prems_of_ss on the simpset instead. Moreover, the
5191 low-level mk_simproc no longer applies Logic.varify internally, to
5192 allow for use in a context of fixed variables.
5194 * thin_tac now works even if the assumption being deleted contains !!
5195 or ==>. More generally, erule now works even if the major premise of
5196 the elimination rule contains !! or ==>.
5198 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
5200 * Reorganized bootstrapping of the Pure theories; CPure is now derived
5201 from Pure, which contains all common declarations already. Both
5202 theories are defined via plain Isabelle/Isar .thy files.
5203 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
5204 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
5205 use isatool fixcpure to adapt your theory and ML sources.
5207 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
5208 selections of theorems in named facts via index ranges.
5210 * 'print_theorems': in theory mode, really print the difference
5211 wrt. the last state (works for interactive theory development only),
5212 in proof mode print all local facts (cf. 'print_facts');
5214 * 'hide': option '(open)' hides only base names.
5216 * More efficient treatment of intermediate checkpoints in interactive
5219 * Code generator is now invoked via code_module (incremental code
5220 generation) and code_library (modular code generation, ML structures
5221 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
5222 must be quoted when used as identifiers.
5224 * New 'value' command for reading, evaluating and printing terms using
5225 the code generator. INCOMPATIBILITY: command keyword 'value' must be
5226 quoted when used as identifier.
5231 * New commands for the interpretation of locale expressions in
5232 theories (1), locales (2) and proof contexts (3). These generate
5233 proof obligations from the expression specification. After the
5234 obligations have been discharged, theorems of the expression are added
5235 to the theory, target locale or proof context. The synopsis of the
5236 commands is a follows:
5238 (1) interpretation expr inst
5239 (2) interpretation target < expr
5240 (3) interpret expr inst
5242 Interpretation in theories and proof contexts require a parameter
5243 instantiation of terms from the current context. This is applied to
5244 specifications and theorems of the interpreted expression.
5245 Interpretation in locales only permits parameter renaming through the
5246 locale expression. Interpretation is smart in that interpretations
5247 that are active already do not occur in proof obligations, neither are
5248 instantiated theorems stored in duplicate. Use 'print_interps' to
5249 inspect active interpretations of a particular locale. For details,
5250 see the Isar Reference manual. Examples can be found in
5251 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
5253 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
5254 'interpret' instead.
5256 * New context element 'constrains' for adding type constraints to
5259 * Context expressions: renaming of parameters with syntax
5262 * Locale declaration: 'includes' disallowed.
5264 * Proper static binding of attribute syntax -- i.e. types / terms /
5265 facts mentioned as arguments are always those of the locale definition
5266 context, independently of the context of later invocations. Moreover,
5267 locale operations (renaming and type / term instantiation) are applied
5268 to attribute arguments as expected.
5270 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
5271 actual attributes; rare situations may require Attrib.attribute to
5272 embed those attributes into Attrib.src that lack concrete syntax.
5273 Attribute implementations need to cooperate properly with the static
5274 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
5275 Attrib.XXX_thm etc. already do the right thing without further
5276 intervention. Only unusual applications -- such as "where" or "of"
5277 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
5278 on the context and the facts involved -- may have to assign parsed
5279 values to argument tokens explicitly.
5281 * Changed parameter management in theorem generation for long goal
5282 statements with 'includes'. INCOMPATIBILITY: produces a different
5283 theorem statement in rare situations.
5285 * Locale inspection command 'print_locale' omits notes elements. Use
5286 'print_locale!' to have them included in the output.
5291 * Provers/hypsubst.ML: improved version of the subst method, for
5292 single-step rewriting: it now works in bound variable contexts. New is
5293 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
5294 rewrite a different subterm than the original subst method, which is
5295 still available as 'simplesubst'.
5297 * Provers/quasi.ML: new transitivity reasoners for transitivity only
5300 * Provers/trancl.ML: new transitivity reasoner for transitive and
5301 reflexive-transitive closure of relations.
5303 * Provers/blast.ML: new reference depth_limit to make blast's depth
5304 limit (previously hard-coded with a value of 20) user-definable.
5306 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
5307 is peformed already. Object-logics merely need to finish their
5308 initial simpset configuration as before. INCOMPATIBILITY.
5313 * Symbolic syntax of Hilbert Choice Operator is now as follows:
5316 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
5318 The symbol \<some> is displayed as the alternative epsilon of LaTeX
5319 and x-symbol; use option '-m epsilon' to get it actually printed.
5320 Moreover, the mathematically important symbolic identifier \<epsilon>
5321 becomes available as variable, constant etc. INCOMPATIBILITY,
5323 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
5324 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
5325 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
5326 support corresponding Isar calculations.
5328 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
5331 * theory SetInterval: changed the syntax for open intervals:
5340 The old syntax is still supported but will disappear in the next
5341 release. For conversion use the following Emacs search and replace
5342 patterns (these are not perfect but work quite well):
5344 {)\([^\.]*\)\.\. -> {\1<\.\.}
5345 \.\.\([^(}]*\)(} -> \.\.<\1}
5347 * Theory Commutative_Ring (in Library): method comm_ring for proving
5348 equalities in commutative rings; method 'algebra' provides a generic
5351 * Theory Finite_Set: changed the syntax for 'setsum', summation over
5352 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
5353 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
5356 Some new syntax forms are available:
5358 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
5359 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
5360 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
5361 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
5363 The latter form "\<Sum>x < k. e" used to be based on a separate
5364 function "Summation", which has been discontinued.
5366 * theory Finite_Set: in structured induction proofs, the insert case
5367 is now 'case (insert x F)' instead of the old counterintuitive 'case
5370 * The 'refute' command has been extended to support a much larger
5371 fragment of HOL, including axiomatic type classes, constdefs and
5372 typedefs, inductive datatypes and recursion.
5374 * New tactics 'sat' and 'satx' to prove propositional tautologies.
5375 Requires zChaff with proof generation to be installed. See
5376 HOL/ex/SAT_Examples.thy for examples.
5378 * Datatype induction via method 'induct' now preserves the name of the
5379 induction variable. For example, when proving P(xs::'a list) by
5380 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
5381 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
5382 in unstructured proof scripts.
5384 * Reworked implementation of records. Improved scalability for
5385 records with many fields, avoiding performance problems for type
5386 inference. Records are no longer composed of nested field types, but
5387 of nested extension types. Therefore the record type only grows linear
5388 in the number of extensions and not in the number of fields. The
5389 top-level (users) view on records is preserved. Potential
5390 INCOMPATIBILITY only in strange cases, where the theory depends on the
5391 old record representation. The type generated for a record is called
5392 <record_name>_ext_type.
5394 Flag record_quick_and_dirty_sensitive can be enabled to skip the
5395 proofs triggered by a record definition or a simproc (if
5396 quick_and_dirty is enabled). Definitions of large records can take
5399 New simproc record_upd_simproc for simplification of multiple record
5400 updates enabled by default. Moreover, trivial updates are also
5401 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
5402 occasionally, since simplification is more powerful by default.
5404 * typedef: proper support for polymorphic sets, which contain extra
5405 type-variables in the term.
5407 * Simplifier: automatically reasons about transitivity chains
5408 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
5409 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
5410 old proofs break occasionally as simplification may now solve more
5411 goals than previously.
5413 * Simplifier: converts x <= y into x = y if assumption y <= x is
5414 present. Works for all partial orders (class "order"), in particular
5415 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
5418 * Simplifier: new simproc for "let x = a in f x". If a is a free or
5419 bound variable or a constant then the let is unfolded. Otherwise
5420 first a is simplified to b, and then f b is simplified to g. If
5421 possible we abstract b from g arriving at "let x = b in h x",
5422 otherwise we unfold the let and arrive at g. The simproc can be
5423 enabled/disabled by the reference use_let_simproc. Potential
5424 INCOMPATIBILITY since simplification is more powerful by default.
5426 * Classical reasoning: the meson method now accepts theorems as arguments.
5428 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
5429 jobs to provide advice on the provability of subgoals.
5431 * Theory OrderedGroup and Ring_and_Field: various additions and
5432 improvements to faciliate calculations involving equalities and
5435 The following theorems have been eliminated or modified
5438 abs_eq now named abs_of_nonneg
5439 abs_of_ge_0 now named abs_of_nonneg
5440 abs_minus_eq now named abs_of_nonpos
5441 imp_abs_id now named abs_of_nonneg
5442 imp_abs_neg_id now named abs_of_nonpos
5443 mult_pos now named mult_pos_pos
5444 mult_pos_le now named mult_nonneg_nonneg
5445 mult_pos_neg_le now named mult_nonneg_nonpos
5446 mult_pos_neg2_le now named mult_nonneg_nonpos2
5447 mult_neg now named mult_neg_neg
5448 mult_neg_le now named mult_nonpos_nonpos
5450 * The following lemmas in Ring_and_Field have been added to the simplifier:
5453 not_square_less_zero
5455 The following lemmas have been deleted from Real/RealPow:
5465 * Theory Parity: added rules for simplifying exponents.
5469 The following theorems have been eliminated or modified
5472 list_all_Nil now named list_all.simps(1)
5473 list_all_Cons now named list_all.simps(2)
5474 list_all_conv now named list_all_iff
5475 set_mem_eq now named mem_iff
5477 * Theories SetsAndFunctions and BigO (see HOL/Library) support
5478 asymptotic "big O" calculations. See the notes in BigO.thy.
5483 * Theory RealDef: better support for embedding natural numbers and
5484 integers in the reals.
5486 The following theorems have been eliminated or modified
5489 exp_ge_add_one_self now requires no hypotheses
5490 real_of_int_add reversed direction of equality (use [symmetric])
5491 real_of_int_minus reversed direction of equality (use [symmetric])
5492 real_of_int_diff reversed direction of equality (use [symmetric])
5493 real_of_int_mult reversed direction of equality (use [symmetric])
5495 * Theory RComplete: expanded support for floor and ceiling functions.
5497 * Theory Ln is new, with properties of the natural logarithm
5499 * Hyperreal: There is a new type constructor "star" for making
5500 nonstandard types. The old type names are now type synonyms:
5504 hcomplex = complex star
5506 * Hyperreal: Many groups of similarly-defined constants have been
5507 replaced by polymorphic versions (INCOMPATIBILITY):
5509 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
5511 starset <-- starsetNat, starsetC
5512 *s* <-- *sNat*, *sc*
5513 starset_n <-- starsetNat_n, starsetC_n
5514 *sn* <-- *sNatn*, *scn*
5515 InternalSets <-- InternalNatSets, InternalCSets
5517 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5518 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
5519 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
5520 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
5521 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
5523 * Hyperreal: Many type-specific theorems have been removed in favor of
5524 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
5526 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
5527 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
5528 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
5529 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
5530 right_minus <-- hypreal_add_minus
5531 left_minus <-- {hypreal,hcomplex}_add_minus_left
5532 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
5533 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
5534 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
5535 mult_1_right <-- hcomplex_mult_one_right
5536 mult_zero_left <-- hcomplex_mult_zero_left
5537 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
5538 right_distrib <-- hypnat_add_mult_distrib2
5539 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
5540 right_inverse <-- hypreal_mult_inverse
5541 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
5542 order_refl <-- {hypreal,hypnat}_le_refl
5543 order_trans <-- {hypreal,hypnat}_le_trans
5544 order_antisym <-- {hypreal,hypnat}_le_anti_sym
5545 order_less_le <-- {hypreal,hypnat}_less_le
5546 linorder_linear <-- {hypreal,hypnat}_le_linear
5547 add_left_mono <-- {hypreal,hypnat}_add_left_mono
5548 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
5549 add_nonneg_nonneg <-- hypreal_le_add_order
5551 * Hyperreal: Separate theorems having to do with type-specific
5552 versions of constants have been merged into theorems that apply to the
5553 new polymorphic constants (INCOMPATIBILITY):
5555 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
5556 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
5557 STAR_Un <-- {STAR,NatStar,STARC}_Un
5558 STAR_Int <-- {STAR,NatStar,STARC}_Int
5559 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
5560 STAR_subset <-- {STAR,NatStar,STARC}_subset
5561 STAR_mem <-- {STAR,NatStar,STARC}_mem
5562 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
5563 STAR_diff <-- {STAR,STARC}_diff
5564 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
5565 STARC_hcomplex_of_complex}_image_subset
5566 starset_n_Un <-- starset{Nat,C}_n_Un
5567 starset_n_Int <-- starset{Nat,C}_n_Int
5568 starset_n_Compl <-- starset{Nat,C}_n_Compl
5569 starset_n_diff <-- starset{Nat,C}_n_diff
5570 InternalSets_Un <-- Internal{Nat,C}Sets_Un
5571 InternalSets_Int <-- Internal{Nat,C}Sets_Int
5572 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
5573 InternalSets_diff <-- Internal{Nat,C}Sets_diff
5574 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
5575 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
5576 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
5577 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
5578 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
5579 starfun <-- starfun{Nat,Nat2,C,RC,CR}
5580 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
5581 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
5582 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
5583 starfun_diff <-- starfun{C,RC,CR}_diff
5584 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
5585 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
5586 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
5587 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
5588 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
5589 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
5590 starfun_Id <-- starfunC_Id
5591 starfun_approx <-- starfun{Nat,CR}_approx
5592 starfun_capprox <-- starfun{C,RC}_capprox
5593 starfun_abs <-- starfunNat_rabs
5594 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
5595 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
5596 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
5597 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
5598 starfun_add_capprox <-- starfun{C,RC}_add_capprox
5599 starfun_add_approx <-- starfunCR_add_approx
5600 starfun_inverse_inverse <-- starfunC_inverse_inverse
5601 starfun_divide <-- starfun{C,CR,RC}_divide
5602 starfun_n <-- starfun{Nat,C}_n
5603 starfun_n_mult <-- starfun{Nat,C}_n_mult
5604 starfun_n_add <-- starfun{Nat,C}_n_add
5605 starfun_n_add_minus <-- starfunNat_n_add_minus
5606 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
5607 starfun_n_minus <-- starfun{Nat,C}_n_minus
5608 starfun_n_eq <-- starfun{Nat,C}_n_eq
5610 star_n_add <-- {hypreal,hypnat,hcomplex}_add
5611 star_n_minus <-- {hypreal,hcomplex}_minus
5612 star_n_diff <-- {hypreal,hcomplex}_diff
5613 star_n_mult <-- {hypreal,hcomplex}_mult
5614 star_n_inverse <-- {hypreal,hcomplex}_inverse
5615 star_n_le <-- {hypreal,hypnat}_le
5616 star_n_less <-- {hypreal,hypnat}_less
5617 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
5618 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
5619 star_n_abs <-- hypreal_hrabs
5620 star_n_divide <-- hcomplex_divide
5622 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
5623 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
5624 star_of_diff <-- hypreal_of_real_diff
5625 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
5626 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
5627 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
5628 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
5629 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
5630 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
5631 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
5632 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
5633 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
5634 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
5635 star_of_number_of <-- {hypreal,hcomplex}_number_of
5636 star_of_number_less <-- number_of_less_hypreal_of_real_iff
5637 star_of_number_le <-- number_of_le_hypreal_of_real_iff
5638 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
5639 star_of_less_number <-- hypreal_of_real_less_number_of_iff
5640 star_of_le_number <-- hypreal_of_real_le_number_of_iff
5641 star_of_power <-- hypreal_of_real_power
5642 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
5644 * Hyperreal: new method "transfer" that implements the transfer
5645 principle of nonstandard analysis. With a subgoal that mentions
5646 nonstandard types like "'a star", the command "apply transfer"
5647 replaces it with an equivalent one that mentions only standard types.
5648 To be successful, all free variables must have standard types; non-
5649 standard variables must have explicit universal quantifiers.
5651 * Hyperreal: A theory of Taylor series.
5656 * Discontinued special version of 'constdefs' (which used to support
5657 continuous functions) in favor of the general Pure one with full
5660 * New simplification procedure for solving continuity conditions; it
5661 is much faster on terms with many nested lambda abstractions (cubic
5662 instead of exponential time).
5664 * New syntax for domain package: selector names are now optional.
5665 Parentheses should be omitted unless argument is lazy, for example:
5667 domain 'a stream = cons "'a" (lazy "'a stream")
5669 * New command 'fixrec' for defining recursive functions with pattern
5670 matching; defining multiple functions with mutual recursion is also
5671 supported. Patterns may include the constants cpair, spair, up, sinl,
5672 sinr, or any data constructor defined by the domain package. The given
5673 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
5674 syntax and examples.
5676 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
5677 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
5678 but the proof obligation additionally includes an admissibility
5679 requirement. The packages generate instances of class cpo or pcpo,
5680 with continuity and strictness theorems for Rep and Abs.
5682 * HOLCF: Many theorems have been renamed according to a more standard naming
5683 scheme (INCOMPATIBILITY):
5685 foo_inject: "foo$x = foo$y ==> x = y"
5686 foo_eq: "(foo$x = foo$y) = (x = y)"
5687 foo_less: "(foo$x << foo$y) = (x << y)"
5688 foo_strict: "foo$UU = UU"
5689 foo_defined: "... ==> foo$x ~= UU"
5690 foo_defined_iff: "(foo$x = UU) = (x = UU)"
5695 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
5696 including the First Isomorphism Theorem (on quotienting by the kernel
5699 * ZF/Simplifier: install second copy of type solver that actually
5700 makes use of TC rules declared to Isar proof contexts (or locales);
5701 the old version is still required for ML proof scripts.
5706 * Converted to Isar theory format; use locales instead of axiomatic
5712 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
5715 * Pure/library.ML no longer defines its own option datatype, but uses
5716 that of the SML basis, which has constructors NONE and SOME instead of
5717 None and Some, as well as exception Option.Option instead of OPTION.
5718 The functions the, if_none, is_some, is_none have been adapted
5719 accordingly, while Option.map replaces apsome.
5721 * Pure/library.ML: the exception LIST has been given up in favour of
5722 the standard exceptions Empty and Subscript, as well as
5723 Library.UnequalLengths. Function like Library.hd and Library.tl are
5724 superceded by the standard hd and tl functions etc.
5726 A number of basic list functions are no longer exported to the ML
5727 toplevel, as they are variants of predefined functions. The following
5728 suggests how one can translate existing code:
5730 rev_append xs ys = List.revAppend (xs, ys)
5731 nth_elem (i, xs) = List.nth (xs, i)
5732 last_elem xs = List.last xs
5733 flat xss = List.concat xss
5734 seq fs = List.app fs
5735 partition P xs = List.partition P xs
5736 mapfilter f xs = List.mapPartial f xs
5738 * Pure/library.ML: several combinators for linear functional
5739 transformations, notably reverse application and composition:
5742 (x, y) |-> f f #-> g
5744 * Pure/library.ML: introduced/changed precedence of infix operators:
5746 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
5748 infix 3 o oo ooo oooo;
5749 infix 4 ~~ upto downto;
5751 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
5754 * Pure/library.ML: natural list combinators fold, fold_rev, and
5755 fold_map support linear functional transformations and nesting. For
5758 fold f [x1, ..., xN] y =
5759 y |> f x1 |> ... |> f xN
5761 (fold o fold) f [xs1, ..., xsN] y =
5762 y |> fold f xs1 |> ... |> fold f xsN
5764 fold f [x1, ..., xN] =
5767 (fold o fold) f [xs1, ..., xsN] =
5768 fold f xs1 #> ... #> fold f xsN
5770 * Pure/library.ML: the following selectors on type 'a option are
5773 the: 'a option -> 'a (*partial*)
5774 these: 'a option -> 'a where 'a = 'b list
5775 the_default: 'a -> 'a option -> 'a
5776 the_list: 'a option -> 'a list
5778 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5779 basic operations for association lists, following natural argument
5780 order; moreover the explicit equality predicate passed here avoids
5781 potentially expensive polymorphic runtime equality checks.
5782 The old functions may be expressed as follows:
5784 assoc = uncurry (AList.lookup (op =))
5785 assocs = these oo AList.lookup (op =)
5786 overwrite = uncurry (AList.update (op =)) o swap
5788 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
5790 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
5791 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
5793 replacing make_keylist and keyfilter (occassionally used)
5796 make_keylist = AList.make
5797 keyfilter = AList.find (op =)
5799 * eq_fst and eq_snd now take explicit equality parameter, thus
5800 avoiding eqtypes. Naive rewrites:
5802 eq_fst = eq_fst (op =)
5803 eq_snd = eq_snd (op =)
5805 * Removed deprecated apl and apr (rarely used).
5808 apl (n, op) =>>= curry op n
5809 apr (op, m) =>>= fn n => op (n, m)
5811 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
5812 provides a reasonably efficient light-weight implementation of sets as
5815 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
5816 few new operations; existing lookup and update are now curried to
5817 follow natural argument order (for use with fold etc.);
5818 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
5820 * Pure/General: output via the Isabelle channels of
5821 writeln/warning/error etc. is now passed through Output.output, with a
5822 hook for arbitrary transformations depending on the print_mode
5823 (cf. Output.add_mode -- the first active mode that provides a output
5824 function wins). Already formatted output may be embedded into further
5825 text via Output.raw; the result of Pretty.string_of/str_of and derived
5826 functions (string_of_term/cterm/thm etc.) is already marked raw to
5827 accommodate easy composition of diagnostic messages etc. Programmers
5828 rarely need to care about Output.output or Output.raw at all, with
5829 some notable exceptions: Output.output is required when bypassing the
5830 standard channels (writeln etc.), or in token translations to produce
5831 properly formatted results; Output.raw is required when capturing
5832 already output material that will eventually be presented to the user
5833 a second time. For the default print mode, both Output.output and
5834 Output.raw have no effect.
5836 * Pure/General: Output.time_accumulator NAME creates an operator ('a
5837 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
5838 cumulative results are displayed at the end of a batch session.
5840 * Pure/General: File.sysify_path and File.quote_sysify path have been
5841 replaced by File.platform_path and File.shell_path (with appropriate
5842 hooks). This provides a clean interface for unusual systems where the
5843 internal and external process view of file names are different.
5845 * Pure: more efficient orders for basic syntactic entities: added
5846 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
5847 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
5848 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
5849 orders now -- potential INCOMPATIBILITY for code that depends on a
5850 particular order for Symtab.keys, Symtab.dest, etc. (consider using
5851 Library.sort_strings on result).
5853 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
5854 fold_types traverse types/terms from left to right, observing natural
5855 argument order. Supercedes previous foldl_XXX versions, add_frees,
5856 add_vars etc. have been adapted as well: INCOMPATIBILITY.
5858 * Pure: name spaces have been refined, with significant changes of the
5859 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
5860 to extern(_table). The plain name entry path is superceded by a
5861 general 'naming' context, which also includes the 'policy' to produce
5862 a fully qualified name and external accesses of a fully qualified
5863 name; NameSpace.extend is superceded by context dependent
5864 Sign.declare_name. Several theory and proof context operations modify
5865 the naming context. Especially note Theory.restore_naming and
5866 ProofContext.restore_naming to get back to a sane state; note that
5867 Theory.add_path is no longer sufficient to recover from
5868 Theory.absolute_path in particular.
5870 * Pure: new flags short_names (default false) and unique_names
5871 (default true) for controlling output of qualified names. If
5872 short_names is set, names are printed unqualified. If unique_names is
5873 reset, the name prefix is reduced to the minimum required to achieve
5874 the original result when interning again, even if there is an overlap
5875 with earlier declarations.
5877 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
5878 now 'extend', and 'merge' gets an additional Pretty.pp argument
5879 (useful for printing error messages). INCOMPATIBILITY.
5881 * Pure: major reorganization of the theory context. Type Sign.sg and
5882 Theory.theory are now identified, referring to the universal
5883 Context.theory (see Pure/context.ML). Actual signature and theory
5884 content is managed as theory data. The old code and interfaces were
5885 spread over many files and structures; the new arrangement introduces
5886 considerable INCOMPATIBILITY to gain more clarity:
5888 Context -- theory management operations (name, identity, inclusion,
5889 parents, ancestors, merge, etc.), plus generic theory data;
5891 Sign -- logical signature and syntax operations (declaring consts,
5892 types, etc.), plus certify/read for common entities;
5894 Theory -- logical theory operations (stating axioms, definitions,
5895 oracles), plus a copy of logical signature operations (consts,
5896 types, etc.); also a few basic management operations (Theory.copy,
5899 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
5900 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
5901 for convenience -- they merely return the theory.
5903 * Pure: type Type.tsig is superceded by theory in most interfaces.
5905 * Pure: the Isar proof context type is already defined early in Pure
5906 as Context.proof (note that ProofContext.context and Proof.context are
5907 aliases, where the latter is the preferred name). This enables other
5908 Isabelle components to refer to that type even before Isar is present.
5910 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
5911 typeK, constK, axiomK, oracleK), but provide explicit operations for
5912 any of these kinds. For example, Sign.intern typeK is now
5913 Sign.intern_type, Theory.hide_space Sign.typeK is now
5914 Theory.hide_types. Also note that former
5915 Theory.hide_classes/types/consts are now
5916 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
5917 internalize their arguments! INCOMPATIBILITY.
5919 * Pure: get_thm interface (of PureThy and ProofContext) expects
5920 datatype thmref (with constructors Name and NameSelection) instead of
5921 plain string -- INCOMPATIBILITY;
5923 * Pure: cases produced by proof methods specify options, where NONE
5924 means to remove case bindings -- INCOMPATIBILITY in
5927 * Pure: the following operations retrieve axioms or theorems from a
5928 theory node or theory hierarchy, respectively:
5930 Theory.axioms_of: theory -> (string * term) list
5931 Theory.all_axioms_of: theory -> (string * term) list
5932 PureThy.thms_of: theory -> (string * thm) list
5933 PureThy.all_thms_of: theory -> (string * thm) list
5935 * Pure: print_tac now outputs the goal through the trace channel.
5937 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
5938 Reference Toplevel.debug (default false) controls detailed printing
5939 and tracing of low-level exceptions; Toplevel.profiling (default 0)
5940 controls execution profiling -- set to 1 for time and 2 for space
5941 (both increase the runtime).
5943 * Isar session: The initial use of ROOT.ML is now always timed,
5944 i.e. the log will show the actual process times, in contrast to the
5945 elapsed wall-clock time that the outer shell wrapper produces.
5947 * Simplifier: improved handling of bound variables (nameless
5948 representation, avoid allocating new strings). Simprocs that invoke
5949 the Simplifier recursively should use Simplifier.inherit_bounds to
5950 avoid local name clashes. Failure to do so produces warnings
5951 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
5952 for further details.
5954 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
5955 bindings for all theorems stored within a given theory; this may help
5956 in porting non-Isar theories to Isar ones, while keeping ML proof
5957 scripts for the time being.
5959 * ML operator HTML.with_charset specifies the charset begin used for
5960 generated HTML files. For example:
5962 HTML.with_charset "utf-8" use_thy "Hebrew";
5963 HTML.with_charset "utf-8" use_thy "Chinese";
5968 * Allow symlinks to all proper Isabelle executables (Isabelle,
5969 isabelle, isatool etc.).
5971 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
5972 isatool doc, isatool mkdir, display_drafts etc.).
5974 * isatool usedir: option -f allows specification of the ML file to be
5975 used by Isabelle; default is ROOT.ML.
5977 * New isatool version outputs the version identifier of the Isabelle
5978 distribution being used.
5980 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
5981 (containing Boolean satisfiability problems) into Isabelle/HOL
5986 New in Isabelle2004 (April 2004)
5987 --------------------------------
5991 * Provers/order.ML: new efficient reasoner for partial and linear orders.
5992 Replaces linorder.ML.
5994 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
5995 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
5996 (\<a>...\<z>), are now considered normal letters, and can therefore
5997 be used anywhere where an ASCII letter (a...zA...Z) has until
5998 now. COMPATIBILITY: This obviously changes the parsing of some
5999 terms, especially where a symbol has been used as a binder, say
6000 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
6001 as an identifier. Fix it by inserting a space around former
6002 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
6003 existing theory and ML files.
6005 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
6007 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
6008 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
6009 a normal (but invisible) letter. For multiple letter subscripts repeat
6010 \<^isub> like this: x\<^isub>1\<^isub>2.
6012 * Pure: There are now sub-/superscripts that can span more than one
6013 character. Text between \<^bsub> and \<^esub> is set in subscript in
6014 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
6015 superscript. The new control characters are not identifier parts.
6017 * Pure: Control-symbols of the form \<^raw:...> will literally print the
6018 content of "..." to the latex file instead of \isacntrl... . The "..."
6019 may consist of any printable characters excluding the end bracket >.
6021 * Pure: Using new Isar command "finalconsts" (or the ML functions
6022 Theory.add_finals or Theory.add_finals_i) it is now possible to
6023 declare constants "final", which prevents their being given a definition
6024 later. It is useful for constants whose behaviour is fixed axiomatically
6025 rather than definitionally, such as the meta-logic connectives.
6027 * Pure: 'instance' now handles general arities with general sorts
6028 (i.e. intersections of classes),
6030 * Presentation: generated HTML now uses a CSS style sheet to make layout
6031 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
6032 It can be changed to alter the colors/layout of generated pages.
6037 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
6038 cut_tac, subgoal_tac and thin_tac:
6039 - Now understand static (Isar) contexts. As a consequence, users of Isar
6040 locales are no longer forced to write Isar proof scripts.
6041 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
6043 - INCOMPATIBILITY: names of variables to be instantiated may no
6044 longer be enclosed in quotes. Instead, precede variable name with `?'.
6045 This is consistent with the instantiation attribute "where".
6047 * Attributes "where" and "of":
6048 - Now take type variables of instantiated theorem into account when reading
6049 the instantiation string. This fixes a bug that caused instantiated
6050 theorems to have too special types in some circumstances.
6051 - "where" permits explicit instantiations of type variables.
6053 * Calculation commands "moreover" and "also" no longer interfere with
6054 current facts ("this"), admitting arbitrary combinations with "then"
6058 - Goal statements involving the context element "includes" no longer
6059 generate theorems with internal delta predicates (those ending on
6060 "_axioms") in the premise.
6061 Resolve particular premise with <locale>.intro to obtain old form.
6062 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
6063 specification and "includes" elements in goal statement.
6064 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
6065 [intro?] and [elim?] (respectively) by default.
6066 - Experimental command for instantiation of locales in proof contexts:
6067 instantiate <label>[<attrs>]: <loc>
6068 Instantiates locale <loc> and adds all its theorems to the current context
6069 taking into account their attributes. Label and attrs are optional
6070 modifiers, like in theorem declarations. If present, names of
6071 instantiated theorems are qualified with <label>, and the attributes
6072 <attrs> are applied after any attributes these theorems might have already.
6073 If the locale has assumptions, a chained fact of the form
6074 "<loc> t1 ... tn" is expected from which instantiations of the parameters
6075 are derived. The command does not support old-style locales declared
6076 with "locale (open)".
6077 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
6079 * HOL: Tactic emulation methods induct_tac and case_tac understand static
6085 * Proof import: new image HOL4 contains the imported library from
6086 the HOL4 system with about 2500 theorems. It is imported by
6087 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
6088 can be used like any other Isabelle image. See
6089 HOL/Import/HOL/README for more information.
6092 - Much improved handling of linear and partial orders.
6093 Reasoners for linear and partial orders are set up for type classes
6094 "linorder" and "order" respectively, and are added to the default simpset
6095 as solvers. This means that the simplifier can build transitivity chains
6096 to solve goals from the assumptions.
6097 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
6098 of blast or auto after simplification become unnecessary because the goal
6099 is solved by simplification already.
6101 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
6102 all proved in axiomatic type classes for semirings, rings and fields.
6105 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
6106 now formalized using the Ring_and_Field theory mentioned above.
6107 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
6108 than before, because now they are set up once in a generic manner.
6109 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
6110 Look for the general versions in Ring_and_Field (and Power if they concern
6113 * Type "rat" of the rational numbers is now available in HOL-Complex.
6116 - Record types are now by default printed with their type abbreviation
6117 instead of the list of all field types. This can be configured via
6118 the reference "print_record_type_abbr".
6119 - Simproc "record_upd_simproc" for simplification of multiple updates added
6120 (not enabled by default).
6121 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
6122 EX x. x = sel r to True (not enabled by default).
6123 - Tactic "record_split_simp_tac" to split and simplify records added.
6125 * 'specification' command added, allowing for definition by
6126 specification. There is also an 'ax_specification' command that
6127 introduces the new constants axiomatically.
6129 * arith(_tac) is now able to generate counterexamples for reals as well.
6131 * HOL-Algebra: new locale "ring" for non-commutative rings.
6133 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
6134 definitions, thanks to Sava Krsti\'{c} and John Matthews.
6136 * HOL-Matrix: a first theory for matrices in HOL with an application of
6137 matrix theory to linear programming.
6139 * Unions and Intersections:
6140 The latex output syntax of UN and INT has been changed
6141 from "\Union x \in A. B" to "\Union_{x \in A} B"
6142 i.e. the index formulae has become a subscript.
6143 Similarly for "\Union x. B", and for \Inter instead of \Union.
6145 * Unions and Intersections over Intervals:
6146 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
6147 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
6148 like in normal math, and corresponding versions for < and for intersection.
6150 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
6151 lexicographic dictonary ordering has been added as "lexord".
6153 * ML: the legacy theory structures Int and List have been removed. They had
6154 conflicted with ML Basis Library structures having the same names.
6156 * 'refute' command added to search for (finite) countermodels. Only works
6157 for a fragment of HOL. The installation of an external SAT solver is
6158 highly recommended. See "HOL/Refute.thy" for details.
6160 * 'quickcheck' command: Allows to find counterexamples by evaluating
6161 formulae under an assignment of free variables to random values.
6162 In contrast to 'refute', it can deal with inductive datatypes,
6163 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
6169 * Streams now come with concatenation and are part of the HOLCF image
6173 New in Isabelle2003 (May 2003)
6174 ------------------------------
6178 * Provers/simplifier:
6180 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
6181 Assumptions are now subject to complete mutual simplification,
6182 not just from left to right. The simplifier now preserves
6183 the order of assumptions.
6185 Potential INCOMPATIBILITY:
6187 -- simp sometimes diverges where the old version did
6188 not, e.g. invoking simp on the goal
6190 [| P (f x); y = x; f x = f y |] ==> Q
6192 now gives rise to the infinite reduction sequence
6194 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
6196 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
6199 -- Tactics combining classical reasoner and simplification (such as auto)
6200 are also affected by this change, because many of them rely on
6201 simp. They may sometimes diverge as well or yield a different numbers
6202 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
6203 in case of problems. Sometimes subsequent calls to the classical
6204 reasoner will fail because a preceeding call to the simplifier too
6205 eagerly simplified the goal, e.g. deleted redundant premises.
6207 - The simplifier trace now shows the names of the applied rewrite rules
6209 - You can limit the number of recursive invocations of the simplifier
6210 during conditional rewriting (where the simplifie tries to solve the
6211 conditions before applying the rewrite rule):
6212 ML "simp_depth_limit := n"
6213 where n is an integer. Thus you can force termination where previously
6214 the simplifier would diverge.
6216 - Accepts free variables as head terms in congruence rules. Useful in Isar.
6218 - No longer aborts on failed congruence proof. Instead, the
6219 congruence is ignored.
6221 * Pure: New generic framework for extracting programs from constructive
6222 proofs. See HOL/Extraction.thy for an example instantiation, as well
6223 as HOL/Extraction for some case studies.
6225 * Pure: The main goal of the proof state is no longer shown by default, only
6226 the subgoals. This behaviour is controlled by a new flag.
6227 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
6228 (ML: Proof.show_main_goal).
6230 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
6231 rules whose conclusion matches subgoal 1:
6232 PG menu: Isabelle/Isar -> Show me -> matching rules
6233 The rules are ordered by how closely they match the subgoal.
6234 In particular, rules that solve a subgoal outright are displayed first
6235 (or rather last, the way they are printed).
6236 (ML: ProofGeneral.print_intros())
6238 * Pure: New flag trace_unify_fail causes unification to print
6239 diagnostic information (PG: in trace buffer) when it fails. This is
6240 useful for figuring out why single step proofs like rule, erule or
6243 * Pure: Locale specifications now produce predicate definitions
6244 according to the body of text (covering assumptions modulo local
6245 definitions); predicate "loc_axioms" covers newly introduced text,
6246 while "loc" is cumulative wrt. all included locale expressions; the
6247 latter view is presented only on export into the global theory
6248 context; potential INCOMPATIBILITY, use "(open)" option to fall back
6249 on the old view without predicates;
6251 * Pure: predefined locales "var" and "struct" are useful for sharing
6252 parameters (as in CASL, for example); just specify something like
6253 ``var x + var y + struct M'' as import;
6255 * Pure: improved thms_containing: proper indexing of facts instead of
6256 raw theorems; check validity of results wrt. current name space;
6257 include local facts of proof configuration (also covers active
6258 locales), cover fixed variables in index; may use "_" in term
6259 specification; an optional limit for the number of printed facts may
6260 be given (the default is 40);
6262 * Pure: disallow duplicate fact bindings within new-style theory files
6265 * Provers: improved induct method: assumptions introduced by case
6266 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
6267 the goal statement); "foo" still refers to all facts collectively;
6269 * Provers: the function blast.overloaded has been removed: all constants
6270 are regarded as potentially overloaded, which improves robustness in exchange
6271 for slight decrease in efficiency;
6273 * Provers/linorder: New generic prover for transitivity reasoning over
6274 linear orders. Note: this prover is not efficient!
6276 * Isar: preview of problems to finish 'show' now produce an error
6277 rather than just a warning (in interactive mode);
6284 - Produces a counter example if it cannot prove a goal.
6285 Note that the counter example may be spurious if the goal is not a formula
6286 of quantifier-free linear arithmetic.
6287 In ProofGeneral the counter example appears in the trace buffer.
6289 - Knows about div k and mod k where k is a numeral of type nat or int.
6291 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
6292 linear arithmetic fails. This takes account of quantifiers and divisibility.
6293 Presburger arithmetic can also be called explicitly via presburger(_tac).
6295 * simp's arithmetic capabilities have been enhanced a bit: it now
6296 takes ~= in premises into account (by performing a case split);
6298 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
6299 are distributed over a sum of terms;
6301 * New tactic "trans_tac" and method "trans" instantiate
6302 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
6305 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
6306 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
6308 * 'typedef' command has new option "open" to suppress the set
6311 * functions Min and Max on finite sets have been introduced (theory
6314 * attribute [symmetric] now works for relations as well; it turns
6315 (x,y) : R^-1 into (y,x) : R, and vice versa;
6317 * induct over a !!-quantified statement (say !!x1..xn):
6318 each "case" automatically performs "fix x1 .. xn" with exactly those names.
6320 * Map: `empty' is no longer a constant but a syntactic abbreviation for
6321 %x. None. Warning: empty_def now refers to the previously hidden definition
6324 * Algebra: formalization of classical algebra. Intended as base for
6325 any algebraic development in Isabelle. Currently covers group theory
6326 (up to Sylow's theorem) and ring theory (Universal Property of
6327 Univariate Polynomials). Contributions welcome;
6329 * GroupTheory: deleted, since its material has been moved to Algebra;
6331 * Complex: new directory of the complex numbers with numeric constants,
6332 nonstandard complex numbers, and some complex analysis, standard and
6333 nonstandard (Jacques Fleuriot);
6335 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
6337 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
6340 * Real/HahnBanach: updated and adapted to locales;
6342 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
6345 * UNITY: added the Meier-Sanders theory of progress sets;
6347 * MicroJava: bytecode verifier and lightweight bytecode verifier
6348 as abstract algorithms, instantiated to the JVM;
6350 * Bali: Java source language formalization. Type system, operational
6351 semantics, axiomatic semantics. Supported language features:
6352 classes, interfaces, objects,virtual methods, static methods,
6353 static/instance fields, arrays, access modifiers, definite
6354 assignment, exceptions.
6359 * ZF/Constructible: consistency proof for AC (Gdel's constructible
6362 * Main ZF: virtually all theories converted to new-style format;
6367 * Pure: Tactic.prove provides sane interface for internal proofs;
6368 omits the infamous "standard" operation, so this is more appropriate
6369 than prove_goalw_cterm in many situations (e.g. in simprocs);
6371 * Pure: improved error reporting of simprocs;
6373 * Provers: Simplifier.simproc(_i) provides sane interface for setting
6377 *** Document preparation ***
6379 * uses \par instead of \\ for line breaks in theory text. This may
6380 shift some page breaks in large documents. To get the old behaviour
6381 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
6383 * minimized dependencies of isabelle.sty and isabellesym.sty on
6386 * \<euro> now needs package babel/greek instead of marvosym (which
6389 * normal size for \<zero>...\<nine> (uses \mathbf instead of
6394 New in Isabelle2002 (March 2002)
6395 --------------------------------
6397 *** Document preparation ***
6399 * greatly simplified document preparation setup, including more
6400 graceful interpretation of isatool usedir -i/-d/-D options, and more
6401 instructive isatool mkdir; users should basically be able to get
6402 started with "isatool mkdir HOL Test && isatool make"; alternatively,
6403 users may run a separate document processing stage manually like this:
6404 "isatool usedir -D output HOL Test && isatool document Test/output";
6406 * theory dependency graph may now be incorporated into documents;
6407 isatool usedir -g true will produce session_graph.eps/.pdf for use
6408 with \includegraphics of LaTeX;
6410 * proper spacing of consecutive markup elements, especially text
6411 blocks after section headings;
6413 * support bold style (for single symbols only), input syntax is like
6414 this: "\<^bold>\<alpha>" or "\<^bold>A";
6416 * \<bullet> is now output as bold \cdot by default, which looks much
6417 better in printed text;
6419 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
6420 note that these symbols are currently unavailable in Proof General /
6421 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
6423 * isatool latex no longer depends on changed TEXINPUTS, instead
6424 isatool document copies the Isabelle style files to the target
6430 * Pure/Provers: improved proof by cases and induction;
6431 - 'case' command admits impromptu naming of parameters (such as
6433 - 'induct' method divinates rule instantiation from the inductive
6434 claim; no longer requires excessive ?P bindings for proper
6435 instantiation of cases;
6436 - 'induct' method properly enumerates all possibilities of set/type
6437 rules; as a consequence facts may be also passed through *type*
6438 rules without further ado;
6439 - 'induct' method now derives symbolic cases from the *rulified*
6440 rule (before it used to rulify cases stemming from the internal
6441 atomized version); this means that the context of a non-atomic
6442 statement becomes is included in the hypothesis, avoiding the
6443 slightly cumbersome show "PROP ?case" form;
6444 - 'induct' may now use elim-style induction rules without chaining
6445 facts, using ``missing'' premises from the goal state; this allows
6446 rules stemming from inductive sets to be applied in unstructured
6447 scripts, while still benefitting from proper handling of non-atomic
6448 statements; NB: major inductive premises need to be put first, all
6449 the rest of the goal is passed through the induction;
6450 - 'induct' proper support for mutual induction involving non-atomic
6451 rule statements (uses the new concept of simultaneous goals, see
6453 - append all possible rule selections, but only use the first
6454 success (no backtracking);
6455 - removed obsolete "(simplified)" and "(stripped)" options of methods;
6456 - undeclared rule case names default to numbers 1, 2, 3, ...;
6457 - added 'print_induct_rules' (covered by help item in recent Proof
6459 - moved induct/cases attributes to Pure, methods to Provers;
6460 - generic method setup instantiated for FOL and HOL;
6462 * Pure: support multiple simultaneous goal statements, for example
6463 "have a: A and b: B" (same for 'theorem' etc.); being a pure
6464 meta-level mechanism, this acts as if several individual goals had
6465 been stated separately; in particular common proof methods need to be
6466 repeated in order to cover all claims; note that a single elimination
6467 step is *not* sufficient to establish the two conjunctions, so this
6470 assume "A & B" then have A and B .. (*".." fails*)
6472 better use "obtain" in situations as above; alternative refer to
6473 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
6475 * Pure: proper integration with ``locales''; unlike the original
6476 version by Florian Kammller, Isar locales package high-level proof
6477 contexts rather than raw logical ones (e.g. we admit to include
6478 attributes everywhere); operations on locales include merge and
6479 rename; support for implicit arguments (``structures''); simultaneous
6480 type-inference over imports and text; see also HOL/ex/Locales.thy for
6483 * Pure: the following commands have been ``localized'', supporting a
6484 target locale specification "(in name)": 'lemma', 'theorem',
6485 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
6486 stored both within the locale and at the theory level (exported and
6487 qualified by the locale name);
6489 * Pure: theory goals may now be specified in ``long'' form, with
6490 ad-hoc contexts consisting of arbitrary locale elements. for example
6491 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
6492 definitions may be given, too); the result is a meta-level rule with
6493 the context elements being discharged in the obvious way;
6495 * Pure: new proof command 'using' allows to augment currently used
6496 facts after a goal statement ('using' is syntactically analogous to
6497 'apply', but acts on the goal's facts only); this allows chained facts
6498 to be separated into parts given before and after a claim, as in
6499 ``from a and b have C using d and e <proof>'';
6501 * Pure: renamed "antecedent" case to "rule_context";
6503 * Pure: new 'judgment' command records explicit information about the
6504 object-logic embedding (used by several tools internally); no longer
6505 use hard-wired "Trueprop";
6507 * Pure: added 'corollary' command;
6509 * Pure: fixed 'token_translation' command;
6511 * Pure: removed obsolete 'exported' attribute;
6513 * Pure: dummy pattern "_" in is/let is now automatically lifted over
6514 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
6515 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
6517 * Pure: method 'atomize' presents local goal premises as object-level
6518 statements (atomic meta-level propositions); setup controlled via
6519 rewrite rules declarations of 'atomize' attribute; example
6520 application: 'induct' method with proper rule statements in improper
6523 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
6524 now consider the syntactic context of assumptions, giving a better
6525 chance to get type-inference of the arguments right (this is
6526 especially important for locales);
6528 * Pure: "sorry" no longer requires quick_and_dirty in interactive
6531 * Pure/obtain: the formal conclusion "thesis", being marked as
6532 ``internal'', may no longer be reference directly in the text;
6533 potential INCOMPATIBILITY, may need to use "?thesis" in rare
6536 * Pure: generic 'sym' attribute which declares a rule both as pure
6537 'elim?' and for the 'symmetric' operation;
6539 * Pure: marginal comments ``--'' may now occur just anywhere in the
6540 text; the fixed correlation with particular command syntax has been
6543 * Pure: new method 'rules' is particularly well-suited for proof
6544 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
6545 but often produces more compact proof terms with less detours;
6547 * Pure/Provers/classical: simplified integration with pure rule
6548 attributes and methods; the classical "intro?/elim?/dest?"
6549 declarations coincide with the pure ones; the "rule" method no longer
6550 includes classically swapped intros; "intro" and "elim" methods no
6551 longer pick rules from the context; also got rid of ML declarations
6552 AddXIs/AddXEs/AddXDs; all of this has some potential for
6555 * Provers/classical: attribute 'swapped' produces classical inversions
6556 of introduction rules;
6558 * Provers/simplifier: 'simplified' attribute may refer to explicit
6559 rules instead of full simplifier context; 'iff' attribute handles
6562 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
6564 * HOL: 'recdef' now fails on unfinished automated proofs, use
6565 "(permissive)" option to recover old behavior;
6567 * HOL: 'inductive' no longer features separate (collective) attributes
6568 for 'intros' (was found too confusing);
6570 * HOL: properly declared induction rules less_induct and
6576 * HOL: moved over to sane numeral syntax; the new policy is as
6579 - 0 and 1 are polymorphic constants, which are defined on any
6580 numeric type (nat, int, real etc.);
6582 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
6583 binary representation internally;
6585 - type nat has special constructor Suc, and generally prefers Suc 0
6586 over 1::nat and Suc (Suc 0) over 2::nat;
6588 This change may cause significant problems of INCOMPATIBILITY; here
6589 are some hints on converting existing sources:
6591 - due to the new "num" token, "-0" and "-1" etc. are now atomic
6592 entities, so expressions involving "-" (unary or binary minus) need
6593 to be spaced properly;
6595 - existing occurrences of "1" may need to be constraint "1::nat" or
6596 even replaced by Suc 0; similar for old "2";
6598 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
6600 - remove all special provisions on numerals in proofs;
6602 * HOL: simp rules nat_number expand numerals on nat to Suc/0
6603 representation (depends on bin_arith_simps in the default context);
6605 * HOL: symbolic syntax for x^2 (numeral 2);
6607 * HOL: the class of all HOL types is now called "type" rather than
6608 "term"; INCOMPATIBILITY, need to adapt references to this type class
6609 in axclass/classes, instance/arities, and (usually rare) occurrences
6610 in typings (of consts etc.); internally the class is called
6611 "HOL.type", ML programs should refer to HOLogic.typeS;
6613 * HOL/record package improvements:
6614 - new derived operations "fields" to build a partial record section,
6615 "extend" to promote a fixed record to a record scheme, and
6616 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
6617 declared as simp by default;
6618 - shared operations ("more", "fields", etc.) now need to be always
6619 qualified) --- potential INCOMPATIBILITY;
6620 - removed "make_scheme" operations (use "make" with "extend") --
6622 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
6623 - provides cases/induct rules for use with corresponding Isar
6624 methods (for concrete records, record schemes, concrete more
6625 parts, and schematic more parts -- in that order);
6626 - internal definitions directly based on a light-weight abstract
6627 theory of product types over typedef rather than datatype;
6629 * HOL: generic code generator for generating executable ML code from
6630 specifications; specific support for HOL constructs such as inductive
6631 datatypes and sets, as well as recursive functions; can be invoked
6632 via 'generate_code' theory section;
6634 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
6636 * HOL: consolidated and renamed several theories. In particular:
6637 Ord.thy has been absorbed into HOL.thy
6638 String.thy has been absorbed into List.thy
6640 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
6641 (beware of argument permutation!);
6643 * HOL: linorder_less_split superseded by linorder_cases;
6645 * HOL/List: "nodups" renamed to "distinct";
6647 * HOL: added "The" definite description operator; move Hilbert's "Eps"
6648 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
6649 - Ex_def has changed, now need to use some_eq_ex
6651 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
6652 in this (rare) case use:
6654 delSWrapper "split_all_tac"
6655 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
6657 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
6660 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
6661 Isabelle's type classes, ^ on functions and relations has too general
6662 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
6663 necessary to attach explicit type constraints;
6665 * HOL/Relation: the prefix name of the infix "O" has been changed from
6666 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
6667 renamed accordingly (eg "compI" -> "rel_compI").
6669 * HOL: syntax translations now work properly with numerals and records
6672 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
6673 of "lam" -- INCOMPATIBILITY;
6675 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
6676 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
6677 renamed "Product_Type.unit";
6679 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
6681 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
6682 the "cases" method);
6684 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
6687 * HOL/IMP: updated and converted to new-style theory format; several
6688 parts turned into readable document, with proper Isar proof texts and
6689 some explanations (by Gerwin Klein);
6691 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
6693 * HOL-Hyperreal is now a logic image;
6698 * Isar: consts/constdefs supports mixfix syntax for continuous
6701 * Isar: domain package adapted to new-style theory format, e.g. see
6704 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
6705 potential INCOMPATIBILITY; now use plain induct_tac instead of former
6706 lift.induct_tac, always use UU instead of Undef;
6708 * HOLCF/IMP: updated and converted to new-style theory;
6713 * Isar: proper integration of logic-specific tools and packages,
6714 including theory commands '(co)inductive', '(co)datatype',
6715 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
6716 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
6718 * theory Main no longer includes AC; for the Axiom of Choice, base
6719 your theory on Main_ZFC;
6721 * the integer library now covers quotients and remainders, with many
6722 laws relating division to addition, multiplication, etc.;
6724 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
6725 typeless version of the formalism;
6727 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
6730 * ZF/Induct: new directory for examples of inductive definitions,
6731 including theory Multiset for multiset orderings; converted to
6732 new-style theory format;
6734 * ZF: many new theorems about lists, ordinals, etc.;
6739 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
6740 variable proof controls level of detail: 0 = no proofs (only oracle
6741 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
6742 also ref manual for further ML interfaces;
6744 * Pure/axclass: removed obsolete ML interface
6745 goal_subclass/goal_arity;
6747 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
6748 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
6749 separate tokens, so expressions involving minus need to be spaced
6752 * Pure/syntax: support non-oriented infixes, using keyword "infix"
6753 rather than "infixl" or "infixr";
6755 * Pure/syntax: concrete syntax for dummy type variables admits genuine
6756 sort constraint specifications in type inference; e.g. "x::_::foo"
6757 ensures that the type of "x" is of sort "foo" (but not necessarily a
6760 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
6761 control output of nested => (types); the default behavior is
6764 * Pure/syntax: builtin parse translation for "_constify" turns valued
6765 tokens into AST constants;
6767 * Pure/syntax: prefer later declarations of translations and print
6768 translation functions; potential INCOMPATIBILITY: need to reverse
6769 multiple declarations for same syntax element constant;
6771 * Pure/show_hyps reset by default (in accordance to existing Isar
6774 * Provers/classical: renamed addaltern to addafter, addSaltern to
6777 * Provers/clasimp: ``iff'' declarations now handle conditional rules
6780 * system: tested support for MacOS X; should be able to get Isabelle +
6781 Proof General to work in a plain Terminal after installing Poly/ML
6782 (e.g. from the Isabelle distribution area) and GNU bash alone
6783 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
6784 support requires further installations, e.g. from
6785 http://fink.sourceforge.net/);
6787 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
6789 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
6790 of 40 MB), cf. ML_OPTIONS;
6792 * system: Proof General keywords specification is now part of the
6793 Isabelle distribution (see etc/isar-keywords.el);
6795 * system: support for persistent Proof General sessions (refrain from
6796 outdating all loaded theories on startup); user may create writable
6797 logic images like this: ``isabelle -q HOL Test'';
6799 * system: smart selection of Isabelle process versus Isabelle
6800 interface, accommodates case-insensitive file systems (e.g. HFS+); may
6801 run both "isabelle" and "Isabelle" even if file names are badly
6802 damaged (executable inspects the case of the first letter of its own
6803 name); added separate "isabelle-process" and "isabelle-interface";
6805 * system: refrain from any attempt at filtering input streams; no
6806 longer support ``8bit'' encoding of old isabelle font, instead proper
6807 iso-latin characters may now be used; the related isatools
6808 "symbolinput" and "nonascii" have disappeared as well;
6810 * system: removed old "xterm" interface (the print modes "xterm" and
6811 "xterm_color" are still available for direct use in a suitable
6816 New in Isabelle99-2 (February 2001)
6817 -----------------------------------
6819 *** Overview of INCOMPATIBILITIES ***
6821 * HOL: please note that theories in the Library and elsewhere often use the
6822 new-style (Isar) format; to refer to their theorems in an ML script you must
6823 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
6825 * HOL: inductive package no longer splits induction rule aggressively,
6826 but only as far as specified by the introductions given; the old
6827 format may be recovered via ML function complete_split_rule or attribute
6828 'split_rule (complete)';
6830 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
6831 gfp_Tarski to gfp_unfold;
6833 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
6835 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
6836 relation); infix "^^" has been renamed "``"; infix "``" has been
6837 renamed "`"; "univalent" has been renamed "single_valued";
6839 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
6842 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
6844 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
6846 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
6847 consequence, it is no longer monotonic wrt. the local goal context
6848 (which is now passed through the inductive cases);
6850 * Document preparation: renamed standard symbols \<ll> to \<lless> and
6851 \<gg> to \<ggreater>;
6854 *** Document preparation ***
6856 * \isabellestyle{NAME} selects version of Isabelle output (currently
6857 available: are "it" for near math-mode best-style output, "sl" for
6858 slanted text style, and "tt" for plain type-writer; if no
6859 \isabellestyle command is given, output is according to slanted
6862 * support sub/super scripts (for single symbols only), input syntax is
6863 like this: "A\<^sup>*" or "A\<^sup>\<star>";
6865 * some more standard symbols; see Appendix A of the system manual for
6866 the complete list of symbols defined in isabellesym.sty;
6868 * improved isabelle style files; more abstract symbol implementation
6869 (should now use \isamath{...} and \isatext{...} in custom symbol
6872 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
6873 state; Note that presentation of goal states does not conform to
6874 actual human-readable proof documents. Please do not include goal
6875 states into document output unless you really know what you are doing!
6877 * proper indentation of antiquoted output with proportional LaTeX
6880 * no_document ML operator temporarily disables LaTeX document
6883 * isatool unsymbolize tunes sources for plain ASCII communication;
6888 * Pure: Isar now suffers initial goal statements to contain unbound
6889 schematic variables (this does not conform to actual readable proof
6890 documents, due to unpredictable outcome and non-compositional proof
6891 checking); users who know what they are doing may use schematic goals
6892 for Prolog-style synthesis of proven results;
6894 * Pure: assumption method (an implicit finishing) now handles actual
6897 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
6898 initial goal, declare "that" only as Pure intro (only for single
6899 steps); the "that" rule assumption may now be involved in implicit
6900 finishing, thus ".." becomes a feasible for trivial obtains;
6902 * Pure: default proof step now includes 'intro_classes'; thus trivial
6903 instance proofs may be performed by "..";
6905 * Pure: ?thesis / ?this / "..." now work for pure meta-level
6908 * Pure: more robust selection of calculational rules;
6910 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
6911 rule (as well as the assumption rule);
6913 * Pure: 'thm_deps' command visualizes dependencies of theorems and
6914 lemmas, using the graph browser tool;
6916 * Pure: predict failure of "show" in interactive mode;
6918 * Pure: 'thms_containing' now takes actual terms as arguments;
6920 * HOL: improved method 'induct' --- now handles non-atomic goals
6921 (potential INCOMPATIBILITY); tuned error handling;
6923 * HOL: cases and induct rules now provide explicit hints about the
6924 number of facts to be consumed (0 for "type" and 1 for "set" rules);
6925 any remaining facts are inserted into the goal verbatim;
6927 * HOL: local contexts (aka cases) may now contain term bindings as
6928 well; the 'cases' and 'induct' methods new provide a ?case binding for
6929 the result to be shown in each case;
6931 * HOL: added 'recdef_tc' command;
6933 * isatool convert assists in eliminating legacy ML scripts;
6938 * HOL/Library: a collection of generic theories to be used together
6939 with main HOL; the theory loader path already includes this directory
6940 by default; the following existing theories have been moved here:
6941 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
6942 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
6944 * HOL/Unix: "Some aspects of Unix file-system security", a typical
6945 modelling and verification task performed in Isabelle/HOL +
6946 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
6948 * HOL/Algebra: special summation operator SUM no longer exists, it has
6949 been replaced by setsum; infix 'assoc' now has priority 50 (like
6950 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
6951 'domain', this makes the theory consistent with mathematical
6954 * HOL basics: added overloaded operations "inverse" and "divide"
6955 (infix "/"), syntax for generic "abs" operation, generic summation
6958 * HOL/typedef: simplified package, provide more useful rules (see also
6961 * HOL/datatype: induction rule for arbitrarily branching datatypes is
6962 now expressed as a proper nested rule (old-style tactic scripts may
6963 require atomize_strip_tac to cope with non-atomic premises);
6965 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
6966 to "split_conv" (old name still available for compatibility);
6968 * HOL: improved concrete syntax for strings (e.g. allows translation
6969 rules with string literals);
6971 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
6972 and Fleuriot's mechanization of analysis, including the transcendental
6973 functions for the reals;
6975 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
6980 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
6981 "lam" is displayed as TWO lambda-symbols
6983 * CTT: theory Main now available, containing everything (that is, Bool
6989 * Pure: the Simplifier has been implemented properly as a derived rule
6990 outside of the actual kernel (at last!); the overall performance
6991 penalty in practical applications is about 50%, while reliability of
6992 the Isabelle inference kernel has been greatly improved;
6994 * print modes "brackets" and "no_brackets" control output of nested =>
6995 (types) and ==> (props); the default behaviour is "brackets";
6997 * Provers: fast_tac (and friends) now handle actual object-logic rules
6998 as assumptions as well;
7000 * system: support Poly/ML 4.0;
7002 * system: isatool install handles KDE version 1 or 2;
7006 New in Isabelle99-1 (October 2000)
7007 ----------------------------------
7009 *** Overview of INCOMPATIBILITIES ***
7011 * HOL: simplification of natural numbers is much changed; to partly
7012 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
7013 issue the following ML commands:
7015 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
7016 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
7018 * HOL: simplification no longer dives into case-expressions; this is
7019 controlled by "t.weak_case_cong" for each datatype t;
7021 * HOL: nat_less_induct renamed to less_induct;
7023 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
7024 fixsome to patch .thy and .ML sources automatically;
7026 select_equality -> some_equality
7027 select_eq_Ex -> some_eq_ex
7028 selectI2EX -> someI2_ex
7031 select1_equality -> some1_equality
7032 Eps_sym_eq -> some_sym_eq_trivial
7033 Eps_eq -> some_eq_trivial
7035 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
7037 * HOL: removed obsolete theorem binding expand_if (refer to split_if
7040 * HOL: the recursion equations generated by 'recdef' are now called
7041 f.simps instead of f.rules;
7043 * HOL: qed_spec_mp now also handles bounded ALL as well;
7045 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
7046 sometimes be needed;
7048 * HOL: the constant for "f``x" is now "image" rather than "op ``";
7050 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
7052 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
7053 product is now "<*>" instead of "Times"; the lexicographic product is
7054 now "<*lex*>" instead of "**";
7056 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
7057 of main HOL, but was unused); better use HOL's datatype package;
7059 * HOL: removed "symbols" syntax for constant "override" of theory Map;
7060 the old syntax may be recovered as follows:
7063 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
7064 (infixl "\\<oplus>" 100)
7066 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7068 * HOL/ML: even fewer consts are declared as global (see theories Ord,
7069 Lfp, Gfp, WF); this only affects ML packages that refer to const names
7072 * HOL and ZF: syntax for quotienting wrt an equivalence relation
7073 changed from A/r to A//r;
7075 * ZF: new treatment of arithmetic (nat & int) may break some old
7078 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
7079 rulify -> rule_format, elimify -> elim_format, ...);
7081 * Isar/Provers: intro/elim/dest attributes changed; renamed
7082 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
7083 should have to change intro!! to intro? only); replaced "delrule" by
7086 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
7088 * Provers: strengthened force_tac by using new first_best_tac;
7090 * LaTeX document preparation: several changes of isabelle.sty (see
7094 *** Document preparation ***
7096 * formal comments (text blocks etc.) in new-style theories may now
7097 contain antiquotations of thm/prop/term/typ/text to be presented
7098 according to latex print mode; concrete syntax is like this:
7099 @{term[show_types] "f(x) = a + x"};
7101 * isatool mkdir provides easy setup of Isabelle session directories,
7102 including proper document sources;
7104 * generated LaTeX sources are now deleted after successful run
7105 (isatool document -c); may retain a copy somewhere else via -D option
7108 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
7109 style files, achieving self-contained LaTeX sources and simplifying
7112 * old-style theories now produce (crude) LaTeX output as well;
7114 * browser info session directories are now self-contained (may be put
7115 on WWW server seperately); improved graphs of nested sessions; removed
7116 graph for 'all sessions';
7118 * several improvements in isabelle style files; \isabellestyle{it}
7119 produces fake math mode output; \isamarkupheader is now \section by
7120 default; see lib/texinputs/isabelle.sty etc.;
7125 * Isar/Pure: local results and corresponding term bindings are now
7126 subject to Hindley-Milner polymorphism (similar to ML); this
7127 accommodates incremental type-inference very nicely;
7129 * Isar/Pure: new derived language element 'obtain' supports
7130 generalized existence reasoning;
7132 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
7133 support accumulation of results, without applying any rules yet;
7134 useful to collect intermediate results without explicit name
7135 references, and for use with transitivity rules with more than 2
7138 * Isar/Pure: scalable support for case-analysis type proofs: new
7139 'case' language element refers to local contexts symbolically, as
7140 produced by certain proof methods; internally, case names are attached
7141 to theorems as "tags";
7143 * Isar/Pure: theory command 'hide' removes declarations from
7144 class/type/const name spaces;
7146 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
7147 indicate potential overloading;
7149 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
7151 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
7152 "{a,b,c}" instead of {a,b,c};
7154 * Isar/Pure now provides its own version of intro/elim/dest
7155 attributes; useful for building new logics, but beware of confusion
7156 with the version in Provers/classical;
7158 * Isar/Pure: the local context of (non-atomic) goals is provided via
7159 case name 'antecedent';
7161 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
7162 to the current context is now done automatically);
7164 * Isar/Pure: theory command 'method_setup' provides a simple interface
7165 for definining proof methods in ML;
7167 * Isar/Provers: intro/elim/dest attributes changed; renamed
7168 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
7169 most cases, one should have to change intro!! to intro? only);
7170 replaced "delrule" by "rule del";
7172 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
7173 'symmetric' attribute (the latter supercedes [RS sym]);
7175 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
7176 method modifier); 'simp' method: 'only:' modifier removes loopers as
7177 well (including splits);
7179 * Isar/Provers: Simplifier and Classical methods now support all kind
7180 of modifiers used in the past, including 'cong', 'iff', etc.
7182 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
7183 of Simplifier and Classical reasoner);
7185 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
7186 now support named cases; major packages (inductive, datatype, primrec,
7187 recdef) support case names and properly name parameters;
7189 * Isar/HOL: new transitivity rules for substitution in inequalities --
7190 monotonicity conditions are extracted to be proven at end of
7193 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
7196 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
7197 split_if split_if_asm; datatype package provides theorems foo.splits =
7198 foo.split foo.split_asm for each datatype;
7200 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
7201 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
7202 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
7203 use "(cases (simplified))" method in proper proof texts);
7205 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
7207 * Isar: names of theorems etc. may be natural numbers as well;
7209 * Isar: 'pr' command: optional arguments for goals_limit and
7210 ProofContext.prems_limit; no longer prints theory contexts, but only
7213 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
7214 additional print modes to be specified; e.g. "pr(latex)" will print
7215 proof state according to the Isabelle LaTeX style;
7217 * Isar: improved support for emulating tactic scripts, including proof
7218 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
7219 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
7220 (for HOL datatypes);
7222 * Isar: simplified (more robust) goal selection of proof methods: 1st
7223 goal, all goals, or explicit goal specifier (tactic emulation); thus
7224 'proof method scripts' have to be in depth-first order;
7226 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
7228 * Isar: removed 'help' command, which hasn't been too helpful anyway;
7229 should instead use individual commands for printing items
7230 (print_commands, print_methods etc.);
7232 * Isar: added 'nothing' --- the empty list of theorems;
7237 * HOL/MicroJava: formalization of a fragment of Java, together with a
7238 corresponding virtual machine and a specification of its bytecode
7239 verifier and a lightweight bytecode verifier, including proofs of
7240 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
7241 Cornelia Pusch (see also the homepage of project Bali at
7242 http://isabelle.in.tum.de/Bali/);
7244 * HOL/Algebra: new theory of rings and univariate polynomials, by
7247 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
7248 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
7251 * HOL/Lattice: fundamental concepts of lattice theory and order
7252 structures, including duals, properties of bounds versus algebraic
7253 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
7254 Theorem for complete lattices etc.; may also serve as a demonstration
7255 for abstract algebraic reasoning using axiomatic type classes, and
7256 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
7258 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
7261 * HOL/IMPP: extension of IMP with local variables and mutually
7262 recursive procedures, by David von Oheimb;
7264 * HOL/Lambda: converted into new-style theory and document;
7266 * HOL/ex/Multiquote: example of multiple nested quotations and
7267 anti-quotations -- basically a generalized version of de-Bruijn
7268 representation; very useful in avoiding lifting of operations;
7270 * HOL/record: added general record equality rule to simpset; fixed
7271 select-update simplification procedure to handle extended records as
7272 well; admit "r" as field name;
7274 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
7275 other numeric types and also as the identity of groups, rings, etc.;
7277 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
7278 Types nat and int belong to this axclass;
7280 * HOL: greatly improved simplification involving numerals of type nat, int, real:
7281 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
7282 i*j + k + j*#3*i simplifies to #4*(i*j) + k
7283 two terms #m*u and #n*u are replaced by #(m+n)*u
7284 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
7285 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
7286 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
7288 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
7289 powerful prover for predicate logic but knows nothing of clasets; see
7290 ex/mesontest.ML and ex/mesontest2.ML for example applications;
7292 * HOL: new version of "case_tac" subsumes both boolean case split and
7293 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
7294 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
7296 * HOL: simplification no longer dives into case-expressions: only the
7297 selector expression is simplified, but not the remaining arms; to
7298 enable full simplification of case-expressions for datatype t, you may
7299 remove t.weak_case_cong from the simpset, either globally (Delcongs
7300 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
7302 * HOL/recdef: the recursion equations generated by 'recdef' for
7303 function 'f' are now called f.simps instead of f.rules; if all
7304 termination conditions are proved automatically, these simplification
7305 rules are added to the simpset, as in primrec; rules may be named
7306 individually as well, resulting in a separate list of theorems for
7309 * HOL/While is a new theory that provides a while-combinator. It
7310 permits the definition of tail-recursive functions without the
7311 provision of a termination measure. The latter is necessary once the
7312 invariant proof rule for while is applied.
7314 * HOL: new (overloaded) notation for the set of elements below/above
7315 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
7317 * HOL: theorems impI, allI, ballI bound as "strip";
7319 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
7320 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
7321 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
7323 * HOL/Real: "rabs" replaced by overloaded "abs" function;
7325 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
7326 main HOL, but was unused);
7328 * HOL: fewer consts declared as global (e.g. have to refer to
7329 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
7331 * HOL: tuned AST representation of nested pairs, avoiding bogus output
7332 in case of overlap with user translations (e.g. judgements over
7333 tuples); (note that the underlying logical represenation is still
7339 * ZF: simplification automatically cancels common terms in arithmetic
7340 expressions over nat and int;
7342 * ZF: new treatment of nat to minimize type-checking: all operators
7343 coerce their operands to a natural number using the function natify,
7344 making the algebraic laws unconditional;
7346 * ZF: as above, for int: operators coerce their operands to an integer
7347 using the function intify;
7349 * ZF: the integer library now contains many of the usual laws for the
7350 orderings, including $<=, and monotonicity laws for $+ and $*;
7352 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
7355 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
7356 to the simplifier and classical reasoner simultaneously;
7361 * Provers: blast_tac now handles actual object-logic rules as
7362 assumptions; note that auto_tac uses blast_tac internally as well;
7364 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
7365 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
7367 * Provers: delrules now handles destruct rules as well (no longer need
7368 explicit make_elim);
7370 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
7371 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7372 use instead the strong form,
7373 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
7374 in HOL, FOL and ZF the function cla_make_elim will create such rules
7375 from destruct-rules;
7377 * Provers: Simplifier.easy_setup provides a fast path to basic
7378 Simplifier setup for new object-logics;
7380 * Pure: AST translation rules no longer require constant head on LHS;
7382 * Pure: improved name spaces: ambiguous output is qualified; support
7383 for hiding of names;
7385 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
7386 XSYMBOL_HOME; no longer need to do manual configuration in most
7389 * system: compression of ML heaps images may now be controlled via -c
7390 option of isabelle and isatool usedir (currently only observed by
7393 * system: isatool installfonts may handle X-Symbol fonts as well (very
7394 useful for remote X11);
7396 * system: provide TAGS file for Isabelle sources;
7398 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
7401 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
7402 timing flag supersedes proof_timing and Toplevel.trace;
7404 * ML: new combinators |>> and |>>> for incremental transformations
7405 with secondary results (e.g. certain theory extensions):
7407 * ML: PureThy.add_defs gets additional argument to indicate potential
7408 overloading (usually false);
7410 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
7415 New in Isabelle99 (October 1999)
7416 --------------------------------
7418 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7420 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
7421 are no longer simplified. (This allows the simplifier to unfold recursive
7422 functional programs.) To restore the old behaviour, declare
7424 Delcongs [if_weak_cong];
7426 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
7429 * HOL: the predicate "inj" is now defined by translation to "inj_on";
7431 * HOL/datatype: mutual_induct_tac no longer exists --
7432 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
7434 * HOL/typedef: fixed type inference for representing set; type
7435 arguments now have to occur explicitly on the rhs as type constraints;
7437 * ZF: The con_defs part of an inductive definition may no longer refer
7438 to constants declared in the same theory;
7440 * HOL, ZF: the function mk_cases, generated by the inductive
7441 definition package, has lost an argument. To simplify its result, it
7442 uses the default simpset instead of a supplied list of theorems.
7444 * HOL/List: the constructors of type list are now Nil and Cons;
7446 * Simplifier: the type of the infix ML functions
7447 setSSolver addSSolver setSolver addSolver
7448 is now simpset * solver -> simpset where `solver' is a new abstract type
7449 for packaging solvers. A solver is created via
7450 mk_solver: string -> (thm list -> int -> tactic) -> solver
7451 where the string argument is only a comment.
7456 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
7457 decision procedure for linear arithmetic. Currently it is used for
7458 types `nat', `int', and `real' in HOL (see below); it can, should and
7459 will be instantiated for other types and logics as well.
7461 * The simplifier now accepts rewrite rules with flexible heads, eg
7462 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
7463 They are applied like any rule with a non-pattern lhs, i.e. by first-order
7469 * New Isabelle/Isar subsystem provides an alternative to traditional
7470 tactical theorem proving; together with the ProofGeneral/isar user
7471 interface it offers an interactive environment for developing human
7472 readable proof documents (Isar == Intelligible semi-automated
7473 reasoning); for further information see isatool doc isar-ref,
7474 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
7476 * improved and simplified presentation of theories: better HTML markup
7477 (including colors), graph views in several sizes; isatool usedir now
7478 provides a proper interface for user theories (via -P option); actual
7479 document preparation based on (PDF)LaTeX is available as well (for
7480 new-style theories only); see isatool doc system for more information;
7482 * native support for Proof General, both for classic Isabelle and
7485 * ML function thm_deps visualizes dependencies of theorems and lemmas,
7486 using the graph browser tool;
7488 * Isabelle manuals now also available as PDF;
7490 * theory loader rewritten from scratch (may not be fully
7491 bug-compatible); old loadpath variable has been replaced by show_path,
7492 add_path, del_path, reset_path functions; new operations such as
7493 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
7496 * improved isatool install: option -k creates KDE application icon,
7497 option -p DIR installs standalone binaries;
7499 * added ML_PLATFORM setting (useful for cross-platform installations);
7500 more robust handling of platform specific ML images for SML/NJ;
7502 * the settings environment is now statically scoped, i.e. it is never
7503 created again in sub-processes invoked from isabelle, isatool, or
7506 * path element specification '~~' refers to '$ISABELLE_HOME';
7508 * in locales, the "assumes" and "defines" parts may be omitted if
7511 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
7514 * new print_mode "HTML";
7516 * new flag show_tags controls display of tags of theorems (which are
7517 basically just comments that may be attached by some tools);
7519 * Isamode 2.6 requires patch to accomodate change of Isabelle font
7520 mode and goal output format:
7522 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
7524 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
7526 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
7527 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
7529 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
7531 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
7533 * function bind_thms stores lists of theorems (cf. bind_thm);
7535 * new shorthand tactics ftac, eatac, datac, fatac;
7537 * qed (and friends) now accept "" as result name; in that case the
7538 theorem is not stored, but proper checks and presentation of the
7541 * theorem database now also indexes constants "Trueprop", "all",
7542 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
7547 ** HOL arithmetic **
7549 * There are now decision procedures for linear arithmetic over nat and
7552 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
7553 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
7554 are treated as atomic; subformulae not involving type `nat' or `int'
7555 are ignored; quantified subformulae are ignored unless they are
7556 positive universal or negative existential. The tactic has to be
7557 invoked by hand and can be a little bit slow. In particular, the
7558 running time is exponential in the number of occurrences of `min' and
7559 `max', and `-' on `nat'.
7561 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
7562 (negated) (in)equalities among the premises and the conclusion into
7563 account (i.e. no compound formulae) and does not know about `min' and
7564 `max', and `-' on `nat'. It is fast and is used automatically by the
7567 NB: At the moment, these decision procedures do not cope with mixed
7568 nat/int formulae where the two parts interact, such as `m < n ==>
7571 * HOL/Numeral provides a generic theory of numerals (encoded
7572 efficiently as bit strings); setup for types nat/int/real is in place;
7573 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
7574 int, existing theories and proof scripts may require a few additional
7577 * integer division and remainder can now be performed on constant
7580 * many properties of integer multiplication, division and remainder
7583 * An interface to the Stanford Validity Checker (SVC) is available through the
7584 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
7585 are proved automatically. SVC must be installed separately, and its results
7586 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
7587 invocation of the underlying oracle). For SVC see
7588 http://verify.stanford.edu/SVC
7590 * IsaMakefile: the HOL-Real target now builds an actual image;
7595 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
7596 (in Isabelle/Isar) -- by Gertrud Bauer;
7598 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
7599 analysis for assembly languages with subtypes;
7601 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
7602 -- avoids syntactic ambiguities and treats state, transition, and
7603 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
7604 changed syntax and (many) tactics;
7606 * HOL/inductive: Now also handles more general introduction rules such
7607 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
7608 theorems are now maintained within the theory (maintained via the
7611 * HOL/datatype: Now also handles arbitrarily branching datatypes
7612 (using function types) such as
7614 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
7616 * HOL/record: record_simproc (part of the default simpset) takes care
7617 of selectors applied to updated records; record_split_tac is no longer
7618 part of the default claset; update_defs may now be removed from the
7619 simpset in many cases; COMPATIBILITY: old behavior achieved by
7621 claset_ref () := claset() addSWrapper record_split_wrapper;
7622 Delsimprocs [record_simproc]
7624 * HOL/typedef: fixed type inference for representing set; type
7625 arguments now have to occur explicitly on the rhs as type constraints;
7627 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
7628 names rather than an ML expression;
7630 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
7631 supplied later. Program schemes can be defined, such as
7632 "While B C s = (if B s then While B C (C s) else s)"
7633 where the well-founded relation can be chosen after B and C have been given.
7635 * HOL/List: the constructors of type list are now Nil and Cons;
7636 INCOMPATIBILITY: while [] and infix # syntax is still there, of
7637 course, ML tools referring to List.list.op # etc. have to be adapted;
7639 * HOL_quantifiers flag superseded by "HOL" print mode, which is
7640 disabled by default; run isabelle with option -m HOL to get back to
7641 the original Gordon/HOL-style output;
7643 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
7644 ALL x<=y. P, EX x<y. P, EX x<=y. P;
7646 * HOL basic syntax simplified (more orthogonal): all variants of
7647 All/Ex now support plain / symbolic / HOL notation; plain syntax for
7648 Eps operator is provided as well: "SOME x. P[x]";
7650 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
7652 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
7653 thus available for user theories;
7655 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
7656 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
7659 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
7660 several times and then mp;
7665 * the notation <<...>> is now available as a notation for sequences of
7668 * the simplifier is now installed
7670 * the axiom system has been generalized (thanks to Soren Heilmann)
7672 * the classical reasoner now has a default rule database
7677 * new primrec section allows primitive recursive functions to be given
7678 directly (as in HOL) over datatypes and the natural numbers;
7680 * new tactics induct_tac and exhaust_tac for induction (or case
7681 analysis) over datatypes and the natural numbers;
7683 * the datatype declaration of type T now defines the recursor T_rec;
7685 * simplification automatically does freeness reasoning for datatype
7688 * automatic type-inference, with AddTCs command to insert new
7689 type-checking rules;
7691 * datatype introduction rules are now added as Safe Introduction rules
7694 * the syntax "if P then x else y" is now available in addition to
7698 *** Internal programming interfaces ***
7700 * tuned simplifier trace output; new flag debug_simp;
7702 * structures Vartab / Termtab (instances of TableFun) offer efficient
7703 tables indexed by indexname_ord / term_ord (compatible with aconv);
7705 * AxClass.axclass_tac lost the theory argument;
7707 * tuned current_goals_markers semantics: begin / end goal avoids
7708 printing empty lines;
7710 * removed prs and prs_fn hook, which was broken because it did not
7711 include \n in its semantics, forcing writeln to add one
7712 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
7713 string -> unit if you really want to output text without newline;
7715 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
7716 plain output, interface builders may have to enable 'isabelle_font'
7717 mode to get Isabelle font glyphs as before;
7719 * refined token_translation interface; INCOMPATIBILITY: output length
7720 now of type real instead of int;
7722 * theory loader actions may be traced via new ThyInfo.add_hook
7723 interface (see src/Pure/Thy/thy_info.ML); example application: keep
7724 your own database of information attached to *whole* theories -- as
7725 opposed to intra-theory data slots offered via TheoryDataFun;
7727 * proper handling of dangling sort hypotheses (at last!);
7728 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
7729 extra sort hypotheses that can be witnessed from the type signature;
7730 the force_strip_shyps flag is gone, any remaining shyps are simply
7731 left in the theorem (with a warning issued by strip_shyps_warning);
7735 New in Isabelle98-1 (October 1998)
7736 ----------------------------------
7738 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7740 * several changes of automated proof tools;
7742 * HOL: major changes to the inductive and datatype packages, including
7743 some minor incompatibilities of theory syntax;
7745 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
7748 * HOL: removed duplicate thms in Arith:
7749 less_imp_add_less should be replaced by trans_less_add1
7750 le_imp_add_le should be replaced by trans_le_add1
7752 * HOL: unary minus is now overloaded (new type constraints may be
7755 * HOL and ZF: unary minus for integers is now #- instead of #~. In
7756 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
7757 now taken as an integer constant.
7759 * Pure: ML function 'theory_of' renamed to 'theory';
7765 1. Asm_full_simp_tac is now more aggressive.
7766 1. It will sometimes reorient premises if that increases their power to
7768 2. It does no longer proceed strictly from left to right but may also
7769 rotate premises to achieve further simplification.
7770 For compatibility reasons there is now Asm_lr_simp_tac which is like the
7771 old Asm_full_simp_tac in that it does not rotate premises.
7772 2. The simplifier now knows a little bit about nat-arithmetic.
7774 * Classical reasoner: wrapper mechanism for the classical reasoner now
7775 allows for selected deletion of wrappers, by introduction of names for
7776 wrapper functionals. This implies that addbefore, addSbefore,
7777 addaltern, and addSaltern now take a pair (name, tactic) as argument,
7778 and that adding two tactics with the same name overwrites the first
7779 one (emitting a warning).
7780 type wrapper = (int -> tactic) -> (int -> tactic)
7781 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
7782 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
7783 delWrapper, delSWrapper: claset * string -> claset
7784 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
7786 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
7787 semantics; addbefore now affects only the unsafe part of step_tac
7788 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
7789 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
7792 * Classical reasoner: setwrapper to setWrapper and compwrapper to
7793 compWrapper; added safe wrapper (and access functions for it);
7795 * HOL/split_all_tac is now much faster and fails if there is nothing
7796 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
7797 and the names of the automatically generated variables have changed.
7798 split_all_tac has moved within claset() from unsafe wrappers to safe
7799 wrappers, which means that !!-bound variables are split much more
7800 aggressively, and safe_tac and clarify_tac now split such variables.
7801 If this splitting is not appropriate, use delSWrapper "split_all_tac".
7802 Note: the same holds for record_split_tac, which does the job of
7803 split_all_tac for record fields.
7805 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
7806 permanently to the default simpset using Addsplits just like
7807 Addsimps. They can be removed via Delsplits just like
7808 Delsimps. Lower-case versions are also available.
7810 * HOL/Simplifier: The rule split_if is now part of the default
7811 simpset. This means that the simplifier will eliminate all occurrences
7812 of if-then-else in the conclusion of a goal. To prevent this, you can
7813 either remove split_if completely from the default simpset by
7814 `Delsplits [split_if]' or remove it in a specific call of the
7815 simplifier using `... delsplits [split_if]'. You can also add/delete
7816 other case splitting rules to/from the default simpset: every datatype
7817 generates suitable rules `split_t_case' and `split_t_case_asm' (where
7818 t is the name of the datatype).
7820 * Classical reasoner / Simplifier combination: new force_tac (and
7821 derivatives Force_tac, force) combines rewriting and classical
7822 reasoning (and whatever other tools) similarly to auto_tac, but is
7823 aimed to solve the given subgoal completely.
7828 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
7829 and `goalw': the theory is no longer needed as an explicit argument -
7830 the current theory context is used; assumptions are no longer returned
7831 at the ML-level unless one of them starts with ==> or !!; it is
7832 recommended to convert to these new commands using isatool fixgoal
7833 (backup your sources first!);
7835 * new top-level commands 'thm' and 'thms' for retrieving theorems from
7836 the current theory context, and 'theory' to lookup stored theories;
7838 * new theory section 'locale' for declaring constants, assumptions and
7839 definitions that have local scope;
7841 * new theory section 'nonterminals' for purely syntactic types;
7843 * new theory section 'setup' for generic ML setup functions
7844 (e.g. package initialization);
7846 * the distribution now includes Isabelle icons: see
7847 lib/logo/isabelle-{small,tiny}.xpm;
7849 * isatool install - install binaries with absolute references to
7852 * isatool logo -- create instances of the Isabelle logo (as EPS);
7854 * print mode 'emacs' reserved for Isamode;
7856 * support multiple print (ast) translations per constant name;
7858 * theorems involving oracles are now printed with a suffixed [!];
7863 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
7865 * HOL/inductive package reorganized and improved: now supports mutual
7871 oddI "n : EVEN ==> Suc n : ODD"
7872 evenI "n : ODD ==> Suc n : EVEN"
7874 new theorem list "elims" contains an elimination rule for each of the
7875 recursive sets; inductive definitions now handle disjunctive premises
7876 correctly (also ZF);
7878 INCOMPATIBILITIES: requires Inductive as an ancestor; component
7879 "mutual_induct" no longer exists - the induction rule is always
7880 contained in "induct";
7883 * HOL/datatype package re-implemented and greatly improved: now
7884 supports mutually recursive datatypes such as
7887 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
7888 | SUM ('a aexp) ('a aexp)
7889 | DIFF ('a aexp) ('a aexp)
7892 'a bexp = LESS ('a aexp) ('a aexp)
7893 | AND ('a bexp) ('a bexp)
7894 | OR ('a bexp) ('a bexp)
7896 as well as indirectly recursive datatypes such as
7899 ('a, 'b) term = Var 'a
7900 | App 'b ((('a, 'b) term) list)
7902 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
7903 induction on mutually / indirectly recursive datatypes.
7905 Primrec equations are now stored in theory and can be accessed via
7906 <function_name>.simps.
7910 - Theories using datatypes must now have theory Datatype as an
7912 - The specific <typename>.induct_tac no longer exists - use the
7913 generic induct_tac instead.
7914 - natE has been renamed to nat.exhaust - use exhaust_tac
7915 instead of res_inst_tac ... natE. Note that the variable
7916 names in nat.exhaust differ from the names in natE, this
7917 may cause some "fragile" proofs to fail.
7918 - The theorems split_<typename>_case and split_<typename>_case_asm
7919 have been renamed to <typename>.split and <typename>.split_asm.
7920 - Since default sorts of type variables are now handled correctly,
7921 some datatype definitions may have to be annotated with explicit
7923 - Primrec definitions no longer require function name and type
7924 of recursive argument.
7926 Consider using isatool fixdatatype to adapt your theories and proof
7927 scripts to the new package (backup your sources first!).
7930 * HOL/record package: considerably improved implementation; now
7931 includes concrete syntax for record types, terms, updates; theorems
7932 for surjective pairing and splitting !!-bound record variables; proof
7933 support is as follows:
7935 1) standard conversions (selectors or updates applied to record
7936 constructor terms) are part of the standard simpset;
7938 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
7939 made part of standard simpset and claset via addIffs;
7941 3) a tactic for record field splitting (record_split_tac) is part of
7942 the standard claset (addSWrapper);
7944 To get a better idea about these rules you may retrieve them via
7945 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
7946 the name of your record type.
7948 The split tactic 3) conceptually simplifies by the following rule:
7950 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
7952 Thus any record variable that is bound by meta-all will automatically
7953 blow up into some record constructor term, consequently the
7954 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
7955 solve record problems automatically.
7958 * reorganized the main HOL image: HOL/Integ and String loaded by
7959 default; theory Main includes everything;
7961 * automatic simplification of integer sums and comparisons, using cancellation;
7963 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
7965 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
7967 * many new identities for unions, intersections, set difference, etc.;
7969 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
7970 called split_if, split_split, split_sum_case and split_nat_case (to go
7971 with add/delsplits);
7973 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
7974 (?x::unit) = (); this is made part of the default simpset, which COULD
7975 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
7976 'Delsimprocs [unit_eq_proc];' as last resort); also note that
7977 unit_abs_eta_conv is added in order to counter the effect of
7978 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
7981 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
7984 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
7985 It and 'sym RS equals0D' are now in the default claset, giving automatic
7986 disjointness reasoning but breaking a few old proofs.
7988 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
7989 to 'converse' from 'inverse' (for compatibility with ZF and some
7992 * HOL/recdef can now declare non-recursive functions, with {} supplied as
7993 the well-founded relation;
7995 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
7996 Compl A. The "Compl" syntax remains available as input syntax for this
7999 * HOL/Update: new theory of function updates:
8000 f(a:=b) == %x. if x=a then b else f x
8001 may also be iterated as in f(a:=b,c:=d,...);
8003 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
8006 - new function list_update written xs[i:=v] that updates the i-th
8007 list position. May also be iterated as in xs[i:=a,j:=b,...].
8008 - new function `upt' written [i..j(] which generates the list
8009 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
8010 bound write [i..j], which is a shorthand for [i..j+1(].
8011 - new lexicographic orderings and corresponding wellfoundedness theorems.
8014 - removed 'pred' (predecessor) function;
8015 - generalized some theorems about n-1;
8016 - many new laws about "div" and "mod";
8017 - new laws about greatest common divisors (see theory ex/Primes);
8019 * HOL/Relation: renamed the relational operator r^-1 "converse"
8020 instead of "inverse";
8022 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
8023 of the multiset ordering;
8025 * directory HOL/Real: a construction of the reals using Dedekind cuts
8026 (not included by default);
8028 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
8030 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
8031 programs, i.e. different program variables may have different types.
8033 * calling (stac rew i) now fails if "rew" has no effect on the goal
8034 [previously, this check worked only if the rewrite rule was unconditional]
8035 Now rew can involve either definitions or equalities (either == or =).
8040 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
8041 only the theorems proved on ZF.ML;
8043 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
8044 It and 'sym RS equals0D' are now in the default claset, giving automatic
8045 disjointness reasoning but breaking a few old proofs.
8047 * ZF/Update: new theory of function updates
8048 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
8049 may also be iterated as in f(a:=b,c:=d,...);
8051 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
8053 * calling (stac rew i) now fails if "rew" has no effect on the goal
8054 [previously, this check worked only if the rewrite rule was unconditional]
8055 Now rew can involve either definitions or equalities (either == or =).
8057 * case_tac provided for compatibility with HOL
8058 (like the old excluded_middle_tac, but with subgoals swapped)
8061 *** Internal programming interfaces ***
8063 * Pure: several new basic modules made available for general use, see
8064 also src/Pure/README;
8066 * improved the theory data mechanism to support encapsulation (data
8067 kind name replaced by private Object.kind, acting as authorization
8068 key); new type-safe user interface via functor TheoryDataFun; generic
8069 print_data function becomes basically useless;
8071 * removed global_names compatibility flag -- all theory declarations
8072 are qualified by default;
8074 * module Pure/Syntax now offers quote / antiquote translation
8075 functions (useful for Hoare logic etc. with implicit dependencies);
8076 see HOL/ex/Antiquote for an example use;
8078 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
8081 * new tactical CHANGED_GOAL for checking that a tactic modifies a
8084 * Display.print_goals function moved to Locale.print_goals;
8086 * standard print function for goals supports current_goals_markers
8087 variable for marking begin of proof, end of proof, start of goal; the
8088 default is ("", "", ""); setting current_goals_markers := ("<proof>",
8089 "</proof>", "<goal>") causes SGML like tagged proof state printing,
8094 New in Isabelle98 (January 1998)
8095 --------------------------------
8097 *** Overview of INCOMPATIBILITIES (see below for more details) ***
8099 * changed lexical syntax of terms / types: dots made part of long
8100 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
8102 * simpset (and claset) reference variable replaced by functions
8103 simpset / simpset_ref;
8105 * no longer supports theory aliases (via merge) and non-trivial
8106 implicit merge of thms' signatures;
8108 * most internal names of constants changed due to qualified names;
8110 * changed Pure/Sequence interface (see Pure/seq.ML);
8113 *** General Changes ***
8115 * hierachically structured name spaces (for consts, types, axms, thms
8116 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
8117 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
8118 isatool fixdots ensures space after dots (e.g. "%x. x"); set
8119 long_names for fully qualified output names; NOTE: ML programs
8120 (special tactics, packages etc.) referring to internal names may have
8121 to be adapted to cope with fully qualified names; in case of severe
8122 backward campatibility problems try setting 'global_names' at compile
8123 time to have enrything declared within a flat name space; one may also
8124 fine tune name declarations in theories via the 'global' and 'local'
8127 * reimplemented the implicit simpset and claset using the new anytype
8128 data filed in signatures; references simpset:simpset ref etc. are
8129 replaced by functions simpset:unit->simpset and
8130 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
8131 to patch your ML files accordingly;
8133 * HTML output now includes theory graph data for display with Java
8134 applet or isatool browser; data generated automatically via isatool
8135 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
8137 * defs may now be conditional; improved rewrite_goals_tac to handle
8138 conditional equations;
8140 * defs now admits additional type arguments, using TYPE('a) syntax;
8142 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
8143 creates a new theory node; implicit merge of thms' signatures is
8144 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
8145 transfer:theory->thm->thm in (rare) cases;
8147 * improved handling of draft signatures / theories; draft thms (and
8148 ctyps, cterms) are automatically promoted to real ones;
8150 * slightly changed interfaces for oracles: admit many per theory, named
8151 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
8153 * print_goals: optional output of const types (set show_consts and
8156 * improved output of warnings (###) and errors (***);
8158 * subgoal_tac displays a warning if the new subgoal has type variables;
8160 * removed old README and Makefiles;
8162 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
8164 * removed obsolete init_pps and init_database;
8166 * deleted the obsolete tactical STATE, which was declared by
8167 fun STATE tacfun st = tacfun st st;
8169 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
8170 (which abbreviates $HOME);
8172 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
8173 use isatool fixseq to adapt your ML programs (this works for fully
8174 qualified references to the Sequence structure only!);
8176 * use_thy no longer requires writable current directory; it always
8177 reloads .ML *and* .thy file, if either one is out of date;
8180 *** Classical Reasoner ***
8182 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
8183 tactics that use classical reasoning to simplify a subgoal without
8184 splitting it into several subgoals;
8186 * Safe_tac: like safe_tac but uses the default claset;
8191 * added simplification meta rules:
8192 (asm_)(full_)simplify: simpset -> thm -> thm;
8194 * simplifier.ML no longer part of Pure -- has to be loaded by object
8197 * added prems argument to simplification procedures;
8199 * HOL, FOL, ZF: added infix function `addsplits':
8200 instead of `<simpset> setloop (split_tac <thms>)'
8201 you can simply write `<simpset> addsplits <thms>'
8206 * TYPE('a) syntax for type reflection terms;
8208 * no longer handles consts with name "" -- declare as 'syntax' instead;
8210 * pretty printer: changed order of mixfix annotation preference (again!);
8212 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
8217 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
8218 with `addloop' of the simplifier to faciliate case splitting in premises.
8220 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
8222 * HOL/Auth: new protocol proofs including some for the Internet
8225 * HOL/Map: new theory of `maps' a la VDM;
8227 * HOL/simplifier: simplification procedures nat_cancel_sums for
8228 cancelling out common nat summands from =, <, <= (in)equalities, or
8229 differences; simplification procedures nat_cancel_factor for
8230 cancelling common factor from =, <, <= (in)equalities over natural
8231 sums; nat_cancel contains both kinds of procedures, it is installed by
8232 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
8234 * HOL/simplifier: terms of the form
8235 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
8237 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
8238 and those of the form
8239 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
8241 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
8244 Each datatype `t' now comes with a theorem `split_t_case' of the form
8246 P(t_case f1 ... fn x) =
8247 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
8249 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
8252 and a theorem `split_t_case_asm' of the form
8254 P(t_case f1 ... fn x) =
8255 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
8257 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
8259 which can be added to a simpset via `addsplits'. The existing theorems
8260 expand_list_case and expand_option_case have been renamed to
8261 split_list_case and split_option_case.
8264 - `pred n' is automatically converted to `n-1'.
8265 Users are strongly encouraged not to use `pred' any longer,
8266 because it will disappear altogether at some point.
8267 - Users are strongly encouraged to write "0 < n" rather than
8268 "n ~= 0". Theorems and proof tools have been modified towards this
8272 the function "set_of_list" has been renamed "set" (and its theorems too);
8273 the function "nth" now takes its arguments in the reverse order and
8274 has acquired the infix notation "!" as in "xs!n".
8276 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
8278 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
8279 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
8281 * HOL/record: extensible records with schematic structural subtyping
8282 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
8283 still lacks various theorems and concrete record syntax;
8288 * removed "axioms" and "generated by" sections;
8290 * replaced "ops" section by extended "consts" section, which is capable of
8291 handling the continuous function space "->" directly;
8294 . proves theorems immediately and stores them in the theory,
8295 . creates hierachical name space,
8296 . now uses normal mixfix annotations (instead of cinfix...),
8297 . minor changes to some names and values (for consistency),
8298 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
8299 . separator between mutual domain defs: changed "," to "and",
8300 . improved handling of sort constraints; now they have to
8301 appear on the left-hand side of the equations only;
8303 * fixed LAM <x,y,zs>.b syntax;
8305 * added extended adm_tac to simplifier in HOLCF -- can now discharge
8306 adm (%x. P (t x)), where P is chainfinite and t continuous;
8311 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
8312 with `addloop' of the simplifier to faciliate case splitting in premises.
8314 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
8315 in HOL, they strip ALL and --> from proved theorems;
8319 New in Isabelle94-8 (May 1997)
8320 ------------------------------
8322 *** General Changes ***
8324 * new utilities to build / run / maintain Isabelle etc. (in parts
8325 still somewhat experimental); old Makefiles etc. still functional;
8327 * new 'Isabelle System Manual';
8329 * INSTALL text, together with ./configure and ./build scripts;
8331 * reimplemented type inference for greater efficiency, better error
8332 messages and clean internal interface;
8334 * prlim command for dealing with lots of subgoals (an easier way of
8335 setting goals_limit);
8340 * supports alternative (named) syntax tables (parser and pretty
8341 printer); internal interface is provided by add_modesyntax(_i);
8343 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
8344 be used in conjunction with the Isabelle symbol font; uses the
8345 "symbols" syntax table;
8347 * added token_translation interface (may translate name tokens in
8348 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
8349 the current print_mode); IMPORTANT: user print translation functions
8350 are responsible for marking newly introduced bounds
8351 (Syntax.mark_boundT);
8353 * token translations for modes "xterm" and "xterm_color" that display
8354 names in bold, underline etc. or colors (which requires a color
8357 * infixes may now be declared with names independent of their syntax;
8359 * added typed_print_translation (like print_translation, but may
8360 access type of constant);
8363 *** Classical Reasoner ***
8365 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
8366 some limitations. Blast_tac...
8367 + ignores addss, addbefore, addafter; this restriction is intrinsic
8368 + ignores elimination rules that don't have the correct format
8369 (the conclusion MUST be a formula variable)
8370 + ignores types, which can make HOL proofs fail
8371 + rules must not require higher-order unification, e.g. apply_type in ZF
8372 [message "Function Var's argument not a bound variable" relates to this]
8373 + its proof strategy is more general but can actually be slower
8375 * substitution with equality assumptions no longer permutes other
8378 * minor changes in semantics of addafter (now called addaltern); renamed
8379 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
8380 (and access functions for it);
8382 * improved combination of classical reasoner and simplifier:
8383 + functions for handling clasimpsets
8384 + improvement of addss: now the simplifier is called _after_ the
8386 + safe variant of addss called addSss: uses safe simplifications
8387 _during_ the safe steps. It is more complete as it allows multiple
8388 instantiations of unknowns (e.g. with slow_tac).
8392 * added interface for simplification procedures (functions that
8393 produce *proven* rewrite rules on the fly, depending on current
8396 * ordering on terms as parameter (used for ordered rewriting);
8398 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
8400 * the solver is now split into a safe and an unsafe part.
8401 This should be invisible for the normal user, except that the
8402 functions setsolver and addsolver have been renamed to setSolver and
8403 addSolver; added safe_asm_full_simp_tac;
8408 * a generic induction tactic `induct_tac' which works for all datatypes and
8409 also for type `nat';
8411 * a generic case distinction tactic `exhaust_tac' which works for all
8412 datatypes and also for type `nat';
8414 * each datatype comes with a function `size';
8416 * patterns in case expressions allow tuple patterns as arguments to
8417 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
8419 * primrec now also works with type nat;
8421 * recdef: a new declaration form, allows general recursive functions to be
8422 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
8424 * the constant for negation has been renamed from "not" to "Not" to
8425 harmonize with FOL, ZF, LK, etc.;
8427 * HOL/ex/LFilter theory of a corecursive "filter" functional for
8430 * HOL/Modelcheck demonstrates invocation of model checker oracle;
8432 * HOL/ex/Ring.thy declares cring_simp, which solves equational
8433 problems in commutative rings, using axiomatic type classes for + and *;
8435 * more examples in HOL/MiniML and HOL/Auth;
8437 * more default rewrite rules for quantifiers, union/intersection;
8439 * a new constant `arbitrary == @x.False';
8441 * HOLCF/IOA replaces old HOL/IOA;
8443 * HOLCF changes: derived all rules and arities
8444 + axiomatic type classes instead of classes
8445 + typedef instead of faking type definitions
8446 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
8447 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
8448 + eliminated the types void, one, tr
8449 + use unit lift and bool lift (with translations) instead of one and tr
8450 + eliminated blift from Lift3.thy (use Def instead of blift)
8451 all eliminated rules are derived as theorems --> no visible changes ;
8456 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
8457 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
8458 as ZF_cs addSIs [equalityI];
8462 New in Isabelle94-7 (November 96)
8463 ---------------------------------
8465 * allowing negative levels (as offsets) in prlev and choplev;
8467 * super-linear speedup for large simplifications;
8469 * FOL, ZF and HOL now use miniscoping: rewriting pushes
8470 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
8471 FAIL); can suppress it using the command Delsimps (ex_simps @
8472 all_simps); De Morgan laws are also now included, by default;
8474 * improved printing of ==> : ~:
8476 * new object-logic "Sequents" adds linear logic, while replacing LK
8477 and Modal (thanks to Sara Kalvala);
8479 * HOL/Auth: correctness proofs for authentication protocols;
8481 * HOL: new auto_tac combines rewriting and classical reasoning (many
8482 examples on HOL/Auth);
8484 * HOL: new command AddIffs for declaring theorems of the form P=Q to
8485 the rewriter and classical reasoner simultaneously;
8487 * function uresult no longer returns theorems in "standard" format;
8488 regain previous version by: val uresult = standard o uresult;
8495 * oracles -- these establish an interface between Isabelle and trusted
8496 external reasoners, which may deliver results as theorems;
8498 * proof objects (in particular record all uses of oracles);
8500 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
8502 * "constdefs" section in theory files;
8504 * "primrec" section (HOL) no longer requires names;
8506 * internal type "tactic" now simply "thm -> thm Sequence.seq";
8513 * reduced space requirements;
8515 * automatic HTML generation from theories;
8517 * theory files no longer require "..." (quotes) around most types;
8519 * new examples, including two proofs of the Church-Rosser theorem;
8521 * non-curried (1994) version of HOL is no longer distributed;
8528 * greatly reduced space requirements;
8530 * theory files (.thy) no longer require \...\ escapes at line breaks;
8532 * searchable theorem database (see the section "Retrieving theorems" on
8533 page 8 of the Reference Manual);
8535 * new examples, including Grabczewski's monumental case study of the
8538 * The previous version of HOL renamed to Old_HOL;
8540 * The new version of HOL (previously called CHOL) uses a curried syntax
8541 for functions. Application looks like f a b instead of f(a,b);
8543 * Mutually recursive inductive definitions finally work in HOL;
8545 * In ZF, pattern-matching on tuples is now available in all abstractions and
8546 translates to the operator "split";
8553 * new infix operator, addss, allowing the classical reasoner to
8554 perform simplification at each step of its search. Example:
8555 fast_tac (cs addss ss)
8557 * a new logic, CHOL, the same as HOL, but with a curried syntax
8558 for functions. Application looks like f a b instead of f(a,b). Also pairs
8559 look like (a,b) instead of <a,b>;
8561 * PLEASE NOTE: CHOL will eventually replace HOL!
8563 * In CHOL, pattern-matching on tuples is now available in all abstractions.
8564 It translates to the operator "split". A new theory of integers is available;
8566 * In ZF, integer numerals now denote two's-complement binary integers.
8567 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
8569 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
8570 of the Axiom of Choice;
8577 * Significantly faster resolution;
8579 * the different sections in a .thy file can now be mixed and repeated
8582 * Database of theorems for FOL, HOL and ZF. New
8583 commands including qed, qed_goal and bind_thm store theorems in the database.
8585 * Simple database queries: return a named theorem (get_thm) or all theorems of
8586 a given theory (thms_of), or find out what theory a theorem was proved in
8589 * Bugs fixed in the inductive definition and datatype packages;
8591 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
8592 and HOL_dup_cs obsolete;
8594 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
8597 * Simpler definition of function space in ZF;
8599 * new results about cardinal and ordinal arithmetic in ZF;
8601 * 'subtype' facility in HOL for introducing new types as subsets of existing
8604 :mode=text:wrap=hard:maxLineLen=72: