A simple proof of a theorem of Statman
Theoretical Computer Science
Proving termination with multiset orderings
Communications of the ACM
On Equivalence Classes of Interpolation Equations
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Decidability of All Minimal Models
TYPES '95 Selected papers from the International Workshop on Types for Proofs and Programs
Linear Interpolation for the Higher-Order Matching Problem
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Linear Higher-Order Matching Is NP-Complete
RTA '00 Proceedings of the 11th 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 Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
The "Hardest'' Natural Decidable Theory
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Decidability of fourth-order matching
Mathematical Structures in Computer Science
Decidability of Bounded Higher-Order Unification
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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
On the building of affine retractions
Mathematical Structures in Computer Science
Decidability of bounded higher-order unification
Journal of Symbolic Computation
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 game-theoretic approach to deciding higher-order matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
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
| Hi-index | 0.00 |
A lambda term is k-duplicating if every occurrence of a lambda abstractor binds at most k variable occurrences. We prove that the problem of higher order matching where solutions are required to be k-duplicating (but with no constraints on the problem instance itself) is decidable. We also show that the problem of higher order matching in the affine lambda calculus (where both the problem instance and the solutions are constrained to be 1-duplicating) is in NP, generalizing de Groote's result for the linear lambda calculus.