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
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2016 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
open CSig
open Pp
open Names
open Genarg
open Geninterp
open Tac2env
open Tac2expr
open Tac2interp
open Proofview.Notations
(** Standard values *)
let coq_core n = KerName.make2 Tac2env.coq_prefix (Label.of_id (Id.of_string_soft n))
let val_tag t = match val_tag t with
| Val.Base t -> t
| _ -> assert false
let val_constr = val_tag (topwit Stdarg.wit_constr)
let val_ident = val_tag (topwit Stdarg.wit_ident)
let val_pp = Val.create "ltac2:pp"
let extract_val (type a) (tag : a Val.typ) (Val.Dyn (tag', v)) : a =
match Val.eq tag tag' with
| None -> assert false
| Some Refl -> v
module Core =
struct
let t_int = coq_core "int"
let t_string = coq_core "string"
let t_array = coq_core "array"
let t_unit = coq_core "unit"
let t_list = coq_core "list"
let t_constr = coq_core "constr"
let t_ident = coq_core "ident"
let t_option = coq_core "option"
let c_nil = coq_core "[]"
let c_cons = coq_core "::"
let c_none = coq_core "None"
let c_some = coq_core "Some"
end
open Core
let v_unit = ValInt 0
let v_nil = ValInt 0
let v_cons v vl = ValBlk (0, [|v; vl|])
module Value =
struct
let of_unit () = v_unit
let to_unit = function
| ValInt 0 -> ()
| _ -> assert false
let of_int n = ValInt n
let to_int = function
| ValInt n -> n
| _ -> assert false
let of_bool b = if b then ValInt 0 else ValInt 1
let to_bool = function
| ValInt 0 -> true
| ValInt 1 -> false
| _ -> assert false
let of_char n = ValInt (Char.code n)
let to_char = function
| ValInt n -> Char.chr n
| _ -> assert false
let of_string s = ValStr s
let to_string = function
| ValStr s -> s
| _ -> assert false
let rec of_list = function
| [] -> v_nil
| x :: l -> v_cons x (of_list l)
let rec to_list = function
| ValInt 0 -> []
| ValBlk (0, [|v; vl|]) -> v :: to_list vl
| _ -> assert false
let of_ext tag c =
ValExt (Val.Dyn (tag, c))
let to_ext tag = function
| ValExt e -> extract_val tag e
| _ -> assert false
let of_constr c = of_ext val_constr c
let to_constr c = to_ext val_constr c
let of_ident c = of_ext val_ident c
let to_ident c = to_ext val_ident c
(** FIXME: handle backtrace in Ltac2 exceptions *)
let of_exn c = match fst c with
| LtacError (kn, c) -> ValOpn (kn, c)
| _ -> of_ext val_exn c
let to_exn c = match c with
| ValOpn (kn, c) -> (LtacError (kn, c), Exninfo.null)
| _ -> to_ext val_exn c
let of_pp c = of_ext val_pp c
let to_pp c = to_ext val_pp c
end
let val_valexpr = Val.create "ltac2:valexpr"
(** Stdlib exceptions *)
let err_notfocussed =
LtacError (coq_core "Not_focussed", [||])
let err_outofbounds =
LtacError (coq_core "Out_of_bounds", [||])
let err_notfound =
LtacError (coq_core "Not_found", [||])
(** Helper functions *)
let thaw f = interp_app f [v_unit]
let throw e = Proofview.tclLIFT (Proofview.NonLogical.raise e)
let return x = Proofview.tclUNIT x
let pname s = { mltac_plugin = "ltac2"; mltac_tactic = s }
let wrap f =
return () >>= fun () -> return (f ())
let wrap_unit f =
return () >>= fun () -> f (); return v_unit
let pf_apply f =
Proofview.Goal.goals >>= function
| [] ->
Proofview.tclENV >>= fun env ->
Proofview.tclEVARMAP >>= fun sigma ->
f env sigma
| [gl] ->
gl >>= fun gl ->
f (Proofview.Goal.env gl) (Tacmach.New.project gl)
| _ :: _ :: _ ->
throw err_notfocussed
(** Primitives *)
(** Printing *)
let prm_print : ml_tactic = function
| [pp] -> wrap_unit (fun () -> Feedback.msg_notice (Value.to_pp pp))
| _ -> assert false
let prm_message_of_int : ml_tactic = function
| [ValInt s] -> return (ValExt (Val.Dyn (val_pp, int s)))
| _ -> assert false
let prm_message_of_string : ml_tactic = function
| [ValStr s] -> return (ValExt (Val.Dyn (val_pp, str (Bytes.to_string s))))
| _ -> assert false
let prm_message_of_constr : ml_tactic = function
| [c] ->
pf_apply begin fun env sigma ->
let c = Value.to_constr c in
let pp = Printer.pr_econstr_env env sigma c in
return (ValExt (Val.Dyn (val_pp, pp)))
end
| _ -> assert false
let prm_message_concat : ml_tactic = function
| [m1; m2] ->
let m1 = Value.to_pp m1 in
let m2 = Value.to_pp m2 in
return (Value.of_pp (Pp.app m1 m2))
| _ -> assert false
(** Array *)
let prm_array_make : ml_tactic = function
| [ValInt n; x] ->
if n < 0 || n > Sys.max_array_length then throw err_outofbounds
else wrap (fun () -> ValBlk (0, Array.make n x))
| _ -> assert false
let prm_array_length : ml_tactic = function
| [ValBlk (_, v)] -> return (ValInt (Array.length v))
| _ -> assert false
let prm_array_set : ml_tactic = function
| [ValBlk (_, v); ValInt n; x] ->
if n < 0 || n >= Array.length v then throw err_outofbounds
else wrap_unit (fun () -> v.(n) <- x)
| _ -> assert false
let prm_array_get : ml_tactic = function
| [ValBlk (_, v); ValInt n] ->
if n < 0 || n >= Array.length v then throw err_outofbounds
else wrap (fun () -> v.(n))
| _ -> assert false
(** Int *)
let prm_int_equal : ml_tactic = function
| [m; n] ->
return (Value.of_bool (Value.to_int m == Value.to_int n))
| _ -> assert false
let binop f : ml_tactic = function
| [m; n] -> return (Value.of_int (f (Value.to_int m) (Value.to_int n)))
| _ -> assert false
let prm_int_compare args = binop Int.compare args
let prm_int_add args = binop (+) args
let prm_int_sub args = binop (-) args
let prm_int_mul args = binop ( * ) args
let prm_int_neg : ml_tactic = function
| [m] -> return (Value.of_int (~- (Value.to_int m)))
| _ -> assert false
(** String *)
let prm_string_make : ml_tactic = function
| [n; c] ->
let n = Value.to_int n in
let c = Value.to_char c in
if n < 0 || n > Sys.max_string_length then throw err_outofbounds
else wrap (fun () -> Value.of_string (Bytes.make n c))
| _ -> assert false
let prm_string_length : ml_tactic = function
| [s] ->
return (Value.of_int (Bytes.length (Value.to_string s)))
| _ -> assert false
let prm_string_set : ml_tactic = function
| [s; n; c] ->
let s = Value.to_string s in
let n = Value.to_int n in
let c = Value.to_char c in
if n < 0 || n >= Bytes.length s then throw err_outofbounds
else wrap_unit (fun () -> Bytes.set s n c)
| _ -> assert false
let prm_string_get : ml_tactic = function
| [s; n] ->
let s = Value.to_string s in
let n = Value.to_int n in
if n < 0 || n >= Bytes.length s then throw err_outofbounds
else wrap (fun () -> Value.of_char (Bytes.get s n))
| _ -> assert false
(** Terms *)
(** constr -> constr *)
let prm_constr_type : ml_tactic = function
| [c] ->
let c = Value.to_constr c in
let get_type env sigma =
Proofview.V82.wrap_exceptions begin fun () ->
let (sigma, t) = Typing.type_of env sigma c in
let t = Value.of_constr t in
Proofview.Unsafe.tclEVARS sigma <*> Proofview.tclUNIT t
end in
pf_apply get_type
| _ -> assert false
(** constr -> constr *)
let prm_constr_equal : ml_tactic = function
| [c1; c2] ->
let c1 = Value.to_constr c1 in
let c2 = Value.to_constr c2 in
Proofview.tclEVARMAP >>= fun sigma ->
let b = EConstr.eq_constr sigma c1 c2 in
Proofview.tclUNIT (Value.of_bool b)
| _ -> assert false
(** Error *)
let prm_throw : ml_tactic = function
| [e] ->
let (e, info) = Value.to_exn e in
Proofview.tclLIFT (Proofview.NonLogical.raise ~info e)
| _ -> assert false
(** Control *)
(** exn -> 'a *)
let prm_zero : ml_tactic = function
| [e] ->
let (e, info) = Value.to_exn e in
Proofview.tclZERO ~info e
| _ -> assert false
(** exn -> 'a *)
let prm_plus : ml_tactic = function
| [x; k] ->
Proofview.tclOR (thaw x) (fun e -> interp_app k [Value.of_exn e])
| _ -> assert false
(** (unit -> 'a) -> 'a *)
let prm_once : ml_tactic = function
| [f] -> Proofview.tclONCE (thaw f)
| _ -> assert false
(** (unit -> unit) list -> unit *)
let prm_dispatch : ml_tactic = function
| [l] ->
let l = Value.to_list l in
let l = List.map (fun f -> Proofview.tclIGNORE (thaw f)) l in
Proofview.tclDISPATCH l >>= fun () -> return v_unit
| _ -> assert false
(** (unit -> unit) list -> (unit -> unit) -> (unit -> unit) list -> unit *)
let prm_extend : ml_tactic = function
| [lft; tac; rgt] ->
let lft = Value.to_list lft in
let lft = List.map (fun f -> Proofview.tclIGNORE (thaw f)) lft in
let tac = Proofview.tclIGNORE (thaw tac) in
let rgt = Value.to_list rgt in
let rgt = List.map (fun f -> Proofview.tclIGNORE (thaw f)) rgt in
Proofview.tclEXTEND lft tac rgt >>= fun () -> return v_unit
| _ -> assert false
(** (unit -> unit) -> unit *)
let prm_enter : ml_tactic = function
| [f] ->
let f = Proofview.tclIGNORE (thaw f) in
Proofview.tclINDEPENDENT f >>= fun () -> return v_unit
| _ -> assert false
(** int -> int -> (unit -> 'a) -> 'a *)
let prm_focus : ml_tactic = function
| [i; j; tac] ->
let i = Value.to_int i in
let j = Value.to_int j in
Proofview.tclFOCUS i j (thaw tac)
| _ -> assert false
(** unit -> unit *)
let prm_shelve : ml_tactic = function
| [_] -> Proofview.shelve >>= fun () -> return v_unit
| _ -> assert false
(** unit -> unit *)
let prm_shelve_unifiable : ml_tactic = function
| [_] -> Proofview.shelve_unifiable >>= fun () -> return v_unit
| _ -> assert false
let prm_new_goal : ml_tactic = function
| [ev] ->
let ev = Evar.unsafe_of_int (Value.to_int ev) in
Proofview.tclEVARMAP >>= fun sigma ->
if Evd.mem sigma ev then
Proofview.Unsafe.tclNEWGOALS [ev] <*> Proofview.tclUNIT v_unit
else throw err_notfound
| _ -> assert false
(** unit -> constr *)
let prm_goal : ml_tactic = function
| [_] ->
Proofview.Goal.enter_one begin fun gl ->
let concl = Tacmach.New.pf_nf_concl gl in
return (Value.of_constr concl)
end
| _ -> assert false
(** ident -> constr *)
let prm_hyp : ml_tactic = function
| [id] ->
let id = Value.to_ident id in
pf_apply begin fun env _ ->
let mem = try ignore (Environ.lookup_named id env); true with Not_found -> false in
if mem then return (Value.of_constr (EConstr.mkVar id))
else Tacticals.New.tclZEROMSG
(str "Hypothesis " ++ quote (Id.print id) ++ str " not found") (** FIXME: Do something more sensible *)
end
| _ -> assert false
(** (unit -> constr) -> unit *)
let prm_refine : ml_tactic = function
| [c] ->
let c = thaw c >>= fun c -> Proofview.tclUNIT ((), Value.to_constr c) in
Proofview.Goal.nf_enter begin fun gl ->
Refine.generic_refine ~typecheck:true c gl
end >>= fun () -> return v_unit
| _ -> assert false
(** Registering *)
let () = Tac2env.define_primitive (pname "print") prm_print
let () = Tac2env.define_primitive (pname "message_of_string") prm_message_of_string
let () = Tac2env.define_primitive (pname "message_of_int") prm_message_of_int
let () = Tac2env.define_primitive (pname "message_of_constr") prm_message_of_constr
let () = Tac2env.define_primitive (pname "message_concat") prm_message_concat
let () = Tac2env.define_primitive (pname "array_make") prm_array_make
let () = Tac2env.define_primitive (pname "array_length") prm_array_length
let () = Tac2env.define_primitive (pname "array_get") prm_array_get
let () = Tac2env.define_primitive (pname "array_set") prm_array_set
let () = Tac2env.define_primitive (pname "string_make") prm_string_make
let () = Tac2env.define_primitive (pname "string_length") prm_string_length
let () = Tac2env.define_primitive (pname "string_get") prm_string_get
let () = Tac2env.define_primitive (pname "string_set") prm_string_set
let () = Tac2env.define_primitive (pname "constr_type") prm_constr_type
let () = Tac2env.define_primitive (pname "constr_equal") prm_constr_equal
let () = Tac2env.define_primitive (pname "int_equal") prm_int_equal
let () = Tac2env.define_primitive (pname "int_compare") prm_int_compare
let () = Tac2env.define_primitive (pname "int_neg") prm_int_neg
let () = Tac2env.define_primitive (pname "int_add") prm_int_add
let () = Tac2env.define_primitive (pname "int_sub") prm_int_sub
let () = Tac2env.define_primitive (pname "int_mul") prm_int_mul
let () = Tac2env.define_primitive (pname "throw") prm_throw
let () = Tac2env.define_primitive (pname "zero") prm_zero
let () = Tac2env.define_primitive (pname "plus") prm_plus
let () = Tac2env.define_primitive (pname "once") prm_once
let () = Tac2env.define_primitive (pname "dispatch") prm_dispatch
let () = Tac2env.define_primitive (pname "extend") prm_extend
let () = Tac2env.define_primitive (pname "enter") prm_enter
let () = Tac2env.define_primitive (pname "focus") prm_focus
let () = Tac2env.define_primitive (pname "shelve") prm_shelve
let () = Tac2env.define_primitive (pname "shelve_unifiable") prm_shelve_unifiable
let () = Tac2env.define_primitive (pname "new_goal") prm_new_goal
let () = Tac2env.define_primitive (pname "goal") prm_goal
let () = Tac2env.define_primitive (pname "hyp") prm_hyp
let () = Tac2env.define_primitive (pname "refine") prm_refine
(** ML types *)
let constr_flags () =
let open Pretyping in
{
use_typeclasses = true;
solve_unification_constraints = true;
use_hook = Pfedit.solve_by_implicit_tactic ();
fail_evar = true;
expand_evars = true
}
let open_constr_no_classes_flags () =
let open Pretyping in
{
use_typeclasses = false;
solve_unification_constraints = true;
use_hook = Pfedit.solve_by_implicit_tactic ();
fail_evar = false;
expand_evars = true
}
(** Embed all Ltac2 data into Values *)
let to_lvar ist =
let open Glob_ops in
let map e = Val.Dyn (val_valexpr, e) in
let lfun = Id.Map.map map ist in
{ empty_lvar with Glob_term.ltac_genargs = lfun }
let interp_constr flags ist (c, _) =
let open Pretyping in
pf_apply begin fun env sigma ->
Proofview.V82.wrap_exceptions begin fun () ->
let ist = to_lvar ist in
let (sigma, c) = understand_ltac flags env sigma ist WithoutTypeConstraint c in
let c = Val.Dyn (val_constr, c) in
Proofview.Unsafe.tclEVARS sigma >>= fun () ->
Proofview.tclUNIT c
end
end
let () =
let interp ist c = interp_constr (constr_flags ()) ist c in
let obj = {
ml_type = t_constr;
ml_interp = interp;
} in
define_ml_object Stdarg.wit_constr obj
let () =
let interp ist c = interp_constr (open_constr_no_classes_flags ()) ist c in
let obj = {
ml_type = t_constr;
ml_interp = interp;
} in
define_ml_object Stdarg.wit_open_constr obj
let () =
let interp _ id = return (Val.Dyn (val_ident, id)) in
let obj = {
ml_type = t_ident;
ml_interp = interp;
} in
define_ml_object Stdarg.wit_ident obj
let () =
let interp ist env sigma concl tac =
let fold id (Val.Dyn (tag, v)) (accu : environment) : environment =
match Val.eq tag val_valexpr with
| None -> accu
| Some Refl -> Id.Map.add id v accu
in
let ist = Id.Map.fold fold ist Id.Map.empty in
let tac = Proofview.tclIGNORE (interp ist tac) in
let c, sigma = Pfedit.refine_by_tactic env sigma concl tac in
(EConstr.of_constr c, sigma)
in
Pretyping.register_constr_interp0 wit_ltac2 interp
(** Built-in notation scopes *)
let add_scope s f =
Tac2entries.register_scope (Id.of_string s) f
let scope_fail () = CErrors.user_err (str "Invalid parsing token")
let dummy_loc = Loc.make_loc (-1, -1)
let rthunk e =
let loc = Tac2intern.loc_of_tacexpr e in
let var = [Loc.tag ~loc Anonymous, Some (CTypRef (loc, AbsKn Core.t_unit, []))] in
CTacFun (loc, var, e)
let add_generic_scope s entry arg =
let parse = function
| [] ->
let scope = Extend.Aentry entry in
let act x = rthunk (CTacExt (dummy_loc, in_gen (rawwit arg) x)) in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
in
add_scope s parse
let () = add_scope "list0" begin function
| [tok] ->
let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in
let scope = Extend.Alist0 scope in
let act l =
let l = List.map act l in
CTacLst (None, l)
in
Tac2entries.ScopeRule (scope, act)
| [tok; SexprStr (_, str)] ->
let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in
let sep = Extend.Atoken (CLexer.terminal str) in
let scope = Extend.Alist0sep (scope, sep) in
let act l =
let l = List.map act l in
CTacLst (None, l)
in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
end
let () = add_scope "list1" begin function
| [tok] ->
let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in
let scope = Extend.Alist1 scope in
let act l =
let l = List.map act l in
CTacLst (None, l)
in
Tac2entries.ScopeRule (scope, act)
| [tok; SexprStr (_, str)] ->
let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in
let sep = Extend.Atoken (CLexer.terminal str) in
let scope = Extend.Alist1sep (scope, sep) in
let act l =
let l = List.map act l in
CTacLst (None, l)
in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
end
let () = add_scope "opt" begin function
| [tok] ->
let Tac2entries.ScopeRule (scope, act) = Tac2entries.parse_scope tok in
let scope = Extend.Aopt scope in
let act opt = match opt with
| None ->
CTacRef (AbsKn (TacConstructor Core.c_none))
| Some x ->
CTacApp (dummy_loc, CTacRef (AbsKn (TacConstructor Core.c_some)), [act x])
in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
end
let () = add_scope "self" begin function
| [] ->
let scope = Extend.Aself in
let act tac = rthunk tac in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
end
let () = add_scope "next" begin function
| [] ->
let scope = Extend.Anext in
let act tac = rthunk tac in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
end
let () = add_scope "tactic" begin function
| [] ->
(** Default to level 5 parsing *)
let scope = Extend.Aentryl (Tac2entries.Pltac.tac2expr, 5) in
let act tac = rthunk tac in
Tac2entries.ScopeRule (scope, act)
| [SexprInt (loc, n)] ->
let () = if n < 0 || n > 5 then scope_fail () in
let scope = Extend.Aentryl (Tac2entries.Pltac.tac2expr, n) in
let act tac = rthunk tac in
Tac2entries.ScopeRule (scope, act)
| _ -> scope_fail ()
end
let () = add_generic_scope "ident" Pcoq.Prim.ident Stdarg.wit_ident
let () = add_generic_scope "constr" Pcoq.Constr.constr Stdarg.wit_constr
|