Compiling pattern matching to good decision trees

@inproceedings{Maranget2008CompilingPM,
  title={Compiling pattern matching to good decision trees},
  author={Luc Maranget},
  booktitle={ML},
  year={2008}
}
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decision trees as dags with maximal sharing; (2) guiding a simple compiler with heuristics. We first design new heuristics that are inspired by necessity, a concept from lazy pattern matching that we rephrase in terms of decision tree semantics. Thereby, we simplify previous semantic frameworks and demonstrate a… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-7 of 7 references

The Why verification tool (v

Jean-Christophe Filliâtre
//why.lri.fr/, • 2008
View 7 Excerpts
Highly Influenced

Adaptive Pattern Matching

SIAM J. Comput. • 1995
View 5 Excerpts
Highly Influenced

Definition of standard ML

View 4 Excerpts
Highly Influenced

Compiling Pattern Matching

FPCA • 1985
View 5 Excerpts
Highly Influenced

Tree Pattern Matching for ML ( extended abstract )

Mariann e Baudine
1985
View 4 Excerpts
Highly Influenced

Lcf considered as a programming language

View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…