diff options
| author |  Guillaume Melquiond <guillaume.melquiond@inria.fr> | 2016-12-16 11:27:42 +0100 |
|---|---|---|
| committer | Guillaume Melquiond <guillaume.melquiond@inria.fr> | 2016-12-16 11:27:47 +0100 |
| commit | 42f27beb63a629dcef514abb0b31dea193f35a38 (patch) | |
| tree | 4fa170ec2779a83c519e86521b46f43f0f16c832 /doc/refman | |
| parent | 0d1438851ba3a0b9f76847abc42f3bf8ad26c4cb (diff) | |
Fix incorrect documentation that prevents successful compilation (bug #5265).
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 1fcc1c0df..21c39de96 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*} |