tuning

typeclass formalising bounded subtraction

dropped some unused identifiers

export rel_mono theorem

merged two unfold steps

took out one rotate_tac

killed spurious rotate_tac; use auto instead of blast

moved blast tactic to where it is actually needed

fixed bug in "mk_map" for the "fun" case

correct generalization to 3 or more mutually recursive datatypes

provide more guidance, exploiting our knowledge of the goal

fixed issue with bound variables in prem prems + tuning

use right version of "mk_UnIN"

select the right premise in "mk_induct_discharge_prem_prems_tac" instead of relying on backtracking

tuned code before fixing "mk_induct_discharge_prem_prems_tac"

tuned proofs;

merged

polished the induction

put the flat at the right place (to avoid exceptions)

fixed variable exporting problem

compile

added induct tactic

tuning

renamed "mk_UnN" to "mk_UnIN"

merged two commands

allow default values to refer to selector arguments -- this is useful, e.g. for tllist: ttl (TNil x) = TNil x (example by Andreas Lochbihler)

distinguish between nested and nesting BNFs

make tactic more robust in the case where "asm_simp_tac" already finishes the job

derive induction via backward proof, to ensure that the premises are in the right order for constructors like "X x y x" where x and y are mutually recursive

no longer react on global_settings (cf. 34ac36642a31);

refined output panel: more value-oriented approach to update and caret focus;

clarified markup names;

more general Document_Model.point_range; more general Document_View.Active_Area; eliminated dead popup material;

more static handling of rendering options;

tuned options (again);

more scalable option-group;

tuned

merged

tuned proofs;

remove theory Real_Integration, not needed since 44e42d392c6e when Euclidean spaces where introduced

workaround for HOL-Mirabelle-ex oddities;

instructions for quick start in 20min;

more liberal init_components: base dir may get created later when resolving missing components;

more efficient painting based on cached result;

more standard init_components -- particularly important to pick up correct jdk/scala version;

tuned

merged

rough and ready induction

nicer error message, indicating which type is empty (relying on metatheoretical completeness proof here)

observe context more carefully when producing "fresh" variables -- for increased chances that method "subst" works in local context (including that of forked proofs);

eliminated some old material that is unused in the visible universe;

tuning

set up things for (co)induction sugar

tuning

added sumEN_tupled_balanced

load fonts into JavaFX as well;

some support for actual HTML rendering;

merged

free variable name tuning

reuse generated names (they look better + slightly more efficient)

desambiguate grammar (e.g. for Nil's mixfix ("[]"))

avoided duplicate lemma

put an underscore between names, for compatibility with old package (and also because it makes sense)

got rid of metis calls

tuning

removed obsolete argument "int" and thus made SML/NJ happy (cf. 03bee3a6a1b7);

standardized ML aliases;

tuned headers;

avoid spaces in markup names, which might cause problems in boundary situations (e.g. HTML class);

discontinued experiment with literal replacement text in PDF (cf. b646316f8b3c, 2ff10e613689);

more robust interrupt handling;

some attempts to synchronize ROOT/files and document/build;

tuned error;

option_pred characterization

true vs. True in pattern matching

reduced theory dependencies

tuning

moved theorems closer to where they are used

tuning

renamed "Ordinals_and_Cardinals" to "Cardinals"

split basic BNFs into really basic ones and others, and added Andreas Lochbihler's "option" BNF

reorganized dependencies so that the sugar does not depend on GFP -- this will be essential for bootstrapping

tuning

tuning annotations

tuned antiquotations

tuning

tuning

added optional qualifiers for constructors and destructors, similarly to the old package

adapted example

added attributes to theorems

merged

support for sort constraints in new (co)data commands

provide a programmatic interface for FP sugar

some GUI support for color options;

more precise sections;

provide color values via options;

prefer tuning parameters as public methods (again) -- to allow overriding in applications;

updated keywords;

merged

tuned;

more informative tooltip: default value;

more options;

allow defaults for one datatype to involve the constructor of another one in the mutually recursive case

added "defaults" option

removed wrong "transpose" and ensure "sel" theorems are put in the right order (grouped per selector, in the order in which the selectors appear)

spin off "bnf_def_tactics.ML"

move "bnf_util.ML" to "BNF_Util.thy"

renamed "BNF_Library" to "BNF_Util"

generate all sel theorems

allow default values for selectors in low-level "wrap_data" command

removed needless "infer_types" call

added no_dests option