more frugal access to theory text via Reader, reduced costs for I/O text decoding; prefer non-strict Symbol.decode, since Reader[Char] may present symbols in either way;

support URLs as well;

reclaimed Byte_Reader from 51560e392e1b;

new documentation: How to Prove it

disable bad Z3 proof

use SMT2 for Boogie examples

less verbose SAT tactic

use internal proof-producing SAT solver for more efficient SMT proof replay

added internal proof-producing SAT solver

tuned output;

separate ML module

centralized upper/lowercase name mangling

optional case enforcement

obsolete: no symbol identifiers remaining in Pure

prevent subscription in nested contexts explicitly -- at foundational and user level

cleanup

NEWS

use qualified name (was interpreted as a catch-all variable name)

add additional check to avoid selector formula right-hand side consisting of a nullary constructor getting interpreted as a discriminator formula

updated keywords;

clarified signature: load_file is still required internally;

merged

some support for session-qualified theories: allow to refer to resources via qualified name instead of odd file-system path;

support for long names in Scala;

tuned;

Discontinued old spark_open; spark_open_siv is now spark_open

suppress slightly odd completions of "real";

tuned proofs;

tuned proofs;

clarified exit sequence: prover is reset afterwards, no more output messages;