ACM Home Page
Please provide us with feedback. Feedback
Recursive functions of symbolic expressions and their computation by machine, Part I
Full text PdfPdf (1.36 MB)
Source
Communications of the ACM archive
Volume 3 ,  Issue 4  (April 1960) table of contents
Pages: 184 - 195  
Year of Publication: 1960
ISSN:0001-0782
Author
John McCarthy  Massachusetts Institute of Technology, Cambridge
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 39,   Downloads (12 Months): 316,   Citation Count: 223
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/367177.367199
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. McCARTHY, Programs with common sense, Paper presented at the Symposium on the Mechanization of Thought Processes, National Physical Laboratory, Teddington, England, Nov. 24-27, 1958. (Published in Proceedings of the Symposium by H. M. Stationery Office).
 
2
A. NEWELL AND J. C. SHAW, Programming the logic theory machine, Proc. Western Joint Computer Conference, Feb. 1957.
 
3
A. CmmcH, The Calculi of Lambda-Conversion (Princeton University Press, Princeton, N. J., 1941).
 
4
FORTRAN Programmer's Reference Manual, IBM Corporation, New York, Oct. 15, 1956.
5

CITED BY  223