23250
|
1 |
structure HOL =
|
|
2 |
struct
|
|
3 |
|
26513
|
4 |
type 'a eq = {eq : 'a -> 'a -> bool};
|
|
5 |
fun eq (A_:'a eq) = #eq A_;
|
23250
|
6 |
|
24193
|
7 |
type 'a ord = {less_eq : 'a -> 'a -> bool, less : 'a -> 'a -> bool};
|
|
8 |
fun less_eq (A_:'a ord) = #less_eq A_;
|
|
9 |
fun less (A_:'a ord) = #less A_;
|
|
10 |
|
26513
|
11 |
fun eqop A_ a = eq A_ a;
|
|
12 |
|
23250
|
13 |
end; (*struct HOL*)
|
|
14 |
|
22490
|
15 |
structure Orderings =
|
|
16 |
struct
|
|
17 |
|
24193
|
18 |
type 'a order = {Orderings__ord_order : 'a HOL.ord};
|
|
19 |
fun ord_order (A_:'a order) = #Orderings__ord_order A_;
|
22490
|
20 |
|
24193
|
21 |
type 'a linorder = {Orderings__order_linorder : 'a order};
|
|
22 |
fun order_linorder (A_:'a linorder) = #Orderings__order_linorder A_;
|
22490
|
23 |
|
23250
|
24 |
end; (*struct Orderings*)
|
22490
|
25 |
|
|
26 |
structure Nat =
|
|
27 |
struct
|
|
28 |
|
24421
|
29 |
datatype nat = Suc of nat | Zero_nat;
|
22490
|
30 |
|
26513
|
31 |
fun eq_nat Zero_nat Zero_nat = true
|
|
32 |
| eq_nat (Suc m) (Suc n) = eq_nat m n
|
|
33 |
| eq_nat Zero_nat (Suc a) = false
|
|
34 |
| eq_nat (Suc a) Zero_nat = false;
|
22490
|
35 |
|
26513
|
36 |
val eq_nata = {eq = eq_nat} : nat HOL.eq;
|
22490
|
37 |
|
26318
|
38 |
fun less_nat m (Suc n) = less_eq_nat m n
|
22490
|
39 |
| less_nat n Zero_nat = false
|
26318
|
40 |
and less_eq_nat (Suc m) n = less_nat m n
|
|
41 |
| less_eq_nat Zero_nat n = true;
|
22490
|
42 |
|
24193
|
43 |
val ord_nat = {less_eq = less_eq_nat, less = less_nat} : nat HOL.ord;
|
22490
|
44 |
|
24193
|
45 |
val order_nat = {Orderings__ord_order = ord_nat} : nat Orderings.order;
|
23250
|
46 |
|
24193
|
47 |
val linorder_nat = {Orderings__order_linorder = order_nat} :
|
23250
|
48 |
nat Orderings.linorder;
|
|
49 |
|
22490
|
50 |
end; (*struct Nat*)
|
|
51 |
|
|
52 |
structure Codegen =
|
|
53 |
struct
|
|
54 |
|
24421
|
55 |
datatype ('a, 'b) searchtree =
|
|
56 |
Branch of ('a, 'b) searchtree * 'a * ('a, 'b) searchtree |
|
|
57 |
Leaf of 'a * 'b;
|
22490
|
58 |
|
25182
|
59 |
fun update (A1_, A2_) (it, entry) (Branch (t1, key, t2)) =
|
|
60 |
(if HOL.less_eq ((Orderings.ord_order o Orderings.order_linorder) A2_)
|
24193
|
61 |
it key
|
25182
|
62 |
then Branch (update (A1_, A2_) (it, entry) t1, key, t2)
|
|
63 |
else Branch (t1, key, update (A1_, A2_) (it, entry) t2))
|
|
64 |
| update (A1_, A2_) (it, entry) (Leaf (key, vala)) =
|
|
65 |
(if HOL.eqop A1_ it key then Leaf (key, entry)
|
24193
|
66 |
else (if HOL.less_eq
|
25182
|
67 |
((Orderings.ord_order o Orderings.order_linorder) A2_) it
|
23250
|
68 |
key
|
22490
|
69 |
then Branch (Leaf (it, entry), it, Leaf (key, vala))
|
|
70 |
else Branch (Leaf (key, vala), it, Leaf (it, entry))));
|
|
71 |
|
23132
|
72 |
val example : (Nat.nat, (Nat.nat list)) searchtree =
|
26513
|
73 |
update (Nat.eq_nata, Nat.linorder_nat)
|
23132
|
74 |
(Nat.Suc (Nat.Suc (Nat.Suc (Nat.Suc Nat.Zero_nat))),
|
|
75 |
[Nat.Suc (Nat.Suc Nat.Zero_nat), Nat.Suc (Nat.Suc Nat.Zero_nat)])
|
26513
|
76 |
(update (Nat.eq_nata, Nat.linorder_nat)
|
23132
|
77 |
(Nat.Suc (Nat.Suc (Nat.Suc Nat.Zero_nat)),
|
|
78 |
[Nat.Suc (Nat.Suc (Nat.Suc Nat.Zero_nat))])
|
26513
|
79 |
(update (Nat.eq_nata, Nat.linorder_nat)
|
23132
|
80 |
(Nat.Suc (Nat.Suc Nat.Zero_nat), [Nat.Suc (Nat.Suc Nat.Zero_nat)])
|
|
81 |
(Leaf (Nat.Suc Nat.Zero_nat, []))));
|
22490
|
82 |
|
|
83 |
end; (*struct Codegen*)
|