Abstract
In the context of functional programming, semantic methods are commonly used to drive program transformations. However, classical semantic domains often rely on recursive objects which embed the control flow of recursive functions. As a consequence, transformations which have to modify the control flow are difficult to define. We propose in this paper a new semantic domain where the control flow is defined implicitly, and thus can be modified. This new theoretical and practical framework allows to homogeneously define and extend powerful transformations related to partial evaluation and deforestation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Loîc Correnson, Etienne Duris, Didier Parigot, and Gilles Roussel. Symbolic composition. Technical Report 3348, INRIA, January 1998.
Loic Correnson. Equational Semantics. In D. Parigot and M. Mernik, editors, Second Workshop on Attribute Grammars and their Applications, WAGA’99, pages 205–222, Amsterdam, The Netherlands, March 1999. INRIA rocquencourt.
Etienne Duris. Contribution aux relations entre les grammaires attribuées et la programmation fonctionnelle. PhD thesis, Universit’e d’Orléans, 1998.
Leonidas Fegaras, Tim Sheard, and Tong Zhou. Improving programs which recurse over multiple inductive structures. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM’94), pages 21–32, Orlando, Florida, June 1994.
John Launchbury and Tim Sheard. Warm fusion: Deriving build-cata’s from recursive definitions. In Conf. on Func. Prog. Languages and Computer Architecture, pages 314–323, La Jolla, CA, USA, 1995. ACM Press.
E. Meijer, M. M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In Conf. on Functional Programming and Computer Architecture (FPCA’91), volume 523 of Lect. Notes in Comp. Sci., pages 124–144, Cambridge, September 1991. Springer-Verlag.
Y. Onoue, Z. Hu, H. Iwasaki, and M. Takeichi. A calculational fusion system HYLO. In Proc. IFIP TC 2 Working Conference on Algorithmic Languages and Calculi, Le Bischenberg, France, February 1997.
Tim Sheard. A type-directed, on-line partial evaluator for a polymorphic language. In ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation PEPM’ 97. ACM press, 1997.
Tim Sheard and Leonidas Fegaras. A fold for all seasons. In Conf. on Functional Programming and Computer Architecture (FPCA’93), pages 233–242, Copenhagen, Denmark, June 1993. ACM Press.
Akihiko Takano and Erik Meijer. Shortcut deforestation in calculational form. In Conf. on Func. Prog. Languages and Computer Architecture, pages 306–313, La Jolla, CA, USA, 1995. ACM Press.
Philip Wadler. Deforestation: Transforming Programs to Eliminate Trees. In Harald Ganzinger, editor, European Symposium on Programming (ESOP’ 88), volume 300 of Lect. Notes in Comp. Sci., pages 344–358, Nancy, March 1988. Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correnson, L., Duris, E., Parigot, D., Roussel, G. (1999). Equational Semantics. In: Cortesi, A., Filé, G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48294-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-48294-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66459-8
Online ISBN: 978-3-540-48294-9
eBook Packages: Springer Book Archive