A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On the complexity of higher-order matching in the linear λ-calculus
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
A self-dependency constraint in the simply typed lambda calculus
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
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 |