Matt Kaufmann (UT Austin) |
We present a tool that automates termination proofs for recursive definitions by mining existing termination theorems. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.280.12 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |