/usr/share/doc/libaac-tactics-ocaml-dev/html/api/index_modules.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 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 | <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 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>Index of modules</title>
</head>
<body>
<div class="navbar"> <a class="up" href="index.html" title="Index">Up</a>
</div>
<h1>Index of modules</h1>
<table>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="Aac_rewrite.html">Aac_rewrite</a> </td>
<td><div class="info">
Definition of the tactics, and corresponding Coq grammar entries.
</div>
</td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Coq.Bool.html">Bool</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Coq.Classes.html">Classes</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
Coq typeclasses
</div>
</td></tr>
<tr><td><a href="Coq.Comparison.html">Comparison</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html">Coq</a> </td>
<td><div class="info">
Interface with Coq where we define some handlers for Coq's API,
and we import several definitions from Coq's standard library.
</div>
</td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Helper.Debug.html">Debug</a> [<a href="Helper.html">Helper</a>]</td>
<td></td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Coq.Equivalence.html">Equivalence</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>H</td></tr>
<tr><td><a href="Helper.html">Helper</a> </td>
<td><div class="info">
Debugging functions, that can be triggered on a per-file base.
</div>
</td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="Coq.Leibniz.html">Leibniz</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.List.html">List</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
Coq lists
</div>
</td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="Matcher.html">Matcher</a> </td>
<td><div class="info">
Standalone module containing the algorithm for matching modulo
associativity and associativity and commutativity
(AAC).
</div>
</td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="Coq.Nat.html">Nat</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
Coq unary numbers (peano)
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Coq.Option.html">Option</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="Coq.Pair.html">Pair</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
Coq pairs
</div>
</td></tr>
<tr><td><a href="Coq.Pos.html">Pos</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
Coq positive numbers (pos)
</div>
</td></tr>
<tr><td><a href="Print.html">Print</a> </td>
<td><div class="info">
Pretty printing functions we use for the aac_instances
tactic.
</div>
</td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Coq.Relation.html">Relation</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Rewrite.html">Rewrite</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Search_monad.html">Search_monad</a> </td>
<td><div class="info">
Search monad that allows to express non-deterministic algorithms
in a legible maner, or programs that solve combinatorial problems.
</div>
</td></tr>
<tr><td><a href="Theory.Sigma.html">Sigma</a> [<a href="Theory.html">Theory</a>]</td>
<td><div class="info">
Environments
</div>
</td></tr>
<tr><td><a href="Theory.Stubs.html">Stubs</a> [<a href="Theory.html">Theory</a>]</td>
<td><div class="info">
We need to export some Coq stubs out of this module.
</div>
</td></tr>
<tr><td><a href="Matcher.Subst.html">Subst</a> [<a href="Matcher.html">Matcher</a>]</td>
<td><div class="info">
Substitutions (or environments)
</div>
</td></tr>
<tr><td><a href="Theory.Sym.html">Sym</a> [<a href="Theory.html">Theory</a>]</td>
<td><div class="info">
Dynamically typed morphisms
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Matcher.Terms.html">Terms</a> [<a href="Matcher.html">Matcher</a>]</td>
<td><div class="info">
Representations of expressions
</div>
</td></tr>
<tr><td><a href="Theory.html">Theory</a> </td>
<td><div class="info">
Bindings for Coq constants that are specific to the plugin;
reification and translation functions.
</div>
</td></tr>
<tr><td><a href="Theory.Trans.html">Trans</a> [<a href="Theory.html">Theory</a>]</td>
<td><div class="info">
Tranlations between Coq and OCaml
</div>
</td></tr>
<tr><td><a href="Coq.Transitive.html">Transitive</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
</table>
</body>
</html>
|