HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Optimizing pattern matching compilation by program transformation

Emilie Balland 1 Pierre-Etienne Moreau 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we present a new compilation method based on program transformation. The principle is to separate the compilation of pattern matching from its optimization, and describe optimizations using transformation rules. This eases the compilation of extensions, such as new equational theories, or the addition of or-patterns for example. In addition, we show that the proposed optimizations are correct and effective in practice. The presented approach has been implemented and applied to Tom, a language extension which adds pattern-matching facilities to C and Java.
Document type :
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

Contributor : Emilie Balland Connect in order to contact the contributor
Submitted on : Thursday, June 15, 2006 - 4:05:15 PM
Last modification on : Friday, February 4, 2022 - 3:31:53 AM
Long-term archiving on: : Friday, November 25, 2016 - 11:13:39 AM


  • HAL Id : inria-00001127, version 2



Emilie Balland, Pierre-Etienne Moreau. Optimizing pattern matching compilation by program transformation. [Technical Report] 2006, pp.19. ⟨inria-00001127v2⟩



Record views


Files downloads