An implementation of the mugda paper
-
Updated
May 2, 2024 - TypeScript
An implementation of the mugda paper
OCaml module of Nijn to generate coq scripts for checking termination proofs of higher-order rewriting systems.
Add a description, image, and links to the termination-checking topic page so that developers can more easily learn about it.
To associate your repository with the termination-checking topic, visit your repo's landing page and select "manage topics."