On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types

Author(s)
Arkoudas, Kostas
Thumbnail
DownloadFull printable version (5.090Mb)
Advisor
David Allen McAllester.
Terms of use
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. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Description
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
 
Includes bibliographical references (p. 121).
 
Date issued
1996
URI
http://hdl.handle.net/1721.1/39074
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science
Collections