<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><div><br></div><div>"We shall first define a class of symbolic expressions in terms of ordered pairs and lists. Then we shall define five elementary functions and predicates, and build from them by composition, conditional expressions, and recursive definitions an extensive class of functions of which we shall give a number of examples. We shall then show how these functions themselves can be expressed as symbolic expressions, and we shall define a universal function <i>apply</i> that allows us to compute from the expression for a given function its value for given arguments."</div><div><br></div><div>John McCarthy</div><div>Recursive Functions of Symbolic Expressions</div><div>and their Computation by Machine, Part I</div><div><br></div><br><div><div>On Oct 25, 2011, at 9:09 AM, Paul Krueger wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div>For anyone who hasn't heard ...<br><br><a href="http://news.cnet.com/8301-1001_3-20125026-92/john-mccarthy-creator-of-lisp-programming-language-dies/">http://news.cnet.com/8301-1001_3-20125026-92/john-mccarthy-creator-of-lisp-programming-language-dies/</a><br>_______________________________________________<br>Openmcl-devel mailing list<br>Openmcl-devel@clozure.com<br>http://clozure.com/mailman/listinfo/openmcl-devel<br></div></blockquote></div><br></body></html>