more consistent theorem names

more lemmas about SUP

structuring duals together

merged

more lemmas about Sup

generalized INT_anti_mono

moving UNIV = ... equations to their proper theories

further generalization from sets to complete lattices

fixed lambda-liftg: must ensure the formulas are in close form

ensure that the lambda translation procedure is called only once with all the facts, which is necessary for soundness of lambda-lifting (freshness of new names)

pass kind to lambda-translation function

more refactoring of preprocessing

more refactoring of preprocessing, so as to be able to centralize it

renamed internal data structure

simplify code -- there are no lambdas in helpers anyway

added lambda-lifting to Sledgehammer (rough)

move more lambda-handling logic to Sledgehammer, from ATP module, for formal dependency reasons

merged

generalized some lemmas

consolidated bot and top classes, tuned notation

tuned notation

clarified bash_output_fifo;

moved bash operations to Isabelle_System (cf. Scala version);

access to process output stream via auxiliary fifo;

some file and directory operations;

more general bash_process, which allows to terminate background processes as well;

updated to Poly/ML SVN 1328, which is considered 5.4.2;

added File.fold_pages for streaming of large files; prefer \f notation;

tuned;

HOL/Import: Fix errors with _mk_list

Element.activate: leave check of binding where actually applied to the context -- allow internal qualifications, or non-identifier fact names like "assumes *: A" (see also 1183951365de);

simplified malformed YXML markup -- special controls are visible in IsabelleText font;

less ambitious ProofGeneral markup, which occasionally breaks plain-old regexps in elisp;

more robust Binding.pretty/print in typical error sitations with spaces etc. (NB: markup can only provide *additional* emphasis and is occasionally suppressed in TTY mode or tooltips);

more visible printing of empty binding;

do not check vacous bindings, which routinely occur in locale expressions and long theorem statements etc.;

more quotes;

merged

added missing dependencies; simplified (by overapproximating a bit); alphabetical order

merged

merged

tuned notation and proofs

move error logic closer to user

allow lambda-lifting without triggers

move lambda translation option from ATP to Sledgehammer, to avoid accidentally breaking Metis (its reconstruction code can only deal with combinators)

added option to control which lambda translation to use (for experiments)

fix subtle type inference bug in Metis -- different occurrences of the same Skolem might need to be typed differently, using paramify_vars overconstraints the typing problem

use monomorphic encoding as fallback, since they tend to produce fewer type errors

don't generate Waldmeister problems with only a conjecture, since it makes it crash sometimes

clearer unsound message

clarify fine soundness point

always unfold "Let"s is Sledgehammer, Metis, and MESON

unbreak Nitrox's parsing

merged

tuned lemma positions and proofs

tuned notation

uniqueness lemmas for bot and top

adjusted to tightened specification of classes bot and top

moved lemmas bot_less and less_top to classes bot and top respectively

tightened specification of classes bot and top: uniqueness of top and bot elements

honor the TPTP environment variable as the root of include relative paths -- that's a weird convention but without it Nitrox will fail at CASC

better temp name creation for Nitrox -- still very hackish though, but should get us through CASC-23 and CASC-J6

more exhaustive testing in Nitrox

no timeout for Nitrox

avoid relying on piping to "isabelle tty", because this gives errors on some Linuxes about the standard input not being a tty

added arithmetic decision procedure to CASC setup

added some arithmetic functions, for THF with arithmetic

pull in arithmetic theories

cleanly separate TPTP related files from other examples

increasing timeout to avoid spurious failures

merged

more generalization towards complete lattices

experimental variants of Library/Cset.thy and Library/Dlist_Cset.thy defined via quotient package

merge

Tuned

more precise integer Markup.properties/XML.attributes: disallow ML-style ~ minus;

added term_sharing.ML;

recovered some runtime sharing from d6b6c74a8bcf, without the global memory bottleneck;

sub-structural sharing after Syntax.check phase, with global interning of logical entities (the latter is relevant when bypassing default parsing via YXML); minor tuning;

low-level tuning;

Table.lookup_key and Graph.get_entry allow to retrieve the original key, which is not necessarily identical to the given one; Sorts.certify_class: prefer the persistent name;

XML.pretty with depth limit;

more thorough Variable.check_name: Binding.check for logical entities within the term language;

tuned;

merged

Update HOLLightCompat

Update files generated in HOL/Import/HOLLight

HOL/Import for HOLLight revival: Proper theory headers, update generation scripts to SVN version of HOL Light, add some constant maps and compatibility theorems

ML pp for XML.tree;

made SML/NJ happy;

clarified YXML.detect;

retain some terminology of "XML attributes";

more uniform Properties in ML and Scala;

more uniform Term and Term_XML modules;

more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;

tuned signature -- less cryptic ASCII names;

discontinued obsolete Isabelle_Syntax and Parse_Value -- superseded by Outer_Syntax.quote_string and XML.Encode, Term_XML.Encode etc.;

added Parse.properties (again) -- allow empty list like Parse_Value.properties but unlike Parse.properties of ef86de9c98aa;

added Outer_Syntax.quote_string, which is conceptually a bit different from Token.unparse;

more precise Symbol_Pos.quote_string;

clarified YXML.embed_controls -- this is idempotent and cannot be nested;

allow empty body for raw_message -- important for Invoke_Scala;

Isabelle string syntax allows literal control characters;

glyphs from DejaVu for ASCII control characters 5, 6, 7, 127, which have a special meaning in Isabelle or Poly/ML;

more precise exceptions;

tuned XML modules;

Quotient example: Lists with distinct elements

merged

explicit code equation for equality

tuned error messages;

tuned;

tuned signature -- corresponding to Scala version;

made SML/NJ happy; tuned error;

more uniform padded_markup, which is important for caret visibility despite absence of markup;

merged

merged

tuned proofs

tuned notation

tuned notation

tuned notation