The following pages link to (Q5563103):
Displaying 4 items.
- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy (Q2117791) (← links)
- From realizability to induction via dependent intersection (Q2636522) (← links)
- Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach (Q4565827) (← links)
- Automath and Pure Type Systems (Q4924545) (← links)
