Fri, 16 Jul 1999 22:23:26 +0200 removed break;
wenzelm [Fri, 16 Jul 1999 22:23:26 +0200] rev 7023
removed break;
Fri, 16 Jul 1999 22:22:59 +0200 removed BREAK, ROLLBACK;
wenzelm [Fri, 16 Jul 1999 22:22:59 +0200] rev 7022
removed BREAK, ROLLBACK;
Fri, 16 Jul 1999 22:22:02 +0200 structure LocalDefs = LocalDefs;
wenzelm [Fri, 16 Jul 1999 22:22:02 +0200] rev 7021
structure LocalDefs = LocalDefs; structure Calculation = Calculation; structure SkipProof = SkipProof;
Fri, 16 Jul 1999 14:06:13 +0200 Exported function unify_consts (workaround to avoid inconsistently
berghofe [Fri, 16 Jul 1999 14:06:13 +0200] rev 7020
Exported function unify_consts (workaround to avoid inconsistently typed recursive constants in inductive and primrec definitions).
Fri, 16 Jul 1999 14:03:33 +0200 Added new example (infinitely branching trees).
berghofe [Fri, 16 Jul 1999 14:03:33 +0200] rev 7019
Added new example (infinitely branching trees).
Fri, 16 Jul 1999 14:03:03 +0200 Infinitely branching trees.
berghofe [Fri, 16 Jul 1999 14:03:03 +0200] rev 7018
Infinitely branching trees.
Fri, 16 Jul 1999 13:25:45 +0200 Replaced datatype_info by datatype_info_err.
berghofe [Fri, 16 Jul 1999 13:25:45 +0200] rev 7017
Replaced datatype_info by datatype_info_err.
Fri, 16 Jul 1999 13:24:41 +0200 - Now also supports arbitrarily branching datatypes.
berghofe [Fri, 16 Jul 1999 13:24:41 +0200] rev 7016
- Now also supports arbitrarily branching datatypes. - Fixed bug (in some rare cases, recursive constants were inconsistently typed in different primrec equations).
Fri, 16 Jul 1999 12:14:04 +0200 - Datatype package now also supports arbitrarily branching datatypes
berghofe [Fri, 16 Jul 1999 12:14:04 +0200] rev 7015
- Datatype package now also supports arbitrarily branching datatypes (using function types). - Added new simplification procedure for proving distinctness of constructors. - dtK is now a reference.
Fri, 16 Jul 1999 12:09:48 +0200 Added some definitions and theorems needed for the
berghofe [Fri, 16 Jul 1999 12:09:48 +0200] rev 7014
Added some definitions and theorems needed for the construction of datatypes involving function types.
(0) -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip