merged, resolving obvious conflicts in NEWS and src/Pure/System/isabelle_process.ML;
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
7 *** Prover IDE -- Isabelle/Scala/jEdit ***
9 * Auxiliary files ('ML_file' etc.) are managed by the Prover IDE.
10 Open text buffers take precedence over copies within the file-system.
15 * Qualified constant names Wellfounded.acc, Wellfounded.accp.
18 * Fact generalization and consolidation:
19 neq_one_mod_two, mod_2_not_eq_zero_eq_one_int ~> not_mod_2_eq_0_eq_1
22 * Purely algebraic definition of even. Fact generalization and consolidation:
23 nat_even_iff_2_dvd, int_even_iff_2_dvd ~> even_iff_2_dvd
24 even_zero_(nat|int) ~> even_zero
27 * Abolished neg_numeral.
28 * Canonical representation for minus one is "- 1".
29 * Canonical representation for other negative numbers is "- (numeral _)".
30 * When devising rule sets for number calculation, consider the
31 following canonical cases: 0, 1, numeral _, - 1, - numeral _.
32 * HOLogic.dest_number also recognizes numerals in non-canonical forms
33 like "numeral One", "- numeral One", "- 0" and even "- … - _".
34 * Syntax for negative numerals is mere input syntax.
37 * Elimination of fact duplicates:
38 equals_zero_I ~> minus_unique
39 diff_eq_0_iff_eq ~> right_minus_eq
40 nat_infinite ~> infinite_UNIV_nat
41 int_infinite ~> infinite_UNIV_int
44 * Fact name consolidation:
45 diff_def, diff_minus, ab_diff_minus ~> diff_conv_add_uminus
46 minus_le_self_iff ~> neg_less_eq_nonneg
47 le_minus_self_iff ~> less_eq_neg_nonpos
48 neg_less_nonneg ~> neg_less_pos
49 less_minus_self_iff ~> less_neg_neg [simp]
52 * More simplification rules on unary and binary minus:
53 add_diff_cancel, add_diff_cancel_left, add_le_same_cancel1,
54 add_le_same_cancel2, add_less_same_cancel1, add_less_same_cancel2,
55 add_minus_cancel, diff_add_cancel, le_add_same_cancel1,
56 le_add_same_cancel2, less_add_same_cancel1, less_add_same_cancel2,
57 minus_add_cancel, uminus_add_conv_diff. These correspondingly
58 have been taken away from fact collections algebra_simps and
59 field_simps. INCOMPATIBILITY.
61 To restore proofs, the following patterns are helpful:
63 a) Arbitrary failing proof not involving "diff_def":
64 Consider simplification with algebra_simps or field_simps.
66 b) Lifting rules from addition to subtraction:
67 Try with "using <rule for addition> of [… "- _" …]" by simp".
69 c) Simplification with "diff_def": just drop "diff_def".
70 Consider simplification with algebra_simps or field_simps;
72 "simp add: diff_conv_add_uminus del: add_uminus_conv_diff".
74 * SUP and INF generalized to conditionally_complete_lattice
76 * Theory Lubs moved HOL image to HOL-Library. It is replaced by
77 Conditionally_Complete_Lattices. INCOMPATIBILITY.
79 * Introduce bdd_above and bdd_below in Conditionally_Complete_Lattices, use them
80 instead of explicitly stating boundedness of sets.
82 * ccpo.admissible quantifies only over non-empty chains to allow
83 more syntax-directed proof rules; the case of the empty chain
84 shows up as additional case in fixpoint induction proofs.
89 * Toplevel function "use" refers to raw ML bootstrap environment,
90 without Isar context nor antiquotations. Potential INCOMPATIBILITY.
91 Note that 'ML_file' is the canonical command to load ML files into the
96 New in Isabelle2013-2 (December 2013)
97 -------------------------------------
99 *** Prover IDE -- Isabelle/Scala/jEdit ***
101 * More robust editing of running commands with internal forks,
102 e.g. non-terminating 'by' steps.
104 * More relaxed Sledgehammer panel: avoid repeated application of query
105 after edits surrounding the command location.
107 * More status information about commands that are interrupted
108 accidentally (via physical event or Poly/ML runtime system signal,
114 * More robust termination of external processes managed by
115 Isabelle/ML: support cancellation of tasks within the range of
116 milliseconds, as required for PIDE document editing with automatically
117 tried tools (e.g. Sledgehammer).
119 * Reactivated Isabelle/Scala kill command for external processes on
120 Mac OS X, which was accidentally broken in Isabelle2013-1 due to a
121 workaround for some Debian/Ubuntu Linux versions from 2013.
125 New in Isabelle2013-1 (November 2013)
126 -------------------------------------
130 * Discontinued obsolete 'uses' within theory header. Note that
131 commands like 'ML_file' work without separate declaration of file
132 dependencies. Minor INCOMPATIBILITY.
134 * Discontinued redundant 'use' command, which was superseded by
135 'ML_file' in Isabelle2013. Minor INCOMPATIBILITY.
137 * Simplified subscripts within identifiers, using plain \<^sub>
138 instead of the second copy \<^isub> and \<^isup>. Superscripts are
139 only for literal tokens within notation; explicit mixfix annotations
140 for consts or fixed variables may be used as fall-back for unusual
141 names. Obsolete \<twosuperior> has been expanded to \<^sup>2 in
142 Isabelle/HOL. INCOMPATIBILITY, use "isabelle update_sub_sup" to
143 standardize symbols as a starting point for further manual cleanup.
144 The ML reference variable "legacy_isub_isup" may be set as temporary
145 workaround, to make the prover accept a subset of the old identifier
148 * Document antiquotations: term style "isub" has been renamed to
149 "sub". Minor INCOMPATIBILITY.
151 * Uniform management of "quick_and_dirty" as system option (see also
152 "isabelle options"), configuration option within the context (see also
153 Config.get in Isabelle/ML), and attribute in Isabelle/Isar. Minor
154 INCOMPATIBILITY, need to use more official Isabelle means to access
155 quick_and_dirty, instead of historical poking into mutable reference.
157 * Renamed command 'print_configs' to 'print_options'. Minor
160 * Proper diagnostic command 'print_state'. Old 'pr' (with its
161 implicit change of some global references) is retained for now as
162 control command, e.g. for ProofGeneral 3.7.x.
164 * Discontinued 'print_drafts' command with its old-fashioned PS output
165 and Unix command-line print spooling. Minor INCOMPATIBILITY: use
166 'display_drafts' instead and print via the regular document viewer.
168 * Updated and extended "isar-ref" and "implementation" manual,
169 eliminated old "ref" manual.
172 *** Prover IDE -- Isabelle/Scala/jEdit ***
174 * New manual "jedit" for Isabelle/jEdit, see isabelle doc or
177 * Dockable window "Documentation" provides access to Isabelle
180 * Dockable window "Find" provides query operations for formal entities
181 (GUI front-end to 'find_theorems' command).
183 * Dockable window "Sledgehammer" manages asynchronous / parallel
184 sledgehammer runs over existing document sources, independently of
185 normal editing and checking process.
187 * Dockable window "Timing" provides an overview of relevant command
188 timing information, depending on option jedit_timing_threshold. The
189 same timing information is shown in the extended tooltip of the
190 command keyword, when hovering the mouse over it while the CONTROL or
191 COMMAND modifier is pressed.
193 * Improved dockable window "Theories": Continuous checking of proof
194 document (visible and required parts) may be controlled explicitly,
195 using check box or shortcut "C+e ENTER". Individual theory nodes may
196 be marked explicitly as required and checked in full, using check box
197 or shortcut "C+e SPACE".
199 * Improved completion mechanism, which is now managed by the
200 Isabelle/jEdit plugin instead of SideKick. Refined table of Isabelle
201 symbol abbreviations (see $ISABELLE_HOME/etc/symbols).
203 * Standard jEdit keyboard shortcut C+b complete-word is remapped to
204 isabelle.complete for explicit completion in Isabelle sources.
205 INCOMPATIBILITY wrt. jEdit defaults, may have to invent new shortcuts
208 * Improved support of various "minor modes" for Isabelle NEWS,
209 options, session ROOT etc., with completion and SideKick tree view.
211 * Strictly monotonic document update, without premature cancellation of
212 running transactions that are still needed: avoid reset/restart of
213 such command executions while editing.
215 * Support for asynchronous print functions, as overlay to existing
218 * Support for automatic tools in HOL, which try to prove or disprove
219 toplevel theorem statements.
221 * Action isabelle.reset-font-size resets main text area font size
222 according to Isabelle/Scala plugin option "jedit_font_reset_size" (see
223 also "Plugin Options / Isabelle / General"). It can be bound to some
224 keyboard shortcut by the user (e.g. C+0 and/or C+NUMPAD0).
226 * File specifications in jEdit (e.g. file browser) may refer to
227 $ISABELLE_HOME and $ISABELLE_HOME_USER on all platforms. Discontinued
228 obsolete $ISABELLE_HOME_WINDOWS variable.
230 * Improved support for Linux look-and-feel "GTK+", see also "Utilities
231 / Global Options / Appearance".
233 * Improved support of native Mac OS X functionality via "MacOSX"
234 plugin, which is now enabled by default.
239 * Commands 'interpretation' and 'sublocale' are now target-sensitive.
240 In particular, 'interpretation' allows for non-persistent
241 interpretation within "context ... begin ... end" blocks offering a
242 light-weight alternative to 'sublocale'. See "isar-ref" manual for
245 * Improved locales diagnostic command 'print_dependencies'.
247 * Discontinued obsolete 'axioms' command, which has been marked as
248 legacy since Isabelle2009-2. INCOMPATIBILITY, use 'axiomatization'
249 instead, while observing its uniform scope for polymorphism.
251 * Discontinued empty name bindings in 'axiomatization'.
254 * System option "proofs" has been discontinued. Instead the global
255 state of Proofterm.proofs is persistently compiled into logic images
256 as required, notably HOL-Proofs. Users no longer need to change
257 Proofterm.proofs dynamically. Minor INCOMPATIBILITY.
259 * Syntax translation functions (print_translation etc.) always depend
260 on Proof.context. Discontinued former "(advanced)" option -- this is
261 now the default. Minor INCOMPATIBILITY.
263 * Former global reference trace_unify_fail is now available as
264 configuration option "unify_trace_failure" (global context only).
266 * SELECT_GOAL now retains the syntactic context of the overall goal
267 state (schematic variables etc.). Potential INCOMPATIBILITY in rare
273 * Stronger precedence of syntax for big intersection and union on
274 sets, in accordance with corresponding lattice operations.
277 * Notation "{p:A. P}" now allows tuple patterns as well.
279 * Nested case expressions are now translated in a separate check phase
280 rather than during parsing. The data for case combinators is separated
281 from the datatype package. The declaration attribute
282 "case_translation" can be used to register new case combinators:
284 declare [[case_translation case_combinator constructor1 ... constructorN]]
287 - 'code_printing' unifies 'code_const' / 'code_type' / 'code_class' /
289 - 'code_identifier' declares name hints for arbitrary identifiers in
290 generated code, subsuming 'code_modulename'.
292 See the isar-ref manual for syntax diagrams, and the HOL theories for
295 * Attibute 'code': 'code' now declares concrete and abstract code
296 equations uniformly. Use explicit 'code equation' and 'code abstract'
297 to distinguish both when desired.
299 * Discontinued theories Code_Integer and Efficient_Nat by a more
300 fine-grain stack of theories Code_Target_Int, Code_Binary_Nat,
301 Code_Target_Nat and Code_Target_Numeral. See the tutorial on code
302 generation for details. INCOMPATIBILITY.
304 * Numeric types are mapped by default to target language numerals:
305 natural (replaces former code_numeral) and integer (replaces former
306 code_int). Conversions are available as integer_of_natural /
307 natural_of_integer / integer_of_nat / nat_of_integer (in HOL) and
308 Code_Numeral.integer_of_natural / Code_Numeral.natural_of_integer (in
309 ML). INCOMPATIBILITY.
311 * Function package: For mutually recursive functions f and g, separate
312 cases rules f.cases and g.cases are generated instead of unusable
313 f_g.cases which exposed internal sum types. Potential INCOMPATIBILITY,
314 in the case that the unusable rule was used nevertheless.
316 * Function package: For each function f, new rules f.elims are
317 generated, which eliminate equalities of the form "f x = t".
319 * New command 'fun_cases' derives ad-hoc elimination rules for
320 function equations as simplified instances of f.elims, analogous to
321 inductive_cases. See ~~/src/HOL/ex/Fundefs.thy for some examples.
324 - parametrized correspondence relations are now supported:
325 + parametricity theorems for the raw term can be specified in
326 the command lift_definition, which allow us to generate stronger
328 + setup_lifting generates stronger transfer rules if parametric
329 correspondence relation can be generated
330 + various new properties of the relator must be specified to support
332 + parametricity theorem for the Quotient relation can be specified
333 - setup_lifting generates domain rules for the Transfer package
334 - stronger reflexivity prover of respectfulness theorems for type
336 - ===> and --> are now local. The symbols can be introduced
337 by interpreting the locale lifting_syntax (typically in an
339 - Lifting/Transfer relevant parts of Library/Quotient_* are now in
340 Main. Potential INCOMPATIBILITY
341 - new commands for restoring and deleting Lifting/Transfer context:
342 lifting_forget, lifting_update
343 - the command print_quotmaps was renamed to print_quot_maps.
347 - better support for domains in Transfer: replace Domainp T
348 by the actual invariant in a transferred goal
349 - transfer rules can have as assumptions other transfer rules
350 - Experimental support for transferring from the raw level to the
351 abstract level: Transfer.transferred attribute
352 - Attribute version of the transfer method: untransferred attribute
354 * Reification and reflection:
355 - Reification is now directly available in HOL-Main in structure
357 - Reflection now handles multiple lists with variables also.
358 - The whole reflection stack has been decomposed into conversions.
361 * Revised devices for recursive definitions over finite sets:
362 - Only one fundamental fold combinator on finite set remains:
363 Finite_Set.fold :: ('a => 'b => 'b) => 'b => 'a set => 'b
364 This is now identity on infinite sets.
365 - Locales ("mini packages") for fundamental definitions with
366 Finite_Set.fold: folding, folding_idem.
367 - Locales comm_monoid_set, semilattice_order_set and
368 semilattice_neutr_order_set for big operators on sets.
369 See theory Big_Operators for canonical examples.
370 Note that foundational constants comm_monoid_set.F and
371 semilattice_set.F correspond to former combinators fold_image
372 and fold1 respectively. These are now gone. You may use
373 those foundational constants as substitutes, but it is
374 preferable to interpret the above locales accordingly.
375 - Dropped class ab_semigroup_idem_mult (special case of lattice,
376 no longer needed in connection with Finite_Set.fold etc.)
378 card.union_inter ~> card_Un_Int [symmetric]
379 card.union_disjoint ~> card_Un_disjoint
382 * Locale hierarchy for abstract orderings and (semi)lattices.
384 * Complete_Partial_Order.admissible is defined outside the type class
385 ccpo, but with mandatory prefix ccpo. Admissibility theorems lose the
386 class predicate assumption or sort constraint when possible.
389 * Introduce type class "conditionally_complete_lattice": Like a
390 complete lattice but does not assume the existence of the top and
391 bottom elements. Allows to generalize some lemmas about reals and
392 extended reals. Removed SupInf and replaced it by the instantiation
393 of conditionally_complete_lattice for real. Renamed lemmas about
394 conditionally-complete lattice from Sup_... to cSup_... and from
395 Inf_... to cInf_... to avoid hidding of similar complete lattice
398 * Introduce type class linear_continuum as combination of
399 conditionally-complete lattices and inner dense linorders which have
400 more than one element. INCOMPATIBILITY.
402 * Introduced type classes order_top and order_bot. The old classes top
403 and bot only contain the syntax without assumptions. INCOMPATIBILITY:
404 Rename bot -> order_bot, top -> order_top
406 * Introduce type classes "no_top" and "no_bot" for orderings without
407 top and bottom elements.
409 * Split dense_linorder into inner_dense_order and no_top, no_bot.
411 * Complex_Main: Unify and move various concepts from
412 HOL-Multivariate_Analysis to HOL-Complex_Main.
414 - Introduce type class (lin)order_topology and
415 linear_continuum_topology. Allows to generalize theorems about
416 limits and order. Instances are reals and extended reals.
418 - continuous and continuos_on from Multivariate_Analysis:
419 "continuous" is the continuity of a function at a filter. "isCont"
420 is now an abbrevitation: "isCont x f == continuous (at _) f".
422 Generalized continuity lemmas from isCont to continuous on an
425 - compact from Multivariate_Analysis. Use Bolzano's lemma to prove
426 compactness of closed intervals on reals. Continuous functions
427 attain infimum and supremum on compact sets. The inverse of a
428 continuous function is continuous, when the function is continuous
431 - connected from Multivariate_Analysis. Use it to prove the
432 intermediate value theorem. Show connectedness of intervals on
433 linear_continuum_topology).
435 - first_countable_topology from Multivariate_Analysis. Is used to
436 show equivalence of properties on the neighbourhood filter of x and
437 on all sequences converging to x.
439 - FDERIV: Definition of has_derivative moved to Deriv.thy. Moved
440 theorems from Library/FDERIV.thy to Deriv.thy and base the
441 definition of DERIV on FDERIV. Add variants of DERIV and FDERIV
442 which are restricted to sets, i.e. to represent derivatives from
445 - Removed the within-filter. It is replaced by the principal filter:
447 F within X = inf F (principal X)
449 - Introduce "at x within U" as a single constant, "at x" is now an
450 abbreviation for "at x within UNIV"
452 - Introduce named theorem collections tendsto_intros,
453 continuous_intros, continuous_on_intros and FDERIV_intros. Theorems
454 in tendsto_intros (or FDERIV_intros) are also available as
455 tendsto_eq_intros (or FDERIV_eq_intros) where the right-hand side
456 is replaced by a congruence rule. This allows to apply them as
457 intro rules and then proving equivalence by the simplifier.
459 - Restructured theories in HOL-Complex_Main:
461 + Moved RealDef and RComplete into Real
463 + Introduced Topological_Spaces and moved theorems about
464 topological spaces, filters, limits and continuity to it
466 + Renamed RealVector to Real_Vector_Spaces
468 + Split Lim, SEQ, Series into Topological_Spaces,
469 Real_Vector_Spaces, and Limits
471 + Moved Ln and Log to Transcendental
473 + Moved theorems about continuity from Deriv to Topological_Spaces
475 - Remove various auxiliary lemmas.
481 - Reduce incidence of "too high arity" errors
485 isar_shrink ~> isar_compress
487 - Added options "isar_try0", "spy"
488 - Better support for "isar_proofs"
489 - MaSh has been fined-tuned and now runs as a local server
491 * Improved support for ad hoc overloading of constants (see also
492 isar-ref manual and ~~/src/HOL/ex/Adhoc_Overloading_Examples.thy).
494 * Library/Polynomial.thy:
495 - Use lifting for primitive definitions.
496 - Explicit conversions from and to lists of coefficients, used for
498 - Replaced recursion operator poly_rec by fold_coeffs.
499 - Prefer pre-existing gcd operation for gcd.
501 poly_eq_iff ~> poly_eq_poly_eq_iff
503 expand_poly_eq ~> poly_eq_iff
506 * New Library/Simps_Case_Conv.thy: Provides commands simps_of_case and
507 case_of_simps to convert function definitions between a list of
508 equations with patterns on the lhs and a single equation with case
509 expressions on the rhs. See also Ex/Simps_Case_Conv_Examples.thy.
511 * New Library/FSet.thy: type of finite sets defined as a subtype of
512 sets defined by Lifting/Transfer.
514 * Discontinued theory src/HOL/Library/Eval_Witness. INCOMPATIBILITY.
516 * Consolidation of library theories on product orders:
518 Product_Lattice ~> Product_Order -- pointwise order on products
519 Product_ord ~> Product_Lexorder -- lexicographic order on products
523 * Imperative-HOL: The MREC combinator is considered legacy and no
524 longer included by default. INCOMPATIBILITY, use partial_function
525 instead, or import theory Legacy_Mrec as a fallback.
527 * HOL-Algebra: Discontinued theories ~~/src/HOL/Algebra/abstract and
528 ~~/src/HOL/Algebra/poly. Existing theories should be based on
529 ~~/src/HOL/Library/Polynomial instead. The latter provides
530 integration with HOL's type classes for rings. INCOMPATIBILITY.
533 - Various improvements to BNF-based (co)datatype package, including
534 new commands "primrec_new", "primcorec", and
535 "datatype_new_compat", as well as documentation. See
536 "datatypes.pdf" for details.
537 - New "coinduction" method to avoid some boilerplate (compared to
543 - Renamed many generated theorems, including
545 map_comp' ~> map_comp
553 - Fixed soundness bug whereby mutually recursive datatypes could take
559 * Spec_Check is a Quickcheck tool for Isabelle/ML. The ML function
560 "check_property" allows to check specifications of the form "ALL x y
561 z. prop x y z". See also ~~/src/Tools/Spec_Check/ with its
562 Examples.thy in particular.
564 * Improved printing of exception trace in Poly/ML 5.5.1, with regular
565 tracing output in the command transaction context instead of physical
566 stdout. See also Toplevel.debug, Toplevel.debugging and
567 ML_Compiler.exn_trace.
569 * ML type "theory" is now immutable, without any special treatment of
570 drafts or linear updates (which could lead to "stale theory" errors in
571 the past). Discontinued obsolete operations like Theory.copy,
572 Theory.checkpoint, and the auxiliary type theory_ref. Minor
575 * More uniform naming of goal functions for skipped proofs:
577 Skip_Proof.prove ~> Goal.prove_sorry
578 Skip_Proof.prove_global ~> Goal.prove_sorry_global
580 Minor INCOMPATIBILITY.
582 * Simplifier tactics and tools use proper Proof.context instead of
583 historic type simpset. Old-style declarations like addsimps,
584 addsimprocs etc. operate directly on Proof.context. Raw type simpset
585 retains its use as snapshot of the main Simplifier context, using
586 simpset_of and put_simpset on Proof.context. INCOMPATIBILITY -- port
587 old tools by making them depend on (ctxt : Proof.context) instead of
588 (ss : simpset), then turn (simpset_of ctxt) into ctxt.
590 * Modifiers for classical wrappers (e.g. addWrapper, delWrapper)
591 operate on Proof.context instead of claset, for uniformity with addIs,
592 addEs, addDs etc. Note that claset_of and put_claset allow to manage
593 clasets separately from the context.
595 * Discontinued obsolete ML antiquotations @{claset} and @{simpset}.
596 INCOMPATIBILITY, use @{context} instead.
598 * Antiquotation @{theory_context A} is similar to @{theory A}, but
599 presents the result as initial Proof.context.
604 * Discontinued obsolete isabelle usedir, mkdir, make -- superseded by
605 "isabelle build" in Isabelle2013. INCOMPATIBILITY.
607 * Discontinued obsolete isabelle-process options -f and -u (former
608 administrative aliases of option -e). Minor INCOMPATIBILITY.
610 * Discontinued obsolete isabelle print tool, and PRINT_COMMAND
613 * Discontinued ISABELLE_DOC_FORMAT settings variable and historic
614 document formats: dvi.gz, ps, ps.gz -- the default document format is
617 * Isabelle settings variable ISABELLE_BUILD_JAVA_OPTIONS allows to
618 specify global resources of the JVM process run by isabelle build.
620 * Toplevel executable $ISABELLE_HOME/bin/isabelle_scala_script allows
621 to run Isabelle/Scala source files as standalone programs.
623 * Improved "isabelle keywords" tool (for old-style ProofGeneral
624 keyword tables): use Isabelle/Scala operations, which inspect outer
625 syntax without requiring to build sessions first.
627 * Sessions may be organized via 'chapter' specifications in the ROOT
628 file, which determines a two-level hierarchy of browser info. The old
629 tree-like organization via implicit sub-session relation (with its
630 tendency towards erratic fluctuation of URLs) has been discontinued.
631 The default chapter is called "Unsorted". Potential INCOMPATIBILITY
632 for HTML presentation of theories.
636 New in Isabelle2013 (February 2013)
637 -----------------------------------
641 * Theorem status about oracles and unfinished/failed future proofs is
642 no longer printed by default, since it is incompatible with
643 incremental / parallel checking of the persistent document model. ML
644 function Thm.peek_status may be used to inspect a snapshot of the
645 ongoing evaluation process. Note that in batch mode --- notably
646 isabelle build --- the system ensures that future proofs of all
647 accessible theorems in the theory context are finished (as before).
649 * Configuration option show_markup controls direct inlining of markup
650 into the printed representation of formal entities --- notably type
651 and sort constraints. This enables Prover IDE users to retrieve that
652 information via tooltips in the output window, for example.
654 * Command 'ML_file' evaluates ML text from a file directly within the
655 theory, without any predeclaration via 'uses' in the theory header.
657 * Old command 'use' command and corresponding keyword 'uses' in the
658 theory header are legacy features and will be discontinued soon.
659 Tools that load their additional source files may imitate the
660 'ML_file' implementation, such that the system can take care of
661 dependencies properly.
663 * Discontinued obsolete method fastsimp / tactic fast_simp_tac, which
664 is called fastforce / fast_force_tac already since Isabelle2011-1.
666 * Updated and extended "isar-ref" and "implementation" manual, reduced
667 remaining material in old "ref" manual.
669 * Improved support for auxiliary contexts that indicate block structure
670 for specifications. Nesting of "context fixes ... context assumes ..."
671 and "class ... context ...".
673 * Attribute "consumes" allows a negative value as well, which is
674 interpreted relatively to the total number of premises of the rule in
675 the target context. This form of declaration is stable when exported
676 from a nested 'context' with additional assumptions. It is the
677 preferred form for definitional packages, notably cases/rules produced
678 in HOL/inductive and HOL/function.
680 * More informative error messages for Isar proof commands involving
681 lazy enumerations (method applications etc.).
683 * Refined 'help' command to retrieve outer syntax commands according
684 to name patterns (with clickable results).
687 *** Prover IDE -- Isabelle/Scala/jEdit ***
689 * Parallel terminal proofs ('by') are enabled by default, likewise
690 proofs that are built into packages like 'datatype', 'function'. This
691 allows to "run ahead" checking the theory specifications on the
692 surface, while the prover is still crunching on internal
693 justifications. Unfinished / cancelled proofs are restarted as
694 required to complete full proof checking eventually.
696 * Improved output panel with tooltips, hyperlinks etc. based on the
697 same Rich_Text_Area as regular Isabelle/jEdit buffers. Activation of
698 tooltips leads to some window that supports the same recursively,
699 which can lead to stacks of tooltips as the semantic document content
700 is explored. ESCAPE closes the whole stack, individual windows may be
701 closed separately, or detached to become independent jEdit dockables.
703 * Improved support for commands that produce graph output: the text
704 message contains a clickable area to open a new instance of the graph
707 * More robust incremental parsing of outer syntax (partial comments,
708 malformed symbols). Changing the balance of open/close quotes and
709 comment delimiters works more conveniently with unfinished situations
710 that frequently occur in user interaction.
712 * More efficient painting and improved reactivity when editing large
713 files. More scalable management of formal document content.
715 * Smarter handling of tracing messages: prover process pauses after
716 certain number of messages per command transaction, with some user
717 dialog to stop or continue. This avoids swamping the front-end with
718 potentially infinite message streams.
720 * More plugin options and preferences, based on Isabelle/Scala. The
721 jEdit plugin option panel provides access to some Isabelle/Scala
722 options, including tuning parameters for editor reactivity and color
725 * Dockable window "Symbols" provides some editing support for Isabelle
728 * Dockable window "Monitor" shows ML runtime statistics. Note that
729 continuous display of the chart slows down the system.
731 * Improved editing support for control styles: subscript, superscript,
732 bold, reset of style -- operating on single symbols or text
733 selections. Cf. keyboard shortcuts C+e DOWN/UP/RIGHT/LEFT.
735 * Actions isabelle.increase-font-size and isabelle.decrease-font-size
736 adjust the main text area font size, and its derivatives for output,
737 tooltips etc. Cf. keyboard shortcuts C-PLUS and C-MINUS, which often
738 need to be adapted to local keyboard layouts.
740 * More reactive completion popup by default: use \t (TAB) instead of
741 \n (NEWLINE) to minimize intrusion into regular flow of editing. See
742 also "Plugin Options / SideKick / General / Code Completion Options".
744 * Implicit check and build dialog of the specified logic session
745 image. For example, HOL, HOLCF, HOL-Nominal can be produced on
746 demand, without bundling big platform-dependent heap images in the
747 Isabelle distribution.
749 * Uniform Java 7 platform on Linux, Mac OS X, Windows: recent updates
750 from Oracle provide better multi-platform experience. This version is
751 now bundled exclusively with Isabelle.
756 * Code generation for Haskell: restrict unqualified imports from
757 Haskell Prelude to a small set of fundamental operations.
759 * Command 'export_code': relative file names are interpreted
760 relatively to master directory of current theory rather than the
761 rather arbitrary current working directory. INCOMPATIBILITY.
763 * Discontinued obsolete attribute "COMP". Potential INCOMPATIBILITY,
764 use regular rule composition via "OF" / "THEN", or explicit proof
765 structure instead. Note that Isabelle/ML provides a variety of
766 operators like COMP, INCR_COMP, COMP_INCR, which need to be applied
767 with some care where this is really required.
769 * Command 'typ' supports an additional variant with explicit sort
770 constraint, to infer and check the most general type conforming to a
771 given sort. Example (in HOL):
773 typ "_ * _ * bool * unit" :: finite
775 * Command 'locale_deps' visualizes all locales and their relations as
783 - Added MaSh relevance filter based on machine-learning; see the
784 Sledgehammer manual for details.
785 - Polished Isar proofs generated with "isar_proofs" option.
786 - Rationalized type encodings ("type_enc" option).
787 - Renamed "kill_provers" subcommand to "kill_all".
789 isar_proof ~> isar_proofs
790 isar_shrink_factor ~> isar_shrink
791 max_relevant ~> max_facts
792 relevance_thresholds ~> fact_thresholds
794 * Quickcheck: added an optimisation for equality premises. It is
795 switched on by default, and can be switched off by setting the
796 configuration quickcheck_optimise_equality to false.
798 * Quotient: only one quotient can be defined by quotient_type
802 - generation of an abstraction function equation in lift_definition
804 - renamed no_abs_code -> no_code (INCOMPATIBILITY.)
806 * Simproc "finite_Collect" rewrites set comprehensions into pointfree
809 * Preprocessing of the code generator rewrites set comprehensions into
810 pointfree expressions.
812 * The SMT solver Z3 has now by default a restricted set of directly
813 supported features. For the full set of features (div/mod, nonlinear
814 arithmetic, datatypes/records) with potential proof reconstruction
815 failures, enable the configuration option "z3_with_extensions". Minor
818 * Simplified 'typedef' specifications: historical options for implicit
819 set definition and alternative name have been discontinued. The
820 former behavior of "typedef (open) t = A" is now the default, but
821 written just "typedef t = A". INCOMPATIBILITY, need to adapt theories
824 * Removed constant "chars"; prefer "Enum.enum" on type "char"
825 directly. INCOMPATIBILITY.
827 * Moved operation product, sublists and n_lists from theory Enum to
828 List. INCOMPATIBILITY.
830 * Theorem UN_o generalized to SUP_comp. INCOMPATIBILITY.
832 * Class "comm_monoid_diff" formalises properties of bounded
833 subtraction, with natural numbers and multisets as typical instances.
835 * Added combinator "Option.these" with type "'a option set => 'a set".
837 * Theory "Transitive_Closure": renamed lemmas
839 reflcl_tranclp -> reflclp_tranclp
840 rtranclp_reflcl -> rtranclp_reflclp
844 * Theory "Rings": renamed lemmas (in class semiring)
846 left_distrib ~> distrib_right
847 right_distrib ~> distrib_left
851 * Generalized the definition of limits:
853 - Introduced the predicate filterlim (LIM x F. f x :> G) which
854 expresses that when the input values x converge to F then the
855 output f x converges to G.
857 - Added filters for convergence to positive (at_top) and negative
860 - Moved infinity in the norm (at_infinity) from
861 Multivariate_Analysis to Complex_Main.
863 - Removed real_tendsto_inf, it is superseded by "LIM x F. f x :>
868 * Theory "Library/Option_ord" provides instantiation of option type to
869 lattice type classes.
871 * Theory "Library/Multiset": renamed
873 constant fold_mset ~> Multiset.fold
874 fact fold_mset_commute ~> fold_mset_comm
878 * Renamed theory Library/List_Prefix to Library/Sublist, with related
881 - Renamed constants (and related lemmas)
884 strict_prefix ~> prefix
886 - Replaced constant "postfix" by "suffixeq" with swapped argument
887 order (i.e., "postfix xs ys" is now "suffixeq ys xs") and dropped
888 old infix syntax "xs >>= ys"; use "suffixeq ys xs" instead.
889 Renamed lemmas accordingly.
891 - Added constant "list_hembeq" for homeomorphic embedding on
892 lists. Added abbreviation "sublisteq" for special case
893 "list_hembeq (op =)".
895 - Theory Library/Sublist no longer provides "order" and "bot" type
896 class instances for the prefix order (merely corresponding locale
897 interpretations). The type class instances are now in theory
898 Library/Prefix_Order.
900 - The sublist relation of theory Library/Sublist_Order is now based
901 on "Sublist.sublisteq". Renamed lemmas accordingly:
903 le_list_append_le_same_iff ~> Sublist.sublisteq_append_le_same_iff
904 le_list_append_mono ~> Sublist.list_hembeq_append_mono
905 le_list_below_empty ~> Sublist.list_hembeq_Nil, Sublist.list_hembeq_Nil2
906 le_list_Cons_EX ~> Sublist.list_hembeq_ConsD
907 le_list_drop_Cons2 ~> Sublist.sublisteq_Cons2'
908 le_list_drop_Cons_neq ~> Sublist.sublisteq_Cons2_neq
909 le_list_drop_Cons ~> Sublist.sublisteq_Cons'
910 le_list_drop_many ~> Sublist.sublisteq_drop_many
911 le_list_filter_left ~> Sublist.sublisteq_filter_left
912 le_list_rev_drop_many ~> Sublist.sublisteq_rev_drop_many
913 le_list_rev_take_iff ~> Sublist.sublisteq_append
914 le_list_same_length ~> Sublist.sublisteq_same_length
915 le_list_take_many_iff ~> Sublist.sublisteq_append'
916 less_eq_list.drop ~> less_eq_list_drop
917 less_eq_list.induct ~> less_eq_list_induct
918 not_le_list_length ~> Sublist.not_sublisteq_length
922 * New theory Library/Countable_Set.
924 * Theory Library/Debug and Library/Parallel provide debugging and
925 parallel execution for code generated towards Isabelle/ML.
927 * Theory Library/FuncSet: Extended support for Pi and extensional and
928 introduce the extensional dependent function space "PiE". Replaced
929 extensional_funcset by an abbreviation, and renamed lemmas from
930 extensional_funcset to PiE as follows:
932 extensional_empty ~> PiE_empty
933 extensional_funcset_empty_domain ~> PiE_empty_domain
934 extensional_funcset_empty_range ~> PiE_empty_range
935 extensional_funcset_arb ~> PiE_arb
936 extensional_funcset_mem ~> PiE_mem
937 extensional_funcset_extend_domainI ~> PiE_fun_upd
938 extensional_funcset_restrict_domain ~> fun_upd_in_PiE
939 extensional_funcset_extend_domain_eq ~> PiE_insert_eq
940 card_extensional_funcset ~> card_PiE
941 finite_extensional_funcset ~> finite_PiE
945 * Theory Library/FinFun: theory of almost everywhere constant
946 functions (supersedes the AFP entry "Code Generation for Functions as
949 * Theory Library/Phantom: generic phantom type to make a type
950 parameter appear in a constant's type. This alternative to adding
951 TYPE('a) as another parameter avoids unnecessary closures in generated
954 * Theory Library/RBT_Impl: efficient construction of red-black trees
955 from sorted associative lists. Merging two trees with rbt_union may
956 return a structurally different tree than before. Potential
959 * Theory Library/IArray: immutable arrays with code generation.
961 * Theory Library/Finite_Lattice: theory of finite lattices.
963 * HOL/Multivariate_Analysis: replaced
965 "basis :: 'a::euclidean_space => nat => real"
966 "\<Chi>\<Chi> :: (nat => real) => 'a::euclidean_space"
968 on euclidean spaces by using the inner product "_ \<bullet> _" with
969 vectors from the Basis set: "\<Chi>\<Chi> i. f i" is superseded by
970 "SUM i : Basis. f i * r i".
972 With this change the following constants are also changed or removed:
974 DIM('a) :: nat ~> card (Basis :: 'a set) (is an abbreviation)
975 a $$ i ~> inner a i (where i : Basis)
977 \<pi>, \<pi>' removed
979 Theorems about these constants where removed.
983 component_le_norm ~> Basis_le_norm
984 euclidean_eq ~> euclidean_eq_iff
985 differential_zero_maxmin_component ~> differential_zero_maxmin_cart
986 euclidean_simps ~> inner_simps
987 independent_basis ~> independent_Basis
988 span_basis ~> span_Basis
989 in_span_basis ~> in_span_Basis
990 norm_bound_component_le ~> norm_boound_Basis_le
991 norm_bound_component_lt ~> norm_boound_Basis_lt
992 component_le_infnorm ~> Basis_le_infnorm
998 - Added simproc "measurable" to automatically prove measurability.
1000 - Added induction rules for sigma sets with disjoint union
1001 (sigma_sets_induct_disjoint) and for Borel-measurable functions
1002 (borel_measurable_induct).
1004 - Added the Daniell-Kolmogorov theorem (the existence the limit of a
1007 * HOL/Cardinals: Theories of ordinals and cardinals (supersedes the
1008 AFP entry "Ordinals_and_Cardinals").
1010 * HOL/BNF: New (co)datatype package based on bounded natural functors
1011 with support for mixed, nested recursion and interesting non-free
1014 * HOL/Finite_Set and Relation: added new set and relation operations
1015 expressed by Finite_Set.fold.
1017 * New theory HOL/Library/RBT_Set: implementation of sets by red-black
1018 trees for the code generator.
1020 * HOL/Library/RBT and HOL/Library/Mapping have been converted to
1022 possible INCOMPATIBILITY.
1024 * HOL/Set: renamed Set.project -> Set.filter
1028 *** Document preparation ***
1030 * Dropped legacy antiquotations "term_style" and "thm_style", since
1031 styles may be given as arguments to "term" and "thm" already.
1032 Discontinued legacy styles "prem1" .. "prem19".
1034 * Default LaTeX rendering for \<euro> is now based on eurosym package,
1035 instead of slightly exotic babel/greek.
1037 * Document variant NAME may use different LaTeX entry point
1038 document/root_NAME.tex if that file exists, instead of the common
1041 * Simplified custom document/build script, instead of old-style
1042 document/IsaMakefile. Minor INCOMPATIBILITY.
1047 * The default limit for maximum number of worker threads is now 8,
1048 instead of 4, in correspondence to capabilities of contemporary
1049 hardware and Poly/ML runtime system.
1051 * Type Seq.results and related operations support embedded error
1052 messages within lazy enumerations, and thus allow to provide
1053 informative errors in the absence of any usable results.
1055 * Renamed Position.str_of to Position.here to emphasize that this is a
1056 formal device to inline positions into message text, but not
1057 necessarily printing visible text.
1062 * Advanced support for Isabelle sessions and build management, see
1063 "system" manual for the chapter of that name, especially the "isabelle
1064 build" tool and its examples. The "isabelle mkroot" tool prepares
1065 session root directories for use with "isabelle build", similar to
1066 former "isabelle mkdir" for "isabelle usedir". Note that this affects
1067 document preparation as well. INCOMPATIBILITY, isabelle usedir /
1068 mkdir / make are rendered obsolete.
1070 * Discontinued obsolete Isabelle/build script, it is superseded by the
1071 regular isabelle build tool. For example:
1073 isabelle build -s -b HOL
1075 * Discontinued obsolete "isabelle makeall".
1077 * Discontinued obsolete IsaMakefile and ROOT.ML files from the
1078 Isabelle distribution, except for rudimentary src/HOL/IsaMakefile that
1079 provides some traditional targets that invoke "isabelle build". Note
1080 that this is inefficient! Applications of Isabelle/HOL involving
1081 "isabelle make" should be upgraded to use "isabelle build" directly.
1083 * The "isabelle options" tool prints Isabelle system options, as
1084 required for "isabelle build", for example.
1086 * The "isabelle logo" tool produces EPS and PDF format simultaneously.
1087 Minor INCOMPATIBILITY in command-line options.
1089 * The "isabelle install" tool has now a simpler command-line. Minor
1092 * The "isabelle components" tool helps to resolve add-on components
1093 that are not bundled, or referenced from a bare-bones repository
1094 version of Isabelle.
1096 * Settings variable ISABELLE_PLATFORM_FAMILY refers to the general
1097 platform family: "linux", "macos", "windows".
1099 * The ML system is configured as regular component, and no longer
1100 picked up from some surrounding directory. Potential INCOMPATIBILITY
1101 for home-made settings.
1103 * Improved ML runtime statistics (heap, threads, future tasks etc.).
1105 * Discontinued support for Poly/ML 5.2.1, which was the last version
1106 without exception positions and advanced ML compiler/toplevel
1109 * Discontinued special treatment of Proof General -- no longer guess
1110 PROOFGENERAL_HOME based on accidental file-system layout. Minor
1111 INCOMPATIBILITY: provide PROOFGENERAL_HOME and PROOFGENERAL_OPTIONS
1112 settings manually, or use a Proof General version that has been
1113 bundled as Isabelle component.
1117 New in Isabelle2012 (May 2012)
1118 ------------------------------
1122 * Prover IDE (PIDE) improvements:
1124 - more robust Sledgehammer integration (as before the sledgehammer
1125 command-line needs to be typed into the source buffer)
1126 - markup for bound variables
1127 - markup for types of term variables (displayed as tooltips)
1128 - support for user-defined Isar commands within the running session
1129 - improved support for Unicode outside original 16bit range
1130 e.g. glyph for \<A> (thanks to jEdit 4.5.1)
1132 * Forward declaration of outer syntax keywords within the theory
1133 header -- minor INCOMPATIBILITY for user-defined commands. Allow new
1134 commands to be used in the same theory where defined.
1136 * Auxiliary contexts indicate block structure for specifications with
1137 additional parameters and assumptions. Such unnamed contexts may be
1138 nested within other targets, like 'theory', 'locale', 'class',
1139 'instantiation' etc. Results from the local context are generalized
1140 accordingly and applied to the enclosing target context. Example:
1144 assumes xy: "x = y" and yz: "y = z"
1147 lemma my_trans: "x = z" using xy yz by simp
1153 The most basic application is to factor-out context elements of
1154 several fixes/assumes/shows theorem statements, e.g. see
1155 ~~/src/HOL/Isar_Examples/Group_Context.thy
1157 Any other local theory specification element works within the "context
1158 ... begin ... end" block as well.
1160 * Bundled declarations associate attributed fact expressions with a
1161 given name in the context. These may be later included in other
1162 contexts. This allows to manage context extensions casually, without
1163 the logical dependencies of locales and locale interpretation. See
1164 commands 'bundle', 'include', 'including' etc. in the isar-ref manual.
1166 * Commands 'lemmas' and 'theorems' allow local variables using 'for'
1167 declaration, and results are standardized before being stored. Thus
1168 old-style "standard" after instantiation or composition of facts
1169 becomes obsolete. Minor INCOMPATIBILITY, due to potential change of
1170 indices of schematic variables.
1172 * Rule attributes in local theory declarations (e.g. locale or class)
1173 are now statically evaluated: the resulting theorem is stored instead
1174 of the original expression. INCOMPATIBILITY in rare situations, where
1175 the historic accident of dynamic re-evaluation in interpretations
1178 * New tutorial "Programming and Proving in Isabelle/HOL"
1179 ("prog-prove"). It completely supersedes "A Tutorial Introduction to
1180 Structured Isar Proofs" ("isar-overview"), which has been removed. It
1181 also supersedes "Isabelle/HOL, A Proof Assistant for Higher-Order
1182 Logic" as the recommended beginners tutorial, but does not cover all
1183 of the material of that old tutorial.
1185 * Updated and extended reference manuals: "isar-ref",
1186 "implementation", "system"; reduced remaining material in old "ref"
1192 * Command 'definition' no longer exports the foundational "raw_def"
1193 into the user context. Minor INCOMPATIBILITY, may use the regular
1194 "def" result with attribute "abs_def" to imitate the old version.
1196 * Attribute "abs_def" turns an equation of the form "f x y == t" into
1197 "f == %x y. t", which ensures that "simp" or "unfold" steps always
1198 expand it. This also works for object-logic equality. (Formerly
1199 undocumented feature.)
1201 * Sort constraints are now propagated in simultaneous statements, just
1202 like type constraints. INCOMPATIBILITY in rare situations, where
1203 distinct sorts used to be assigned accidentally. For example:
1205 lemma "P (x::'a::foo)" and "Q (y::'a::bar)" -- "now illegal"
1207 lemma "P (x::'a)" and "Q (y::'a::bar)"
1208 -- "now uniform 'a::bar instead of default sort for first occurrence (!)"
1210 * Rule composition via attribute "OF" (or ML functions OF/MRS) is more
1211 tolerant against multiple unifiers, as long as the final result is
1212 unique. (As before, rules are composed in canonical right-to-left
1213 order to accommodate newly introduced premises.)
1215 * Renamed some inner syntax categories:
1221 Minor INCOMPATIBILITY. Note that in practice "num_const" or
1222 "num_position" etc. are mainly used instead (which also include
1223 position information via constraints).
1225 * Simplified configuration options for syntax ambiguity: see
1226 "syntax_ambiguity_warning" and "syntax_ambiguity_limit" in isar-ref
1227 manual. Minor INCOMPATIBILITY.
1229 * Discontinued configuration option "syntax_positions": atomic terms
1230 in parse trees are always annotated by position constraints.
1232 * Old code generator for SML and its commands 'code_module',
1233 'code_library', 'consts_code', 'types_code' have been discontinued.
1234 Use commands of the generic code generator instead. INCOMPATIBILITY.
1236 * Redundant attribute "code_inline" has been discontinued. Use
1237 "code_unfold" instead. INCOMPATIBILITY.
1239 * Dropped attribute "code_unfold_post" in favor of the its dual
1240 "code_abbrev", which yields a common pattern in definitions like
1242 definition [code_abbrev]: "f = t"
1246 * Obsolete 'types' command has been discontinued. Use 'type_synonym'
1247 instead. INCOMPATIBILITY.
1249 * Discontinued old "prems" fact, which used to refer to the accidental
1250 collection of foundational premises in the context (already marked as
1251 legacy since Isabelle2011).
1256 * Type 'a set is now a proper type constructor (just as before
1257 Isabelle2008). Definitions mem_def and Collect_def have disappeared.
1258 Non-trivial INCOMPATIBILITY. For developments keeping predicates and
1259 sets separate, it is often sufficient to rephrase some set S that has
1260 been accidentally used as predicates by "%x. x : S", and some
1261 predicate P that has been accidentally used as set by "{x. P x}".
1262 Corresponding proofs in a first step should be pruned from any
1263 tinkering with former theorems mem_def and Collect_def as far as
1266 For developments which deliberately mix predicates and sets, a
1267 planning step is necessary to determine what should become a predicate
1268 and what a set. It can be helpful to carry out that step in
1269 Isabelle2011-1 before jumping right into the current release.
1271 * Code generation by default implements sets as container type rather
1272 than predicates. INCOMPATIBILITY.
1274 * New type synonym 'a rel = ('a * 'a) set
1276 * The representation of numerals has changed. Datatype "num"
1277 represents strictly positive binary numerals, along with functions
1278 "numeral :: num => 'a" and "neg_numeral :: num => 'a" to represent
1279 positive and negated numeric literals, respectively. See also
1280 definitions in ~~/src/HOL/Num.thy. Potential INCOMPATIBILITY, some
1281 user theories may require adaptations as follows:
1283 - Theorems with number_ring or number_semiring constraints: These
1284 classes are gone; use comm_ring_1 or comm_semiring_1 instead.
1286 - Theories defining numeric types: Remove number, number_semiring,
1287 and number_ring instances. Defer all theorems about numerals until
1288 after classes one and semigroup_add have been instantiated.
1290 - Numeral-only simp rules: Replace each rule having a "number_of v"
1291 pattern with two copies, one for numeral and one for neg_numeral.
1293 - Theorems about subclasses of semiring_1 or ring_1: These classes
1294 automatically support numerals now, so more simp rules and
1295 simprocs may now apply within the proof.
1297 - Definitions and theorems using old constructors Pls/Min/Bit0/Bit1:
1298 Redefine using other integer operations.
1300 * Transfer: New package intended to generalize the existing
1301 "descending" method and related theorem attributes from the Quotient
1302 package. (Not all functionality is implemented yet, but future
1303 development will focus on Transfer as an eventual replacement for the
1304 corresponding parts of the Quotient package.)
1306 - transfer_rule attribute: Maintains a collection of transfer rules,
1307 which relate constants at two different types. Transfer rules may
1308 relate different type instances of the same polymorphic constant,
1309 or they may relate an operation on a raw type to a corresponding
1310 operation on an abstract type (quotient or subtype). For example:
1312 ((A ===> B) ===> list_all2 A ===> list_all2 B) map map
1313 (cr_int ===> cr_int ===> cr_int) (%(x,y) (u,v). (x+u, y+v)) plus_int
1315 - transfer method: Replaces a subgoal on abstract types with an
1316 equivalent subgoal on the corresponding raw types. Constants are
1317 replaced with corresponding ones according to the transfer rules.
1318 Goals are generalized over all free variables by default; this is
1319 necessary for variables whose types change, but can be overridden
1320 for specific variables with e.g. "transfer fixing: x y z". The
1321 variant transfer' method allows replacing a subgoal with one that
1322 is logically stronger (rather than equivalent).
1324 - relator_eq attribute: Collects identity laws for relators of
1325 various type constructors, e.g. "list_all2 (op =) = (op =)". The
1326 transfer method uses these lemmas to infer transfer rules for
1327 non-polymorphic constants on the fly.
1329 - transfer_prover method: Assists with proving a transfer rule for a
1330 new constant, provided the constant is defined in terms of other
1331 constants that already have transfer rules. It should be applied
1332 after unfolding the constant definitions.
1334 - HOL/ex/Transfer_Int_Nat.thy: Example theory demonstrating transfer
1335 from type nat to type int.
1337 * Lifting: New package intended to generalize the quotient_definition
1338 facility of the Quotient package; designed to work with Transfer.
1340 - lift_definition command: Defines operations on an abstract type in
1341 terms of a corresponding operation on a representation
1342 type. Example syntax:
1344 lift_definition dlist_insert :: "'a => 'a dlist => 'a dlist"
1347 Users must discharge a respectfulness proof obligation when each
1348 constant is defined. (For a type copy, i.e. a typedef with UNIV,
1349 the proof is discharged automatically.) The obligation is
1350 presented in a user-friendly, readable form; a respectfulness
1351 theorem in the standard format and a transfer rule are generated
1354 - Integration with code_abstype: For typedefs (e.g. subtypes
1355 corresponding to a datatype invariant, such as dlist),
1356 lift_definition generates a code certificate theorem and sets up
1357 code generation for each constant.
1359 - setup_lifting command: Sets up the Lifting package to work with a
1360 user-defined type. The user must provide either a quotient theorem
1361 or a type_definition theorem. The package configures transfer
1362 rules for equality and quantifiers on the type, and sets up the
1363 lift_definition command to work with the type.
1365 - Usage examples: See Quotient_Examples/Lift_DList.thy,
1366 Quotient_Examples/Lift_RBT.thy, Quotient_Examples/Lift_FSet.thy,
1367 Word/Word.thy and Library/Float.thy.
1371 - The 'quotient_type' command now supports a 'morphisms' option with
1372 rep and abs functions, similar to typedef.
1374 - 'quotient_type' sets up new types to work with the Lifting and
1375 Transfer packages, as with 'setup_lifting'.
1377 - The 'quotient_definition' command now requires the user to prove a
1378 respectfulness property at the point where the constant is
1379 defined, similar to lift_definition; INCOMPATIBILITY.
1381 - Renamed predicate 'Quotient' to 'Quotient3', and renamed theorems
1382 accordingly, INCOMPATIBILITY.
1384 * New diagnostic command 'find_unused_assms' to find potentially
1385 superfluous assumptions in theorems using Quickcheck.
1389 - Quickcheck returns variable assignments as counterexamples, which
1390 allows to reveal the underspecification of functions under test.
1391 For example, refuting "hd xs = x", it presents the variable
1392 assignment xs = [] and x = a1 as a counterexample, assuming that
1393 any property is false whenever "hd []" occurs in it.
1395 These counterexample are marked as potentially spurious, as
1396 Quickcheck also returns "xs = []" as a counterexample to the
1397 obvious theorem "hd xs = hd xs".
1399 After finding a potentially spurious counterexample, Quickcheck
1400 continues searching for genuine ones.
1402 By default, Quickcheck shows potentially spurious and genuine
1403 counterexamples. The option "genuine_only" sets quickcheck to only
1404 show genuine counterexamples.
1406 - The command 'quickcheck_generator' creates random and exhaustive
1407 value generators for a given type and operations.
1409 It generates values by using the operations as if they were
1410 constructors of that type.
1412 - Support for multisets.
1414 - Added "use_subtype" options.
1416 - Added "quickcheck_locale" configuration to specify how to process
1417 conjectures in a locale context.
1419 * Nitpick: Fixed infinite loop caused by the 'peephole_optim' option
1420 and affecting 'rat' and 'real'.
1423 - Integrated more tightly with SPASS, as described in the ITP 2012
1424 paper "More SPASS with Isabelle".
1425 - Made it try "smt" as a fallback if "metis" fails or times out.
1426 - Added support for the following provers: Alt-Ergo (via Why3 and
1427 TFF1), iProver, iProver-Eq.
1428 - Sped up the minimizer.
1429 - Added "lam_trans", "uncurry_aliases", and "minimize" options.
1430 - Renamed "slicing" ("no_slicing") option to "slice" ("dont_slice").
1431 - Renamed "sound" option to "strict".
1433 * Metis: Added possibility to specify lambda translations scheme as a
1434 parenthesized argument (e.g., "by (metis (lifting) ...)").
1436 * SMT: Renamed "smt_fixed" option to "smt_read_only_certificates".
1438 * Command 'try0': Renamed from 'try_methods'. INCOMPATIBILITY.
1440 * New "case_product" attribute to generate a case rule doing multiple
1441 case distinctions at the same time. E.g.
1443 list.exhaust [case_product nat.exhaust]
1445 produces a rule which can be used to perform case distinction on both
1448 * New "eventually_elim" method as a generalized variant of the
1449 eventually_elim* rules. Supports structured proofs.
1451 * Typedef with implicit set definition is considered legacy. Use
1452 "typedef (open)" form instead, which will eventually become the
1455 * Record: code generation can be switched off manually with
1457 declare [[record_coden = false]] -- "default true"
1459 * Datatype: type parameters allow explicit sort constraints.
1461 * Concrete syntax for case expressions includes constraints for source
1462 positions, and thus produces Prover IDE markup for its bindings.
1463 INCOMPATIBILITY for old-style syntax translations that augment the
1464 pattern notation; e.g. see src/HOL/HOLCF/One.thy for translations of
1467 * Clarified attribute "mono_set": pure declaration without modifying
1468 the result of the fact expression.
1470 * More default pred/set conversions on a couple of relation operations
1471 and predicates. Added powers of predicate relations. Consolidation
1472 of some relation theorems:
1474 converse_def ~> converse_unfold
1475 rel_comp_def ~> relcomp_unfold
1476 symp_def ~> (modified, use symp_def and sym_def instead)
1477 transp_def ~> transp_trans
1478 Domain_def ~> Domain_unfold
1479 Range_def ~> Domain_converse [symmetric]
1481 Generalized theorems INF_INT_eq, INF_INT_eq2, SUP_UN_eq, SUP_UN_eq2.
1483 See theory "Relation" for examples for making use of pred/set
1484 conversions by means of attributes "to_set" and "to_pred".
1488 * Renamed facts about the power operation on relations, i.e., relpow
1489 to match the constant's name:
1491 rel_pow_1 ~> relpow_1
1492 rel_pow_0_I ~> relpow_0_I
1493 rel_pow_Suc_I ~> relpow_Suc_I
1494 rel_pow_Suc_I2 ~> relpow_Suc_I2
1495 rel_pow_0_E ~> relpow_0_E
1496 rel_pow_Suc_E ~> relpow_Suc_E
1497 rel_pow_E ~> relpow_E
1498 rel_pow_Suc_D2 ~> relpow_Suc_D2
1499 rel_pow_Suc_E2 ~> relpow_Suc_E2
1500 rel_pow_Suc_D2' ~> relpow_Suc_D2'
1501 rel_pow_E2 ~> relpow_E2
1502 rel_pow_add ~> relpow_add
1503 rel_pow_commute ~> relpow
1504 rel_pow_empty ~> relpow_empty:
1505 rtrancl_imp_UN_rel_pow ~> rtrancl_imp_UN_relpow
1506 rel_pow_imp_rtrancl ~> relpow_imp_rtrancl
1507 rtrancl_is_UN_rel_pow ~> rtrancl_is_UN_relpow
1508 rtrancl_imp_rel_pow ~> rtrancl_imp_relpow
1509 rel_pow_fun_conv ~> relpow_fun_conv
1510 rel_pow_finite_bounded1 ~> relpow_finite_bounded1
1511 rel_pow_finite_bounded ~> relpow_finite_bounded
1512 rtrancl_finite_eq_rel_pow ~> rtrancl_finite_eq_relpow
1513 trancl_finite_eq_rel_pow ~> trancl_finite_eq_relpow
1514 single_valued_rel_pow ~> single_valued_relpow
1518 * Theory Relation: Consolidated constant name for relation composition
1519 and corresponding theorem names:
1521 - Renamed constant rel_comp to relcomp.
1523 - Dropped abbreviation pred_comp. Use relcompp instead.
1527 rel_compI ~> relcompI
1528 rel_compEpair ~> relcompEpair
1529 rel_compE ~> relcompE
1530 pred_comp_rel_comp_eq ~> relcompp_relcomp_eq
1531 rel_comp_empty1 ~> relcomp_empty1
1532 rel_comp_mono ~> relcomp_mono
1533 rel_comp_subset_Sigma ~> relcomp_subset_Sigma
1534 rel_comp_distrib ~> relcomp_distrib
1535 rel_comp_distrib2 ~> relcomp_distrib2
1536 rel_comp_UNION_distrib ~> relcomp_UNION_distrib
1537 rel_comp_UNION_distrib2 ~> relcomp_UNION_distrib2
1538 single_valued_rel_comp ~> single_valued_relcomp
1539 rel_comp_def ~> relcomp_unfold
1540 converse_rel_comp ~> converse_relcomp
1541 pred_compI ~> relcomppI
1542 pred_compE ~> relcomppE
1543 pred_comp_bot1 ~> relcompp_bot1
1544 pred_comp_bot2 ~> relcompp_bot2
1545 transp_pred_comp_less_eq ~> transp_relcompp_less_eq
1546 pred_comp_mono ~> relcompp_mono
1547 pred_comp_distrib ~> relcompp_distrib
1548 pred_comp_distrib2 ~> relcompp_distrib2
1549 converse_pred_comp ~> converse_relcompp
1551 finite_rel_comp ~> finite_relcomp
1553 set_rel_comp ~> set_relcomp
1557 * Theory Divides: Discontinued redundant theorems about div and mod.
1558 INCOMPATIBILITY, use the corresponding generic theorems instead.
1560 DIVISION_BY_ZERO ~> div_by_0, mod_by_0
1561 zdiv_self ~> div_self
1562 zmod_self ~> mod_self
1565 zdiv_zmod_equality ~> div_mod_equality2
1566 zdiv_zmod_equality2 ~> div_mod_equality
1567 zmod_zdiv_trivial ~> mod_div_trivial
1568 zdiv_zminus_zminus ~> div_minus_minus
1569 zmod_zminus_zminus ~> mod_minus_minus
1570 zdiv_zminus2 ~> div_minus_right
1571 zmod_zminus2 ~> mod_minus_right
1572 zdiv_minus1_right ~> div_minus1_right
1573 zmod_minus1_right ~> mod_minus1_right
1574 zdvd_mult_div_cancel ~> dvd_mult_div_cancel
1575 zmod_zmult1_eq ~> mod_mult_right_eq
1576 zpower_zmod ~> power_mod
1577 zdvd_zmod ~> dvd_mod
1578 zdvd_zmod_imp_zdvd ~> dvd_mod_imp_dvd
1579 mod_mult_distrib ~> mult_mod_left
1580 mod_mult_distrib2 ~> mult_mod_right
1582 * Removed redundant theorems nat_mult_2 and nat_mult_2_right; use
1583 generic mult_2 and mult_2_right instead. INCOMPATIBILITY.
1585 * Finite_Set.fold now qualified. INCOMPATIBILITY.
1587 * Consolidated theorem names concerning fold combinators:
1589 inf_INFI_fold_inf ~> inf_INF_fold_inf
1590 sup_SUPR_fold_sup ~> sup_SUP_fold_sup
1591 INFI_fold_inf ~> INF_fold_inf
1592 SUPR_fold_sup ~> SUP_fold_sup
1593 union_set ~> union_set_fold
1594 minus_set ~> minus_set_fold
1595 INFI_set_fold ~> INF_set_fold
1596 SUPR_set_fold ~> SUP_set_fold
1597 INF_code ~> INF_set_foldr
1598 SUP_code ~> SUP_set_foldr
1599 foldr.simps ~> foldr.simps (in point-free formulation)
1600 foldr_fold_rev ~> foldr_conv_fold
1601 foldl_fold ~> foldl_conv_fold
1602 foldr_foldr ~> foldr_conv_foldl
1603 foldl_foldr ~> foldl_conv_foldr
1604 fold_set_remdups ~> fold_set_fold_remdups
1605 fold_set ~> fold_set_fold
1606 fold1_set ~> fold1_set_fold
1610 * Dropped rarely useful theorems concerning fold combinators:
1611 foldl_apply, foldl_fun_comm, foldl_rev, fold_weak_invariant,
1612 rev_foldl_cons, fold_set_remdups, fold_set, fold_set1,
1613 concat_conv_foldl, foldl_weak_invariant, foldl_invariant,
1614 foldr_invariant, foldl_absorb0, foldl_foldr1_lemma, foldl_foldr1,
1615 listsum_conv_fold, listsum_foldl, sort_foldl_insort, foldl_assoc,
1616 foldr_conv_foldl, start_le_sum, elem_le_sum, sum_eq_0_conv.
1617 INCOMPATIBILITY. For the common phrases "%xs. List.foldr plus xs 0"
1618 and "List.foldl plus 0", prefer "List.listsum". Otherwise it can be
1619 useful to boil down "List.foldr" and "List.foldl" to "List.fold" by
1620 unfolding "foldr_conv_fold" and "foldl_conv_fold".
1622 * Dropped lemmas minus_set_foldr, union_set_foldr, union_coset_foldr,
1623 inter_coset_foldr, Inf_fin_set_foldr, Sup_fin_set_foldr,
1624 Min_fin_set_foldr, Max_fin_set_foldr, Inf_set_foldr, Sup_set_foldr,
1625 INF_set_foldr, SUP_set_foldr. INCOMPATIBILITY. Prefer corresponding
1626 lemmas over fold rather than foldr, or make use of lemmas
1627 fold_conv_foldr and fold_rev.
1629 * Congruence rules Option.map_cong and Option.bind_cong for recursion
1630 through option types.
1632 * "Transitive_Closure.ntrancl": bounded transitive closure on
1635 * Constant "Set.not_member" now qualified. INCOMPATIBILITY.
1637 * Theory Int: Discontinued many legacy theorems specific to type int.
1638 INCOMPATIBILITY, use the corresponding generic theorems instead.
1640 zminus_zminus ~> minus_minus
1641 zminus_0 ~> minus_zero
1642 zminus_zadd_distrib ~> minus_add_distrib
1643 zadd_commute ~> add_commute
1644 zadd_assoc ~> add_assoc
1645 zadd_left_commute ~> add_left_commute
1648 zadd_0 ~> add_0_left
1649 zadd_0_right ~> add_0_right
1650 zadd_zminus_inverse2 ~> left_minus
1651 zmult_zminus ~> mult_minus_left
1652 zmult_commute ~> mult_commute
1653 zmult_assoc ~> mult_assoc
1654 zadd_zmult_distrib ~> left_distrib
1655 zadd_zmult_distrib2 ~> right_distrib
1656 zdiff_zmult_distrib ~> left_diff_distrib
1657 zdiff_zmult_distrib2 ~> right_diff_distrib
1658 zmult_1 ~> mult_1_left
1659 zmult_1_right ~> mult_1_right
1660 zle_refl ~> order_refl
1661 zle_trans ~> order_trans
1662 zle_antisym ~> order_antisym
1663 zle_linear ~> linorder_linear
1664 zless_linear ~> linorder_less_linear
1665 zadd_left_mono ~> add_left_mono
1666 zadd_strict_right_mono ~> add_strict_right_mono
1667 zadd_zless_mono ~> add_less_le_mono
1668 int_0_less_1 ~> zero_less_one
1669 int_0_neq_1 ~> zero_neq_one
1671 zpower_zadd_distrib ~> power_add
1672 zero_less_zpower_abs_iff ~> zero_less_power_abs_iff
1673 zero_le_zpower_abs ~> zero_le_power_abs
1675 * Theory Deriv: Renamed
1677 DERIV_nonneg_imp_nonincreasing ~> DERIV_nonneg_imp_nondecreasing
1679 * Theory Library/Multiset: Improved code generation of multisets.
1681 * Theory HOL/Library/Set_Algebras: Addition and multiplication on sets
1682 are expressed via type classes again. The special syntax
1683 \<oplus>/\<otimes> has been replaced by plain +/*. Removed constant
1684 setsum_set, which is now subsumed by Big_Operators.setsum.
1687 * Theory HOL/Library/Diagonalize has been removed. INCOMPATIBILITY,
1688 use theory HOL/Library/Nat_Bijection instead.
1690 * Theory HOL/Library/RBT_Impl: Backing implementation of red-black
1691 trees is now inside a type class context. Names of affected
1692 operations and lemmas have been prefixed by rbt_. INCOMPATIBILITY for
1693 theories working directly with raw red-black trees, adapt the names as
1697 bulkload -> rbt_bulkload
1698 del_from_left -> rbt_del_from_left
1699 del_from_right -> rbt_del_from_right
1701 delete -> rbt_delete
1703 insert -> rbt_insert
1704 insertw -> rbt_insert_with
1705 insert_with_key -> rbt_insert_with_key
1706 map_entry -> rbt_map_entry
1707 lookup -> rbt_lookup
1708 sorted -> rbt_sorted
1709 tree_greater -> rbt_greater
1710 tree_less -> rbt_less
1711 tree_less_symbol -> rbt_less_symbol
1713 union_with -> rbt_union_with
1714 union_with_key -> rbt_union_with_key
1717 balance_left_sorted -> balance_left_rbt_sorted
1718 balance_left_tree_greater -> balance_left_rbt_greater
1719 balance_left_tree_less -> balance_left_rbt_less
1720 balance_right_sorted -> balance_right_rbt_sorted
1721 balance_right_tree_greater -> balance_right_rbt_greater
1722 balance_right_tree_less -> balance_right_rbt_less
1723 balance_sorted -> balance_rbt_sorted
1724 balance_tree_greater -> balance_rbt_greater
1725 balance_tree_less -> balance_rbt_less
1726 bulkload_is_rbt -> rbt_bulkload_is_rbt
1727 combine_sorted -> combine_rbt_sorted
1728 combine_tree_greater -> combine_rbt_greater
1729 combine_tree_less -> combine_rbt_less
1730 delete_in_tree -> rbt_delete_in_tree
1731 delete_is_rbt -> rbt_delete_is_rbt
1732 del_from_left_tree_greater -> rbt_del_from_left_rbt_greater
1733 del_from_left_tree_less -> rbt_del_from_left_rbt_less
1734 del_from_right_tree_greater -> rbt_del_from_right_rbt_greater
1735 del_from_right_tree_less -> rbt_del_from_right_rbt_less
1736 del_in_tree -> rbt_del_in_tree
1737 del_inv1_inv2 -> rbt_del_inv1_inv2
1738 del_sorted -> rbt_del_rbt_sorted
1739 del_tree_greater -> rbt_del_rbt_greater
1740 del_tree_less -> rbt_del_rbt_less
1741 dom_lookup_Branch -> dom_rbt_lookup_Branch
1742 entries_lookup -> entries_rbt_lookup
1743 finite_dom_lookup -> finite_dom_rbt_lookup
1744 insert_sorted -> rbt_insert_rbt_sorted
1745 insertw_is_rbt -> rbt_insertw_is_rbt
1746 insertwk_is_rbt -> rbt_insertwk_is_rbt
1747 insertwk_sorted -> rbt_insertwk_rbt_sorted
1748 insertw_sorted -> rbt_insertw_rbt_sorted
1749 ins_sorted -> ins_rbt_sorted
1750 ins_tree_greater -> ins_rbt_greater
1751 ins_tree_less -> ins_rbt_less
1752 is_rbt_sorted -> is_rbt_rbt_sorted
1753 lookup_balance -> rbt_lookup_balance
1754 lookup_bulkload -> rbt_lookup_rbt_bulkload
1755 lookup_delete -> rbt_lookup_rbt_delete
1756 lookup_Empty -> rbt_lookup_Empty
1757 lookup_from_in_tree -> rbt_lookup_from_in_tree
1758 lookup_in_tree -> rbt_lookup_in_tree
1759 lookup_ins -> rbt_lookup_ins
1760 lookup_insert -> rbt_lookup_rbt_insert
1761 lookup_insertw -> rbt_lookup_rbt_insertw
1762 lookup_insertwk -> rbt_lookup_rbt_insertwk
1763 lookup_keys -> rbt_lookup_keys
1764 lookup_map -> rbt_lookup_map
1765 lookup_map_entry -> rbt_lookup_rbt_map_entry
1766 lookup_tree_greater -> rbt_lookup_rbt_greater
1767 lookup_tree_less -> rbt_lookup_rbt_less
1768 lookup_union -> rbt_lookup_rbt_union
1769 map_entry_color_of -> rbt_map_entry_color_of
1770 map_entry_inv1 -> rbt_map_entry_inv1
1771 map_entry_inv2 -> rbt_map_entry_inv2
1772 map_entry_is_rbt -> rbt_map_entry_is_rbt
1773 map_entry_sorted -> rbt_map_entry_rbt_sorted
1774 map_entry_tree_greater -> rbt_map_entry_rbt_greater
1775 map_entry_tree_less -> rbt_map_entry_rbt_less
1776 map_tree_greater -> map_rbt_greater
1777 map_tree_less -> map_rbt_less
1778 map_sorted -> map_rbt_sorted
1779 paint_sorted -> paint_rbt_sorted
1780 paint_lookup -> paint_rbt_lookup
1781 paint_tree_greater -> paint_rbt_greater
1782 paint_tree_less -> paint_rbt_less
1783 sorted_entries -> rbt_sorted_entries
1784 tree_greater_eq_trans -> rbt_greater_eq_trans
1785 tree_greater_nit -> rbt_greater_nit
1786 tree_greater_prop -> rbt_greater_prop
1787 tree_greater_simps -> rbt_greater_simps
1788 tree_greater_trans -> rbt_greater_trans
1789 tree_less_eq_trans -> rbt_less_eq_trans
1790 tree_less_nit -> rbt_less_nit
1791 tree_less_prop -> rbt_less_prop
1792 tree_less_simps -> rbt_less_simps
1793 tree_less_trans -> rbt_less_trans
1794 tree_ord_props -> rbt_ord_props
1795 union_Branch -> rbt_union_Branch
1796 union_is_rbt -> rbt_union_is_rbt
1797 unionw_is_rbt -> rbt_unionw_is_rbt
1798 unionwk_is_rbt -> rbt_unionwk_is_rbt
1799 unionwk_sorted -> rbt_unionwk_rbt_sorted
1801 * Theory HOL/Library/Float: Floating point numbers are now defined as
1802 a subset of the real numbers. All operations are defined using the
1803 lifing-framework and proofs use the transfer method. INCOMPATIBILITY.
1810 round_down -> float_round_down
1811 round_up -> float_round_up
1815 ceiling_fl, lb_mult, lb_mod, ub_mult, ub_mod
1818 abs_float_def -> Float.compute_float_abs
1819 bitlen_ge0 -> bitlen_nonneg
1820 bitlen.simps -> Float.compute_bitlen
1821 float_components -> Float_mantissa_exponent
1822 float_divl.simps -> Float.compute_float_divl
1823 float_divr.simps -> Float.compute_float_divr
1824 float_eq_odd -> mult_powr_eq_mult_powr_iff
1825 float_power -> real_of_float_power
1826 lapprox_posrat_def -> Float.compute_lapprox_posrat
1827 lapprox_rat.simps -> Float.compute_lapprox_rat
1828 le_float_def' -> Float.compute_float_le
1829 le_float_def -> less_eq_float.rep_eq
1830 less_float_def' -> Float.compute_float_less
1831 less_float_def -> less_float.rep_eq
1832 normfloat_def -> Float.compute_normfloat
1833 normfloat_imp_odd_or_zero -> mantissa_not_dvd and mantissa_noteq_0
1834 normfloat -> normfloat_def
1835 normfloat_unique -> use normfloat_def
1836 number_of_float_Float -> Float.compute_float_numeral, Float.compute_float_neg_numeral
1837 one_float_def -> Float.compute_float_one
1838 plus_float_def -> Float.compute_float_plus
1839 rapprox_posrat_def -> Float.compute_rapprox_posrat
1840 rapprox_rat.simps -> Float.compute_rapprox_rat
1841 real_of_float_0 -> zero_float.rep_eq
1842 real_of_float_1 -> one_float.rep_eq
1843 real_of_float_abs -> abs_float.rep_eq
1844 real_of_float_add -> plus_float.rep_eq
1845 real_of_float_minus -> uminus_float.rep_eq
1846 real_of_float_mult -> times_float.rep_eq
1847 real_of_float_simp -> Float.rep_eq
1848 real_of_float_sub -> minus_float.rep_eq
1849 round_down.simps -> Float.compute_float_round_down
1850 round_up.simps -> Float.compute_float_round_up
1851 times_float_def -> Float.compute_float_times
1852 uminus_float_def -> Float.compute_float_uminus
1853 zero_float_def -> Float.compute_float_zero
1855 Lemmas not necessary anymore, use the transfer method:
1856 bitlen_B0, bitlen_B1, bitlen_ge1, bitlen_Min, bitlen_Pls, float_divl,
1857 float_divr, float_le_simp, float_less1_mantissa_bound,
1858 float_less_simp, float_less_zero, float_le_zero,
1859 float_pos_less1_e_neg, float_pos_m_pos, float_split, float_split2,
1860 floor_pos_exp, lapprox_posrat, lapprox_posrat_bottom, lapprox_rat,
1861 lapprox_rat_bottom, normalized_float, rapprox_posrat,
1862 rapprox_posrat_le1, rapprox_rat, real_of_float_ge0_exp,
1863 real_of_float_neg_exp, real_of_float_nge0_exp, round_down floor_fl,
1864 round_up, zero_le_float, zero_less_float
1866 * New theory HOL/Library/DAList provides an abstract type for
1867 association lists with distinct keys.
1869 * Session HOL/IMP: Added new theory of abstract interpretation of
1872 * Session HOL-Import: Re-implementation from scratch is faster,
1873 simpler, and more scalable. Requires a proof bundle, which is
1874 available as an external component. Discontinued old (and mostly
1875 dead) Importer for HOL4 and HOL Light. INCOMPATIBILITY.
1877 * Session HOL-Word: Discontinued many redundant theorems specific to
1878 type 'a word. INCOMPATIBILITY, use the corresponding generic theorems
1881 word_sub_alt ~> word_sub_wi
1882 word_add_alt ~> word_add_def
1883 word_mult_alt ~> word_mult_def
1884 word_minus_alt ~> word_minus_def
1885 word_0_alt ~> word_0_wi
1886 word_1_alt ~> word_1_wi
1887 word_add_0 ~> add_0_left
1888 word_add_0_right ~> add_0_right
1889 word_mult_1 ~> mult_1_left
1890 word_mult_1_right ~> mult_1_right
1891 word_add_commute ~> add_commute
1892 word_add_assoc ~> add_assoc
1893 word_add_left_commute ~> add_left_commute
1894 word_mult_commute ~> mult_commute
1895 word_mult_assoc ~> mult_assoc
1896 word_mult_left_commute ~> mult_left_commute
1897 word_left_distrib ~> left_distrib
1898 word_right_distrib ~> right_distrib
1899 word_left_minus ~> left_minus
1900 word_diff_0_right ~> diff_0_right
1901 word_diff_self ~> diff_self
1902 word_sub_def ~> diff_minus
1903 word_diff_minus ~> diff_minus
1904 word_add_ac ~> add_ac
1905 word_mult_ac ~> mult_ac
1906 word_plus_ac0 ~> add_0_left add_0_right add_ac
1907 word_times_ac1 ~> mult_1_left mult_1_right mult_ac
1908 word_order_trans ~> order_trans
1909 word_order_refl ~> order_refl
1910 word_order_antisym ~> order_antisym
1911 word_order_linear ~> linorder_linear
1912 lenw1_zero_neq_one ~> zero_neq_one
1913 word_number_of_eq ~> number_of_eq
1914 word_of_int_add_hom ~> wi_hom_add
1915 word_of_int_sub_hom ~> wi_hom_sub
1916 word_of_int_mult_hom ~> wi_hom_mult
1917 word_of_int_minus_hom ~> wi_hom_neg
1918 word_of_int_succ_hom ~> wi_hom_succ
1919 word_of_int_pred_hom ~> wi_hom_pred
1920 word_of_int_0_hom ~> word_0_wi
1921 word_of_int_1_hom ~> word_1_wi
1923 * Session HOL-Word: New proof method "word_bitwise" for splitting
1924 machine word equalities and inequalities into logical circuits,
1925 defined in HOL/Word/WordBitwise.thy. Supports addition, subtraction,
1926 multiplication, shifting by constants, bitwise operators and numeric
1927 constants. Requires fixed-length word types, not 'a word. Solves
1928 many standard word identities outright and converts more into first
1929 order problems amenable to blast or similar. See also examples in
1930 HOL/Word/Examples/WordExamples.thy.
1932 * Session HOL-Probability: Introduced the type "'a measure" to
1933 represent measures, this replaces the records 'a algebra and 'a
1934 measure_space. The locales based on subset_class now have two
1935 locale-parameters the space \<Omega> and the set of measurable sets M.
1936 The product of probability spaces uses now the same constant as the
1937 finite product of sigma-finite measure spaces "PiM :: ('i => 'a)
1938 measure". Most constants are defined now outside of locales and gain
1939 an additional parameter, like null_sets, almost_eventually or \<mu>'.
1940 Measure space constructions for distributions and densities now got
1941 their own constants distr and density. Instead of using locales to
1942 describe measure spaces with a finite space, the measure count_space
1943 and point_measure is introduced. INCOMPATIBILITY.
1947 finite_measure.\<mu>' -> measure
1948 product_algebra_generator -> prod_algebra
1949 product_prob_space.emb -> prod_emb
1950 product_prob_space.infprod_algebra -> PiM
1953 completeable_measure_space
1954 finite_measure_space
1956 finite_product_finite_prob_space
1957 finite_product_sigma_algebra
1958 finite_sigma_algebra
1960 pair_finite_prob_space
1961 pair_finite_sigma_algebra
1964 product_sigma_algebra
1968 distribution -> use distr measure, or distributed predicate
1970 joint_distribution -> use distr measure, or distributed predicate
1971 pair_measure_generator
1972 product_prob_space.infprod_algebra -> use PiM
1975 Replacement theorems:
1976 finite_additivity_sufficient -> ring_of_sets.countably_additiveI_finite
1977 finite_measure.empty_measure -> measure_empty
1978 finite_measure.finite_continuity_from_above -> finite_measure.finite_Lim_measure_decseq
1979 finite_measure.finite_continuity_from_below -> finite_measure.finite_Lim_measure_incseq
1980 finite_measure.finite_measure_countably_subadditive -> finite_measure.finite_measure_subadditive_countably
1981 finite_measure.finite_measure_eq -> finite_measure.emeasure_eq_measure
1982 finite_measure.finite_measure -> finite_measure.emeasure_finite
1983 finite_measure.finite_measure_finite_singleton -> finite_measure.finite_measure_eq_setsum_singleton
1984 finite_measure.positive_measure' -> measure_nonneg
1985 finite_measure.real_measure -> finite_measure.emeasure_real
1986 finite_product_prob_space.finite_measure_times -> finite_product_prob_space.finite_measure_PiM_emb
1987 finite_product_sigma_algebra.in_P -> sets_PiM_I_finite
1988 finite_product_sigma_algebra.P_empty -> space_PiM_empty, sets_PiM_empty
1989 information_space.conditional_entropy_eq -> information_space.conditional_entropy_simple_distributed
1990 information_space.conditional_entropy_positive -> information_space.conditional_entropy_nonneg_simple
1991 information_space.conditional_mutual_information_eq_mutual_information -> information_space.conditional_mutual_information_eq_mutual_information_simple
1992 information_space.conditional_mutual_information_generic_positive -> information_space.conditional_mutual_information_nonneg_simple
1993 information_space.conditional_mutual_information_positive -> information_space.conditional_mutual_information_nonneg_simple
1994 information_space.entropy_commute -> information_space.entropy_commute_simple
1995 information_space.entropy_eq -> information_space.entropy_simple_distributed
1996 information_space.entropy_generic_eq -> information_space.entropy_simple_distributed
1997 information_space.entropy_positive -> information_space.entropy_nonneg_simple
1998 information_space.entropy_uniform_max -> information_space.entropy_uniform
1999 information_space.KL_eq_0_imp -> information_space.KL_eq_0_iff_eq
2000 information_space.KL_eq_0 -> information_space.KL_same_eq_0
2001 information_space.KL_ge_0 -> information_space.KL_nonneg
2002 information_space.mutual_information_eq -> information_space.mutual_information_simple_distributed
2003 information_space.mutual_information_positive -> information_space.mutual_information_nonneg_simple
2004 Int_stable_cuboids -> Int_stable_atLeastAtMost
2005 Int_stable_product_algebra_generator -> positive_integral
2006 measure_preserving -> equality "distr M N f = N" "f : measurable M N"
2007 measure_space.additive -> emeasure_additive
2008 measure_space.AE_iff_null_set -> AE_iff_null
2009 measure_space.almost_everywhere_def -> eventually_ae_filter
2010 measure_space.almost_everywhere_vimage -> AE_distrD
2011 measure_space.continuity_from_above -> INF_emeasure_decseq
2012 measure_space.continuity_from_above_Lim -> Lim_emeasure_decseq
2013 measure_space.continuity_from_below_Lim -> Lim_emeasure_incseq
2014 measure_space.continuity_from_below -> SUP_emeasure_incseq
2015 measure_space_density -> emeasure_density
2016 measure_space.density_is_absolutely_continuous -> absolutely_continuousI_density
2017 measure_space.integrable_vimage -> integrable_distr
2018 measure_space.integral_translated_density -> integral_density
2019 measure_space.integral_vimage -> integral_distr
2020 measure_space.measure_additive -> plus_emeasure
2021 measure_space.measure_compl -> emeasure_compl
2022 measure_space.measure_countable_increasing -> emeasure_countable_increasing
2023 measure_space.measure_countably_subadditive -> emeasure_subadditive_countably
2024 measure_space.measure_decseq -> decseq_emeasure
2025 measure_space.measure_Diff -> emeasure_Diff
2026 measure_space.measure_Diff_null_set -> emeasure_Diff_null_set
2027 measure_space.measure_eq_0 -> emeasure_eq_0
2028 measure_space.measure_finitely_subadditive -> emeasure_subadditive_finite
2029 measure_space.measure_finite_singleton -> emeasure_eq_setsum_singleton
2030 measure_space.measure_incseq -> incseq_emeasure
2031 measure_space.measure_insert -> emeasure_insert
2032 measure_space.measure_mono -> emeasure_mono
2033 measure_space.measure_not_negative -> emeasure_not_MInf
2034 measure_space.measure_preserving_Int_stable -> measure_eqI_generator_eq
2035 measure_space.measure_setsum -> setsum_emeasure
2036 measure_space.measure_setsum_split -> setsum_emeasure_cover
2037 measure_space.measure_space_vimage -> emeasure_distr
2038 measure_space.measure_subadditive_finite -> emeasure_subadditive_finite
2039 measure_space.measure_subadditive -> subadditive
2040 measure_space.measure_top -> emeasure_space
2041 measure_space.measure_UN_eq_0 -> emeasure_UN_eq_0
2042 measure_space.measure_Un_null_set -> emeasure_Un_null_set
2043 measure_space.positive_integral_translated_density -> positive_integral_density
2044 measure_space.positive_integral_vimage -> positive_integral_distr
2045 measure_space.real_continuity_from_above -> Lim_measure_decseq
2046 measure_space.real_continuity_from_below -> Lim_measure_incseq
2047 measure_space.real_measure_countably_subadditive -> measure_subadditive_countably
2048 measure_space.real_measure_Diff -> measure_Diff
2049 measure_space.real_measure_finite_Union -> measure_finite_Union
2050 measure_space.real_measure_setsum_singleton -> measure_eq_setsum_singleton
2051 measure_space.real_measure_subadditive -> measure_subadditive
2052 measure_space.real_measure_Union -> measure_Union
2053 measure_space.real_measure_UNION -> measure_UNION
2054 measure_space.simple_function_vimage -> simple_function_comp
2055 measure_space.simple_integral_vimage -> simple_integral_distr
2056 measure_space.simple_integral_vimage -> simple_integral_distr
2057 measure_unique_Int_stable -> measure_eqI_generator_eq
2058 measure_unique_Int_stable_vimage -> measure_eqI_generator_eq
2059 pair_sigma_algebra.measurable_cut_fst -> sets_Pair1
2060 pair_sigma_algebra.measurable_cut_snd -> sets_Pair2
2061 pair_sigma_algebra.measurable_pair_image_fst -> measurable_Pair1
2062 pair_sigma_algebra.measurable_pair_image_snd -> measurable_Pair2
2063 pair_sigma_algebra.measurable_product_swap -> measurable_pair_swap_iff
2064 pair_sigma_algebra.pair_sigma_algebra_measurable -> measurable_pair_swap
2065 pair_sigma_algebra.pair_sigma_algebra_swap_measurable -> measurable_pair_swap'
2066 pair_sigma_algebra.sets_swap -> sets_pair_swap
2067 pair_sigma_finite.measure_cut_measurable_fst -> pair_sigma_finite.measurable_emeasure_Pair1
2068 pair_sigma_finite.measure_cut_measurable_snd -> pair_sigma_finite.measurable_emeasure_Pair2
2069 pair_sigma_finite.measure_preserving_swap -> pair_sigma_finite.distr_pair_swap
2070 pair_sigma_finite.pair_measure_alt2 -> pair_sigma_finite.emeasure_pair_measure_alt2
2071 pair_sigma_finite.pair_measure_alt -> pair_sigma_finite.emeasure_pair_measure_alt
2072 pair_sigma_finite.pair_measure_times -> pair_sigma_finite.emeasure_pair_measure_Times
2073 prob_space.indep_distribution_eq_measure -> prob_space.indep_vars_iff_distr_eq_PiM
2074 prob_space.indep_var_distributionD -> prob_space.indep_var_distribution_eq
2075 prob_space.measure_space_1 -> prob_space.emeasure_space_1
2076 prob_space.prob_space_vimage -> prob_space_distr
2077 prob_space.random_variable_restrict -> measurable_restrict
2078 prob_space_unique_Int_stable -> measure_eqI_prob_space
2079 product_algebraE -> prod_algebraE_all
2080 product_algebra_generator_der -> prod_algebra_eq_finite
2081 product_algebra_generator_into_space -> prod_algebra_sets_into_space
2082 product_algebraI -> sets_PiM_I_finite
2083 product_measure_exists -> product_sigma_finite.sigma_finite
2084 product_prob_space.finite_index_eq_finite_product -> product_prob_space.sets_PiM_generator
2085 product_prob_space.finite_measure_infprod_emb_Pi -> product_prob_space.measure_PiM_emb
2086 product_prob_space.infprod_spec -> product_prob_space.emeasure_PiM_emb_not_empty
2087 product_prob_space.measurable_component -> measurable_component_singleton
2088 product_prob_space.measurable_emb -> measurable_prod_emb
2089 product_prob_space.measurable_into_infprod_algebra -> measurable_PiM_single
2090 product_prob_space.measurable_singleton_infprod -> measurable_component_singleton
2091 product_prob_space.measure_emb -> emeasure_prod_emb
2092 product_prob_space.measure_preserving_restrict -> product_prob_space.distr_restrict
2093 product_sigma_algebra.product_algebra_into_space -> space_closed
2094 product_sigma_finite.measure_fold -> product_sigma_finite.distr_merge
2095 product_sigma_finite.measure_preserving_component_singelton -> product_sigma_finite.distr_singleton
2096 product_sigma_finite.measure_preserving_merge -> product_sigma_finite.distr_merge
2097 sequence_space.measure_infprod -> sequence_space.measure_PiM_countable
2098 sets_product_algebra -> sets_PiM
2099 sigma_algebra.measurable_sigma -> measurable_measure_of
2100 sigma_finite_measure.disjoint_sigma_finite -> sigma_finite_disjoint
2101 sigma_finite_measure.RN_deriv_vimage -> sigma_finite_measure.RN_deriv_distr
2102 sigma_product_algebra_sigma_eq -> sigma_prod_algebra_sigma_eq
2103 space_product_algebra -> space_PiM
2105 * Session HOL-TPTP: support to parse and import TPTP problems (all
2106 languages) into Isabelle/HOL.
2111 * New "case_product" attribute (see HOL).
2116 * Greater support for structured proofs involving induction or case
2119 * Much greater use of mathematical symbols.
2121 * Removal of many ML theorem bindings. INCOMPATIBILITY.
2126 * Antiquotation @{keyword "name"} produces a parser for outer syntax
2127 from a minor keyword introduced via theory header declaration.
2129 * Antiquotation @{command_spec "name"} produces the
2130 Outer_Syntax.command_spec from a major keyword introduced via theory
2131 header declaration; it can be passed to Outer_Syntax.command etc.
2133 * Local_Theory.define no longer hard-wires default theorem name
2134 "foo_def", but retains the binding as given. If that is Binding.empty
2135 / Attrib.empty_binding, the result is not registered as user-level
2136 fact. The Local_Theory.define_internal variant allows to specify a
2137 non-empty name (used for the foundation in the background theory),
2138 while omitting the fact binding in the user-context. Potential
2139 INCOMPATIBILITY for derived definitional packages: need to specify
2140 naming policy for primitive definitions more explicitly.
2142 * Renamed Thm.capply to Thm.apply, and Thm.cabs to Thm.lambda in
2143 conformance with similar operations in structure Term and Logic.
2145 * Antiquotation @{attributes [...]} embeds attribute source
2146 representation into the ML text, which is particularly useful with
2147 declarations like Local_Theory.note.
2149 * Structure Proof_Context follows standard naming scheme. Old
2150 ProofContext has been discontinued. INCOMPATIBILITY.
2152 * Refined Local_Theory.declaration {syntax, pervasive}, with subtle
2153 change of semantics: update is applied to auxiliary local theory
2156 * Modernized some old-style infix operations:
2158 addeqcongs ~> Simplifier.add_eqcong
2159 deleqcongs ~> Simplifier.del_eqcong
2160 addcongs ~> Simplifier.add_cong
2161 delcongs ~> Simplifier.del_cong
2162 setmksimps ~> Simplifier.set_mksimps
2163 setmkcong ~> Simplifier.set_mkcong
2164 setmksym ~> Simplifier.set_mksym
2165 setmkeqTrue ~> Simplifier.set_mkeqTrue
2166 settermless ~> Simplifier.set_termless
2167 setsubgoaler ~> Simplifier.set_subgoaler
2168 addsplits ~> Splitter.add_split
2169 delsplits ~> Splitter.del_split
2174 * USER_HOME settings variable points to cross-platform user home
2175 directory, which coincides with HOME on POSIX systems only. Likewise,
2176 the Isabelle path specification "~" now expands to $USER_HOME, instead
2177 of former $HOME. A different default for USER_HOME may be set
2178 explicitly in shell environment, before Isabelle settings are
2179 evaluated. Minor INCOMPATIBILITY: need to adapt Isabelle path where
2180 the generic user home was intended.
2182 * ISABELLE_HOME_WINDOWS refers to ISABELLE_HOME in windows file name
2183 notation, which is useful for the jEdit file browser, for example.
2185 * ISABELLE_JDK_HOME settings variable points to JDK with javac and jar
2190 New in Isabelle2011-1 (October 2011)
2191 ------------------------------------
2195 * Improved Isabelle/jEdit Prover IDE (PIDE), which can be invoked as
2196 "isabelle jedit" or "ISABELLE_HOME/Isabelle" on the command line.
2198 - Management of multiple theory files directly from the editor
2199 buffer store -- bypassing the file-system (no requirement to save
2200 files for checking).
2202 - Markup of formal entities within the text buffer, with semantic
2203 highlighting, tooltips and hyperlinks to jump to defining source
2206 - Improved text rendering, with sub/superscripts in the source
2207 buffer (including support for copy/paste wrt. output panel, HTML
2208 theory output and other non-Isabelle text boxes).
2210 - Refined scheduling of proof checking and printing of results,
2211 based on interactive editor view. (Note: jEdit folding and
2212 narrowing allows to restrict buffer perspectives explicitly.)
2214 - Reduced CPU performance requirements, usable on machines with few
2217 - Reduced memory requirements due to pruning of unused document
2218 versions (garbage collection).
2220 See also ~~/src/Tools/jEdit/README.html for further information,
2221 including some remaining limitations.
2223 * Theory loader: source files are exclusively located via the master
2224 directory of each theory node (where the .thy file itself resides).
2225 The global load path (such as src/HOL/Library) has been discontinued.
2226 Note that the path element ~~ may be used to reference theories in the
2227 Isabelle home folder -- for instance, "~~/src/HOL/Library/FuncSet".
2230 * Theory loader: source files are identified by content via SHA1
2231 digests. Discontinued former path/modtime identification and optional
2232 ISABELLE_FILE_IDENT plugin scripts.
2234 * Parallelization of nested Isar proofs is subject to
2235 Goal.parallel_proofs_threshold (default 100). See also isabelle
2238 * Name space: former unsynchronized references are now proper
2239 configuration options, with more conventional names:
2241 long_names ~> names_long
2242 short_names ~> names_short
2243 unique_names ~> names_unique
2245 Minor INCOMPATIBILITY, need to declare options in context like this:
2247 declare [[names_unique = false]]
2249 * Literal facts `prop` may contain dummy patterns, e.g. `_ = _`. Note
2250 that the result needs to be unique, which means fact specifications
2251 may have to be refined after enriching a proof context.
2253 * Attribute "case_names" has been refined: the assumptions in each case
2254 can be named now by following the case name with [name1 name2 ...].
2256 * Isabelle/Isar reference manual has been updated and extended:
2257 - "Synopsis" provides a catalog of main Isar language concepts.
2258 - Formal references in syntax diagrams, via @{rail} antiquotation.
2259 - Updated material from classic "ref" manual, notably about
2260 "Classical Reasoner".
2265 * Class bot and top require underlying partial order rather than
2266 preorder: uniqueness of bot and top is guaranteed. INCOMPATIBILITY.
2268 * Class complete_lattice: generalized a couple of lemmas from sets;
2269 generalized theorems INF_cong and SUP_cong. New type classes for
2270 complete boolean algebras and complete linear orders. Lemmas
2271 Inf_less_iff, less_Sup_iff, INF_less_iff, less_SUP_iff now reside in
2272 class complete_linorder.
2274 Changed proposition of lemmas Inf_bool_def, Sup_bool_def, Inf_fun_def,
2275 Sup_fun_def, Inf_apply, Sup_apply.
2277 Removed redundant lemmas (the right hand side gives hints how to
2278 replace them for (metis ...), or (simp only: ...) proofs):
2280 Inf_singleton ~> Inf_insert [where A="{}", unfolded Inf_empty inf_top_right]
2281 Sup_singleton ~> Sup_insert [where A="{}", unfolded Sup_empty sup_bot_right]
2282 Inf_binary ~> Inf_insert, Inf_empty, and inf_top_right
2283 Sup_binary ~> Sup_insert, Sup_empty, and sup_bot_right
2284 Int_eq_Inter ~> Inf_insert, Inf_empty, and inf_top_right
2285 Un_eq_Union ~> Sup_insert, Sup_empty, and sup_bot_right
2286 Inter_def ~> INF_def, image_def
2287 Union_def ~> SUP_def, image_def
2288 INT_eq ~> INF_def, and image_def
2289 UN_eq ~> SUP_def, and image_def
2290 INF_subset ~> INF_superset_mono [OF _ order_refl]
2292 More consistent and comprehensive names:
2294 INTER_eq_Inter_image ~> INF_def
2295 UNION_eq_Union_image ~> SUP_def
2298 INF_leI ~> INF_lower
2299 INF_leI2 ~> INF_lower2
2300 le_INFI ~> INF_greatest
2301 le_SUPI ~> SUP_upper
2302 le_SUPI2 ~> SUP_upper2
2303 SUP_leI ~> SUP_least
2304 INFI_bool_eq ~> INF_bool_eq
2305 SUPR_bool_eq ~> SUP_bool_eq
2306 INFI_apply ~> INF_apply
2307 SUPR_apply ~> SUP_apply
2308 INTER_def ~> INTER_eq
2309 UNION_def ~> UNION_eq
2313 * Renamed theory Complete_Lattice to Complete_Lattices.
2316 * Theory Complete_Lattices: lemmas Inf_eq_top_iff, INF_eq_top_iff,
2317 INF_image, Inf_insert, INF_top, Inf_top_conv, INF_top_conv, SUP_bot,
2318 Sup_bot_conv, SUP_bot_conv, Sup_eq_top_iff, SUP_eq_top_iff, SUP_image,
2319 Sup_insert are now declared as [simp]. INCOMPATIBILITY.
2321 * Theory Lattice: lemmas compl_inf_bot, compl_le_comp_iff,
2322 compl_sup_top, inf_idem, inf_left_idem, inf_sup_absorb, sup_idem,
2323 sup_inf_absob, sup_left_idem are now declared as [simp]. Minor
2326 * Added syntactic classes "inf" and "sup" for the respective
2327 constants. INCOMPATIBILITY: Changes in the argument order of the
2328 (mostly internal) locale predicates for some derived classes.
2330 * Theorem collections ball_simps and bex_simps do not contain theorems
2331 referring to UNION any longer; these have been moved to collection
2332 UN_ball_bex_simps. INCOMPATIBILITY.
2334 * Theory Archimedean_Field: floor now is defined as parameter of a
2335 separate type class floor_ceiling.
2337 * Theory Finite_Set: more coherent development of fold_set locales:
2339 locale fun_left_comm ~> locale comp_fun_commute
2340 locale fun_left_comm_idem ~> locale comp_fun_idem
2342 Both use point-free characterization; interpretation proofs may need
2343 adjustment. INCOMPATIBILITY.
2345 * Theory Limits: Type "'a net" has been renamed to "'a filter", in
2346 accordance with standard mathematical terminology. INCOMPATIBILITY.
2348 * Theory Complex_Main: The locale interpretations for the
2349 bounded_linear and bounded_bilinear locales have been removed, in
2350 order to reduce the number of duplicate lemmas. Users must use the
2351 original names for distributivity theorems, potential INCOMPATIBILITY.
2353 divide.add ~> add_divide_distrib
2354 divide.diff ~> diff_divide_distrib
2355 divide.setsum ~> setsum_divide_distrib
2356 mult.add_right ~> right_distrib
2357 mult.diff_right ~> right_diff_distrib
2358 mult_right.setsum ~> setsum_right_distrib
2359 mult_left.diff ~> left_diff_distrib
2361 * Theory Complex_Main: Several redundant theorems have been removed or
2362 replaced by more general versions. INCOMPATIBILITY.
2364 real_diff_def ~> minus_real_def
2365 real_divide_def ~> divide_real_def
2366 real_less_def ~> less_le
2367 real_abs_def ~> abs_real_def
2368 real_sgn_def ~> sgn_real_def
2369 real_mult_commute ~> mult_commute
2370 real_mult_assoc ~> mult_assoc
2371 real_mult_1 ~> mult_1_left
2372 real_add_mult_distrib ~> left_distrib
2373 real_zero_not_eq_one ~> zero_neq_one
2374 real_mult_inverse_left ~> left_inverse
2375 INVERSE_ZERO ~> inverse_zero
2376 real_le_refl ~> order_refl
2377 real_le_antisym ~> order_antisym
2378 real_le_trans ~> order_trans
2379 real_le_linear ~> linear
2380 real_le_eq_diff ~> le_iff_diff_le_0
2381 real_add_left_mono ~> add_left_mono
2382 real_mult_order ~> mult_pos_pos
2383 real_mult_less_mono2 ~> mult_strict_left_mono
2384 real_of_int_real_of_nat ~> real_of_int_of_nat_eq
2385 real_0_le_divide_iff ~> zero_le_divide_iff
2386 realpow_two_disj ~> power2_eq_iff
2387 real_squared_diff_one_factored ~> square_diff_one_factored
2388 realpow_two_diff ~> square_diff_square_factored
2389 reals_complete2 ~> complete_real
2390 real_sum_squared_expand ~> power2_sum
2391 exp_ln_eq ~> ln_unique
2393 expi_zero ~> exp_zero
2394 lemma_DERIV_subst ~> DERIV_cong
2395 LIMSEQ_Zfun_iff ~> tendsto_Zfun_iff
2396 LIMSEQ_const ~> tendsto_const
2397 LIMSEQ_norm ~> tendsto_norm
2398 LIMSEQ_add ~> tendsto_add
2399 LIMSEQ_minus ~> tendsto_minus
2400 LIMSEQ_minus_cancel ~> tendsto_minus_cancel
2401 LIMSEQ_diff ~> tendsto_diff
2402 bounded_linear.LIMSEQ ~> bounded_linear.tendsto
2403 bounded_bilinear.LIMSEQ ~> bounded_bilinear.tendsto
2404 LIMSEQ_mult ~> tendsto_mult
2405 LIMSEQ_inverse ~> tendsto_inverse
2406 LIMSEQ_divide ~> tendsto_divide
2407 LIMSEQ_pow ~> tendsto_power
2408 LIMSEQ_setsum ~> tendsto_setsum
2409 LIMSEQ_setprod ~> tendsto_setprod
2410 LIMSEQ_norm_zero ~> tendsto_norm_zero_iff
2411 LIMSEQ_rabs_zero ~> tendsto_rabs_zero_iff
2412 LIMSEQ_imp_rabs ~> tendsto_rabs
2413 LIMSEQ_add_minus ~> tendsto_add [OF _ tendsto_minus]
2414 LIMSEQ_add_const ~> tendsto_add [OF _ tendsto_const]
2415 LIMSEQ_diff_const ~> tendsto_diff [OF _ tendsto_const]
2416 LIMSEQ_Complex ~> tendsto_Complex
2417 LIM_ident ~> tendsto_ident_at
2418 LIM_const ~> tendsto_const
2419 LIM_add ~> tendsto_add
2420 LIM_add_zero ~> tendsto_add_zero
2421 LIM_minus ~> tendsto_minus
2422 LIM_diff ~> tendsto_diff
2423 LIM_norm ~> tendsto_norm
2424 LIM_norm_zero ~> tendsto_norm_zero
2425 LIM_norm_zero_cancel ~> tendsto_norm_zero_cancel
2426 LIM_norm_zero_iff ~> tendsto_norm_zero_iff
2427 LIM_rabs ~> tendsto_rabs
2428 LIM_rabs_zero ~> tendsto_rabs_zero
2429 LIM_rabs_zero_cancel ~> tendsto_rabs_zero_cancel
2430 LIM_rabs_zero_iff ~> tendsto_rabs_zero_iff
2431 LIM_compose ~> tendsto_compose
2432 LIM_mult ~> tendsto_mult
2433 LIM_scaleR ~> tendsto_scaleR
2434 LIM_of_real ~> tendsto_of_real
2435 LIM_power ~> tendsto_power
2436 LIM_inverse ~> tendsto_inverse
2437 LIM_sgn ~> tendsto_sgn
2438 isCont_LIM_compose ~> isCont_tendsto_compose
2439 bounded_linear.LIM ~> bounded_linear.tendsto
2440 bounded_linear.LIM_zero ~> bounded_linear.tendsto_zero
2441 bounded_bilinear.LIM ~> bounded_bilinear.tendsto
2442 bounded_bilinear.LIM_prod_zero ~> bounded_bilinear.tendsto_zero
2443 bounded_bilinear.LIM_left_zero ~> bounded_bilinear.tendsto_left_zero
2444 bounded_bilinear.LIM_right_zero ~> bounded_bilinear.tendsto_right_zero
2445 LIM_inverse_fun ~> tendsto_inverse [OF tendsto_ident_at]
2447 * Theory Complex_Main: The definition of infinite series was
2448 generalized. Now it is defined on the type class {topological_space,
2449 comm_monoid_add}. Hence it is useable also for extended real numbers.
2451 * Theory Complex_Main: The complex exponential function "expi" is now
2452 a type-constrained abbreviation for "exp :: complex => complex"; thus
2453 several polymorphic lemmas about "exp" are now applicable to "expi".
2457 - Theory Library/Code_Char_ord provides native ordering of
2458 characters in the target language.
2460 - Commands code_module and code_library are legacy, use export_code
2463 - Method "evaluation" is legacy, use method "eval" instead.
2465 - Legacy evaluator "SML" is deactivated by default. May be
2466 reactivated by the following theory command:
2468 setup {* Value.add_evaluator ("SML", Codegen.eval_term) *}
2470 * Declare ext [intro] by default. Rare INCOMPATIBILITY.
2472 * New proof method "induction" that gives induction hypotheses the
2473 name "IH", thus distinguishing them from further hypotheses that come
2474 from rule induction. The latter are still called "hyps". Method
2475 "induction" is a thin wrapper around "induct" and follows the same
2478 * Method "fastsimp" has been renamed to "fastforce", but "fastsimp" is
2479 still available as a legacy feature for some time.
2482 - Added "need" and "total_consts" options.
2483 - Reintroduced "show_skolems" option by popular demand.
2484 - Renamed attribute: nitpick_def ~> nitpick_unfold.
2488 - Use quasi-sound (and efficient) translations by default.
2489 - Added support for the following provers: E-ToFoF, LEO-II,
2490 Satallax, SNARK, Waldmeister, and Z3 with TPTP syntax.
2491 - Automatically preplay and minimize proofs before showing them if
2492 this can be done within reasonable time.
2493 - sledgehammer available_provers ~> sledgehammer supported_provers.
2495 - Added "preplay_timeout", "slicing", "type_enc", "sound",
2496 "max_mono_iters", and "max_new_mono_instances" options.
2497 - Removed "explicit_apply" and "full_types" options as well as "Full
2498 Types" Proof General menu item. INCOMPATIBILITY.
2501 - Removed "metisF" -- use "metis" instead. INCOMPATIBILITY.
2502 - Obsoleted "metisFT" -- use "metis (full_types)" instead.
2506 - Renamed 'try_methods' and added "simp:", "intro:", "dest:", and
2507 "elim:" options. INCOMPATIBILITY.
2508 - Introduced 'try' that not only runs 'try_methods' but also
2509 'solve_direct', 'sledgehammer', 'quickcheck', and 'nitpick'.
2512 - Added "eval" option to evaluate terms for the found counterexample
2513 (currently only supported by the default (exhaustive) tester).
2514 - Added post-processing of terms to obtain readable counterexamples
2515 (currently only supported by the default (exhaustive) tester).
2516 - New counterexample generator quickcheck[narrowing] enables
2517 narrowing-based testing. Requires the Glasgow Haskell compiler
2518 with its installation location defined in the Isabelle settings
2519 environment as ISABELLE_GHC.
2520 - Removed quickcheck tester "SML" based on the SML code generator
2521 (formly in HOL/Library).
2523 * Function package: discontinued option "tailrec". INCOMPATIBILITY,
2524 use 'partial_function' instead.
2526 * Theory Library/Extended_Reals replaces now the positive extended
2527 reals found in probability theory. This file is extended by
2528 Multivariate_Analysis/Extended_Real_Limits.
2530 * Theory Library/Old_Recdef: old 'recdef' package has been moved here,
2531 from where it must be imported explicitly if it is really required.
2534 * Theory Library/Wfrec: well-founded recursion combinator "wfrec" has
2535 been moved here. INCOMPATIBILITY.
2537 * Theory Library/Saturated provides type of numbers with saturated
2540 * Theory Library/Product_Lattice defines a pointwise ordering for the
2541 product type 'a * 'b, and provides instance proofs for various order
2542 and lattice type classes.
2544 * Theory Library/Countable now provides the "countable_datatype" proof
2545 method for proving "countable" class instances for datatypes.
2547 * Theory Library/Cset_Monad allows do notation for computable sets
2548 (cset) via the generic monad ad-hoc overloading facility.
2550 * Library: Theories of common data structures are split into theories
2551 for implementation, an invariant-ensuring type, and connection to an
2552 abstract type. INCOMPATIBILITY.
2554 - RBT is split into RBT and RBT_Mapping.
2555 - AssocList is split and renamed into AList and AList_Mapping.
2556 - DList is split into DList_Impl, DList, and DList_Cset.
2557 - Cset is split into Cset and List_Cset.
2559 * Theory Library/Nat_Infinity has been renamed to
2560 Library/Extended_Nat, with name changes of the following types and
2563 type inat ~> type enat
2565 Infty ~> infinity (overloaded)
2569 Every theorem name containing "inat", "Fin", "Infty", or "iSuc" has
2570 been renamed accordingly. INCOMPATIBILITY.
2572 * Session Multivariate_Analysis: The euclidean_space type class now
2573 fixes a constant "Basis :: 'a set" consisting of the standard
2574 orthonormal basis for the type. Users now have the option of
2575 quantifying over this set instead of using the "basis" function, e.g.
2576 "ALL x:Basis. P x" vs "ALL i<DIM('a). P (basis i)".
2578 * Session Multivariate_Analysis: Type "('a, 'b) cart" has been renamed
2579 to "('a, 'b) vec" (the syntax "'a ^ 'b" remains unaffected). Constants
2580 "Cart_nth" and "Cart_lambda" have been respectively renamed to
2581 "vec_nth" and "vec_lambda"; theorems mentioning those names have
2582 changed to match. Definition theorems for overloaded constants now use
2583 the standard "foo_vec_def" naming scheme. A few other theorems have
2584 been renamed as follows (INCOMPATIBILITY):
2586 Cart_eq ~> vec_eq_iff
2587 dist_nth_le_cart ~> dist_vec_nth_le
2588 tendsto_vector ~> vec_tendstoI
2589 Cauchy_vector ~> vec_CauchyI
2591 * Session Multivariate_Analysis: Several duplicate theorems have been
2592 removed, and other theorems have been renamed or replaced with more
2593 general versions. INCOMPATIBILITY.
2595 finite_choice ~> finite_set_choice
2596 eventually_conjI ~> eventually_conj
2597 eventually_and ~> eventually_conj_iff
2598 eventually_false ~> eventually_False
2599 setsum_norm ~> norm_setsum
2600 Lim_sequentially ~> LIMSEQ_def
2601 Lim_ident_at ~> LIM_ident
2602 Lim_const ~> tendsto_const
2603 Lim_cmul ~> tendsto_scaleR [OF tendsto_const]
2604 Lim_neg ~> tendsto_minus
2605 Lim_add ~> tendsto_add
2606 Lim_sub ~> tendsto_diff
2607 Lim_mul ~> tendsto_scaleR
2608 Lim_vmul ~> tendsto_scaleR [OF _ tendsto_const]
2609 Lim_null_norm ~> tendsto_norm_zero_iff [symmetric]
2610 Lim_linear ~> bounded_linear.tendsto
2611 Lim_component ~> tendsto_euclidean_component
2612 Lim_component_cart ~> tendsto_vec_nth
2613 Lim_inner ~> tendsto_inner [OF tendsto_const]
2614 dot_lsum ~> inner_setsum_left
2615 dot_rsum ~> inner_setsum_right
2616 continuous_cmul ~> continuous_scaleR [OF continuous_const]
2617 continuous_neg ~> continuous_minus
2618 continuous_sub ~> continuous_diff
2619 continuous_vmul ~> continuous_scaleR [OF _ continuous_const]
2620 continuous_mul ~> continuous_scaleR
2621 continuous_inv ~> continuous_inverse
2622 continuous_at_within_inv ~> continuous_at_within_inverse
2623 continuous_at_inv ~> continuous_at_inverse
2624 continuous_at_norm ~> continuous_norm [OF continuous_at_id]
2625 continuous_at_infnorm ~> continuous_infnorm [OF continuous_at_id]
2626 continuous_at_component ~> continuous_component [OF continuous_at_id]
2627 continuous_on_neg ~> continuous_on_minus
2628 continuous_on_sub ~> continuous_on_diff
2629 continuous_on_cmul ~> continuous_on_scaleR [OF continuous_on_const]
2630 continuous_on_vmul ~> continuous_on_scaleR [OF _ continuous_on_const]
2631 continuous_on_mul ~> continuous_on_scaleR
2632 continuous_on_mul_real ~> continuous_on_mult
2633 continuous_on_inner ~> continuous_on_inner [OF continuous_on_const]
2634 continuous_on_norm ~> continuous_on_norm [OF continuous_on_id]
2635 continuous_on_inverse ~> continuous_on_inv
2636 uniformly_continuous_on_neg ~> uniformly_continuous_on_minus
2637 uniformly_continuous_on_sub ~> uniformly_continuous_on_diff
2638 subset_interior ~> interior_mono
2639 subset_closure ~> closure_mono
2640 closure_univ ~> closure_UNIV
2641 real_arch_lt ~> reals_Archimedean2
2642 real_arch ~> reals_Archimedean3
2643 real_abs_norm ~> abs_norm_cancel
2644 real_abs_sub_norm ~> norm_triangle_ineq3
2645 norm_cauchy_schwarz_abs ~> Cauchy_Schwarz_ineq2
2647 * Session HOL-Probability:
2648 - Caratheodory's extension lemma is now proved for ring_of_sets.
2649 - Infinite products of probability measures are now available.
2650 - Sigma closure is independent, if the generator is independent
2651 - Use extended reals instead of positive extended
2652 reals. INCOMPATIBILITY.
2654 * Session HOLCF: Discontinued legacy theorem names, INCOMPATIBILITY.
2656 expand_fun_below ~> fun_below_iff
2657 below_fun_ext ~> fun_belowI
2658 expand_cfun_eq ~> cfun_eq_iff
2659 ext_cfun ~> cfun_eqI
2660 expand_cfun_below ~> cfun_below_iff
2661 below_cfun_ext ~> cfun_belowI
2662 monofun_fun_fun ~> fun_belowD
2663 monofun_fun_arg ~> monofunE
2664 monofun_lub_fun ~> adm_monofun [THEN admD]
2665 cont_lub_fun ~> adm_cont [THEN admD]
2666 cont2cont_Rep_CFun ~> cont2cont_APP
2667 cont_Rep_CFun_app ~> cont_APP_app
2668 cont_Rep_CFun_app_app ~> cont_APP_app_app
2669 cont_cfun_fun ~> cont_Rep_cfun1 [THEN contE]
2670 cont_cfun_arg ~> cont_Rep_cfun2 [THEN contE]
2671 contlub_cfun ~> lub_APP [symmetric]
2672 contlub_LAM ~> lub_LAM [symmetric]
2675 lift_distinct1 ~> lift.distinct(1)
2676 lift_distinct2 ~> lift.distinct(2)
2677 Def_not_UU ~> lift.distinct(2)
2678 Def_inject ~> lift.inject
2679 below_UU_iff ~> below_bottom_iff
2680 eq_UU_iff ~> eq_bottom_iff
2683 *** Document preparation ***
2685 * Antiquotation @{rail} layouts railroad syntax diagrams, see also
2686 isar-ref manual, both for description and actual application of the
2689 * Antiquotation @{value} evaluates the given term and presents its
2692 * Antiquotations: term style "isub" provides ad-hoc conversion of
2693 variables x1, y23 into subscripted form x\<^isub>1,
2694 y\<^isub>2\<^isub>3.
2696 * Predefined LaTeX macros for Isabelle symbols \<bind> and \<then>
2697 (e.g. see ~~/src/HOL/Library/Monad_Syntax.thy).
2699 * Localized \isabellestyle switch can be used within blocks or groups
2702 \isabellestyle{it} %preferred default
2703 {\isabellestylett @{text "typewriter stuff"}}
2705 * Discontinued special treatment of hard tabulators. Implicit
2706 tab-width is now defined as 1. Potential INCOMPATIBILITY for visual
2712 * The inner syntax of sort/type/term/prop supports inlined YXML
2713 representations within quoted string tokens. By encoding logical
2714 entities via Term_XML (in ML or Scala) concrete syntax can be
2715 bypassed, which is particularly useful for producing bits of text
2716 under external program control.
2718 * Antiquotations for ML and document preparation are managed as theory
2719 data, which requires explicit setup.
2721 * Isabelle_Process.is_active allows tools to check if the official
2722 process wrapper is running (Isabelle/Scala/jEdit) or the old TTY loop
2723 (better known as Proof General).
2725 * Structure Proof_Context follows standard naming scheme. Old
2726 ProofContext is still available for some time as legacy alias.
2728 * Structure Timing provides various operations for timing; supersedes
2729 former start_timing/end_timing etc.
2731 * Path.print is the official way to show file-system paths to users
2732 (including quotes etc.).
2734 * Inner syntax: identifiers in parse trees of generic categories
2735 "logic", "aprop", "idt" etc. carry position information (disguised as
2736 type constraints). Occasional INCOMPATIBILITY with non-compliant
2737 translations that choke on unexpected type constraints. Positions can
2738 be stripped in ML translations via Syntax.strip_positions /
2739 Syntax.strip_positions_ast, or via the syntax constant
2740 "_strip_positions" within parse trees. As last resort, positions can
2741 be disabled via the configuration option Syntax.positions, which is
2742 called "syntax_positions" in Isar attribute syntax.
2744 * Discontinued special status of various ML structures that contribute
2745 to structure Syntax (Ast, Lexicon, Mixfix, Parser, Printer etc.): less
2746 pervasive content, no inclusion in structure Syntax. INCOMPATIBILITY,
2747 refer directly to Ast.Constant, Lexicon.is_identifier,
2748 Syntax_Trans.mk_binder_tr etc.
2750 * Typed print translation: discontinued show_sorts argument, which is
2751 already available via context of "advanced" translation.
2753 * Refined PARALLEL_GOALS tactical: degrades gracefully for schematic
2754 goal states; body tactic needs to address all subgoals uniformly.
2756 * Slightly more special eq_list/eq_set, with shortcut involving
2757 pointer equality (assumes that eq relation is reflexive).
2759 * Classical tactics use proper Proof.context instead of historic types
2760 claset/clasimpset. Old-style declarations like addIs, addEs, addDs
2761 operate directly on Proof.context. Raw type claset retains its use as
2762 snapshot of the classical context, which can be recovered via
2763 (put_claset HOL_cs) etc. Type clasimpset has been discontinued.
2764 INCOMPATIBILITY, classical tactics and derived proof methods require
2765 proper Proof.context.
2770 * Discontinued support for Poly/ML 5.2, which was the last version
2771 without proper multithreading and TimeLimit implementation.
2773 * Discontinued old lib/scripts/polyml-platform, which has been
2774 obsolete since Isabelle2009-2.
2776 * Various optional external tools are referenced more robustly and
2777 uniformly by explicit Isabelle settings as follows:
2779 ISABELLE_CSDP (formerly CSDP_EXE)
2780 ISABELLE_GHC (formerly EXEC_GHC or GHC_PATH)
2781 ISABELLE_OCAML (formerly EXEC_OCAML)
2782 ISABELLE_SWIPL (formerly EXEC_SWIPL)
2783 ISABELLE_YAP (formerly EXEC_YAP)
2785 Note that automated detection from the file-system or search path has
2786 been discontinued. INCOMPATIBILITY.
2788 * Scala layer provides JVM method invocation service for static
2789 methods of type (String)String, see Invoke_Scala.method in ML. For
2792 Invoke_Scala.method "java.lang.System.getProperty" "java.home"
2794 Together with YXML.string_of_body/parse_body and XML.Encode/Decode
2795 this allows to pass structured values between ML and Scala.
2797 * The IsabelleText fonts includes some further glyphs to support the
2798 Prover IDE. Potential INCOMPATIBILITY: users who happen to have
2799 installed a local copy (which is normally *not* required) need to
2800 delete or update it from ~~/lib/fonts/.
2804 New in Isabelle2011 (January 2011)
2805 ----------------------------------
2809 * Experimental Prover IDE based on Isabelle/Scala and jEdit (see
2810 src/Tools/jEdit). This also serves as IDE for Isabelle/ML, with
2811 useful tooltips and hyperlinks produced from its static analysis. The
2812 bundled component provides an executable Isabelle tool that can be run
2815 Isabelle2011/bin/isabelle jedit
2817 * Significantly improved Isabelle/Isar implementation manual.
2819 * System settings: ISABELLE_HOME_USER now includes ISABELLE_IDENTIFIER
2820 (and thus refers to something like $HOME/.isabelle/Isabelle2011),
2821 while the default heap location within that directory lacks that extra
2822 suffix. This isolates multiple Isabelle installations from each
2823 other, avoiding problems with old settings in new versions.
2824 INCOMPATIBILITY, need to copy/upgrade old user settings manually.
2826 * Source files are always encoded as UTF-8, instead of old-fashioned
2827 ISO-Latin-1. INCOMPATIBILITY. Isabelle LaTeX documents might require
2828 the following package declarations:
2830 \usepackage[utf8]{inputenc}
2831 \usepackage{textcomp}
2833 * Explicit treatment of UTF-8 sequences as Isabelle symbols, such that
2834 a Unicode character is treated as a single symbol, not a sequence of
2835 non-ASCII bytes as before. Since Isabelle/ML string literals may
2836 contain symbols without further backslash escapes, Unicode can now be
2837 used here as well. Recall that Symbol.explode in ML provides a
2838 consistent view on symbols, while raw explode (or String.explode)
2839 merely give a byte-oriented representation.
2841 * Theory loader: source files are primarily located via the master
2842 directory of each theory node (where the .thy file itself resides).
2843 The global load path is still partially available as legacy feature.
2844 Minor INCOMPATIBILITY due to subtle change in file lookup: use
2845 explicit paths, relatively to the theory.
2847 * Special treatment of ML file names has been discontinued.
2848 Historically, optional extensions .ML or .sml were added on demand --
2849 at the cost of clarity of file dependencies. Recall that Isabelle/ML
2850 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
2852 * Various options that affect pretty printing etc. are now properly
2853 handled within the context via configuration options, instead of
2854 unsynchronized references or print modes. There are both ML Config.T
2855 entities and Isar declaration attributes to access these.
2857 ML (Config.T) Isar (attribute)
2859 eta_contract eta_contract
2860 show_brackets show_brackets
2861 show_sorts show_sorts
2862 show_types show_types
2863 show_question_marks show_question_marks
2864 show_consts show_consts
2865 show_abbrevs show_abbrevs
2867 Syntax.ast_trace syntax_ast_trace
2868 Syntax.ast_stat syntax_ast_stat
2869 Syntax.ambiguity_level syntax_ambiguity_level
2871 Goal_Display.goals_limit goals_limit
2872 Goal_Display.show_main_goal show_main_goal
2874 Method.rule_trace rule_trace
2876 Thy_Output.display thy_output_display
2877 Thy_Output.quotes thy_output_quotes
2878 Thy_Output.indent thy_output_indent
2879 Thy_Output.source thy_output_source
2880 Thy_Output.break thy_output_break
2882 Note that corresponding "..._default" references in ML may only be
2883 changed globally at the ROOT session setup, but *not* within a theory.
2884 The option "show_abbrevs" supersedes the former print mode
2885 "no_abbrevs" with inverted meaning.
2887 * More systematic naming of some configuration options.
2890 trace_simp ~> simp_trace
2891 debug_simp ~> simp_debug
2893 * Support for real valued configuration options, using simplistic
2894 floating-point notation that coincides with the inner syntax for
2897 * Support for real valued preferences (with approximative PGIP type):
2898 front-ends need to accept "pgint" values in float notation.
2901 * The IsabelleText font now includes Cyrillic, Hebrew, Arabic from
2904 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
2909 * Command 'type_synonym' (with single argument) replaces somewhat
2910 outdated 'types', which is still available as legacy feature for some
2913 * Command 'nonterminal' (with 'and' separated list of arguments)
2914 replaces somewhat outdated 'nonterminals'. INCOMPATIBILITY.
2916 * Command 'notepad' replaces former 'example_proof' for
2917 experimentation in Isar without any result. INCOMPATIBILITY.
2919 * Locale interpretation commands 'interpret' and 'sublocale' accept
2920 lists of equations to map definitions in a locale to appropriate
2921 entities in the context of the interpretation. The 'interpretation'
2922 command already provided this functionality.
2924 * Diagnostic command 'print_dependencies' prints the locale instances
2925 that would be activated if the specified expression was interpreted in
2926 the current context. Variant "print_dependencies!" assumes a context
2927 without interpretations.
2929 * Diagnostic command 'print_interps' prints interpretations in proofs
2930 in addition to interpretations in theories.
2932 * Discontinued obsolete 'global' and 'local' commands to manipulate
2933 the theory name space. Rare INCOMPATIBILITY. The ML functions
2934 Sign.root_path and Sign.local_path may be applied directly where this
2935 feature is still required for historical reasons.
2937 * Discontinued obsolete 'constdefs' command. INCOMPATIBILITY, use
2938 'definition' instead.
2940 * The "prems" fact, which refers to the accidental collection of
2941 foundational premises in the context, is now explicitly marked as
2942 legacy feature and will be discontinued soon. Consider using "assms"
2943 of the head statement or reference facts by explicit names.
2945 * Document antiquotations @{class} and @{type} print classes and type
2948 * Document antiquotation @{file} checks file/directory entries within
2949 the local file system.
2954 * Coercive subtyping: functions can be declared as coercions and type
2955 inference will add them as necessary upon input of a term. Theory
2956 Complex_Main declares real :: nat => real and real :: int => real as
2957 coercions. A coercion function f is declared like this:
2959 declare [[coercion f]]
2961 To lift coercions through type constructors (e.g. from nat => real to
2962 nat list => real list), map functions can be declared, e.g.
2964 declare [[coercion_map map]]
2966 Currently coercion inference is activated only in theories including
2967 real numbers, i.e. descendants of Complex_Main. This is controlled by
2968 the configuration option "coercion_enabled", e.g. it can be enabled in
2969 other theories like this:
2971 declare [[coercion_enabled]]
2973 * Command 'partial_function' provides basic support for recursive
2974 function definitions over complete partial orders. Concrete instances
2975 are provided for i) the option type, ii) tail recursion on arbitrary
2976 types, and iii) the heap monad of Imperative_HOL. See
2977 src/HOL/ex/Fundefs.thy and src/HOL/Imperative_HOL/ex/Linked_Lists.thy
2980 * Function package: f.psimps rules are no longer implicitly declared
2981 as [simp]. INCOMPATIBILITY.
2983 * Datatype package: theorems generated for executable equality (class
2984 "eq") carry proper names and are treated as default code equations.
2986 * Inductive package: now offers command 'inductive_simps' to
2987 automatically derive instantiated and simplified equations for
2988 inductive predicates, similar to 'inductive_cases'.
2990 * Command 'enriched_type' allows to register properties of the
2991 functorial structure of types.
2993 * Improved infrastructure for term evaluation using code generator
2994 techniques, in particular static evaluation conversions.
2996 * Code generator: Scala (2.8 or higher) has been added to the target
2999 * Code generator: globbing constant expressions "*" and "Theory.*"
3000 have been replaced by the more idiomatic "_" and "Theory._".
3003 * Code generator: export_code without explicit file declaration prints
3004 to standard output. INCOMPATIBILITY.
3006 * Code generator: do not print function definitions for case
3007 combinators any longer.
3009 * Code generator: simplification with rules determined with
3010 src/Tools/Code/code_simp.ML and method "code_simp".
3012 * Code generator for records: more idiomatic representation of record
3013 types. Warning: records are not covered by ancient SML code
3014 generation any longer. INCOMPATIBILITY. In cases of need, a suitable
3015 rep_datatype declaration helps to succeed then:
3019 rep_datatype foo_ext ...
3021 * Records: logical foundation type for records does not carry a
3022 '_type' suffix any longer (obsolete due to authentic syntax).
3025 * Quickcheck now by default uses exhaustive testing instead of random
3026 testing. Random testing can be invoked by "quickcheck [random]",
3027 exhaustive testing by "quickcheck [exhaustive]".
3029 * Quickcheck instantiates polymorphic types with small finite
3030 datatypes by default. This enables a simple execution mechanism to
3031 handle quantifiers and function equality over the finite datatypes.
3033 * Quickcheck random generator has been renamed from "code" to
3034 "random". INCOMPATIBILITY.
3036 * Quickcheck now has a configurable time limit which is set to 30
3037 seconds by default. This can be changed by adding [timeout = n] to the
3038 quickcheck command. The time limit for Auto Quickcheck is still set
3041 * Quickcheck in locales considers interpretations of that locale for
3042 counter example search.
3045 - Added "smt" and "remote_smt" provers based on the "smt" proof
3046 method. See the Sledgehammer manual for details ("isabelle doc
3049 sledgehammer atp_info ~> sledgehammer running_provers
3050 sledgehammer atp_kill ~> sledgehammer kill_provers
3051 sledgehammer available_atps ~> sledgehammer available_provers
3054 sledgehammer [atps = ...] ~> sledgehammer [provers = ...]
3055 sledgehammer [atp = ...] ~> sledgehammer [prover = ...]
3056 sledgehammer [timeout = 77 s] ~> sledgehammer [timeout = 77]
3057 (and "ms" and "min" are no longer supported)
3062 nitpick [timeout = 77 s] ~> nitpick [timeout = 77]
3063 nitpick [tac_timeout = 777 ms] ~> nitpick [tac_timeout = 0.777]
3065 - Added support for partial quotient types.
3066 - Added local versions of the "Nitpick.register_xxx" functions.
3067 - Added "whack" option.
3068 - Allow registration of quotient types as codatatypes.
3069 - Improved "merge_type_vars" option to merge more types.
3070 - Removed unsound "fast_descrs" option.
3071 - Added custom symmetry breaking for datatypes, making it possible to reach
3072 higher cardinalities.
3073 - Prevent the expansion of too large definitions.
3075 * Proof methods "metis" and "meson" now have configuration options
3076 "meson_trace", "metis_trace", and "metis_verbose" that can be enabled
3077 to diagnose these tools. E.g.
3079 using [[metis_trace = true]]
3081 * Auto Solve: Renamed "Auto Solve Direct". The tool is now available
3082 manually as command 'solve_direct'.
3084 * The default SMT solver Z3 must be enabled explicitly (due to
3085 licensing issues) by setting the environment variable
3086 Z3_NON_COMMERCIAL in etc/settings of the component, for example. For
3087 commercial applications, the SMT solver CVC3 is provided as fall-back;
3088 changing the SMT solver is done via the configuration option
3091 * Remote SMT solvers need to be referred to by the "remote_" prefix,
3092 i.e. "remote_cvc3" and "remote_z3".
3094 * Added basic SMT support for datatypes, records, and typedefs using
3095 the oracle mode (no proofs). Direct support of pairs has been dropped
3096 in exchange (pass theorems fst_conv snd_conv pair_collapse to the SMT
3097 support for a similar behavior). Minor INCOMPATIBILITY.
3099 * Changed SMT configuration options:
3101 z3_proofs ~> smt_oracle (with inverted meaning)
3102 z3_trace_assms ~> smt_trace_used_facts
3115 * Boogie output files (.b2i files) need to be declared in the theory
3118 * Simplification procedure "list_to_set_comprehension" rewrites list
3119 comprehensions applied to List.set to set comprehensions. Occasional
3120 INCOMPATIBILITY, may be deactivated like this:
3122 declare [[simproc del: list_to_set_comprehension]]
3124 * Removed old version of primrec package. INCOMPATIBILITY.
3126 * Removed simplifier congruence rule of "prod_case", as has for long
3127 been the case with "split". INCOMPATIBILITY.
3129 * String.literal is a type, but not a datatype. INCOMPATIBILITY.
3131 * Removed [split_format ... and ... and ...] version of
3132 [split_format]. Potential INCOMPATIBILITY.
3134 * Predicate "sorted" now defined inductively, with nice induction
3135 rules. INCOMPATIBILITY: former sorted.simps now named sorted_simps.
3137 * Constant "contents" renamed to "the_elem", to free the generic name
3138 contents for other uses. INCOMPATIBILITY.
3140 * Renamed class eq and constant eq (for code generation) to class
3141 equal and constant equal, plus renaming of related facts and various
3142 tuning. INCOMPATIBILITY.
3144 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
3146 * Removed output syntax "'a ~=> 'b" for "'a => 'b option".
3149 * Renamed theory Fset to Cset, type Fset.fset to Cset.set, in order to
3150 avoid confusion with finite sets. INCOMPATIBILITY.
3152 * Abandoned locales equiv, congruent and congruent2 for equivalence
3153 relations. INCOMPATIBILITY: use equivI rather than equiv_intro (same
3156 * Some previously unqualified names have been qualified:
3163 Trueprop ~> HOL.Trueprop
3168 op --> ~> HOL.implies
3180 Pair ~> Product_Type.Pair
3181 fst ~> Product_Type.fst
3182 snd ~> Product_Type.snd
3183 curry ~> Product_Type.curry
3185 Collect ~> Set.Collect
3189 * More canonical naming convention for some fundamental definitions:
3191 bot_bool_eq ~> bot_bool_def
3192 top_bool_eq ~> top_bool_def
3193 inf_bool_eq ~> inf_bool_def
3194 sup_bool_eq ~> sup_bool_def
3195 bot_fun_eq ~> bot_fun_def
3196 top_fun_eq ~> top_fun_def
3197 inf_fun_eq ~> inf_fun_def
3198 sup_fun_eq ~> sup_fun_def
3202 * More stylized fact names:
3204 expand_fun_eq ~> fun_eq_iff
3205 expand_set_eq ~> set_eq_iff
3207 nat_number ~> eval_nat_numeral
3211 * Refactoring of code-generation specific operations in theory List:
3217 mem_iff ~> member_def
3218 null_empty ~> null_def
3220 INCOMPATIBILITY. Note that these were not supposed to be used
3221 regularly unless for striking reasons; their main purpose was code
3224 Various operations from the Haskell prelude are used for generating
3227 * Term "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". Term
3228 "surj f" is now an abbreviation of "range f = UNIV". The theorems
3229 bij_def and surj_def are unchanged. INCOMPATIBILITY.
3231 * Abolished some non-alphabetic type names: "prod" and "sum" replace
3232 "*" and "+" respectively. INCOMPATIBILITY.
3234 * Name "Plus" of disjoint sum operator "<+>" is now hidden. Write
3235 "Sum_Type.Plus" instead.
3237 * Constant "split" has been merged with constant "prod_case"; names of
3238 ML functions, facts etc. involving split have been retained so far,
3239 though. INCOMPATIBILITY.
3241 * Dropped old infix syntax "_ mem _" for List.member; use "_ : set _"
3242 instead. INCOMPATIBILITY.
3244 * Removed lemma "Option.is_none_none" which duplicates "is_none_def".
3247 * Former theory Library/Enum is now part of the HOL-Main image.
3248 INCOMPATIBILITY: all constants of the Enum theory now have to be
3249 referred to by its qualified name.
3252 nlists ~> Enum.nlists
3253 product ~> Enum.product
3255 * Theory Library/Monad_Syntax provides do-syntax for monad types.
3256 Syntax in Library/State_Monad has been changed to avoid ambiguities.
3259 * Theory Library/SetsAndFunctions has been split into
3260 Library/Function_Algebras and Library/Set_Algebras; canonical names
3261 for instance definitions for functions; various improvements.
3264 * Theory Library/Multiset provides stable quicksort implementation of
3267 * Theory Library/Multiset: renamed empty_idemp ~> empty_neutral.
3270 * Session Multivariate_Analysis: introduced a type class for euclidean
3271 space. Most theorems are now stated in terms of euclidean spaces
3272 instead of finite cartesian products.
3275 real ^ 'n ~> 'a::real_vector
3276 ~> 'a::euclidean_space
3277 ~> 'a::ordered_euclidean_space
3278 (depends on your needs)
3282 \<chi> x. _ ~> \<chi>\<chi> x. _
3285 Also note that the indices are now natural numbers and not from some
3286 finite type. Finite cartesian products of euclidean spaces, products
3287 of euclidean spaces the real and complex numbers are instantiated to
3288 be euclidean_spaces. INCOMPATIBILITY.
3290 * Session Probability: introduced pextreal as positive extended real
3291 numbers. Use pextreal as value for measures. Introduce the
3292 Radon-Nikodym derivative, product spaces and Fubini's theorem for
3293 arbitrary sigma finite measures. Introduces Lebesgue measure based on
3294 the integral in Multivariate Analysis. INCOMPATIBILITY.
3296 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
3299 * Session SPARK (with image HOL-SPARK) provides commands to load and
3300 prove verification conditions generated by the SPARK Ada program
3301 verifier. See also src/HOL/SPARK and src/HOL/SPARK/Examples.
3306 * Theorems for additive ring operations (locale abelian_monoid and
3307 descendants) are generated by interpretation from their multiplicative
3308 counterparts. Names (in particular theorem names) have the mandatory
3309 qualifier 'add'. Previous theorem names are redeclared for
3312 * Structure "int_ring" is now an abbreviation (previously a
3313 definition). This fits more natural with advanced interpretations.
3318 * The domain package now runs in definitional mode by default: The
3319 former command 'new_domain' is now called 'domain'. To use the domain
3320 package in its original axiomatic mode, use 'domain (unsafe)'.
3323 * The new class "domain" is now the default sort. Class "predomain"
3324 is an unpointed version of "domain". Theories can be updated by
3325 replacing sort annotations as shown below. INCOMPATIBILITY.
3327 'a::type ~> 'a::countable
3328 'a::cpo ~> 'a::predomain
3329 'a::pcpo ~> 'a::domain
3331 * The old type class "rep" has been superseded by class "domain".
3332 Accordingly, users of the definitional package must remove any
3333 "default_sort rep" declarations. INCOMPATIBILITY.
3335 * The domain package (definitional mode) now supports unpointed
3336 predomain argument types, as long as they are marked 'lazy'. (Strict
3337 arguments must be in class "domain".) For example, the following
3338 domain definition now works:
3340 domain natlist = nil | cons (lazy "nat discr") (lazy "natlist")
3342 * Theory HOLCF/Library/HOL_Cpo provides cpo and predomain class
3343 instances for types from main HOL: bool, nat, int, char, 'a + 'b,
3344 'a option, and 'a list. Additionally, it configures fixrec and the
3345 domain package to work with these types. For example:
3347 fixrec isInl :: "('a + 'b) u -> tr"
3348 where "isInl$(up$(Inl x)) = TT" | "isInl$(up$(Inr y)) = FF"
3350 domain V = VFun (lazy "V -> V") | VCon (lazy "nat") (lazy "V list")
3352 * The "(permissive)" option of fixrec has been replaced with a
3353 per-equation "(unchecked)" option. See
3354 src/HOL/HOLCF/Tutorial/Fixrec_ex.thy for examples. INCOMPATIBILITY.
3356 * The "bifinite" class no longer fixes a constant "approx"; the class
3357 now just asserts that such a function exists. INCOMPATIBILITY.
3359 * Former type "alg_defl" has been renamed to "defl". HOLCF no longer
3360 defines an embedding of type 'a defl into udom by default; instances
3361 of "bifinite" and "domain" classes are available in
3362 src/HOL/HOLCF/Library/Defl_Bifinite.thy.
3364 * The syntax "REP('a)" has been replaced with "DEFL('a)".
3366 * The predicate "directed" has been removed. INCOMPATIBILITY.
3368 * The type class "finite_po" has been removed. INCOMPATIBILITY.
3370 * The function "cprod_map" has been renamed to "prod_map".
3373 * The monadic bind operator on each powerdomain has new binder syntax
3374 similar to sets, e.g. "\<Union>\<sharp>x\<in>xs. t" represents
3375 "upper_bind\<cdot>xs\<cdot>(\<Lambda> x. t)".
3377 * The infix syntax for binary union on each powerdomain has changed
3378 from e.g. "+\<sharp>" to "\<union>\<sharp>", for consistency with set
3379 syntax. INCOMPATIBILITY.
3381 * The constant "UU" has been renamed to "bottom". The syntax "UU" is
3382 still supported as an input translation.
3384 * Renamed some theorems (the original names are also still available).
3386 expand_fun_below ~> fun_below_iff
3387 below_fun_ext ~> fun_belowI
3388 expand_cfun_eq ~> cfun_eq_iff
3389 ext_cfun ~> cfun_eqI
3390 expand_cfun_below ~> cfun_below_iff
3391 below_cfun_ext ~> cfun_belowI
3392 cont2cont_Rep_CFun ~> cont2cont_APP
3394 * The Abs and Rep functions for various types have changed names.
3395 Related theorem names have also changed to match. INCOMPATIBILITY.
3397 Rep_CFun ~> Rep_cfun
3398 Abs_CFun ~> Abs_cfun
3399 Rep_Sprod ~> Rep_sprod
3400 Abs_Sprod ~> Abs_sprod
3401 Rep_Ssum ~> Rep_ssum
3402 Abs_Ssum ~> Abs_ssum
3404 * Lemmas with names of the form *_defined_iff or *_strict_iff have
3405 been renamed to *_bottom_iff. INCOMPATIBILITY.
3407 * Various changes to bisimulation/coinduction with domain package:
3409 - Definitions of "bisim" constants no longer mention definedness.
3410 - With mutual recursion, "bisim" predicate is now curried.
3411 - With mutual recursion, each type gets a separate coind theorem.
3412 - Variable names in bisim_def and coinduct rules have changed.
3416 * Case combinators generated by the domain package for type "foo" are
3417 now named "foo_case" instead of "foo_when". INCOMPATIBILITY.
3419 * Several theorems have been renamed to more accurately reflect the
3420 names of constants and types involved. INCOMPATIBILITY.
3422 thelub_const ~> lub_const
3423 lub_const ~> is_lub_const
3425 is_lub_lub ~> is_lubD2
3427 unique_lub ~> is_lub_unique
3428 is_ub_lub ~> is_lub_rangeD1
3429 lub_bin_chain ~> is_lub_bin_chain
3430 lub_fun ~> is_lub_fun
3431 thelub_fun ~> lub_fun
3432 thelub_cfun ~> lub_cfun
3433 thelub_Pair ~> lub_Pair
3434 lub_cprod ~> is_lub_prod
3435 thelub_cprod ~> lub_prod
3436 minimal_cprod ~> minimal_prod
3437 inst_cprod_pcpo ~> inst_prod_pcpo
3439 compact_UU ~> compact_bottom
3440 deflation_UU ~> deflation_bottom
3441 finite_deflation_UU ~> finite_deflation_bottom
3443 * Many legacy theorem names have been discontinued. INCOMPATIBILITY.
3445 sq_ord_less_eq_trans ~> below_eq_trans
3446 sq_ord_eq_less_trans ~> eq_below_trans
3447 refl_less ~> below_refl
3448 trans_less ~> below_trans
3449 antisym_less ~> below_antisym
3450 antisym_less_inverse ~> po_eq_conv [THEN iffD1]
3451 box_less ~> box_below
3452 rev_trans_less ~> rev_below_trans
3453 not_less2not_eq ~> not_below2not_eq
3454 less_UU_iff ~> below_UU_iff
3455 flat_less_iff ~> flat_below_iff
3456 adm_less ~> adm_below
3457 adm_not_less ~> adm_not_below
3458 adm_compact_not_less ~> adm_compact_not_below
3459 less_fun_def ~> below_fun_def
3460 expand_fun_less ~> fun_below_iff
3461 less_fun_ext ~> fun_belowI
3462 less_discr_def ~> below_discr_def
3463 discr_less_eq ~> discr_below_eq
3464 less_unit_def ~> below_unit_def
3465 less_cprod_def ~> below_prod_def
3466 prod_lessI ~> prod_belowI
3467 Pair_less_iff ~> Pair_below_iff
3468 fst_less_iff ~> fst_below_iff
3469 snd_less_iff ~> snd_below_iff
3470 expand_cfun_less ~> cfun_below_iff
3471 less_cfun_ext ~> cfun_belowI
3472 injection_less ~> injection_below
3473 less_up_def ~> below_up_def
3474 not_Iup_less ~> not_Iup_below
3475 Iup_less ~> Iup_below
3477 Def_inject_less_eq ~> Def_below_Def
3478 Def_less_is_eq ~> Def_below_iff
3479 spair_less_iff ~> spair_below_iff
3480 less_sprod ~> below_sprod
3481 spair_less ~> spair_below
3482 sfst_less_iff ~> sfst_below_iff
3483 ssnd_less_iff ~> ssnd_below_iff
3484 fix_least_less ~> fix_least_below
3485 dist_less_one ~> dist_below_one
3486 less_ONE ~> below_ONE
3487 ONE_less_iff ~> ONE_below_iff
3488 less_sinlD ~> below_sinlD
3489 less_sinrD ~> below_sinrD
3494 * All constant names are now qualified internally and use proper
3495 identifiers, e.g. "IFOL.eq" instead of "op =". INCOMPATIBILITY.
3500 * Antiquotation @{assert} inlines a function bool -> unit that raises
3501 Fail if the argument is false. Due to inlining the source position of
3502 failed assertions is included in the error output.
3504 * Discontinued antiquotation @{theory_ref}, which is obsolete since ML
3505 text is in practice always evaluated with a stable theory checkpoint.
3506 Minor INCOMPATIBILITY, use (Theory.check_thy @{theory}) instead.
3508 * Antiquotation @{theory A} refers to theory A from the ancestry of
3509 the current context, not any accidental theory loader state as before.
3510 Potential INCOMPATIBILITY, subtle change in semantics.
3512 * Syntax.pretty_priority (default 0) configures the required priority
3513 of pretty-printed output and thus affects insertion of parentheses.
3515 * Syntax.default_root (default "any") configures the inner syntax
3516 category (nonterminal symbol) for parsing of terms.
3518 * Former exception Library.UnequalLengths now coincides with
3519 ListPair.UnequalLengths.
3521 * Renamed structure MetaSimplifier to Raw_Simplifier. Note that the
3522 main functionality is provided by structure Simplifier.
3524 * Renamed raw "explode" function to "raw_explode" to emphasize its
3525 meaning. Note that internally to Isabelle, Symbol.explode is used in
3526 almost all situations.
3528 * Discontinued obsolete function sys_error and exception SYS_ERROR.
3529 See implementation manual for further details on exceptions in
3532 * Renamed setmp_noncritical to Unsynchronized.setmp to emphasize its
3535 * Renamed structure PureThy to Pure_Thy and moved most of its
3536 operations to structure Global_Theory, to emphasize that this is
3537 rarely-used global-only stuff.
3539 * Discontinued Output.debug. Minor INCOMPATIBILITY, use plain writeln
3540 instead (or tracing for high-volume output).
3542 * Configuration option show_question_marks only affects regular pretty
3543 printing of types and terms, not raw Term.string_of_vname.
3545 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
3546 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
3547 @{thms} for most purposes.
3549 * ML structure Unsynchronized is never opened, not even in Isar
3550 interaction mode as before. Old Unsynchronized.set etc. have been
3551 discontinued -- use plain := instead. This should be *rare* anyway,
3552 since modern tools always work via official context data, notably
3553 configuration options.
3555 * Parallel and asynchronous execution requires special care concerning
3556 interrupts. Structure Exn provides some convenience functions that
3557 avoid working directly with raw Interrupt. User code must not absorb
3558 interrupts -- intermediate handling (for cleanup etc.) needs to be
3559 followed by re-raising of the original exception. Another common
3560 source of mistakes are "handle _" patterns, which make the meaning of
3561 the program subject to physical effects of the environment.
3565 New in Isabelle2009-2 (June 2010)
3566 ---------------------------------
3570 * Authentic syntax for *all* logical entities (type classes, type
3571 constructors, term constants): provides simple and robust
3572 correspondence between formal entities and concrete syntax. Within
3573 the parse tree / AST representations, "constants" are decorated by
3574 their category (class, type, const) and spelled out explicitly with
3575 their full internal name.
3577 Substantial INCOMPATIBILITY concerning low-level syntax declarations
3578 and translations (translation rules and translation functions in ML).
3579 Some hints on upgrading:
3581 - Many existing uses of 'syntax' and 'translations' can be replaced
3582 by more modern 'type_notation', 'notation' and 'abbreviation',
3583 which are independent of this issue.
3585 - 'translations' require markup within the AST; the term syntax
3586 provides the following special forms:
3588 CONST c -- produces syntax version of constant c from context
3589 XCONST c -- literally c, checked as constant from context
3590 c -- literally c, if declared by 'syntax'
3592 Plain identifiers are treated as AST variables -- occasionally the
3593 system indicates accidental variables via the error "rhs contains
3596 Type classes and type constructors are marked according to their
3597 concrete syntax. Some old translations rules need to be written
3598 for the "type" category, using type constructor application
3599 instead of pseudo-term application of the default category
3602 - 'parse_translation' etc. in ML may use the following
3605 @{class_syntax c} -- type class c within parse tree / AST
3606 @{term_syntax c} -- type constructor c within parse tree / AST
3607 @{const_syntax c} -- ML version of "CONST c" above
3608 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
3610 - Literal types within 'typed_print_translations', i.e. those *not*
3611 represented as pseudo-terms are represented verbatim. Use @{class
3612 c} or @{type_name c} here instead of the above syntax
3615 Note that old non-authentic syntax was based on unqualified base
3616 names, so all of the above "constant" names would coincide. Recall
3617 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
3618 diagnose syntax problems.
3620 * Type constructors admit general mixfix syntax, not just infix.
3622 * Concrete syntax may be attached to local entities without a proof
3623 body, too. This works via regular mixfix annotations for 'fix',
3624 'def', 'obtain' etc. or via the explicit 'write' command, which is
3625 similar to the 'notation' command in theory specifications.
3627 * Discontinued unnamed infix syntax (legacy feature for many years) --
3628 need to specify constant name and syntax separately. Internal ML
3629 datatype constructors have been renamed from InfixName to Infix etc.
3630 Minor INCOMPATIBILITY.
3632 * Schematic theorem statements need to be explicitly markup as such,
3633 via commands 'schematic_lemma', 'schematic_theorem',
3634 'schematic_corollary'. Thus the relevance of the proof is made
3635 syntactically clear, which impacts performance in a parallel or
3636 asynchronous interactive environment. Minor INCOMPATIBILITY.
3638 * Use of cumulative prems via "!" in some proof methods has been
3639 discontinued (old legacy feature).
3641 * References 'trace_simp' and 'debug_simp' have been replaced by
3642 configuration options stored in the context. Enabling tracing (the
3643 case of debugging is similar) in proofs works via
3645 using [[trace_simp = true]]
3647 Tracing is then active for all invocations of the simplifier in
3648 subsequent goal refinement steps. Tracing may also still be enabled or
3649 disabled via the ProofGeneral settings menu.
3651 * Separate commands 'hide_class', 'hide_type', 'hide_const',
3652 'hide_fact' replace the former 'hide' KIND command. Minor
3655 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
3656 more efficient than combinations with -q1 or -q2.
3661 * Proofterms record type-class reasoning explicitly, using the
3662 "unconstrain" operation internally. This eliminates all sort
3663 constraints from a theorem and proof, introducing explicit
3664 OFCLASS-premises. On the proof term level, this operation is
3665 automatically applied at theorem boundaries, such that closed proofs
3666 are always free of sort constraints. INCOMPATIBILITY for tools that
3667 inspect proof terms.
3669 * Local theory specifications may depend on extra type variables that
3670 are not present in the result type -- arguments TYPE('a) :: 'a itself
3671 are added internally. For example:
3673 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
3675 * Predicates of locales introduced by classes carry a mandatory
3676 "class" prefix. INCOMPATIBILITY.
3678 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
3680 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
3683 * Command 'code_reflect' allows to incorporate generated ML code into
3684 runtime environment; replaces immature code_datatype antiquotation.
3687 * Code generator: simple concept for abstract datatypes obeying
3690 * Code generator: details of internal data cache have no impact on the
3691 user space functionality any longer.
3693 * Methods "unfold_locales" and "intro_locales" ignore non-locale
3694 subgoals. This is more appropriate for interpretations with 'where'.
3697 * Command 'example_proof' opens an empty proof body. This allows to
3698 experiment with Isar, without producing any persistent result.
3700 * Commands 'type_notation' and 'no_type_notation' declare type syntax
3701 within a local theory context, with explicit checking of the
3702 constructors involved (in contrast to the raw 'syntax' versions).
3704 * Commands 'types' and 'typedecl' now work within a local theory
3705 context -- without introducing dependencies on parameters or
3706 assumptions, which is not possible in Isabelle/Pure.
3708 * Command 'defaultsort' has been renamed to 'default_sort', it works
3709 within a local theory context. Minor INCOMPATIBILITY.
3714 * Command 'typedef' now works within a local theory context -- without
3715 introducing dependencies on parameters or assumptions, which is not
3716 possible in Isabelle/Pure/HOL. Note that the logical environment may
3717 contain multiple interpretations of local typedefs (with different
3718 non-emptiness proofs), even in a global theory context.
3720 * New package for quotient types. Commands 'quotient_type' and
3721 'quotient_definition' may be used for defining types and constants by
3722 quotient constructions. An example is the type of integers created by
3723 quotienting pairs of natural numbers:
3726 intrel :: "(nat * nat) => (nat * nat) => bool"
3728 "intrel (x, y) (u, v) = (x + v = u + y)"
3730 quotient_type int = "nat * nat" / intrel
3731 by (auto simp add: equivp_def expand_fun_eq)
3734 "0::int" is "(0::nat, 0::nat)"
3736 The method "lifting" can be used to lift of theorems from the
3737 underlying "raw" type to the quotient type. The example
3738 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
3739 construction and provides a reasoning infrastructure for finite sets.
3741 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
3742 clash with new theory Quotient in Main HOL.
3744 * Moved the SMT binding into the main HOL session, eliminating
3745 separate HOL-SMT session.
3747 * List membership infix mem operation is only an input abbreviation.
3750 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
3751 for future developements; former Library/Word.thy is still present in
3752 the AFP entry RSAPPS.
3754 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
3755 longer shadowed. INCOMPATIBILITY.
3757 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
3760 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
3763 * Dropped normalizing_semiring etc; use the facts in semiring classes
3764 instead. INCOMPATIBILITY.
3766 * Dropped several real-specific versions of lemmas about floor and
3767 ceiling; use the generic lemmas from theory "Archimedean_Field"
3768 instead. INCOMPATIBILITY.
3770 floor_number_of_eq ~> floor_number_of
3771 le_floor_eq_number_of ~> number_of_le_floor
3772 le_floor_eq_zero ~> zero_le_floor
3773 le_floor_eq_one ~> one_le_floor
3774 floor_less_eq_number_of ~> floor_less_number_of
3775 floor_less_eq_zero ~> floor_less_zero
3776 floor_less_eq_one ~> floor_less_one
3777 less_floor_eq_number_of ~> number_of_less_floor
3778 less_floor_eq_zero ~> zero_less_floor
3779 less_floor_eq_one ~> one_less_floor
3780 floor_le_eq_number_of ~> floor_le_number_of
3781 floor_le_eq_zero ~> floor_le_zero
3782 floor_le_eq_one ~> floor_le_one
3783 floor_subtract_number_of ~> floor_diff_number_of
3784 floor_subtract_one ~> floor_diff_one
3785 ceiling_number_of_eq ~> ceiling_number_of
3786 ceiling_le_eq_number_of ~> ceiling_le_number_of
3787 ceiling_le_zero_eq ~> ceiling_le_zero
3788 ceiling_le_eq_one ~> ceiling_le_one
3789 less_ceiling_eq_number_of ~> number_of_less_ceiling
3790 less_ceiling_eq_zero ~> zero_less_ceiling
3791 less_ceiling_eq_one ~> one_less_ceiling
3792 ceiling_less_eq_number_of ~> ceiling_less_number_of
3793 ceiling_less_eq_zero ~> ceiling_less_zero
3794 ceiling_less_eq_one ~> ceiling_less_one
3795 le_ceiling_eq_number_of ~> number_of_le_ceiling
3796 le_ceiling_eq_zero ~> zero_le_ceiling
3797 le_ceiling_eq_one ~> one_le_ceiling
3798 ceiling_subtract_number_of ~> ceiling_diff_number_of
3799 ceiling_subtract_one ~> ceiling_diff_one
3801 * Theory "Finite_Set": various folding_XXX locales facilitate the
3802 application of the various fold combinators on finite sets.
3804 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
3805 provides abstract red-black tree type which is backed by "RBT_Impl" as
3806 implementation. INCOMPATIBILTY.
3808 * Theory Library/Coinductive_List has been removed -- superseded by
3809 AFP/thys/Coinductive.
3811 * Theory PReal, including the type "preal" and related operations, has
3812 been removed. INCOMPATIBILITY.
3814 * Real: new development using Cauchy Sequences.
3816 * Split off theory "Big_Operators" containing setsum, setprod,
3817 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
3819 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
3820 "Int" etc. INCOMPATIBILITY.
3822 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
3824 * New set of rules "ac_simps" provides combined assoc / commute
3825 rewrites for all interpretations of the appropriate generic locales.
3827 * Renamed theory "OrderedGroup" to "Groups" and split theory
3828 "Ring_and_Field" into theories "Rings" and "Fields"; for more
3829 appropriate and more consistent names suitable for name prefixes
3830 within the HOL theories. INCOMPATIBILITY.
3832 * Some generic constants have been put to appropriate theories:
3833 - less_eq, less: Orderings
3834 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
3835 - inverse, divide: Rings
3838 * More consistent naming of type classes involving orderings (and
3841 lower_semilattice ~> semilattice_inf
3842 upper_semilattice ~> semilattice_sup
3844 dense_linear_order ~> dense_linorder
3846 pordered_ab_group_add ~> ordered_ab_group_add
3847 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
3848 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
3849 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
3850 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
3851 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
3852 pordered_cancel_semiring ~> ordered_cancel_semiring
3853 pordered_comm_monoid_add ~> ordered_comm_monoid_add
3854 pordered_comm_ring ~> ordered_comm_ring
3855 pordered_comm_semiring ~> ordered_comm_semiring
3856 pordered_ring ~> ordered_ring
3857 pordered_ring_abs ~> ordered_ring_abs
3858 pordered_semiring ~> ordered_semiring
3860 ordered_ab_group_add ~> linordered_ab_group_add
3861 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
3862 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
3863 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
3864 ordered_field ~> linordered_field
3865 ordered_field_no_lb ~> linordered_field_no_lb
3866 ordered_field_no_ub ~> linordered_field_no_ub
3867 ordered_field_dense_linear_order ~> dense_linordered_field
3868 ordered_idom ~> linordered_idom
3869 ordered_ring ~> linordered_ring
3870 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
3871 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
3872 ordered_ring_strict ~> linordered_ring_strict
3873 ordered_semidom ~> linordered_semidom
3874 ordered_semiring ~> linordered_semiring
3875 ordered_semiring_1 ~> linordered_semiring_1
3876 ordered_semiring_1_strict ~> linordered_semiring_1_strict
3877 ordered_semiring_strict ~> linordered_semiring_strict
3879 The following slightly odd type classes have been moved to a
3880 separate theory Library/Lattice_Algebras:
3882 lordered_ab_group_add ~> lattice_ab_group_add
3883 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
3884 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
3885 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
3886 lordered_ring ~> lattice_ring
3890 * Refined field classes:
3891 - classes division_ring_inverse_zero, field_inverse_zero,
3892 linordered_field_inverse_zero include rule inverse 0 = 0 --
3893 subsumes former division_by_zero class;
3894 - numerous lemmas have been ported from field to division_ring.
3897 * Refined algebra theorem collections:
3898 - dropped theorem group group_simps, use algebra_simps instead;
3899 - dropped theorem group ring_simps, use field_simps instead;
3900 - proper theorem collection field_simps subsumes former theorem
3901 groups field_eq_simps and field_simps;
3902 - dropped lemma eq_minus_self_iff which is a duplicate for
3906 * Theory Finite_Set and List: some lemmas have been generalized from
3909 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
3910 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
3911 inter_Inter_fold_inter ~> inf_Inf_fold_inf
3912 union_Union_fold_union ~> sup_Sup_fold_sup
3913 Inter_fold_inter ~> Inf_fold_inf
3914 Union_fold_union ~> Sup_fold_sup
3915 inter_INTER_fold_inter ~> inf_INFI_fold_inf
3916 union_UNION_fold_union ~> sup_SUPR_fold_sup
3917 INTER_fold_inter ~> INFI_fold_inf
3918 UNION_fold_union ~> SUPR_fold_sup
3920 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
3921 replaced by the more convenient lemmas Inf_empty and Sup_empty.
3922 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
3923 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
3924 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
3925 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
3927 * Reorganized theory Multiset: swapped notation of pointwise and
3930 - pointwise ordering is instance of class order with standard syntax
3932 - multiset ordering has syntax <=# and <#; partial order properties
3933 are provided by means of interpretation with prefix
3935 - less duplication, less historical organization of sections,
3936 conversion from associations lists to multisets, rudimentary code
3938 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
3943 multiset_eq_conv_count_eq ~> multiset_ext_iff
3944 multi_count_ext ~> multiset_ext
3945 diff_union_inverse2 ~> diff_union_cancelR
3949 * Theory Permutation: replaced local "remove" by List.remove1.
3951 * Code generation: ML and OCaml code is decorated with signatures.
3953 * Theory List: added transpose.
3955 * Library/Nat_Bijection.thy is a collection of bijective functions
3956 between nat and other types, which supersedes the older libraries
3957 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
3960 Nat_Int_Bij.nat2_to_nat ~> prod_encode
3961 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
3962 Nat_Int_Bij.int_to_nat_bij ~> int_encode
3963 Nat_Int_Bij.nat_to_int_bij ~> int_decode
3964 Countable.pair_encode ~> prod_encode
3965 NatIso.prod2nat ~> prod_encode
3966 NatIso.nat2prod ~> prod_decode
3967 NatIso.sum2nat ~> sum_encode
3968 NatIso.nat2sum ~> sum_decode
3969 NatIso.list2nat ~> list_encode
3970 NatIso.nat2list ~> list_decode
3971 NatIso.set2nat ~> set_encode
3972 NatIso.nat2set ~> set_decode
3975 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
3976 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
3977 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
3978 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
3979 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
3980 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
3981 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
3982 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
3983 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
3984 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
3985 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
3986 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
3987 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
3990 - Renamed ATP commands:
3991 atp_info ~> sledgehammer running_atps
3992 atp_kill ~> sledgehammer kill_atps
3993 atp_messages ~> sledgehammer messages
3994 atp_minimize ~> sledgehammer minimize
3995 print_atps ~> sledgehammer available_atps
3997 - Added user's manual ("isabelle doc sledgehammer").
3998 - Added option syntax and "sledgehammer_params" to customize
3999 Sledgehammer's behavior. See the manual for details.
4000 - Modified the Isar proof reconstruction code so that it produces
4001 direct proofs rather than proofs by contradiction. (This feature
4002 is still experimental.)
4003 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
4005 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
4008 - Added and implemented "binary_ints" and "bits" options.
4009 - Added "std" option and implemented support for nonstandard models.
4010 - Added and implemented "finitize" option to improve the precision
4011 of infinite datatypes based on a monotonicity analysis.
4012 - Added support for quotient types.
4013 - Added support for "specification" and "ax_specification"
4015 - Added support for local definitions (for "function" and
4016 "termination" proofs).
4017 - Added support for term postprocessors.
4018 - Optimized "Multiset.multiset" and "FinFun.finfun".
4019 - Improved efficiency of "destroy_constrs" optimization.
4020 - Fixed soundness bugs related to "destroy_constrs" optimization and
4022 - Fixed soundness bug related to higher-order constructors.
4023 - Fixed soundness bug when "full_descrs" is enabled.
4024 - Improved precision of set constructs.
4025 - Added "atoms" option.
4026 - Added cache to speed up repeated Kodkod invocations on the same
4028 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
4029 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
4030 "SAT4J_Light". INCOMPATIBILITY.
4031 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
4032 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
4033 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
4035 * Method "induct" now takes instantiations of the form t, where t is not
4036 a variable, as a shorthand for "x == t", where x is a fresh variable.
4037 If this is not intended, t has to be enclosed in parentheses.
4038 By default, the equalities generated by definitional instantiations
4039 are pre-simplified, which may cause parameters of inductive cases
4040 to disappear, or may even delete some of the inductive cases.
4041 Use "induct (no_simp)" instead of "induct" to restore the old
4042 behaviour. The (no_simp) option is also understood by the "cases"
4043 and "nominal_induct" methods, which now perform pre-simplification, too.
4049 * Variable names in lemmas generated by the domain package have
4050 changed; the naming scheme is now consistent with the HOL datatype
4051 package. Some proof scripts may be affected, INCOMPATIBILITY.
4053 * The domain package no longer defines the function "foo_copy" for
4054 recursive domain "foo". The reach lemma is now stated directly in
4055 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
4056 be reformulated in terms of "foo_take", INCOMPATIBILITY.
4058 * Most definedness lemmas generated by the domain package (previously
4059 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
4060 like "foo$x = UU <-> x = UU", which works better as a simp rule.
4061 Proofs that used definedness lemmas as intro rules may break,
4062 potential INCOMPATIBILITY.
4064 * Induction and casedist rules generated by the domain package now
4065 declare proper case_names (one called "bottom", and one named for each
4066 constructor). INCOMPATIBILITY.
4068 * For mutually-recursive domains, separate "reach" and "take_lemma"
4069 rules are generated for each domain, INCOMPATIBILITY.
4071 foo_bar.reach ~> foo.reach bar.reach
4072 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
4074 * Some lemmas generated by the domain package have been renamed for
4075 consistency with the datatype package, INCOMPATIBILITY.
4077 foo.ind ~> foo.induct
4078 foo.finite_ind ~> foo.finite_induct
4079 foo.coind ~> foo.coinduct
4080 foo.casedist ~> foo.exhaust
4081 foo.exhaust ~> foo.nchotomy
4083 * For consistency with other definition packages, the fixrec package
4084 now generates qualified theorem names, INCOMPATIBILITY.
4086 foo_simps ~> foo.simps
4087 foo_unfold ~> foo.unfold
4088 foo_induct ~> foo.induct
4090 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
4091 method and internal fixrec proofs now use the default simpset instead.
4094 * The "contlub" predicate has been removed. Proof scripts should use
4095 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
4097 * The "admw" predicate has been removed, INCOMPATIBILITY.
4099 * The constants cpair, cfst, and csnd have been removed in favor of
4100 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
4105 * Antiquotations for basic formal entities:
4107 @{class NAME} -- type class
4108 @{class_syntax NAME} -- syntax representation of the above
4110 @{type_name NAME} -- logical type
4111 @{type_abbrev NAME} -- type abbreviation
4112 @{nonterminal NAME} -- type of concrete syntactic category
4113 @{type_syntax NAME} -- syntax representation of any of the above
4115 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
4116 @{const_abbrev NAME} -- abbreviated constant
4117 @{const_syntax NAME} -- syntax representation of any of the above
4119 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
4120 syntax constant (cf. 'syntax' command).
4122 * Antiquotation @{make_string} inlines a function to print arbitrary
4123 values similar to the ML toplevel. The result is compiler dependent
4124 and may fall back on "?" in certain situations.
4126 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
4127 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
4128 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
4129 not work with the asynchronous Isar document model.
4131 * Configuration options now admit dynamic default values, depending on
4132 the context or even global references.
4134 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
4135 uses an efficient external library if available (for Poly/ML).
4137 * Renamed some important ML structures, while keeping the old names
4138 for some time as aliases within the structure Legacy:
4140 OuterKeyword ~> Keyword
4143 OuterSyntax ~> Outer_Syntax
4144 PrintMode ~> Print_Mode
4145 SpecParse ~> Parse_Spec
4148 ThyOutput ~> Thy_Output
4149 TypeInfer ~> Type_Infer
4151 Note that "open Legacy" simplifies porting of sources, but forgetting
4152 to remove it again will complicate porting again in the future.
4154 * Most operations that refer to a global context are named
4155 accordingly, e.g. Simplifier.global_context or
4156 ProofContext.init_global. There are some situations where a global
4157 context actually works, but under normal circumstances one needs to
4158 pass the proper local context through the code!
4160 * Discontinued old TheoryDataFun with its copy/init operation -- data
4161 needs to be pure. Functor Theory_Data_PP retains the traditional
4162 Pretty.pp argument to merge, which is absent in the standard
4163 Theory_Data version.
4165 * Sorts.certify_sort and derived "cert" operations for types and terms
4166 no longer minimize sorts. Thus certification at the boundary of the
4167 inference kernel becomes invariant under addition of class relations,
4168 which is an important monotonicity principle. Sorts are now minimized
4169 in the syntax layer only, at the boundary between the end-user and the
4170 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
4171 explicitly in rare situations.
4173 * Renamed old-style Drule.standard to Drule.export_without_context, to
4174 emphasize that this is in no way a standard operation.
4177 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
4178 usual for resolution. Rare INCOMPATIBILITY.
4180 * Renamed varify/unvarify operations to varify_global/unvarify_global
4181 to emphasize that these only work in a global situation (which is
4184 * Curried take and drop in library.ML; negative length is interpreted
4185 as infinity (as in chop). Subtle INCOMPATIBILITY.
4187 * Proof terms: type substitutions on proof constants now use canonical
4188 order of type variables. INCOMPATIBILITY for tools working with proof
4191 * Raw axioms/defs may no longer carry sort constraints, and raw defs
4192 may no longer carry premises. User-level specifications are
4193 transformed accordingly by Thm.add_axiom/add_def.
4198 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
4199 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
4200 proof terms are enabled unconditionally in the new HOL-Proofs image.
4202 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
4203 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
4206 * Old lib/scripts/polyml-platform is superseded by the
4207 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
4208 variant, even on a 64 bit machine. The following example setting
4209 prefers 64 bit if available:
4211 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
4213 * The preliminary Isabelle/jEdit application demonstrates the emerging
4214 Isabelle/Scala layer for advanced prover interaction and integration.
4215 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
4218 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
4219 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
4220 similar to the default assignment of the document preparation system
4221 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
4222 provides some operations for direct access to the font without asking
4223 the user for manual installation.
4227 New in Isabelle2009-1 (December 2009)
4228 -------------------------------------
4232 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
4233 one backslash should be used, even in ML sources.
4238 * Locale interpretation propagates mixins along the locale hierarchy.
4239 The currently only available mixins are the equations used to map
4240 local definitions to terms of the target domain of an interpretation.
4242 * Reactivated diagnostic command 'print_interps'. Use "print_interps
4243 loc" to print all interpretations of locale "loc" in the theory.
4244 Interpretations in proofs are not shown.
4246 * Thoroughly revised locales tutorial. New section on conditional
4249 * On instantiation of classes, remaining undefined class parameters
4250 are formally declared. INCOMPATIBILITY.
4253 *** Document preparation ***
4255 * New generalized style concept for printing terms: @{foo (style) ...}
4256 instead of @{foo_style style ...} (old form is still retained for
4257 backward compatibility). Styles can be also applied for
4258 antiquotations prop, term_type and typeof.
4263 * New proof method "smt" for a combination of first-order logic with
4264 equality, linear and nonlinear (natural/integer/real) arithmetic, and
4265 fixed-size bitvectors; there is also basic support for higher-order
4266 features (esp. lambda abstractions). It is an incomplete decision
4267 procedure based on external SMT solvers using the oracle mechanism;
4268 for the SMT solver Z3, this method is proof-producing. Certificates
4269 are provided to avoid calling the external solvers solely for
4270 re-checking proofs. Due to a remote SMT service there is no need for
4271 installing SMT solvers locally. See src/HOL/SMT.
4273 * New commands to load and prove verification conditions generated by
4274 the Boogie program verifier or derived systems (e.g. the Verifying C
4275 Compiler (VCC) or Spec#). See src/HOL/Boogie.
4277 * New counterexample generator tool 'nitpick' based on the Kodkod
4278 relational model finder. See src/HOL/Tools/Nitpick and
4279 src/HOL/Nitpick_Examples.
4281 * New commands 'code_pred' and 'values' to invoke the predicate
4282 compiler and to enumerate values of inductive predicates.
4284 * A tabled implementation of the reflexive transitive closure.
4286 * New implementation of quickcheck uses generic code generator;
4287 default generators are provided for all suitable HOL types, records
4288 and datatypes. Old quickcheck can be re-activated importing theory
4289 Library/SML_Quickcheck.
4291 * New testing tool Mirabelle for automated proof tools. Applies
4292 several tools and tactics like sledgehammer, metis, or quickcheck, to
4293 every proof step in a theory. To be used in batch mode via the
4294 "mirabelle" utility.
4296 * New proof method "sos" (sum of squares) for nonlinear real
4297 arithmetic (originally due to John Harison). It requires theory
4298 Library/Sum_Of_Squares. It is not a complete decision procedure but
4299 works well in practice on quantifier-free real arithmetic with +, -,
4300 *, ^, =, <= and <, i.e. boolean combinations of equalities and
4301 inequalities between polynomials. It makes use of external
4302 semidefinite programming solvers. Method "sos" generates a
4303 certificate that can be pasted into the proof thus avoiding the need
4304 to call an external tool every time the proof is checked. See
4305 src/HOL/Library/Sum_Of_Squares.
4307 * New method "linarith" invokes existing linear arithmetic decision
4310 * New command 'atp_minimal' reduces result produced by Sledgehammer.
4312 * New Sledgehammer option "Full Types" in Proof General settings menu.
4313 Causes full type information to be output to the ATPs. This slows
4314 ATPs down considerably but eliminates a source of unsound "proofs"
4317 * New method "metisFT": A version of metis that uses full type
4318 information in order to avoid failures of proof reconstruction.
4320 * New evaluator "approximate" approximates an real valued term using
4321 the same method as the approximation method.
4323 * Method "approximate" now supports arithmetic expressions as
4324 boundaries of intervals and implements interval splitting and Taylor
4327 * ML antiquotation @{code_datatype} inserts definition of a datatype
4328 generated by the code generator; e.g. see src/HOL/Predicate.thy.
4330 * New theory SupInf of the supremum and infimum operators for sets of
4333 * New theory Probability, which contains a development of measure
4334 theory, eventually leading to Lebesgue integration and probability.
4336 * Extended Multivariate Analysis to include derivation and Brouwer's
4339 * Reorganization of number theory, INCOMPATIBILITY:
4340 - new number theory development for nat and int, in theories Divides
4341 and GCD as well as in new session Number_Theory
4342 - some constants and facts now suffixed with _nat and _int
4344 - former session NumberTheory now named Old_Number_Theory, including
4345 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
4346 - moved theory Pocklington from src/HOL/Library to
4347 src/HOL/Old_Number_Theory
4349 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
4350 lcm of finite and infinite sets. It is shown that they form a complete
4353 * Class semiring_div requires superclass no_zero_divisors and proof of
4354 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
4355 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
4356 generalized to class semiring_div, subsuming former theorems
4357 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
4358 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
4361 * Refinements to lattice classes and sets:
4362 - less default intro/elim rules in locale variant, more default
4363 intro/elim rules in class variant: more uniformity
4364 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
4366 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
4368 - renamed ACI to inf_sup_aci
4369 - new class "boolean_algebra"
4370 - class "complete_lattice" moved to separate theory
4371 "Complete_Lattice"; corresponding constants (and abbreviations)
4372 renamed and with authentic syntax:
4373 Set.Inf ~> Complete_Lattice.Inf
4374 Set.Sup ~> Complete_Lattice.Sup
4375 Set.INFI ~> Complete_Lattice.INFI
4376 Set.SUPR ~> Complete_Lattice.SUPR
4377 Set.Inter ~> Complete_Lattice.Inter
4378 Set.Union ~> Complete_Lattice.Union
4379 Set.INTER ~> Complete_Lattice.INTER
4380 Set.UNION ~> Complete_Lattice.UNION
4381 - authentic syntax for
4384 - mere abbreviations:
4387 Set.inter (for inf, formerly Set.Int)
4388 Set.union (for sup, formerly Set.Un)
4389 Complete_Lattice.Inter (for Inf)
4390 Complete_Lattice.Union (for Sup)
4391 Complete_Lattice.INTER (for INFI)
4392 Complete_Lattice.UNION (for SUPR)
4393 - object-logic definitions as far as appropriate
4395 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
4396 Un_subset_iff are explicitly deleted as default simp rules; then also
4397 their lattice counterparts le_inf_iff and le_sup_iff have to be
4398 deleted to achieve the desired effect.
4400 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
4401 rules by default any longer; the same applies to min_max.inf_absorb1
4402 etc. INCOMPATIBILITY.
4404 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
4405 pred_set_conv by default. INCOMPATIBILITY.
4407 * Power operations on relations and functions are now one dedicated
4408 constant "compow" with infix syntax "^^". Power operation on
4409 multiplicative monoids retains syntax "^" and is now defined generic
4410 in class power. INCOMPATIBILITY.
4412 * Relation composition "R O S" now has a more standard argument order:
4413 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
4414 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
4415 break, since the O_assoc rule was not rewritten like this. Fix using
4416 O_assoc[symmetric]. The same applies to the curried version "R OO S".
4418 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
4419 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
4422 * Most rules produced by inductive and datatype package have mandatory
4423 prefixes. INCOMPATIBILITY.
4425 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
4426 the attribute of the same name. Each of the theorems in the list
4427 DERIV_intros assumes composition with an additional function and
4428 matches a variable to the derivative, which has to be solved by the
4429 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
4430 of most elementary terms. Former Maclauren.DERIV_tac and
4431 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
4434 * Code generator attributes follow the usual underscore convention:
4435 code_unfold replaces code unfold
4436 code_post replaces code post
4441 sizechange -> size_change
4442 induct_scheme -> induction_schema
4445 * Discontinued abbreviation "arbitrary" of constant "undefined".
4446 INCOMPATIBILITY, use "undefined" directly.
4449 Suc_eq_add_numeral_1 -> Suc_eq_plus1
4450 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
4451 Suc_plus1 -> Suc_eq_plus1
4452 *anti_sym -> *antisym*
4453 vector_less_eq_def -> vector_le_def
4456 * Added theorem List.map_map as [simp]. Removed List.map_compose.
4459 * Removed predicate "M hassize n" (<--> card M = n & finite M).
4465 * Theory Representable defines a class "rep" of domains that are
4466 representable (via an ep-pair) in the universal domain type "udom".
4467 Instances are provided for all type constructors defined in HOLCF.
4469 * The 'new_domain' command is a purely definitional version of the
4470 domain package, for representable domains. Syntax is identical to the
4471 old domain package. The 'new_domain' package also supports indirect
4472 recursion using previously-defined type constructors. See
4473 src/HOLCF/ex/New_Domain.thy for examples.
4475 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
4476 on the left-hand side of an equation, and then performs
4477 simplification. Rewriting is done using rules declared with the
4478 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
4479 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
4481 * The pattern-match compiler in 'fixrec' can now handle constructors
4482 with HOL function types. Pattern-match combinators for the Pair
4483 constructor are pre-configured.
4485 * The 'fixrec' package now produces better fixed-point induction rules
4486 for mutually-recursive definitions: Induction rules have conclusions
4487 of the form "P foo bar" instead of "P <foo, bar>".
4489 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
4490 been renamed to "below". The name "below" now replaces "less" in many
4491 theorem names. (Legacy theorem names using "less" are still supported
4494 * The 'fixrec' package now supports "bottom patterns". Bottom
4495 patterns can be used to generate strictness rules, or to make
4496 functions more strict (much like the bang-patterns supported by the
4497 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
4503 * Support for Poly/ML 5.3.0, with improved reporting of compiler
4504 errors and run-time exceptions, including detailed source positions.
4506 * Structure Name_Space (formerly NameSpace) now manages uniquely
4507 identified entries, with some additional information such as source
4508 position, logical grouping etc.
4510 * Theory and context data is now introduced by the simplified and
4511 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
4512 to be pure, but the old TheoryDataFun for mutable data (with explicit
4513 copy operation) is still available for some time.
4515 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
4516 provides a high-level programming interface to synchronized state
4517 variables with atomic update. This works via pure function
4518 application within a critical section -- its runtime should be as
4519 short as possible; beware of deadlocks if critical code is nested,
4520 either directly or indirectly via other synchronized variables!
4522 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
4523 wraps raw ML references, explicitly indicating their non-thread-safe
4524 behaviour. The Isar toplevel keeps this structure open, to
4525 accommodate Proof General as well as quick and dirty interactive
4526 experiments with references.
4528 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
4529 parallel tactical reasoning.
4531 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
4532 are similar to SUBPROOF, but are slightly more flexible: only the
4533 specified parts of the subgoal are imported into the context, and the
4534 body tactic may introduce new subgoals and schematic variables.
4536 * Old tactical METAHYPS, which does not observe the proof context, has
4537 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
4538 or Subgoal.FOCUS etc.
4540 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
4541 functors have their own ML name space there is no point to mark them
4542 separately.) Minor INCOMPATIBILITY.
4544 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
4546 * Renamed several structures FooBar to Foo_Bar. Occasional,
4549 * Operations of structure Skip_Proof no longer require quick_and_dirty
4550 mode, which avoids critical setmp.
4552 * Eliminated old Attrib.add_attributes, Method.add_methods and related
4553 combinators for "args". INCOMPATIBILITY, need to use simplified
4554 Attrib/Method.setup introduced in Isabelle2009.
4556 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
4557 back on global_simpset_of, global_claset_of, global_clasimpset_of as
4558 last resort. INCOMPATIBILITY.
4560 * Display.pretty_thm now requires a proper context (cf. former
4561 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
4562 or even Display.pretty_thm_without_context as last resort.
4565 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
4566 Syntax.pretty_typ/term directly, preferably with proper context
4567 instead of global theory.
4572 * Further fine tuning of parallel proof checking, scales up to 8 cores
4573 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
4576 * Support for additional "Isabelle components" via etc/components, see
4577 also the system manual.
4579 * The isabelle makeall tool now operates on all components with
4580 IsaMakefile, not just hardwired "logics".
4582 * Removed "compress" option from isabelle-process and isabelle usedir;
4583 this is always enabled.
4585 * Discontinued support for Poly/ML 4.x versions.
4587 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
4588 on a given logic image. This requires the lighttpd webserver and is
4589 currently supported on Linux only.
4593 New in Isabelle2009 (April 2009)
4594 --------------------------------
4598 * Simplified main Isabelle executables, with less surprises on
4599 case-insensitive file-systems (such as Mac OS).
4601 - The main Isabelle tool wrapper is now called "isabelle" instead of
4604 - The former "isabelle" alias for "isabelle-process" has been
4605 removed (should rarely occur to regular users).
4607 - The former "isabelle-interface" and its alias "Isabelle" have been
4608 removed (interfaces are now regular Isabelle tools).
4610 Within scripts and make files, the Isabelle environment variables
4611 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
4612 respectively. (The latter are still available as legacy feature.)
4614 The old isabelle-interface wrapper could react in confusing ways if
4615 the interface was uninstalled or changed otherwise. Individual
4616 interface tool configuration is now more explicit, see also the
4617 Isabelle system manual. In particular, Proof General is now available
4618 via "isabelle emacs".
4620 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
4621 purge installed copies of Isabelle executables and re-run "isabelle
4622 install -p ...", or use symlinks.
4624 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
4625 old ~/isabelle, which was slightly non-standard and apt to cause
4626 surprises on case-insensitive file-systems (such as Mac OS).
4628 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
4629 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
4630 care is required when using older releases of Isabelle. Note that
4631 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
4632 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
4634 * Proofs of fully specified statements are run in parallel on
4635 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
4636 a regular 4-core machine, if the initial heap space is made reasonably
4637 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
4639 * The main reference manuals ("isar-ref", "implementation", and
4640 "system") have been updated and extended. Formally checked references
4641 as hyperlinks are now available uniformly.
4646 * Complete re-implementation of locales. INCOMPATIBILITY in several
4647 respects. The most important changes are listed below. See the
4648 Tutorial on Locales ("locales" manual) for details.
4650 - In locale expressions, instantiation replaces renaming. Parameters
4651 must be declared in a for clause. To aid compatibility with previous
4652 parameter inheritance, in locale declarations, parameters that are not
4653 'touched' (instantiation position "_" or omitted) are implicitly added
4654 with their syntax at the beginning of the for clause.
4656 - Syntax from abbreviations and definitions in locales is available in
4657 locale expressions and context elements. The latter is particularly
4658 useful in locale declarations.
4660 - More flexible mechanisms to qualify names generated by locale
4661 expressions. Qualifiers (prefixes) may be specified in locale
4662 expressions, and can be marked as mandatory (syntax: "name!:") or
4663 optional (syntax "name?:"). The default depends for plain "name:"
4664 depends on the situation where a locale expression is used: in
4665 commands 'locale' and 'sublocale' prefixes are optional, in
4666 'interpretation' and 'interpret' prefixes are mandatory. The old
4667 implicit qualifiers derived from the parameter names of a locale are
4668 no longer generated.
4670 - Command "sublocale l < e" replaces "interpretation l < e". The
4671 instantiation clause in "interpretation" and "interpret" (square
4672 brackets) is no longer available. Use locale expressions.
4674 - When converting proof scripts, mandatory qualifiers in
4675 'interpretation' and 'interpret' should be retained by default, even
4676 if this is an INCOMPATIBILITY compared to former behavior. In the
4677 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
4678 in locale expressions range over a single locale instance only.
4680 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
4681 In existing theorem specifications replace the includes element by the
4682 respective context elements of the included locale, omitting those
4683 that are already present in the theorem specification. Multiple
4684 assume elements of a locale should be replaced by a single one
4685 involving the locale predicate. In the proof body, declarations (most
4686 notably theorems) may be regained by interpreting the respective
4687 locales in the proof context as required (command "interpret").
4689 If using "includes" in replacement of a target solely because the
4690 parameter types in the theorem are not as general as in the target,
4691 consider declaring a new locale with additional type constraints on
4692 the parameters (context element "constrains").
4694 - Discontinued "locale (open)". INCOMPATIBILITY.
4696 - Locale interpretation commands no longer attempt to simplify goal.
4697 INCOMPATIBILITY: in rare situations the generated goal differs. Use
4698 methods intro_locales and unfold_locales to clarify.
4700 - Locale interpretation commands no longer accept interpretation
4701 attributes. INCOMPATIBILITY.
4703 * Class declaration: so-called "base sort" must not be given in import
4704 list any longer, but is inferred from the specification. Particularly
4711 class foo = type + ...
4713 * Class target: global versions of theorems stemming do not carry a
4714 parameter prefix any longer. INCOMPATIBILITY.
4716 * Class 'instance' command no longer accepts attached definitions.
4717 INCOMPATIBILITY, use proper 'instantiation' target instead.
4719 * Recovered hiding of consts, which was accidentally broken in
4720 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
4721 makes c inaccessible; consider using ``hide (open) const c'' instead.
4723 * Slightly more coherent Pure syntax, with updated documentation in
4724 isar-ref manual. Removed locales meta_term_syntax and
4725 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
4726 INCOMPATIBILITY in rare situations. Note that &&& should not be used
4727 directly in regular applications.
4729 * There is a new syntactic category "float_const" for signed decimal
4730 fractions (e.g. 123.45 or -123.45).
4732 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
4733 interface with 'setup' command instead.
4735 * Command 'local_setup' is similar to 'setup', but operates on a local
4738 * The 'axiomatization' command now only works within a global theory
4739 context. INCOMPATIBILITY.
4741 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
4742 hypotheses. Sorts required in the course of reasoning need to be
4743 covered by the constraints in the initial statement, completed by the
4744 type instance information of the background theory. Non-trivial sort
4745 hypotheses, which rarely occur in practice, may be specified via
4746 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
4748 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
4750 The result contains an implicit sort hypotheses as before --
4751 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
4754 * Generalized Isar history, with support for linear undo, direct state
4757 * Changed defaults for unify configuration options:
4759 unify_trace_bound = 50 (formerly 25)
4760 unify_search_bound = 60 (formerly 30)
4762 * Different bookkeeping for code equations (INCOMPATIBILITY):
4764 a) On theory merge, the last set of code equations for a particular
4765 constant is taken (in accordance with the policy applied by other
4766 parts of the code generator framework).
4768 b) Code equations stemming from explicit declarations (e.g. code
4769 attribute) gain priority over default code equations stemming
4770 from definition, primrec, fun etc.
4772 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
4774 * Unified theorem tables for both code generators. Thus [code
4775 func] has disappeared and only [code] remains. INCOMPATIBILITY.
4777 * Command 'find_consts' searches for constants based on type and name
4780 find_consts "_ => bool"
4782 By default, matching is against subtypes, but it may be restricted to
4783 the whole type. Searching by name is possible. Multiple queries are
4784 conjunctive and queries may be negated by prefixing them with a
4787 find_consts strict: "_ => bool" name: "Int" -"int => int"
4789 * New 'find_theorems' criterion "solves" matches theorems that
4790 directly solve the current goal (modulo higher-order unification).
4792 * Auto solve feature for main theorem statements: whenever a new goal
4793 is stated, "find_theorems solves" is called; any theorems that could
4794 solve the lemma directly are listed as part of the goal state.
4795 Cf. associated options in Proof General Isabelle settings menu,
4796 enabled by default, with reasonable timeout for pathological cases of
4797 higher-order unification.
4800 *** Document preparation ***
4802 * Antiquotation @{lemma} now imitates a regular terminal proof,
4803 demanding keyword 'by' and supporting the full method expression
4804 syntax just like the Isar command 'by'.
4809 * Integrated main parts of former image HOL-Complex with HOL. Entry
4810 points Main and Complex_Main remain as before.
4812 * Logic image HOL-Plain provides a minimal HOL with the most important
4813 tools available (inductive, datatype, primrec, ...). This facilitates
4814 experimentation and tool development. Note that user applications
4815 (and library theories) should never refer to anything below theory
4818 * Logic image HOL-Main stops at theory Main, and thus facilitates
4819 experimentation due to shorter build times.
4821 * Logic image HOL-NSA contains theories of nonstandard analysis which
4822 were previously part of former HOL-Complex. Entry point Hyperreal
4823 remains valid, but theories formerly using Complex_Main should now use
4824 new entry point Hypercomplex.
4826 * Generic ATP manager for Sledgehammer, based on ML threads instead of
4827 Posix processes. Avoids potentially expensive forking of the ML
4828 process. New thread-based implementation also works on non-Unix
4829 platforms (Cygwin). Provers are no longer hardwired, but defined
4830 within the theory via plain ML wrapper functions. Basic Sledgehammer
4831 commands are covered in the isar-ref manual.
4833 * Wrapper scripts for remote SystemOnTPTP service allows to use
4834 sledgehammer without local ATP installation (Vampire etc.). Other
4835 provers may be included via suitable ML wrappers, see also
4836 src/HOL/ATP_Linkup.thy.
4838 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
4841 * The metis method no longer fails because the theorem is too trivial
4842 (contains the empty clause).
4844 * The metis method now fails in the usual manner, rather than raising
4845 an exception, if it determines that it cannot prove the theorem.
4847 * Method "coherent" implements a prover for coherent logic (see also
4848 src/Tools/coherent.ML).
4850 * Constants "undefined" and "default" replace "arbitrary". Usually
4851 "undefined" is the right choice to replace "arbitrary", though
4852 logically there is no difference. INCOMPATIBILITY.
4854 * Command "value" now integrates different evaluation mechanisms. The
4855 result of the first successful evaluation mechanism is printed. In
4856 square brackets a particular named evaluation mechanisms may be
4857 specified (currently, [SML], [code] or [nbe]). See further
4858 src/HOL/ex/Eval_Examples.thy.
4860 * Normalization by evaluation now allows non-leftlinear equations.
4861 Declare with attribute [code nbe].
4863 * Methods "case_tac" and "induct_tac" now refer to the very same rules
4864 as the structured Isar versions "cases" and "induct", cf. the
4865 corresponding "cases" and "induct" attributes. Mutual induction rules
4866 are now presented as a list of individual projections
4867 (e.g. foo_bar.inducts for types foo and bar); the old format with
4868 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
4869 rare situations a different rule is selected --- notably nested tuple
4870 elimination instead of former prod.exhaust: use explicit (case_tac t
4871 rule: prod.exhaust) here.
4873 * Attributes "cases", "induct", "coinduct" support "del" option.
4875 * Removed fact "case_split_thm", which duplicates "case_split".
4877 * The option datatype has been moved to a new theory Option. Renamed
4878 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
4880 * New predicate "strict_mono" classifies strict functions on partial
4881 orders. With strict functions on linear orders, reasoning about
4882 (in)equalities is facilitated by theorems "strict_mono_eq",
4883 "strict_mono_less_eq" and "strict_mono_less".
4885 * Some set operations are now proper qualified constants with
4886 authentic syntax. INCOMPATIBILITY:
4897 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
4900 * Auxiliary class "itself" has disappeared -- classes without any
4901 parameter are treated as expected by the 'class' command.
4903 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
4905 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
4906 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
4908 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
4909 method "approximation". It proves formulas on real values by using
4910 interval arithmetic. In the formulas are also the transcendental
4911 functions sin, cos, tan, atan, ln, exp and the constant pi are
4912 allowed. For examples see
4913 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
4915 * Theory "Reflection" now resides in HOL/Library.
4917 * Entry point to Word library now simply named "Word".
4920 * Made source layout more coherent with logical distribution
4923 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
4924 src/HOL/Library/Code_Message.thy ~> src/HOL/
4925 src/HOL/Library/GCD.thy ~> src/HOL/
4926 src/HOL/Library/Order_Relation.thy ~> src/HOL/
4927 src/HOL/Library/Parity.thy ~> src/HOL/
4928 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
4929 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
4930 src/HOL/Real/Lubs.thy ~> src/HOL/
4931 src/HOL/Real/PReal.thy ~> src/HOL/
4932 src/HOL/Real/Rational.thy ~> src/HOL/
4933 src/HOL/Real/RComplete.thy ~> src/HOL/
4934 src/HOL/Real/RealDef.thy ~> src/HOL/
4935 src/HOL/Real/RealPow.thy ~> src/HOL/
4936 src/HOL/Real/Real.thy ~> src/HOL/
4937 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
4938 src/HOL/Complex/Complex.thy ~> src/HOL/
4939 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
4940 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
4941 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
4942 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
4943 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
4944 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
4945 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
4946 src/HOL/Hyperreal/Log.thy ~> src/HOL/
4947 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
4948 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
4949 src/HOL/Hyperreal/Series.thy ~> src/HOL/
4950 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
4951 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
4952 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
4953 src/HOL/Real/Float ~> src/HOL/Library/
4954 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
4955 src/HOL/Real/RealVector.thy ~> src/HOL/
4957 src/HOL/arith_data.ML ~> src/HOL/Tools
4958 src/HOL/hologic.ML ~> src/HOL/Tools
4959 src/HOL/simpdata.ML ~> src/HOL/Tools
4960 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
4961 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
4962 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
4963 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
4964 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
4965 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
4966 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
4968 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
4969 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
4970 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
4971 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
4972 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
4973 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
4975 * If methods "eval" and "evaluation" encounter a structured proof
4976 state with !!/==>, only the conclusion is evaluated to True (if
4977 possible), avoiding strange error messages.
4979 * Method "sizechange" automates termination proofs using (a
4980 modification of) the size-change principle. Requires SAT solver. See
4981 src/HOL/ex/Termination.thy for examples.
4983 * Simplifier: simproc for let expressions now unfolds if bound
4984 variable occurs at most once in let expression body. INCOMPATIBILITY.
4986 * Method "arith": Linear arithmetic now ignores all inequalities when
4987 fast_arith_neq_limit is exceeded, instead of giving up entirely.
4989 * New attribute "arith" for facts that should always be used
4990 automatically by arithmetic. It is intended to be used locally in
4993 assumes [arith]: "x > 0"
4995 Global usage is discouraged because of possible performance impact.
4997 * New classes "top" and "bot" with corresponding operations "top" and
4998 "bot" in theory Orderings; instantiation of class "complete_lattice"
4999 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
5001 * Changed definition lemma "less_fun_def" in order to provide an
5002 instance for preorders on functions; use lemma "less_le" instead.
5005 * Theory Orderings: class "wellorder" moved here, with explicit
5006 induction rule "less_induct" as assumption. For instantiation of
5007 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
5010 * Theory Orderings: added class "preorder" as superclass of "order".
5011 INCOMPATIBILITY: Instantiation proofs for order, linorder
5012 etc. slightly changed. Some theorems named order_class.* now named
5015 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
5018 * Theory Finite_Set: added a new fold combinator of type
5020 ('a => 'b => 'b) => 'b => 'a set => 'b
5022 Occasionally this is more convenient than the old fold combinator
5023 which is now defined in terms of the new one and renamed to
5026 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
5027 and "ring_simps" have been replaced by "algebra_simps" (which can be
5028 extended with further lemmas!). At the moment both still exist but
5029 the former will disappear at some point.
5031 * Theory Power: Lemma power_Suc is now declared as a simp rule in
5032 class recpower. Type-specific simp rules for various recpower types
5033 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
5035 rat_power_0 -> power_0
5036 rat_power_Suc -> power_Suc
5037 realpow_0 -> power_0
5038 realpow_Suc -> power_Suc
5039 complexpow_0 -> power_0
5040 complexpow_Suc -> power_Suc
5041 power_poly_0 -> power_0
5042 power_poly_Suc -> power_Suc
5044 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
5045 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
5046 dvd has been generalized to class comm_semiring_1. Likewise a bunch
5047 of lemmas from Divides has been generalized from nat to class
5048 semiring_div. INCOMPATIBILITY. This involves the following theorem
5049 renames resulting from duplicate elimination:
5051 dvd_def_mod ~> dvd_eq_mod_eq_0
5052 zero_dvd_iff ~> dvd_0_left_iff
5053 dvd_0 ~> dvd_0_right
5054 DIVISION_BY_ZERO_DIV ~> div_by_0
5055 DIVISION_BY_ZERO_MOD ~> mod_by_0
5056 mult_div ~> div_mult_self2_is_id
5057 mult_mod ~> mod_mult_self2_is_0
5059 * Theory IntDiv: removed many lemmas that are instances of class-based
5060 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
5061 rename old lemmas as follows:
5063 dvd_diff -> nat_dvd_diff
5064 dvd_zminus_iff -> dvd_minus_iff
5065 mod_add1_eq -> mod_add_eq
5066 mod_mult1_eq -> mod_mult_right_eq
5067 mod_mult1_eq' -> mod_mult_left_eq
5068 mod_mult_distrib_mod -> mod_mult_eq
5069 nat_mod_add_left_eq -> mod_add_left_eq
5070 nat_mod_add_right_eq -> mod_add_right_eq
5071 nat_mod_div_trivial -> mod_div_trivial
5072 nat_mod_mod_trivial -> mod_mod_trivial
5073 zdiv_zadd_self1 -> div_add_self1
5074 zdiv_zadd_self2 -> div_add_self2
5075 zdiv_zmult_self1 -> div_mult_self2_is_id
5076 zdiv_zmult_self2 -> div_mult_self1_is_id
5077 zdvd_triv_left -> dvd_triv_left
5078 zdvd_triv_right -> dvd_triv_right
5079 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
5080 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
5081 zmod_zadd_left_eq -> mod_add_left_eq
5082 zmod_zadd_right_eq -> mod_add_right_eq
5083 zmod_zadd_self1 -> mod_add_self1
5084 zmod_zadd_self2 -> mod_add_self2
5085 zmod_zadd1_eq -> mod_add_eq
5086 zmod_zdiff1_eq -> mod_diff_eq
5087 zmod_zdvd_zmod -> mod_mod_cancel
5088 zmod_zmod_cancel -> mod_mod_cancel
5089 zmod_zmult_self1 -> mod_mult_self2_is_0
5090 zmod_zmult_self2 -> mod_mult_self1_is_0
5093 zdvd_abs1 -> abs_dvd_iff
5094 zdvd_abs2 -> dvd_abs_iff
5095 zdvd_refl -> dvd_refl
5096 zdvd_trans -> dvd_trans
5097 zdvd_zadd -> dvd_add
5098 zdvd_zdiff -> dvd_diff
5099 zdvd_zminus_iff -> dvd_minus_iff
5100 zdvd_zminus2_iff -> minus_dvd_iff
5101 zdvd_zmultD -> dvd_mult_right
5102 zdvd_zmultD2 -> dvd_mult_left
5103 zdvd_zmult_mono -> mult_dvd_mono
5104 zdvd_0_right -> dvd_0_right
5105 zdvd_0_left -> dvd_0_left_iff
5106 zdvd_1_left -> one_dvd
5107 zminus_dvd_iff -> minus_dvd_iff
5109 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
5111 * The real numbers offer decimal input syntax: 12.34 is translated
5112 into 1234/10^2. This translation is not reversed upon output.
5114 * Theory Library/Polynomial defines an abstract type 'a poly of
5115 univariate polynomials with coefficients of type 'a. In addition to
5116 the standard ring operations, it also supports div and mod. Code
5117 generation is also supported, using list-style constructors.
5119 * Theory Library/Inner_Product defines a class of real_inner for real
5120 inner product spaces, with an overloaded operation inner :: 'a => 'a
5121 => real. Class real_inner is a subclass of real_normed_vector from
5124 * Theory Library/Product_Vector provides instances for the product
5125 type 'a * 'b of several classes from RealVector and Inner_Product.
5126 Definitions of addition, subtraction, scalar multiplication, norms,
5127 and inner products are included.
5129 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
5130 addition to the field operations, numerals and case syntax are also
5133 * Theory Library/Diagonalize provides constructive version of Cantor's
5134 first diagonalization argument.
5136 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
5137 zlcm (for int); carried together from various gcd/lcm developements in
5138 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
5139 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
5140 may recover tupled syntax as follows:
5142 hide (open) const gcd
5143 abbreviation gcd where
5144 "gcd == (%(a, b). GCD.gcd a b)"
5146 GCD.gcd ("gcd '(_, _')")
5148 The same works for lcm, zgcd, zlcm.
5150 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
5151 instantiations for algebraic structures. Removed some duplicate
5152 theorems. Changes in simp rules. INCOMPATIBILITY.
5154 * ML antiquotation @{code} takes a constant as argument and generates
5155 corresponding code in background and inserts name of the corresponding
5156 resulting ML value/function/datatype constructor binding in place.
5157 All occurrences of @{code} with a single ML block are generated
5158 simultaneously. Provides a generic and safe interface for
5159 instrumentalizing code generation. See
5160 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
5161 In future you ought to refrain from ad-hoc compiling generated SML
5162 code on the ML toplevel. Note that (for technical reasons) @{code}
5163 cannot refer to constants for which user-defined serializations are
5164 set. Refer to the corresponding ML counterpart directly in that
5167 * Command 'rep_datatype': instead of theorem names the command now
5168 takes a list of terms denoting the constructors of the type to be
5169 represented as datatype. The characteristic theorems have to be
5170 proven. INCOMPATIBILITY. Also observe that the following theorems
5171 have disappeared in favour of existing ones:
5173 unit_induct ~> unit.induct
5174 prod_induct ~> prod.induct
5175 sum_induct ~> sum.induct
5176 Suc_Suc_eq ~> nat.inject
5177 Suc_not_Zero Zero_not_Suc ~> nat.distinct
5182 * New locales for orders and lattices where the equivalence relation
5183 is not restricted to equality. INCOMPATIBILITY: all order and lattice
5184 locales use a record structure with field eq for the equivalence.
5186 * New theory of factorial domains.
5188 * Units_l_inv and Units_r_inv are now simp rules by default.
5189 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
5190 and/or r_inv will now also require deletion of these lemmas.
5192 * Renamed the following theorems, INCOMPATIBILITY:
5194 UpperD ~> Upper_memD
5195 LowerD ~> Lower_memD
5196 least_carrier ~> least_closed
5197 greatest_carrier ~> greatest_closed
5198 greatest_Lower_above ~> greatest_Lower_below
5199 one_zero ~> carrier_one_zero
5200 one_not_zero ~> carrier_one_not_zero (collision with assumption)
5205 * Nominal datatypes can now contain type-variables.
5207 * Commands 'nominal_inductive' and 'equivariance' work with local
5210 * Nominal primrec can now works with local theory targets and its
5211 specification syntax now conforms to the general format as seen in
5214 * Method "perm_simp" honours the standard simplifier attributes
5215 (no_asm), (no_asm_use) etc.
5217 * The new predicate #* is defined like freshness, except that on the
5218 left hand side can be a set or list of atoms.
5220 * Experimental command 'nominal_inductive2' derives strong induction
5221 principles for inductive definitions. In contrast to
5222 'nominal_inductive', which can only deal with a fixed number of
5223 binders, it can deal with arbitrary expressions standing for sets of
5224 atoms to be avoided. The only inductive definition we have at the
5225 moment that needs this generalisation is the typing rule for Lets in
5228 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
5229 -----------------------------------------------------------------
5230 Gamma |- Let x be t1 in t2 : T2
5232 In this rule one wants to avoid all the binders that are introduced by
5233 "close Gamma T1". We are looking for other examples where this
5234 feature might be useful. Please let us know.
5239 * Reimplemented the simplification procedure for proving continuity
5240 subgoals. The new simproc is extensible; users can declare additional
5241 continuity introduction rules with the attribute [cont2cont].
5243 * The continuity simproc now uses a different introduction rule for
5244 solving continuity subgoals on terms with lambda abstractions. In
5245 some rare cases the new simproc may fail to solve subgoals that the
5246 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
5247 Potential INCOMPATIBILITY.
5249 * Command 'fixrec': specification syntax now conforms to the general
5250 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
5251 examples. INCOMPATIBILITY.
5256 * Proof of Zorn's Lemma for partial orders.
5261 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
5262 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
5263 depends on multithreading, so timouts will not work before Poly/ML
5266 * High-level support for concurrent ML programming, see
5267 src/Pure/Cuncurrent. The data-oriented model of "future values" is
5268 particularly convenient to organize independent functional
5269 computations. The concept of "synchronized variables" provides a
5270 higher-order interface for components with shared state, avoiding the
5271 delicate details of mutexes and condition variables. (Requires
5272 Poly/ML 5.2.1 or later.)
5274 * ML bindings produced via Isar commands are stored within the Isar
5275 context (theory or proof). Consequently, commands like 'use' and 'ML'
5276 become thread-safe and work with undo as expected (concerning
5277 top-level bindings, not side-effects on global references).
5278 INCOMPATIBILITY, need to provide proper Isar context when invoking the
5279 compiler at runtime; really global bindings need to be given outside a
5280 theory. (Requires Poly/ML 5.2 or later.)
5282 * Command 'ML_prf' is analogous to 'ML' but works within a proof
5283 context. Top-level ML bindings are stored within the proof context in
5284 a purely sequential fashion, disregarding the nested proof structure.
5285 ML bindings introduced by 'ML_prf' are discarded at the end of the
5286 proof. (Requires Poly/ML 5.2 or later.)
5288 * Simplified ML attribute and method setup, cf. functions Attrib.setup
5289 and Method.setup, as well as Isar commands 'attribute_setup' and
5290 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
5291 existing code accordingly, or use plain 'setup' together with old
5294 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
5295 to 'a -> thm, while results are always tagged with an authentic oracle
5296 name. The Isar command 'oracle' is now polymorphic, no argument type
5297 is specified. INCOMPATIBILITY, need to simplify existing oracle code
5298 accordingly. Note that extra performance may be gained by producing
5299 the cterm carefully, avoiding slow Thm.cterm_of.
5301 * Simplified interface for defining document antiquotations via
5302 ThyOutput.antiquotation, ThyOutput.output, and optionally
5303 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
5304 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
5307 * More systematic treatment of long names, abstract name bindings, and
5308 name space operations. Basic operations on qualified names have been
5309 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
5310 Long_Name.append. Old type bstring has been mostly replaced by
5311 abstract type binding (see structure Binding), which supports precise
5312 qualification by packages and local theory targets, as well as proper
5313 tracking of source positions. INCOMPATIBILITY, need to wrap old
5314 bstring values into Binding.name, or better pass through abstract
5315 bindings everywhere. See further src/Pure/General/long_name.ML,
5316 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
5318 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
5319 LocalTheory.note etc.) now refer to the *full* internal name, not the
5320 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
5322 * Disposed old type and term read functions (Sign.read_def_typ,
5323 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
5324 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
5325 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
5326 Syntax.read_term_global etc.; see also OldGoals.read_term as last
5327 resort for legacy applications.
5329 * Disposed old declarations, tactics, tactic combinators that refer to
5330 the simpset or claset of an implicit theory (such as Addsimps,
5331 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
5332 embedded ML text, or local_simpset_of with a proper context passed as
5333 explicit runtime argument.
5335 * Rules and tactics that read instantiations (read_instantiate,
5336 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
5337 context, which is required for parsing and type-checking. Moreover,
5338 the variables are specified as plain indexnames, not string encodings
5339 thereof. INCOMPATIBILITY.
5341 * Generic Toplevel.add_hook interface allows to analyze the result of
5342 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
5343 for theorem dependency output of transactions resulting in a new
5346 * ML antiquotations: block-structured compilation context indicated by
5347 \<lbrace> ... \<rbrace>; additional antiquotation forms:
5349 @{binding name} - basic name binding
5350 @{let ?pat = term} - term abbreviation (HO matching)
5351 @{note name = fact} - fact abbreviation
5352 @{thm fact} - singleton fact (with attributes)
5353 @{thms fact} - general fact (with attributes)
5354 @{lemma prop by method} - singleton goal
5355 @{lemma prop by meth1 meth2} - singleton goal
5356 @{lemma prop1 ... propN by method} - general goal
5357 @{lemma prop1 ... propN by meth1 meth2} - general goal
5358 @{lemma (open) ...} - open derivation
5363 * The Isabelle "emacs" tool provides a specific interface to invoke
5364 Proof General / Emacs, with more explicit failure if that is not
5365 installed (the old isabelle-interface script silently falls back on
5366 isabelle-process). The PROOFGENERAL_HOME setting determines the
5367 installation location of the Proof General distribution.
5369 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
5370 the Isabelle process into a JVM/Scala application. See
5371 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
5372 process wrapper has been discontinued.)
5374 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
5376 * Various status messages (with exact source position information) are
5377 emitted, if proper markup print mode is enabled. This allows
5378 user-interface components to provide detailed feedback on internal
5383 New in Isabelle2008 (June 2008)
5384 -------------------------------
5388 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
5389 and updated, with formally checked references as hyperlinks.
5391 * Theory loader: use_thy (and similar operations) no longer set the
5392 implicit ML context, which was occasionally hard to predict and in
5393 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
5394 provides a proper context already.
5396 * Theory loader: old-style ML proof scripts being *attached* to a thy
5397 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
5398 'use' within a theory file will do the job.
5400 * Name space merge now observes canonical order, i.e. the second space
5401 is inserted into the first one, while existing entries in the first
5402 space take precedence. INCOMPATIBILITY in rare situations, may try to
5403 swap theory imports.
5405 * Syntax: symbol \<chi> is now considered a letter. Potential
5406 INCOMPATIBILITY in identifier syntax etc.
5408 * Outer syntax: string tokens no longer admit escaped white space,
5409 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
5410 white space without escapes.
5412 * Outer syntax: string tokens may contain arbitrary character codes
5413 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
5419 * Context-dependent token translations. Default setup reverts locally
5420 fixed variables, and adds hilite markup for undeclared frees.
5422 * Unused theorems can be found using the new command 'unused_thms'.
5423 There are three ways of invoking it:
5426 Only finds unused theorems in the current theory.
5428 (2) unused_thms thy_1 ... thy_n -
5429 Finds unused theorems in the current theory and all of its ancestors,
5430 excluding the theories thy_1 ... thy_n and all of their ancestors.
5432 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
5433 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
5434 their ancestors, excluding the theories thy_1 ... thy_n and all of
5437 In order to increase the readability of the list produced by
5438 unused_thms, theorems that have been created by a particular instance
5439 of a theory command such as 'inductive' or 'function' are considered
5440 to belong to the same "group", meaning that if at least one theorem in
5441 this group is used, the other theorems in the same group are no longer
5442 reported as unused. Moreover, if all theorems in the group are
5443 unused, only one theorem in the group is displayed.
5445 Note that proof objects have to be switched on in order for
5446 unused_thms to work properly (i.e. !proofs must be >= 1, which is
5447 usually the case when using Proof General with the default settings).
5449 * Authentic naming of facts disallows ad-hoc overwriting of previous
5450 theorems within the same name space. INCOMPATIBILITY, need to remove
5451 duplicate fact bindings, or even accidental fact duplications. Note
5452 that tools may maintain dynamically scoped facts systematically, using
5453 PureThy.add_thms_dynamic.
5455 * Command 'hide' now allows to hide from "fact" name space as well.
5457 * Eliminated destructive theorem database, simpset, claset, and
5458 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
5459 update of theories within ML code.
5461 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
5462 INCOMPATIBILITY, object-logics depending on former Pure require
5463 additional setup PureThy.old_appl_syntax_setup; object-logics
5464 depending on former CPure need to refer to Pure.
5466 * Commands 'use' and 'ML' are now purely functional, operating on
5467 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
5468 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
5471 * Command 'setup': discontinued implicit version with ML reference.
5473 * Instantiation target allows for simultaneous specification of class
5474 instance operations together with an instantiation proof.
5475 Type-checking phase allows to refer to class operations uniformly.
5476 See src/HOL/Complex/Complex.thy for an Isar example and
5477 src/HOL/Library/Eval.thy for an ML example.
5479 * Indexing of literal facts: be more serious about including only
5480 facts from the visible specification/proof context, but not the
5481 background context (locale etc.). Affects `prop` notation and method
5482 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
5485 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
5486 "(open)" option, which used to expose internal bound variables to the
5489 * Isar statements: removed obsolete case "rule_context".
5490 INCOMPATIBILITY, better use explicit fixes/assumes.
5492 * Locale proofs: default proof step now includes 'unfold_locales';
5493 hence 'proof' without argument may be used to unfold locale
5497 *** Document preparation ***
5499 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
5500 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
5501 obsolete thumbpdf setup (contemporary PDF viewers do this on the
5502 spot); renamed link color from "darkblue" to "linkcolor" (default
5503 value unchanged, can be redefined via \definecolor); no longer sets
5504 "a4paper" option (unnecessary or even intrusive).
5506 * Antiquotation @{lemma A method} proves proposition A by the given
5507 method (either a method name or a method name plus (optional) method
5508 arguments in parentheses) and prints A just like @{prop A}.
5513 * New primrec package. Specification syntax conforms in style to
5514 definition/function/.... No separate induction rule is provided. The
5515 "primrec" command distinguishes old-style and new-style specifications
5516 by syntax. The former primrec package is now named OldPrimrecPackage.
5517 When adjusting theories, beware: constants stemming from new-style
5518 primrec specifications have authentic syntax.
5520 * Metis prover is now an order of magnitude faster, and also works
5521 with multithreading.
5523 * Metis: the maximum number of clauses that can be produced from a
5524 theorem is now given by the attribute max_clauses. Theorems that
5525 exceed this number are ignored, with a warning printed.
5527 * Sledgehammer no longer produces structured proofs by default. To
5528 enable, declare [[sledgehammer_full = true]]. Attributes
5529 reconstruction_modulus, reconstruction_sorts renamed
5530 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
5532 * Method "induct_scheme" derives user-specified induction rules
5533 from well-founded induction and completeness of patterns. This factors
5534 out some operations that are done internally by the function package
5535 and makes them available separately. See
5536 src/HOL/ex/Induction_Scheme.thy for examples.
5538 * More flexible generation of measure functions for termination
5539 proofs: Measure functions can be declared by proving a rule of the
5540 form "is_measure f" and giving it the [measure_function] attribute.
5541 The "is_measure" predicate is logically meaningless (always true), and
5542 just guides the heuristic. To find suitable measure functions, the
5543 termination prover sets up the goal "is_measure ?f" of the appropriate
5544 type and generates all solutions by prolog-style backwards proof using
5547 This setup also deals with rules like
5549 "is_measure f ==> is_measure (list_size f)"
5551 which accommodates nested datatypes that recurse through lists.
5552 Similar rules are predeclared for products and option types.
5554 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
5558 - Definitions of overloaded constants on sets have to be replaced by
5559 definitions on => and bool.
5561 - Some definitions of overloaded operators on sets can now be proved
5562 using the definitions of the operators on => and bool. Therefore,
5563 the following theorems have been renamed:
5565 subset_def -> subset_eq
5566 psubset_def -> psubset_eq
5567 set_diff_def -> set_diff_eq
5568 Compl_def -> Compl_eq
5569 Sup_set_def -> Sup_set_eq
5570 Inf_set_def -> Inf_set_eq
5571 sup_set_def -> sup_set_eq
5572 inf_set_def -> inf_set_eq
5574 - Due to the incompleteness of the HO unification algorithm, some
5575 rules such as subst may require manual instantiation, if some of
5576 the unknowns in the rule is a set.
5578 - Higher order unification and forward proofs:
5581 have "P (S::'a set)" <...>
5582 then have "EX S. P S" ..
5584 no longer works (due to the incompleteness of the HO unification
5585 algorithm) and must be replaced by the pattern
5592 - Calculational reasoning with subst (or similar rules):
5595 have "P (S::'a set)" <...>
5596 also have "S = T" <...>
5597 finally have "P T" .
5599 no longer works (for similar reasons as the previous example) and
5600 must be replaced by something like
5602 have "P (S::'a set)" <...>
5603 moreover have "S = T" <...>
5604 ultimately have "P T" by simp
5606 - Tactics or packages written in ML code:
5607 Code performing pattern matching on types via
5609 Type ("set", [T]) => ...
5611 must be rewritten. Moreover, functions like strip_type or
5612 binder_types no longer return the right value when applied to a
5615 T1 => ... => Tn => U => bool
5619 T1 => ... => Tn => U set
5621 * Merged theories Wellfounded_Recursion, Accessible_Part and
5622 Wellfounded_Relations to theory Wellfounded.
5624 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
5626 * Class finite no longer treats UNIV as class parameter. Use class
5627 enum from theory Library/Enum instead to achieve a similar effect.
5630 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
5631 and "Cons". INCOMPATIBILITY.
5633 * HOL (and FOL): renamed variables in rules imp_elim and swap.
5634 Potential INCOMPATIBILITY.
5636 * Theory Product_Type: duplicated lemmas split_Pair_apply and
5637 injective_fst_snd removed, use split_eta and prod_eqI instead.
5638 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
5640 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
5641 the same name in theory Orderings:
5651 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
5652 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
5653 and different variable names.
5655 * Library/Option_ord.thy: Canonical order on option type.
5657 * Library/RBT.thy: Red-black trees, an efficient implementation of
5660 * Library/Countable.thy: Type class for countable types.
5662 * Theory Int: The representation of numerals has changed. The infix
5663 operator BIT and the bit datatype with constructors B0 and B1 have
5664 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
5665 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
5666 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
5669 * Theory Nat: definition of <= and < on natural numbers no longer
5670 depend on well-founded relations. INCOMPATIBILITY. Definitions
5671 le_def and less_def have disappeared. Consider lemmas not_less
5672 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
5674 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
5675 (whose purpose mainly is for various fold_set functionals) have been
5676 abandoned in favor of the existing algebraic classes
5677 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
5678 lower_semilattice (resp. upper_semilattice) and linorder.
5681 * Theory Transitive_Closure: induct and cases rules now declare proper
5682 case_names ("base" and "step"). INCOMPATIBILITY.
5684 * Theorem Inductive.lfp_ordinal_induct generalized to complete
5685 lattices. The form set-specific version is available as
5686 Inductive.lfp_ordinal_induct_set.
5688 * Renamed theorems "power.simps" to "power_int.simps".
5691 * Class semiring_div provides basic abstract properties of semirings
5692 with division and modulo operations. Subsumes former class dvd_mod.
5694 * Merged theories IntDef, Numeral and IntArith into unified theory
5695 Int. INCOMPATIBILITY.
5697 * Theory Library/Code_Index: type "index" now represents natural
5698 numbers rather than integers. INCOMPATIBILITY.
5700 * New class "uminus" with operation "uminus" (split of from class
5701 "minus" which now only has operation "minus", binary).
5704 * Constants "card", "internal_split", "option_map" now with authentic
5705 syntax. INCOMPATIBILITY.
5707 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
5708 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
5709 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
5710 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
5711 Sup_set_def, le_def, less_def, option_map_def now with object
5712 equality. INCOMPATIBILITY.
5714 * Records. Removed K_record, and replaced it by pure lambda term
5715 %x. c. The simplifier setup is now more robust against eta expansion.
5716 INCOMPATIBILITY: in cases explicitly referring to K_record.
5718 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
5720 * Library/ListVector: new theory of arithmetic vector operations.
5722 * Library/Order_Relation: new theory of various orderings as sets of
5723 pairs. Defines preorders, partial orders, linear orders and
5724 well-orders on sets and on types.
5729 * Renamed some theories to allow to loading both ZF and HOL in the
5732 Datatype -> Datatype_ZF
5733 Inductive -> Inductive_ZF
5740 INCOMPATIBILITY: ZF theories that import individual theories below
5741 Main might need to be adapted. Regular theory Main is still
5742 available, as trivial extension of Main_ZF.
5747 * ML within Isar: antiquotation @{const name} or @{const
5748 name(typargs)} produces statically-checked Const term.
5750 * Functor NamedThmsFun: data is available to the user as dynamic fact
5751 (of the same name). Removed obsolete print command.
5753 * Removed obsolete "use_legacy_bindings" function.
5755 * The ``print mode'' is now a thread-local value derived from a global
5756 template (the former print_mode reference), thus access becomes
5757 non-critical. The global print_mode reference is for session
5758 management only; user-code should use print_mode_value,
5759 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
5761 * Functions system/system_out provide a robust way to invoke external
5762 shell commands, with propagation of interrupts (requires Poly/ML
5763 5.2.1). Do not use OS.Process.system etc. from the basis library!
5768 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
5769 in accordance with Proof General 3.7, which prefers GNU emacs.
5771 * isatool tty runs Isabelle process with plain tty interaction;
5772 optional line editor may be specified via ISABELLE_LINE_EDITOR
5773 setting, the default settings attempt to locate "ledit" and "rlwrap".
5775 * isatool browser now works with Cygwin as well, using general
5776 "javapath" function defined in Isabelle process environment.
5778 * YXML notation provides a simple and efficient alternative to
5779 standard XML transfer syntax. See src/Pure/General/yxml.ML and
5780 isatool yxml as described in the Isabelle system manual.
5782 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
5783 provides general wrapper for managing an Isabelle process in a robust
5784 fashion, with ``cooked'' output from stdin/stderr.
5786 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
5787 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
5789 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
5790 way of changing the user's settings is via
5791 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
5794 * Multithreading.max_threads := 0 refers to the number of actual CPU
5795 cores of the underlying machine, which is a good starting point for
5796 optimal performance tuning. The corresponding usedir option -M allows
5797 "max" as an alias for "0". WARNING: does not work on certain versions
5798 of Mac OS (with Poly/ML 5.1).
5800 * isabelle-process: non-ML sessions are run with "nice", to reduce the
5801 adverse effect of Isabelle flooding interactive front-ends (notably
5802 ProofGeneral / XEmacs).
5806 New in Isabelle2007 (November 2007)
5807 -----------------------------------
5811 * More uniform information about legacy features, notably a
5812 warning/error of "Legacy feature: ...", depending on the state of the
5813 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
5814 legacy features will disappear eventually.
5816 * Theory syntax: the header format ``theory A = B + C:'' has been
5817 discontinued in favour of ``theory A imports B C begin''. Use isatool
5818 fixheaders to convert existing theory files. INCOMPATIBILITY.
5820 * Theory syntax: the old non-Isar theory file format has been
5821 discontinued altogether. Note that ML proof scripts may still be used
5822 with Isar theories; migration is usually quite simple with the ML
5823 function use_legacy_bindings. INCOMPATIBILITY.
5825 * Theory syntax: some popular names (e.g. 'class', 'declaration',
5826 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
5829 * Theory loader: be more serious about observing the static theory
5830 header specifications (including optional directories), but not the
5831 accidental file locations of previously successful loads. The strict
5832 update policy of former update_thy is now already performed by
5833 use_thy, so the former has been removed; use_thys updates several
5834 theories simultaneously, just as 'imports' within a theory header
5835 specification, but without merging the results. Potential
5836 INCOMPATIBILITY: may need to refine theory headers and commands
5837 ROOT.ML which depend on load order.
5839 * Theory loader: optional support for content-based file
5840 identification, instead of the traditional scheme of full physical
5841 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
5842 (cf. the system manual). The new scheme allows to work with
5843 non-finished theories in persistent session images, such that source
5844 files may be moved later on without requiring reloads.
5846 * Theory loader: old-style ML proof scripts being *attached* to a thy
5847 file (with the same base name as the theory) are considered a legacy
5848 feature, which will disappear eventually. Even now, the theory loader
5849 no longer maintains dependencies on such files.
5851 * Syntax: the scope for resolving ambiguities via type-inference is
5852 now limited to individual terms, instead of whole simultaneous
5853 specifications as before. This greatly reduces the complexity of the
5854 syntax module and improves flexibility by separating parsing and
5855 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
5856 'fixes' etc.) are required in rare situations.
5858 * Syntax: constants introduced by new-style packages ('definition',
5859 'abbreviation' etc.) are passed through the syntax module in
5860 ``authentic mode''. This means that associated mixfix annotations
5861 really stick to such constants, independently of potential name space
5862 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
5863 trees are represented slightly differently, may need to adapt syntax
5864 translations accordingly. Use CONST marker in 'translations' and
5865 @{const_syntax} antiquotation in 'parse_translation' etc.
5867 * Legacy goal package: reduced interface to the bare minimum required
5868 to keep existing proof scripts running. Most other user-level
5869 functions are now part of the OldGoals structure, which is *not* open
5870 by default (consider isatool expandshort before open OldGoals).
5871 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
5872 these tend to cause confusion about the actual goal (!) context being
5873 used here, which is not necessarily the same as the_context().
5875 * Command 'find_theorems': supports "*" wild-card in "name:"
5876 criterion; "with_dups" option. Certain ProofGeneral versions might
5877 support a specific search form (see ProofGeneral/CHANGES).
5879 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
5880 by default, which means that "prems" (and also "fixed variables") are
5881 suppressed from proof state output. Note that the ProofGeneral
5882 settings mechanism allows to change and save options persistently, but
5883 older versions of Isabelle will fail to start up if a negative prems
5886 * Local theory targets may be specified by non-nested blocks of
5887 ``context/locale/class ... begin'' followed by ``end''. The body may
5888 contain definitions, theorems etc., including any derived mechanism
5889 that has been implemented on top of these primitives. This concept
5890 generalizes the existing ``theorem (in ...)'' towards more versatility
5893 * Proof General interface: proper undo of final 'end' command;
5894 discontinued Isabelle/classic mode (ML proof scripts).
5897 *** Document preparation ***
5899 * Added antiquotation @{theory name} which prints the given name,
5900 after checking that it refers to a valid ancestor theory in the
5903 * Added antiquotations @{ML_type text} and @{ML_struct text} which
5904 check the given source text as ML type/structure, printing verbatim.
5906 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
5907 "c args == rhs" given in the current context. (Any number of
5908 arguments may be given on the LHS.)
5913 * The 'class' package offers a combination of axclass and locale to
5914 achieve Haskell-like type classes in Isabelle. Definitions and
5915 theorems within a class context produce both relative results (with
5916 implicit parameters according to the locale context), and polymorphic
5917 constants with qualified polymorphism (according to the class
5918 context). Within the body context of a 'class' target, a separate
5919 syntax layer ("user space type system") takes care of converting
5920 between global polymorphic consts and internal locale representation.
5921 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
5922 "isatool doc classes" provides a tutorial.
5924 * Generic code generator framework allows to generate executable
5925 code for ML and Haskell (including Isabelle classes). A short usage
5928 internal compilation:
5929 export_code <list of constants (term syntax)> in SML
5930 writing SML code to a file:
5931 export_code <list of constants (term syntax)> in SML <filename>
5932 writing OCaml code to a file:
5933 export_code <list of constants (term syntax)> in OCaml <filename>
5934 writing Haskell code to a bunch of files:
5935 export_code <list of constants (term syntax)> in Haskell <filename>
5937 evaluating closed propositions to True/False using code generation:
5940 Reasonable default setup of framework in HOL.
5942 Theorem attributs for selecting and transforming function equations theorems:
5944 [code fun]: select a theorem as function equation for a specific constant
5945 [code fun del]: deselect a theorem as function equation for a specific constant
5946 [code inline]: select an equation theorem for unfolding (inlining) in place
5947 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
5949 User-defined serializations (target in {SML, OCaml, Haskell}):
5951 code_const <and-list of constants (term syntax)>
5952 {(target) <and-list of const target syntax>}+
5954 code_type <and-list of type constructors>
5955 {(target) <and-list of type target syntax>}+
5957 code_instance <and-list of instances>
5959 where instance ::= <type constructor> :: <class>
5961 code_class <and_list of classes>
5962 {(target) <and-list of class target syntax>}+
5963 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
5965 code_instance and code_class only are effective to target Haskell.
5967 For example usage see src/HOL/ex/Codegenerator.thy and
5968 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
5969 generation from Isabelle/HOL theories is available via "isatool doc
5972 * Code generator: consts in 'consts_code' Isar commands are now
5973 referred to by usual term syntax (including optional type
5976 * Command 'no_translations' removes translation rules from theory
5979 * Overloaded definitions are now actually checked for acyclic
5980 dependencies. The overloading scheme is slightly more general than
5981 that of Haskell98, although Isabelle does not demand an exact
5982 correspondence to type class and instance declarations.
5983 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
5984 exotic versions of overloading -- at the discretion of the user!
5986 Polymorphic constants are represented via type arguments, i.e. the
5987 instantiation that matches an instance against the most general
5988 declaration given in the signature. For example, with the declaration
5989 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
5990 as c(nat). Overloading is essentially simultaneous structural
5991 recursion over such type arguments. Incomplete specification patterns
5992 impose global constraints on all occurrences, e.g. c('a * 'a) on the
5993 LHS means that more general c('a * 'b) will be disallowed on any RHS.
5994 Command 'print_theory' outputs the normalized system of recursive
5995 equations, see section "definitions".
5997 * Configuration options are maintained within the theory or proof
5998 context (with name and type bool/int/string), providing a very simple
5999 interface to a poor-man's version of general context data. Tools may
6000 declare options in ML (e.g. using Attrib.config_int) and then refer to
6001 these values using Config.get etc. Users may change options via an
6002 associated attribute of the same name. This form of context
6003 declaration works particularly well with commands 'declare' or
6004 'using', for example ``declare [[foo = 42]]''. Thus it has become
6005 very easy to avoid global references, which would not observe Isar
6006 toplevel undo/redo and fail to work with multithreading.
6008 Various global ML references of Pure and HOL have been turned into
6009 configuration options:
6011 Unify.search_bound unify_search_bound
6012 Unify.trace_bound unify_trace_bound
6013 Unify.trace_simp unify_trace_simp
6014 Unify.trace_types unify_trace_types
6015 Simplifier.simp_depth_limit simp_depth_limit
6016 Blast.depth_limit blast_depth_limit
6017 DatatypeProp.dtK datatype_distinctness_limit
6018 fast_arith_neq_limit fast_arith_neq_limit
6019 fast_arith_split_limit fast_arith_split_limit
6021 * Named collections of theorems may be easily installed as context
6022 data using the functor NamedThmsFun (see also
6023 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
6024 attributes; there is also a toplevel print command. This facility is
6025 just a common case of general context data, which is the preferred way
6026 for anything more complex than just a list of facts in canonical
6029 * Isar: command 'declaration' augments a local theory by generic
6030 declaration functions written in ML. This enables arbitrary content
6031 being added to the context, depending on a morphism that tells the
6032 difference of the original declaration context wrt. the application
6033 context encountered later on.
6035 * Isar: proper interfaces for simplification procedures. Command
6036 'simproc_setup' declares named simprocs (with match patterns, and body
6037 text in ML). Attribute "simproc" adds/deletes simprocs in the current
6038 context. ML antiquotation @{simproc name} retrieves named simprocs.
6040 * Isar: an extra pair of brackets around attribute declarations
6041 abbreviates a theorem reference involving an internal dummy fact,
6042 which will be ignored later --- only the effect of the attribute on
6043 the background context will persist. This form of in-place
6044 declarations is particularly useful with commands like 'declare' and
6045 'using', for example ``have A using [[simproc a]] by simp''.
6047 * Isar: method "assumption" (and implicit closing of subproofs) now
6048 takes simple non-atomic goal assumptions into account: after applying
6049 an assumption as a rule the resulting subgoals are solved by atomic
6050 assumption steps. This is particularly useful to finish 'obtain'
6051 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
6052 without referring to the original premise "!!x. P x ==> thesis" in the
6053 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
6056 * Isar: implicit use of prems from the Isar proof context is
6057 considered a legacy feature. Common applications like ``have A .''
6058 may be replaced by ``have A by fact'' or ``note `A`''. In general,
6059 referencing facts explicitly here improves readability and
6060 maintainability of proof texts.
6062 * Isar: improper proof element 'guess' is like 'obtain', but derives
6063 the obtained context from the course of reasoning! For example:
6065 assume "EX x y. A x & B y" -- "any previous fact"
6066 then guess x and y by clarify
6068 This technique is potentially adventurous, depending on the facts and
6069 proof tools being involved here.
6071 * Isar: known facts from the proof context may be specified as literal
6072 propositions, using ASCII back-quote syntax. This works wherever
6073 named facts used to be allowed so far, in proof commands, proof
6074 methods, attributes etc. Literal facts are retrieved from the context
6075 according to unification of type and term parameters. For example,
6076 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
6077 theorems in the current context, then these are valid literal facts:
6078 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
6080 There is also a proof method "fact" which does the same composition
6081 for explicit goal states, e.g. the following proof texts coincide with
6082 certain special cases of literal facts:
6084 have "A" by fact == note `A`
6085 have "A ==> B" by fact == note `A ==> B`
6086 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
6087 have "P a ==> Q a" by fact == note `P a ==> Q a`
6089 * Isar: ":" (colon) is no longer a symbolic identifier character in
6090 outer syntax. Thus symbolic identifiers may be used without
6091 additional white space in declarations like this: ``assume *: A''.
6093 * Isar: 'print_facts' prints all local facts of the current context,
6094 both named and unnamed ones.
6096 * Isar: 'def' now admits simultaneous definitions, e.g.:
6098 def x == "t" and y == "u"
6100 * Isar: added command 'unfolding', which is structurally similar to
6101 'using', but affects both the goal state and facts by unfolding given
6102 rewrite rules. Thus many occurrences of the 'unfold' method or
6103 'unfolded' attribute may be replaced by first-class proof text.
6105 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
6106 and command 'unfolding' now all support object-level equalities
6107 (potentially conditional). The underlying notion of rewrite rule is
6108 analogous to the 'rule_format' attribute, but *not* that of the
6109 Simplifier (which is usually more generous).
6111 * Isar: the new attribute [rotated n] (default n = 1) rotates the
6112 premises of a theorem by n. Useful in conjunction with drule.
6114 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
6115 method expression within a sandbox consisting of the first N
6116 sub-goals, which need to exist. For example, ``simp_all [3]''
6117 simplifies the first three sub-goals, while (rule foo, simp_all)[]
6118 simplifies all new goals that emerge from applying rule foo to the
6119 originally first one.
6121 * Isar: schematic goals are no longer restricted to higher-order
6122 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
6125 * Isar: the conclusion of a long theorem statement is now either
6126 'shows' (a simultaneous conjunction, as before), or 'obtains'
6127 (essentially a disjunction of cases with local parameters and
6128 assumptions). The latter allows to express general elimination rules
6129 adequately; in this notation common elimination rules look like this:
6131 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
6133 obtains x where "P x"
6135 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
6139 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
6145 The subsequent classical rules even refer to the formal "thesis"
6148 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
6151 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
6152 obtains "thesis ==> something"
6154 The actual proof of an 'obtains' statement is analogous to that of the
6155 Isar proof element 'obtain', only that there may be several cases.
6156 Optional case names may be specified in parentheses; these will be
6157 available both in the present proof and as annotations in the
6158 resulting rule, for later use with the 'cases' method (cf. attribute
6161 * Isar: the assumptions of a long theorem statement are available as
6162 "assms" fact in the proof context. This is more appropriate than the
6163 (historical) "prems", which refers to all assumptions of the current
6164 context, including those from the target locale, proof body etc.
6166 * Isar: 'print_statement' prints theorems from the current theory or
6167 proof context in long statement form, according to the syntax of a
6170 * Isar: 'obtain' takes an optional case name for the local context
6171 introduction rule (default "that").
6173 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
6174 explicit (is "_ ==> ?foo") in the rare cases where this still happens
6177 * Pure: syntax "CONST name" produces a fully internalized constant
6178 according to the current context. This is particularly useful for
6179 syntax translations that should refer to internal constant
6180 representations independently of name spaces.
6182 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
6183 instead of "FOO ". This allows multiple binder declarations to coexist
6184 in the same context. INCOMPATIBILITY.
6186 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
6187 primitive that also works in a locale context (both for constants and
6188 fixed variables). Type declaration and internal syntactic representation
6189 of given constants retrieved from the context. Likewise, the
6190 'no_notation' command allows to remove given syntax annotations from the
6193 * Isar/locales: new derived specification elements 'axiomatization',
6194 'definition', 'abbreviation', which support type-inference, admit
6195 object-level specifications (equality, equivalence). See also the
6196 isar-ref manual. Examples:
6199 eq (infix "===" 50) where
6200 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
6202 definition "f x y = x + y + 1"
6203 definition g where "g x = f x x"
6206 neq (infix "=!=" 50) where
6207 "x =!= y == ~ (x === y)"
6209 These specifications may be also used in a locale context. Then the
6210 constants being introduced depend on certain fixed parameters, and the
6211 constant name is qualified by the locale base name. An internal
6212 abbreviation takes care for convenient input and output, making the
6213 parameters implicit and using the original short name. See also
6214 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
6215 entities from a monomorphic theory.
6217 Presently, abbreviations are only available 'in' a target locale, but
6218 not inherited by general import expressions. Also note that
6219 'abbreviation' may be used as a type-safe replacement for 'syntax' +
6220 'translations' in common applications. The "no_abbrevs" print mode
6221 prevents folding of abbreviations in term output.
6223 Concrete syntax is attached to specified constants in internal form,
6224 independently of name spaces. The parse tree representation is
6225 slightly different -- use 'notation' instead of raw 'syntax', and
6226 'translations' with explicit "CONST" markup to accommodate this.
6228 * Pure/Isar: unified syntax for new-style specification mechanisms
6229 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
6230 full type inference and dummy patterns ("_"). For example:
6232 definition "K x _ = x"
6234 inductive conj for A B
6235 where "A ==> B ==> conj A B"
6237 * Pure: command 'print_abbrevs' prints all constant abbreviations of
6238 the current context. Print mode "no_abbrevs" prevents inversion of
6239 abbreviations on output.
6241 * Isar/locales: improved parameter handling: use of locales "var" and
6242 "struct" no longer necessary; - parameter renamings are no longer
6243 required to be injective. For example, this allows to define
6244 endomorphisms as locale endom = homom mult mult h.
6246 * Isar/locales: changed the way locales with predicates are defined.
6247 Instead of accumulating the specification, the imported expression is
6248 now an interpretation. INCOMPATIBILITY: different normal form of
6249 locale expressions. In particular, in interpretations of locales with
6250 predicates, goals repesenting already interpreted fragments are not
6251 removed automatically. Use methods `intro_locales' and
6252 `unfold_locales'; see below.
6254 * Isar/locales: new methods `intro_locales' and `unfold_locales'
6255 provide backward reasoning on locales predicates. The methods are
6256 aware of interpretations and discharge corresponding goals.
6257 `intro_locales' is less aggressive then `unfold_locales' and does not
6258 unfold predicates to assumptions.
6260 * Isar/locales: the order in which locale fragments are accumulated
6261 has changed. This enables to override declarations from fragments due
6262 to interpretations -- for example, unwanted simp rules.
6264 * Isar/locales: interpretation in theories and proof contexts has been
6265 extended. One may now specify (and prove) equations, which are
6266 unfolded in interpreted theorems. This is useful for replacing
6267 defined concepts (constants depending on locale parameters) by
6268 concepts already existing in the target context. Example:
6270 interpretation partial_order ["op <= :: [int, int] => bool"]
6271 where "partial_order.less (op <=) (x::int) y = (x < y)"
6273 Typically, the constant `partial_order.less' is created by a
6274 definition specification element in the context of locale
6277 * Method "induct": improved internal context management to support
6278 local fixes and defines on-the-fly. Thus explicit meta-level
6279 connectives !! and ==> are rarely required anymore in inductive goals
6280 (using object-logic connectives for this purpose has been long
6281 obsolete anyway). Common proof patterns are explained in
6282 src/HOL/Induct/Common_Patterns.thy, see also
6283 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
6286 * Method "induct": improved handling of simultaneous goals. Instead of
6287 introducing object-level conjunction, the statement is now split into
6288 several conclusions, while the corresponding symbolic cases are nested
6289 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
6290 see src/HOL/Induct/Common_Patterns.thy, for example.
6292 * Method "induct": mutual induction rules are now specified as a list
6293 of rule sharing the same induction cases. HOL packages usually provide
6294 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
6295 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
6296 mutual induction rules differently, i.e. like this:
6298 (induct rule: foo_bar.inducts)
6299 (induct set: foo bar)
6300 (induct pred: foo bar)
6301 (induct type: foo bar)
6303 The ML function ProjectRule.projections turns old-style rules into the
6306 * Method "coinduct": dual of induction, see
6307 src/HOL/Library/Coinductive_List.thy for various examples.
6309 * Method "cases", "induct", "coinduct": the ``(open)'' option is
6310 considered a legacy feature.
6312 * Attribute "symmetric" produces result with standardized schematic
6313 variables (index 0). Potential INCOMPATIBILITY.
6315 * Simplifier: by default the simplifier trace only shows top level
6316 rewrites now. That is, trace_simp_depth_limit is set to 1 by
6317 default. Thus there is less danger of being flooded by the trace. The
6318 trace indicates where parts have been suppressed.
6320 * Provers/classical: removed obsolete classical version of elim_format
6321 attribute; classical elim/dest rules are now treated uniformly when
6322 manipulating the claset.
6324 * Provers/classical: stricter checks to ensure that supplied intro,
6325 dest and elim rules are well-formed; dest and elim rules must have at
6328 * Provers/classical: attributes dest/elim/intro take an optional
6329 weight argument for the rule (just as the Pure versions). Weights are
6330 ignored by automated tools, but determine the search order of single
6333 * Syntax: input syntax now supports dummy variable binding "%_. b",
6334 where the body does not mention the bound variable. Note that dummy
6335 patterns implicitly depend on their context of bounds, which makes
6336 "{_. _}" match any set comprehension as expected. Potential
6337 INCOMPATIBILITY -- parse translations need to cope with syntactic
6338 constant "_idtdummy" in the binding position.
6340 * Syntax: removed obsolete syntactic constant "_K" and its associated
6341 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
6342 for example "A -> B" => "Pi A (%_. B)".
6344 * Pure: 'class_deps' command visualizes the subclass relation, using
6345 the graph browser tool.
6347 * Pure: 'print_theory' now suppresses certain internal declarations by
6348 default; use '!' option for full details.
6353 * Method "metis" proves goals by applying the Metis general-purpose
6354 resolution prover (see also http://gilith.com/software/metis/).
6355 Examples are in the directory MetisExamples. WARNING: the
6356 Isabelle/HOL-Metis integration does not yet work properly with
6359 * Command 'sledgehammer' invokes external automatic theorem provers as
6360 background processes. It generates calls to the "metis" method if
6361 successful. These can be pasted into the proof. Users do not have to
6362 wait for the automatic provers to return. WARNING: does not really
6363 work with multi-threading.
6365 * New "auto_quickcheck" feature tests outermost goal statements for
6366 potential counter-examples. Controlled by ML references
6367 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
6368 5000 milliseconds). Fails silently if statements is outside of
6369 executable fragment, or any other codgenerator problem occurs.
6371 * New constant "undefined" with axiom "undefined x = undefined".
6373 * Added class "HOL.eq", allowing for code generation with polymorphic
6376 * Some renaming of class constants due to canonical name prefixing in
6377 the new 'class' package:
6379 HOL.abs ~> HOL.abs_class.abs
6380 HOL.divide ~> HOL.divide_class.divide
6381 0 ~> HOL.zero_class.zero
6382 1 ~> HOL.one_class.one
6383 op + ~> HOL.plus_class.plus
6384 op - ~> HOL.minus_class.minus
6385 uminus ~> HOL.minus_class.uminus
6386 op * ~> HOL.times_class.times
6387 op < ~> HOL.ord_class.less
6388 op <= > HOL.ord_class.less_eq
6389 Nat.power ~> Power.power_class.power
6390 Nat.size ~> Nat.size_class.size
6391 Numeral.number_of ~> Numeral.number_class.number_of
6392 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
6393 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
6394 Orderings.min ~> Orderings.ord_class.min
6395 Orderings.max ~> Orderings.ord_class.max
6396 Divides.op div ~> Divides.div_class.div
6397 Divides.op mod ~> Divides.div_class.mod
6398 Divides.op dvd ~> Divides.div_class.dvd
6400 INCOMPATIBILITY. Adaptions may be required in the following cases:
6402 a) User-defined constants using any of the names "plus", "minus",
6403 "times", "less" or "less_eq". The standard syntax translations for
6404 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
6407 b) Variables named "plus", "minus", "times", "less", "less_eq"
6408 INCOMPATIBILITY: use more specific names.
6410 c) Permutative equations (e.g. "a + b = b + a")
6411 Since the change of names also changes the order of terms, permutative
6412 rewrite rules may get applied in a different order. Experience shows
6413 that this is rarely the case (only two adaptions in the whole Isabelle
6414 distribution). INCOMPATIBILITY: rewrite proofs
6416 d) ML code directly refering to constant names
6417 This in general only affects hand-written proof tactics, simprocs and
6418 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
6419 Consider using @{const_name} antiquotation.
6421 * New class "default" with associated constant "default".
6423 * Function "sgn" is now overloaded and available on int, real, complex
6424 (and other numeric types), using class "sgn". Two possible defs of
6425 sgn are given as equational assumptions in the classes sgn_if and
6426 sgn_div_norm; ordered_idom now also inherits from sgn_if.
6429 * Locale "partial_order" now unified with class "order" (cf. theory
6430 Orderings), added parameter "less". INCOMPATIBILITY.
6432 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
6433 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
6434 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
6436 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
6437 changed order of proof goals in instance proofs.
6439 * The transitivity reasoner for partial and linear orders is set up
6440 for classes "order" and "linorder". Instances of the reasoner are available
6441 in all contexts importing or interpreting the corresponding locales.
6442 Method "order" invokes the reasoner separately; the reasoner
6443 is also integrated with the Simplifier as a solver. Diagnostic
6444 command 'print_orders' shows the available instances of the reasoner
6445 in the current context.
6447 * Localized monotonicity predicate in theory "Orderings"; integrated
6448 lemmas max_of_mono and min_of_mono with this predicate.
6451 * Formulation of theorem "dense" changed slightly due to integration
6452 with new class dense_linear_order.
6454 * Uniform lattice theory development in HOL.
6456 constants "meet" and "join" now named "inf" and "sup"
6457 constant "Meet" now named "Inf"
6459 classes "meet_semilorder" and "join_semilorder" now named
6460 "lower_semilattice" and "upper_semilattice"
6461 class "lorder" now named "lattice"
6462 class "comp_lat" now named "complete_lattice"
6464 Instantiation of lattice classes allows explicit definitions
6465 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
6467 INCOMPATIBILITY. Theorem renames:
6469 meet_left_le ~> inf_le1
6470 meet_right_le ~> inf_le2
6471 join_left_le ~> sup_ge1
6472 join_right_le ~> sup_ge2
6473 meet_join_le ~> inf_sup_ord
6476 le_meet ~> le_inf_iff
6477 le_join ~> ge_sup_conv
6478 meet_idempotent ~> inf_idem
6479 join_idempotent ~> sup_idem
6480 meet_comm ~> inf_commute
6481 join_comm ~> sup_commute
6482 meet_leI1 ~> le_infI1
6483 meet_leI2 ~> le_infI2
6484 le_joinI1 ~> le_supI1
6485 le_joinI2 ~> le_supI2
6486 meet_assoc ~> inf_assoc
6487 join_assoc ~> sup_assoc
6488 meet_left_comm ~> inf_left_commute
6489 meet_left_idempotent ~> inf_left_idem
6490 join_left_comm ~> sup_left_commute
6491 join_left_idempotent ~> sup_left_idem
6494 le_def_meet ~> le_iff_inf
6495 le_def_join ~> le_iff_sup
6496 join_absorp2 ~> sup_absorb2
6497 join_absorp1 ~> sup_absorb1
6498 meet_absorp1 ~> inf_absorb1
6499 meet_absorp2 ~> inf_absorb2
6500 meet_join_absorp ~> inf_sup_absorb
6501 join_meet_absorp ~> sup_inf_absorb
6502 distrib_join_le ~> distrib_sup_le
6503 distrib_meet_le ~> distrib_inf_le
6505 add_meet_distrib_left ~> add_inf_distrib_left
6506 add_join_distrib_left ~> add_sup_distrib_left
6507 is_join_neg_meet ~> is_join_neg_inf
6508 is_meet_neg_join ~> is_meet_neg_sup
6509 add_meet_distrib_right ~> add_inf_distrib_right
6510 add_join_distrib_right ~> add_sup_distrib_right
6511 add_meet_join_distribs ~> add_sup_inf_distribs
6512 join_eq_neg_meet ~> sup_eq_neg_inf
6513 meet_eq_neg_join ~> inf_eq_neg_sup
6514 add_eq_meet_join ~> add_eq_inf_sup
6515 meet_0_imp_0 ~> inf_0_imp_0
6516 join_0_imp_0 ~> sup_0_imp_0
6517 meet_0_eq_0 ~> inf_0_eq_0
6518 join_0_eq_0 ~> sup_0_eq_0
6519 neg_meet_eq_join ~> neg_inf_eq_sup
6520 neg_join_eq_meet ~> neg_sup_eq_inf
6521 join_eq_if ~> sup_eq_if
6523 mono_meet ~> mono_inf
6524 mono_join ~> mono_sup
6525 meet_bool_eq ~> inf_bool_eq
6526 join_bool_eq ~> sup_bool_eq
6527 meet_fun_eq ~> inf_fun_eq
6528 join_fun_eq ~> sup_fun_eq
6529 meet_set_eq ~> inf_set_eq
6530 join_set_eq ~> sup_set_eq
6531 meet1_iff ~> inf1_iff
6532 meet2_iff ~> inf2_iff
6541 join1_iff ~> sup1_iff
6542 join2_iff ~> sup2_iff
6552 is_meet_Meet ~> is_meet_Inf
6553 Meet_bool_def ~> Inf_bool_def
6554 Meet_fun_def ~> Inf_fun_def
6555 Meet_greatest ~> Inf_greatest
6556 Meet_lower ~> Inf_lower
6557 Meet_set_def ~> Inf_set_def
6560 Sup_bool_eq ~> Sup_bool_def
6561 Sup_fun_eq ~> Sup_fun_def
6562 Sup_set_eq ~> Sup_set_def
6564 listsp_meetI ~> listsp_infI
6565 listsp_meet_eq ~> listsp_inf_eq
6570 * Added syntactic class "size"; overloaded constant "size" now has
6571 type "'a::size ==> bool"
6573 * Internal reorganisation of `size' of datatypes: size theorems
6574 "foo.size" are no longer subsumed by "foo.simps" (but are still
6575 simplification rules by default!); theorems "prod.size" now named
6578 * Class "div" now inherits from class "times" rather than "type".
6581 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
6582 Linorder etc. have disappeared; operations defined in terms of
6583 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
6585 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
6587 * HOL-Word: New extensive library and type for generic, fixed size
6588 machine words, with arithmetic, bit-wise, shifting and rotating
6589 operations, reflection into int, nat, and bool lists, automation for
6590 linear arithmetic (by automatic reflection into nat or int), including
6591 lemmas on overflow and monotonicity. Instantiated to all appropriate
6592 arithmetic type classes, supporting automatic simplification of
6593 numerals on all operations.
6595 * Library/Boolean_Algebra: locales for abstract boolean algebras.
6597 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
6599 * Code generator library theories:
6600 - Code_Integer represents HOL integers by big integer literals in target
6602 - Code_Char represents HOL characters by character literals in target
6604 - Code_Char_chr like Code_Char, but also offers treatment of character
6605 codes; includes Code_Integer.
6606 - Executable_Set allows to generate code for finite sets using lists.
6607 - Executable_Rat implements rational numbers as triples (sign, enumerator,
6609 - Executable_Real implements a subset of real numbers, namly those
6610 representable by rational numbers.
6611 - Efficient_Nat implements natural numbers by integers, which in general will
6612 result in higher efficency; pattern matching with 0/Suc is eliminated;
6613 includes Code_Integer.
6614 - Code_Index provides an additional datatype index which is mapped to
6615 target-language built-in integers.
6616 - Code_Message provides an additional datatype message_string which is isomorphic to
6617 strings; messages are mapped to target-language strings.
6619 * New package for inductive predicates
6621 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
6624 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6625 for z_1 :: U_1 and ... and z_n :: U_m
6627 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6630 with full support for type-inference, rather than
6632 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6634 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6635 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6637 inductive "s z_1 ... z_m"
6639 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6642 For backward compatibility, there is a wrapper allowing inductive
6643 sets to be defined with the new package via
6646 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6647 for z_1 :: U_1 and ... and z_n :: U_m
6649 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
6655 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
6656 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
6657 for z_1 :: U_1 and ... and z_n :: U_m
6659 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
6660 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
6663 if the additional syntax "p ..." is required.
6665 Numerous examples can be found in the subdirectories src/HOL/Auth,
6666 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
6670 - Since declaration and definition of inductive sets or predicates
6671 is no longer separated, abbreviations involving the newly
6672 introduced sets or predicates must be specified together with the
6673 introduction rules after the 'where' keyword (see above), rather
6674 than before the actual inductive definition.
6676 - The variables in induction and elimination rules are now
6677 quantified in the order of their occurrence in the introduction
6678 rules, rather than in alphabetical order. Since this may break
6679 some proofs, these proofs either have to be repaired, e.g. by
6680 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
6681 statements of the form
6683 case (rule_i a_i_1 ... a_i_{k_i})
6685 or the old order of quantification has to be restored by explicitly adding
6686 meta-level quantifiers in the introduction rules, i.e.
6688 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
6690 - The format of the elimination rules is now
6692 p z_1 ... z_m x_1 ... x_n ==>
6693 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6698 (x_1, ..., x_n) : s z_1 ... z_m ==>
6699 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
6702 for sets rather than
6704 x : s z_1 ... z_m ==>
6705 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
6708 This may require terms in goals to be expanded to n-tuples
6709 (e.g. using case_tac or simplification with the split_paired_all
6710 rule) before the above elimination rule is applicable.
6712 - The elimination or case analysis rules for (mutually) inductive
6713 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
6714 list of rules "p_1_..._p_k.elims" is no longer available.
6716 * New package "function"/"fun" for general recursive functions,
6717 supporting mutual and nested recursion, definitions in local contexts,
6718 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
6719 for small examples, and the separate tutorial on the function
6720 package. The old recdef "package" is still available as before, but
6721 users are encouraged to use the new package.
6723 * Method "lexicographic_order" automatically synthesizes termination
6724 relations as lexicographic combinations of size measures.
6726 * Case-expressions allow arbitrary constructor-patterns (including
6727 "_") and take their order into account, like in functional
6728 programming. Internally, this is translated into nested
6729 case-expressions; missing cases are added and mapped to the predefined
6730 constant "undefined". In complicated cases printing may no longer show
6731 the original input but the internal form. Lambda-abstractions allow
6732 the same form of pattern matching: "% pat1 => e1 | ..." is an
6733 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
6736 * IntDef: The constant "int :: nat => int" has been removed; now "int"
6737 is an abbreviation for "of_nat :: nat => int". The simplification
6738 rules for "of_nat" have been changed to work like "int" did
6739 previously. Potential INCOMPATIBILITY:
6740 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
6741 - of_nat_diff and of_nat_mult are no longer default simp rules
6743 * Method "algebra" solves polynomial equations over (semi)rings using
6744 Groebner bases. The (semi)ring structure is defined by locales and the
6745 tool setup depends on that generic context. Installing the method for
6746 a specific type involves instantiating the locale and possibly adding
6747 declarations for computation on the coefficients. The method is
6748 already instantiated for natural numbers and for the axiomatic class
6749 of idoms with numerals. See also the paper by Chaieb and Wenzel at
6750 CALCULEMUS 2007 for the general principles underlying this
6751 architecture of context-aware proof-tools.
6753 * Method "ferrack" implements quantifier elimination over
6754 special-purpose dense linear orders using locales (analogous to
6755 "algebra"). The method is already installed for class
6756 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
6759 * Former constant "List.op @" now named "List.append". Use ML
6760 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
6761 circumvent possible incompatibilities when working on ML level.
6763 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
6765 * New function listsum :: 'a list => 'a for arbitrary monoids.
6766 Special syntax: "SUM x <- xs. f x" (and latex variants)
6768 * New syntax for Haskell-like list comprehension (input only), eg.
6769 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
6771 * The special syntax for function "filter" has changed from [x :
6772 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
6773 comprehension syntax, and for uniformity. INCOMPATIBILITY.
6775 * [a..b] is now defined for arbitrary linear orders. It used to be
6776 defined on nat only, as an abbreviation for [a..<Suc b]
6779 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
6781 * New functions "sorted" and "sort" in src/HOL/List.thy.
6783 * New lemma collection field_simps (an extension of ring_simps) for
6784 manipulating (in)equations involving division. Multiplies with all
6785 denominators that can be proved to be non-zero (in equations) or
6786 positive/negative (in inequations).
6788 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
6789 have been improved and renamed to ring_simps, group_simps and
6790 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
6791 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
6793 * Theory Library/Commutative_Ring: switched from recdef to function
6794 package; constants add, mul, pow now curried. Infix syntax for
6795 algebraic operations.
6797 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
6800 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
6803 * HOL/records: generalised field-update to take a function on the
6804 field rather than the new value: r(|A := x|) is translated to A_update
6805 (K x) r The K-combinator that is internally used is called K_record.
6806 INCOMPATIBILITY: Usage of the plain update functions has to be
6809 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
6810 * x = 0, which are required for a semiring. Richer structures do not
6811 inherit from semiring_0 anymore, because this property is a theorem
6812 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
6813 there is more to prove, but this is mostly trivial.
6815 * Class "recpower" is generalized to arbitrary monoids, not just
6816 commutative semirings. INCOMPATIBILITY: may need to incorporate
6817 commutativity or semiring properties additionally.
6819 * Constant "List.list_all2" in List.thy now uses authentic syntax.
6820 INCOMPATIBILITY: translations containing list_all2 may go wrong,
6821 better use 'abbreviation'.
6823 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
6825 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
6826 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
6827 significant changes for setting up numeral syntax for types:
6828 - New constants Numeral.pred and Numeral.succ instead
6829 of former Numeral.bin_pred and Numeral.bin_succ.
6830 - Use integer operations instead of bin_add, bin_mult and so on.
6831 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
6832 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
6834 See src/HOL/Integ/IntArith.thy for an example setup.
6836 * Command 'normal_form' computes the normal form of a term that may
6837 contain free variables. For example ``normal_form "rev [a, b, c]"''
6838 produces ``[b, c, a]'' (without proof). This command is suitable for
6839 heavy-duty computations because the functions are compiled to ML
6840 first. Correspondingly, a method "normalization" is provided. See
6841 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
6843 * Alternative iff syntax "A <-> B" for equality on bool (with priority
6844 25 like -->); output depends on the "iff" print_mode, the default is
6845 "A = B" (with priority 50).
6847 * Relations less (<) and less_eq (<=) are also available on type bool.
6848 Modified syntax to disallow nesting without explicit parentheses,
6849 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
6852 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
6854 * Relation composition operator "op O" now has precedence 75 and binds
6855 stronger than union and intersection. INCOMPATIBILITY.
6857 * The old set interval syntax "{m..n(}" (and relatives) has been
6858 removed. Use "{m..<n}" (and relatives) instead.
6860 * In the context of the assumption "~(s = t)" the Simplifier rewrites
6861 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
6862 ``declare [[simproc del: neq]]''.
6864 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
6867 * Theorem Cons_eq_map_conv no longer declared as "simp".
6869 * Theorem setsum_mult renamed to setsum_right_distrib.
6871 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
6874 * Reimplemented methods "sat" and "satx", with several improvements:
6875 goals no longer need to be stated as "<prems> ==> False", equivalences
6876 (i.e. "=" on type bool) are handled, variable names of the form
6877 "lit_<n>" are no longer reserved, significant speedup.
6879 * Methods "sat" and "satx" can now replay MiniSat proof traces.
6880 zChaff is still supported as well.
6882 * 'inductive' and 'datatype': provide projections of mutual rules,
6883 bundled as foo_bar.inducts;
6885 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
6888 * Library: moved theory Accessible_Part to main HOL.
6890 * Library: added theory Coinductive_List of potentially infinite lists
6891 as greatest fixed-point.
6893 * Library: added theory AssocList which implements (finite) maps as
6896 * Method "evaluation" solves goals (i.e. a boolean expression)
6897 efficiently by compiling it to ML. The goal is "proved" (via an
6898 oracle) if it evaluates to True.
6900 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
6901 also when invoked by the simplifier. This results in the Simplifier
6902 being more powerful on arithmetic goals. INCOMPATIBILITY.
6903 Configuration option fast_arith_split_limit=0 recovers the old
6906 * Support for hex (0x20) and binary (0b1001) numerals.
6908 * New method: reify eqs (t), where eqs are equations for an
6909 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
6910 parameter, computes a term s::'b and a list xs::'a list and proves the
6911 theorem I xs s = t. This is also known as reification or quoting. The
6912 resulting theorem is applied to the subgoal to substitute t with I xs
6913 s. If t is omitted, the subgoal itself is reified.
6915 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
6916 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
6917 where f is supposed to be a computable function (in the sense of code
6918 generattion). The method uses reify to compute s and xs as above then
6919 applies corr_thm and uses normalization by evaluation to "prove" f s =
6920 r and finally gets the theorem t = r, which is again applied to the
6921 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
6923 * Reflection: Automatic reification now handels binding, an example is
6924 available in src/HOL/ex/ReflectionEx.thy
6926 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
6927 command 'statespace' that is similar to 'record', but introduces an
6928 abstract specification based on the locale infrastructure instead of
6929 HOL types. This leads to extra flexibility in composing state spaces,
6930 in particular multiple inheritance and renaming of components.
6935 * Hyperreal: Functions root and sqrt are now defined on negative real
6936 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
6937 Nonnegativity side conditions have been removed from many lemmas, so
6938 that more subgoals may now be solved by simplification; potential
6941 * Real: new type classes formalize real normed vector spaces and
6942 algebras, using new overloaded constants scaleR :: real => 'a => 'a
6943 and norm :: 'a => real.
6945 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
6946 reals into other types. The overloaded constant Reals :: 'a set is now
6947 defined as range of_real; potential INCOMPATIBILITY.
6949 * Real: proper support for ML code generation, including 'quickcheck'.
6950 Reals are implemented as arbitrary precision rationals.
6952 * Hyperreal: Several constants that previously worked only for the
6953 reals have been generalized, so they now work over arbitrary vector
6954 spaces. Type annotations may need to be added in some cases; potential
6957 Infinitesimal :: ('a::real_normed_vector) star set
6958 HFinite :: ('a::real_normed_vector) star set
6959 HInfinite :: ('a::real_normed_vector) star set
6960 approx :: ('a::real_normed_vector) star => 'a star => bool
6961 monad :: ('a::real_normed_vector) star => 'a star set
6962 galaxy :: ('a::real_normed_vector) star => 'a star set
6963 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
6964 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
6965 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
6966 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
6967 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
6968 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
6969 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
6970 sgn :: 'a::real_normed_vector => 'a
6971 exp :: 'a::{recpower,real_normed_field,banach} => 'a
6973 * Complex: Some complex-specific constants are now abbreviations for
6974 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
6975 hnorm. Other constants have been entirely removed in favor of the
6976 polymorphic versions (INCOMPATIBILITY):
6980 HInfinite <-- CInfinite
6981 Infinitesimal <-- CInfinitesimal
6984 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
6985 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
6986 (ns)deriv <-- (ns)cderiv
6991 * Formalisation of ideals and the quotient construction over rings.
6993 * Order and lattice theory no longer based on records.
6996 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
6997 greatest_closed. INCOMPATIBILITY.
6999 * Method algebra is now set up via an attribute. For examples see
7000 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
7001 of algebraic structures.
7003 * Renamed theory CRing to Ring.
7008 * Substantial, yet incomplete support for nominal datatypes (binding
7009 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
7010 src/HOL/Nominal/Examples. Prospective users should consult
7011 http://isabelle.in.tum.de/nominal/
7016 * ML basics: just one true type int, which coincides with IntInf.int
7019 * ML within Isar: antiquotations allow to embed statically-checked
7020 formal entities in the source, referring to the context available at
7021 compile-time. For example:
7023 ML {* @{sort "{zero,one}"} *}
7024 ML {* @{typ "'a => 'b"} *}
7025 ML {* @{term "%x. x"} *}
7026 ML {* @{prop "x == y"} *}
7027 ML {* @{ctyp "'a => 'b"} *}
7028 ML {* @{cterm "%x. x"} *}
7029 ML {* @{cprop "x == y"} *}
7030 ML {* @{thm asm_rl} *}
7031 ML {* @{thms asm_rl} *}
7032 ML {* @{type_name c} *}
7033 ML {* @{type_syntax c} *}
7034 ML {* @{const_name c} *}
7035 ML {* @{const_syntax c} *}
7038 ML {* @{theory Pure} *}
7039 ML {* @{theory_ref} *}
7040 ML {* @{theory_ref Pure} *}
7043 ML {* @{clasimpset} *}
7045 The same works for sources being ``used'' within an Isar context.
7047 * ML in Isar: improved error reporting; extra verbosity with
7048 ML_Context.trace enabled.
7050 * Pure/General/table.ML: the join operations now works via exceptions
7051 DUP/SAME instead of type option. This is simpler in simple cases, and
7052 admits slightly more efficient complex applications.
7054 * Pure: 'advanced' translation functions (parse_translation etc.) now
7055 use Context.generic instead of just theory.
7057 * Pure: datatype Context.generic joins theory/Proof.context and
7058 provides some facilities for code that works in either kind of
7059 context, notably GenericDataFun for uniform theory and proof data.
7061 * Pure: simplified internal attribute type, which is now always
7062 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
7063 local (Proof.context) attributes have been discontinued, while
7064 minimizing code duplication. Thm.rule_attribute and
7065 Thm.declaration_attribute build canonical attributes; see also structure
7066 Context for further operations on Context.generic, notably
7067 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
7068 declarations and definitions.
7070 * Context data interfaces (Theory/Proof/GenericDataFun): removed
7071 name/print, uninitialized data defaults to ad-hoc copy of empty value,
7072 init only required for impure data. INCOMPATIBILITY: empty really need
7073 to be empty (no dependencies on theory content!)
7075 * Pure/kernel: consts certification ignores sort constraints given in
7076 signature declarations. (This information is not relevant to the
7077 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
7078 potential INCOMPATIBILITY.
7080 * Pure: axiomatic type classes are now purely definitional, with
7081 explicit proofs of class axioms and super class relations performed
7082 internally. See Pure/axclass.ML for the main internal interfaces --
7083 notably AxClass.define_class supercedes AxClass.add_axclass, and
7084 AxClass.axiomatize_class/classrel/arity supersede
7085 Sign.add_classes/classrel/arities.
7087 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
7088 global/local versions on theory vs. Proof.context have been
7089 discontinued; Attrib.syntax and Method.syntax have been adapted
7090 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
7091 attributes, methods, etc.
7093 * Pure: several functions of signature "... -> theory -> theory * ..."
7094 have been reoriented to "... -> theory -> ... * theory" in order to
7095 allow natural usage in combination with the ||>, ||>>, |-> and
7096 fold_map combinators.
7098 * Pure: official theorem names (closed derivations) and additional
7099 comments (tags) are now strictly separate. Name hints -- which are
7100 maintained as tags -- may be attached any time without affecting the
7103 * Pure: primitive rule lift_rule now takes goal cterm instead of an
7104 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
7105 achieve the old behaviour.
7107 * Pure: the "Goal" constant is now called "prop", supporting a
7108 slightly more general idea of ``protecting'' meta-level rule
7111 * Pure: Logic.(un)varify only works in a global context, which is now
7112 enforced instead of silently assumed. INCOMPATIBILITY, may use
7113 Logic.legacy_(un)varify as temporary workaround.
7115 * Pure: structure Name provides scalable operations for generating
7116 internal variable names, notably Name.variants etc. This replaces
7117 some popular functions from term.ML:
7119 Term.variant -> Name.variant
7120 Term.variantlist -> Name.variant_list
7121 Term.invent_names -> Name.invent_list
7123 Note that low-level renaming rarely occurs in new code -- operations
7124 from structure Variable are used instead (see below).
7126 * Pure: structure Variable provides fundamental operations for proper
7127 treatment of fixed/schematic variables in a context. For example,
7128 Variable.import introduces fixes for schematics of given facts and
7129 Variable.export reverses the effect (up to renaming) -- this replaces
7130 various freeze_thaw operations.
7132 * Pure: structure Goal provides simple interfaces for
7133 init/conclude/finish and tactical prove operations (replacing former
7134 Tactic.prove). Goal.prove is the canonical way to prove results
7135 within a given context; Goal.prove_global is a degraded version for
7136 theory level goals, including a global Drule.standard. Note that
7137 OldGoals.prove_goalw_cterm has long been obsolete, since it is
7138 ill-behaved in a local proof context (e.g. with local fixes/assumes or
7139 in a locale context).
7141 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
7142 and type checking (Syntax.check_term etc.), with common combinations
7143 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
7144 which are considered legacy and await removal.
7146 * Pure/Syntax: generic interfaces for type unchecking
7147 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
7148 with common combinations (Syntax.pretty_term, Syntax.string_of_term
7149 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
7150 available for convenience, but refer to the very same operations using
7151 a mere theory instead of a full context.
7153 * Isar: simplified treatment of user-level errors, using exception
7154 ERROR of string uniformly. Function error now merely raises ERROR,
7155 without any side effect on output channels. The Isar toplevel takes
7156 care of proper display of ERROR exceptions. ML code may use plain
7157 handle/can/try; cat_error may be used to concatenate errors like this:
7159 ... handle ERROR msg => cat_error msg "..."
7161 Toplevel ML code (run directly or through the Isar toplevel) may be
7162 embedded into the Isar toplevel with exception display/debug like
7165 Isar.toplevel (fn () => ...)
7167 INCOMPATIBILITY, removed special transform_error facilities, removed
7168 obsolete variants of user-level exceptions (ERROR_MESSAGE,
7169 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
7170 -- use plain ERROR instead.
7172 * Isar: theory setup now has type (theory -> theory), instead of a
7173 list. INCOMPATIBILITY, may use #> to compose setup functions.
7175 * Isar: ML toplevel pretty printer for type Proof.context, subject to
7176 ProofContext.debug/verbose flags.
7178 * Isar: Toplevel.theory_to_proof admits transactions that modify the
7179 theory before entering a proof state. Transactions now always see a
7180 quasi-functional intermediate checkpoint, both in interactive and
7183 * Isar: simplified interfaces for outer syntax. Renamed
7184 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
7185 OuterSyntax.add_parsers -- this functionality is now included in
7186 OuterSyntax.command etc. INCOMPATIBILITY.
7188 * Simplifier: the simpset of a running simplification process now
7189 contains a proof context (cf. Simplifier.the_context), which is the
7190 very context that the initial simpset has been retrieved from (by
7191 simpset_of/local_simpset_of). Consequently, all plug-in components
7192 (solver, looper etc.) may depend on arbitrary proof data.
7194 * Simplifier.inherit_context inherits the proof context (plus the
7195 local bounds) of the current simplification process; any simproc
7196 etc. that calls the Simplifier recursively should do this! Removed
7197 former Simplifier.inherit_bounds, which is already included here --
7198 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
7199 specify an explicit context using Simplifier.context/theory_context.
7201 * Simplifier/Classical Reasoner: more abstract interfaces
7202 change_simpset/claset for modifying the simpset/claset reference of a
7203 theory; raw versions simpset/claset_ref etc. have been discontinued --
7206 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
7212 * settings: the default heap location within ISABELLE_HOME_USER now
7213 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
7214 Isabelle installations.
7216 * isabelle-process: option -S (secure mode) disables some critical
7217 operations, notably runtime compilation and evaluation of ML source
7220 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
7222 * Support for parallel execution, using native multicore support of
7223 Poly/ML 5.1. The theory loader exploits parallelism when processing
7224 independent theories, according to the given theory header
7225 specifications. The maximum number of worker threads is specified via
7226 usedir option -M or the "max-threads" setting in Proof General. A
7227 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
7228 to 6 on a 8-core machine. User-code needs to observe certain
7229 guidelines for thread-safe programming, see appendix A in the Isar
7230 Implementation manual.
7234 New in Isabelle2005 (October 2005)
7235 ----------------------------------
7239 * Theory headers: the new header syntax for Isar theories is
7242 imports <theory1> ... <theoryN>
7243 uses <file1> ... <fileM>
7246 where the 'uses' part is optional. The previous syntax
7248 theory <name> = <theory1> + ... + <theoryN>:
7250 will disappear in the next release. Use isatool fixheaders to convert
7251 existing theory files. Note that there is no change in ancient
7252 non-Isar theories now, but these will disappear soon.
7254 * Theory loader: parent theories can now also be referred to via
7255 relative and absolute paths.
7257 * Command 'find_theorems' searches for a list of criteria instead of a
7258 list of constants. Known criteria are: intro, elim, dest, name:string,
7259 simp:term, and any term. Criteria can be preceded by '-' to select
7260 theorems that do not match. Intro, elim, dest select theorems that
7261 match the current goal, name:s selects theorems whose fully qualified
7262 name contain s, and simp:term selects all simplification rules whose
7263 lhs match term. Any other term is interpreted as pattern and selects
7264 all theorems matching the pattern. Available in ProofGeneral under
7265 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
7267 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
7269 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
7270 matching the current goal as introduction rule and not having "HOL."
7271 in their name (i.e. not being defined in theory HOL).
7273 * Command 'thms_containing' has been discontinued in favour of
7274 'find_theorems'; INCOMPATIBILITY.
7276 * Communication with Proof General is now 8bit clean, which means that
7277 Unicode text in UTF-8 encoding may be used within theory texts (both
7278 formal and informal parts). Cf. option -U of the Isabelle Proof
7279 General interface. Here are some simple examples (cf. src/HOL/ex):
7281 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
7282 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
7284 * Improved efficiency of the Simplifier and, to a lesser degree, the
7285 Classical Reasoner. Typical big applications run around 2 times
7289 *** Document preparation ***
7291 * Commands 'display_drafts' and 'print_drafts' perform simple output
7292 of raw sources. Only those symbols that do not require additional
7293 LaTeX packages (depending on comments in isabellesym.sty) are
7294 displayed properly, everything else is left verbatim. isatool display
7295 and isatool print are used as front ends (these are subject to the
7296 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
7298 * Command tags control specific markup of certain regions of text,
7299 notably folding and hiding. Predefined tags include "theory" (for
7300 theory begin and end), "proof" for proof commands, and "ML" for
7301 commands involving ML code; the additional tags "visible" and
7302 "invisible" are unused by default. Users may give explicit tag
7303 specifications in the text, e.g. ''by %invisible (auto)''. The
7304 interpretation of tags is determined by the LaTeX job during document
7305 preparation: see option -V of isatool usedir, or options -n and -t of
7306 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
7309 Several document versions may be produced at the same time via isatool
7310 usedir (the generated index.html will link all of them). Typical
7311 specifications include ''-V document=theory,proof,ML'' to present
7312 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
7313 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
7314 these parts without any formal replacement text. The Isabelle site
7315 default settings produce ''document'' and ''outline'' versions as
7318 * Several new antiquotations:
7320 @{term_type term} prints a term with its type annotated;
7322 @{typeof term} prints the type of a term;
7324 @{const const} is the same as @{term const}, but checks that the
7325 argument is a known logical constant;
7327 @{term_style style term} and @{thm_style style thm} print a term or
7328 theorem applying a "style" to it
7332 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
7333 definitions, equations, inequations etc., 'concl' printing only the
7334 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
7335 to print the specified premise. TermStyle.add_style provides an ML
7336 interface for introducing further styles. See also the "LaTeX Sugar"
7337 document practical applications. The ML antiquotation prints
7338 type-checked ML expressions verbatim.
7340 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
7341 and 'text' support optional locale specification '(in loc)', which
7342 specifies the default context for interpreting antiquotations. For
7343 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
7345 * Option 'locale=NAME' of antiquotations specifies an alternative
7346 context interpreting the subsequent argument. For example: @{thm
7347 [locale=lattice] inf_assoc}.
7349 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
7352 * Proper output of antiquotations for theory commands involving a
7353 proof context (such as 'locale' or 'theorem (in loc) ...').
7355 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
7356 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
7358 * isatool usedir: new option -C (default true) controls whether option
7359 -D should include a copy of the original document directory; -C false
7360 prevents unwanted effects such as copying of administrative CVS data.
7365 * Considerably improved version of 'constdefs' command. Now performs
7366 automatic type-inference of declared constants; additional support for
7367 local structure declarations (cf. locales and HOL records), see also
7368 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
7369 sequential dependencies of definitions within a single 'constdefs'
7370 section; moreover, the declared name needs to be an identifier. If
7371 all fails, consider to fall back on 'consts' and 'defs' separately.
7373 * Improved indexed syntax and implicit structures. First of all,
7374 indexed syntax provides a notational device for subscripted
7375 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
7376 expressions. Secondly, in a local context with structure
7377 declarations, number indexes \<^sub>n or the empty index (default
7378 number 1) refer to a certain fixed variable implicitly; option
7379 show_structs controls printing of implicit structures. Typical
7380 applications of these concepts involve record types and locales.
7382 * New command 'no_syntax' removes grammar declarations (and
7383 translations) resulting from the given syntax specification, which is
7384 interpreted in the same manner as for the 'syntax' command.
7386 * 'Advanced' translation functions (parse_translation etc.) may depend
7387 on the signature of the theory context being presently used for
7388 parsing/printing, see also isar-ref manual.
7390 * Improved 'oracle' command provides a type-safe interface to turn an
7391 ML expression of type theory -> T -> term into a primitive rule of
7392 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
7393 is already included here); see also FOL/ex/IffExample.thy;
7396 * axclass: name space prefix for class "c" is now "c_class" (was "c"
7397 before); "cI" is no longer bound, use "c.intro" instead.
7398 INCOMPATIBILITY. This change avoids clashes of fact bindings for
7399 axclasses vs. locales.
7401 * Improved internal renaming of symbolic identifiers -- attach primes
7402 instead of base 26 numbers.
7404 * New flag show_question_marks controls printing of leading question
7405 marks in schematic variable names.
7407 * In schematic variable names, *any* symbol following \<^isub> or
7408 \<^isup> is now treated as part of the base name. For example, the
7409 following works without printing of awkward ".0" indexes:
7411 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
7414 * Inner syntax includes (*(*nested*) comments*).
7416 * Pretty printer now supports unbreakable blocks, specified in mixfix
7417 annotations as "(00...)".
7419 * Clear separation of logical types and nonterminals, where the latter
7420 may only occur in 'syntax' specifications or type abbreviations.
7421 Before that distinction was only partially implemented via type class
7422 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
7423 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
7424 exotic syntax specifications may require further adaption
7425 (e.g. Cube/Cube.thy).
7427 * Removed obsolete type class "logic", use the top sort {} instead.
7428 Note that non-logical types should be declared as 'nonterminals'
7429 rather than 'types'. INCOMPATIBILITY for new object-logic
7432 * Attributes 'induct' and 'cases': type or set names may now be
7433 locally fixed variables as well.
7435 * Simplifier: can now control the depth to which conditional rewriting
7436 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
7439 * Simplifier: simplification procedures may now take the current
7440 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
7441 interface), which is very useful for calling the Simplifier
7442 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
7443 is gone -- use prems_of_ss on the simpset instead. Moreover, the
7444 low-level mk_simproc no longer applies Logic.varify internally, to
7445 allow for use in a context of fixed variables.
7447 * thin_tac now works even if the assumption being deleted contains !!
7448 or ==>. More generally, erule now works even if the major premise of
7449 the elimination rule contains !! or ==>.
7451 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
7453 * Reorganized bootstrapping of the Pure theories; CPure is now derived
7454 from Pure, which contains all common declarations already. Both
7455 theories are defined via plain Isabelle/Isar .thy files.
7456 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
7457 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
7458 use isatool fixcpure to adapt your theory and ML sources.
7460 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
7461 selections of theorems in named facts via index ranges.
7463 * 'print_theorems': in theory mode, really print the difference
7464 wrt. the last state (works for interactive theory development only),
7465 in proof mode print all local facts (cf. 'print_facts');
7467 * 'hide': option '(open)' hides only base names.
7469 * More efficient treatment of intermediate checkpoints in interactive
7472 * Code generator is now invoked via code_module (incremental code
7473 generation) and code_library (modular code generation, ML structures
7474 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
7475 must be quoted when used as identifiers.
7477 * New 'value' command for reading, evaluating and printing terms using
7478 the code generator. INCOMPATIBILITY: command keyword 'value' must be
7479 quoted when used as identifier.
7484 * New commands for the interpretation of locale expressions in
7485 theories (1), locales (2) and proof contexts (3). These generate
7486 proof obligations from the expression specification. After the
7487 obligations have been discharged, theorems of the expression are added
7488 to the theory, target locale or proof context. The synopsis of the
7489 commands is a follows:
7491 (1) interpretation expr inst
7492 (2) interpretation target < expr
7493 (3) interpret expr inst
7495 Interpretation in theories and proof contexts require a parameter
7496 instantiation of terms from the current context. This is applied to
7497 specifications and theorems of the interpreted expression.
7498 Interpretation in locales only permits parameter renaming through the
7499 locale expression. Interpretation is smart in that interpretations
7500 that are active already do not occur in proof obligations, neither are
7501 instantiated theorems stored in duplicate. Use 'print_interps' to
7502 inspect active interpretations of a particular locale. For details,
7503 see the Isar Reference manual. Examples can be found in
7504 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
7506 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
7507 'interpret' instead.
7509 * New context element 'constrains' for adding type constraints to
7512 * Context expressions: renaming of parameters with syntax
7515 * Locale declaration: 'includes' disallowed.
7517 * Proper static binding of attribute syntax -- i.e. types / terms /
7518 facts mentioned as arguments are always those of the locale definition
7519 context, independently of the context of later invocations. Moreover,
7520 locale operations (renaming and type / term instantiation) are applied
7521 to attribute arguments as expected.
7523 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
7524 actual attributes; rare situations may require Attrib.attribute to
7525 embed those attributes into Attrib.src that lack concrete syntax.
7526 Attribute implementations need to cooperate properly with the static
7527 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
7528 Attrib.XXX_thm etc. already do the right thing without further
7529 intervention. Only unusual applications -- such as "where" or "of"
7530 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
7531 on the context and the facts involved -- may have to assign parsed
7532 values to argument tokens explicitly.
7534 * Changed parameter management in theorem generation for long goal
7535 statements with 'includes'. INCOMPATIBILITY: produces a different
7536 theorem statement in rare situations.
7538 * Locale inspection command 'print_locale' omits notes elements. Use
7539 'print_locale!' to have them included in the output.
7544 * Provers/hypsubst.ML: improved version of the subst method, for
7545 single-step rewriting: it now works in bound variable contexts. New is
7546 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
7547 rewrite a different subterm than the original subst method, which is
7548 still available as 'simplesubst'.
7550 * Provers/quasi.ML: new transitivity reasoners for transitivity only
7553 * Provers/trancl.ML: new transitivity reasoner for transitive and
7554 reflexive-transitive closure of relations.
7556 * Provers/blast.ML: new reference depth_limit to make blast's depth
7557 limit (previously hard-coded with a value of 20) user-definable.
7559 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
7560 is peformed already. Object-logics merely need to finish their
7561 initial simpset configuration as before. INCOMPATIBILITY.
7566 * Symbolic syntax of Hilbert Choice Operator is now as follows:
7569 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
7571 The symbol \<some> is displayed as the alternative epsilon of LaTeX
7572 and x-symbol; use option '-m epsilon' to get it actually printed.
7573 Moreover, the mathematically important symbolic identifier \<epsilon>
7574 becomes available as variable, constant etc. INCOMPATIBILITY,
7576 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
7577 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
7578 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
7579 support corresponding Isar calculations.
7581 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
7584 * theory SetInterval: changed the syntax for open intervals:
7593 The old syntax is still supported but will disappear in the next
7594 release. For conversion use the following Emacs search and replace
7595 patterns (these are not perfect but work quite well):
7597 {)\([^\.]*\)\.\. -> {\1<\.\.}
7598 \.\.\([^(}]*\)(} -> \.\.<\1}
7600 * Theory Commutative_Ring (in Library): method comm_ring for proving
7601 equalities in commutative rings; method 'algebra' provides a generic
7604 * Theory Finite_Set: changed the syntax for 'setsum', summation over
7605 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
7606 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
7609 Some new syntax forms are available:
7611 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
7612 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
7613 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
7614 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
7616 The latter form "\<Sum>x < k. e" used to be based on a separate
7617 function "Summation", which has been discontinued.
7619 * theory Finite_Set: in structured induction proofs, the insert case
7620 is now 'case (insert x F)' instead of the old counterintuitive 'case
7623 * The 'refute' command has been extended to support a much larger
7624 fragment of HOL, including axiomatic type classes, constdefs and
7625 typedefs, inductive datatypes and recursion.
7627 * New tactics 'sat' and 'satx' to prove propositional tautologies.
7628 Requires zChaff with proof generation to be installed. See
7629 HOL/ex/SAT_Examples.thy for examples.
7631 * Datatype induction via method 'induct' now preserves the name of the
7632 induction variable. For example, when proving P(xs::'a list) by
7633 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
7634 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
7635 in unstructured proof scripts.
7637 * Reworked implementation of records. Improved scalability for
7638 records with many fields, avoiding performance problems for type
7639 inference. Records are no longer composed of nested field types, but
7640 of nested extension types. Therefore the record type only grows linear
7641 in the number of extensions and not in the number of fields. The
7642 top-level (users) view on records is preserved. Potential
7643 INCOMPATIBILITY only in strange cases, where the theory depends on the
7644 old record representation. The type generated for a record is called
7645 <record_name>_ext_type.
7647 Flag record_quick_and_dirty_sensitive can be enabled to skip the
7648 proofs triggered by a record definition or a simproc (if
7649 quick_and_dirty is enabled). Definitions of large records can take
7652 New simproc record_upd_simproc for simplification of multiple record
7653 updates enabled by default. Moreover, trivial updates are also
7654 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
7655 occasionally, since simplification is more powerful by default.
7657 * typedef: proper support for polymorphic sets, which contain extra
7658 type-variables in the term.
7660 * Simplifier: automatically reasons about transitivity chains
7661 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
7662 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
7663 old proofs break occasionally as simplification may now solve more
7664 goals than previously.
7666 * Simplifier: converts x <= y into x = y if assumption y <= x is
7667 present. Works for all partial orders (class "order"), in particular
7668 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
7671 * Simplifier: new simproc for "let x = a in f x". If a is a free or
7672 bound variable or a constant then the let is unfolded. Otherwise
7673 first a is simplified to b, and then f b is simplified to g. If
7674 possible we abstract b from g arriving at "let x = b in h x",
7675 otherwise we unfold the let and arrive at g. The simproc can be
7676 enabled/disabled by the reference use_let_simproc. Potential
7677 INCOMPATIBILITY since simplification is more powerful by default.
7679 * Classical reasoning: the meson method now accepts theorems as arguments.
7681 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
7682 jobs to provide advice on the provability of subgoals.
7684 * Theory OrderedGroup and Ring_and_Field: various additions and
7685 improvements to faciliate calculations involving equalities and
7688 The following theorems have been eliminated or modified
7691 abs_eq now named abs_of_nonneg
7692 abs_of_ge_0 now named abs_of_nonneg
7693 abs_minus_eq now named abs_of_nonpos
7694 imp_abs_id now named abs_of_nonneg
7695 imp_abs_neg_id now named abs_of_nonpos
7696 mult_pos now named mult_pos_pos
7697 mult_pos_le now named mult_nonneg_nonneg
7698 mult_pos_neg_le now named mult_nonneg_nonpos
7699 mult_pos_neg2_le now named mult_nonneg_nonpos2
7700 mult_neg now named mult_neg_neg
7701 mult_neg_le now named mult_nonpos_nonpos
7703 * The following lemmas in Ring_and_Field have been added to the simplifier:
7706 not_square_less_zero
7708 The following lemmas have been deleted from Real/RealPow:
7718 * Theory Parity: added rules for simplifying exponents.
7722 The following theorems have been eliminated or modified
7725 list_all_Nil now named list_all.simps(1)
7726 list_all_Cons now named list_all.simps(2)
7727 list_all_conv now named list_all_iff
7728 set_mem_eq now named mem_iff
7730 * Theories SetsAndFunctions and BigO (see HOL/Library) support
7731 asymptotic "big O" calculations. See the notes in BigO.thy.
7736 * Theory RealDef: better support for embedding natural numbers and
7737 integers in the reals.
7739 The following theorems have been eliminated or modified
7742 exp_ge_add_one_self now requires no hypotheses
7743 real_of_int_add reversed direction of equality (use [symmetric])
7744 real_of_int_minus reversed direction of equality (use [symmetric])
7745 real_of_int_diff reversed direction of equality (use [symmetric])
7746 real_of_int_mult reversed direction of equality (use [symmetric])
7748 * Theory RComplete: expanded support for floor and ceiling functions.
7750 * Theory Ln is new, with properties of the natural logarithm
7752 * Hyperreal: There is a new type constructor "star" for making
7753 nonstandard types. The old type names are now type synonyms:
7757 hcomplex = complex star
7759 * Hyperreal: Many groups of similarly-defined constants have been
7760 replaced by polymorphic versions (INCOMPATIBILITY):
7762 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
7764 starset <-- starsetNat, starsetC
7765 *s* <-- *sNat*, *sc*
7766 starset_n <-- starsetNat_n, starsetC_n
7767 *sn* <-- *sNatn*, *scn*
7768 InternalSets <-- InternalNatSets, InternalCSets
7770 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7771 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
7772 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
7773 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
7774 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
7776 * Hyperreal: Many type-specific theorems have been removed in favor of
7777 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
7779 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
7780 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
7781 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
7782 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
7783 right_minus <-- hypreal_add_minus
7784 left_minus <-- {hypreal,hcomplex}_add_minus_left
7785 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
7786 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
7787 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
7788 mult_1_right <-- hcomplex_mult_one_right
7789 mult_zero_left <-- hcomplex_mult_zero_left
7790 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
7791 right_distrib <-- hypnat_add_mult_distrib2
7792 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
7793 right_inverse <-- hypreal_mult_inverse
7794 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
7795 order_refl <-- {hypreal,hypnat}_le_refl
7796 order_trans <-- {hypreal,hypnat}_le_trans
7797 order_antisym <-- {hypreal,hypnat}_le_anti_sym
7798 order_less_le <-- {hypreal,hypnat}_less_le
7799 linorder_linear <-- {hypreal,hypnat}_le_linear
7800 add_left_mono <-- {hypreal,hypnat}_add_left_mono
7801 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
7802 add_nonneg_nonneg <-- hypreal_le_add_order
7804 * Hyperreal: Separate theorems having to do with type-specific
7805 versions of constants have been merged into theorems that apply to the
7806 new polymorphic constants (INCOMPATIBILITY):
7808 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
7809 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
7810 STAR_Un <-- {STAR,NatStar,STARC}_Un
7811 STAR_Int <-- {STAR,NatStar,STARC}_Int
7812 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
7813 STAR_subset <-- {STAR,NatStar,STARC}_subset
7814 STAR_mem <-- {STAR,NatStar,STARC}_mem
7815 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
7816 STAR_diff <-- {STAR,STARC}_diff
7817 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
7818 STARC_hcomplex_of_complex}_image_subset
7819 starset_n_Un <-- starset{Nat,C}_n_Un
7820 starset_n_Int <-- starset{Nat,C}_n_Int
7821 starset_n_Compl <-- starset{Nat,C}_n_Compl
7822 starset_n_diff <-- starset{Nat,C}_n_diff
7823 InternalSets_Un <-- Internal{Nat,C}Sets_Un
7824 InternalSets_Int <-- Internal{Nat,C}Sets_Int
7825 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
7826 InternalSets_diff <-- Internal{Nat,C}Sets_diff
7827 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
7828 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
7829 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
7830 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
7831 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
7832 starfun <-- starfun{Nat,Nat2,C,RC,CR}
7833 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
7834 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
7835 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
7836 starfun_diff <-- starfun{C,RC,CR}_diff
7837 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
7838 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
7839 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
7840 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
7841 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
7842 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
7843 starfun_Id <-- starfunC_Id
7844 starfun_approx <-- starfun{Nat,CR}_approx
7845 starfun_capprox <-- starfun{C,RC}_capprox
7846 starfun_abs <-- starfunNat_rabs
7847 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
7848 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
7849 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
7850 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
7851 starfun_add_capprox <-- starfun{C,RC}_add_capprox
7852 starfun_add_approx <-- starfunCR_add_approx
7853 starfun_inverse_inverse <-- starfunC_inverse_inverse
7854 starfun_divide <-- starfun{C,CR,RC}_divide
7855 starfun_n <-- starfun{Nat,C}_n
7856 starfun_n_mult <-- starfun{Nat,C}_n_mult
7857 starfun_n_add <-- starfun{Nat,C}_n_add
7858 starfun_n_add_minus <-- starfunNat_n_add_minus
7859 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
7860 starfun_n_minus <-- starfun{Nat,C}_n_minus
7861 starfun_n_eq <-- starfun{Nat,C}_n_eq
7863 star_n_add <-- {hypreal,hypnat,hcomplex}_add
7864 star_n_minus <-- {hypreal,hcomplex}_minus
7865 star_n_diff <-- {hypreal,hcomplex}_diff
7866 star_n_mult <-- {hypreal,hcomplex}_mult
7867 star_n_inverse <-- {hypreal,hcomplex}_inverse
7868 star_n_le <-- {hypreal,hypnat}_le
7869 star_n_less <-- {hypreal,hypnat}_less
7870 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
7871 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
7872 star_n_abs <-- hypreal_hrabs
7873 star_n_divide <-- hcomplex_divide
7875 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
7876 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
7877 star_of_diff <-- hypreal_of_real_diff
7878 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
7879 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
7880 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
7881 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
7882 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
7883 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
7884 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
7885 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
7886 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
7887 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
7888 star_of_number_of <-- {hypreal,hcomplex}_number_of
7889 star_of_number_less <-- number_of_less_hypreal_of_real_iff
7890 star_of_number_le <-- number_of_le_hypreal_of_real_iff
7891 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
7892 star_of_less_number <-- hypreal_of_real_less_number_of_iff
7893 star_of_le_number <-- hypreal_of_real_le_number_of_iff
7894 star_of_power <-- hypreal_of_real_power
7895 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
7897 * Hyperreal: new method "transfer" that implements the transfer
7898 principle of nonstandard analysis. With a subgoal that mentions
7899 nonstandard types like "'a star", the command "apply transfer"
7900 replaces it with an equivalent one that mentions only standard types.
7901 To be successful, all free variables must have standard types; non-
7902 standard variables must have explicit universal quantifiers.
7904 * Hyperreal: A theory of Taylor series.
7909 * Discontinued special version of 'constdefs' (which used to support
7910 continuous functions) in favor of the general Pure one with full
7913 * New simplification procedure for solving continuity conditions; it
7914 is much faster on terms with many nested lambda abstractions (cubic
7915 instead of exponential time).
7917 * New syntax for domain package: selector names are now optional.
7918 Parentheses should be omitted unless argument is lazy, for example:
7920 domain 'a stream = cons "'a" (lazy "'a stream")
7922 * New command 'fixrec' for defining recursive functions with pattern
7923 matching; defining multiple functions with mutual recursion is also
7924 supported. Patterns may include the constants cpair, spair, up, sinl,
7925 sinr, or any data constructor defined by the domain package. The given
7926 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
7927 syntax and examples.
7929 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
7930 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
7931 but the proof obligation additionally includes an admissibility
7932 requirement. The packages generate instances of class cpo or pcpo,
7933 with continuity and strictness theorems for Rep and Abs.
7935 * HOLCF: Many theorems have been renamed according to a more standard naming
7936 scheme (INCOMPATIBILITY):
7938 foo_inject: "foo$x = foo$y ==> x = y"
7939 foo_eq: "(foo$x = foo$y) = (x = y)"
7940 foo_less: "(foo$x << foo$y) = (x << y)"
7941 foo_strict: "foo$UU = UU"
7942 foo_defined: "... ==> foo$x ~= UU"
7943 foo_defined_iff: "(foo$x = UU) = (x = UU)"
7948 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
7949 including the First Isomorphism Theorem (on quotienting by the kernel
7952 * ZF/Simplifier: install second copy of type solver that actually
7953 makes use of TC rules declared to Isar proof contexts (or locales);
7954 the old version is still required for ML proof scripts.
7959 * Converted to Isar theory format; use locales instead of axiomatic
7965 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
7968 * Pure/library.ML no longer defines its own option datatype, but uses
7969 that of the SML basis, which has constructors NONE and SOME instead of
7970 None and Some, as well as exception Option.Option instead of OPTION.
7971 The functions the, if_none, is_some, is_none have been adapted
7972 accordingly, while Option.map replaces apsome.
7974 * Pure/library.ML: the exception LIST has been given up in favour of
7975 the standard exceptions Empty and Subscript, as well as
7976 Library.UnequalLengths. Function like Library.hd and Library.tl are
7977 superceded by the standard hd and tl functions etc.
7979 A number of basic list functions are no longer exported to the ML
7980 toplevel, as they are variants of predefined functions. The following
7981 suggests how one can translate existing code:
7983 rev_append xs ys = List.revAppend (xs, ys)
7984 nth_elem (i, xs) = List.nth (xs, i)
7985 last_elem xs = List.last xs
7986 flat xss = List.concat xss
7987 seq fs = List.app fs
7988 partition P xs = List.partition P xs
7989 mapfilter f xs = List.mapPartial f xs
7991 * Pure/library.ML: several combinators for linear functional
7992 transformations, notably reverse application and composition:
7995 (x, y) |-> f f #-> g
7997 * Pure/library.ML: introduced/changed precedence of infix operators:
7999 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
8001 infix 3 o oo ooo oooo;
8002 infix 4 ~~ upto downto;
8004 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
8007 * Pure/library.ML: natural list combinators fold, fold_rev, and
8008 fold_map support linear functional transformations and nesting. For
8011 fold f [x1, ..., xN] y =
8012 y |> f x1 |> ... |> f xN
8014 (fold o fold) f [xs1, ..., xsN] y =
8015 y |> fold f xs1 |> ... |> fold f xsN
8017 fold f [x1, ..., xN] =
8020 (fold o fold) f [xs1, ..., xsN] =
8021 fold f xs1 #> ... #> fold f xsN
8023 * Pure/library.ML: the following selectors on type 'a option are
8026 the: 'a option -> 'a (*partial*)
8027 these: 'a option -> 'a where 'a = 'b list
8028 the_default: 'a -> 'a option -> 'a
8029 the_list: 'a option -> 'a list
8031 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8032 basic operations for association lists, following natural argument
8033 order; moreover the explicit equality predicate passed here avoids
8034 potentially expensive polymorphic runtime equality checks.
8035 The old functions may be expressed as follows:
8037 assoc = uncurry (AList.lookup (op =))
8038 assocs = these oo AList.lookup (op =)
8039 overwrite = uncurry (AList.update (op =)) o swap
8041 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
8043 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
8044 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
8046 replacing make_keylist and keyfilter (occassionally used)
8049 make_keylist = AList.make
8050 keyfilter = AList.find (op =)
8052 * eq_fst and eq_snd now take explicit equality parameter, thus
8053 avoiding eqtypes. Naive rewrites:
8055 eq_fst = eq_fst (op =)
8056 eq_snd = eq_snd (op =)
8058 * Removed deprecated apl and apr (rarely used).
8061 apl (n, op) =>>= curry op n
8062 apr (op, m) =>>= fn n => op (n, m)
8064 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
8065 provides a reasonably efficient light-weight implementation of sets as
8068 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
8069 few new operations; existing lookup and update are now curried to
8070 follow natural argument order (for use with fold etc.);
8071 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
8073 * Pure/General: output via the Isabelle channels of
8074 writeln/warning/error etc. is now passed through Output.output, with a
8075 hook for arbitrary transformations depending on the print_mode
8076 (cf. Output.add_mode -- the first active mode that provides a output
8077 function wins). Already formatted output may be embedded into further
8078 text via Output.raw; the result of Pretty.string_of/str_of and derived
8079 functions (string_of_term/cterm/thm etc.) is already marked raw to
8080 accommodate easy composition of diagnostic messages etc. Programmers
8081 rarely need to care about Output.output or Output.raw at all, with
8082 some notable exceptions: Output.output is required when bypassing the
8083 standard channels (writeln etc.), or in token translations to produce
8084 properly formatted results; Output.raw is required when capturing
8085 already output material that will eventually be presented to the user
8086 a second time. For the default print mode, both Output.output and
8087 Output.raw have no effect.
8089 * Pure/General: Output.time_accumulator NAME creates an operator ('a
8090 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
8091 cumulative results are displayed at the end of a batch session.
8093 * Pure/General: File.sysify_path and File.quote_sysify path have been
8094 replaced by File.platform_path and File.shell_path (with appropriate
8095 hooks). This provides a clean interface for unusual systems where the
8096 internal and external process view of file names are different.
8098 * Pure: more efficient orders for basic syntactic entities: added
8099 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
8100 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
8101 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
8102 orders now -- potential INCOMPATIBILITY for code that depends on a
8103 particular order for Symtab.keys, Symtab.dest, etc. (consider using
8104 Library.sort_strings on result).
8106 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
8107 fold_types traverse types/terms from left to right, observing natural
8108 argument order. Supercedes previous foldl_XXX versions, add_frees,
8109 add_vars etc. have been adapted as well: INCOMPATIBILITY.
8111 * Pure: name spaces have been refined, with significant changes of the
8112 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
8113 to extern(_table). The plain name entry path is superceded by a
8114 general 'naming' context, which also includes the 'policy' to produce
8115 a fully qualified name and external accesses of a fully qualified
8116 name; NameSpace.extend is superceded by context dependent
8117 Sign.declare_name. Several theory and proof context operations modify
8118 the naming context. Especially note Theory.restore_naming and
8119 ProofContext.restore_naming to get back to a sane state; note that
8120 Theory.add_path is no longer sufficient to recover from
8121 Theory.absolute_path in particular.
8123 * Pure: new flags short_names (default false) and unique_names
8124 (default true) for controlling output of qualified names. If
8125 short_names is set, names are printed unqualified. If unique_names is
8126 reset, the name prefix is reduced to the minimum required to achieve
8127 the original result when interning again, even if there is an overlap
8128 with earlier declarations.
8130 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
8131 now 'extend', and 'merge' gets an additional Pretty.pp argument
8132 (useful for printing error messages). INCOMPATIBILITY.
8134 * Pure: major reorganization of the theory context. Type Sign.sg and
8135 Theory.theory are now identified, referring to the universal
8136 Context.theory (see Pure/context.ML). Actual signature and theory
8137 content is managed as theory data. The old code and interfaces were
8138 spread over many files and structures; the new arrangement introduces
8139 considerable INCOMPATIBILITY to gain more clarity:
8141 Context -- theory management operations (name, identity, inclusion,
8142 parents, ancestors, merge, etc.), plus generic theory data;
8144 Sign -- logical signature and syntax operations (declaring consts,
8145 types, etc.), plus certify/read for common entities;
8147 Theory -- logical theory operations (stating axioms, definitions,
8148 oracles), plus a copy of logical signature operations (consts,
8149 types, etc.); also a few basic management operations (Theory.copy,
8152 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
8153 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
8154 for convenience -- they merely return the theory.
8156 * Pure: type Type.tsig is superceded by theory in most interfaces.
8158 * Pure: the Isar proof context type is already defined early in Pure
8159 as Context.proof (note that ProofContext.context and Proof.context are
8160 aliases, where the latter is the preferred name). This enables other
8161 Isabelle components to refer to that type even before Isar is present.
8163 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
8164 typeK, constK, axiomK, oracleK), but provide explicit operations for
8165 any of these kinds. For example, Sign.intern typeK is now
8166 Sign.intern_type, Theory.hide_space Sign.typeK is now
8167 Theory.hide_types. Also note that former
8168 Theory.hide_classes/types/consts are now
8169 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
8170 internalize their arguments! INCOMPATIBILITY.
8172 * Pure: get_thm interface (of PureThy and ProofContext) expects
8173 datatype thmref (with constructors Name and NameSelection) instead of
8174 plain string -- INCOMPATIBILITY;
8176 * Pure: cases produced by proof methods specify options, where NONE
8177 means to remove case bindings -- INCOMPATIBILITY in
8180 * Pure: the following operations retrieve axioms or theorems from a
8181 theory node or theory hierarchy, respectively:
8183 Theory.axioms_of: theory -> (string * term) list
8184 Theory.all_axioms_of: theory -> (string * term) list
8185 PureThy.thms_of: theory -> (string * thm) list
8186 PureThy.all_thms_of: theory -> (string * thm) list
8188 * Pure: print_tac now outputs the goal through the trace channel.
8190 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
8191 Reference Toplevel.debug (default false) controls detailed printing
8192 and tracing of low-level exceptions; Toplevel.profiling (default 0)
8193 controls execution profiling -- set to 1 for time and 2 for space
8194 (both increase the runtime).
8196 * Isar session: The initial use of ROOT.ML is now always timed,
8197 i.e. the log will show the actual process times, in contrast to the
8198 elapsed wall-clock time that the outer shell wrapper produces.
8200 * Simplifier: improved handling of bound variables (nameless
8201 representation, avoid allocating new strings). Simprocs that invoke
8202 the Simplifier recursively should use Simplifier.inherit_bounds to
8203 avoid local name clashes. Failure to do so produces warnings
8204 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
8205 for further details.
8207 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
8208 bindings for all theorems stored within a given theory; this may help
8209 in porting non-Isar theories to Isar ones, while keeping ML proof
8210 scripts for the time being.
8212 * ML operator HTML.with_charset specifies the charset begin used for
8213 generated HTML files. For example:
8215 HTML.with_charset "utf-8" use_thy "Hebrew";
8216 HTML.with_charset "utf-8" use_thy "Chinese";
8221 * Allow symlinks to all proper Isabelle executables (Isabelle,
8222 isabelle, isatool etc.).
8224 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
8225 isatool doc, isatool mkdir, display_drafts etc.).
8227 * isatool usedir: option -f allows specification of the ML file to be
8228 used by Isabelle; default is ROOT.ML.
8230 * New isatool version outputs the version identifier of the Isabelle
8231 distribution being used.
8233 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
8234 (containing Boolean satisfiability problems) into Isabelle/HOL
8239 New in Isabelle2004 (April 2004)
8240 --------------------------------
8244 * Provers/order.ML: new efficient reasoner for partial and linear orders.
8245 Replaces linorder.ML.
8247 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
8248 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
8249 (\<a>...\<z>), are now considered normal letters, and can therefore
8250 be used anywhere where an ASCII letter (a...zA...Z) has until
8251 now. COMPATIBILITY: This obviously changes the parsing of some
8252 terms, especially where a symbol has been used as a binder, say
8253 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
8254 as an identifier. Fix it by inserting a space around former
8255 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
8256 existing theory and ML files.
8258 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
8260 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
8261 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
8262 a normal (but invisible) letter. For multiple letter subscripts repeat
8263 \<^isub> like this: x\<^isub>1\<^isub>2.
8265 * Pure: There are now sub-/superscripts that can span more than one
8266 character. Text between \<^bsub> and \<^esub> is set in subscript in
8267 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
8268 superscript. The new control characters are not identifier parts.
8270 * Pure: Control-symbols of the form \<^raw:...> will literally print the
8271 content of "..." to the latex file instead of \isacntrl... . The "..."
8272 may consist of any printable characters excluding the end bracket >.
8274 * Pure: Using new Isar command "finalconsts" (or the ML functions
8275 Theory.add_finals or Theory.add_finals_i) it is now possible to
8276 declare constants "final", which prevents their being given a definition
8277 later. It is useful for constants whose behaviour is fixed axiomatically
8278 rather than definitionally, such as the meta-logic connectives.
8280 * Pure: 'instance' now handles general arities with general sorts
8281 (i.e. intersections of classes),
8283 * Presentation: generated HTML now uses a CSS style sheet to make layout
8284 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
8285 It can be changed to alter the colors/layout of generated pages.
8290 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
8291 cut_tac, subgoal_tac and thin_tac:
8292 - Now understand static (Isar) contexts. As a consequence, users of Isar
8293 locales are no longer forced to write Isar proof scripts.
8294 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
8296 - INCOMPATIBILITY: names of variables to be instantiated may no
8297 longer be enclosed in quotes. Instead, precede variable name with `?'.
8298 This is consistent with the instantiation attribute "where".
8300 * Attributes "where" and "of":
8301 - Now take type variables of instantiated theorem into account when reading
8302 the instantiation string. This fixes a bug that caused instantiated
8303 theorems to have too special types in some circumstances.
8304 - "where" permits explicit instantiations of type variables.
8306 * Calculation commands "moreover" and "also" no longer interfere with
8307 current facts ("this"), admitting arbitrary combinations with "then"
8311 - Goal statements involving the context element "includes" no longer
8312 generate theorems with internal delta predicates (those ending on
8313 "_axioms") in the premise.
8314 Resolve particular premise with <locale>.intro to obtain old form.
8315 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
8316 specification and "includes" elements in goal statement.
8317 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
8318 [intro?] and [elim?] (respectively) by default.
8319 - Experimental command for instantiation of locales in proof contexts:
8320 instantiate <label>[<attrs>]: <loc>
8321 Instantiates locale <loc> and adds all its theorems to the current context
8322 taking into account their attributes. Label and attrs are optional
8323 modifiers, like in theorem declarations. If present, names of
8324 instantiated theorems are qualified with <label>, and the attributes
8325 <attrs> are applied after any attributes these theorems might have already.
8326 If the locale has assumptions, a chained fact of the form
8327 "<loc> t1 ... tn" is expected from which instantiations of the parameters
8328 are derived. The command does not support old-style locales declared
8329 with "locale (open)".
8330 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
8332 * HOL: Tactic emulation methods induct_tac and case_tac understand static
8338 * Proof import: new image HOL4 contains the imported library from
8339 the HOL4 system with about 2500 theorems. It is imported by
8340 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
8341 can be used like any other Isabelle image. See
8342 HOL/Import/HOL/README for more information.
8345 - Much improved handling of linear and partial orders.
8346 Reasoners for linear and partial orders are set up for type classes
8347 "linorder" and "order" respectively, and are added to the default simpset
8348 as solvers. This means that the simplifier can build transitivity chains
8349 to solve goals from the assumptions.
8350 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
8351 of blast or auto after simplification become unnecessary because the goal
8352 is solved by simplification already.
8354 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
8355 all proved in axiomatic type classes for semirings, rings and fields.
8358 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
8359 now formalized using the Ring_and_Field theory mentioned above.
8360 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
8361 than before, because now they are set up once in a generic manner.
8362 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
8363 Look for the general versions in Ring_and_Field (and Power if they concern
8366 * Type "rat" of the rational numbers is now available in HOL-Complex.
8369 - Record types are now by default printed with their type abbreviation
8370 instead of the list of all field types. This can be configured via
8371 the reference "print_record_type_abbr".
8372 - Simproc "record_upd_simproc" for simplification of multiple updates added
8373 (not enabled by default).
8374 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
8375 EX x. x = sel r to True (not enabled by default).
8376 - Tactic "record_split_simp_tac" to split and simplify records added.
8378 * 'specification' command added, allowing for definition by
8379 specification. There is also an 'ax_specification' command that
8380 introduces the new constants axiomatically.
8382 * arith(_tac) is now able to generate counterexamples for reals as well.
8384 * HOL-Algebra: new locale "ring" for non-commutative rings.
8386 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
8387 definitions, thanks to Sava Krsti\'{c} and John Matthews.
8389 * HOL-Matrix: a first theory for matrices in HOL with an application of
8390 matrix theory to linear programming.
8392 * Unions and Intersections:
8393 The latex output syntax of UN and INT has been changed
8394 from "\Union x \in A. B" to "\Union_{x \in A} B"
8395 i.e. the index formulae has become a subscript.
8396 Similarly for "\Union x. B", and for \Inter instead of \Union.
8398 * Unions and Intersections over Intervals:
8399 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
8400 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
8401 like in normal math, and corresponding versions for < and for intersection.
8403 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
8404 lexicographic dictonary ordering has been added as "lexord".
8406 * ML: the legacy theory structures Int and List have been removed. They had
8407 conflicted with ML Basis Library structures having the same names.
8409 * 'refute' command added to search for (finite) countermodels. Only works
8410 for a fragment of HOL. The installation of an external SAT solver is
8411 highly recommended. See "HOL/Refute.thy" for details.
8413 * 'quickcheck' command: Allows to find counterexamples by evaluating
8414 formulae under an assignment of free variables to random values.
8415 In contrast to 'refute', it can deal with inductive datatypes,
8416 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
8422 * Streams now come with concatenation and are part of the HOLCF image
8426 New in Isabelle2003 (May 2003)
8427 ------------------------------
8431 * Provers/simplifier:
8433 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
8434 Assumptions are now subject to complete mutual simplification,
8435 not just from left to right. The simplifier now preserves
8436 the order of assumptions.
8438 Potential INCOMPATIBILITY:
8440 -- simp sometimes diverges where the old version did
8441 not, e.g. invoking simp on the goal
8443 [| P (f x); y = x; f x = f y |] ==> Q
8445 now gives rise to the infinite reduction sequence
8447 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
8449 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
8452 -- Tactics combining classical reasoner and simplification (such as auto)
8453 are also affected by this change, because many of them rely on
8454 simp. They may sometimes diverge as well or yield a different numbers
8455 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
8456 in case of problems. Sometimes subsequent calls to the classical
8457 reasoner will fail because a preceeding call to the simplifier too
8458 eagerly simplified the goal, e.g. deleted redundant premises.
8460 - The simplifier trace now shows the names of the applied rewrite rules
8462 - You can limit the number of recursive invocations of the simplifier
8463 during conditional rewriting (where the simplifie tries to solve the
8464 conditions before applying the rewrite rule):
8465 ML "simp_depth_limit := n"
8466 where n is an integer. Thus you can force termination where previously
8467 the simplifier would diverge.
8469 - Accepts free variables as head terms in congruence rules. Useful in Isar.
8471 - No longer aborts on failed congruence proof. Instead, the
8472 congruence is ignored.
8474 * Pure: New generic framework for extracting programs from constructive
8475 proofs. See HOL/Extraction.thy for an example instantiation, as well
8476 as HOL/Extraction for some case studies.
8478 * Pure: The main goal of the proof state is no longer shown by default, only
8479 the subgoals. This behaviour is controlled by a new flag.
8480 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
8481 (ML: Proof.show_main_goal).
8483 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
8484 rules whose conclusion matches subgoal 1:
8485 PG menu: Isabelle/Isar -> Show me -> matching rules
8486 The rules are ordered by how closely they match the subgoal.
8487 In particular, rules that solve a subgoal outright are displayed first
8488 (or rather last, the way they are printed).
8489 (ML: ProofGeneral.print_intros())
8491 * Pure: New flag trace_unify_fail causes unification to print
8492 diagnostic information (PG: in trace buffer) when it fails. This is
8493 useful for figuring out why single step proofs like rule, erule or
8496 * Pure: Locale specifications now produce predicate definitions
8497 according to the body of text (covering assumptions modulo local
8498 definitions); predicate "loc_axioms" covers newly introduced text,
8499 while "loc" is cumulative wrt. all included locale expressions; the
8500 latter view is presented only on export into the global theory
8501 context; potential INCOMPATIBILITY, use "(open)" option to fall back
8502 on the old view without predicates;
8504 * Pure: predefined locales "var" and "struct" are useful for sharing
8505 parameters (as in CASL, for example); just specify something like
8506 ``var x + var y + struct M'' as import;
8508 * Pure: improved thms_containing: proper indexing of facts instead of
8509 raw theorems; check validity of results wrt. current name space;
8510 include local facts of proof configuration (also covers active
8511 locales), cover fixed variables in index; may use "_" in term
8512 specification; an optional limit for the number of printed facts may
8513 be given (the default is 40);
8515 * Pure: disallow duplicate fact bindings within new-style theory files
8518 * Provers: improved induct method: assumptions introduced by case
8519 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
8520 the goal statement); "foo" still refers to all facts collectively;
8522 * Provers: the function blast.overloaded has been removed: all constants
8523 are regarded as potentially overloaded, which improves robustness in exchange
8524 for slight decrease in efficiency;
8526 * Provers/linorder: New generic prover for transitivity reasoning over
8527 linear orders. Note: this prover is not efficient!
8529 * Isar: preview of problems to finish 'show' now produce an error
8530 rather than just a warning (in interactive mode);
8537 - Produces a counter example if it cannot prove a goal.
8538 Note that the counter example may be spurious if the goal is not a formula
8539 of quantifier-free linear arithmetic.
8540 In ProofGeneral the counter example appears in the trace buffer.
8542 - Knows about div k and mod k where k is a numeral of type nat or int.
8544 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
8545 linear arithmetic fails. This takes account of quantifiers and divisibility.
8546 Presburger arithmetic can also be called explicitly via presburger(_tac).
8548 * simp's arithmetic capabilities have been enhanced a bit: it now
8549 takes ~= in premises into account (by performing a case split);
8551 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
8552 are distributed over a sum of terms;
8554 * New tactic "trans_tac" and method "trans" instantiate
8555 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
8558 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
8559 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
8561 * 'typedef' command has new option "open" to suppress the set
8564 * functions Min and Max on finite sets have been introduced (theory
8567 * attribute [symmetric] now works for relations as well; it turns
8568 (x,y) : R^-1 into (y,x) : R, and vice versa;
8570 * induct over a !!-quantified statement (say !!x1..xn):
8571 each "case" automatically performs "fix x1 .. xn" with exactly those names.
8573 * Map: `empty' is no longer a constant but a syntactic abbreviation for
8574 %x. None. Warning: empty_def now refers to the previously hidden definition
8577 * Algebra: formalization of classical algebra. Intended as base for
8578 any algebraic development in Isabelle. Currently covers group theory
8579 (up to Sylow's theorem) and ring theory (Universal Property of
8580 Univariate Polynomials). Contributions welcome;
8582 * GroupTheory: deleted, since its material has been moved to Algebra;
8584 * Complex: new directory of the complex numbers with numeric constants,
8585 nonstandard complex numbers, and some complex analysis, standard and
8586 nonstandard (Jacques Fleuriot);
8588 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
8590 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
8593 * Real/HahnBanach: updated and adapted to locales;
8595 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
8598 * UNITY: added the Meier-Sanders theory of progress sets;
8600 * MicroJava: bytecode verifier and lightweight bytecode verifier
8601 as abstract algorithms, instantiated to the JVM;
8603 * Bali: Java source language formalization. Type system, operational
8604 semantics, axiomatic semantics. Supported language features:
8605 classes, interfaces, objects,virtual methods, static methods,
8606 static/instance fields, arrays, access modifiers, definite
8607 assignment, exceptions.
8612 * ZF/Constructible: consistency proof for AC (Gdel's constructible
8615 * Main ZF: virtually all theories converted to new-style format;
8620 * Pure: Tactic.prove provides sane interface for internal proofs;
8621 omits the infamous "standard" operation, so this is more appropriate
8622 than prove_goalw_cterm in many situations (e.g. in simprocs);
8624 * Pure: improved error reporting of simprocs;
8626 * Provers: Simplifier.simproc(_i) provides sane interface for setting
8630 *** Document preparation ***
8632 * uses \par instead of \\ for line breaks in theory text. This may
8633 shift some page breaks in large documents. To get the old behaviour
8634 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
8636 * minimized dependencies of isabelle.sty and isabellesym.sty on
8639 * \<euro> now needs package babel/greek instead of marvosym (which
8642 * normal size for \<zero>...\<nine> (uses \mathbf instead of
8647 New in Isabelle2002 (March 2002)
8648 --------------------------------
8650 *** Document preparation ***
8652 * greatly simplified document preparation setup, including more
8653 graceful interpretation of isatool usedir -i/-d/-D options, and more
8654 instructive isatool mkdir; users should basically be able to get
8655 started with "isatool mkdir HOL Test && isatool make"; alternatively,
8656 users may run a separate document processing stage manually like this:
8657 "isatool usedir -D output HOL Test && isatool document Test/output";
8659 * theory dependency graph may now be incorporated into documents;
8660 isatool usedir -g true will produce session_graph.eps/.pdf for use
8661 with \includegraphics of LaTeX;
8663 * proper spacing of consecutive markup elements, especially text
8664 blocks after section headings;
8666 * support bold style (for single symbols only), input syntax is like
8667 this: "\<^bold>\<alpha>" or "\<^bold>A";
8669 * \<bullet> is now output as bold \cdot by default, which looks much
8670 better in printed text;
8672 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
8673 note that these symbols are currently unavailable in Proof General /
8674 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
8676 * isatool latex no longer depends on changed TEXINPUTS, instead
8677 isatool document copies the Isabelle style files to the target
8683 * Pure/Provers: improved proof by cases and induction;
8684 - 'case' command admits impromptu naming of parameters (such as
8686 - 'induct' method divinates rule instantiation from the inductive
8687 claim; no longer requires excessive ?P bindings for proper
8688 instantiation of cases;
8689 - 'induct' method properly enumerates all possibilities of set/type
8690 rules; as a consequence facts may be also passed through *type*
8691 rules without further ado;
8692 - 'induct' method now derives symbolic cases from the *rulified*
8693 rule (before it used to rulify cases stemming from the internal
8694 atomized version); this means that the context of a non-atomic
8695 statement becomes is included in the hypothesis, avoiding the
8696 slightly cumbersome show "PROP ?case" form;
8697 - 'induct' may now use elim-style induction rules without chaining
8698 facts, using ``missing'' premises from the goal state; this allows
8699 rules stemming from inductive sets to be applied in unstructured
8700 scripts, while still benefitting from proper handling of non-atomic
8701 statements; NB: major inductive premises need to be put first, all
8702 the rest of the goal is passed through the induction;
8703 - 'induct' proper support for mutual induction involving non-atomic
8704 rule statements (uses the new concept of simultaneous goals, see
8706 - append all possible rule selections, but only use the first
8707 success (no backtracking);
8708 - removed obsolete "(simplified)" and "(stripped)" options of methods;
8709 - undeclared rule case names default to numbers 1, 2, 3, ...;
8710 - added 'print_induct_rules' (covered by help item in recent Proof
8712 - moved induct/cases attributes to Pure, methods to Provers;
8713 - generic method setup instantiated for FOL and HOL;
8715 * Pure: support multiple simultaneous goal statements, for example
8716 "have a: A and b: B" (same for 'theorem' etc.); being a pure
8717 meta-level mechanism, this acts as if several individual goals had
8718 been stated separately; in particular common proof methods need to be
8719 repeated in order to cover all claims; note that a single elimination
8720 step is *not* sufficient to establish the two conjunctions, so this
8723 assume "A & B" then have A and B .. (*".." fails*)
8725 better use "obtain" in situations as above; alternative refer to
8726 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
8728 * Pure: proper integration with ``locales''; unlike the original
8729 version by Florian Kammller, Isar locales package high-level proof
8730 contexts rather than raw logical ones (e.g. we admit to include
8731 attributes everywhere); operations on locales include merge and
8732 rename; support for implicit arguments (``structures''); simultaneous
8733 type-inference over imports and text; see also HOL/ex/Locales.thy for
8736 * Pure: the following commands have been ``localized'', supporting a
8737 target locale specification "(in name)": 'lemma', 'theorem',
8738 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
8739 stored both within the locale and at the theory level (exported and
8740 qualified by the locale name);
8742 * Pure: theory goals may now be specified in ``long'' form, with
8743 ad-hoc contexts consisting of arbitrary locale elements. for example
8744 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
8745 definitions may be given, too); the result is a meta-level rule with
8746 the context elements being discharged in the obvious way;
8748 * Pure: new proof command 'using' allows to augment currently used
8749 facts after a goal statement ('using' is syntactically analogous to
8750 'apply', but acts on the goal's facts only); this allows chained facts
8751 to be separated into parts given before and after a claim, as in
8752 ``from a and b have C using d and e <proof>'';
8754 * Pure: renamed "antecedent" case to "rule_context";
8756 * Pure: new 'judgment' command records explicit information about the
8757 object-logic embedding (used by several tools internally); no longer
8758 use hard-wired "Trueprop";
8760 * Pure: added 'corollary' command;
8762 * Pure: fixed 'token_translation' command;
8764 * Pure: removed obsolete 'exported' attribute;
8766 * Pure: dummy pattern "_" in is/let is now automatically lifted over
8767 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
8768 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
8770 * Pure: method 'atomize' presents local goal premises as object-level
8771 statements (atomic meta-level propositions); setup controlled via
8772 rewrite rules declarations of 'atomize' attribute; example
8773 application: 'induct' method with proper rule statements in improper
8776 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
8777 now consider the syntactic context of assumptions, giving a better
8778 chance to get type-inference of the arguments right (this is
8779 especially important for locales);
8781 * Pure: "sorry" no longer requires quick_and_dirty in interactive
8784 * Pure/obtain: the formal conclusion "thesis", being marked as
8785 ``internal'', may no longer be reference directly in the text;
8786 potential INCOMPATIBILITY, may need to use "?thesis" in rare
8789 * Pure: generic 'sym' attribute which declares a rule both as pure
8790 'elim?' and for the 'symmetric' operation;
8792 * Pure: marginal comments ``--'' may now occur just anywhere in the
8793 text; the fixed correlation with particular command syntax has been
8796 * Pure: new method 'rules' is particularly well-suited for proof
8797 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
8798 but often produces more compact proof terms with less detours;
8800 * Pure/Provers/classical: simplified integration with pure rule
8801 attributes and methods; the classical "intro?/elim?/dest?"
8802 declarations coincide with the pure ones; the "rule" method no longer
8803 includes classically swapped intros; "intro" and "elim" methods no
8804 longer pick rules from the context; also got rid of ML declarations
8805 AddXIs/AddXEs/AddXDs; all of this has some potential for
8808 * Provers/classical: attribute 'swapped' produces classical inversions
8809 of introduction rules;
8811 * Provers/simplifier: 'simplified' attribute may refer to explicit
8812 rules instead of full simplifier context; 'iff' attribute handles
8815 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
8817 * HOL: 'recdef' now fails on unfinished automated proofs, use
8818 "(permissive)" option to recover old behavior;
8820 * HOL: 'inductive' no longer features separate (collective) attributes
8821 for 'intros' (was found too confusing);
8823 * HOL: properly declared induction rules less_induct and
8829 * HOL: moved over to sane numeral syntax; the new policy is as
8832 - 0 and 1 are polymorphic constants, which are defined on any
8833 numeric type (nat, int, real etc.);
8835 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
8836 binary representation internally;
8838 - type nat has special constructor Suc, and generally prefers Suc 0
8839 over 1::nat and Suc (Suc 0) over 2::nat;
8841 This change may cause significant problems of INCOMPATIBILITY; here
8842 are some hints on converting existing sources:
8844 - due to the new "num" token, "-0" and "-1" etc. are now atomic
8845 entities, so expressions involving "-" (unary or binary minus) need
8846 to be spaced properly;
8848 - existing occurrences of "1" may need to be constraint "1::nat" or
8849 even replaced by Suc 0; similar for old "2";
8851 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
8853 - remove all special provisions on numerals in proofs;
8855 * HOL: simp rules nat_number expand numerals on nat to Suc/0
8856 representation (depends on bin_arith_simps in the default context);
8858 * HOL: symbolic syntax for x^2 (numeral 2);
8860 * HOL: the class of all HOL types is now called "type" rather than
8861 "term"; INCOMPATIBILITY, need to adapt references to this type class
8862 in axclass/classes, instance/arities, and (usually rare) occurrences
8863 in typings (of consts etc.); internally the class is called
8864 "HOL.type", ML programs should refer to HOLogic.typeS;
8866 * HOL/record package improvements:
8867 - new derived operations "fields" to build a partial record section,
8868 "extend" to promote a fixed record to a record scheme, and
8869 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
8870 declared as simp by default;
8871 - shared operations ("more", "fields", etc.) now need to be always
8872 qualified) --- potential INCOMPATIBILITY;
8873 - removed "make_scheme" operations (use "make" with "extend") --
8875 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
8876 - provides cases/induct rules for use with corresponding Isar
8877 methods (for concrete records, record schemes, concrete more
8878 parts, and schematic more parts -- in that order);
8879 - internal definitions directly based on a light-weight abstract
8880 theory of product types over typedef rather than datatype;
8882 * HOL: generic code generator for generating executable ML code from
8883 specifications; specific support for HOL constructs such as inductive
8884 datatypes and sets, as well as recursive functions; can be invoked
8885 via 'generate_code' theory section;
8887 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
8889 * HOL: consolidated and renamed several theories. In particular:
8890 Ord.thy has been absorbed into HOL.thy
8891 String.thy has been absorbed into List.thy
8893 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
8894 (beware of argument permutation!);
8896 * HOL: linorder_less_split superseded by linorder_cases;
8898 * HOL/List: "nodups" renamed to "distinct";
8900 * HOL: added "The" definite description operator; move Hilbert's "Eps"
8901 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
8902 - Ex_def has changed, now need to use some_eq_ex
8904 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
8905 in this (rare) case use:
8907 delSWrapper "split_all_tac"
8908 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
8910 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
8913 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
8914 Isabelle's type classes, ^ on functions and relations has too general
8915 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
8916 necessary to attach explicit type constraints;
8918 * HOL/Relation: the prefix name of the infix "O" has been changed from
8919 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
8920 renamed accordingly (eg "compI" -> "rel_compI").
8922 * HOL: syntax translations now work properly with numerals and records
8925 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
8926 of "lam" -- INCOMPATIBILITY;
8928 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
8929 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
8930 renamed "Product_Type.unit";
8932 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
8934 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
8935 the "cases" method);
8937 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
8940 * HOL/IMP: updated and converted to new-style theory format; several
8941 parts turned into readable document, with proper Isar proof texts and
8942 some explanations (by Gerwin Klein);
8944 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
8946 * HOL-Hyperreal is now a logic image;
8951 * Isar: consts/constdefs supports mixfix syntax for continuous
8954 * Isar: domain package adapted to new-style theory format, e.g. see
8957 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
8958 potential INCOMPATIBILITY; now use plain induct_tac instead of former
8959 lift.induct_tac, always use UU instead of Undef;
8961 * HOLCF/IMP: updated and converted to new-style theory;
8966 * Isar: proper integration of logic-specific tools and packages,
8967 including theory commands '(co)inductive', '(co)datatype',
8968 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
8969 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
8971 * theory Main no longer includes AC; for the Axiom of Choice, base
8972 your theory on Main_ZFC;
8974 * the integer library now covers quotients and remainders, with many
8975 laws relating division to addition, multiplication, etc.;
8977 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
8978 typeless version of the formalism;
8980 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
8983 * ZF/Induct: new directory for examples of inductive definitions,
8984 including theory Multiset for multiset orderings; converted to
8985 new-style theory format;
8987 * ZF: many new theorems about lists, ordinals, etc.;
8992 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
8993 variable proof controls level of detail: 0 = no proofs (only oracle
8994 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
8995 also ref manual for further ML interfaces;
8997 * Pure/axclass: removed obsolete ML interface
8998 goal_subclass/goal_arity;
9000 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
9001 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
9002 separate tokens, so expressions involving minus need to be spaced
9005 * Pure/syntax: support non-oriented infixes, using keyword "infix"
9006 rather than "infixl" or "infixr";
9008 * Pure/syntax: concrete syntax for dummy type variables admits genuine
9009 sort constraint specifications in type inference; e.g. "x::_::foo"
9010 ensures that the type of "x" is of sort "foo" (but not necessarily a
9013 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
9014 control output of nested => (types); the default behavior is
9017 * Pure/syntax: builtin parse translation for "_constify" turns valued
9018 tokens into AST constants;
9020 * Pure/syntax: prefer later declarations of translations and print
9021 translation functions; potential INCOMPATIBILITY: need to reverse
9022 multiple declarations for same syntax element constant;
9024 * Pure/show_hyps reset by default (in accordance to existing Isar
9027 * Provers/classical: renamed addaltern to addafter, addSaltern to
9030 * Provers/clasimp: ``iff'' declarations now handle conditional rules
9033 * system: tested support for MacOS X; should be able to get Isabelle +
9034 Proof General to work in a plain Terminal after installing Poly/ML
9035 (e.g. from the Isabelle distribution area) and GNU bash alone
9036 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
9037 support requires further installations, e.g. from
9038 http://fink.sourceforge.net/);
9040 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
9042 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
9043 of 40 MB), cf. ML_OPTIONS;
9045 * system: Proof General keywords specification is now part of the
9046 Isabelle distribution (see etc/isar-keywords.el);
9048 * system: support for persistent Proof General sessions (refrain from
9049 outdating all loaded theories on startup); user may create writable
9050 logic images like this: ``isabelle -q HOL Test'';
9052 * system: smart selection of Isabelle process versus Isabelle
9053 interface, accommodates case-insensitive file systems (e.g. HFS+); may
9054 run both "isabelle" and "Isabelle" even if file names are badly
9055 damaged (executable inspects the case of the first letter of its own
9056 name); added separate "isabelle-process" and "isabelle-interface";
9058 * system: refrain from any attempt at filtering input streams; no
9059 longer support ``8bit'' encoding of old isabelle font, instead proper
9060 iso-latin characters may now be used; the related isatools
9061 "symbolinput" and "nonascii" have disappeared as well;
9063 * system: removed old "xterm" interface (the print modes "xterm" and
9064 "xterm_color" are still available for direct use in a suitable
9069 New in Isabelle99-2 (February 2001)
9070 -----------------------------------
9072 *** Overview of INCOMPATIBILITIES ***
9074 * HOL: please note that theories in the Library and elsewhere often use the
9075 new-style (Isar) format; to refer to their theorems in an ML script you must
9076 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
9078 * HOL: inductive package no longer splits induction rule aggressively,
9079 but only as far as specified by the introductions given; the old
9080 format may be recovered via ML function complete_split_rule or attribute
9081 'split_rule (complete)';
9083 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
9084 gfp_Tarski to gfp_unfold;
9086 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
9088 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
9089 relation); infix "^^" has been renamed "``"; infix "``" has been
9090 renamed "`"; "univalent" has been renamed "single_valued";
9092 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
9095 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
9097 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
9099 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
9100 consequence, it is no longer monotonic wrt. the local goal context
9101 (which is now passed through the inductive cases);
9103 * Document preparation: renamed standard symbols \<ll> to \<lless> and
9104 \<gg> to \<ggreater>;
9107 *** Document preparation ***
9109 * \isabellestyle{NAME} selects version of Isabelle output (currently
9110 available: are "it" for near math-mode best-style output, "sl" for
9111 slanted text style, and "tt" for plain type-writer; if no
9112 \isabellestyle command is given, output is according to slanted
9115 * support sub/super scripts (for single symbols only), input syntax is
9116 like this: "A\<^sup>*" or "A\<^sup>\<star>";
9118 * some more standard symbols; see Appendix A of the system manual for
9119 the complete list of symbols defined in isabellesym.sty;
9121 * improved isabelle style files; more abstract symbol implementation
9122 (should now use \isamath{...} and \isatext{...} in custom symbol
9125 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
9126 state; Note that presentation of goal states does not conform to
9127 actual human-readable proof documents. Please do not include goal
9128 states into document output unless you really know what you are doing!
9130 * proper indentation of antiquoted output with proportional LaTeX
9133 * no_document ML operator temporarily disables LaTeX document
9136 * isatool unsymbolize tunes sources for plain ASCII communication;
9141 * Pure: Isar now suffers initial goal statements to contain unbound
9142 schematic variables (this does not conform to actual readable proof
9143 documents, due to unpredictable outcome and non-compositional proof
9144 checking); users who know what they are doing may use schematic goals
9145 for Prolog-style synthesis of proven results;
9147 * Pure: assumption method (an implicit finishing) now handles actual
9150 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
9151 initial goal, declare "that" only as Pure intro (only for single
9152 steps); the "that" rule assumption may now be involved in implicit
9153 finishing, thus ".." becomes a feasible for trivial obtains;
9155 * Pure: default proof step now includes 'intro_classes'; thus trivial
9156 instance proofs may be performed by "..";
9158 * Pure: ?thesis / ?this / "..." now work for pure meta-level
9161 * Pure: more robust selection of calculational rules;
9163 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
9164 rule (as well as the assumption rule);
9166 * Pure: 'thm_deps' command visualizes dependencies of theorems and
9167 lemmas, using the graph browser tool;
9169 * Pure: predict failure of "show" in interactive mode;
9171 * Pure: 'thms_containing' now takes actual terms as arguments;
9173 * HOL: improved method 'induct' --- now handles non-atomic goals
9174 (potential INCOMPATIBILITY); tuned error handling;
9176 * HOL: cases and induct rules now provide explicit hints about the
9177 number of facts to be consumed (0 for "type" and 1 for "set" rules);
9178 any remaining facts are inserted into the goal verbatim;
9180 * HOL: local contexts (aka cases) may now contain term bindings as
9181 well; the 'cases' and 'induct' methods new provide a ?case binding for
9182 the result to be shown in each case;
9184 * HOL: added 'recdef_tc' command;
9186 * isatool convert assists in eliminating legacy ML scripts;
9191 * HOL/Library: a collection of generic theories to be used together
9192 with main HOL; the theory loader path already includes this directory
9193 by default; the following existing theories have been moved here:
9194 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
9195 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
9197 * HOL/Unix: "Some aspects of Unix file-system security", a typical
9198 modelling and verification task performed in Isabelle/HOL +
9199 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
9201 * HOL/Algebra: special summation operator SUM no longer exists, it has
9202 been replaced by setsum; infix 'assoc' now has priority 50 (like
9203 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
9204 'domain', this makes the theory consistent with mathematical
9207 * HOL basics: added overloaded operations "inverse" and "divide"
9208 (infix "/"), syntax for generic "abs" operation, generic summation
9211 * HOL/typedef: simplified package, provide more useful rules (see also
9214 * HOL/datatype: induction rule for arbitrarily branching datatypes is
9215 now expressed as a proper nested rule (old-style tactic scripts may
9216 require atomize_strip_tac to cope with non-atomic premises);
9218 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
9219 to "split_conv" (old name still available for compatibility);
9221 * HOL: improved concrete syntax for strings (e.g. allows translation
9222 rules with string literals);
9224 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
9225 and Fleuriot's mechanization of analysis, including the transcendental
9226 functions for the reals;
9228 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
9233 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
9234 "lam" is displayed as TWO lambda-symbols
9236 * CTT: theory Main now available, containing everything (that is, Bool
9242 * Pure: the Simplifier has been implemented properly as a derived rule
9243 outside of the actual kernel (at last!); the overall performance
9244 penalty in practical applications is about 50%, while reliability of
9245 the Isabelle inference kernel has been greatly improved;
9247 * print modes "brackets" and "no_brackets" control output of nested =>
9248 (types) and ==> (props); the default behaviour is "brackets";
9250 * Provers: fast_tac (and friends) now handle actual object-logic rules
9251 as assumptions as well;
9253 * system: support Poly/ML 4.0;
9255 * system: isatool install handles KDE version 1 or 2;
9259 New in Isabelle99-1 (October 2000)
9260 ----------------------------------
9262 *** Overview of INCOMPATIBILITIES ***
9264 * HOL: simplification of natural numbers is much changed; to partly
9265 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
9266 issue the following ML commands:
9268 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
9269 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
9271 * HOL: simplification no longer dives into case-expressions; this is
9272 controlled by "t.weak_case_cong" for each datatype t;
9274 * HOL: nat_less_induct renamed to less_induct;
9276 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
9277 fixsome to patch .thy and .ML sources automatically;
9279 select_equality -> some_equality
9280 select_eq_Ex -> some_eq_ex
9281 selectI2EX -> someI2_ex
9284 select1_equality -> some1_equality
9285 Eps_sym_eq -> some_sym_eq_trivial
9286 Eps_eq -> some_eq_trivial
9288 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
9290 * HOL: removed obsolete theorem binding expand_if (refer to split_if
9293 * HOL: the recursion equations generated by 'recdef' are now called
9294 f.simps instead of f.rules;
9296 * HOL: qed_spec_mp now also handles bounded ALL as well;
9298 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
9299 sometimes be needed;
9301 * HOL: the constant for "f``x" is now "image" rather than "op ``";
9303 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
9305 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
9306 product is now "<*>" instead of "Times"; the lexicographic product is
9307 now "<*lex*>" instead of "**";
9309 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
9310 of main HOL, but was unused); better use HOL's datatype package;
9312 * HOL: removed "symbols" syntax for constant "override" of theory Map;
9313 the old syntax may be recovered as follows:
9316 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
9317 (infixl "\\<oplus>" 100)
9319 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9321 * HOL/ML: even fewer consts are declared as global (see theories Ord,
9322 Lfp, Gfp, WF); this only affects ML packages that refer to const names
9325 * HOL and ZF: syntax for quotienting wrt an equivalence relation
9326 changed from A/r to A//r;
9328 * ZF: new treatment of arithmetic (nat & int) may break some old
9331 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
9332 rulify -> rule_format, elimify -> elim_format, ...);
9334 * Isar/Provers: intro/elim/dest attributes changed; renamed
9335 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
9336 should have to change intro!! to intro? only); replaced "delrule" by
9339 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
9341 * Provers: strengthened force_tac by using new first_best_tac;
9343 * LaTeX document preparation: several changes of isabelle.sty (see
9347 *** Document preparation ***
9349 * formal comments (text blocks etc.) in new-style theories may now
9350 contain antiquotations of thm/prop/term/typ/text to be presented
9351 according to latex print mode; concrete syntax is like this:
9352 @{term[show_types] "f(x) = a + x"};
9354 * isatool mkdir provides easy setup of Isabelle session directories,
9355 including proper document sources;
9357 * generated LaTeX sources are now deleted after successful run
9358 (isatool document -c); may retain a copy somewhere else via -D option
9361 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
9362 style files, achieving self-contained LaTeX sources and simplifying
9365 * old-style theories now produce (crude) LaTeX output as well;
9367 * browser info session directories are now self-contained (may be put
9368 on WWW server seperately); improved graphs of nested sessions; removed
9369 graph for 'all sessions';
9371 * several improvements in isabelle style files; \isabellestyle{it}
9372 produces fake math mode output; \isamarkupheader is now \section by
9373 default; see lib/texinputs/isabelle.sty etc.;
9378 * Isar/Pure: local results and corresponding term bindings are now
9379 subject to Hindley-Milner polymorphism (similar to ML); this
9380 accommodates incremental type-inference very nicely;
9382 * Isar/Pure: new derived language element 'obtain' supports
9383 generalized existence reasoning;
9385 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
9386 support accumulation of results, without applying any rules yet;
9387 useful to collect intermediate results without explicit name
9388 references, and for use with transitivity rules with more than 2
9391 * Isar/Pure: scalable support for case-analysis type proofs: new
9392 'case' language element refers to local contexts symbolically, as
9393 produced by certain proof methods; internally, case names are attached
9394 to theorems as "tags";
9396 * Isar/Pure: theory command 'hide' removes declarations from
9397 class/type/const name spaces;
9399 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
9400 indicate potential overloading;
9402 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
9404 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
9405 "{a,b,c}" instead of {a,b,c};
9407 * Isar/Pure now provides its own version of intro/elim/dest
9408 attributes; useful for building new logics, but beware of confusion
9409 with the version in Provers/classical;
9411 * Isar/Pure: the local context of (non-atomic) goals is provided via
9412 case name 'antecedent';
9414 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
9415 to the current context is now done automatically);
9417 * Isar/Pure: theory command 'method_setup' provides a simple interface
9418 for definining proof methods in ML;
9420 * Isar/Provers: intro/elim/dest attributes changed; renamed
9421 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
9422 most cases, one should have to change intro!! to intro? only);
9423 replaced "delrule" by "rule del";
9425 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
9426 'symmetric' attribute (the latter supercedes [RS sym]);
9428 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
9429 method modifier); 'simp' method: 'only:' modifier removes loopers as
9430 well (including splits);
9432 * Isar/Provers: Simplifier and Classical methods now support all kind
9433 of modifiers used in the past, including 'cong', 'iff', etc.
9435 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
9436 of Simplifier and Classical reasoner);
9438 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
9439 now support named cases; major packages (inductive, datatype, primrec,
9440 recdef) support case names and properly name parameters;
9442 * Isar/HOL: new transitivity rules for substitution in inequalities --
9443 monotonicity conditions are extracted to be proven at end of
9446 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
9449 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
9450 split_if split_if_asm; datatype package provides theorems foo.splits =
9451 foo.split foo.split_asm for each datatype;
9453 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
9454 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
9455 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
9456 use "(cases (simplified))" method in proper proof texts);
9458 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
9460 * Isar: names of theorems etc. may be natural numbers as well;
9462 * Isar: 'pr' command: optional arguments for goals_limit and
9463 ProofContext.prems_limit; no longer prints theory contexts, but only
9466 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
9467 additional print modes to be specified; e.g. "pr(latex)" will print
9468 proof state according to the Isabelle LaTeX style;
9470 * Isar: improved support for emulating tactic scripts, including proof
9471 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
9472 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
9473 (for HOL datatypes);
9475 * Isar: simplified (more robust) goal selection of proof methods: 1st
9476 goal, all goals, or explicit goal specifier (tactic emulation); thus
9477 'proof method scripts' have to be in depth-first order;
9479 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
9481 * Isar: removed 'help' command, which hasn't been too helpful anyway;
9482 should instead use individual commands for printing items
9483 (print_commands, print_methods etc.);
9485 * Isar: added 'nothing' --- the empty list of theorems;
9490 * HOL/MicroJava: formalization of a fragment of Java, together with a
9491 corresponding virtual machine and a specification of its bytecode
9492 verifier and a lightweight bytecode verifier, including proofs of
9493 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
9494 Cornelia Pusch (see also the homepage of project Bali at
9495 http://isabelle.in.tum.de/Bali/);
9497 * HOL/Algebra: new theory of rings and univariate polynomials, by
9500 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
9501 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
9504 * HOL/Lattice: fundamental concepts of lattice theory and order
9505 structures, including duals, properties of bounds versus algebraic
9506 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
9507 Theorem for complete lattices etc.; may also serve as a demonstration
9508 for abstract algebraic reasoning using axiomatic type classes, and
9509 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
9511 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
9514 * HOL/IMPP: extension of IMP with local variables and mutually
9515 recursive procedures, by David von Oheimb;
9517 * HOL/Lambda: converted into new-style theory and document;
9519 * HOL/ex/Multiquote: example of multiple nested quotations and
9520 anti-quotations -- basically a generalized version of de-Bruijn
9521 representation; very useful in avoiding lifting of operations;
9523 * HOL/record: added general record equality rule to simpset; fixed
9524 select-update simplification procedure to handle extended records as
9525 well; admit "r" as field name;
9527 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
9528 other numeric types and also as the identity of groups, rings, etc.;
9530 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
9531 Types nat and int belong to this axclass;
9533 * HOL: greatly improved simplification involving numerals of type nat, int, real:
9534 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
9535 i*j + k + j*#3*i simplifies to #4*(i*j) + k
9536 two terms #m*u and #n*u are replaced by #(m+n)*u
9537 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
9538 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
9539 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
9541 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
9542 powerful prover for predicate logic but knows nothing of clasets; see
9543 ex/mesontest.ML and ex/mesontest2.ML for example applications;
9545 * HOL: new version of "case_tac" subsumes both boolean case split and
9546 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
9547 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
9549 * HOL: simplification no longer dives into case-expressions: only the
9550 selector expression is simplified, but not the remaining arms; to
9551 enable full simplification of case-expressions for datatype t, you may
9552 remove t.weak_case_cong from the simpset, either globally (Delcongs
9553 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
9555 * HOL/recdef: the recursion equations generated by 'recdef' for
9556 function 'f' are now called f.simps instead of f.rules; if all
9557 termination conditions are proved automatically, these simplification
9558 rules are added to the simpset, as in primrec; rules may be named
9559 individually as well, resulting in a separate list of theorems for
9562 * HOL/While is a new theory that provides a while-combinator. It
9563 permits the definition of tail-recursive functions without the
9564 provision of a termination measure. The latter is necessary once the
9565 invariant proof rule for while is applied.
9567 * HOL: new (overloaded) notation for the set of elements below/above
9568 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
9570 * HOL: theorems impI, allI, ballI bound as "strip";
9572 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
9573 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
9574 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
9576 * HOL/Real: "rabs" replaced by overloaded "abs" function;
9578 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
9579 main HOL, but was unused);
9581 * HOL: fewer consts declared as global (e.g. have to refer to
9582 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
9584 * HOL: tuned AST representation of nested pairs, avoiding bogus output
9585 in case of overlap with user translations (e.g. judgements over
9586 tuples); (note that the underlying logical represenation is still
9592 * ZF: simplification automatically cancels common terms in arithmetic
9593 expressions over nat and int;
9595 * ZF: new treatment of nat to minimize type-checking: all operators
9596 coerce their operands to a natural number using the function natify,
9597 making the algebraic laws unconditional;
9599 * ZF: as above, for int: operators coerce their operands to an integer
9600 using the function intify;
9602 * ZF: the integer library now contains many of the usual laws for the
9603 orderings, including $<=, and monotonicity laws for $+ and $*;
9605 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
9608 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
9609 to the simplifier and classical reasoner simultaneously;
9614 * Provers: blast_tac now handles actual object-logic rules as
9615 assumptions; note that auto_tac uses blast_tac internally as well;
9617 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
9618 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
9620 * Provers: delrules now handles destruct rules as well (no longer need
9621 explicit make_elim);
9623 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
9624 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9625 use instead the strong form,
9626 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
9627 in HOL, FOL and ZF the function cla_make_elim will create such rules
9628 from destruct-rules;
9630 * Provers: Simplifier.easy_setup provides a fast path to basic
9631 Simplifier setup for new object-logics;
9633 * Pure: AST translation rules no longer require constant head on LHS;
9635 * Pure: improved name spaces: ambiguous output is qualified; support
9636 for hiding of names;
9638 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
9639 XSYMBOL_HOME; no longer need to do manual configuration in most
9642 * system: compression of ML heaps images may now be controlled via -c
9643 option of isabelle and isatool usedir (currently only observed by
9646 * system: isatool installfonts may handle X-Symbol fonts as well (very
9647 useful for remote X11);
9649 * system: provide TAGS file for Isabelle sources;
9651 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
9654 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
9655 timing flag supersedes proof_timing and Toplevel.trace;
9657 * ML: new combinators |>> and |>>> for incremental transformations
9658 with secondary results (e.g. certain theory extensions):
9660 * ML: PureThy.add_defs gets additional argument to indicate potential
9661 overloading (usually false);
9663 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
9668 New in Isabelle99 (October 1999)
9669 --------------------------------
9671 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9673 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
9674 are no longer simplified. (This allows the simplifier to unfold recursive
9675 functional programs.) To restore the old behaviour, declare
9677 Delcongs [if_weak_cong];
9679 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
9682 * HOL: the predicate "inj" is now defined by translation to "inj_on";
9684 * HOL/datatype: mutual_induct_tac no longer exists --
9685 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
9687 * HOL/typedef: fixed type inference for representing set; type
9688 arguments now have to occur explicitly on the rhs as type constraints;
9690 * ZF: The con_defs part of an inductive definition may no longer refer
9691 to constants declared in the same theory;
9693 * HOL, ZF: the function mk_cases, generated by the inductive
9694 definition package, has lost an argument. To simplify its result, it
9695 uses the default simpset instead of a supplied list of theorems.
9697 * HOL/List: the constructors of type list are now Nil and Cons;
9699 * Simplifier: the type of the infix ML functions
9700 setSSolver addSSolver setSolver addSolver
9701 is now simpset * solver -> simpset where `solver' is a new abstract type
9702 for packaging solvers. A solver is created via
9703 mk_solver: string -> (thm list -> int -> tactic) -> solver
9704 where the string argument is only a comment.
9709 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
9710 decision procedure for linear arithmetic. Currently it is used for
9711 types `nat', `int', and `real' in HOL (see below); it can, should and
9712 will be instantiated for other types and logics as well.
9714 * The simplifier now accepts rewrite rules with flexible heads, eg
9715 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
9716 They are applied like any rule with a non-pattern lhs, i.e. by first-order
9722 * New Isabelle/Isar subsystem provides an alternative to traditional
9723 tactical theorem proving; together with the ProofGeneral/isar user
9724 interface it offers an interactive environment for developing human
9725 readable proof documents (Isar == Intelligible semi-automated
9726 reasoning); for further information see isatool doc isar-ref,
9727 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
9729 * improved and simplified presentation of theories: better HTML markup
9730 (including colors), graph views in several sizes; isatool usedir now
9731 provides a proper interface for user theories (via -P option); actual
9732 document preparation based on (PDF)LaTeX is available as well (for
9733 new-style theories only); see isatool doc system for more information;
9735 * native support for Proof General, both for classic Isabelle and
9738 * ML function thm_deps visualizes dependencies of theorems and lemmas,
9739 using the graph browser tool;
9741 * Isabelle manuals now also available as PDF;
9743 * theory loader rewritten from scratch (may not be fully
9744 bug-compatible); old loadpath variable has been replaced by show_path,
9745 add_path, del_path, reset_path functions; new operations such as
9746 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
9749 * improved isatool install: option -k creates KDE application icon,
9750 option -p DIR installs standalone binaries;
9752 * added ML_PLATFORM setting (useful for cross-platform installations);
9753 more robust handling of platform specific ML images for SML/NJ;
9755 * the settings environment is now statically scoped, i.e. it is never
9756 created again in sub-processes invoked from isabelle, isatool, or
9759 * path element specification '~~' refers to '$ISABELLE_HOME';
9761 * in locales, the "assumes" and "defines" parts may be omitted if
9764 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
9767 * new print_mode "HTML";
9769 * new flag show_tags controls display of tags of theorems (which are
9770 basically just comments that may be attached by some tools);
9772 * Isamode 2.6 requires patch to accomodate change of Isabelle font
9773 mode and goal output format:
9775 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
9777 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
9779 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
9780 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
9782 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
9784 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
9786 * function bind_thms stores lists of theorems (cf. bind_thm);
9788 * new shorthand tactics ftac, eatac, datac, fatac;
9790 * qed (and friends) now accept "" as result name; in that case the
9791 theorem is not stored, but proper checks and presentation of the
9794 * theorem database now also indexes constants "Trueprop", "all",
9795 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
9800 ** HOL arithmetic **
9802 * There are now decision procedures for linear arithmetic over nat and
9805 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
9806 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
9807 are treated as atomic; subformulae not involving type `nat' or `int'
9808 are ignored; quantified subformulae are ignored unless they are
9809 positive universal or negative existential. The tactic has to be
9810 invoked by hand and can be a little bit slow. In particular, the
9811 running time is exponential in the number of occurrences of `min' and
9812 `max', and `-' on `nat'.
9814 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
9815 (negated) (in)equalities among the premises and the conclusion into
9816 account (i.e. no compound formulae) and does not know about `min' and
9817 `max', and `-' on `nat'. It is fast and is used automatically by the
9820 NB: At the moment, these decision procedures do not cope with mixed
9821 nat/int formulae where the two parts interact, such as `m < n ==>
9824 * HOL/Numeral provides a generic theory of numerals (encoded
9825 efficiently as bit strings); setup for types nat/int/real is in place;
9826 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
9827 int, existing theories and proof scripts may require a few additional
9830 * integer division and remainder can now be performed on constant
9833 * many properties of integer multiplication, division and remainder
9836 * An interface to the Stanford Validity Checker (SVC) is available through the
9837 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
9838 are proved automatically. SVC must be installed separately, and its results
9839 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
9840 invocation of the underlying oracle). For SVC see
9841 http://verify.stanford.edu/SVC
9843 * IsaMakefile: the HOL-Real target now builds an actual image;
9848 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
9849 (in Isabelle/Isar) -- by Gertrud Bauer;
9851 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
9852 analysis for assembly languages with subtypes;
9854 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
9855 -- avoids syntactic ambiguities and treats state, transition, and
9856 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
9857 changed syntax and (many) tactics;
9859 * HOL/inductive: Now also handles more general introduction rules such
9860 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
9861 theorems are now maintained within the theory (maintained via the
9864 * HOL/datatype: Now also handles arbitrarily branching datatypes
9865 (using function types) such as
9867 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
9869 * HOL/record: record_simproc (part of the default simpset) takes care
9870 of selectors applied to updated records; record_split_tac is no longer
9871 part of the default claset; update_defs may now be removed from the
9872 simpset in many cases; COMPATIBILITY: old behavior achieved by
9874 claset_ref () := claset() addSWrapper record_split_wrapper;
9875 Delsimprocs [record_simproc]
9877 * HOL/typedef: fixed type inference for representing set; type
9878 arguments now have to occur explicitly on the rhs as type constraints;
9880 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
9881 names rather than an ML expression;
9883 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
9884 supplied later. Program schemes can be defined, such as
9885 "While B C s = (if B s then While B C (C s) else s)"
9886 where the well-founded relation can be chosen after B and C have been given.
9888 * HOL/List: the constructors of type list are now Nil and Cons;
9889 INCOMPATIBILITY: while [] and infix # syntax is still there, of
9890 course, ML tools referring to List.list.op # etc. have to be adapted;
9892 * HOL_quantifiers flag superseded by "HOL" print mode, which is
9893 disabled by default; run isabelle with option -m HOL to get back to
9894 the original Gordon/HOL-style output;
9896 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
9897 ALL x<=y. P, EX x<y. P, EX x<=y. P;
9899 * HOL basic syntax simplified (more orthogonal): all variants of
9900 All/Ex now support plain / symbolic / HOL notation; plain syntax for
9901 Eps operator is provided as well: "SOME x. P[x]";
9903 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
9905 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
9906 thus available for user theories;
9908 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
9909 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
9912 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
9913 several times and then mp;
9918 * the notation <<...>> is now available as a notation for sequences of
9921 * the simplifier is now installed
9923 * the axiom system has been generalized (thanks to Soren Heilmann)
9925 * the classical reasoner now has a default rule database
9930 * new primrec section allows primitive recursive functions to be given
9931 directly (as in HOL) over datatypes and the natural numbers;
9933 * new tactics induct_tac and exhaust_tac for induction (or case
9934 analysis) over datatypes and the natural numbers;
9936 * the datatype declaration of type T now defines the recursor T_rec;
9938 * simplification automatically does freeness reasoning for datatype
9941 * automatic type-inference, with AddTCs command to insert new
9942 type-checking rules;
9944 * datatype introduction rules are now added as Safe Introduction rules
9947 * the syntax "if P then x else y" is now available in addition to
9951 *** Internal programming interfaces ***
9953 * tuned simplifier trace output; new flag debug_simp;
9955 * structures Vartab / Termtab (instances of TableFun) offer efficient
9956 tables indexed by indexname_ord / term_ord (compatible with aconv);
9958 * AxClass.axclass_tac lost the theory argument;
9960 * tuned current_goals_markers semantics: begin / end goal avoids
9961 printing empty lines;
9963 * removed prs and prs_fn hook, which was broken because it did not
9964 include \n in its semantics, forcing writeln to add one
9965 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
9966 string -> unit if you really want to output text without newline;
9968 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
9969 plain output, interface builders may have to enable 'isabelle_font'
9970 mode to get Isabelle font glyphs as before;
9972 * refined token_translation interface; INCOMPATIBILITY: output length
9973 now of type real instead of int;
9975 * theory loader actions may be traced via new ThyInfo.add_hook
9976 interface (see src/Pure/Thy/thy_info.ML); example application: keep
9977 your own database of information attached to *whole* theories -- as
9978 opposed to intra-theory data slots offered via TheoryDataFun;
9980 * proper handling of dangling sort hypotheses (at last!);
9981 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
9982 extra sort hypotheses that can be witnessed from the type signature;
9983 the force_strip_shyps flag is gone, any remaining shyps are simply
9984 left in the theorem (with a warning issued by strip_shyps_warning);
9988 New in Isabelle98-1 (October 1998)
9989 ----------------------------------
9991 *** Overview of INCOMPATIBILITIES (see below for more details) ***
9993 * several changes of automated proof tools;
9995 * HOL: major changes to the inductive and datatype packages, including
9996 some minor incompatibilities of theory syntax;
9998 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
10001 * HOL: removed duplicate thms in Arith:
10002 less_imp_add_less should be replaced by trans_less_add1
10003 le_imp_add_le should be replaced by trans_le_add1
10005 * HOL: unary minus is now overloaded (new type constraints may be
10008 * HOL and ZF: unary minus for integers is now #- instead of #~. In
10009 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
10010 now taken as an integer constant.
10012 * Pure: ML function 'theory_of' renamed to 'theory';
10015 *** Proof tools ***
10018 1. Asm_full_simp_tac is now more aggressive.
10019 1. It will sometimes reorient premises if that increases their power to
10021 2. It does no longer proceed strictly from left to right but may also
10022 rotate premises to achieve further simplification.
10023 For compatibility reasons there is now Asm_lr_simp_tac which is like the
10024 old Asm_full_simp_tac in that it does not rotate premises.
10025 2. The simplifier now knows a little bit about nat-arithmetic.
10027 * Classical reasoner: wrapper mechanism for the classical reasoner now
10028 allows for selected deletion of wrappers, by introduction of names for
10029 wrapper functionals. This implies that addbefore, addSbefore,
10030 addaltern, and addSaltern now take a pair (name, tactic) as argument,
10031 and that adding two tactics with the same name overwrites the first
10032 one (emitting a warning).
10033 type wrapper = (int -> tactic) -> (int -> tactic)
10034 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
10035 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
10036 delWrapper, delSWrapper: claset * string -> claset
10037 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
10039 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
10040 semantics; addbefore now affects only the unsafe part of step_tac
10041 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
10042 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
10045 * Classical reasoner: setwrapper to setWrapper and compwrapper to
10046 compWrapper; added safe wrapper (and access functions for it);
10048 * HOL/split_all_tac is now much faster and fails if there is nothing
10049 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
10050 and the names of the automatically generated variables have changed.
10051 split_all_tac has moved within claset() from unsafe wrappers to safe
10052 wrappers, which means that !!-bound variables are split much more
10053 aggressively, and safe_tac and clarify_tac now split such variables.
10054 If this splitting is not appropriate, use delSWrapper "split_all_tac".
10055 Note: the same holds for record_split_tac, which does the job of
10056 split_all_tac for record fields.
10058 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
10059 permanently to the default simpset using Addsplits just like
10060 Addsimps. They can be removed via Delsplits just like
10061 Delsimps. Lower-case versions are also available.
10063 * HOL/Simplifier: The rule split_if is now part of the default
10064 simpset. This means that the simplifier will eliminate all occurrences
10065 of if-then-else in the conclusion of a goal. To prevent this, you can
10066 either remove split_if completely from the default simpset by
10067 `Delsplits [split_if]' or remove it in a specific call of the
10068 simplifier using `... delsplits [split_if]'. You can also add/delete
10069 other case splitting rules to/from the default simpset: every datatype
10070 generates suitable rules `split_t_case' and `split_t_case_asm' (where
10071 t is the name of the datatype).
10073 * Classical reasoner / Simplifier combination: new force_tac (and
10074 derivatives Force_tac, force) combines rewriting and classical
10075 reasoning (and whatever other tools) similarly to auto_tac, but is
10076 aimed to solve the given subgoal completely.
10081 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
10082 and `goalw': the theory is no longer needed as an explicit argument -
10083 the current theory context is used; assumptions are no longer returned
10084 at the ML-level unless one of them starts with ==> or !!; it is
10085 recommended to convert to these new commands using isatool fixgoal
10086 (backup your sources first!);
10088 * new top-level commands 'thm' and 'thms' for retrieving theorems from
10089 the current theory context, and 'theory' to lookup stored theories;
10091 * new theory section 'locale' for declaring constants, assumptions and
10092 definitions that have local scope;
10094 * new theory section 'nonterminals' for purely syntactic types;
10096 * new theory section 'setup' for generic ML setup functions
10097 (e.g. package initialization);
10099 * the distribution now includes Isabelle icons: see
10100 lib/logo/isabelle-{small,tiny}.xpm;
10102 * isatool install - install binaries with absolute references to
10105 * isatool logo -- create instances of the Isabelle logo (as EPS);
10107 * print mode 'emacs' reserved for Isamode;
10109 * support multiple print (ast) translations per constant name;
10111 * theorems involving oracles are now printed with a suffixed [!];
10116 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
10118 * HOL/inductive package reorganized and improved: now supports mutual
10119 definitions such as
10124 oddI "n : EVEN ==> Suc n : ODD"
10125 evenI "n : ODD ==> Suc n : EVEN"
10127 new theorem list "elims" contains an elimination rule for each of the
10128 recursive sets; inductive definitions now handle disjunctive premises
10129 correctly (also ZF);
10131 INCOMPATIBILITIES: requires Inductive as an ancestor; component
10132 "mutual_induct" no longer exists - the induction rule is always
10133 contained in "induct";
10136 * HOL/datatype package re-implemented and greatly improved: now
10137 supports mutually recursive datatypes such as
10140 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
10141 | SUM ('a aexp) ('a aexp)
10142 | DIFF ('a aexp) ('a aexp)
10145 'a bexp = LESS ('a aexp) ('a aexp)
10146 | AND ('a bexp) ('a bexp)
10147 | OR ('a bexp) ('a bexp)
10149 as well as indirectly recursive datatypes such as
10152 ('a, 'b) term = Var 'a
10153 | App 'b ((('a, 'b) term) list)
10155 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
10156 induction on mutually / indirectly recursive datatypes.
10158 Primrec equations are now stored in theory and can be accessed via
10159 <function_name>.simps.
10163 - Theories using datatypes must now have theory Datatype as an
10165 - The specific <typename>.induct_tac no longer exists - use the
10166 generic induct_tac instead.
10167 - natE has been renamed to nat.exhaust - use exhaust_tac
10168 instead of res_inst_tac ... natE. Note that the variable
10169 names in nat.exhaust differ from the names in natE, this
10170 may cause some "fragile" proofs to fail.
10171 - The theorems split_<typename>_case and split_<typename>_case_asm
10172 have been renamed to <typename>.split and <typename>.split_asm.
10173 - Since default sorts of type variables are now handled correctly,
10174 some datatype definitions may have to be annotated with explicit
10176 - Primrec definitions no longer require function name and type
10177 of recursive argument.
10179 Consider using isatool fixdatatype to adapt your theories and proof
10180 scripts to the new package (backup your sources first!).
10183 * HOL/record package: considerably improved implementation; now
10184 includes concrete syntax for record types, terms, updates; theorems
10185 for surjective pairing and splitting !!-bound record variables; proof
10186 support is as follows:
10188 1) standard conversions (selectors or updates applied to record
10189 constructor terms) are part of the standard simpset;
10191 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
10192 made part of standard simpset and claset via addIffs;
10194 3) a tactic for record field splitting (record_split_tac) is part of
10195 the standard claset (addSWrapper);
10197 To get a better idea about these rules you may retrieve them via
10198 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
10199 the name of your record type.
10201 The split tactic 3) conceptually simplifies by the following rule:
10203 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
10205 Thus any record variable that is bound by meta-all will automatically
10206 blow up into some record constructor term, consequently the
10207 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
10208 solve record problems automatically.
10211 * reorganized the main HOL image: HOL/Integ and String loaded by
10212 default; theory Main includes everything;
10214 * automatic simplification of integer sums and comparisons, using cancellation;
10216 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
10218 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
10220 * many new identities for unions, intersections, set difference, etc.;
10222 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
10223 called split_if, split_split, split_sum_case and split_nat_case (to go
10224 with add/delsplits);
10226 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
10227 (?x::unit) = (); this is made part of the default simpset, which COULD
10228 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
10229 'Delsimprocs [unit_eq_proc];' as last resort); also note that
10230 unit_abs_eta_conv is added in order to counter the effect of
10231 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
10234 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
10237 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10238 It and 'sym RS equals0D' are now in the default claset, giving automatic
10239 disjointness reasoning but breaking a few old proofs.
10241 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
10242 to 'converse' from 'inverse' (for compatibility with ZF and some
10245 * HOL/recdef can now declare non-recursive functions, with {} supplied as
10246 the well-founded relation;
10248 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
10249 Compl A. The "Compl" syntax remains available as input syntax for this
10252 * HOL/Update: new theory of function updates:
10253 f(a:=b) == %x. if x=a then b else f x
10254 may also be iterated as in f(a:=b,c:=d,...);
10256 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
10259 - new function list_update written xs[i:=v] that updates the i-th
10260 list position. May also be iterated as in xs[i:=a,j:=b,...].
10261 - new function `upt' written [i..j(] which generates the list
10262 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
10263 bound write [i..j], which is a shorthand for [i..j+1(].
10264 - new lexicographic orderings and corresponding wellfoundedness theorems.
10267 - removed 'pred' (predecessor) function;
10268 - generalized some theorems about n-1;
10269 - many new laws about "div" and "mod";
10270 - new laws about greatest common divisors (see theory ex/Primes);
10272 * HOL/Relation: renamed the relational operator r^-1 "converse"
10273 instead of "inverse";
10275 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
10276 of the multiset ordering;
10278 * directory HOL/Real: a construction of the reals using Dedekind cuts
10279 (not included by default);
10281 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
10283 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
10284 programs, i.e. different program variables may have different types.
10286 * calling (stac rew i) now fails if "rew" has no effect on the goal
10287 [previously, this check worked only if the rewrite rule was unconditional]
10288 Now rew can involve either definitions or equalities (either == or =).
10293 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
10294 only the theorems proved on ZF.ML;
10296 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
10297 It and 'sym RS equals0D' are now in the default claset, giving automatic
10298 disjointness reasoning but breaking a few old proofs.
10300 * ZF/Update: new theory of function updates
10301 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
10302 may also be iterated as in f(a:=b,c:=d,...);
10304 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
10306 * calling (stac rew i) now fails if "rew" has no effect on the goal
10307 [previously, this check worked only if the rewrite rule was unconditional]
10308 Now rew can involve either definitions or equalities (either == or =).
10310 * case_tac provided for compatibility with HOL
10311 (like the old excluded_middle_tac, but with subgoals swapped)
10314 *** Internal programming interfaces ***
10316 * Pure: several new basic modules made available for general use, see
10317 also src/Pure/README;
10319 * improved the theory data mechanism to support encapsulation (data
10320 kind name replaced by private Object.kind, acting as authorization
10321 key); new type-safe user interface via functor TheoryDataFun; generic
10322 print_data function becomes basically useless;
10324 * removed global_names compatibility flag -- all theory declarations
10325 are qualified by default;
10327 * module Pure/Syntax now offers quote / antiquote translation
10328 functions (useful for Hoare logic etc. with implicit dependencies);
10329 see HOL/ex/Antiquote for an example use;
10331 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
10334 * new tactical CHANGED_GOAL for checking that a tactic modifies a
10337 * Display.print_goals function moved to Locale.print_goals;
10339 * standard print function for goals supports current_goals_markers
10340 variable for marking begin of proof, end of proof, start of goal; the
10341 default is ("", "", ""); setting current_goals_markers := ("<proof>",
10342 "</proof>", "<goal>") causes SGML like tagged proof state printing,
10347 New in Isabelle98 (January 1998)
10348 --------------------------------
10350 *** Overview of INCOMPATIBILITIES (see below for more details) ***
10352 * changed lexical syntax of terms / types: dots made part of long
10353 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
10355 * simpset (and claset) reference variable replaced by functions
10356 simpset / simpset_ref;
10358 * no longer supports theory aliases (via merge) and non-trivial
10359 implicit merge of thms' signatures;
10361 * most internal names of constants changed due to qualified names;
10363 * changed Pure/Sequence interface (see Pure/seq.ML);
10366 *** General Changes ***
10368 * hierachically structured name spaces (for consts, types, axms, thms
10369 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
10370 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
10371 isatool fixdots ensures space after dots (e.g. "%x. x"); set
10372 long_names for fully qualified output names; NOTE: ML programs
10373 (special tactics, packages etc.) referring to internal names may have
10374 to be adapted to cope with fully qualified names; in case of severe
10375 backward campatibility problems try setting 'global_names' at compile
10376 time to have enrything declared within a flat name space; one may also
10377 fine tune name declarations in theories via the 'global' and 'local'
10380 * reimplemented the implicit simpset and claset using the new anytype
10381 data filed in signatures; references simpset:simpset ref etc. are
10382 replaced by functions simpset:unit->simpset and
10383 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
10384 to patch your ML files accordingly;
10386 * HTML output now includes theory graph data for display with Java
10387 applet or isatool browser; data generated automatically via isatool
10388 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
10390 * defs may now be conditional; improved rewrite_goals_tac to handle
10391 conditional equations;
10393 * defs now admits additional type arguments, using TYPE('a) syntax;
10395 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
10396 creates a new theory node; implicit merge of thms' signatures is
10397 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
10398 transfer:theory->thm->thm in (rare) cases;
10400 * improved handling of draft signatures / theories; draft thms (and
10401 ctyps, cterms) are automatically promoted to real ones;
10403 * slightly changed interfaces for oracles: admit many per theory, named
10404 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
10406 * print_goals: optional output of const types (set show_consts and
10409 * improved output of warnings (###) and errors (***);
10411 * subgoal_tac displays a warning if the new subgoal has type variables;
10413 * removed old README and Makefiles;
10415 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
10417 * removed obsolete init_pps and init_database;
10419 * deleted the obsolete tactical STATE, which was declared by
10420 fun STATE tacfun st = tacfun st st;
10422 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
10423 (which abbreviates $HOME);
10425 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
10426 use isatool fixseq to adapt your ML programs (this works for fully
10427 qualified references to the Sequence structure only!);
10429 * use_thy no longer requires writable current directory; it always
10430 reloads .ML *and* .thy file, if either one is out of date;
10433 *** Classical Reasoner ***
10435 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
10436 tactics that use classical reasoning to simplify a subgoal without
10437 splitting it into several subgoals;
10439 * Safe_tac: like safe_tac but uses the default claset;
10444 * added simplification meta rules:
10445 (asm_)(full_)simplify: simpset -> thm -> thm;
10447 * simplifier.ML no longer part of Pure -- has to be loaded by object
10450 * added prems argument to simplification procedures;
10452 * HOL, FOL, ZF: added infix function `addsplits':
10453 instead of `<simpset> setloop (split_tac <thms>)'
10454 you can simply write `<simpset> addsplits <thms>'
10459 * TYPE('a) syntax for type reflection terms;
10461 * no longer handles consts with name "" -- declare as 'syntax' instead;
10463 * pretty printer: changed order of mixfix annotation preference (again!);
10465 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
10470 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
10471 with `addloop' of the simplifier to faciliate case splitting in premises.
10473 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
10475 * HOL/Auth: new protocol proofs including some for the Internet
10478 * HOL/Map: new theory of `maps' a la VDM;
10480 * HOL/simplifier: simplification procedures nat_cancel_sums for
10481 cancelling out common nat summands from =, <, <= (in)equalities, or
10482 differences; simplification procedures nat_cancel_factor for
10483 cancelling common factor from =, <, <= (in)equalities over natural
10484 sums; nat_cancel contains both kinds of procedures, it is installed by
10485 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
10487 * HOL/simplifier: terms of the form
10488 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
10490 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
10491 and those of the form
10492 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
10494 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
10497 Each datatype `t' now comes with a theorem `split_t_case' of the form
10499 P(t_case f1 ... fn x) =
10500 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
10502 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
10505 and a theorem `split_t_case_asm' of the form
10507 P(t_case f1 ... fn x) =
10508 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
10510 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
10512 which can be added to a simpset via `addsplits'. The existing theorems
10513 expand_list_case and expand_option_case have been renamed to
10514 split_list_case and split_option_case.
10517 - `pred n' is automatically converted to `n-1'.
10518 Users are strongly encouraged not to use `pred' any longer,
10519 because it will disappear altogether at some point.
10520 - Users are strongly encouraged to write "0 < n" rather than
10521 "n ~= 0". Theorems and proof tools have been modified towards this
10525 the function "set_of_list" has been renamed "set" (and its theorems too);
10526 the function "nth" now takes its arguments in the reverse order and
10527 has acquired the infix notation "!" as in "xs!n".
10529 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
10531 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
10532 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
10534 * HOL/record: extensible records with schematic structural subtyping
10535 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
10536 still lacks various theorems and concrete record syntax;
10541 * removed "axioms" and "generated by" sections;
10543 * replaced "ops" section by extended "consts" section, which is capable of
10544 handling the continuous function space "->" directly;
10547 . proves theorems immediately and stores them in the theory,
10548 . creates hierachical name space,
10549 . now uses normal mixfix annotations (instead of cinfix...),
10550 . minor changes to some names and values (for consistency),
10551 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
10552 . separator between mutual domain defs: changed "," to "and",
10553 . improved handling of sort constraints; now they have to
10554 appear on the left-hand side of the equations only;
10556 * fixed LAM <x,y,zs>.b syntax;
10558 * added extended adm_tac to simplifier in HOLCF -- can now discharge
10559 adm (%x. P (t x)), where P is chainfinite and t continuous;
10564 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
10565 with `addloop' of the simplifier to faciliate case splitting in premises.
10567 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
10568 in HOL, they strip ALL and --> from proved theorems;
10572 New in Isabelle94-8 (May 1997)
10573 ------------------------------
10575 *** General Changes ***
10577 * new utilities to build / run / maintain Isabelle etc. (in parts
10578 still somewhat experimental); old Makefiles etc. still functional;
10580 * new 'Isabelle System Manual';
10582 * INSTALL text, together with ./configure and ./build scripts;
10584 * reimplemented type inference for greater efficiency, better error
10585 messages and clean internal interface;
10587 * prlim command for dealing with lots of subgoals (an easier way of
10588 setting goals_limit);
10593 * supports alternative (named) syntax tables (parser and pretty
10594 printer); internal interface is provided by add_modesyntax(_i);
10596 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
10597 be used in conjunction with the Isabelle symbol font; uses the
10598 "symbols" syntax table;
10600 * added token_translation interface (may translate name tokens in
10601 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
10602 the current print_mode); IMPORTANT: user print translation functions
10603 are responsible for marking newly introduced bounds
10604 (Syntax.mark_boundT);
10606 * token translations for modes "xterm" and "xterm_color" that display
10607 names in bold, underline etc. or colors (which requires a color
10610 * infixes may now be declared with names independent of their syntax;
10612 * added typed_print_translation (like print_translation, but may
10613 access type of constant);
10616 *** Classical Reasoner ***
10618 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
10619 some limitations. Blast_tac...
10620 + ignores addss, addbefore, addafter; this restriction is intrinsic
10621 + ignores elimination rules that don't have the correct format
10622 (the conclusion MUST be a formula variable)
10623 + ignores types, which can make HOL proofs fail
10624 + rules must not require higher-order unification, e.g. apply_type in ZF
10625 [message "Function Var's argument not a bound variable" relates to this]
10626 + its proof strategy is more general but can actually be slower
10628 * substitution with equality assumptions no longer permutes other
10631 * minor changes in semantics of addafter (now called addaltern); renamed
10632 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
10633 (and access functions for it);
10635 * improved combination of classical reasoner and simplifier:
10636 + functions for handling clasimpsets
10637 + improvement of addss: now the simplifier is called _after_ the
10639 + safe variant of addss called addSss: uses safe simplifications
10640 _during_ the safe steps. It is more complete as it allows multiple
10641 instantiations of unknowns (e.g. with slow_tac).
10645 * added interface for simplification procedures (functions that
10646 produce *proven* rewrite rules on the fly, depending on current
10649 * ordering on terms as parameter (used for ordered rewriting);
10651 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
10653 * the solver is now split into a safe and an unsafe part.
10654 This should be invisible for the normal user, except that the
10655 functions setsolver and addsolver have been renamed to setSolver and
10656 addSolver; added safe_asm_full_simp_tac;
10661 * a generic induction tactic `induct_tac' which works for all datatypes and
10662 also for type `nat';
10664 * a generic case distinction tactic `exhaust_tac' which works for all
10665 datatypes and also for type `nat';
10667 * each datatype comes with a function `size';
10669 * patterns in case expressions allow tuple patterns as arguments to
10670 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
10672 * primrec now also works with type nat;
10674 * recdef: a new declaration form, allows general recursive functions to be
10675 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
10677 * the constant for negation has been renamed from "not" to "Not" to
10678 harmonize with FOL, ZF, LK, etc.;
10680 * HOL/ex/LFilter theory of a corecursive "filter" functional for
10683 * HOL/Modelcheck demonstrates invocation of model checker oracle;
10685 * HOL/ex/Ring.thy declares cring_simp, which solves equational
10686 problems in commutative rings, using axiomatic type classes for + and *;
10688 * more examples in HOL/MiniML and HOL/Auth;
10690 * more default rewrite rules for quantifiers, union/intersection;
10692 * a new constant `arbitrary == @x.False';
10694 * HOLCF/IOA replaces old HOL/IOA;
10696 * HOLCF changes: derived all rules and arities
10697 + axiomatic type classes instead of classes
10698 + typedef instead of faking type definitions
10699 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
10700 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
10701 + eliminated the types void, one, tr
10702 + use unit lift and bool lift (with translations) instead of one and tr
10703 + eliminated blift from Lift3.thy (use Def instead of blift)
10704 all eliminated rules are derived as theorems --> no visible changes ;
10709 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
10710 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
10711 as ZF_cs addSIs [equalityI];
10715 New in Isabelle94-7 (November 96)
10716 ---------------------------------
10718 * allowing negative levels (as offsets) in prlev and choplev;
10720 * super-linear speedup for large simplifications;
10722 * FOL, ZF and HOL now use miniscoping: rewriting pushes
10723 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
10724 FAIL); can suppress it using the command Delsimps (ex_simps @
10725 all_simps); De Morgan laws are also now included, by default;
10727 * improved printing of ==> : ~:
10729 * new object-logic "Sequents" adds linear logic, while replacing LK
10730 and Modal (thanks to Sara Kalvala);
10732 * HOL/Auth: correctness proofs for authentication protocols;
10734 * HOL: new auto_tac combines rewriting and classical reasoning (many
10735 examples on HOL/Auth);
10737 * HOL: new command AddIffs for declaring theorems of the form P=Q to
10738 the rewriter and classical reasoner simultaneously;
10740 * function uresult no longer returns theorems in "standard" format;
10741 regain previous version by: val uresult = standard o uresult;
10745 New in Isabelle94-6
10746 -------------------
10748 * oracles -- these establish an interface between Isabelle and trusted
10749 external reasoners, which may deliver results as theorems;
10751 * proof objects (in particular record all uses of oracles);
10753 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
10755 * "constdefs" section in theory files;
10757 * "primrec" section (HOL) no longer requires names;
10759 * internal type "tactic" now simply "thm -> thm Sequence.seq";
10763 New in Isabelle94-5
10764 -------------------
10766 * reduced space requirements;
10768 * automatic HTML generation from theories;
10770 * theory files no longer require "..." (quotes) around most types;
10772 * new examples, including two proofs of the Church-Rosser theorem;
10774 * non-curried (1994) version of HOL is no longer distributed;
10778 New in Isabelle94-4
10779 -------------------
10781 * greatly reduced space requirements;
10783 * theory files (.thy) no longer require \...\ escapes at line breaks;
10785 * searchable theorem database (see the section "Retrieving theorems" on
10786 page 8 of the Reference Manual);
10788 * new examples, including Grabczewski's monumental case study of the
10791 * The previous version of HOL renamed to Old_HOL;
10793 * The new version of HOL (previously called CHOL) uses a curried syntax
10794 for functions. Application looks like f a b instead of f(a,b);
10796 * Mutually recursive inductive definitions finally work in HOL;
10798 * In ZF, pattern-matching on tuples is now available in all abstractions and
10799 translates to the operator "split";
10803 New in Isabelle94-3
10804 -------------------
10806 * new infix operator, addss, allowing the classical reasoner to
10807 perform simplification at each step of its search. Example:
10808 fast_tac (cs addss ss)
10810 * a new logic, CHOL, the same as HOL, but with a curried syntax
10811 for functions. Application looks like f a b instead of f(a,b). Also pairs
10812 look like (a,b) instead of <a,b>;
10814 * PLEASE NOTE: CHOL will eventually replace HOL!
10816 * In CHOL, pattern-matching on tuples is now available in all abstractions.
10817 It translates to the operator "split". A new theory of integers is available;
10819 * In ZF, integer numerals now denote two's-complement binary integers.
10820 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
10822 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
10823 of the Axiom of Choice;
10827 New in Isabelle94-2
10828 -------------------
10830 * Significantly faster resolution;
10832 * the different sections in a .thy file can now be mixed and repeated
10835 * Database of theorems for FOL, HOL and ZF. New
10836 commands including qed, qed_goal and bind_thm store theorems in the database.
10838 * Simple database queries: return a named theorem (get_thm) or all theorems of
10839 a given theory (thms_of), or find out what theory a theorem was proved in
10842 * Bugs fixed in the inductive definition and datatype packages;
10844 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
10845 and HOL_dup_cs obsolete;
10847 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
10850 * Simpler definition of function space in ZF;
10852 * new results about cardinal and ordinal arithmetic in ZF;
10854 * 'subtype' facility in HOL for introducing new types as subsets of existing
10857 :mode=isabelle-news:wrap=hard:maxLineLen=72: