Advanced Search
DSpace@MIT

CONVERT

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.author Guzman, Adolfo en_US
dc.contributor.author McIntosh, Harold en_US
dc.date.accessioned 2004-10-01T20:50:32Z
dc.date.available 2004-10-01T20:50:32Z
dc.date.issued 1966-06-01 en_US
dc.identifier.other AIM-099 en_US
dc.identifier.uri http://hdl.handle.net/1721.1/5877
dc.description.abstract A programming language is described which is applicable to problems conveniently described by transformation rules. By this we mean that patterns may be prescribed, each being associated with a skeleton, so that a series of such pairs may be searched until a pattern is found which matches an expression to be transformed. The conditions for a match are governed by a code which allows sub-expressions to be identified and eventually substituted into the corresponding skeleton. The primitive patterns and primitive skeletons are described, as well as the principles which allow their elaboration into more complicated patterns and skeletons. The advantages of the language are that it allows one to apply transformation rules to lists and arrays as easily as strings, that both patterns and skeletons may be defined recursively, and that as a consequence programs may be stated quite concisely. en_US
dc.format.extent 43 p. en_US
dc.format.extent 33797332 bytes
dc.format.extent 1194644 bytes
dc.format.mimetype application/postscript
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.relation.ispartofseries AIM-099 en_US
dc.title CONVERT en_US


Files in this item

Name Size Format Description
AIM-099.ps 32.23Mb Postscript
AIM-099.pdf 1.139Mb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage