- From: <bugzilla@jessica.w3.org>
- Date: Fri, 07 Feb 2014 09:48:41 +0000
- To: public-qt-comments@w3.org
https://www.w3.org/Bugs/Public/show_bug.cgi?id=24569 --- Comment #4 from Michael Kay <mike@saxonica.com> --- I just blurted: >then U and V are "equal" in the type graph, that is, they are subtypes of each other which has the implication that the type graph contains a cycle. Is that in itself enough to show that the graph is not a lattice? -- You are receiving this mail because: You are the QA Contact for the bug.
Received on Friday, 7 February 2014 09:48:55 UTC