Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • 2
    $\begingroup$ Great answer! But, strictly, the prover we run on top of CakeML (which we call Candle) is based on HOL Light. And that version of the kernel is verified to the extent that Gödel's theorem permits. The tower is thus: SML (poly/ml) / HOL4 / CakeML / Candle (HOL Light-ish) $\endgroup$ Commented Feb 19 at 23:00
  • 1
    $\begingroup$ Re the right tool for the job: it is not just parsers and interpreters, a lot of what happens in proof assistant implementation is manipulation of very structured data, aka algebraic datatypes, such as ASTs. These constructs were historically only available in functional languages (along with good pattern-matching, which is necessary to manipulate these structures easily). $\endgroup$ Commented Feb 20 at 10:21