@@ -187,8 +187,8 @@ A sort is either a _sort variable_ or a _sort constructor_ applied to a list of
187187 "\top" "{" <sort> "}" "(" ")"
188188 | "\bottom" "{" <sort> "}" "(" ")"
189189 | "\not" "{" <sort> "}" "(" <pattern> ")"
190- | "\and" "{" <sort> "}" "(" <pattern> "," <pattern > ")"
191- | "\or" "{" <sort> "}" "(" <pattern> "," <pattern > ")"
190+ | "\and" "{" <sort> "}" "(" <patterns > ")"
191+ | "\or" "{" <sort> "}" "(" <patterns > ")"
192192 | "\implies" "{" <sort> "}" "(" <pattern> "," <pattern> ")"
193193 | "\iff" "{" <sort> "}" "(" <pattern> "," <pattern> ")"
194194 // Quantifiers
@@ -213,10 +213,10 @@ A sort is either a _sort variable_ or a _sort constructor_ applied to a list of
213213 | "\right-assoc" "{" "}" "(" <application-pattern> ")"
214214```
215215
216- The left-assoc (resp. right-assoc) construct allows a chain of applications of
216+ The ` left-assoc ` (resp. ` right-assoc ` ) construct allows a chain of applications of
217217left associative (resp. right associative) binary symbols to be flattened.
218- For example (simplified) , ` \and(\and (P1, P2), P3)` can be represented as
219- ` \left-assoc(\and (P1, P2, P3)) ` .
218+ For example, ` foo(foo (P1, P2), P3)` can be represented as
219+ ` \left-assoc(foo (P1, P2, P3)) ` .
220220
221221### Attributes
222222
0 commit comments