Fri, 20 Apr 2007 11:21:37 +0200 transfer_tac accepts also HOL equations as theorems
haftmann [Fri, 20 Apr 2007 11:21:37 +0200] rev 22739
transfer_tac accepts also HOL equations as theorems
Fri, 20 Apr 2007 11:21:36 +0200 shifted min/max to class order
haftmann [Fri, 20 Apr 2007 11:21:36 +0200] rev 22738
shifted min/max to class order
Fri, 20 Apr 2007 11:21:35 +0200 tuned
haftmann [Fri, 20 Apr 2007 11:21:35 +0200] rev 22737
tuned
Fri, 20 Apr 2007 11:21:34 +0200 added class tutorial
haftmann [Fri, 20 Apr 2007 11:21:34 +0200] rev 22736
added class tutorial
Fri, 20 Apr 2007 11:21:33 +0200 code generator changes
haftmann [Fri, 20 Apr 2007 11:21:33 +0200] rev 22735
code generator changes
Fri, 20 Apr 2007 10:09:32 +0200 generate page labels
krauss [Fri, 20 Apr 2007 10:09:32 +0200] rev 22734
generate page labels
Fri, 20 Apr 2007 10:06:11 +0200 definition lookup via terms, not names. Methods "relation" and "lexicographic_order"
krauss [Fri, 20 Apr 2007 10:06:11 +0200] rev 22733
definition lookup via terms, not names. Methods "relation" and "lexicographic_order" do not depend on "termination" setup.
Fri, 20 Apr 2007 00:28:07 +0200 declared lemmas true_eqvt and false_eqvt to be equivariant (suggested by samth at ccs.neu.edu)
urbanc [Fri, 20 Apr 2007 00:28:07 +0200] rev 22732
declared lemmas true_eqvt and false_eqvt to be equivariant (suggested by samth at ccs.neu.edu)
Thu, 19 Apr 2007 18:23:11 +0200 trying to make single-step proofs work better, especially if they contain
paulson [Thu, 19 Apr 2007 18:23:11 +0200] rev 22731
trying to make single-step proofs work better, especially if they contain abstraction functions. Uniform names for Skolem and Abstraction functions
Thu, 19 Apr 2007 16:38:59 +0200 nominal_inductive no longer proves equivariance.
berghofe [Thu, 19 Apr 2007 16:38:59 +0200] rev 22730
nominal_inductive no longer proves equivariance.
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip