Modal and temporal properties of processes
Modal and temporal properties of processes
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
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th 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
Complexity of the higher order matching
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Decidability of fourth-order matching
Mathematical Structures in Computer Science
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
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
On the building of affine retractions
Mathematical Structures in Computer Science
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Recognizability in the Simply Typed Lambda-Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
| Hi-index | 0.00 |
We sketch a proof using a game-theoretic argument that the higher-order matching problem is decidable