Subrecursive Programming Languages for $\Re^{n}$
| dc.contributor.author | Constable, Robert L. | en_US |
| dc.date.accessioned | 2007-04-19T17:53:19Z | |
| dc.date.available | 2007-04-19T17:53:19Z | |
| dc.date.issued | 1970-03 | en_US |
| dc.description.abstract | NO ABSTRACT SUPPLIED | en_US |
| dc.format.extent | 1453638 bytes | |
| dc.format.extent | 624623 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR70-53 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/5913 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Subrecursive Programming Languages for $\Re^{n}$ | en_US |
| dc.type | technical report | en_US |