Define Data Collections used in the spec (#1102)

* Define Data Collections used in the spec

* Define what a collection is and integrate feedback

* Lee editorial updates

---------

Co-authored-by: Lee Byron <lee@leebyron.com>

Author: benjie

spec/Appendix A -- Notation Conventions.md

@@ -214,5 +214,36 @@ Fibonacci(number):
 - Return {Fibonacci(previousNumber)} + {Fibonacci(previousPreviousNumber)}.
 
 Note: Algorithms described in this document are written to be easy to
-understand. Implementers are encouraged to include equivalent but optimized
-implementations.
+understand. Implementers are encouraged to include observably equivalent but
+optimized implementations.
+
+## Data Collections
+
+Algorithms within this specification refer to abstract data collection types to
+express normative structural, uniqueness, and ordering requirements. Temporary
+data collections internal to an algorithm use these types to best describe
+expected behavior, but implementers are encouraged to provide observably
+equivalent but optimized implementations. Implementations may use any data
+structure as long as the expected requirements are met.
+
+**List**
+
+:: A _list_ is an ordered collection of values which may contain duplicates. A
+value added to a list is ordered after existing values.
+
+**Set**
+
+:: A _set_ is a collection of values which must not contain duplicates.
+
+:: An _ordered set_ is a set which has a defined order. A value added to an
+ordered set, which does not already contain that value, is ordered after
+existing values.
+
+**Map**
+
+:: A _map_ is a collection of entries, each of which has a key and value. Each
+entry has a unique key, and can be directly referenced by that key.
+
+:: An _ordered map_ is a map which has a defined order. An entry added to an
+ordered map, which does not have an entry with that key, is ordered after
+existing entries.

spec/GraphQL.md

@@ -88,14 +88,15 @@ algorithm step (e.g. "Let completedResult be the result of calling
 CompleteValue()") is to be interpreted as having at least the same level of
 requirement as the algorithm containing that step.
 
-Conformance requirements expressed as algorithms can be fulfilled by an
-implementation of this specification in any way as long as the perceived result
-is equivalent. Algorithms described in this document are written to be easy to
-understand. Implementers are encouraged to include equivalent but optimized
-implementations.
+Conformance requirements expressed as algorithms and data collections can be
+fulfilled by an implementation of this specification in any way as long as the
+perceived result is equivalent. Algorithms described in this document are
+written to be easy to understand. Implementers are encouraged to include
+equivalent but optimized implementations.
 
 See [Appendix A](#sec-Appendix-Notation-Conventions) for more details about the
-definition of algorithms and other notational conventions used in this document.
+definition of algorithms, data collections, and other notational conventions
+used in this document.
 
 **Non-Normative Portions**