diff -r a28abe83cf5c Doc/library/functions.rst
--- a/Doc/library/functions.rst	Sat Jul 23 08:43:04 2016 +0300
+++ b/Doc/library/functions.rst	Sun Jul 24 00:14:26 2016 +0800
@@ -763,6 +763,9 @@
    Rather than being a function, :class:`list` is actually a mutable
    sequence type, as documented in :ref:`typesseq-list` and :ref:`typesseq`.
 
+   .. note::
+      The actual name of the parameter *iterable* is *sequence*.
+
 
 .. function:: locals()
 
@@ -1433,6 +1436,9 @@
    Rather than being a function, :class:`tuple` is actually an immutable
    sequence type, as documented in :ref:`typesseq-tuple` and :ref:`typesseq`.
 
+   .. note::
+      The actual name of the parameter *iterable* is *sequence*.
+
 
 .. class:: type(object)
            type(name, bases, dict)
diff -r a28abe83cf5c Doc/library/stdtypes.rst
--- a/Doc/library/stdtypes.rst	Sat Jul 23 08:43:04 2016 +0300
+++ b/Doc/library/stdtypes.rst	Sun Jul 24 00:14:26 2016 +0800
@@ -1149,6 +1149,9 @@
    ``list( (1, 2, 3) )`` returns ``[1, 2, 3]``.
    If no argument is given, the constructor creates a new empty list, ``[]``.
 
+   .. note::
+      The actual name of the parameter *iterable* is *sequence*.
+
 
    Many other operations also produce lists, including the :func:`sorted`
    built-in.
@@ -1237,6 +1240,9 @@
    Tuples implement all of the :ref:`common <typesseq-common>` sequence
    operations.
 
+   .. note::
+      The actual name of the parameter *iterable* is *sequence*.
+
 For heterogeneous collections of data where access by name is clearer than
 access by index, :func:`collections.namedtuple` may be a more appropriate
 choice than a simple tuple object.