src/HOL/Tools/res_hol_clause.ML
Sun, 01 Mar 2009 23:36:12 +0100 wenzelm use long names for old-style fold combinators;
Fri, 27 Feb 2009 19:19:39 +0100 wenzelm turned "read-only refs" typ_level and minimize_applies into constant values;
Thu, 26 Feb 2009 10:13:43 +0100 immler removed global ref dfg_format
Wed, 25 Feb 2009 10:02:10 +0100 immler removed local ref const_needs_hBOOL;
Tue, 24 Feb 2009 18:06:36 +0100 immler removed local ref const_min_arity
Tue, 18 Nov 2008 11:26:59 +0100 wenzelm changes by Fabian Immler:
Thu, 12 Jun 2008 23:12:54 +0200 wenzelm use regular error function;
Thu, 12 Jun 2008 18:54:29 +0200 wenzelm ResAxioms.cnf_axiom/cnf_rules_pairs: pass explicit theory context;
Tue, 30 Oct 2007 15:28:53 +0100 paulson bugfixes concerning strange theorems
Fri, 12 Oct 2007 15:46:29 +0200 paulson preventing eta-redexes in theorems from causing failure
Wed, 10 Oct 2007 15:05:42 +0200 paulson removed dead code
Wed, 10 Oct 2007 10:50:11 +0200 paulson getting rid of type typ_var
Tue, 09 Oct 2007 18:14:00 +0200 paulson context-based treatment of generalization; also handling TFrees in axiom clauses
Tue, 21 Aug 2007 18:27:14 +0200 paulson Deleted the partially-typed translation and the combinator code.
Sat, 18 Aug 2007 13:32:25 +0200 wenzelm removed stateful init: operations take proper theory argument;
Fri, 17 Aug 2007 23:10:42 +0200 wenzelm proper signature;
Fri, 10 Aug 2007 15:13:18 +0200 paulson removal of some refs
Thu, 14 Jun 2007 13:18:59 +0200 paulson Now also handles FO problems
Mon, 07 May 2007 16:46:42 +0200 paulson First-order variant of the fully-typed translation
Mon, 30 Apr 2007 13:22:35 +0200 paulson Fixing bugs in the partial-typed and fully-typed translations
Sat, 20 Jan 2007 14:09:14 +0100 wenzelm Output.debug: non-strict;
Wed, 17 Jan 2007 09:52:06 +0100 paulson Streamlining: removing the type argument of CombApp; abbreviating ResClause as RC
Sun, 14 Jan 2007 09:57:29 +0100 paulson optimized translation of HO problems
Fri, 15 Dec 2006 00:08:06 +0100 wenzelm avoid conflict with Alice keywords: renamed pack -> implode, unpack -> explode, any -> many, avoided assert;
Fri, 01 Dec 2006 12:23:53 +0100 paulson Deleted dead code
Tue, 28 Nov 2006 16:19:01 +0100 paulson Removed the references for counting combinators. Instead they are counted in actual clauses.
Mon, 27 Nov 2006 18:18:25 +0100 paulson Tidied code. Bool constructor is not needed.
Fri, 24 Nov 2006 16:38:42 +0100 paulson Conversion of "equal" to "=" for TSTP format; big tidy-up
Fri, 24 Nov 2006 13:24:30 +0100 paulson ATP linkup now generates "new TPTP" rather than "old TPTP"
Wed, 22 Nov 2006 20:08:07 +0100 paulson Consolidation of code to "blacklist" unhelpful theorems, including record
Thu, 16 Nov 2006 17:06:24 +0100 paulson Includes type:sort constraints in its code to collect predicates in axiom clauses.
Wed, 08 Nov 2006 21:45:15 +0100 wenzelm incorporated former theories Reconstruction and ResAtpMethods into ATP_Linkup;
Wed, 01 Nov 2006 15:49:43 +0100 paulson Numerous cosmetic changes.
Mon, 30 Oct 2006 16:42:46 +0100 paulson Purely cosmetic
Thu, 12 Oct 2006 15:50:43 +0200 paulson Extended combinators now disabled
Tue, 10 Oct 2006 15:30:48 +0200 paulson Combinators require the theory name; added settings for SPASS
Thu, 05 Oct 2006 13:54:17 +0200 mengj Changed and removed some functions related to combinators, since they are Isabelle constants now.
Thu, 05 Oct 2006 10:46:26 +0200 paulson Now the DFG output includes correct declarations of c_fequal, but not hEXTENT
Sat, 30 Sep 2006 14:32:36 +0200 mengj Combinator axioms are now from Isabelle theorems, no need to use helper files.
Thu, 21 Sep 2006 17:31:10 +0200 paulson corrected for the translation from _ to __ in c_COMBx_e
Wed, 20 Sep 2006 13:54:03 +0200 mengj Introduced combinators B', C' and S'.
Mon, 28 Aug 2006 18:15:32 +0200 paulson tidied
Tue, 08 Aug 2006 18:40:04 +0200 paulson tidying
Wed, 02 Aug 2006 13:48:21 +0200 mengj Only ignore too general axiom clauses, if the translation is partial- or constant-typed.
Tue, 01 Aug 2006 13:44:05 +0200 mengj Added in code to check too general axiom clauses.
Sat, 15 Jul 2006 13:50:26 +0200 mengj Only include combinators if required by goals and user specified lemmas.
Thu, 13 Jul 2006 17:39:56 +0200 paulson "conjecture" must be lower case
Thu, 06 Jul 2006 12:18:17 +0200 paulson some tidying; fixed the output of theorem names
Wed, 05 Jul 2006 14:22:09 +0200 mengj Literals aren't sorted any more.
Thu, 29 Jun 2006 18:11:15 +0200 paulson added the "th" field to datatype Clause
Mon, 29 May 2006 17:38:02 +0200 paulson warnings to debug outputs; default translation to const-typed
Thu, 25 May 2006 14:08:55 +0200 mengj Changed the DFG format's functions' declaration procedure.
Thu, 25 May 2006 11:53:01 +0200 mengj Fixed a bug.
Thu, 25 May 2006 08:09:10 +0200 mengj HOL problems now have DFG output format.
Fri, 28 Apr 2006 05:59:32 +0200 mengj changed the functions for getting HOL helper clauses.
Sat, 22 Apr 2006 06:06:39 +0200 mengj Changed the treatment of equalities.
Tue, 18 Apr 2006 05:38:18 +0200 mengj Take conjectures and axioms as thms when convert them to ResHolClause.clause format.
Fri, 07 Apr 2006 05:12:51 +0200 mengj tptp_write_file accepts axioms as thm.
Tue, 07 Mar 2006 03:59:48 +0100 mengj Added tptp_write_file to write all necessary ATP input clauses to one file.
Thu, 23 Feb 2006 13:00:18 +0100 mengj Default type level is T_FULL now.
less more (0) -60 tip