forked from CakeML/cakeml
-
Notifications
You must be signed in to change notification settings - Fork 0
/
IntProgScript.sml
196 lines (152 loc) · 5.67 KB
/
IntProgScript.sml
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
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
(*
Module about the built-in integer type. Note that CakeML uses
arbitrary precision integers (the mathematical intergers).
*)
open preamble
ml_translatorLib ml_progLib mlintTheory
mlbasicsProgTheory basisFunctionsLib gcdTheory
val _ = new_theory"IntProg"
val _ = translation_extends "mlbasicsProg";
val _ = ml_prog_update (open_module "Int");
val _ = ml_prog_update (add_dec
``Dtabbrev unknown_loc [] "int" (Atapp [] (Short "int"))`` I);
val _ = trans "+" intSyntax.plus_tm;
val _ = trans "-" intSyntax.minus_tm;
val _ = trans "*" intSyntax.mult_tm;
val _ = trans "div" intSyntax.div_tm;
val _ = trans "mod" intSyntax.mod_tm;
val _ = trans "<" intSyntax.less_tm;
val _ = trans ">" intSyntax.greater_tm;
val _ = trans "<=" intSyntax.leq_tm;
val _ = trans ">=" intSyntax.geq_tm;
val _ = trans "~" ``\i. - (i:int)``;
val _ = ml_prog_update open_local_block;
val res = translate exp_for_dec_enc_def;
val res = translate toChar_def;
val res = translate num_to_rev_chars_def;
Triviality tochar_side_dec:
i < 10 ==> tochar_side i
Proof
EVAL_TAC \\ simp []
QED
Triviality num_to_rev_chars_side:
!i j k. num_to_rev_chars_side i j k
Proof
ho_match_mp_tac mlintTheory.num_to_rev_chars_ind
\\ rw []
\\ ONCE_REWRITE_TAC [fetch "-" "num_to_rev_chars_side_def"]
\\ simp [tochar_side_dec]
QED
val res = update_precondition num_to_rev_chars_side;
val _ = ml_prog_update open_local_in_block;
val int_to_string_v_thm = translate mlintTheory.int_to_string_def;
val _ = next_ml_names := ["toString"];
val toString_v_thm = translate mlintTheory.toString_def1;
val Eval_NUM_toString = Q.prove(
`!v. (INT --> STRING_TYPE) toString v ==>
(NUM --> STRING_TYPE) num_to_str v`,
simp [ml_translatorTheory.Arrow_def,
ml_translatorTheory.AppReturns_def,num_to_str_def,
ml_translatorTheory.NUM_def,PULL_EXISTS,FORALL_PROD]
\\ rw [] \\ res_tac)
|> (fn th => MATCH_MP th toString_v_thm)
|> add_user_proved_v_thm;
val _ = ml_prog_update close_local_blocks;
val _ = ml_prog_update open_local_block;
val th = EVAL``ORD #"0"``;
val result = translate (fromChar_unsafe_def |> SIMP_RULE std_ss [th]);
val result = translate fromChars_range_unsafe_def;
val result = translate padLen_DEC_eq;
val result = translate maxSmall_DEC_def;
val _ = add_preferred_thy "-";
val _ = save_thm("fromChars_unsafe_ind",
fromChars_unsafe_ind |> REWRITE_RULE[maxSmall_DEC_def,padLen_DEC_eq]);
val result = translate (fromChars_unsafe_def
|> REWRITE_RULE[maxSmall_DEC_def,padLen_DEC_eq]);
val result = translate fromString_unsafe_def;
val fromstring_unsafe_side_def = definition"fromstring_unsafe_side_def";
val fromchars_unsafe_side_def = theorem"fromchars_unsafe_side_def";
val fromchars_range_unsafe_side_def = theorem"fromchars_range_unsafe_side_def";
Theorem fromchars_unsafe_side_thm:
∀n s. n ≤ LENGTH s ⇒ fromchars_unsafe_side n (strlit s)
Proof
completeInduct_on`n` \\ rw[]
\\ rw[Once fromchars_unsafe_side_def,fromchars_range_unsafe_side_def]
QED
val fromString_unsafe_side = Q.prove(
`∀x. fromstring_unsafe_side x = T`,
Cases
\\ rw[fromstring_unsafe_side_def]
\\ Cases_on`s` \\ fs[mlstringTheory.substring_def]
\\ simp_tac bool_ss [ONE,SEG_SUC_CONS,SEG_LENGTH_ID]
\\ match_mp_tac fromchars_unsafe_side_thm
\\ rw[]) |> update_precondition;
Theorem fromChar_thm:
fromChar char =
let vc = ORD char in
if 48 ≤ vc ∧ vc ≤ 57 then
SOME (vc - 48) else NONE
Proof
Cases_on`char`>>rw[fromChar_def]
QED
val result = translate fromChar_thm;
val result = translate fromChars_range_def;
val _ = save_thm("fromChars_ind",
fromChars_ind |> REWRITE_RULE[maxSmall_DEC_def,padLen_DEC_eq]);
val result = translate (fromChars_def
|> REWRITE_RULE[maxSmall_DEC_def,padLen_DEC_eq]);
val _ = ml_prog_update open_local_in_block;
val _ = next_ml_names := ["fromString"];
val result = translate fromString_def;
val fromstring_side_def = definition"fromstring_side_def";
val fromchars_side_def = theorem"fromchars_side_def";
val fromchars_range_side_def = theorem"fromchars_range_side_def";
Theorem fromchars_side_thm:
∀n s. n ≤ LENGTH s ⇒ fromchars_side n (strlit s)
Proof
completeInduct_on`n` \\ rw[]
\\ rw[Once fromchars_side_def,fromchars_range_side_def, padLen_DEC_eq]
QED
val fromString_side = Q.prove(
`∀x. fromstring_side x = T`,
Cases
\\ rw[fromstring_side_def]
\\ Cases_on`s` \\ fs[mlstringTheory.substring_def]
\\ simp_tac bool_ss [ONE,SEG_SUC_CONS,SEG_LENGTH_ID]
\\ match_mp_tac fromchars_side_thm
\\ rw[]) |> update_precondition;
val _ = next_ml_names := ["fromNatString"];
val result = translate fromNatString_def;
(* GCD *)
val _ = ml_prog_update open_local_block;
val res = translate num_gcd_def;
val _ = ml_prog_update open_local_in_block;
val num_gcd_side = prove(
``!a b. num_gcd_side a b = T``,
recInduct num_gcd_ind \\ rw []
\\ once_rewrite_tac [theorem "num_gcd_side_def"]
\\ fs [ADD1] \\ rw [] \\ fs [])
|> update_precondition;
val _ = (next_ml_names := ["gcd"]);
val int_gcd_v_thm = translate int_gcd_def;
Theorem gcd_v_thm:
(NUM --> NUM --> NUM) gcd$gcd int_gcd_v
Proof
assume_tac int_gcd_v_thm
\\ fs [ml_translatorTheory.Arrow_def,ml_translatorTheory.AppReturns_def]
\\ fs [ml_translatorTheory.NUM_def]
\\ rw [] \\ last_x_assum drule
\\ disch_then (strip_assume_tac o SPEC_ALL) \\ fs []
\\ first_assum $ irule_at Any
\\ rw [] \\ last_x_assum drule
\\ disch_then (qspec_then ‘refs''’ strip_assume_tac) \\ fs []
\\ first_assum $ irule_at Any
\\ fs [int_gcd_def,num_gcd_eq_gcd]
QED
val _ = add_user_proved_v_thm gcd_v_thm;
(* compare *)
val _ = (next_ml_names := ["compare"]);
val _ = translate mlintTheory.int_cmp_def;
val _ = ml_prog_update close_local_blocks;
val _ = ml_prog_update (close_module NONE);
val _ = export_theory();