src/HOL/Tools/ATP/atp_translate.ML
Sun, 17 Jul 2011 14:11:35 +0200 more refactoring of preprocessing, so as to be able to centralize it
Sun, 17 Jul 2011 14:11:35 +0200 renamed internal data structure
Sun, 17 Jul 2011 14:11:35 +0200 simplify code -- there are no lambdas in helpers anyway
Sun, 17 Jul 2011 14:11:35 +0200 added lambda-lifting to Sledgehammer (rough)
Sun, 17 Jul 2011 14:11:34 +0200 move more lambda-handling logic to Sledgehammer, from ATP module, for formal dependency reasons
Thu, 14 Jul 2011 17:29:30 +0200 move error logic closer to user
Thu, 14 Jul 2011 16:50:05 +0200 move lambda translation option from ATP to Sledgehammer, to avoid accidentally breaking Metis (its reconstruction code can only deal with combinators)
Thu, 14 Jul 2011 16:50:05 +0200 added option to control which lambda translation to use (for experiments)
Wed, 06 Jul 2011 17:19:34 +0100 make SML/NJ happier
Wed, 06 Jul 2011 17:19:34 +0100 make SML/NJ happy + tuning
Tue, 05 Jul 2011 17:09:59 +0100 improved translation of lambdas in THF
Tue, 05 Jul 2011 17:09:59 +0100 added generation of lambdas in THF
Tue, 05 Jul 2011 17:09:59 +0100 add support for lambdas in TPTP THF generator + killed an unsound type encoding (because the monotonicity calculus assumes first-order)
Fri, 01 Jul 2011 15:53:38 +0200 further repair "mangled_tags", now that tags are also mangled
Fri, 01 Jul 2011 15:53:38 +0200 renamed "type_sys" to "type_enc", which is more accurate
Fri, 01 Jul 2011 15:53:37 +0200 cleaner handling of higher-order simple types, so that it's also possible to use first-order simple types with LEO-II and company
Fri, 01 Jul 2011 15:53:37 +0200 mangle "ti" tags
Fri, 01 Jul 2011 15:53:37 +0200 tuning
Mon, 27 Jun 2011 14:56:28 +0200 added "sound" option to force Sledgehammer to be pedantically sound
Tue, 21 Jun 2011 17:17:39 +0200 don't change the way helpers are generated for the exporter's sake
Tue, 21 Jun 2011 17:17:39 +0200 remove historical bloat -- another benefit of merging Metis's and Sledgehammer's translations
Tue, 21 Jun 2011 17:17:39 +0200 avoid double ASCII-fication
Tue, 21 Jun 2011 17:17:39 +0200 generate type predicates for existentials/skolems, otherwise some problems might not be provable
Thu, 16 Jun 2011 13:50:35 +0200 gave up an optimization that sometimes lead to unsound proofs -- in short, facts talking about a schematic type variable can encode a cardinality constraint and be consistent with HOL, e.g. "card (UNIV::?'a set) = 1 ==> ALL x y. x = y"
Thu, 16 Jun 2011 13:50:35 +0200 fixed soundness bug related to extensionality
Wed, 15 Jun 2011 14:36:41 +0200 fixed soundness bug made more visible by previous change
Wed, 15 Jun 2011 14:36:41 +0200 type arguments now (unlike back when fa2cf11d6351 was done) normally carry enough information to reconstruct the type of an applied constant, so no need to constraint the argument types in those cases
Fri, 10 Jun 2011 17:52:09 +0200 name tuning
Fri, 10 Jun 2011 17:52:09 +0200 revived the lightweight "poly_tags_{query,bang}" type encodings by fixing their soundness bug
Thu, 09 Jun 2011 16:34:49 +0200 discontinued Name.variant to emphasize that this is old-style / indirect;
Thu, 09 Jun 2011 00:16:28 +0200 cleaner fact freshening, which also works in corner cases, e.g. if two backquoted facts have the same name (but have different variable indices)
Wed, 08 Jun 2011 22:13:49 +0200 merged
Wed, 08 Jun 2011 17:49:01 +0200 updated headers;
Wed, 08 Jun 2011 15:56:57 +0200 more robust exception pattern General.Subscript;
Wed, 08 Jun 2011 16:20:19 +0200 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
Wed, 08 Jun 2011 16:20:18 +0200 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
Wed, 08 Jun 2011 16:20:18 +0200 fixed format selection logic for Waldmeister
Wed, 08 Jun 2011 08:47:43 +0200 minor optimization
Wed, 08 Jun 2011 08:47:43 +0200 don't needlessly extensionalize
Wed, 08 Jun 2011 08:47:43 +0200 don't needlessly presimplify -- makes ATP problem preparation much faster
Wed, 08 Jun 2011 08:47:43 +0200 tuned
Wed, 08 Jun 2011 08:47:43 +0200 killed "explicit_apply" option in Sledgehammer -- the "smart" default is about as lightweight as "false" and just as complete as "true"
Wed, 08 Jun 2011 08:47:43 +0200 slightly faster/cleaner accumulation of polymorphic consts
Tue, 07 Jun 2011 14:17:35 +0200 more suitable implementation of "schematic_consts_of" for monomorphizer, for ATPs
Tue, 07 Jun 2011 06:58:52 +0200 pass props not thms to ATP translator
Mon, 06 Jun 2011 20:56:06 +0200 removed old optimization that isn't one anyone
Mon, 06 Jun 2011 20:56:06 +0200 generate less type information in polymorphic case
Mon, 06 Jun 2011 20:36:35 +0200 made "explicit_apply"'s smart mode (more) complete
Mon, 06 Jun 2011 20:36:35 +0200 change var name as a workaround for rare issue in Metis's reconstruction code -- namely, "find_var" fails because "X = X" is wrongly mirrorred as "A = A"
Mon, 06 Jun 2011 20:36:35 +0200 make "smart" mode of "explicit_apply" smarter, by also detecting the other kind of higher-order quantification, namely "bool"s
Mon, 06 Jun 2011 20:36:35 +0200 whitespace tuning
Mon, 06 Jun 2011 20:36:35 +0200 fixed type helper indices in new Metis
Mon, 06 Jun 2011 20:36:35 +0200 improved ATP clausifier so it can deal with "x => (y <=> z)"
Mon, 06 Jun 2011 20:36:35 +0200 avoid renumbering hypotheses
Mon, 06 Jun 2011 20:36:35 +0200 tuning
Mon, 06 Jun 2011 20:36:35 +0200 fixed detection of Skolem constants in type construction detection code
Mon, 06 Jun 2011 20:36:35 +0200 also exploit type tag idempotence in lightweight encodings, following a suggestion from Gothenburg
Mon, 06 Jun 2011 20:36:35 +0200 don't stumble on Skolem names
Mon, 06 Jun 2011 20:36:35 +0200 don't merge "hAPP"s even in unsound heavy modes, because "hAPP" then sometimes gets declared with too strict arguments ("ind"), and we lose some proofs
Mon, 06 Jun 2011 20:36:35 +0200 use "" type only in THF and TFF -- might cause strange failures if used in FOF or CNF, depending on how liberal the prover is