src/Pure/sorts.ML
Mon, 09 Mar 2020 11:52:28 +0100 wenzelm tuned signature;
Mon, 17 Feb 2020 20:35:04 +0100 wenzelm proper sort constraints for strip_shyps, for sort relations used in minimization;
Sat, 26 May 2018 22:02:25 +0200 wenzelm export sort algebra;
Tue, 08 Mar 2016 21:07:47 +0100 haftmann provide explicit hint concering uniqueness of derivation
Fri, 25 Sep 2015 19:23:17 +0200 wenzelm tuned;
Fri, 25 Sep 2015 19:13:47 +0200 wenzelm tuned signature: eliminated pointless type Context.pretty;
Mon, 16 Jul 2012 21:20:56 +0200 wenzelm more direct Sorts.has_instance;
Sun, 18 Mar 2012 13:04:22 +0100 wenzelm maintain generic context naming in structure Name_Space (NB: empty = default_naming, init = local_naming);
Thu, 23 Feb 2012 15:49:40 +0100 wenzelm clarified Graph.restrict (formerly Graph.subgraph) based on public graph operations;
Sun, 20 Nov 2011 15:21:22 +0100 wenzelm clarified certify vs. sharing;
Sat, 20 Aug 2011 23:35:30 +0200 wenzelm refined Graph implementation: more abstract/scalable Graph.Keys instead of plain lists -- order of adjacency is now standardized wrt. Key.ord;
Wed, 13 Jul 2011 16:42:14 +0200 wenzelm Table.lookup_key and Graph.get_entry allow to retrieve the original key, which is not necessarily identical to the given one;
Mon, 18 Apr 2011 13:26:39 +0200 wenzelm pass plain Proof.context for pretty printing;
Mon, 18 Apr 2011 12:04:21 +0200 wenzelm simplified Sorts.class_error: plain Proof.context;
Mon, 18 Apr 2011 11:13:29 +0200 wenzelm simplified pretty printing context, which is only required for certain kernel operations;
Fri, 24 Sep 2010 15:53:13 +0200 wenzelm modernized structure Ord_List;
Wed, 01 Sep 2010 15:33:59 +0200 haftmann replaced Table.map' by Table.map
Tue, 01 Jun 2010 22:19:17 +0200 wenzelm arities: no need to maintain original codomain (cf. f795c1164708) -- completion happens in axclass.ML;
Tue, 27 Apr 2010 21:46:10 +0200 wenzelm monotonic sort certification: sorts are no longer minimized at the kernel boundary, only when reading input from the end-user;
Sun, 25 Apr 2010 21:18:04 +0200 wenzelm replaced Sorts.rep_algebra by slightly more abstract selectors classes_of/arities_of;
Sun, 11 Apr 2010 14:06:35 +0200 wenzelm modernized datatype constructors;
Sun, 11 Apr 2010 14:04:10 +0200 wenzelm of_sort_derivation: weaken bypasses derivation for identical sort -- accomodate proof terms by krauss/schropp, for example;
Sun, 11 Apr 2010 13:13:23 +0200 wenzelm tuned;
Sun, 11 Apr 2010 13:08:14 +0200 wenzelm of_sort_derivation: pass-through full type information -- following the version by krauss/schropp;
Fri, 26 Mar 2010 20:28:15 +0100 wenzelm more efficient merge_algebra for important special cases -- tricky due to required completion if class algebra changes;
Thu, 25 Mar 2010 21:27:04 +0100 wenzelm Sorts.of_sort_derivation: do not use slow Graph.irreducible_paths here, which not always needed (SUBTLE CHANGE IN SEMANTICS);
Sat, 27 Feb 2010 23:13:01 +0100 wenzelm modernized structure Term_Ord;
Tue, 20 Oct 2009 16:13:01 +0200 haftmann replaced old_style infixes eq_set, subset, union, inter and variants by generic versions
Wed, 30 Sep 2009 22:53:33 +0200 wenzelm removed dead code;
Mon, 06 Jul 2009 22:41:00 +0200 wenzelm witness_sorts: proper type witnesses for hyps, not invented "'hyp" variables;
less more (0) -50 -30 tip