Source file term.ml
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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
open CAst
open Constrexpr
(** notes with the discussion with Hugo:
- there are two kinds of information that the printer can know:
+ parsing-level: this includes notations, implicit arities, etc...
+ semantic-level: only after typchecking has run! For example coertions!
- how to remember for example the type of a sub-expression:
The expression goes from Ast.t to Term.t, then goes back to Ast.t for
printing.
+ doing it for all types, it is too expensive + doing it for some, requires
a way to specify which
+ an interesting idea is to attach all the possible requests over the
structure of a term in the term itself once it has been recosntructed from
the typing phase
- continuation maybe a meeting with Clement and Shachar? *)
module BM = BoxModel
let xxx str = BoxModel.Constant ("FIXME: " ^ str)
let ly_prim_token ptok =
match ptok with
| Number e -> BM.Constant (NumTok.Signed.sprint e)
| String a -> BM.Constant a
let ly_sort_name_expr (s : sort_name_expr) =
match s with
| CSProp -> "SProp"
| CProp -> "Prop"
| CSet -> "Set"
| CType _qid -> "Type"
| CRawType _ulvl -> "Type"
let ly_named_sort ((s, _i) : sort_name_expr * int) = ly_sort_name_expr s
let ly_sort (s : sort_expr) =
let _qv_expr, s = s in
match s with
| Glob_term.UAnonymous { rigid } ->
if rigid == UnivRigid then BM.Sort [ "Type" ] else BM.Sort [ "Type" ]
| Glob_term.UNamed sl -> BM.Sort (List.map ly_named_sort sl)
type _cast_kind =
| VMcast
| NATIVEcast
| DEFAULTcast
let ly_cast_kind (s : Constr.cast_kind) =
match s with
| VMcast -> xxx "VMcast"
| NATIVEcast -> xxx "NATIVEcast"
| DEFAULTcast -> xxx "DEFAULTcast"
let ly_qualid { Coq_util.Id.relative; absolute; typ } =
let relative = Libnames.string_of_qualid relative in
let absolute = Option.map Libnames.string_of_path absolute in
BoxModel.Identifier { relative; absolute; typ }
let ly_fixexpr _ = BoxModel.Constant "TODO"
let ly_cofixexpr _ = BoxModel.Constant "TODO"
let ly_instance_expr (_e : instance_expr) = []
[@@@ocaml.warning "-26-27"]
let abs_kind_of (t : constr_expr) =
match t.CAst.v with
| CProdN _ -> BoxModel.Prod
| CLambdaN _ -> BoxModel.Lam
| _ -> BoxModel.Lam
let _debug = ref false
let env = ref Environ.empty_env
let sigma = ref Evd.empty
let rec ly_hunks unp args =
let open Ppextend in
match unp with
| [] -> []
| UnpMetaVar _ :: l ->
let la = List.hd args in
let lr = ly_hunks l (List.tl args) in
la :: lr
| UnpTerminal s :: l -> BM.Constant s :: ly_hunks l args
| UnpBox (_, l1) :: l ->
let l1 = List.map (fun (_, l) -> l) l1 in
ly_hunks (l1 @ l) args
| (UnpCut _ as unp) :: l -> ly_hunks l args
| _ -> [ xxx "not_printer" ]
let lname_to_string =
CAst.with_val (function
| Names.Anonymous -> "_"
| Names.Name id -> Names.Id.to_string id)
let ly_notation key args =
let { Ppextend.notation_printing_unparsing; notation_printing_level } =
Ppextend.find_notation_printing_rule None key
in
ly_hunks notation_printing_unparsing args
let rec ly_qid qid =
let id_info = Coq_util.Id.make qid in
let id_info = Coq_util.Id.map_typ ~f:layout id_info in
ly_qualid id_info
and ly_id id = ly_qid (Libnames.qualid_of_ident id)
and ly_lid (lid : Names.lident) = ly_id lid.v
and ly_lname (lid : Names.lname) =
match lid.v with
| Names.Anonymous -> xxx "name.anonymous"
| Names.Name id -> ly_id id
and ly_binder_expr (b : local_binder_expr) =
match b with
| CLocalAssum (namel, _relevance_info, kind, pat) ->
let namel = List.map lname_to_string namel in
{ BM.Binder.namel; typ = layout pat }
| CLocalDef (name, _relevance_info, pat, pat_tyo) ->
{ BM.Binder.namel = [ "XXX localdef" ]; typ = layout pat }
| CLocalPattern pat ->
{ BM.Binder.namel = [ "XXX localpat" ]; typ = xxx "local pat" }
and layout t =
if !_debug then
Feedback.msg_warning
Pp.(str "ly [->]: " ++ Ppconstr.pr_constr_expr !env !sigma t);
let res =
match t.CAst.v with
| CRef (qid, iexp) ->
let _ = Option.map ly_instance_expr iexp in
ly_qid qid
| CFix (lid, fixexpr) -> BoxModel.Fixpoint (ly_lid lid, ly_fixexpr fixexpr)
| CCoFix (lid, cofixexpr) ->
BoxModel.Fixpoint (ly_lid lid, ly_cofixexpr cofixexpr)
| CProdN (bds, inner) | CLambdaN (bds, inner) ->
let kind = abs_kind_of t in
let binderl = List.map ly_binder_expr bds in
BoxModel.Abs { kind; binderl; v = layout inner }
| CLetIn (name, e, tyo, ty) ->
let lhs = ly_lname name in
let rhs = layout e in
let typ = Option.map layout tyo in
BoxModel.Let { lhs; rhs; typ; v = layout ty }
| CAppExpl ((fn, ioexp), argl) ->
let impl = [] in
let argl = List.map layout argl in
let fn = ly_qid fn in
BoxModel.App { fn; impl; argl }
| CApp (fn, argl) ->
let impl = [] in
let argl = List.map (fun (e, _) -> layout e) argl in
BoxModel.App { fn = layout fn; impl; argl }
| CProj _ -> xxx "proj"
| CRecord fl -> xxx "record"
| CCases (sty, rtyo, brl, el) -> xxx "cases"
| CLetTuple (nl, (no, eo), e1, e2) -> xxx "lettuple"
| CIf (cond, _, et, ef) -> xxx "if"
| CHole _ -> xxx "hole"
| CPatVar pat -> xxx "patvar"
| CEvar (ename, ctx) -> xxx "evar"
| CSort s -> ly_sort s
| CCast (e, cast_kind, cast) ->
let p_c = Option.map ly_cast_kind cast_kind in
let p_e = layout e in
Cast (p_c, p_e)
| CNotation (oscope, ntn, ntn_subst) ->
let ntn_entry, key = ntn in
let args, _, _, _ = ntn_subst in
let args = List.map layout args in
let pretty = ly_notation (ntn_entry, key) args in
let raw =
Coq_util.notation_raw !env !sigma t
|> Option.cata layout (xxx "raw notation failed [binders usually]")
in
Notation { key; args; pretty; raw }
[@ocamlformat "disable"]
| CGeneralization _ -> xxx "generalization"
| CPrim ptok -> ly_prim_token ptok
| CDelimiters (_depth, delim, e) -> xxx "delimiters"
| CArray (univs, el, eu, ea) -> xxx "array"
| CGenarg _ -> xxx "genarg"
| CGenargGlob _ -> xxx "genargglob"
in
if !_debug then
Feedback.msg_warning
Pp.(str "ly [<-]: " ++ Ppconstr.pr_constr_expr !env !sigma t);
res
let layout ?(debug = false) e s t =
_debug := debug;
env := e;
sigma := s;
layout t