...and pigs can fly, if you throw them fast enough.
This is just an encoding of a Turing-complete language into another, I don't see what's been demonstrated here.
This is just an encoding of a Turing-complete language into another, I don't see what's been demonstrated here.
This article is clearly someone having fun with their language. It isn't a serious claim about C being functional, something which the author states explicitly if you read to the end.
"everything is turing complete" is a perfect example of the kind of middle-brow dismissal i understood pg to be talking about.
>The main limitation is that you need to know the size of the return value.
The only way I see is to allocate (almost) the entire machine memory to the stack, create one giant array in that chunk of memory and then put all lists in that single array. That's tantamount to reimplementing malloc on the stack.