blob: 14a41efdd6d35ec6b385bee6dcf33ee76faecd67 (
plain)
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
|
(*
* Vericert: Verified high-level synthesis.
* Copyright (C) 2022 Yann Herklotz <yann@yannherklotz.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 vericert Require Import Monad.
From Coq Require Import Lists.List.
Module Option <: Monad.
Definition mon := option.
Definition ret {A: Type} (x: A) := Some x.
Definition default {T : Type} (x : T) (u : option T) : T :=
match u with
| Some y => y
| _ => x
end.
Definition map {S : Type} {T : Type} (f : S -> T) (u : option S) : option T :=
match u with
| Some y => Some (f y)
| _ => None
end.
Definition liftA2 {T : Type} (f : T -> T -> T) (a : option T) (b : option T) : option T :=
match a with
| Some x => map (f x) b
| _ => None
end.
Definition bind {A B : Type} (f : option A) (g : A -> option B) : option B :=
match f with
| Some a => g a
| _ => None
end.
Definition bind2 {A B C : Type} (f : mon (A * B)) (g : A -> B -> option C) : option C :=
match f with
| Some (a, b) => g a b
| _ => None
end.
Definition join {A : Type} (a : option (option A)) : option A :=
match a with
| None => None
| Some a' => a'
end.
End Option.
Module OptionExtra := MonadExtra(Option).
|
