Shortcut fusion rules for the derivation of circular and higher-order monadic programs
| Autor(a) principal: | |
|---|---|
| Data de Publicação: | 2009 |
| Outros Autores: | , |
| Idioma: | eng |
| Título da fonte: | Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| Texto Completo: | http://hdl.handle.net/1822/36154 |
Resumo: | Functional programs often combine separate parts using intermediate data structures for communicating results. Programs so defined are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. In this paper, we study several shortcut fusion extensions, so that, alternatively, circular or higher-order programs are derived. These extensions are also provided for effect-free programs and monadic ones. Our work results in a set of generic calculation rules, that are widely applicable, and whose correctness is formally established. |
| id |
RCAP_f10b52f1ec1ca2b50b82bf8709e9e63f |
|---|---|
| oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/36154 |
| network_acronym_str |
RCAP |
| network_name_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository_id_str |
https://opendoar.ac.uk/repository/7160 |
| spelling |
Shortcut fusion rules for the derivation of circular and higher-order monadic programsCircular programmingMonadic programmingProgram calculationShortcut fusionDeforestationFunctional programs often combine separate parts using intermediate data structures for communicating results. Programs so defined are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. In this paper, we study several shortcut fusion extensions, so that, alternatively, circular or higher-order programs are derived. These extensions are also provided for effect-free programs and monadic ones. Our work results in a set of generic calculation rules, that are widely applicable, and whose correctness is formally established.(undefined)SpringerUniversidade do MinhoPardo, AlbertoFernandes, João PauloSaraiva, João Alexandre20092009-01-01T00:00:00Zconference paperinfo:eu-repo/semantics/publishedVersionapplication/pdfhttp://hdl.handle.net/1822/36154eng97816055832731388-369010.1145/1480945.1480958http://link.springer.com/article/10.1007%2Fs10990-011-9076-xinfo:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-11T06:27:30Zoai:repositorium.sdum.uminho.pt:1822/36154Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T15:53:55.504205Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse |
| dc.title.none.fl_str_mv |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| title |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| spellingShingle |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs Pardo, Alberto Circular programming Monadic programming Program calculation Shortcut fusion Deforestation |
| title_short |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| title_full |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| title_fullStr |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| title_full_unstemmed |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| title_sort |
Shortcut fusion rules for the derivation of circular and higher-order monadic programs |
| author |
Pardo, Alberto |
| author_facet |
Pardo, Alberto Fernandes, João Paulo Saraiva, João Alexandre |
| author_role |
author |
| author2 |
Fernandes, João Paulo Saraiva, João Alexandre |
| author2_role |
author author |
| dc.contributor.none.fl_str_mv |
Universidade do Minho |
| dc.contributor.author.fl_str_mv |
Pardo, Alberto Fernandes, João Paulo Saraiva, João Alexandre |
| dc.subject.por.fl_str_mv |
Circular programming Monadic programming Program calculation Shortcut fusion Deforestation |
| topic |
Circular programming Monadic programming Program calculation Shortcut fusion Deforestation |
| description |
Functional programs often combine separate parts using intermediate data structures for communicating results. Programs so defined are modular, easier to understand and maintain, but suffer from inefficiencies due to the generation of those gluing data structures. To eliminate such redundant data structures, some program transformation techniques have been proposed. One such technique is shortcut fusion, and has been studied in the context of both pure and monadic functional programs. In this paper, we study several shortcut fusion extensions, so that, alternatively, circular or higher-order programs are derived. These extensions are also provided for effect-free programs and monadic ones. Our work results in a set of generic calculation rules, that are widely applicable, and whose correctness is formally established. |
| publishDate |
2009 |
| dc.date.none.fl_str_mv |
2009 2009-01-01T00:00:00Z |
| dc.type.driver.fl_str_mv |
conference paper |
| dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| status_str |
publishedVersion |
| dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/36154 |
| url |
http://hdl.handle.net/1822/36154 |
| dc.language.iso.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
9781605583273 1388-3690 10.1145/1480945.1480958 http://link.springer.com/article/10.1007%2Fs10990-011-9076-x |
| dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf |
| dc.publisher.none.fl_str_mv |
Springer |
| publisher.none.fl_str_mv |
Springer |
| dc.source.none.fl_str_mv |
reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia instacron:RCAAP |
| instname_str |
FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| instacron_str |
RCAAP |
| institution |
RCAAP |
| reponame_str |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| collection |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) |
| repository.name.fl_str_mv |
Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia |
| repository.mail.fl_str_mv |
info@rcaap.pt |
| _version_ |
1833595610061602816 |