dc.contributor.author | Kannan, Venkatesh | |
dc.contributor.author | Hamilton, Geoff W. | |
dc.date.accessioned | 2017-01-12T14:23:16Z | |
dc.date.available | 2017-01-12T14:23:16Z | |
dc.date.issued | 2016 | |
dc.identifier.uri | http://hdl.handle.net/10344/5448 | |
dc.description | n/a | en_US |
dc.description.abstract | Program transformation techniques are commonly used to improve the e ciency of programs. While many transformation techniques aim to remove ine ciencies in the algorithms used in a program, another source of ine ciency is the use of inappropriate datatypes whose structures do not match the algorithmic structure of the program. This mismatch will potentially result in ine cient consumption of the input by the program. Previously, Mogensen has shown how techniques similar to those used in supercompilation can be used to transform datatypes, but this was not fully automatic. In this paper, we present a fully automatic datatype transformation technique which can be applied in conjunction with distillation. The objective of the datatype transformation is to transform the original datatypes in a program so that the resulting structure matches the algorithmic structure of the distilled program. Consequently, the resulting transformed program potentially uses less pattern matching and as a result is more e cient than the original program. | en_US |
dc.language.iso | eng | en_US |
dc.relation.ispartofseries | Fifth International Workshop on Metacomputation; | |
dc.relation.uri | http://meta2016.pereslavl.ru/index.html | |
dc.subject | computer software | en_US |
dc.subject | programmes | en_US |
dc.subject | algorithms | en_US |
dc.title | Distilling new data types | en_US |
dc.type | info:eu-repo/semantics/conferenceObject | en_US |
dc.type.supercollection | all_ul_research | en_US |
dc.contributor.sponsor | SFI | en_US |
dc.relation.projectid | 10/CE/I1855 | en_US |
dc.rights.accessrights | info:eu-repo/semantics/openAccess | en_US |