avoid using Arith_Data.dest_sum in extended-nat simprocs (it treats 'x - y' as 'x + - y', which is not valid for enat)

netlimit is abbreviation for Lim

tuned proofs

changed has_derivative_intros into a named theorems collection

changed continuous_on_intros into a named theorems collection

changed continuous_intros into a named theorems collection

add tendsto_eq_intros: they add an additional rewriting step at the rhs of --->

major redesign: order instead of preorder, new definition of intervals as quotients

added lemma

extended numerals

merged

merged

removed unused Future.flat, while leaving its influence of Future.map (see bcd6b1aa4db5);

extended stream library a little more

extended stream library

generalized lemmas in Extended_Real_Limits

eventually nhds represented using sequentially

generalized compact_Times to topological_space

move lemma Inf to usage point

tuned proof of Edelstein fixed point theorem (use continuity of dist and attains_sup)

tuned proofs (used continuity of infdist, dist and continuous_attains_sup)

generalized continuous/compact_attains_inf/sup from real to linorder_topology

continuity of pair operations

use generate_topology for second countable topologies, does not require intersection stable basis

generalized isGlb_unique

complete_linorder is also a complete_distrib_lattice

move Liminf / Limsup lemmas on complete_lattices to its own file

merged

New theory of infinity-extended types; should replace Extended_xyz eventually

Avoid ML warning about unreferenced identifier.

polymorphic SPASS is also SPASS

allow more general coercion maps; tuned;

more lemmas about intervals

merged

refined parallel_proofs = 2: fork whole Isar sub-proofs, not just terminal ones; refined parallel_proofs = 3: fork terminal proofs, as poor man's parallelization in interactive mode;

join all proofs before scheduling present phase (ordered according to weight); tuned;

more explicit datatype result;

split dense into inner_dense_order and no_top/no_bot

move auxiliary lemmas from Library/Extended_Reals to HOL image

tuned (extend datatype to inline option)

prefer more systematic Future.flat;

more uniform Future.map: always internalize failure; added Future.flat as fast-path operation;

uniform treatment of global/local proofs; tuned;

tuned;

clarified Toplevel.element_result wrt. Toplevel.is_ignored;

more Thy_Syntax.element operations;

coercion-invariant arguments at work

constants with coercion-invariant arguments (possibility to disable/reenable coercions under certain constants, necessary for the forthcoming logically unspecified control structures for case translations)

simplified Proof.future_proof;

provide explicit dummy names (cf. dfe469293eb4);

discontinued empty name bindings in 'axiomatization';

provide common HOLogic.conj_conv and HOLogic.eq_conv;

just one HOLogic.Trueprop_conv, with regular exception CTERM; tuned;

discontinued obsolete 'axioms' command;

more robust build error handling, e.g. missing outer syntax commands;

eliminated legacy 'axioms';

eliminated legacy 'axioms';

eliminated legacy 'axioms';

eliminated legacy 'axioms';

eliminated legacy 'axioms';