| Sat, 26 Nov 2011 17:10:03 +0100 |
wenzelm |
sharing of token source with span source;
|
changeset |
files
|
| Sat, 26 Nov 2011 14:14:51 +0100 |
wenzelm |
memoing of forked proofs;
|
changeset |
files
|
| Sat, 26 Nov 2011 13:10:12 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Fri, 25 Nov 2011 23:04:12 +0100 |
wenzelm |
removed obsolete argument (cf. 954e9d6782ea);
|
changeset |
files
|
| Fri, 25 Nov 2011 22:21:37 +0100 |
wenzelm |
merged
|
changeset |
files
|
| Fri, 25 Nov 2011 19:07:26 +0100 |
krauss |
removed obsolete uses of Local_Theory.restore -- package composition P1 #> P2 no longer requires them due to 57def0b39696: P2 finds the results of P1 in the auxiliary context
|
changeset |
files
|
| Fri, 25 Nov 2011 12:18:39 +0100 |
nipkow |
merged
|
changeset |
files
|
| Fri, 25 Nov 2011 12:18:33 +0100 |
nipkow |
tuned
|
changeset |
files
|
| Fri, 25 Nov 2011 22:10:51 +0100 |
wenzelm |
increased stack limits (again, cf. d9cf3520083c and 77c3e74bd954);
|
changeset |
files
|
| Fri, 25 Nov 2011 21:29:11 +0100 |
wenzelm |
explicit change_parser thread, which avoids undirected Future.fork with its tendency towards hundreds of worker threads;
|
changeset |
files
|
| Fri, 25 Nov 2011 21:27:16 +0100 |
wenzelm |
tuned proofs;
|
changeset |
files
|
| Fri, 25 Nov 2011 18:37:14 +0100 |
wenzelm |
retain stderr and include it in syslog, which is buffered and thus increases the chance that users see remains from crashes etc.;
|
changeset |
files
|
| Fri, 25 Nov 2011 16:32:29 +0100 |
wenzelm |
prefer Parser.make_gram over Parser.merge_gram, to approximate n-ary merges on theory import;
|
changeset |
files
|
| Fri, 25 Nov 2011 14:23:36 +0100 |
wenzelm |
recovered structural equality from 9d97bd3c086a, otherwise update_perspective might be issued over and over again, canceling a pending/slow execution;
|
changeset |
files
|
| Fri, 25 Nov 2011 13:14:58 +0100 |
wenzelm |
proper intro? declarations -- NB: elim? indexes on major premise, which is too flexible here and easily leads to inefficiences (cf. a0336f8b6558);
|
changeset |
files
|
| Fri, 25 Nov 2011 10:52:30 +0100 |
bulwahn |
improved example to only use quotient_definitions; added lemmas to serve as possible replacement for the existing RBT theory
|
changeset |
files
|
| Fri, 25 Nov 2011 00:18:59 +0000 |
Christian Urban |
in a local context, also the free variable case needs to be analysed default tip
|
changeset |
files
|
| Thu, 24 Nov 2011 21:41:58 +0100 |
wenzelm |
speed-up proof;
|
changeset |
files
|
| Thu, 24 Nov 2011 21:15:20 +0100 |
wenzelm |
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
|
changeset |
files
|
| Thu, 24 Nov 2011 21:01:06 +0100 |
wenzelm |
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
|
changeset |
files
|
| Thu, 24 Nov 2011 20:45:34 +0100 |
wenzelm |
simplified -- empty_ss already contains minimal mksimps;
|
changeset |
files
|
| Thu, 24 Nov 2011 19:58:37 +0100 |
nipkow |
Abstract interpretation is now based uniformly on annotated programs,
|
changeset |
files
|
| Wed, 23 Nov 2011 23:31:32 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Wed, 23 Nov 2011 23:07:59 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Wed, 23 Nov 2011 22:59:39 +0100 |
wenzelm |
modernized some old-style infix operations, which were left over from the time of ML proof scripts;
|
changeset |
files
|
| Wed, 23 Nov 2011 22:07:55 +0100 |
wenzelm |
tuned;
|
changeset |
files
|
| Wed, 23 Nov 2011 13:46:46 +0100 |
wenzelm |
updated according to bdcaa3f3a2f4;
|
changeset |
files
|
| Wed, 23 Nov 2011 13:41:42 +0100 |
wenzelm |
updated proof;
|
changeset |
files
|
| Wed, 23 Nov 2011 07:44:56 +0100 |
nipkow |
tuned
|
changeset |
files
|
| Wed, 23 Nov 2011 07:00:01 +0100 |
huffman |
remove outdated comment
|
changeset |
files
|