The following pages link to (Q4023458):
Displaying 13 items.
- Improving automation for higher-order proof steps (Q831930) (← links)
- On proving the termination of algorithms by machine (Q1341666) (← links)
- Automatizing termination proofs of recursively defined functions (Q1346629) (← links)
- AN EXTENSION OF AN AUTOMATED TERMINATION METHOD OF RECURSIVE FUNCTIONS (Q3021959) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- (Q4501582) (← links)
- Termination of theorem proving by reuse (Q4647503) (← links)
- Termination of algorithms over non-freely generated data types (Q4647505) (← links)
- Automated modular termination proofs for real Prolog programs (Q5030196) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- How to make ad hoc proof automation less ad hoc (Q5176973) (← links)
- A higher-order interpretation of deductive tableau (Q5938542) (← links)