Definition
A formal proof language, formerly called Coq, where the compiler refuses any proof that doesn't logically follow.
A dependently-typed proof assistant (renamed from Coq) supporting interactive theorem proving with the Admitted keyword for partial proofs; the verification substrate in the Inductive-Deductive Synthesis paper.