Compiling Pattern Matching by Term Decomposition

Compiling Pattern Matching by Term Decomposition (1989)

by Laurence Puel , Ascander Suarez

Citations:

21 - 0 self

User correction supplied by Ascander

Datum	Value	Source
TITLE	Compiling Pattern Matching by Term Decomposition	user correction - Legacy Corrections
AUTHOR NAME	Laurence Puel	user correction
AUTHOR AFFIL	Publication Notes	user correction
AUTHOR NAME	Ascander Suarez	user correction
ABSTRACT	We present a method for compiling pattern matching on lazy languages based on previous work by Laville and Huet-Levy. It consists of coding ambiguous linear sets of patterns using "Term Decomposition," and producing non ambiguous sets over terms with structural constraints on variables. The method can also be applied to strict languages giving a match algorithm that includes only unavoidable tests when such an algorithm exists.	user correction - Legacy Corrections
YEAR	1989	user correction - Legacy Corrections
CITATIONS	10 found	ParsCit 1.0