src/Tools/Code/code_thingol.ML
Wed, 18 Apr 2012 21:47:26 +0200 tuned name
Wed, 18 Apr 2012 21:11:50 +0200 tuned
Thu, 12 Apr 2012 10:29:45 +0200 generalise case certificates to allow ignored parameters
Sun, 18 Mar 2012 13:04:22 +0100 maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
Fri, 16 Mar 2012 18:20:12 +0100 outer syntax command definitions based on formal command_spec derived from theory header declarations;
Sat, 25 Feb 2012 12:34:56 +0100 discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
Thu, 23 Feb 2012 15:49:40 +0100 clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
Mon, 26 Dec 2011 18:32:43 +0100 dropped disfruitful `constant signatures`
Wed, 19 Oct 2011 09:11:18 +0200 removing dependency of the generic code generator to old code generator functions thyname_of_type and thyname_of_const
Wed, 12 Oct 2011 16:21:07 +0200 discontinued obsolete alias structure ProofContext;
Tue, 20 Sep 2011 09:30:19 +0200 syntactic improvements and tuning names in the code generator due to Florian's code review
Mon, 19 Sep 2011 16:18:23 +0200 adding abstraction layer; more precise function names
Mon, 19 Sep 2011 16:18:21 +0200 adding type annotations more aggressively and redundantly to make code generation more reliable even when special printers for some constants are used
Mon, 19 Sep 2011 16:18:19 +0200 determining the fastype of a case-pattern but ignoring dummy type constructors that were added as markers for type annotations
Mon, 19 Sep 2011 16:18:19 +0200 only annotating constants with sort constraints
Mon, 19 Sep 2011 16:18:18 +0200 also adding type annotations for the dynamic invocation
Fri, 09 Sep 2011 14:43:50 +0200 stating more explicitly our expectation that these two terms have the same term structure
Fri, 09 Sep 2011 12:33:09 +0200 revisiting type annotations for Haskell: necessary type annotations are not inferred on the provided theorems but using the arguments and right hand sides, as these might differ in the case of constants with abstract code types
Wed, 07 Sep 2011 13:51:39 +0200 removing previously used function locally_monomorphic in the code generator
Wed, 07 Sep 2011 13:51:38 +0200 setting const_sorts to false in the type inference of the code generator
Wed, 07 Sep 2011 13:51:36 +0200 removing previous crude approximation to add type annotations to disambiguate types
Wed, 07 Sep 2011 13:51:35 +0200 adding minimalistic implementation for printing the type annotations
Wed, 07 Sep 2011 13:51:34 +0200 adding call to disambiguation annotations
Wed, 07 Sep 2011 13:51:34 +0200 adding type inference for disambiguation annotations in code equation
Wed, 07 Sep 2011 13:51:32 +0200 adding the body type as well to the code generation for constants as it is required for type annotations of constants
Wed, 07 Sep 2011 13:51:30 +0200 changing const type to pass along if typing annotations are necessary for disambigous terms
Sat, 20 Aug 2011 23:35:30 +0200 refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
Thu, 09 Jun 2011 20:22:22 +0200 tuned signature: Name.invent and Name.invent_names;
Thu, 09 Jun 2011 17:51:49 +0200 simplified Name.variant -- discontinued builtin fold_map;
Mon, 30 May 2011 13:58:00 +0200 improving heuristics of type annotations in contravariant positions for the special case with instances of the class partial_term_of
Mon, 18 Apr 2011 12:04:21 +0200 simplified Sorts.class_error: plain Proof.context;
Mon, 18 Apr 2011 11:13:29 +0200 simplified pretty printing context, which is only required for certain kernel operations;
Sat, 16 Apr 2011 16:15:37 +0200 modernized structure Proof_Context;
Sat, 16 Apr 2011 15:25:25 +0200 prefer local name spaces;
Fri, 08 Apr 2011 13:31:16 +0200 explicit structure Syntax_Trans;
Thu, 17 Feb 2011 09:31:29 +0100 added is_IAbs; tuned brackets and comments
Tue, 21 Dec 2010 15:15:55 +0100 proper static closures
Tue, 21 Dec 2010 09:18:29 +0100 canonical handling of theory context argument
Wed, 15 Dec 2010 09:47:12 +0100 simplified evaluation function names
Mon, 13 Dec 2010 22:54:47 +0100 separated dictionary weakning into separate type
Thu, 09 Dec 2010 17:25:43 +0100 dictionary constants must permit explicit weakening of classes;
Wed, 01 Dec 2010 15:03:44 +0100 more direct use of binder_types/body_type;
Fri, 26 Nov 2010 22:33:21 +0100 keep type variable arguments of datatype constructors in bookkeeping
Fri, 26 Nov 2010 12:03:18 +0100 globbing constant expressions use more idiomatic underscore rather than star
Mon, 20 Sep 2010 18:43:18 +0200 Pure equality is a regular cpde operation
Fri, 17 Sep 2010 11:05:53 +0200 proper closures for static evaluation; no need for FIXMEs any longer
Thu, 16 Sep 2010 16:51:34 +0200 separation of static and dynamic thy context
Wed, 15 Sep 2010 15:11:39 +0200 ignore code cache optionally
Tue, 07 Sep 2010 16:05:20 +0200 dropped outdated substitution
Fri, 27 Aug 2010 10:56:46 +0200 formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
Mon, 23 Aug 2010 11:51:32 +0200 preliminary versions of static_eval_conv(_simple)
Mon, 23 Aug 2010 11:09:49 +0200 refined and unified naming convention for dynamic code evaluation techniques
Wed, 21 Jul 2010 15:31:38 +0200 replaced Thy_Info.the_theory by Context.this_theory -- avoid referring to accidental theory loader state;
Fri, 16 Jul 2010 13:57:46 +0200 don't fail gracefully
Thu, 08 Jul 2010 16:19:24 +0200 tuned titles
Mon, 05 Jul 2010 10:39:49 +0200 dropped passed irregular names
Fri, 02 Jul 2010 16:20:56 +0200 reverted to verion from fc27be4c6b1c
Fri, 02 Jul 2010 16:15:49 +0200 traceback for error messages
Wed, 30 Jun 2010 11:38:51 +0200 unfold_fun_n
Thu, 17 Jun 2010 15:59:46 +0200 explicit type variable arguments for constructors