Fri, 20 Sep 2013 17:08:08 +0200 make SML/NJ happy
kuncar [Fri, 20 Sep 2013 17:08:08 +0200] rev 53754
make SML/NJ happy
Fri, 20 Sep 2013 16:32:27 +0200 renamed "primcorec" to "primcorecursive", to open the door to a 'theory -> theory' command called "primcorec" (cf. "fun" vs. "function")
blanchet [Fri, 20 Sep 2013 16:32:27 +0200] rev 53753
renamed "primcorec" to "primcorecursive", to open the door to a 'theory -> theory' command called "primcorec" (cf. "fun" vs. "function")
Fri, 20 Sep 2013 15:42:41 +0200 more primcorec docs
blanchet [Fri, 20 Sep 2013 15:42:41 +0200] rev 53752
more primcorec docs
Fri, 20 Sep 2013 15:05:47 +0200 added primcorec examples with lambdas
blanchet [Fri, 20 Sep 2013 15:05:47 +0200] rev 53751
added primcorec examples with lambdas
Fri, 20 Sep 2013 14:50:06 +0200 more primcorec docs
blanchet [Fri, 20 Sep 2013 14:50:06 +0200] rev 53750
more primcorec docs
Fri, 20 Sep 2013 14:17:47 +0200 adapted primcorec documentation to reflect the three views
blanchet [Fri, 20 Sep 2013 14:17:47 +0200] rev 53749
adapted primcorec documentation to reflect the three views
Fri, 20 Sep 2013 12:09:06 +0200 updated docs
blanchet [Fri, 20 Sep 2013 12:09:06 +0200] rev 53748
updated docs
Fri, 20 Sep 2013 12:04:48 +0200 took out spurious attributes (no need for several code equations / simps for thesame constants)
blanchet [Fri, 20 Sep 2013 12:04:48 +0200] rev 53747
took out spurious attributes (no need for several code equations / simps for thesame constants)
Fri, 20 Sep 2013 11:44:30 +0200 have "datatype_new_compat" register induction and recursion theorems in nested case
blanchet [Fri, 20 Sep 2013 11:44:30 +0200] rev 53746
have "datatype_new_compat" register induction and recursion theorems in nested case
Fri, 20 Sep 2013 10:09:16 +0200 prefer Code.abort over code_abort
Andreas Lochbihler [Fri, 20 Sep 2013 10:09:16 +0200] rev 53745
prefer Code.abort over code_abort
(0) -30000 -10000 -3000 -1000 -300 -100 -10 +10 +100 +300 +1000 +3000 +10000 tip