Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/6602
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJosé Nuno Oliveiraen
dc.date.accessioned2018-01-17T10:29:31Z-
dc.date.available2018-01-17T10:29:31Z-
dc.date.issued2015en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/6602-
dc.identifier.urihttp://dx.doi.org/10.1007/978-3-319-24704-5_11en
dc.description.abstractThis paper introduces the metaphorism pattern of relational specification and addresses how specification following this pattern can be refined into recursive programs. Metaphorisms express input-output relationships which preserve relevant information while at the same time some intended optimization takes place. Text processing, sorting, representation changers, etc., are examples of metaphorisms. The kind of metaphorism refinement proposed in this paper is a strategy known as change of virtual data structure. It gives sufficient conditions for such implementations to be calculated using relation algebra and illustrates the strategy with the derivation of quicksort as example.en
dc.languageengen
dc.relation5601en
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.titleMetaphorisms in Programmingen
dc.typeconferenceObjecten
dc.typePublicationen
Appears in Collections:HASLab - Articles in International Conferences

Files in This Item:
File Description SizeFormat 
P-00J-YMJ.pdf358.62 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.