File: ltac2_recursive_nota.v

package info (click to toggle)
coq 9.1.0%2Bdfsg-3
  • links: PTS, VCS
  • area: main
  • in suites: experimental
  • size: 35,964 kB
  • sloc: ml: 239,908; sh: 4,355; python: 2,985; ansic: 2,644; makefile: 874; lisp: 171; javascript: 63; xml: 24; sed: 2
file content (9 lines) | stat: -rw-r--r-- 365 bytes parent folder | download | duplicates (3) 
1
2
3
4
5
6
7
8
9
 
Require Import Ltac2.Ltac2.
Notation binder_act := ltac2:(exact eq_refl) (only parsing).
Notation binder x := (binder_act :> x = x) (only parsing).

#[local] Notation "'test{' x .. y } P" :=
  ((fun x => .. ((fun y => P), binder (fun y => I)) ..), binder (fun x => I))
    (at level 0, x binder, y binder, only parsing).

Check (test{(aa : nat) (bb : bool)} True).