Two Techniques for Compiling Lazy Pattern Matching

Two Techniques for Compiling Lazy Pattern Matching (1994)

Cached

Download Links

by Luc Maranget , Luc Maranget , Projet Para

Citations:

10 - 1 self

Versions

Version History

Metadata Version 4

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Two Techniques for Compiling Lazy Pattern Matching	user correction - Legacy Corrections
AUTHOR NAME	Luc Maranget	SVM HeaderParse 0.1
AUTHOR ADDR	Programme 2--- Calcul symbolique, programmation et g'enie logiciel	SVM HeaderParse 0.2
AUTHOR NAME	Luc Maranget	SVM HeaderParse 0.1
AUTHOR ADDR	Programme 2--- Calcul symbolique, programmation et g'enie logiciel	SVM HeaderParse 0.1
AUTHOR NAME	Projet Para	SVM HeaderParse 0.1
AUTHOR ADDR	Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex (France); T'el'ephone: (33 1) 39 63 55 11-- T'el'ecopie: (33 1) 39 63 53	SVM HeaderParse 0.1
ABSTRACT	In ML style pattern matching, pattern size is not constrained and ambiguous patterns are allowed. This generality leads to a clear and concise programming style but is challenging in the context of lazy evaluation. A first challenge concerns language designers: in lazy ML, the evaluation order of expressions follows actual data dependencies. That is, only the computations that are needed to produce the final result are performed. Once given a proper (that is, non-ambiguous) semantics, pattern matching should be compiled in a similar spirit: any value matching a given pattern should be recognized by performing only the minimal number of elementary tests needed to do so. This challenge was first met by A. Laville. A second challenge concerns compiler designers. As it stands, Laville's compilation algorithm cannot be incorporated in an actual lazy ML compiler for efficiency and completeness reasons. As a matter of fact, Laville's original algorithm did not fully treat the case of intege...	user correction - Legacy Corrections
YEAR	1994	SVM HeaderParse 0.1
VENUE TYPE	TECHREPORT	INFERENCE
TECH	Technical Report 2385, INRIA	INFERENCE
CITATIONS	21 found	ParsCit 1.0