Pages that link to "Item:Q4795875"
From MaRDI portal
The following pages link to Higher Order Matching is Undecidable (Q4795875):
Displaying 11 items.
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- The undecidability of pattern matching in calculi where primitive recursive functions are representable (Q1208421) (← links)
- Third order matching is decidable (Q1337691) (← links)
- Decidability of bounded higher-order unification (Q2456577) (← links)
- Model-checking games for typed \(\lambda\)-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)
- Recognizability in the Simply Typed Lambda-Calculus (Q3638274) (← links)
- Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them (Q4911148) (← links)
- Computer Science Logic (Q5311258) (← links)
- Automated Deduction – CADE-19 (Q5900735) (← links)