| Sat, 03 Aug 2019 16:10:34 +0200 |
wenzelm |
more complete completions according to Sorts.insert_complete_ars (cf. 13199740ced6), e.g. relevant for theories HOL-ex.Word_Type, HOL-Matrix_LP.SparseMatrix;
|
changeset |
files
|
| Sat, 03 Aug 2019 15:48:28 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Sat, 03 Aug 2019 15:05:53 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Sat, 03 Aug 2019 12:58:53 +0200 |
wenzelm |
maintain sort constraints from type instantiations, with pro-forma derivation to collect oracles/thms;
|
changeset |
files
|
| Fri, 02 Aug 2019 14:14:49 +0200 |
wenzelm |
more direct proofs for type classes;
|
changeset |
files
|
| Fri, 02 Aug 2019 11:43:36 +0200 |
wenzelm |
tuned;
|
changeset |
files
|
| Fri, 02 Aug 2019 11:23:09 +0200 |
wenzelm |
clarified modules: inference kernel maintains sort algebra within the logic;
|
changeset |
files
|
| Thu, 01 Aug 2019 14:46:50 +0200 |
wenzelm |
more elementary treatment of standard_vars (unconstrainT is already standard);
|
changeset |
files
|
| Thu, 01 Aug 2019 10:14:58 +0200 |
wenzelm |
clarified module structure;
|
changeset |
files
|
| Thu, 01 Aug 2019 09:55:37 +0200 |
wenzelm |
simplified module structure: back to plain datatype (see 95f4f08f950f and 70019ab5e57f);
|
changeset |
files
|
| Thu, 01 Aug 2019 09:50:20 +0200 |
wenzelm |
abstract type theory_id -- ensure non-equality type independently of implementation;
|
changeset |
files
|
| Wed, 31 Jul 2019 19:50:38 +0200 |
wenzelm |
clarified export: retain proof boxes as local definitions -- more scalable;
|
changeset |
files
|
| Wed, 31 Jul 2019 09:04:00 +0200 |
nipkow |
reduced dependencies
|
changeset |
files
|
| Tue, 30 Jul 2019 20:09:25 +0200 |
wenzelm |
clarified global theory context;
|
changeset |
files
|
| Tue, 30 Jul 2019 19:01:51 +0200 |
wenzelm |
more robust export, based on reconstruct_proof / expand_proof;
|
changeset |
files
|