Talk:Church numerals: Difference between revisions
(Haskell - on the worker-wrapper transformation in recursive fns) |
|||
Line 6: | Line 6: | ||
In response to Spoon!'s query – "not sure why `go` helper is necessary": the worker-wrapper transform is a useful reflex whenever recursion is needed. http://ku-fpg.github.io/practice/workerwrapper/ – (recursive name found in a more local namespace – often a smaller frame pushed to stack etc. etc) but no particular view on it here. Your edit looks fine. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) |
In response to Spoon!'s query – "not sure why `go` helper is necessary": the worker-wrapper transform is a useful reflex whenever recursion is needed. http://ku-fpg.github.io/practice/workerwrapper/ – (recursive name found in a more local namespace – often a smaller frame pushed to stack etc. etc) but no particular view on it here. Your edit looks fine. [[User:Hout|Hout]] ([[User talk:Hout|talk]]) |
||
===Phix disclaimer=== |
|||
Disclaimer: this all feels a bit silly to me, but the intention (I am no expert on this lambda stuff) is that it shows how "closures" (or whatever) can be simulated quite easily with routine_ids and data. |
|||
[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) |
Revision as of 17:22, 13 September 2018
Created a stub for a Church Numerals
Not sure if this needs the addition of a more stretching task ? It may already not be all that easy to implement in languages with limited support for higher-order functions. In AppleScript, for example, my first sketches of churchMultiply all produce a stack overflow. Hout (talk) 22:09, 21 August 2018 (UTC)
Worker-wrapper transformation in Haskell
In response to Spoon!'s query – "not sure why `go` helper is necessary": the worker-wrapper transform is a useful reflex whenever recursion is needed. http://ku-fpg.github.io/practice/workerwrapper/ – (recursive name found in a more local namespace – often a smaller frame pushed to stack etc. etc) but no particular view on it here. Your edit looks fine. Hout (talk)
Phix disclaimer
Disclaimer: this all feels a bit silly to me, but the intention (I am no expert on this lambda stuff) is that it shows how "closures" (or whatever) can be simulated quite easily with routine_ids and data. Petelomax (talk)