2009-03-16 wenzelm 2009-03-16 simplified method setup;
2009-03-13 wenzelm 2009-03-13 unified type Proof.method and pervasive METHOD combinators;
2007-08-01 wenzelm 2007-08-01 tuned ML bindings (for multithreading);
2007-07-21 wenzelm 2007-07-21 tactics: avoid dynamic reference to accidental theory context (via ML_Context.the_context etc.);
2007-06-11 chaieb 2007-06-11 tuned Proof
2006-12-01 haftmann 2006-12-01 stripped some legacy bindings
2006-11-29 wenzelm 2006-11-29 simplified method setup;
2006-11-17 wenzelm 2006-11-17 more robust syntax for definition/abbreviation/notation;
2006-09-28 wenzelm 2006-09-28 replaced syntax/translations by abbreviation;
2006-07-08 wenzelm 2006-07-08 tactic/method simpset: maintain proper context;
2006-01-23 paulson 2006-01-23 replacement of bool by a datatype (making problems first-order). More lemma names
2006-01-04 paulson 2006-01-04 a few more named lemmas
2005-10-26 paulson 2005-10-26 tidied away duplicate thm
2005-06-17 haftmann 2005-06-17 migrated theory headers to new format
2005-03-22 paulson 2005-03-22 deleted a pointless comment
2004-07-11 wenzelm 2004-07-11 local_cla/simpset_of;
2003-11-18 paulson 2003-11-18 fixed a comment
2003-09-26 paulson 2003-09-26 Conversion of all main protocols from "Shared" to "Public". Removal of Key_supply_ax: modifications to possibility theorems. Improved presentation.
2003-09-23 paulson 2003-09-23 Removal of the Key_supply axiom (affects many possbility proofs) and minor changes
2003-07-25 paulson 2003-07-25 Simplified a proof using presburger
2003-07-24 paulson 2003-07-24 Tidying and replacement of some axioms by specifications
2003-05-05 paulson 2003-05-05 improved presentation of HOL/Auth theories
2003-04-29 paulson 2003-04-29 tweaks
2003-04-26 paulson 2003-04-26 converting more HOL-Auth to new-style theories
2003-04-25 paulson 2003-04-25 Changes required by the certified email protocol Public-key model now provides separate signature/encryption keys and also long-term symmetric keys.
2001-05-08 paulson 2001-05-08 conversion of Auth/TLS to Isar script
2001-04-27 paulson 2001-04-27 better treatment of methods: uses Method.ctxt_args to refer to current simpset and claset. Needed to fix problems with Recur.thy
2001-02-13 paulson 2001-02-13 partial conversion to Isar script style simplified unicity proofs
2001-01-09 nipkow 2001-01-09 `` -> ` and ``` -> ``
1998-07-24 berghofe 1998-07-24 Adapted to new datatype package.
1997-09-18 paulson 1997-09-18 Global change: lost->bad and sees Spy->spies First change just gives a more sensible name. Second change eliminates the agent parameter of "sees" to simplify definitions and theorems
1997-07-14 paulson 1997-07-14 Changing "lost" from a parameter of protocol definitions to a constant. Advantages: no "lost" argument everywhere; fewer Vars in subgoals; less need for specially instantiated rules Disadvantage: can no longer prove "Agent_not_see_encrypted_key", but this theorem was never used, and its original proof was also broken the introduction of the "Notes" constructor.
1997-07-11 paulson 1997-07-11 Moving common declarations and proofs from theories "Shared" and "Public" to "Event". NB the original "Event" theory was later renamed "Shared". Addition of the Notes constructor to datatype "event".
1997-07-01 paulson 1997-07-01 Removal of the obsolete newN function
1997-01-09 paulson 1997-01-09 New treatment of nonce creation
1996-12-19 paulson 1996-12-19 Extensive tidying and simplification, largely stemming from changing newN and newK to take an integer argument
1996-12-05 paulson 1996-12-05 Public-key examples