We presen t a new model for formulating the classic HLS sub-problems: scheduling, allocation, and binding. The model is unique in its use of data-transfers as the basic entity in syn thesis. A data transfer represents the movement of one instance of data and con tains the operation sourcing the data and all the operations using it. Our model compels the storage architecture of the design to be optimized concurren tly with the execution unit. We ha ve built a high-level syn thesis system, Midas, based on our data transfer model. Midas generates designs with smaller storage and data transfer requirements than other HLS systems.