Mon, 28 Aug 2006 16:10:44 +0200 encode clauses as Isar premises, rather than as object-logic &, for faster parsing
webertj [Mon, 28 Aug 2006 16:10:44 +0200] rev 20420
encode clauses as Isar premises, rather than as object-logic &, for faster parsing
Fri, 25 Aug 2006 18:48:58 +0200 abstraction of lambda-expressions
paulson [Fri, 25 Aug 2006 18:48:58 +0200] rev 20419
abstraction of lambda-expressions
Fri, 25 Aug 2006 18:48:09 +0200 tidied
paulson [Fri, 25 Aug 2006 18:48:09 +0200] rev 20418
tidied
Fri, 25 Aug 2006 18:47:36 +0200 better skolemization, using first-order resolution rather than hoping for the right result
paulson [Fri, 25 Aug 2006 18:47:36 +0200] rev 20417
better skolemization, using first-order resolution rather than hoping for the right result
Fri, 25 Aug 2006 18:46:24 +0200 using inc
paulson [Fri, 25 Aug 2006 18:46:24 +0200] rev 20416
using inc
Fri, 25 Aug 2006 18:45:57 +0200 explicit type variables prevent empty sorts
paulson [Fri, 25 Aug 2006 18:45:57 +0200] rev 20415
explicit type variables prevent empty sorts
Fri, 25 Aug 2006 18:44:59 +0200 replaced skolem declarations by automatic skolemization of everything
paulson [Fri, 25 Aug 2006 18:44:59 +0200] rev 20414
replaced skolem declarations by automatic skolemization of everything
Fri, 25 Aug 2006 00:10:10 +0200 avoid duplicate tactics
webertj [Fri, 25 Aug 2006 00:10:10 +0200] rev 20413
avoid duplicate tactics
Thu, 24 Aug 2006 23:51:46 +0200 additional list of tactics that can be added to arith
webertj [Thu, 24 Aug 2006 23:51:46 +0200] rev 20412
additional list of tactics that can be added to arith
Thu, 24 Aug 2006 15:20:43 +0200 Added premises concerning finite support of recursion results to FCBs.
berghofe [Thu, 24 Aug 2006 15:20:43 +0200] rev 20411
Added premises concerning finite support of recursion results to FCBs.
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip