On the Complexity of Higher-Order Matching in the Linear lambda-Calculus

Sylvain Salvati, Philippe de Groote. On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. In Robert Nieuwenhuis, editor, Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. Volume 2706 of Lecture Notes in Computer Science, pages 234-245, Springer, 2003. [doi]

@inproceedings{SalvatiG03,
  title = {On the Complexity of Higher-Order Matching in the Linear lambda-Calculus},
  author = {Sylvain Salvati and Philippe de Groote},
  year = {2003},
  url = {http://link.springer.de/link/service/series/0558/bibs/2706/27060234.htm},
  researchr = {https://researchr.org/publication/SalvatiG03},
  cites = {0},
  citedby = {0},
  pages = {234-245},
  booktitle = {Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings},
  editor = {Robert Nieuwenhuis},
  volume = {2706},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-40254-3},
}