On the complexity of higher-order matching in the linear $\lambda$-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

On the complexity of higher-order matching in the linear $\lambda$-calculus

Abstract

We prove that linear second-order matching in the linear $\lambda$-calculus with linear occurrences of the unknowns is NP-complete. This result shows that context matching and second-order matching in the linear $\lambda$-calculus are, in fact, two different problems.
No file

Dates and versions

inria-00099593 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00099593 , version 1

Cite

Sylvain Salvati, Philippe de Groote. On the complexity of higher-order matching in the linear $\lambda$-calculus. International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, pp.234-245. ⟨inria-00099593⟩
98 View
0 Download

Share

Gmail Facebook X LinkedIn More