Content deleted Content added
No edit summary |
Never mind about cond |
||
Line 76:
:::::::If [[User:P3d0|P3d0]] can implement cond using lambda calculus, ''including the syntax'', his objections would be valid. However, I don't see how to do that off the top of my head, and it may not be possible. -- [[User:CYD|CYD]]
:::::Ok Stan, I think I see where you are coming from. Whether cond is defined by lambda calculus, or is provided as a primitive, the fact remains that it must be defined somehow in any language that claims to be Lisp. So I yield. :-)
:::::Incidentally, CYD, do you think a Turing machine could implement an interpreter for cond, including the syntax? If so, lambda calculus can do it too, because lambda calculus is Turing-equivalent. --[[User:P3d0|P3d0]] 03:48, 9 Aug 2003 (UTC)
| |||