Increasing the default limits in order to prevent unnecessary failures.

send: broadcast condition while locked!

proper signature constraint;

tuned Mailbox.send;

removed unused sync_interrupts;

moved thread data to future.ML (again); dequeue: include group; more interrupt operations; misc tuning;

more interrupt operations; maintain thread data (formerly in task_queue.ML); wait: added tracing; added requests mailbox; handle excessive workers fork: inherit group; added rudimentary shutdown; misc tuning;

moved task, thread_data, group, queue to task_queue.ML; tuned signature; SYNCHRONIZED notify_all! misc tuning;

Ordered queue of grouped tasks. formerly in future.ML; added thread data; added group; more robust dequeue: change into running here; misc tuning;

added Concurrent/task_queue.ML;

await: SYNCHRONIZED wait!

tuned check_cache; removed broken self_synchronized, which cannot be used in conjunction with condition variables; more precise use of SYNCHRONIZED vs. wait; tuned worker_loop;

added sync_interrupts, regular_interrupts; max_thread_value: enforce >= 1;

added sync_interrupts, regular_interrupts;

opaque signature constraint abstracts local type abbrev;

tuned;

added change_result;

Functional threads as future values.

added Concurrent/future.ML;

Default (mostly dummy) implementation of thread structures. formerly in multithreading.ML; create mutexes / condition variables without failure;

*** MESSAGE REFERS TO PREVIOUS VERSION *** removed dummy thread structures from multithreading.ML;

*** empty log message ***

explicit use of universal.ML and dummy_thread.ML;

added no_interrupts; tuned;

added no_interrupts; moved dummy thread structures to dummy_thread.ML;

tuned;

send: broadcast to all waiting threads;

added ML-Systems/thread_dummy.ML;

dropped "run" marker in monad syntax

multithreading.ML provides dummy thread structures;

different bookkeeping for code equations

renamed structure CodeTarget to Code_Target

instances comm_semiring_0_cancel < comm_semiring_0, comm_ring < comm_semiring_0_cancel

proper header;

added receive_timeout; tuned comments;

check WRAPPER_OUTPUT node type;

init: disallow "" as out stream;

fixed deps: no Concurrent/receiver.ML yet;

Concurrent message exchange via mailbox -- with unbounded queueing.

added Concurrent/mailbox.ML;

reorganize subsections

rename INF_drop_prefix to INFM_drop_prefix

add lemma power_Suc2; generalize power_minus from class comm_ring_1 to ring_1

move diff_add_cancel, add_diff_cancel from class ab_group_add to group_add

tuned signature;

added General/queue.ML;

Efficient queues.

moved Multithreading.task/schedule to Concurrent/schedule.ML

multithreading.ML provides dummy thread structures;

moved Multithreading.task/schedule to Concurrent/schedule.ML;

provide dummy thread structures, including proper Thread.getLocal/setLocal; moved task/schedule to Concurrent/schedule.ML;

Thread.getLocal/setLocal;

Scheduling -- multiple threads working on a queue of tasks. formerly in ML-Systems/multithreading_polyml.ML; simplified -- less tracing; use regular Isabelle/ML functions instead of NJ stuff;

added Concurrent/schedule.ML;

update tags

use /home/isabelle/mercurial/bin/hg wrapper;

exclude large .mov files;

simplified add_axiom: no hyps;

discontinued local axioms -- too difficult to implement, too easy to produce nonsense;

axiomatization is now global-only;

added const_decl;

simplified specify_const: canonical args, global deps;

declare_const: Name.binding, store/report position;

Sign.declare_const: Name.binding;

removed ex/Puzzle

added qualified: string -> binding -> binding;

Name.qualified;

theorem dependency hook: check previous state;

added pos_of;

-> AFP

simplified Toplevel.add_hook: cover successful transactions only;

retired Ben Porter's DenumRat in favour of the shorter proof in Real/Rational.thy

made SML/NJ happy;

refined theorem dependency output: previous state needs to contain a theory (not empty toplevel); new_thms_deps: explicity theory values;

* 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;