An implementation of the mugda paper
-
Updated
Jul 20, 2025 - TypeScript
#
termination-checking
Here are 3 public repositories matching this topic...
An s-expression language pairing Kernel-style dynamism with static types: restricted dependent types, erased/many/unique multiplicities, termination checking, memory location tracking, and LLMs as intended authors. Self-hosts to OCaml.
programming-language dependent-types lisp interpreter compiler ocaml metaprogramming macros type-theory language-design s-expressions bootstrapping formal-verification certified-programming type-systems lean4 llm termination-checking
-
Updated
Oct 22, 2026 - Scheme
OCaml module of Nijn to generate coq scripts for checking termination proofs of higher-order rewriting systems.
-
Updated
Jul 7, 2025 - OCaml
Add this topic to your repo
To associate your repository with the termination-checking topic, visit your repo's landing page and select "manage topics."