libaac-tactics-ocaml-dev 8.6.1-1 / usr / share / doc / libaac-tactics-ocaml-dev / html / api / index_values.html

This file is indexed.

/usr/share/doc/libaac-tactics-ocaml-dev/html/api/index_values.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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
<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 values</title>
</head>
<body>
<div class="navbar">&nbsp;<a class="up" href="index.html" title="Index">Up</a>
&nbsp;</div>
<h1>Index of values</h1>
<table>
<tr><td align="left"><br></td></tr>
<tr><td><a href="Search_monad.html#VAL(>>)">(&gt;&gt;)</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td><div class="info">
bind and return
</div>
</td></tr>
<tr><td><a href="Search_monad.html#VAL(>>|)">(&gt;&gt;|)</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td><div class="info">
non-deterministic choice
</div>
</td></tr>
<tr><td align="left"><br>A</td></tr>
<tr><td><a href="Theory.Sigma.html#VALadd">add</a> [<a href="Theory.Sigma.html">Theory.Sigma</a>]</td>
<td><div class="info">
<code class="code">add ty n x map</code> adds the value <code class="code">x</code> of type <code class="code">ty</code> with key <code class="code">n</code> in <code class="code">map</code>
</div>
</td></tr>
<tr><td><a href="Theory.Trans.html#VALadd_symbol">add_symbol</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td><div class="info">
<code class="code">add_symbol</code> adds a given binary symbol to the environment of
      known stuff.
