blob: dafefa2036d0aebdd47a6860250ede59dd9e7dd3 (
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
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
|
--
-- The Add class
--
-- FIXME: reimplement in terms of Monoid?
Add : Type -> Type
Add = sig { zero : A; plus : A -> A -> A }
zero : (A : Type) -> Add A -> A
zero _ d = d.zero
plus : (A : Type) -> Add A -> A -> A -> A
plus _ d = d.plus
add_Integer : Add Integer
add_Integer = rec { zero = 0; plus = prim_add_Int }
sum : (A:Type) -> Add A -> List A -> A
sum _ d (Nil _) = d.zero
sum A d (Cons _ x xs) = d.plus x (sum A d xs)
{- Operators:
(x + y) => (plus ? ? x y)
-}
--
-- The Prod class
--
-- FIXME: reimplement in terms of Monoid?
Prod : Type -> Type
Prod = sig { one : A; times : A -> A -> A }
one : (A : Type) -> Prod A -> A
one _ d = d.zero
times : (A : Type) -> Prod A -> A -> A -> A
times _ d = d.plus
prod_Integer : Add Integer
prod_Integer = rec { one = 1; times = prim_mul_Int }
product : (A:Type) -> Prod A -> List A -> A
product _ d (Nil _) = d.one
product A d (Cons _ x xs) = d.times x (product A d xs)
{- Operators:
(x * y) => (times ? ? x y)
-}
--
-- The Eq class
--
Eq : Type -> Type
Eq A = sig { eq : A -> A -> Bool }
eq : (A : Type) -> Eq A -> A -> A -> Bool
eq _ d = d.eq
neq : (A : Type) -> Eq A -> A -> A -> Bool
neq A d x y = not (eq A d x y)
{- Operators:
(x == y) => (eq ? ? x y)
(x /= y) => (neq ? ? x y)
-}
--
-- The Ord class
--
-- FIXME: require Eq for Ord
data Ordering : Type where
LT : Ordering
EQ : Ordering
GT : Ordering
Ord : Type -> Type
Ord A = sig eq : A -> A -> Bool
compare : A -> A -> Ordering
compare : (A : Type) -> Ord A -> A -> A -> Ordering
compare _ d = d.compare
ordOp : (Ordering -> Bool) -> (A : Type) -> Ord A -> A -> A -> Bool
ordOp f A d x y = f (compare A d x y)
lt : (A : Type) -> Ord A -> A -> A -> Bool
lt = ordOp (\o -> case o of { LT -> True; _ -> False })
le : (A : Type) -> Ord A -> A -> A -> Bool
le = ordOp (\o -> case o of { GT -> False; _ -> True })
ge : (A : Type) -> Ord A -> A -> A -> Bool
ge = ordOp (\o -> case o of { LT -> False; _ -> True })
gt : (A : Type) -> Ord A -> A -> A -> Bool
gt = ordOp (\o -> case o of { GT -> True; _ -> False })
{- Operators:
(x < y) => (lt ? ? x y)
(x <= y) => (le ? ? x y)
(x >= y) => (ge ? ? x y)
(x > y) => (gt ? ? x y)
-}
--
-- The Show class
--
Show : Type -> Type
Show A = sig { show : A -> String }
show : (A : Type) -> Show A -> A -> String
show _ d = d.show
show_Integer : Show Integer
show_Integer = rec { show = prim_show_Int }
--
-- The Compos class
--
Monoid : Type -> Type
Monoid = sig { mzero : A; mplus : A -> A -> A }
Compos : (C : Type) -> (C -> Type) -> Type
Compos C T = sig
composOp : (c : C) -> ((d : C) -> T d -> T d) -> T c -> T c
composFold : (B : Type) -> Monoid B -> (c : C) -> ((d : C) -> T d -> b) -> T c -> b
composOp : (T : Type) -> (C : Type) -> Compos C T -> (c : C) -> ((d : C) -> T d -> T d) -> T c -> T c
composOp _ _ d c f t = d.composOp c f t
composFold : (T : Type) -> (C : Type) -> Compos C T -> (B : Type) -> Monoid B -> ((d : C) -> T d -> b) -> T c -> b
composFold _ _ d b m c f t = d.composFold b m c f t
|
