Tue, 26 Oct 2004 16:29:54 +0200 Removed code generator stuff. Code generation is now handled by code
berghofe [Tue, 26 Oct 2004 16:29:54 +0200] rev 15258
Removed code generator stuff. Code generation is now handled by code generator in typedef_package.
Tue, 26 Oct 2004 16:26:53 +0200 Added call to Codegen.preprocess.
berghofe [Tue, 26 Oct 2004 16:26:53 +0200] rev 15257
Added call to Codegen.preprocess.
Tue, 26 Oct 2004 16:25:41 +0200 Fixed problem with sorts in function make_casedists.
berghofe [Tue, 26 Oct 2004 16:25:41 +0200] rev 15256
Fixed problem with sorts in function make_casedists.
Mon, 25 Oct 2004 17:19:17 +0200 fixed urls
nipkow [Mon, 25 Oct 2004 17:19:17 +0200] rev 15255
fixed urls
Sun, 24 Oct 2004 15:41:52 +0200 Simplification to symbol processing; put quotes around theory name in message.
aspinall [Sun, 24 Oct 2004 15:41:52 +0200] rev 15254
Simplification to symbol processing; put quotes around theory name in message.
Thu, 21 Oct 2004 19:21:32 +0200 Fix <closetheory>
aspinall [Thu, 21 Oct 2004 19:21:32 +0200] rev 15253
Fix <closetheory>
Tue, 19 Oct 2004 22:45:20 +0200 Replaced PolyML specific print function by Display.print_thm(s)
berghofe [Tue, 19 Oct 2004 22:45:20 +0200] rev 15252
Replaced PolyML specific print function by Display.print_thm(s)
Tue, 19 Oct 2004 18:18:45 +0200 converted some induct_tac to induct
paulson [Tue, 19 Oct 2004 18:18:45 +0200] rev 15251
converted some induct_tac to induct
Mon, 18 Oct 2004 13:40:45 +0200 added a missing case (Var x) that made finding a case split fail, in order to prove the specification equation from the split versions, for some recursive functions.
dixon [Mon, 18 Oct 2004 13:40:45 +0200] rev 15250
added a missing case (Var x) that made finding a case split fail, in order to prove the specification equation from the split versions, for some recursive functions.
Mon, 18 Oct 2004 11:43:40 +0200 Replaced list of bound variables in simpset by maximal index of bound
berghofe [Mon, 18 Oct 2004 11:43:40 +0200] rev 15249
Replaced list of bound variables in simpset by maximal index of bound variables. This allows new variable names to be generated more quickly (without calling variant).
(0) -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 +30000 tip