@INPROCEEDINGS{de_groote04b,
AUTHOR = {Philippe de Groote and Sylvain Salvati},
TITLE = {Higher-order Matching in the Linear lambda-calculus with Pairing},
BOOKTITLE = {{18th International Workshop on Computer Science Logic - CSL'2004, Karpacz, Poland}},
YEAR ={2004},
EDITOR = {Jerzy Marcinkowski, Andrzej Tarlecki},
VOLUME = {3210},
SERIES = {Lecture notes in Computer Science},
PAGES = {220-234},
MONTH ={Sep},
PUBLISHER = {Springer},
KEYWORDS = {matching, linear lambda-calculus, linear logic},
ABSTRACT = {We prove that higher-order matching in the linear $\lambda$-calculus with pairing is decidable. We also establish its NP-completeness under the assumption that the right-hand side of the equation to be solved is given in normal form.},
}