File: bug_5523.v

package info (click to toggle)
coq-doc 8.16.1-1
  • links: PTS, VCS
  • area: non-free
  • in suites: bookworm
  • size: 42,788 kB
  • sloc: ml: 219,673; sh: 4,035; python: 3,372; ansic: 2,529; makefile: 728; lisp: 279; javascript: 87; xml: 24; sed: 2
file content (6 lines) | stat: -rw-r--r-- 300 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
 
(* Support for complex constructions in recursive notations, especially "match". *)

Definition Let_In {A P} (x : A) (f : forall a : A, P a) : P x := let y := x in f y.
Notation "'dlet' x , y := v 'in' ( a , b , .. , c )"
  := (Let_In v (fun '(x, y) => pair .. (pair a b) .. c))
       (at level 0).