Schema-based logic program transformation
| buir.supervisor | Flener, Pierre | |
| dc.contributor.author | Büyükyıldız, Halime | |
| dc.date.accessioned | 2016-01-08T20:14:50Z | |
| dc.date.available | 2016-01-08T20:14:50Z | |
| dc.date.copyright | 1997 | |
| dc.date.issued | 1997 | |
| dc.description | Ankara : Department of Computer Engineering and Information Science and Institute of Engineering and Science, Bilkent University, 1997. | en_US |
| dc.description | Thesis (Master's) -- Bilkent University, 1997. | en_US |
| dc.description | Includes bibliographical references (leaves 134-140). | en_US |
| dc.description | Cataloged from PDF version of article. | |
| dc.description.abstract | In traditional programming methodology, developing a correct and efficient program is divided into two phases: in the first phase, called the synthesis phase, a correct, but maybe inefficient program is constructed, and in the second phase, called the transformation phase, the constructed program is transformed into a more efficient equivalent program. If the synthesis phase is guided by a schema that embodies the algorithm design knowledge abstracting the construction of a particular family of programs, then the transformation phase can also be done in a schema-guided fashion using transformation schemas, which encode the transformation techniques from input program schemas to output program schemas by defining the conditions that have to be verified to have a more efficient equivalent program. Seven program schemas are proposed, which capture sub-families of divide-and-conquer programs and the programs that are constructed using some generalization methods. The proposed transformation schemas either automate transformation strategies, such as accumulator introduction and tupling generalization, which is a special case of sructural generalization, or simulate and extend a basic theorem in functional programming (the first duality law of the fold operators) for logic programs. A prototype transformation system is presented that can transform programs, using the proposed transformation schemas. | |
| dc.description.provenance | Made available in DSpace on 2016-01-08T20:14:50Z (GMT). No. of bitstreams: 1 1.pdf: 78510 bytes, checksum: d85492f20c2362aa2bcf4aad49380397 (MD5) | en |
| dc.description.statementofresponsibility | by Halime Büyükyıldız | en_US |
| dc.format.extent | xi, 154 leaves : charts ; 30 cm. | en_US |
| dc.identifier.uri | http://hdl.handle.net/11693/17948 | |
| dc.language.iso | English | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject.lcsh | Logic programming. | en_US |
| dc.subject.lcsh | Transformations (Mathematics) | en_US |
| dc.title | Schema-based logic program transformation | en_US |
| dc.title.alternative | Taslağa dayalı mantık programı dönüştürme | |
| dc.type | Thesis | en_US |
| thesis.degree.discipline | Computer Engineering | |
| thesis.degree.grantor | Bilkent University | |
| thesis.degree.level | Master's | |
| thesis.degree.name | MS (Master of Science) |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- B038363.pdf
- Size:
- 3.71 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version