Pages that link to "Item:Q1854349"

The following pages link to On the undecidability of second-order unification (Q1854349):

Displaying 22 items.

• The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types (Q690505) (← links)
• Simple second-order languages for which unification is undecidable (Q807609) (← links)
• Simplifying the signature in second-order unification (Q843951) (← links)
• The undecidability of the unification and matching problem for canonical theories (Q1077931) (← links)
• A note on a canonical theory with undecidable unification and matching problem (Q1098623) (← links)
• The undecidability of the second-order unification problem (Q1150586) (← links)
• The unification hierarchy is undecidable (Q1181721) (← links)
• The subtyping problem for second-order types is undecidable. (Q1400717) (← links)
• Solvability of context equations with two context variables is decidable (Q1599536) (← links)
• Farmer's theorem revisited (Q1607046) (← links)
• \(\forall \exists^{5}\)-equational theory of context unification is undecidable (Q1607219) (← links)
• Decidability of bounded second order unification (Q1887168) (← links)
• Decidability of bounded higher-order unification (Q2456577) (← links)
• Tractable and intractable second-order matching problems (Q2643530) (← links)
• Nominal syntax with atom substitutions (Q2662669) (← links)
• The undecidability of the D_A-unification problem (Q3478395) (← links)
• Bounded Second-Order Unification Is NP-Complete (Q3527311) (← links)
• The Existential Fragment of the One-Step Parallel Rewriting Theory (Q3636820) (← links)
• Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
• Nominal Unification and Matching of Higher Order Expressions with Recursive Let (Q5075515) (← links)
• In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming (Q5108530) (← links)
• Nominal Unification from a Higher-Order Perspective (Q5892169) (← links)