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
|
(*
* Vericert: Verified high-level synthesis.
* Copyright (C) 2020 Yann Herklotz <yann@yannherklotz.com>
* 2021 Michalis Pardalos <mpardalos@gmail.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <https://www.gnu.org/licenses/>.
*)
From Coq Require Import BinNums Lists.List.
From compcert Require Import Maps.
Module Type Monad.
Parameter mon : Type -> Type.
Parameter ret : forall (A : Type) (x : A), mon A.
Arguments ret [A].
Parameter bind : forall (A B : Type) (f : mon A) (g : A -> mon B), mon B.
Arguments bind [A B].
Parameter bind2 : forall (A B C: Type) (f: mon (A * B)) (g: A -> B -> mon C), mon C.
Arguments bind2 [A B C].
End Monad.
Module MonadExtra(M : Monad).
Import M.
Module MonadNotation.
Notation "'do' X <- A ; B" :=
(bind A (fun X => B))
(at level 200, X ident, A at level 100, B at level 200).
Notation "'do' ( X , Y ) <- A ; B" :=
(bind2 A (fun X Y => B))
(at level 200, X ident, Y ident, A at level 100, B at level 200).
End MonadNotation.
Import MonadNotation.
Fixpoint traverselist {A B: Type} (f: A -> mon B) (l: list A) {struct l}: mon (list B) :=
match l with
| nil => ret nil
| x::xs =>
do r <- f x;
do rs <- traverselist f xs;
ret (r::rs)
end.
Definition sequence {A} : list (mon A) -> mon (list A) := traverselist (fun x => x).
Definition traverseoption {A B: Type} (f: A -> mon B) (opt: option A) : mon (option B) :=
match opt with
| None => ret None
| Some x =>
do r <- f x;
ret (Some r)
end.
Fixpoint collectlist {A : Type} (f : A -> mon unit) (l : list A) {struct l} : mon unit :=
match l with
| nil => ret tt
| x::xs => do _ <- f x; collectlist f xs
end.
Fixpoint xtraverse_ptree {A B : Type} (f : positive -> A -> mon B) (m : PTree.t A) (i : positive)
{struct m} : mon (PTree.t B) :=
match m with
| PTree.Leaf => ret PTree.Leaf
| PTree.Node l o r =>
do no <- match o with
| None => ret None
| Some x => do no <- f (PTree.prev i) x; ret (Some no)
end;
do nl <- xtraverse_ptree f l (xO i);
do nr <- xtraverse_ptree f r (xI i);
ret (PTree.Node nl no nr)
end.
Definition traverse_ptree {A B : Type} (f : positive -> A -> mon B) m := xtraverse_ptree f m xH.
Definition traverse_ptree1 {A B : Type} (f : A -> mon B) := traverse_ptree (fun _ => f).
End MonadExtra.
|
