/usr/share/doc/libaac-tactics-ocaml-dev/html/api/Search_monad.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 | <!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="Print.html">
<link rel="next" href="Theory.html">
<link rel="Up" 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"><link title="Monadic operations" rel="Section" href="#2_Monadicoperations">
<link title="Derived facilities " rel="Section" href="#2_Derivedfacilities">
<title>Search_monad</title>
</head>
<body>
<div class="navbar"><a class="pre" href="Print.html" title="Print">Previous</a>
<a class="up" href="index.html" title="Index">Up</a>
<a class="post" href="Theory.html" title="Theory">Next</a>
</div>
<h1>Module <a href="type_Search_monad.html">Search_monad</a></h1>
<pre><span class="keyword">module</span> Search_monad: <code class="code">sig</code> <a href="Search_monad.html">..</a> <code class="code">end</code></pre><div class="info module top">
Search monad that allows to express non-deterministic algorithms
in a legible maner, or programs that solve combinatorial problems.<br>
<b>See also</b> <a href="http://spivey.oriel.ox.ac.uk/mike/search-jfp.pdf">the
inspiration of this module</a><br>
</div>
<hr width="100%">
<pre><span id="TYPEm"><span class="keyword">type</span> <code class="type">'a</code> m</span> </pre>
<div class="info ">
A data type that represent a collection of <code class="code">'a</code><br>
</div>
<br>
<h2 id="2_Monadicoperations">Monadic operations</h2><br>
<pre><span id="VAL(>>)"><span class="keyword">val</span> (>>)</span> : <code class="type">'a <a href="Search_monad.html#TYPEm">m</a> -> ('a -> 'b <a href="Search_monad.html#TYPEm">m</a>) -> 'b <a href="Search_monad.html#TYPEm">m</a></code></pre><div class="info ">
bind and return<br>
</div>
<pre><span id="VALreturn"><span class="keyword">val</span> return</span> : <code class="type">'a -> 'a <a href="Search_monad.html#TYPEm">m</a></code></pre>
<pre><span id="VAL(>>|)"><span class="keyword">val</span> (>>|)</span> : <code class="type">'a <a href="Search_monad.html#TYPEm">m</a> -> 'a <a href="Search_monad.html#TYPEm">m</a> -> 'a <a href="Search_monad.html#TYPEm">m</a></code></pre><div class="info ">
non-deterministic choice<br>
</div>
<pre><span id="VALfail"><span class="keyword">val</span> fail</span> : <code class="type">unit -> 'a <a href="Search_monad.html#TYPEm">m</a></code></pre><div class="info ">
failure<br>
</div>
<pre><span id="VALfold"><span class="keyword">val</span> fold</span> : <code class="type">('a -> 'b -> 'b) -> 'a <a href="Search_monad.html#TYPEm">m</a> -> 'b -> 'b</code></pre><div class="info ">
folding through the collection<br>
</div>
<br>
<h2 id="2_Derivedfacilities">Derived facilities </h2><br>
<pre><span id="VALsprint"><span class="keyword">val</span> sprint</span> : <code class="type">('a -> string) -> 'a <a href="Search_monad.html#TYPEm">m</a> -> string</code></pre>
<pre><span id="VALcount"><span class="keyword">val</span> count</span> : <code class="type">'a <a href="Search_monad.html#TYPEm">m</a> -> int</code></pre>
<pre><span id="VALchoose"><span class="keyword">val</span> choose</span> : <code class="type">'a <a href="Search_monad.html#TYPEm">m</a> -> 'a option</code></pre>
<pre><span id="VALto_list"><span class="keyword">val</span> to_list</span> : <code class="type">'a <a href="Search_monad.html#TYPEm">m</a> -> 'a list</code></pre>
<pre><span id="VALsort"><span class="keyword">val</span> sort</span> : <code class="type">('a -> 'a -> int) -> 'a <a href="Search_monad.html#TYPEm">m</a> -> 'a <a href="Search_monad.html#TYPEm">m</a></code></pre>
<pre><span id="VALis_empty"><span class="keyword">val</span> is_empty</span> : <code class="type">'a <a href="Search_monad.html#TYPEm">m</a> -> bool</code></pre>
<pre><span id="VALfilter"><span class="keyword">val</span> filter</span> : <code class="type">('a -> bool) -> 'a <a href="Search_monad.html#TYPEm">m</a> -> 'a <a href="Search_monad.html#TYPEm">m</a></code></pre></body></html>
|