| Thu, 09 Jun 2011 15:37:37 +0200 |
wenzelm |
more tight name invention -- avoiding old functions;
|
changeset |
files
|
| Thu, 09 Jun 2011 11:26:25 +0200 |
wenzelm |
\frenchspacing for formal isabelle style avoids extra space in situations like ``@{text "?"}'' followed by plain text;
|
changeset |
files
|
| Thu, 09 Jun 2011 10:59:25 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Thu, 09 Jun 2011 10:43:42 +0200 |
bulwahn |
NEWS
|
changeset |
files
|
| Thu, 09 Jun 2011 10:19:51 +0200 |
bulwahn |
correcting import theory of examples
|
changeset |
files
|
| Thu, 09 Jun 2011 09:07:13 +0200 |
bulwahn |
fixing code generation test
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:22 +0200 |
bulwahn |
removing char setup
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:21 +0200 |
bulwahn |
removing unneccessary manual instantiations and dead definitions; hiding more constants and facts
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:19 +0200 |
bulwahn |
adding a nicer error message for quickcheck_narrowing; hiding fact empty_def
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:18 +0200 |
bulwahn |
adding narrowing engine for existentials
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:18 +0200 |
bulwahn |
adapting Quickcheck_Narrowing: adding setup for characters; correcting import statement
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:16 +0200 |
bulwahn |
adding theory Quickcheck_Narrowing to HOL-Main image
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:15 +0200 |
bulwahn |
adapting IsaMakefile
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:14 +0200 |
bulwahn |
moving Quickcheck_Narrowing from Library to base directory
|
changeset |
files
|
| Thu, 09 Jun 2011 08:32:13 +0200 |
bulwahn |
compilation of Haskell in its own target for Quickcheck; passing options by arguments in Narrowing_Generators
|
changeset |
files
|
| Thu, 09 Jun 2011 08:31:41 +0200 |
bulwahn |
local simp rule in List_Cset
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
tuning
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
compile
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
cleaner fact freshening, which also works in corner cases, e.g. if two backquoted facts have the same name (but have different variable indices)
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
added a really fully typed translation as a fallback for Metis, in rare cases where Metis correctly proves a theorem but has type-unsound steps in it (which is likelier to happen with some of the lighter translations)
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
improve sort inference in Metis proofs -- in some rare cases Metis steals Isabelle's variable names and the sorts must then be inferred as well
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
removed needless function that duplicated standard functionality, with a little unnecessary twist
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
removed more dead code
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
be a bit more liberal with respect to the universal sort -- it sometimes help
|
changeset |
files
|
| Thu, 09 Jun 2011 00:16:28 +0200 |
blanchet |
renamed "untyped_aconv" to distinguish it clearly from the standard "aconv_untyped"
|
changeset |
files
|
| Wed, 08 Jun 2011 22:13:49 +0200 |
wenzelm |
merged
|
changeset |
files
|
| Wed, 08 Jun 2011 17:01:07 +0200 |
blanchet |
avoid duplicate facts, which confuse the minimizer output
|
changeset |
files
|
| Wed, 08 Jun 2011 16:20:19 +0200 |
blanchet |
pass Metis facts and negated conjecture as facts, with (almost) correctly set localities, so that the correct encoding is used for nonmonotonic occurrences of infinite types
|
changeset |
files
|
| Wed, 08 Jun 2011 16:20:18 +0200 |
blanchet |
restore comment about subtle issue
|
changeset |
files
|
| Wed, 08 Jun 2011 16:20:18 +0200 |
blanchet |
made "query" type systes a bit more sound -- local facts, e.g. the negated conjecture, may make invalid the infinity check, e.g. if we are proving that there exists two values of an infinite type, we can use the negated conjecture that there is only one value to derive unsound proofs unless the type is properly encoded
|
changeset |
files
|