Recursive Functions of Symbolic Expressions and Their Computation by Machine
| dc.date.accessioned | 2004-10-04T14:39:07Z | |
| dc.date.accessioned | 2018-11-24T10:11:53Z | |
| dc.date.available | 2004-10-04T14:39:07Z | |
| dc.date.available | 2018-11-24T10:11:53Z | |
| dc.date.issued | 1959-03-13 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6096 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6096 | |
| dc.description.abstract | The attached paper is a description of the LISP system starting with the machine-independent system of recursive functions of symbolic expressions. This seems to be a better point of view for looking at the system than the original programming approach. After revision, the paper will be submitted for publication in a logic or computing journal. This memorandum contains only the machine independent parts of the system. The representation of S-expressions in the computer and the system for representing S-functions by computer subroutines will be added. | en_US |
| dc.format.extent | 7924274 bytes | |
| dc.format.extent | 5951481 bytes | |
| dc.language.iso | en_US | |
| dc.title | Recursive Functions of Symbolic Expressions and Their Computation by Machine | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-008.pdf | 5.951Mb | application/pdf | View/ |
| AIM-008.ps | 7.924Mb | application/postscript | View/ |