haftmann [Wed, 06 May 2009 16:01:06 +0200] rev 31049
explicit type arguments in constants
haftmann [Wed, 06 May 2009 16:01:06 +0200] rev 31048
refined HOL string theories and corresponding ML fragments
haftmann [Wed, 06 May 2009 16:01:05 +0200] rev 31047
tuned description of overloading
haftmann [Wed, 06 May 2009 16:01:05 +0200] rev 31046
confine term setup to Eval serialiser
haftmann [Wed, 06 May 2009 16:01:05 +0200] rev 31045
updated generated file
nipkow [Wed, 06 May 2009 19:15:40 +0200] rev 31044
new lemmas
nipkow [Wed, 06 May 2009 09:58:24 +0200] rev 31043
merged
Timothy Bourke [Wed, 06 May 2009 10:55:47 +1000] rev 31042
Prototype introiff option for find_theorems.
This feature was suggested by Jeremy Avigad / Tobias Nipkow.
It adds an introiff keyword for find_theorems that returns, in
addition to the usual results for intro, any theorems of the
form ([| ... |] ==> (P = Q)) where either P or Q matches the
conclusions of the current goal. Such theorems can be made
introduction rules with [THEN iffDx].
The current patch is for evaluation only. It assumes an
(op = : 'a -> 'a -> bool) operator, which is specific to HOL.
It is not clear how this should be generalised.
huffman [Wed, 06 May 2009 00:57:29 -0700] rev 31041
replace cont2cont_apply with cont_apply; add new cont2cont lemmas
haftmann [Wed, 06 May 2009 09:08:47 +0200] rev 31040
compatible with preorder; bot and top instances