Refined Compilation of Pattern-Matching for Functional Languages

Philippe Schnoebelen. Refined Compilation of Pattern-Matching for Functional Languages. In Jan Grabowski, Pierre Lescanne, Wolfgang Wechler, editors, International Workshop on Algebraic and Logic Programming. Volume 343 of Lecture Notes in Computer Science, pages 233-243, Springer, Gaussig, GDR, 1988. [doi]

Abstract

This paper formally describes and studies an algorithm for compiling functions defined through pattern-matching. This algorithm improves on previous proposals by accepting an additional parameter: the domain over which the compiled function will be applied. This additional parameter simplifies the definition of the algorithm and suggests new applications.

The practical interest of this algorithm for the implementation of functional languages is demonstrated by several applications and/or extensions: conditional rewriting, equations between constructors, …

Successor

The following is a more recent and up-to-date version of this publication: