Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Shortcut fusion rules for the derivation of circular and higher-order monadic programs
Publication

Publications

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
Type
Article in International Conference Proceedings Book
Year
2009
Authors
Pardo, A
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Joao Paulo Fernandes
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Saraiva, J
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Conference proceedings International
Pages: 81-90
2009 ACM SIGPLAN Symposium on Partial Evaluation and Program Manipulation, PEPM'09
Savannah, GA, 19 January 2009 through 20 January 2009
Indexing
Other information
Authenticus ID: P-007-QKD
Abstract (EN): Functional programs often combine separate parts using intermediate data structures for communicating results. These programs 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. Recently, we have extended standard shortcut fusion: in addition to intermediate structures, the program parts may now communicate context information, and it still is possible to eliminate those structures. This is achieved by transforming the original function composition into a circular program. This new technique, however, has been studied in the context of purely functional programs only. In this paper, we propose an extension to this new form of fusion,but in the context of monadic programming: we derive monadic circular p ograms from strict ones, maintaining the global effects. Later, the circularities in the derived programs are traded by highorder definitions, using a well-known program transformation technique. We finally obtain very efficient deforested programs. An important feature of our extensions is that they can beuniformly defined for a wide class of data types and monads, using generic calculation rules. ©2009 ACM.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Multiple intermediate structure deforestation by shortcut fusion (2016)
Article in International Scientific Journal
Pardo, A; Joao Paulo Fernandes; Saraiva, J
Memoized zipper-based attribute grammars and their higher order extension (2019)
Article in International Scientific Journal
Joao Paulo Fernandes; Martins, P; Pardo, A; Saraiva, J; Viera, M
Watch Out for that Tree! A Tutorial on Shortcut Deforestation (2015)
Article in International Conference Proceedings Book
Joao Paulo Fernandes; Cunha, J; Saraiva, J; Pardo, A
Shortcut fusion rules for the derivation of circular and higher-order programs (2011)
Article in International Conference Proceedings Book
Pardo, A; Joao Paulo Fernandes; Saraiva, J
Multiple intermediate structure deforestation by shortcut fusion (2013)
Article in International Conference Proceedings Book
Pardo, A; Joao Paulo Fernandes; Saraiva, J

See all (6)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-08-09 at 09:42:59 | Privacy Policy | Personal Data Protection Policy | Whistleblowing