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

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

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996. === Includes bibliographical references (p. 121). === by Kostas Arkoudas. === M.S.

Bibliographic Details
Main Author: Arkoudas, Kostas
Other Authors: David Allen McAllester.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2007
Subjects:
Electrical Engineering and Computer Science
Online Access:http://hdl.handle.net/1721.1/39074

Internet

http://hdl.handle.net/1721.1/39074

Similar Items