| Mon, 17 Dec 2001 14:23:10 +0100 |
nipkow |
mods due to mor powerful simprocs for 1-point rules (quantifier1).
|
file |
diff |
annotate
|
| Thu, 29 Mar 2001 13:59:54 +0200 |
nipkow |
generalization of 1 point rules for ALL
|
file |
diff |
annotate
|
| Tue, 07 Sep 1999 10:40:58 +0200 |
wenzelm |
isatool expandshort;
|
file |
diff |
annotate
|
| Mon, 23 Aug 1999 15:30:26 +0200 |
wenzelm |
isatool expandshort;
|
file |
diff |
annotate
|
| Thu, 29 Apr 1999 18:34:30 +0200 |
nipkow |
Proof mods due to eta contraction during rewriting.
|
file |
diff |
annotate
|
| Tue, 19 Jan 1999 11:18:11 +0100 |
paulson |
removal of the (thm list) argument of mk_cases
|
file |
diff |
annotate
|
| Sat, 09 Jan 1999 15:24:11 +0100 |
nipkow |
Refined arith tactic.
|
file |
diff |
annotate
|
| Fri, 16 Oct 1998 17:32:29 +0200 |
nipkow |
Mods because of: Installed trans_tac in solver of simpset().
|
file |
diff |
annotate
|
| Thu, 20 Aug 1998 16:18:39 +0200 |
paulson |
Must remove less_imp_le from simpset
|
file |
diff |
annotate
|
| Fri, 24 Jul 1998 13:19:38 +0200 |
berghofe |
Adapted to new datatype package.
|
file |
diff |
annotate
|
| Fri, 03 Jul 1998 10:37:04 +0200 |
nipkow |
Removed leading !! in goals.
|
file |
diff |
annotate
|
| Mon, 22 Jun 1998 17:26:46 +0200 |
wenzelm |
isatool fixgoal;
|
file |
diff |
annotate
|
| Tue, 10 Mar 1998 20:24:28 +0100 |
nipkow |
Mod because of new simplifier.
|
file |
diff |
annotate
|
| Sat, 07 Mar 1998 16:29:29 +0100 |
nipkow |
Removed `addsplits [expand_if]'
|
file |
diff |
annotate
|
| Tue, 30 Dec 1997 11:14:09 +0100 |
nipkow |
nth -> !
|
file |
diff |
annotate
|
| Tue, 16 Dec 1997 17:58:03 +0100 |
wenzelm |
expandshort;
|
file |
diff |
annotate
|
| Fri, 05 Dec 1997 17:14:36 +0100 |
wenzelm |
adapted proofs to cope with simprocs nat_cancel (by Stefan Berghofer);
|
file |
diff |
annotate
|
| Mon, 03 Nov 1997 12:13:18 +0100 |
wenzelm |
isatool fixclasimp;
|
file |
diff |
annotate
|
| Mon, 03 Nov 1997 09:58:06 +0100 |
nipkow |
expand_option_bind -> split_option_bind
|
file |
diff |
annotate
|
| Thu, 30 Oct 1997 09:46:11 +0100 |
nipkow |
Updated proofs
|
file |
diff |
annotate
|
| Fri, 17 Oct 1997 15:25:12 +0200 |
nipkow |
setloop split_tac -> addsplits
|
file |
diff |
annotate
|
| Fri, 10 Oct 1997 19:02:28 +0200 |
wenzelm |
fixed dots;
|
file |
diff |
annotate
|
| Tue, 20 May 1997 11:41:56 +0200 |
paulson |
New arithmetic laws let us delete three lines of a proof
|
file |
diff |
annotate
|
| Thu, 15 May 1997 15:51:47 +0200 |
oheimb |
renamed unsafe_addss to addss
|
file |
diff |
annotate
|
| Wed, 23 Apr 1997 11:02:19 +0200 |
paulson |
Ran expandshort
|
file |
diff |
annotate
|
| Tue, 22 Apr 1997 11:45:22 +0200 |
paulson |
Ran expandshort
|
file |
diff |
annotate
|
| Fri, 14 Mar 1997 10:37:01 +0100 |
nipkow |
Modified proofs because simplifier does not eta-contract any longer.
|
file |
diff |
annotate
|
| Mon, 10 Mar 1997 10:32:32 +0100 |
paulson |
The contr_tac, which replaces a fast_tac, is needed only because eq_assume_tac
|
file |
diff |
annotate
|
| Fri, 07 Mar 1997 10:21:11 +0100 |
paulson |
Deleted steps made redundant by the stronger eq_assume_tac
|
file |
diff |
annotate
|
| Sat, 15 Feb 1997 17:52:31 +0100 |
oheimb |
reflecting my recent changes of the simplifier and classical reasoner
|
file |
diff |
annotate
|
| Fri, 14 Feb 1997 16:01:43 +0100 |
narasche |
Some lemmas changed to valuesd
|
file |
diff |
annotate
|
| Fri, 17 Jan 1997 18:50:04 +0100 |
nipkow |
The new version of MiniML including "let".
|
file |
diff |
annotate
|
| Fri, 17 Jan 1997 11:09:19 +0100 |
paulson |
New miniscoping rules for the bounded quantifiers and UN/INT operators
|
file |
diff |
annotate
|
| Thu, 10 Oct 1996 10:47:26 +0200 |
paulson |
Tidied some proofs: changed needed for de Morgan laws
|
file |
diff |
annotate
|
| Mon, 07 Oct 1996 10:34:58 +0200 |
paulson |
Tidied up some proofs
|
file |
diff |
annotate
|
| Thu, 26 Sep 1996 12:47:47 +0200 |
paulson |
Ran expandshort
|
file |
diff |
annotate
|
| Thu, 05 Sep 1996 10:29:20 +0200 |
paulson |
Miniscoping rules are deleted, as these brittle proofs
|
file |
diff |
annotate
|
| Tue, 20 Aug 1996 12:32:16 +0200 |
paulson |
Some tidying. This brittle proof depends upon
|
file |
diff |
annotate
|
| Mon, 19 Aug 1996 11:17:20 +0200 |
paulson |
Tidied some proofs, maybe using less_SucE
|
file |
diff |
annotate
|
| Thu, 20 Jun 1996 10:27:29 +0200 |
paulson |
Restored Addsimps [Suc_le_lessD], as it cannot be added
|
file |
diff |
annotate
|
| Mon, 22 Apr 1996 15:42:20 +0200 |
nipkow |
inserted Suc_less_eq explictly in a few proofs.
|
file |
diff |
annotate
|
| Wed, 28 Feb 1996 16:57:14 +0100 |
nipkow |
modified priorities in syntax
|
file |
diff |
annotate
|
| Fri, 09 Feb 1996 13:41:59 +0100 |
nipkow |
Introduced qed_spec_mp.
|
file |
diff |
annotate
|
| Tue, 30 Jan 1996 15:24:36 +0100 |
clasohm |
expanded tabs
|
file |
diff |
annotate
|
| Fri, 08 Dec 1995 19:48:15 +0100 |
nipkow |
Introduced Monad syntax Pat := Val; Cont
|
file |
diff |
annotate
|
| Wed, 25 Oct 1995 09:46:46 +0100 |
nipkow |
New theory: type inference for let-free MiniML
|
file |
diff |
annotate
|