Ordered and Unordered Tree Inclusion
SIAM Journal on Computing
Completion of rewrite systems with membership constraints. Part I: deduction rules
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Completion of rewrite systems with membership constraints. Part II: constraint solving
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Linear Higher-Order Matching Is NP-Complete
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Linear Second-Order Unification
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Higher-order unification and matching
Handbook of automated reasoning
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Higher-order beta matching with solutions in long beta-eta normal form
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Syntactic descriptions: a type system for solving matching equations in the linear λ-calculus
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We prove that linear second-order matching in the linear λ-calculus with linear occurrences of the unknowns is NP-complete. This result shows that context matching and second-order matching in the linear λ-calculus are, in fact, two different problems.