The following pages link to (Q5688890):
Displaying 5 items.
- Termination of floating-point computations (Q850498) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Norms on terms and their use in proving universal termination of a logic program (Q1318707) (← links)
- Automated modular termination proofs for real Prolog programs (Q5030196) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
