Optimization of Generic Pattern-Matching Compilation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Optimization of Generic Pattern-Matching Compilation

Résumé

Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed \tom: a pattern matching layer on top of conventional programming languages. The main originality is to support pattern matching against native data-structures like objects or records. While crucial to the efficient implementation of functional languages as well as rewrite rule based languages, in our case, this combination of algebraic constructs with arbitrary native data-structures makes the pattern matching algorithm more difficult to compile. In particular, well-known many-to-one automaton-based techniques cannot be used. We present a two-stages approaches which first compiles pattern matching constructs in a naive way, and then optimize the resulting code by program transformation using rewriting. As a benefit, the compilation algorithm is simpler, easier to extend, and the resulting pattern matching code is almost as efficient as best known implementations.
Fichier principal
Vignette du fichier
submitted-paper.pdf (229.23 Ko) Télécharger le fichier

Dates et versions

inria-00000763 , version 1 (17-11-2005)
inria-00000763 , version 2 (06-03-2006)
inria-00000763 , version 3 (15-06-2006)

Identifiants

  • HAL Id : inria-00000763 , version 1

Citer

Emilie Balland, Pierre-Etienne Moreau. Optimization of Generic Pattern-Matching Compilation. AMAST, Jul 2006, Kuressaare, Estonia. ⟨inria-00000763v1⟩
172 Consultations
246 Téléchargements

Partager

Gmail Facebook X LinkedIn More