An automatic theorem prover in OCaml for typed higher-order logic with equality and datatypes, based on superposition+rewriting; and Logtk, a supporting library for manipulating terms, formulas, clauses, etc.
prototype experimental ocaml computer-science-algorithms logic polymorphism cnf superposition saturation induction symbolic-computation prover rewriting
-
Updated
Oct 14, 2024 - OCaml