Metaphorisms in programming
| Data(s) |
01/09/2015
|
|---|---|
| Resumo |
This 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. The author wishes to thank the anonymous referees for their comments and suggestions. This work is funded by ERDF - European Regional Development Fund through the COMPETE Programme (operational programme for competitiveness) and by National Funds through the FCT - Funda¸c˜ao para a Ciˆencia e a Tecnologia (Portuguese Foundation for Science and Technology) within project FCOMP-01-0124-FEDER-020537 |
| Identificador |
Oliveira, J. N. (2015) Metaphorisms in programming. Vol. 9348. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 171-190). 978-3-319-24703-8 978-3-319-24704-5 0302-9743 http://hdl.handle.net/1822/40616 10.1007/978-3-319-24704-5_11 |
| Idioma(s) |
eng |
| Publicador |
Springer Verlag |
| Relação |
http://link.springer.com/chapter/10.1007/978-3-319-24704-5_11 |
| Direitos |
info:eu-repo/semantics/openAccess |
| Palavras-Chave | #Programming from specifications #Algebra of programming |
| Tipo |
info:eu-repo/semantics/conferenceObject |
