scientific article; zbMATH DE number 4037164

From MaRDI portal
Publication:3776597





[For the entire collection see Zbl 0625.00019.] Functional languages more and more include two important features, namely ``call-by-need evaluation strategy (lazyness) and ``pattern matching in order to use case defined functions. In all the already implemented functional language compilers, these two features are mutually incompatible. We give here a way to recognize if a pattern matching definition may be lazyly evaluated, and in such a case a way to compile it in a lazy system. The correction of the algorithms is fully established. These results are new when the patterns are allowed to overlap, with a priority to choose which one is to be selected. We introduce the new notion of ``minimally extended pattern which is the good one to study the lazy behaviour of a pattern matching definition. Using in a compiler the mechanisms introduced in this paper leads to a more compact code (with a gain of about 20 \%).





Describes a project that uses

Uses Software






This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776597)