correctly handle multiple copies of the same axiom with the same types

put two operations in the right order

reintroduce old "unify_prem_with_concl" code to avoid reaching unification bound + primitive handling for polymorphism

apply "assume_tac" directly on the right assumption, using "rotate_tac" -- this ensures that the desired unifications are performed

instantiate foralls and release exists in the order described by the topological order

reverted 0bfaaa81fc62, since "Thm.rename_boundvars" can't be relied upon to give unique names to bound variables

renamed internal function

hack in MESON to make it less likely that variables (e.g. "x") get renamed (e.g. "xa") when resolving

tuned header

tuned

force less agressively

lexicographic_order: replace parallel map with laziness to avoid wasting cycles on proofs that are not needed

removed complicated (and rarely helpful) error reporting

discontinued continuations to simplify control flow; dropped optimization in scnp

use Cache structure instead of passing tables around explicitly

merged

lemmas fold_commute and fold_commute_apply

spelling

adjusted to inductive characterization of sorted

tuned whitespace

turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs

turned distinct and sorted into inductive predicates: yields nice induction principles for free

turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs

some Poly/ML-specific debugging code escaped in the wild -- comment it out

merged

avoid antiquotation processing for code_reflect; moved ML_Context.value to Code_Runtime

moved ML_Context.value to Code_Runtime

constant `contents` renamed to `the_elem`

merged

tune whitespace

rename bound variables after skolemizing, if the axiom of choice is available

tuning

rename quantified variables earlier in the new skolemizer, to ensure consistent naming later (in the absence of the choice axiom)

tune bound names

merged

avoid dependency on "int"

make "cnf_axiom" work (after a fashion) in the absence of the axiom of choice

added "meson_choice" attribute as a step towards making (less powerful versions of) Meson/Metis/Sledgehammer work without the axiom of choice

compute quantifier dependency graph in new skolemizer

tuning

compute substitutions in new skolemizer

encode axiom number and cluster number in all zapped quantifiers to help discharging new skolemizer assumptions

reintroduced code that keeps track of whether the Isabelle and Metis proofs are in sync -- generalized to work with the new skolemizer

encode number of skolem assumptions in them, for more efficient retrieval later

move functions closer to where they're used

Skolemizer tweaking

"meson_new_skolemizer" -> "metis_new_skolemizer" option (since Meson doesn't support the new skolemizer (yet))

finished renaming file and module

rename file

ignore Skolem assumption (if any)

second step in introducing the new Skolemizer -- notably, added procedure for discharging Skolem assumptions

first step towards a new skolemizer that doesn't require "Eps"

cumulative update of generated files (since bf164c153d10);

removed ML_old.thy, which is largely superseded by ML.thy;

more on "Canonical argument order"; tuned;

cover @{Isar.state};

more on "Style and orthography";

more on "Naming conventions"; tuned;

tuned;

more on "Style and orthography";

more refs;

preliminary material on "Concrete syntax and type-checking";

more on "Association lists", based on more succinct version of older material;

clarified "lists as a set-like container";

more robust treatment of "op IDENT";

more on messages;

more on synchronized variables;

tuned;

more robust index_ML antiquotations: guess name from text (affects infixes and type constructors in particular);

misc tuning;

somewhat modernized version of "Thread-safe programming";

more robust examples: explicit @{assert} instead of unchecked output;

more on "Configuration options";

tuned;

more on "Basic data types"; tuned;

more on "Integers";

use continental paragraph style, which works better with mixture of (in)formal text; tuned skips and indents; tuned;

robustified "warn" environment if \parindent is zero (e.g. within itemize, description etc.);

more on "Basic ML data types";

more robust treatment of symbolic indentifiers (which may contain colons);

more examples;

tuned;

more on "Exceptions"; tuned;

more on "Exceptions";

more examples;

tuned chapter arrangement;

more examples; tuned;

moved bind_thm(s) to implementation manual;

more on "Attributes"; tuned;

misc tuning and clarification;

more on "Proof methods"; more examples; tuned;

examples in Isabelle/HOL; tuned;

more on Proof.theorem;

tuned;

more examples; more on "Proof methods";

more on "Isar language elements";

more examples;

more refs;

misc tuning;

removed some obsolete reference material;

cover some more theory operations;

note on Isabelle file specifications; removed junk;

modernized version of "Message output channels";

removed some really old reference material;

more examples;

various concrete ML antiquotations;

prefer checked antiquotations;

clarified tag markup;

more on ML antiquotations; tuned;

keep normal size for %mlref tag;

basic setup for ML antiquotations -- with rail diagrams; tuned;

eliminated "Toplevel control", which belongs to TTY/ProofGeneral model;

eliminated fancy \ML logo for the sake of simpler source text (less dependence on LaTeX); eliminated Isar toplevel invocation functions, which belong to TTY/ProofGeneral model; moved remaining "ML toplevel" material to "Compile-time context";

misc tuning;

more on Isabelle/ML;

basic setup for Chapter 0: Isabelle/ML;

minor tuning and updating;

made SML/NJ happy;

merged

use module integer for Eval