diff options
| author | Pierre-Marie Pédrot | 2017-01-19 14:23:51 +0100 |
|---|---|---|
| committer | Pierre-Marie Pédrot | 2017-01-19 14:23:51 +0100 |
| commit | f22969902223ab54f56f25583b24dc27c4cd6f4e (patch) | |
| tree | 09c893b1dd14c9b2b38067a01486fc61452d0209 /doc/refman | |
| parent | 34c19354c9997621a40ad053a2a12edcd8c5b5e4 (diff) | |
| parent | 8d783c10d9505cbc1beb1c8e3451ea5dd567f260 (diff) | |
Merge branch 'v8.6'
Diffstat (limited to 'doc/refman')
| -rw-r--r-- | doc/refman/RefMan-syn.tex | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/refman/RefMan-syn.tex b/doc/refman/RefMan-syn.tex index 1fcc1c0df4..21c39de967 100644 --- a/doc/refman/RefMan-syn.tex +++ b/doc/refman/RefMan-syn.tex @@ -649,7 +649,7 @@ A recursive pattern for binders can be used in position of a recursive pattern for terms. Here is an example: \begin{coq_example*} -Notation ``'FUNAPP' x .. y , f'' := +Notation "'FUNAPP' x .. y , f" := (fun x => .. (fun y => (.. (f x) ..) y ) ..) (at level 200, x binder, y binder, right associativity). \end{coq_example*} |