mirror of
https://github.com/c-cube/sidekick.git
synced 2026-01-28 04:14:50 -05:00
8 lines
No EOL
3.2 KiB
HTML
8 lines
No EOL
3.2 KiB
HTML
<!DOCTYPE html>
|
|
<html xmlns="http://www.w3.org/1999/xhtml"><head><title>2-A (sidekick.Sidekick_backend__Coq.Simple.2-A)</title><link rel="stylesheet" href="../../../../odoc.css"/><meta charset="utf-8"/><meta name="viewport" content="width=device-width,initial-scale=1.0"/><meta name="generator" content="doc-ock-html v1.0.0-1-g1fc9bf0"/></head><body><nav id="top"><a href="../index.html">Up</a> — <span class="package">package <a href="../../../index.html">sidekick</a></span></nav><header><h1><span class="keyword">Parameter</span> <span class="module-path">Sidekick_backend__Coq.Simple.2-A</span></h1></header><p>Term printing for Coq</p><div class="spec type" id="type-hyp"><a href="#type-hyp" class="anchor"></a><div class="def type"><code><span class="keyword">type </span>hyp</code><code><span class="keyword"> = </span><a href="../argument-1-S/index.html#type-formula">S.formula</a> list</code><code></code></div><div class="doc"></div></div><div class="spec type" id="type-lemma"><a href="#type-lemma" class="anchor"></a><div class="def type"><code><span class="keyword">type </span>lemma</code><code></code><code></code></div><div class="doc"></div></div><div class="spec type" id="type-assumption"><a href="#type-assumption" class="anchor"></a><div class="def type"><code><span class="keyword">type </span>assumption</code><code></code><code></code></div><div class="doc"><p>The types of hypotheses, lemmas, and assumptions</p></div></div><div class="spec val" id="val-prove_hyp"><a href="#val-prove_hyp" class="anchor"></a><div class="def val"><code><span class="keyword">val </span>prove_hyp : Format.formatter <span class="keyword">‑></span> string <span class="keyword">‑></span> <a href="index.html#type-hyp">hyp</a> <span class="keyword">‑></span> unit</code></div><div class="doc"></div></div><div class="spec val" id="val-prove_lemma"><a href="#val-prove_lemma" class="anchor"></a><div class="def val"><code><span class="keyword">val </span>prove_lemma : Format.formatter <span class="keyword">‑></span> string <span class="keyword">‑></span> <a href="index.html#type-lemma">lemma</a> <span class="keyword">‑></span> unit</code></div><div class="doc"></div></div><div class="spec val" id="val-prove_assumption"><a href="#val-prove_assumption" class="anchor"></a><div class="def val"><code><span class="keyword">val </span>prove_assumption : Format.formatter <span class="keyword">‑></span> string <span class="keyword">‑></span> <a href="index.html#type-assumption">assumption</a> <span class="keyword">‑></span> unit</code></div><div class="doc"><p>Proving function for hypotheses, lemmas and assumptions.
|
|
<code class="code">prove_x fmt name x</code> should prove <code class="code">x</code>, and be such that after
|
|
executing it, <code class="code">x</code> is among the coq hypotheses under the name <code class="code">name</code>.
|
|
The hypothesis should be the encoding of the given clause, i.e
|
|
for a clause <code class="code">a \/ not b \/ c</code>, the proved hypothesis should be:
|
|
<code class="code"> ~ a -> ~ ~ b -> ~ c -> False </code>, keeping the same order as the
|
|
one in the atoms array of the clause.</p></div></div></body></html> |