Timeline for answer to Primitive Recursive function by chi
Current License: CC BY-SA 3.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 11, 2015 at 18:28 | comment | added | chi |
@Sid The first definition of primitive recursion only considers natural numbers as arguments. When dealing with lists, it has to be extended. If we extend it as you propose, then h y (x:xs) can not depend on x, which is very restrictive: we can't access any of the list elements!
|
|
| Nov 11, 2015 at 15:02 | comment | added | Sid |
According to primitive recursive definition, I think the general scheme should be h y (x:xs) = g y xs (h y xs) , but why in A tutorial on the universality and expressiveness of fold defines it as h y (x:xs) = g y x xs (h y xs) ?
|
|
| Nov 11, 2015 at 14:17 | comment | added | chi | Well, you compare the general scheme and the desired goal and try to instantiate the parameters so that they match. A bit of trial and error may be needed. | |
| Nov 11, 2015 at 13:30 | vote | accept | Sid | ||
| Nov 11, 2015 at 9:51 | history | answered | chi | CC BY-SA 3.0 |