This name would be very confusing. People would think either "heap" or "priority queue" in the textbook form of a heap-ordered binary tree. While your module will appear to do something similar, it doesn't have O(log(n)) performance when dealing with n items with n different priorities. At the very least, it should be stated prominently in the POD that inserting n items with different priorities is O(n^2 log n). I would prefer to see it under a different name.

btw, here's FOLDOC's definition of a heap (sense 2).

/s