AI SearchCode generation from combinator expression
Call Number: AIT Thesis no.CS-89-03 Material type:
TextSeries: Asian Institute of Technology. Thesis ; no. CS-89-3Publication details: Bangkok : Asian Institute of Technology, 1989Description: 37 p. + 1 online resourceSubject(s): Online resources: Dissertation note: Thesis (M.Eng.) - Asian Institute of Technology, 1989 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT Thesis no.CS-89-03 (Browse shelf(Opens below)) | 3 | Available | 30050120677330 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT Thesis no.CS-89-03 (Browse shelf(Opens below)) | Available | 30050120373443 |
A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering
Thesis (M.Eng.) - Asian Institute of Technology, 1989
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.
There are no comments on this title.