Pages that link to "Item:Q1239309"

The following pages link to Mechanizing \(\omega\)-order type theory through unification (Q1239309):

Displaying 23 items.

• On connections and higher-order logic (Q908896) (← links)
• Unification under a mixed prefix (Q1201348) (← links)
• A unification algorithm for typed \(\bar\lambda\)-calculus (Q1227601) (← links)
• A unification algorithm for typed \(\overline\lambda\)-calculus (Q1230505) (← links)
• A higher-order unification algorithm for inductive types and dependent types (Q1362142) (← links)
• Complete sets of unifiers and matchers in equational theories (Q1820760) (← links)
• Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
• The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
• Superposition for full higher-order logic (Q2055874) (← links)
• Higher-order unification via combinators (Q2367541) (← links)
• Decidability of bounded higher-order unification (Q2456577) (← links)
• Automatic theorem proving. II (Q3793764) (← links)
• Decidability of the unification problem for second-order languages with unary functional symbols (Q3885741) (← links)
• Completeness, invariance and <i>λ</i>-definability (Q3947643) (← links)
• (Q5028439) (← links)
• Linear second-order unification (Q5055871) (← links)
• The CADE-27 Automated theorem proving System Competition – CASC-27 (Q5145460) (← links)
• Superposition with lambdas (Q5918381) (← links)
• Making higher-order superposition work (Q5918403) (← links)
• Making higher-order superposition work (Q5918575) (← links)
• Superposition with lambdas (Q5919500) (← links)
• Superposition for higher-order logic (Q6156638) (← links)
• Representing unification in a logical framework (Q6560164) (← links)