Back to results
Massachusetts Institute of Technology
On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types
Abstract
dc:descriptionThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 1996
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Arkoudas, Kostas
- Advisor dc:contributor.advisor
-
- David Allen McAllester.
Subjects
dc:subject × 1Rights
dc:rights- Statement 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.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/39074
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/39074