000 02309nam a2200385 4500
005 20260817173030.0
008 280898 th eng
035 _a.b10143750
099 9 _aAIT Thesis no.CS-89-03
100 0 _aPichet Chintrakulchai
245 1 0 _aCode generation from combinator expression
260 _aBangkok :
_bAsian Institute of Technology,
_c1989
300 _a37 p. +
_e1 online resource
490 1 _aThesis ;
_vno. CS-89-3
500 _aA thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering
502 _aThesis (M.Eng.) - Asian Institute of Technology, 1989
520 _aIn 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.
650 0 _aCombinatory logic
700 1 _aMalhotra, V. M.,
_eChairperson
700 1 _aKimura, Tomonori,
_eCo-chairperson
700 1 _aPhan, Minh Dung,
_eExamination Committee
710 2 _aThe Australian Government,
_eScholarship donor
810 2 _aAsian Institute of Technology.
_tThesis ;
_vno. CS-89-3
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B17627
907 _a.b10143750
_bmnait
_cx
902 _a240411
998 _b2
_c951012
_dm
_ea
_fx
_g0
945 _lmnait
945 _lmnarc
942 _c22
942 _c40
909 _aBarcode : 30050120677330
_bCREATED : 2014-02-18
_cRECORD # : i12766215
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050120373443
_bCREATED : 2016-08-06
_cRECORD # : i1302372x
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c18439
_d18439