wenzelm [Thu, 01 Dec 2005 18:41:46 +0100] rev 18321
replaced lib/scripts/showtime by more advanced lib/scripts/timestart|stop.bash;
berghofe [Thu, 01 Dec 2005 18:41:44 +0100] rev 18320
assoc_consts and assoc_types now check number of arguments in template.
berghofe [Thu, 01 Dec 2005 18:39:08 +0100] rev 18319
Added new component "sorts" to record datatype_info.
wenzelm [Thu, 01 Dec 2005 18:37:39 +0100] rev 18318
timestop - report timing based on environment (cf. timestart.bash);
wenzelm [Thu, 01 Dec 2005 18:37:22 +0100] rev 18317
timestart - setup bash environment for timing;
berghofe [Thu, 01 Dec 2005 17:07:50 +0100] rev 18316
Improved norm_proof to handle proofs containing term (type) variables
with same name but different types (sorts): Offending term (type)
variables are replaced by dummy (T)Frees before applying the
substitution.
paulson [Thu, 01 Dec 2005 15:45:54 +0100] rev 18315
restoring the old status of subset_refl
haftmann [Thu, 01 Dec 2005 08:28:02 +0100] rev 18314
oriented pairs theory * 'a to 'a * theory
urbanc [Thu, 01 Dec 2005 06:28:41 +0100] rev 18313
initial cleanup to use the new induction method
urbanc [Thu, 01 Dec 2005 05:20:13 +0100] rev 18312
cleaned up further the proofs (diamond still needs work);
changed "fresh:" to "avoiding:"
urbanc [Thu, 01 Dec 2005 04:46:17 +0100] rev 18311
changed "fresh:" to "avoiding:" and cleaned up the weakening example
wenzelm [Wed, 30 Nov 2005 22:52:50 +0100] rev 18310
match_bind(_i): return terms;
mk_def: simultaneous defs;
prepare_dummies: produce globally unique indexnames;
wenzelm [Wed, 30 Nov 2005 22:52:49 +0100] rev 18309
method 'fact': SIMPLE_METHOD, i.e. insert facts;
wenzelm [Wed, 30 Nov 2005 22:52:46 +0100] rev 18308
simulaneous 'def';
urbanc [Wed, 30 Nov 2005 21:51:23 +0100] rev 18307
added facilities to prove the pt and fs instances
for discrete types
urbanc [Wed, 30 Nov 2005 19:08:51 +0100] rev 18306
started to change the transitivity/narrowing case:
have trouble with Q=Q.
urbanc [Wed, 30 Nov 2005 18:37:12 +0100] rev 18305
changed everything until the interesting transitivity_narrowing
proof.
haftmann [Wed, 30 Nov 2005 18:13:31 +0100] rev 18304
minor improvements
urbanc [Wed, 30 Nov 2005 17:56:08 +0100] rev 18303
modified almost everything for the new nominal_induct
(at the end there are some "normal" inductions which
need a bit more attention)
berghofe [Wed, 30 Nov 2005 16:59:19 +0100] rev 18302
Changed order of predicate arguments and quantifiers in strong induction rule.
urbanc [Wed, 30 Nov 2005 15:30:08 +0100] rev 18301
fixed the lemma where the new names generated by nominal_induct
caused problems.
urbanc [Wed, 30 Nov 2005 15:27:30 +0100] rev 18300
added one clause for substitution in the lambda-case and
mad it globally [simp]
wenzelm [Wed, 30 Nov 2005 15:24:32 +0100] rev 18299
added rename_params_rule: recover orginal fresh names in subgoals/cases;
urbanc [Wed, 30 Nov 2005 15:03:15 +0100] rev 18298
changed induction principle and everything to conform with the
new nominal_induct
wenzelm [Wed, 30 Nov 2005 14:27:50 +0100] rev 18297
fresh: frees instead of terms, rename corresponding params in rule;
tuned;
urbanc [Wed, 30 Nov 2005 14:27:09 +0100] rev 18296
adapted to the new nominal_induction
urbanc [Wed, 30 Nov 2005 12:28:47 +0100] rev 18295
changed \<sim> of permutation equality to \<triangleq>
(Jesper wanted to use \<sim>).
wenzelm [Wed, 30 Nov 2005 12:23:35 +0100] rev 18294
fresh_unit_elim and fresh_prod_elim -- for nominal_induct;
huffman [Wed, 30 Nov 2005 01:01:15 +0100] rev 18293
reimplement Case expression pattern matching to support lazy patterns
huffman [Wed, 30 Nov 2005 00:59:04 +0100] rev 18292
add definitions as defs, not axioms