Optimizing pattern matching compilation by program transformation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2006

Optimizing pattern matching compilation by program transformation

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.
Fichier principal
Vignette du fichier
paper.pdf (292.25 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00001127 , version 1 (21-02-2006)
inria-00001127 , version 2 (15-06-2006)

Identifiers

  • HAL Id : inria-00001127 , version 2

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More