</div>
</td></tr>
<tr><td><a href="Coq.html#VALanomaly">anomaly</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>B</td></tr>
<tr><td><a href="Coq.Rewrite.html#VALbuild">build</a> [<a href="Coq.Rewrite.html">Coq.Rewrite</a>]</td>
<td><div class="info">
build the constr to rewrite, in CPS style, with lambda abstractions
</div>
</td></tr>
<tr><td><a href="Coq.Rewrite.html#VALbuild_with_evar">build_with_evar</a> [<a href="Coq.Rewrite.html">Coq.Rewrite</a>]</td>
<td><div class="info">
build the constr to rewrite, in CPS style, with evars
</div>
</td></tr>
<tr><td align="left"><br>C</td></tr>
<tr><td><a href="Search_monad.html#VALchoose">choose</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Search_monad.html#VALcount">count</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALcps_evar_relation">cps_evar_relation</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
<code class="code">cps_mk_letin name v</code> binds the constr <code class="code">v</code> using a letin tactic
</div>
</td></tr>
<tr><td><a href="Coq.Equivalence.html#VALcps_from_relation">cps_from_relation</a> [<a href="Coq.Equivalence.html">Coq.Equivalence</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Transitive.html#VALcps_from_relation">cps_from_relation</a> [<a href="Coq.Transitive.html">Coq.Transitive</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALcps_mk_letin">cps_mk_letin</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALcps_resolve_one_typeclass">cps_resolve_one_typeclass</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>D</td></tr>
<tr><td><a href="Helper.CONTROL.html#VALdebug">debug</a> [<a href="Helper.CONTROL.html">Helper.CONTROL</a>]</td>
<td></td></tr>
<tr><td><a href="Helper.Debug.html#VALdebug">debug</a> [<a href="Helper.Debug.html">Helper.Debug</a>]</td>
<td><div class="info">
<code class="code">debug</code> prints the string and end it with a newline
</div>
</td></tr>
<tr><td><a href="Helper.Debug.html#VALdebug_exception">debug_exception</a> [<a href="Helper.Debug.html">Helper.Debug</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Stubs.html#VALdecide_thm">decide_thm</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td><div class="info">
The main lemma of our theory, that is
      <code class="code">compare (norm u) (norm v) = Eq -&gt; eval u == eval v</code>
</div>
</td></tr>
<tr><td><a href="Coq.html#VALdecomp_term">decomp_term</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>E</td></tr>
<tr><td><a href="Theory.Sigma.html#VALempty">empty</a> [<a href="Theory.Sigma.html">Theory.Sigma</a>]</td>
<td><div class="info">
<code class="code">empty ty</code> create an empty map of type <code class="code">ty</code>
</div>
</td></tr>
<tr><td><a href="Theory.Trans.html#VALempty_envs">empty_envs</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Comparison.html#VALeq">eq</a> [<a href="Coq.Comparison.html">Coq.Comparison</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Leibniz.html#VALeq_refl">eq_refl</a> [<a href="Coq.Leibniz.html">Coq.Leibniz</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Terms.html#VALequal_aac">equal_aac</a> [<a href="Matcher.Terms.html">Matcher.Terms</a>]</td>
<td><div class="info">
Test for equality of terms modulo AACU (relies on the following
      canonical representation of terms).
</div>
</td></tr>
<tr><td><a href="Theory.Stubs.html#VALeval">eval</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALevar_binary">evar_binary</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALevar_relation">evar_relation</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALevar_unit">evar_unit</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>F</td></tr>
<tr><td><a href="Search_monad.html#VALfail">fail</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td><div class="info">
failure
</div>
</td></tr>
<tr><td><a href="Search_monad.html#VALfilter">filter</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Search_monad.html#VALfold">fold</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td><div class="info">
folding through the collection
</div>
</td></tr>
<tr><td><a href="Coq.html#VALfresh_evar">fresh_evar</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Equivalence.html#VALfrom_relation">from_relation</a> [<a href="Coq.Equivalence.html">Coq.Equivalence</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Transitive.html#VALfrom_relation">from_relation</a> [<a href="Coq.Transitive.html">Coq.Transitive</a>]</td>
<td></td></tr>
<tr><td align="left"><br>G</td></tr>
<tr><td><a href="Coq.Rewrite.html#VALget_hypinfo">get_hypinfo</a> [<a href="Coq.Rewrite.html">Coq.Rewrite</a>]</td>
<td><div class="info">
<code class="code">get_hypinfo H l2r ?check_type k</code> analyse the hypothesis H, and
    build the related hypinfo, in CPS style.
</div>
</td></tr>
<tr><td><a href="Coq.html#VALgoal_update">goal_update</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Comparison.html#VALgt">gt</a> [<a href="Coq.Comparison.html">Coq.Comparison</a>]</td>
<td></td></tr>
<tr><td align="left"><br>I</td></tr>
<tr><td><a href="Coq.Equivalence.html#VALinfer">infer</a> [<a href="Coq.Equivalence.html">Coq.Equivalence</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Transitive.html#VALinfer">infer</a> [<a href="Coq.Transitive.html">Coq.Transitive</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALinit_constant">init_constant</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Subst.html#VALinstantiate">instantiate</a> [<a href="Matcher.Subst.html">Matcher.Subst</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Trans.html#VALir_of_envs">ir_of_envs</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Trans.html#VALir_to_units">ir_to_units</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td></td></tr>
<tr><td><a href="Search_monad.html#VALis_empty">is_empty</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td align="left"><br>L</td></tr>
<tr><td><a href="Coq.html#VALlapp">lapp</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Stubs.html#VALlift">lift</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Stubs.html#VALlift_normalise_thm">lift_normalise_thm</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Stubs.html#VALlift_proj_equivalence">lift_proj_equivalence</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Stubs.html#VALlift_reflexivity">lift_reflexivity</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td><div class="info">
The evaluation fonction, used to convert a reified coq term to a
	raw coq term
</div>
</td></tr>
<tr><td><a href="Theory.Stubs.html#VALlift_transitivity_left">lift_transitivity_left</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Stubs.html#VALlift_transitivity_right">lift_transitivity_right</a> [<a href="Theory.Stubs.html">Theory.Stubs</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.html#VALlinear">linear</a> [<a href="Matcher.html">Matcher</a>]</td>
<td><div class="info">
<code class="code">linear</code> expands a multiset into a simple list
</div>
</td></tr>
<tr><td><a href="Coq.Comparison.html#VALlt">lt</a> [<a href="Coq.Comparison.html">Coq.Comparison</a>]</td>
<td></td></tr>
<tr><td align="left"><br>M</td></tr>
<tr><td><a href="Coq.Equivalence.html#VALmake">make</a> [<a href="Coq.Equivalence.html">Coq.Equivalence</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Transitive.html#VALmake">make</a> [<a href="Coq.Transitive.html">Coq.Transitive</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Relation.html#VALmake">make</a> [<a href="Coq.Relation.html">Coq.Relation</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALmatch_as_equation">match_as_equation</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
<code class="code">match_as_equation ?context goal c</code> try to decompose c as a
    relation applied to two terms.
</div>
</td></tr>
<tr><td><a href="Matcher.html#VALmatcher">matcher</a> [<a href="Matcher.html">Matcher</a>]</td>
<td><div class="info">
<code class="code">matcher p t</code> computes the set of solutions to the given top-level
    matching problem (<code class="code">p</code> is the pattern, <code class="code">t</code> is the term).
</div>
</td></tr>
<tr><td><a href="Coq.Classes.html#VALmk_equivalence">mk_equivalence</a> [<a href="Coq.Classes.html">Coq.Classes</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Classes.html#VALmk_morphism">mk_morphism</a> [<a href="Coq.Classes.html">Coq.Classes</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.html#VALmk_mset">mk_mset</a> [<a href="Theory.html">Theory</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Sym.html#VALmk_pack">mk_pack</a> [<a href="Theory.Sym.html">Theory.Sym</a>]</td>
<td><div class="info">
<code class="code">mk_pack rlt (ar,value,morph)</code>
</div>
</td></tr>
<tr><td><a href="Coq.Classes.html#VALmk_reflexive">mk_reflexive</a> [<a href="Coq.Classes.html">Coq.Classes</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Trans.html#VALmk_reifier">mk_reifier</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Classes.html#VALmk_transitive">mk_transitive</a> [<a href="Coq.Classes.html">Coq.Classes</a>]</td>
<td></td></tr>
<tr><td align="left"><br>N</td></tr>
<tr><td><a href="Matcher.Terms.html#VALnf_equal">nf_equal</a> [<a href="Matcher.Terms.html">Matcher.Terms</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALnf_evar">nf_evar</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Terms.html#VALnf_term_compare">nf_term_compare</a> [<a href="Matcher.Terms.html">Matcher.Terms</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Option.html#VALnone">none</a> [<a href="Coq.Option.html">Coq.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Sym.html#VALnull">null</a> [<a href="Theory.Sym.html">Theory.Sym</a>]</td>
<td><div class="info">
<code class="code">null</code> builds a dummy (identity) symbol, given an <a href="Coq.Relation.html#TYPEt"><code class="code">Coq.Relation.t</code></a>
</div>
</td></tr>
<tr><td align="left"><br>O</td></tr>
<tr><td><a href="Coq.Bool.html#VALof_bool">of_bool</a> [<a href="Coq.Bool.html">Coq.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Nat.html#VALof_int">of_int</a> [<a href="Coq.Nat.html">Coq.Nat</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Pos.html#VALof_int">of_int</a> [<a href="Coq.Pos.html">Coq.Pos</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Sigma.html#VALof_list">of_list</a> [<a href="Theory.Sigma.html">Theory.Sigma</a>]</td>
<td><div class="info">
<code class="code">of_list ty null l</code> translates an OCaml association list into a Coq one
</div>
</td></tr>
<tr><td><a href="Coq.List.html#VALof_list">of_list</a> [<a href="Coq.List.html">Coq.List</a>]</td>
<td><div class="info">
<code class="code">of_list ty l</code>
</div>
</td></tr>
<tr><td><a href="Coq.Option.html#VALof_option">of_option</a> [<a href="Coq.Option.html">Coq.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Pair.html#VALof_pair">of_pair</a> [<a href="Coq.Pair.html">Coq.Pair</a>]</td>
<td></td></tr>
<tr><td align="left"><br>P</td></tr>
<tr><td><a href="Coq.Pair.html#VALpair">pair</a> [<a href="Coq.Pair.html">Coq.Pair</a>]</td>
<td></td></tr>
<tr><td><a href="Helper.Debug.html#VALpr_constr">pr_constr</a> [<a href="Helper.Debug.html">Helper.Debug</a>]</td>
<td><div class="info">
<code class="code">pr_constr</code> print a Coq constructor, that can be labelled
      by a string
</div>
</td></tr>
<tr><td><a href="Print.html#VALprint">print</a> [<a href="Print.html">Print</a>]</td>
<td><div class="info">
The main printing function.
</div>
</td></tr>
<tr><td><a href="Helper.CONTROL.html#VALprinting">printing</a> [<a href="Helper.CONTROL.html">Helper.CONTROL</a>]</td>
<td></td></tr>
<tr><td align="left"><br>R</td></tr>
<tr><td><a href="Theory.Trans.html#VALraw_constr_of_t">raw_constr_of_t</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td><div class="info">
<code class="code">raw_constr_of_t</code> rebuilds a term in the raw representation, and
      reconstruct the named products on top of it.
</div>
</td></tr>
<tr><td><a href="Theory.Trans.html#VALreif_constr_of_t">reif_constr_of_t</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td><div class="info">
<code class="code">reif_constr_of_t  reifier t</code> rebuilds the term <code class="code">t</code> in the
      reified form.
</div>
</td></tr>
<tr><td><a href="Coq.html#VALresolve_one_typeclass">resolve_one_typeclass</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Search_monad.html#VALreturn">return</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALretype">retype</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Rewrite.html#VALrewrite">rewrite</a> [<a href="Coq.Rewrite.html">Coq.Rewrite</a>]</td>
<td><div class="info">
<code class="code">rewrite ?abort hypinfo subst</code> builds the rewriting tactic
    associated with the given <code class="code">subst</code> and <code class="code">hypinfo</code>, and feeds it to
    the given continuation.
</div>
</td></tr>
<tr><td align="left"><br>S</td></tr>
<tr><td><a href="Coq.Option.html#VALsome">some</a> [<a href="Coq.Option.html">Coq.Option</a>]</td>
<td></td></tr>
<tr><td><a href="Search_monad.html#VALsort">sort</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Equivalence.html#VALsplit">split</a> [<a href="Coq.Equivalence.html">Coq.Equivalence</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Relation.html#VALsplit">split</a> [<a href="Coq.Relation.html">Coq.Relation</a>]</td>
<td></td></tr>
<tr><td><a href="Search_monad.html#VALsprint">sprint</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Subst.html#VALsprint">sprint</a> [<a href="Matcher.Subst.html">Matcher.Subst</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Terms.html#VALsprint_nf_term">sprint_nf_term</a> [<a href="Matcher.Terms.html">Matcher.Terms</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.html#VALsubterm">subterm</a> [<a href="Matcher.html">Matcher</a>]</td>
<td><div class="info">
<code class="code">subterm p t</code> computes a set of solutions to the given
    subterm-matching problem.
</div>
</td></tr>
<tr><td align="left"><br>T</td></tr>
<tr><td><a href="Theory.Trans.html#VALt_of_constr">t_of_constr</a> [<a href="Theory.Trans.html">Theory.Trans</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Terms.html#VALt_of_term">t_of_term</a> [<a href="Matcher.Terms.html">Matcher.Terms</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.html#VALtclDEBUG">tclDEBUG</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
emit debug messages to see which tactics are failing
</div>
</td></tr>
<tr><td><a href="Coq.html#VALtclPRINT">tclPRINT</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
print the current goal
</div>
</td></tr>
<tr><td><a href="Coq.html#VALtclTIME">tclTIME</a> [<a href="Coq.html">Coq</a>]</td>
<td><div class="info">
time the execution of a tactic
</div>
</td></tr>
<tr><td><a href="Matcher.Terms.html#VALterm_of_t">term_of_t</a> [<a href="Matcher.Terms.html">Matcher.Terms</a>]</td>
<td><div class="info">
we have the following property: <code class="code">a</code> and <code class="code">b</code> are equal modulo AACU
      iif <code class="code">nf_equal (term_of_t a) (term_of_t b) = true</code>
</div>
</td></tr>
<tr><td><a href="Helper.CONTROL.html#VALtime">time</a> [<a href="Helper.CONTROL.html">Helper.CONTROL</a>]</td>
<td></td></tr>
<tr><td><a href="Helper.Debug.html#VALtime">time</a> [<a href="Helper.Debug.html">Helper.Debug</a>]</td>
<td><div class="info">
<code class="code">time</code> computes the time spent in a function, and then
      print it using the given format
</div>
</td></tr>
<tr><td><a href="Theory.Sigma.html#VALto_fun">to_fun</a> [<a href="Theory.Sigma.html">Theory.Sigma</a>]</td>
<td><div class="info">
<code class="code">to_fun ty null map</code> converts a Coq association list into a Coq function (with default value <code class="code">null</code>)
</div>
</td></tr>
<tr><td><a href="Search_monad.html#VALto_list">to_list</a> [<a href="Search_monad.html">Search_monad</a>]</td>
<td></td></tr>
<tr><td><a href="Matcher.Subst.html#VALto_list">to_list</a> [<a href="Matcher.Subst.html">Matcher.Subst</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Equivalence.html#VALto_relation">to_relation</a> [<a href="Coq.Equivalence.html">Coq.Equivalence</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Transitive.html#VALto_relation">to_relation</a> [<a href="Coq.Transitive.html">Coq.Transitive</a>]</td>
<td></td></tr>
<tr><td><a href="Theory.Sym.html#VALtyp">typ</a> [<a href="Theory.Sym.html">Theory.Sym</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Nat.html#VALtyp">typ</a> [<a href="Coq.Nat.html">Coq.Nat</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Pos.html#VALtyp">typ</a> [<a href="Coq.Pos.html">Coq.Pos</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Comparison.html#VALtyp">typ</a> [<a href="Coq.Comparison.html">Coq.Comparison</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Bool.html#VALtyp">typ</a> [<a href="Coq.Bool.html">Coq.Bool</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.Pair.html#VALtyp">typ</a> [<a href="Coq.Pair.html">Coq.Pair</a>]</td>
<td></td></tr>
<tr><td><a href="Coq.List.html#VALtype_of_list">type_of_list</a> [<a href="Coq.List.html">Coq.List</a>]</td>
<td><div class="info">
<code class="code">type_of_list ty</code>
</div>
</td></tr>
<tr><td align="left"><br>U</td></tr>
<tr><td><a href="Coq.html#VALuser_error">user_error</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
<tr><td align="left"><br>W</td></tr>
<tr><td><a href="Coq.html#VALwarning">warning</a> [<a href="Coq.html">Coq</a>]</td>
<td></td></tr>
</table>
</body>
</html>

APT Browse - Built by Thomas Orozco.