The following pages link to (Q4012884):
Displaying 8 items.
- Using typed lambda calculus to implement formal systems on a machine (Q688571) (← links)
- Permutability of proofs in intuitionistic sequent calculi (Q1275625) (← links)
- On the intuitionistic force of classical search (Q1575923) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
- On the intuitionistic force of classical search (Extended abstract) (Q4645244) (← links)
- Proof-terms for classical and intuitionistic resolution (Q4647497) (← links)
- Representing unification in a logical framework (Q6560164) (← links)
