/usr/share/doc/libaac-tactics-ocaml-dev/html/api/Theory.Stubs.html is in libaac-tactics-ocaml-dev 8.6.1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<link rel="stylesheet" href="style.css" type="text/css">
<meta content="text/html; charset=iso-8859-1" http-equiv="Content-Type">
<link rel="Start" href="index.html">
<link rel="previous" href="Theory.Sym.html">
<link rel="next" href="Theory.Trans.html">
<link rel="Up" href="Theory.html">
<link title="Index of types" rel=Appendix href="index_types.html">
<link title="Index of values" rel=Appendix href="index_values.html">
<link title="Index of modules" rel=Appendix href="index_modules.html">
<link title="Index of module types" rel=Appendix href="index_module_types.html">
<link title="Aac_rewrite" rel="Chapter" href="Aac_rewrite.html">
<link title="Coq" rel="Chapter" href="Coq.html">
<link title="Helper" rel="Chapter" href="Helper.html">
<link title="Matcher" rel="Chapter" href="Matcher.html">
<link title="Print" rel="Chapter" href="Print.html">
<link title="Search_monad" rel="Chapter" href="Search_monad.html">
<link title="Theory" rel="Chapter" href="Theory.html"><title>Theory.Stubs</title>
</head>
<body>
<div class="navbar"><a class="pre" href="Theory.Sym.html" title="Theory.Sym">Previous</a>
<a class="up" href="Theory.html" title="Theory">Up</a>
<a class="post" href="Theory.Trans.html" title="Theory.Trans">Next</a>
</div>
<h1>Module <a href="type_Theory.Stubs.html">Theory.Stubs</a></h1>
<pre><span class="keyword">module</span> Stubs: <code class="code">sig</code> <a href="Theory.Stubs.html">..</a> <code class="code">end</code></pre><div class="info module top">
We need to export some Coq stubs out of this module. They are used
by the main tactic, see <code class="code">Rewrite</code><br>
</div>
<hr width="100%">
<pre><span id="VALlift"><span class="keyword">val</span> lift</span> : <code class="type">Term.constr Lazy.t</code></pre>
<pre><span id="VALlift_proj_equivalence"><span class="keyword">val</span> lift_proj_equivalence</span> : <code class="type">Term.constr Lazy.t</code></pre>
<pre><span id="VALlift_transitivity_left"><span class="keyword">val</span> lift_transitivity_left</span> : <code class="type">Term.constr Lazy.t</code></pre>
<pre><span id="VALlift_transitivity_right"><span class="keyword">val</span> lift_transitivity_right</span> : <code class="type">Term.constr Lazy.t</code></pre>
<pre><span id="VALlift_reflexivity"><span class="keyword">val</span> lift_reflexivity</span> : <code class="type">Term.constr Lazy.t</code></pre><div class="info ">
The evaluation fonction, used to convert a reified coq term to a
raw coq term<br>
</div>
<pre><span id="VALeval"><span class="keyword">val</span> eval</span> : <code class="type">Term.constr lazy_t</code></pre>
<pre><span id="VALdecide_thm"><span class="keyword">val</span> decide_thm</span> : <code class="type">Term.constr lazy_t</code></pre><div class="info ">
The main lemma of our theory, that is
<code class="code">compare (norm u) (norm v) = Eq -> eval u == eval v</code><br>
</div>
<pre><span id="VALlift_normalise_thm"><span class="keyword">val</span> lift_normalise_thm</span> : <code class="type">Term.constr lazy_t</code></pre></body></html>
|