The following pages link to Third order matching is decidable (Q1337691):
Displaying 12 items.
- On the undecidability of second-order unification (Q1854349) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Nominal syntax with atom substitutions (Q2662669) (← links)
- Model-Checking Games for Typed λ-Calculi (Q2864164) (← links)
- The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL (Q2900507) (← links)
- Unification for $$\lambda $$ -calculi Without Propagation Rules (Q3179400) (← links)
- The variable containment problem (Q4645807) (← links)
- Third-order matching in the polymorphic lambda calculus (Q4645813) (← links)
- Decidability of all minimal models (Q4647581) (← links)
- Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them (Q4911148) (← links)
- Decidable higher-order unification problems (Q5210802) (← links)
- A colored version of the λ-calculus (Q5234713) (← links)
