ML pattern match compilation and partial evaluation

ML pattern match compilation and partial evaluation (1996)

by Peter Sestoft

Citations:

10 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	ML pattern match compilation and partial evaluation	user correction - Legacy Corrections
AUTHOR NAME	Peter Sestoft	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Mathematics and Physics; Royal Veterinary and Agricultural University	SVM HeaderParse 0.2
AUTHOR ADDR	Thorvaldsensvej 40, DK-1871 Frederiksberg C, Denmark	SVM HeaderParse 0.1
ABSTRACT	: We derive a compiler for ML-style pattern matches. It is conceptually simple and produces reasonably good compiled matches. The derivation is inspired by the instrumentation and partial evaluation of naive string matchers. Following that paradigm, we first present a general and naive ML pattern matcher, instrument it to collect and exploit extra information, and show that partial evaluation of the instrumented general matcher with respect to a given match produces an efficient specialized matcher. We then discard the partial evaluator and show that a match compiler can be obtained just by slightly modifying the instrumented general matcher. The resulting match compiler is interesting in its own right, and naturally detects inexhaustive matches and redundant match rules. 1 Introduction Consel and Danvy [3] studied a general string matcher, taking two inputs: a pattern string to look for, and an object string to look in. The matcher finds the first occurrence (if any) of the pattern ...	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
CITATIONS	21 found	ParsCit 1.0