There is a subtle distinction between infinite and unbounded, ask any mathematician. I certainly do not want an infinite number of items, but I might not want to set a rigid bound. This is the subtle distinction between implementing a list as a static array or a dynamic data structure like a linked list. More than a decade ago one PhD student here scorned LaTeX, and wrote his thesis in MS Word, calling us LaTeX users old-fashioned, stuck-in-the-mud, conservative, etc. There were one or two sniggers when his equation editor stopped working after 128 equation objects were in the file. He phoned the helpline, and they simply told him to split the thesis into smaller chunks, each containing no more than 128 equation objects. Now this was an old version of MS-Word, and the problem may since have bee sorted, but having the limit in the first place is odd, especially given the phrase "Object Link Embedding" used for the implementation method. The phrase suggests an underlying dynamic structure, which clearly wasn't there.
Of course, I might not want infinitely many equations, but I would hesitate to set a fixed upper limit.