The following pages link to Resolution in type theory (Q5638281):
Displayed 28 items.
- TPS: A hybrid automatic-interactive system for developing proofs (Q865629) (← links)
- On connections and higher-order logic (Q908896) (← links)
- Combined reasoning by automated cooperation (Q946572) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- A compact representation of proofs (Q1102282) (← links)
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) (← links)
- Unification theory (Q1124375) (← links)
- lambda-normal forms in an intensional logic for English (Q1150588) (← 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)
- Mechanizing \(\omega\)-order type theory through unification (Q1239309) (← links)
- A semantics for \(\lambda \)Prolog (Q1349686) (← links)
- Theorem proving modulo (Q1431339) (← links)
- Typing and computational properties of lambda expressions (Q1819575) (← links)
- On the logic of unification (Q1823935) (← links)
- Higher-order unification revisited: Complete sets of transformations (Q1823936) (← links)
- The linked conjunct method for automatic deduction and related search techniques (Q1836998) (← links)
- The completeness theorem for typing lambda-terms (Q1839242) (← links)
- Higher order unification via explicit substitutions (Q1854337) (← links)
- TPS: A theorem-proving system for classical type theory (Q1923825) (← links)
- A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (Q3540178) (← links)
- A Clausal Approach to Proof Analysis in Second-Order Logic (Q3605531) (← links)
- Annual Meeting of the Association for Symbolic Logic (Q3689157) (← links)
- Automatic theorem proving. II (Q3793764) (← links)
- A sequent calculus for type assignment (Q4147961) (← links)
- Upper bounds for standardizations and an application (Q4254636) (← links)
- General models, descriptions, and choice in type theory (Q5680122) (← links)