| dc.contributor.advisor | David Allen McAllester. | en_US |
| dc.contributor.author | Arkoudas, Kostas | en_US |
| dc.date.accessioned | 2007-09-28T13:45:58Z | |
| dc.date.available | 2007-09-28T13:45:58Z | |
| dc.date.copyright | 1996 | en_US |
| dc.date.issued | 1996 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/39074 | |
| dc.description | Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996. | en_US |
| dc.description | Includes bibliographical references (p. 121). | en_US |
| dc.description.statementofresponsibility | by Kostas Arkoudas. | en_US |
| dc.format.extent | 121 p. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
| dc.subject | Electrical Engineering and Computer Science | en_US |
| dc.title | On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | M.S. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.identifier.oclc | 35968705 | en_US |
