Recursive Functions of Symbolic Expressions and Their Computation by Machine

dc.creator	McCarthy, J.
dc.date	2004-10-04T14:39:07Z
dc.date	2004-10-04T14:39:07Z
dc.date	1959-03-13
dc.date.accessioned	2013-10-09T02:42:58Z
dc.date.available	2013-10-09T02:42:58Z
dc.date.issued	2013-10-09
dc.identifier	AIM-008
dc.identifier	http://hdl.handle.net/1721.1/6096
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description	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.
dc.format	7924274 bytes
dc.format	5951481 bytes
dc.format	application/postscript
dc.format	application/pdf
dc.language	en_US
dc.relation	AIM-008
dc.title	Recursive Functions of Symbolic Expressions and Their Computation by Machine

Files in this item

Files	Size	Format	View
There are no files associated with this item.