Tighten the words we use in "Throughout this [sub]clause" wording

to introduce a set of requirements for template arguments based
on their names, and make these paragraphs consistent.

Author: zygoloid

source/algorithms.tex

@@ -582,41 +582,48 @@
 \pnum
 Throughout this Clause, the names of template parameters
 are used to express type requirements.
-If an algorithm's template parameter is
+\begin{itemize}
+\item
+If an algorithm's template parameter is named
 \tcode{InputIterator},
 \tcode{InputIterator1},
 or
 \tcode{InputIterator2},
-the actual template argument shall satisfy the
+the template argument shall satisfy the
 requirements of an input iterator~(\ref{input.iterators}).
-If an algorithm's template parameter is
+\item
+If an algorithm's template parameter is named
 \tcode{OutputIterator},
 \tcode{OutputIterator1},
 or
 \tcode{OutputIterator2},
-the actual template argument shall satisfy the requirements
+the template argument shall satisfy the requirements
 of an output iterator~(\ref{output.iterators}).
-If an algorithm's template parameter is
+\item
+If an algorithm's template parameter is named
 \tcode{ForwardIterator},
 \tcode{ForwardIterator1},
 or
 \tcode{ForwardIterator2},
-the actual template argument shall satisfy the requirements
+the template argument shall satisfy the requirements
 of a forward iterator~(\ref{forward.iterators}).
-If an algorithm's template parameter is
+\item
+If an algorithm's template parameter is named
 \tcode{BidirectionalIterator},
 \tcode{Bidirectional\-Iterator1},
 or
 \tcode{BidirectionalIterator2},
-the actual template argument shall satisfy the requirements
+the template argument shall satisfy the requirements
 of a bidirectional iterator~(\ref{bidirectional.iterators}).
-If an algorithm's template parameter is
+\item
+If an algorithm's template parameter is named
 \tcode{RandomAccessIterator},
 \tcode{Random\-AccessIterator1},
 or
 \tcode{RandomAccessIterator2},
-the actual template argument shall satisfy the requirements
+the template argument shall satisfy the requirements
 of a random-access iterator~(\ref{random.access.iterators}).
+\end{itemize}
 
 \pnum
 If an algorithm's
@@ -627,7 +634,7 @@
 The type of that argument shall satisfy the requirements
 of a mutable iterator~(\ref{iterator.requirements}).
 \enternote
-This requirement does not affect arguments that are declared as
+This requirement does not affect arguments that are named
 \tcode{OutputIterator},
 \tcode{OutputIterator1},
 or

source/threads.tex

@@ -25,10 +25,8 @@
 \pnum
 Throughout this Clause, the names of template parameters are used to express type
 requirements.
-
-\pnum
-If a parameter is \tcode{Predicate}, \tcode{operator()} applied to the actual template
-argument shall return a value that is convertible to \tcode{bool}.
+If a template parameter is named \tcode{Predicate}, \tcode{operator()} applied to
+the template argument shall return a value that is convertible to \tcode{bool}.
 
 \rSec2[thread.req.exception]{Exceptions}
 

source/utilities.tex

@@ -10269,9 +10269,10 @@
 \tcode{intmax_t}.
 
 \pnum
-Throughout this subclause, if the template argument types \tcode{R1} and
-\tcode{R2} are not specializations of the \tcode{ratio} template, the program is
-ill-formed.
+Throughout this subclause, the names of template parameters are used to express
+type requirements. If a template parameter is named \tcode{R1} or \tcode{R2},
+and the template argument is not a specialization of the \tcode{ratio} template,
+the program is ill-formed.
 
 \rSec2[ratio.syn]{Header \tcode{<ratio>} synopsis}