Îõ³h${f TrustworthyÇ^unique©Unique identifiers are created by creating heap objects in kind # that can be compared for value equality and then hashing them using their initial allocation address.x <- newUniquey <- newUniquez <- newUnique[x == x, y == y, z == z][True,True,True][x == y, y == z, z == x][False,False,False]ÑThe hashes could be same, in theory, but in practice they are different as well.7[ hash x == hash x, hash y == hash y, hash z == hash z][True,True,True]7[ hash x == hash y, hash y == hash z, hash z == hash x][False,False,False]uniqueAllocate a new Í value. The value returned will not compare equal to any other value of type  returned by previous calls to +. There is no limit on the number of times  may be called."unique-0.0.1-Uvm0i9TfsZ9oIDq3EBpmnControl.Concurrent.UniqueUnique newUnique$fHashableUnique $fEqUnique