The following pages link to (Q4944858):
Displaying 6 items.
- Automated techniques for provably safe mobile code. (Q1853627) (← links)
- Logical approximation for program analysis (Q1929363) (← links)
- Reducing higher-order theorem proving to a sequence of SAT problems (Q2351156) (← links)
- A canonical locally named representation of binding (Q2392482) (← links)
- Redundancy elimination for LF (Q2871840) (← links)
- Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (Q5200021) (← links)