* Generic Toplevel.add_hook interface allows to analyze the result of transactions (including failed ones). For example, see src/Pure/ProofGeneral/proof_general_pgip.ML for theorem dependency output of transactions resulting in a new theory state.

Replaced Library/NatPair by Nat_Int_Bij.

added new_thms_deps (operates on global facts, some name_hint approximation); theorem dependency output: Toplevel.add_hook, ProofGeneralPgip.new_thms_deps;

theorem dependency output: Toplevel.add_hook, ProofGeneralPgip.new_thms_deps;

added add_hook interface for post-transition hooks;

tuned;

ProofDisplay.print_results;

no pervasive bindings; removed theory_results and related hook; print_results: ignore empty/internal kind -- like former theory_results;

Streamlined parts of Complex/ex/DenumRat and AFP/Integration/Rats and distributed them over Real/ (to do with bijections and density). Library/NatPair became Nat_Int_Bij and made that part of Main.

distributed literal code generation out of central infrastructure

* Result facts now refer to the *full* internal name;

* Name bindings in higher specification mechanisms;

pretty_fact/results: display base only, since results now come with full names (note that Facts.extern is not really well-defined unless we present the real target context);

updated generated file;

Interpretation commands no longer accept interpretation attributes.

type Attrib.binding abbreviates Name.binding without attributes; Attrib.no_binding refers to Name.no_binding;

explicit type Name.binding for higher-specification elements;

explicit type Name.binding for higher-specification elements; report local_fact_decl, fixed_decl; simplified ProofContext.inferred_param;

explicit type Name.binding for higher-specification elements; added binding, parbinding;

explicit type Name.binding for higher-specification elements; simplified ProofContext.inferred_param;

explicit type Name.binding for higher-specification elements; name/var morphism operates on Name.binding;

added binding; thm_name/opt_thm_name: Name.binding;

added fixed_decl, fact_decl, local_fact_decl;

name_thm etc.: pass position; note_thms etc.: Name.binding, report fact_decl;

added type binding -- generic name bindings;

name/var morphism operates on Name.binding;

adapted to class instantiation compliance

It appears that the code generator (Stefan's) needs some laws that appear superfluous: {..n} = set ...

renamed lemma

moved more lemmas here from AFP/Integration/Rats

moved lemma into SetInterval where it belongs

cleaned up code generation for {.._} and {..<_} moved lemmas into SetInterval where they belong

*** empty log message ***

extended interface to preferences to allow adding new ones

Prover is set via menu now

restructured code generation of literals

IsabelleSystem.mk_fifo, IsabelleSystem.rm_fifo; IsabelleSystem.exec: varargs convenience; more robust message thread management: no interrupt, but proper rendezvous via fifo (rm_fifo removes unused fifo, if isabelle-process fails);

init: more explicit protocol of open/remove rendezvous;

use hardwired /tmp -- fifo only work on local file-system;

separate module for code output

fixed names of class assumptions

dropped parameter prefix for class theorems

added charset (from isabelle_process.scala); added fifo_reader -- also works on Cygwin;

moved charset to isabelle_system.scala; IsabelleSystem.fifo_reader;

provide HOME_JVM=HOME to prevent implicit cygpath mangling;

restructured and split code serializer module

no parameter prefix for class interpretation

updated