A full heap is a labeled infinite partially ordered set with labeling taken from the vertices of an underlying Dynkin diagram  satisfying certain conditions intended to capture the structure of that diagram