<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Code generation from combinator expression</title>
  </titleInfo>
  <name type="personal">
    <namePart>Pichet Chintrakulchai</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Malhotra, V. M.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Kimura, Tomonori</namePart>
    <role>
      <roleTerm type="text">Co-chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Phan, Minh Dung</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>The Australian Government</namePart>
    <role>
      <roleTerm type="text">Scholarship donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1989</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
    <extent>37 p. + 1 online resource</extent>
  </physicalDescription>
  <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.</abstract>
  <note>A thesis submitted in partial fulfillment of the requirements for the degree of Master of Engineering</note>
  <note>Thesis (M.Eng.) - Asian Institute of Technology, 1989</note>
  <subject authority="lcsh">
    <topic>Combinatory logic</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Thesis ; no. CS-89-3</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B17627</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B17627</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">280898</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817173030.0</recordChangeDate>
  </recordInfo>
</mods>
