Pages that link to "Item:Q2708310"
From MaRDI portal
The following pages link to Theorem proving for untyped constructive \(\lambda\)-calculus: Implementation and application (Q2708310):
Displaying 10 items.
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus (Q672060) (← links)
- Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves (Q673628) (← links)
- Mechanical procedure for proof construction via closed terms in typed \(\lambda\) calculus (Q751646) (← links)
- On connections and higher-order logic (Q908896) (← links)
- Delaying unification algorithms for lambda calculi (Q1104776) (← links)
- The calculus of constructions as a framework for proof search with set variable instantiation (Q1575927) (← links)
- Theorem proving for intensional logic (Q1891256) (← links)
- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic (Q3586061) (← links)
- Formal SOS-Proofs for the Lambda-Calculus (Q5178966) (← links)
- (Q5195246) (← links)