On the termination of recursive algorithms in pure first-order functional languages with monomorphic inductive data types
Name
35968705-MIT.pdf
Description
Full printable version
Size
5.09 MB
Format
Adobe PDF
Checksum (MD5)
1925596dca12ed193b4b4a5b6b82687c
Author(s)
Arkoudas, Kostas
Advisor(s)
David Allen McAllester.
Date Issued
1996
Publisher
Massachusetts Institute of Technology
Description
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Includes bibliographical references (p. 121).
Subjects
Electrical Engineering and Computer Science
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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.
Persistent DSpace Link
