| Author | Pichet Chintrakulchai |
| Call Number | AIT Thesis no.CS-89-03 |
| Subject(s) | Combinatory logic
|
| Note | A thesis submitted in partial fulfillment of the requirements for the degree of
Master of Engineering |
| Publisher | Asian Institute of Technology |
| Abstract | In this study, a translation scheme for translating combinator expressions which are used as intermediate code describing functions of functional languages is presented. The translator, using static evaluation, constructs graph instances of these functions and generate the data structures representing the graphs in target machine readable form. Common subexpressions internal to the function body are also detected and shared to achieve full laziness. A graph reduction evaluator for evaluating the graph in a lazy manner is also presented. Graph copying mechanism is used for constructing the instances providing a natural and straight forward method of building the instance graph at runtime. |
| Year | 1989 |
| Type | Thesis |
| School | School of Engineering and Technology (SET) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Malhotra, V. M.;Kimura, Tomonori; |
| Examination Committee(s) | Phan, Minh Dung; |
| Scholarship Donor(s) | The Australian Government; |
| Degree | Thesis (M.Eng.) - Asian Institute of Technology, 1989 |